1 /* Perform type resolution on the various stuctures.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation,
4 Contributed by Andy Vaught
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor,Boston, MA
28 #include "arith.h" /* For gfc_compare_expr(). */
29 #include "dependency.h"
31 /* Types used in equivalence statements. */
35 SEQ_NONDEFAULT, SEQ_NUMERIC, SEQ_CHARACTER, SEQ_MIXED
39 /* Stack to push the current if we descend into a block during
40 resolution. See resolve_branch() and resolve_code(). */
42 typedef struct code_stack
44 struct gfc_code *head, *current;
45 struct code_stack *prev;
49 static code_stack *cs_base = NULL;
52 /* Nonzero if we're inside a FORALL block. */
54 static int forall_flag;
56 /* Nonzero if we're inside a OpenMP WORKSHARE or PARALLEL WORKSHARE block. */
58 static int omp_workshare_flag;
60 /* Nonzero if we are processing a formal arglist. The corresponding function
61 resets the flag each time that it is read. */
62 static int formal_arg_flag = 0;
64 /* True if we are resolving a specification expression. */
65 static int specification_expr = 0;
67 /* The id of the last entry seen. */
68 static int current_entry_id;
71 gfc_is_formal_arg (void)
73 return formal_arg_flag;
76 /* Resolve types of formal argument lists. These have to be done early so that
77 the formal argument lists of module procedures can be copied to the
78 containing module before the individual procedures are resolved
79 individually. We also resolve argument lists of procedures in interface
80 blocks because they are self-contained scoping units.
82 Since a dummy argument cannot be a non-dummy procedure, the only
83 resort left for untyped names are the IMPLICIT types. */
86 resolve_formal_arglist (gfc_symbol * proc)
88 gfc_formal_arglist *f;
92 /* TODO: Procedures whose return character length parameter is not constant
93 or assumed must also have explicit interfaces. */
94 if (proc->result != NULL)
99 if (gfc_elemental (proc)
100 || sym->attr.pointer || sym->attr.allocatable
101 || (sym->as && sym->as->rank > 0))
102 proc->attr.always_explicit = 1;
106 for (f = proc->formal; f; f = f->next)
112 /* Alternate return placeholder. */
113 if (gfc_elemental (proc))
114 gfc_error ("Alternate return specifier in elemental subroutine "
115 "'%s' at %L is not allowed", proc->name,
117 if (proc->attr.function)
118 gfc_error ("Alternate return specifier in function "
119 "'%s' at %L is not allowed", proc->name,
124 if (sym->attr.if_source != IFSRC_UNKNOWN)
125 resolve_formal_arglist (sym);
127 if (sym->attr.subroutine || sym->attr.external || sym->attr.intrinsic)
129 if (gfc_pure (proc) && !gfc_pure (sym))
132 ("Dummy procedure '%s' of PURE procedure at %L must also "
133 "be PURE", sym->name, &sym->declared_at);
137 if (gfc_elemental (proc))
140 ("Dummy procedure at %L not allowed in ELEMENTAL procedure",
148 if (sym->ts.type == BT_UNKNOWN)
150 if (!sym->attr.function || sym->result == sym)
151 gfc_set_default_type (sym, 1, sym->ns);
154 gfc_resolve_array_spec (sym->as, 0);
156 /* We can't tell if an array with dimension (:) is assumed or deferred
157 shape until we know if it has the pointer or allocatable attributes.
159 if (sym->as && sym->as->rank > 0 && sym->as->type == AS_DEFERRED
160 && !(sym->attr.pointer || sym->attr.allocatable))
162 sym->as->type = AS_ASSUMED_SHAPE;
163 for (i = 0; i < sym->as->rank; i++)
164 sym->as->lower[i] = gfc_int_expr (1);
167 if ((sym->as && sym->as->rank > 0 && sym->as->type == AS_ASSUMED_SHAPE)
168 || sym->attr.pointer || sym->attr.allocatable || sym->attr.target
169 || sym->attr.optional)
170 proc->attr.always_explicit = 1;
172 /* If the flavor is unknown at this point, it has to be a variable.
173 A procedure specification would have already set the type. */
175 if (sym->attr.flavor == FL_UNKNOWN)
176 gfc_add_flavor (&sym->attr, FL_VARIABLE, sym->name, &sym->declared_at);
180 if (proc->attr.function && !sym->attr.pointer
181 && sym->attr.flavor != FL_PROCEDURE
182 && sym->attr.intent != INTENT_IN)
184 gfc_error ("Argument '%s' of pure function '%s' at %L must be "
185 "INTENT(IN)", sym->name, proc->name,
188 if (proc->attr.subroutine && !sym->attr.pointer
189 && sym->attr.intent == INTENT_UNKNOWN)
192 ("Argument '%s' of pure subroutine '%s' at %L must have "
193 "its INTENT specified", sym->name, proc->name,
198 if (gfc_elemental (proc))
203 ("Argument '%s' of elemental procedure at %L must be scalar",
204 sym->name, &sym->declared_at);
208 if (sym->attr.pointer)
211 ("Argument '%s' of elemental procedure at %L cannot have "
212 "the POINTER attribute", sym->name, &sym->declared_at);
217 /* Each dummy shall be specified to be scalar. */
218 if (proc->attr.proc == PROC_ST_FUNCTION)
223 ("Argument '%s' of statement function at %L must be scalar",
224 sym->name, &sym->declared_at);
228 if (sym->ts.type == BT_CHARACTER)
230 gfc_charlen *cl = sym->ts.cl;
231 if (!cl || !cl->length || cl->length->expr_type != EXPR_CONSTANT)
234 ("Character-valued argument '%s' of statement function at "
235 "%L must has constant length",
236 sym->name, &sym->declared_at);
246 /* Work function called when searching for symbols that have argument lists
247 associated with them. */
250 find_arglists (gfc_symbol * sym)
253 if (sym->attr.if_source == IFSRC_UNKNOWN || sym->ns != gfc_current_ns)
256 resolve_formal_arglist (sym);
260 /* Given a namespace, resolve all formal argument lists within the namespace.
264 resolve_formal_arglists (gfc_namespace * ns)
270 gfc_traverse_ns (ns, find_arglists);
275 resolve_contained_fntype (gfc_symbol * sym, gfc_namespace * ns)
279 /* If this namespace is not a function, ignore it. */
281 || !(sym->attr.function
282 || sym->attr.flavor == FL_VARIABLE))
285 /* Try to find out of what the return type is. */
286 if (sym->result != NULL)
289 if (sym->ts.type == BT_UNKNOWN)
291 t = gfc_set_default_type (sym, 0, ns);
293 if (t == FAILURE && !sym->attr.untyped)
295 gfc_error ("Contained function '%s' at %L has no IMPLICIT type",
296 sym->name, &sym->declared_at); /* FIXME */
297 sym->attr.untyped = 1;
301 /*Fortran 95 Draft Standard, page 51, Section 5.1.1.5, on the Character type,
302 lists the only ways a character length value of * can be used: dummy arguments
303 of procedures, named constants, and function results in external functions.
304 Internal function results are not on that list; ergo, not permitted. */
306 if (sym->ts.type == BT_CHARACTER)
308 gfc_charlen *cl = sym->ts.cl;
309 if (!cl || !cl->length)
310 gfc_error ("Character-valued internal function '%s' at %L must "
311 "not be assumed length", sym->name, &sym->declared_at);
316 /* Add NEW_ARGS to the formal argument list of PROC, taking care not to
317 introduce duplicates. */
320 merge_argument_lists (gfc_symbol *proc, gfc_formal_arglist *new_args)
322 gfc_formal_arglist *f, *new_arglist;
325 for (; new_args != NULL; new_args = new_args->next)
327 new_sym = new_args->sym;
328 /* See if ths arg is already in the formal argument list. */
329 for (f = proc->formal; f; f = f->next)
331 if (new_sym == f->sym)
338 /* Add a new argument. Argument order is not important. */
339 new_arglist = gfc_get_formal_arglist ();
340 new_arglist->sym = new_sym;
341 new_arglist->next = proc->formal;
342 proc->formal = new_arglist;
347 /* Resolve alternate entry points. If a symbol has multiple entry points we
348 create a new master symbol for the main routine, and turn the existing
349 symbol into an entry point. */
352 resolve_entries (gfc_namespace * ns)
354 gfc_namespace *old_ns;
358 char name[GFC_MAX_SYMBOL_LEN + 1];
359 static int master_count = 0;
361 if (ns->proc_name == NULL)
364 /* No need to do anything if this procedure doesn't have alternate entry
369 /* We may already have resolved alternate entry points. */
370 if (ns->proc_name->attr.entry_master)
373 /* If this isn't a procedure something has gone horribly wrong. */
374 gcc_assert (ns->proc_name->attr.flavor == FL_PROCEDURE);
376 /* Remember the current namespace. */
377 old_ns = gfc_current_ns;
381 /* Add the main entry point to the list of entry points. */
382 el = gfc_get_entry_list ();
383 el->sym = ns->proc_name;
385 el->next = ns->entries;
387 ns->proc_name->attr.entry = 1;
389 /* If it is a module function, it needs to be in the right namespace
390 so that gfc_get_fake_result_decl can gather up the results. The
391 need for this arose in get_proc_name, where these beasts were
392 left in their own namespace, to keep prior references linked to
393 the entry declaration.*/
394 if (ns->proc_name->attr.function
396 && ns->parent->proc_name->attr.flavor == FL_MODULE)
399 /* Add an entry statement for it. */
406 /* Create a new symbol for the master function. */
407 /* Give the internal function a unique name (within this file).
408 Also include the function name so the user has some hope of figuring
409 out what is going on. */
410 snprintf (name, GFC_MAX_SYMBOL_LEN, "master.%d.%s",
411 master_count++, ns->proc_name->name);
412 gfc_get_ha_symbol (name, &proc);
413 gcc_assert (proc != NULL);
415 gfc_add_procedure (&proc->attr, PROC_INTERNAL, proc->name, NULL);
416 if (ns->proc_name->attr.subroutine)
417 gfc_add_subroutine (&proc->attr, proc->name, NULL);
421 gfc_typespec *ts, *fts;
423 gfc_add_function (&proc->attr, proc->name, NULL);
425 fts = &ns->entries->sym->result->ts;
426 if (fts->type == BT_UNKNOWN)
427 fts = gfc_get_default_type (ns->entries->sym->result, NULL);
428 for (el = ns->entries->next; el; el = el->next)
430 ts = &el->sym->result->ts;
431 if (ts->type == BT_UNKNOWN)
432 ts = gfc_get_default_type (el->sym->result, NULL);
433 if (! gfc_compare_types (ts, fts)
434 || (el->sym->result->attr.dimension
435 != ns->entries->sym->result->attr.dimension)
436 || (el->sym->result->attr.pointer
437 != ns->entries->sym->result->attr.pointer))
443 sym = ns->entries->sym->result;
444 /* All result types the same. */
446 if (sym->attr.dimension)
447 gfc_set_array_spec (proc, gfc_copy_array_spec (sym->as), NULL);
448 if (sym->attr.pointer)
449 gfc_add_pointer (&proc->attr, NULL);
453 /* Otherwise the result will be passed through a union by
455 proc->attr.mixed_entry_master = 1;
456 for (el = ns->entries; el; el = el->next)
458 sym = el->sym->result;
459 if (sym->attr.dimension)
461 if (el == ns->entries)
463 ("FUNCTION result %s can't be an array in FUNCTION %s at %L",
464 sym->name, ns->entries->sym->name, &sym->declared_at);
467 ("ENTRY result %s can't be an array in FUNCTION %s at %L",
468 sym->name, ns->entries->sym->name, &sym->declared_at);
470 else if (sym->attr.pointer)
472 if (el == ns->entries)
474 ("FUNCTION result %s can't be a POINTER in FUNCTION %s at %L",
475 sym->name, ns->entries->sym->name, &sym->declared_at);
478 ("ENTRY result %s can't be a POINTER in FUNCTION %s at %L",
479 sym->name, ns->entries->sym->name, &sym->declared_at);
484 if (ts->type == BT_UNKNOWN)
485 ts = gfc_get_default_type (sym, NULL);
489 if (ts->kind == gfc_default_integer_kind)
493 if (ts->kind == gfc_default_real_kind
494 || ts->kind == gfc_default_double_kind)
498 if (ts->kind == gfc_default_complex_kind)
502 if (ts->kind == gfc_default_logical_kind)
506 /* We will issue error elsewhere. */
514 if (el == ns->entries)
516 ("FUNCTION result %s can't be of type %s in FUNCTION %s at %L",
517 sym->name, gfc_typename (ts), ns->entries->sym->name,
521 ("ENTRY result %s can't be of type %s in FUNCTION %s at %L",
522 sym->name, gfc_typename (ts), ns->entries->sym->name,
529 proc->attr.access = ACCESS_PRIVATE;
530 proc->attr.entry_master = 1;
532 /* Merge all the entry point arguments. */
533 for (el = ns->entries; el; el = el->next)
534 merge_argument_lists (proc, el->sym->formal);
536 /* Use the master function for the function body. */
537 ns->proc_name = proc;
539 /* Finalize the new symbols. */
540 gfc_commit_symbols ();
542 /* Restore the original namespace. */
543 gfc_current_ns = old_ns;
547 /* Resolve contained function types. Because contained functions can call one
548 another, they have to be worked out before any of the contained procedures
551 The good news is that if a function doesn't already have a type, the only
552 way it can get one is through an IMPLICIT type or a RESULT variable, because
553 by definition contained functions are contained namespace they're contained
554 in, not in a sibling or parent namespace. */
557 resolve_contained_functions (gfc_namespace * ns)
559 gfc_namespace *child;
562 resolve_formal_arglists (ns);
564 for (child = ns->contained; child; child = child->sibling)
566 /* Resolve alternate entry points first. */
567 resolve_entries (child);
569 /* Then check function return types. */
570 resolve_contained_fntype (child->proc_name, child);
571 for (el = child->entries; el; el = el->next)
572 resolve_contained_fntype (el->sym, child);
577 /* Resolve all of the elements of a structure constructor and make sure that
578 the types are correct. */
581 resolve_structure_cons (gfc_expr * expr)
583 gfc_constructor *cons;
588 cons = expr->value.constructor;
589 /* A constructor may have references if it is the result of substituting a
590 parameter variable. In this case we just pull out the component we
593 comp = expr->ref->u.c.sym->components;
595 comp = expr->ts.derived->components;
597 for (; comp; comp = comp->next, cons = cons->next)
605 if (gfc_resolve_expr (cons->expr) == FAILURE)
611 /* If we don't have the right type, try to convert it. */
613 if (!gfc_compare_types (&cons->expr->ts, &comp->ts))
616 if (comp->pointer && cons->expr->ts.type != BT_UNKNOWN)
617 gfc_error ("The element in the derived type constructor at %L, "
618 "for pointer component '%s', is %s but should be %s",
619 &cons->expr->where, comp->name,
620 gfc_basic_typename (cons->expr->ts.type),
621 gfc_basic_typename (comp->ts.type));
623 t = gfc_convert_type (cons->expr, &comp->ts, 1);
632 /****************** Expression name resolution ******************/
634 /* Returns 0 if a symbol was not declared with a type or
635 attribute declaration statement, nonzero otherwise. */
638 was_declared (gfc_symbol * sym)
644 if (!a.implicit_type && sym->ts.type != BT_UNKNOWN)
647 if (a.allocatable || a.dimension || a.dummy || a.external || a.intrinsic
648 || a.optional || a.pointer || a.save || a.target
649 || a.access != ACCESS_UNKNOWN || a.intent != INTENT_UNKNOWN)
656 /* Determine if a symbol is generic or not. */
659 generic_sym (gfc_symbol * sym)
663 if (sym->attr.generic ||
664 (sym->attr.intrinsic && gfc_generic_intrinsic (sym->name)))
667 if (was_declared (sym) || sym->ns->parent == NULL)
670 gfc_find_symbol (sym->name, sym->ns->parent, 1, &s);
672 return (s == NULL) ? 0 : generic_sym (s);
676 /* Determine if a symbol is specific or not. */
679 specific_sym (gfc_symbol * sym)
683 if (sym->attr.if_source == IFSRC_IFBODY
684 || sym->attr.proc == PROC_MODULE
685 || sym->attr.proc == PROC_INTERNAL
686 || sym->attr.proc == PROC_ST_FUNCTION
687 || (sym->attr.intrinsic &&
688 gfc_specific_intrinsic (sym->name))
689 || sym->attr.external)
692 if (was_declared (sym) || sym->ns->parent == NULL)
695 gfc_find_symbol (sym->name, sym->ns->parent, 1, &s);
697 return (s == NULL) ? 0 : specific_sym (s);
701 /* Figure out if the procedure is specific, generic or unknown. */
704 { PTYPE_GENERIC = 1, PTYPE_SPECIFIC, PTYPE_UNKNOWN }
708 procedure_kind (gfc_symbol * sym)
711 if (generic_sym (sym))
712 return PTYPE_GENERIC;
714 if (specific_sym (sym))
715 return PTYPE_SPECIFIC;
717 return PTYPE_UNKNOWN;
720 /* Check references to assumed size arrays. The flag need_full_assumed_size
721 is nonzero when matching actual arguments. */
723 static int need_full_assumed_size = 0;
726 check_assumed_size_reference (gfc_symbol * sym, gfc_expr * e)
732 if (need_full_assumed_size
733 || !(sym->as && sym->as->type == AS_ASSUMED_SIZE))
736 for (ref = e->ref; ref; ref = ref->next)
737 if (ref->type == REF_ARRAY)
738 for (dim = 0; dim < ref->u.ar.as->rank; dim++)
739 last = (ref->u.ar.end[dim] == NULL) && (ref->u.ar.type == DIMEN_ELEMENT);
743 gfc_error ("The upper bound in the last dimension must "
744 "appear in the reference to the assumed size "
745 "array '%s' at %L.", sym->name, &e->where);
752 /* Look for bad assumed size array references in argument expressions
753 of elemental and array valued intrinsic procedures. Since this is
754 called from procedure resolution functions, it only recurses at
758 resolve_assumed_size_actual (gfc_expr *e)
763 switch (e->expr_type)
767 && check_assumed_size_reference (e->symtree->n.sym, e))
772 if (resolve_assumed_size_actual (e->value.op.op1)
773 || resolve_assumed_size_actual (e->value.op.op2))
784 /* Resolve an actual argument list. Most of the time, this is just
785 resolving the expressions in the list.
786 The exception is that we sometimes have to decide whether arguments
787 that look like procedure arguments are really simple variable
791 resolve_actual_arglist (gfc_actual_arglist * arg)
794 gfc_symtree *parent_st;
797 for (; arg; arg = arg->next)
803 /* Check the label is a valid branching target. */
806 if (arg->label->defined == ST_LABEL_UNKNOWN)
808 gfc_error ("Label %d referenced at %L is never defined",
809 arg->label->value, &arg->label->where);
816 if (e->ts.type != BT_PROCEDURE)
818 if (gfc_resolve_expr (e) != SUCCESS)
823 /* See if the expression node should really be a variable
826 sym = e->symtree->n.sym;
828 if (sym->attr.flavor == FL_PROCEDURE
829 || sym->attr.intrinsic
830 || sym->attr.external)
833 /* If a procedure is not already determined to be something else
834 check if it is intrinsic. */
835 if (!sym->attr.intrinsic
836 && !(sym->attr.external || sym->attr.use_assoc
837 || sym->attr.if_source == IFSRC_IFBODY)
838 && gfc_intrinsic_name (sym->name, sym->attr.subroutine))
839 sym->attr.intrinsic = 1;
841 if (sym->attr.proc == PROC_ST_FUNCTION)
843 gfc_error ("Statement function '%s' at %L is not allowed as an "
844 "actual argument", sym->name, &e->where);
847 if (sym->attr.contained && !sym->attr.use_assoc
848 && sym->ns->proc_name->attr.flavor != FL_MODULE)
850 gfc_error ("Internal procedure '%s' is not allowed as an "
851 "actual argument at %L", sym->name, &e->where);
854 if (sym->attr.elemental && !sym->attr.intrinsic)
856 gfc_error ("ELEMENTAL non-INTRINSIC procedure '%s' is not "
857 "allowed as an actual argument at %L", sym->name,
861 if (sym->attr.generic)
863 gfc_error ("GENERIC non-INTRINSIC procedure '%s' is not "
864 "allowed as an actual argument at %L", sym->name,
868 /* If the symbol is the function that names the current (or
869 parent) scope, then we really have a variable reference. */
871 if (sym->attr.function && sym->result == sym
872 && (sym->ns->proc_name == sym
873 || (sym->ns->parent != NULL
874 && sym->ns->parent->proc_name == sym)))
880 /* See if the name is a module procedure in a parent unit. */
882 if (was_declared (sym) || sym->ns->parent == NULL)
885 if (gfc_find_sym_tree (sym->name, sym->ns->parent, 1, &parent_st))
887 gfc_error ("Symbol '%s' at %L is ambiguous", sym->name, &e->where);
891 if (parent_st == NULL)
894 sym = parent_st->n.sym;
895 e->symtree = parent_st; /* Point to the right thing. */
897 if (sym->attr.flavor == FL_PROCEDURE
898 || sym->attr.intrinsic
899 || sym->attr.external)
905 e->expr_type = EXPR_VARIABLE;
909 e->rank = sym->as->rank;
910 e->ref = gfc_get_ref ();
911 e->ref->type = REF_ARRAY;
912 e->ref->u.ar.type = AR_FULL;
913 e->ref->u.ar.as = sym->as;
921 /* Do the checks of the actual argument list that are specific to elemental
922 procedures. If called with c == NULL, we have a function, otherwise if
923 expr == NULL, we have a subroutine. */
925 resolve_elemental_actual (gfc_expr *expr, gfc_code *c)
927 gfc_actual_arglist *arg0;
928 gfc_actual_arglist *arg;
929 gfc_symbol *esym = NULL;
930 gfc_intrinsic_sym *isym = NULL;
932 gfc_intrinsic_arg *iformal = NULL;
933 gfc_formal_arglist *eformal = NULL;
934 bool formal_optional = false;
935 bool set_by_optional = false;
939 /* Is this an elemental procedure? */
940 if (expr && expr->value.function.actual != NULL)
942 if (expr->value.function.esym != NULL
943 && expr->value.function.esym->attr.elemental)
945 arg0 = expr->value.function.actual;
946 esym = expr->value.function.esym;
948 else if (expr->value.function.isym != NULL
949 && expr->value.function.isym->elemental)
951 arg0 = expr->value.function.actual;
952 isym = expr->value.function.isym;
957 else if (c && c->ext.actual != NULL
958 && c->symtree->n.sym->attr.elemental)
960 arg0 = c->ext.actual;
961 esym = c->symtree->n.sym;
966 /* The rank of an elemental is the rank of its array argument(s). */
967 for (arg = arg0; arg; arg = arg->next)
969 if (arg->expr != NULL && arg->expr->rank > 0)
971 rank = arg->expr->rank;
972 if (arg->expr->expr_type == EXPR_VARIABLE
973 && arg->expr->symtree->n.sym->attr.optional)
974 set_by_optional = true;
976 /* Function specific; set the result rank and shape. */
980 if (!expr->shape && arg->expr->shape)
982 expr->shape = gfc_get_shape (rank);
983 for (i = 0; i < rank; i++)
984 mpz_init_set (expr->shape[i], arg->expr->shape[i]);
991 /* If it is an array, it shall not be supplied as an actual argument
992 to an elemental procedure unless an array of the same rank is supplied
993 as an actual argument corresponding to a nonoptional dummy argument of
994 that elemental procedure(12.4.1.5). */
995 formal_optional = false;
997 iformal = isym->formal;
999 eformal = esym->formal;
1001 for (arg = arg0; arg; arg = arg->next)
1005 if (eformal->sym && eformal->sym->attr.optional)
1006 formal_optional = true;
1007 eformal = eformal->next;
1009 else if (isym && iformal)
1011 if (iformal->optional)
1012 formal_optional = true;
1013 iformal = iformal->next;
1016 formal_optional = true;
1018 if (pedantic && arg->expr != NULL
1019 && arg->expr->expr_type == EXPR_VARIABLE
1020 && arg->expr->symtree->n.sym->attr.optional
1023 && (set_by_optional || arg->expr->rank != rank)
1024 && !(isym && isym->generic_id == GFC_ISYM_CONVERSION))
1026 gfc_warning ("'%s' at %L is an array and OPTIONAL; IF IT IS "
1027 "MISSING, it cannot be the actual argument of an "
1028 "ELEMENTAL procedure unless there is a non-optional"
1029 "argument with the same rank (12.4.1.5)",
1030 arg->expr->symtree->n.sym->name, &arg->expr->where);
1035 for (arg = arg0; arg; arg = arg->next)
1037 if (arg->expr == NULL || arg->expr->rank == 0)
1040 /* Being elemental, the last upper bound of an assumed size array
1041 argument must be present. */
1042 if (resolve_assumed_size_actual (arg->expr))
1048 /* Elemental subroutine array actual arguments must conform. */
1051 if (gfc_check_conformance ("elemental subroutine", arg->expr, e)
1063 /* Go through each actual argument in ACTUAL and see if it can be
1064 implemented as an inlined, non-copying intrinsic. FNSYM is the
1065 function being called, or NULL if not known. */
1068 find_noncopying_intrinsics (gfc_symbol * fnsym, gfc_actual_arglist * actual)
1070 gfc_actual_arglist *ap;
1073 for (ap = actual; ap; ap = ap->next)
1075 && (expr = gfc_get_noncopying_intrinsic_argument (ap->expr))
1076 && !gfc_check_fncall_dependency (expr, INTENT_IN, fnsym, actual))
1077 ap->expr->inline_noncopying_intrinsic = 1;
1080 /* This function does the checking of references to global procedures
1081 as defined in sections 18.1 and 14.1, respectively, of the Fortran
1082 77 and 95 standards. It checks for a gsymbol for the name, making
1083 one if it does not already exist. If it already exists, then the
1084 reference being resolved must correspond to the type of gsymbol.
1085 Otherwise, the new symbol is equipped with the attributes of the
1086 reference. The corresponding code that is called in creating
1087 global entities is parse.c. */
1090 resolve_global_procedure (gfc_symbol *sym, locus *where, int sub)
1095 type = sub ? GSYM_SUBROUTINE : GSYM_FUNCTION;
1097 gsym = gfc_get_gsymbol (sym->name);
1099 if ((gsym->type != GSYM_UNKNOWN && gsym->type != type))
1100 global_used (gsym, where);
1102 if (gsym->type == GSYM_UNKNOWN)
1105 gsym->where = *where;
1111 /************* Function resolution *************/
1113 /* Resolve a function call known to be generic.
1114 Section 14.1.2.4.1. */
1117 resolve_generic_f0 (gfc_expr * expr, gfc_symbol * sym)
1121 if (sym->attr.generic)
1124 gfc_search_interface (sym->generic, 0, &expr->value.function.actual);
1127 expr->value.function.name = s->name;
1128 expr->value.function.esym = s;
1130 if (s->ts.type != BT_UNKNOWN)
1132 else if (s->result != NULL && s->result->ts.type != BT_UNKNOWN)
1133 expr->ts = s->result->ts;
1136 expr->rank = s->as->rank;
1137 else if (s->result != NULL && s->result->as != NULL)
1138 expr->rank = s->result->as->rank;
1143 /* TODO: Need to search for elemental references in generic interface */
1146 if (sym->attr.intrinsic)
1147 return gfc_intrinsic_func_interface (expr, 0);
1154 resolve_generic_f (gfc_expr * expr)
1159 sym = expr->symtree->n.sym;
1163 m = resolve_generic_f0 (expr, sym);
1166 else if (m == MATCH_ERROR)
1170 if (sym->ns->parent == NULL)
1172 gfc_find_symbol (sym->name, sym->ns->parent, 1, &sym);
1176 if (!generic_sym (sym))
1180 /* Last ditch attempt. */
1182 if (!gfc_generic_intrinsic (expr->symtree->n.sym->name))
1184 gfc_error ("There is no specific function for the generic '%s' at %L",
1185 expr->symtree->n.sym->name, &expr->where);
1189 m = gfc_intrinsic_func_interface (expr, 0);
1194 ("Generic function '%s' at %L is not consistent with a specific "
1195 "intrinsic interface", expr->symtree->n.sym->name, &expr->where);
1201 /* Resolve a function call known to be specific. */
1204 resolve_specific_f0 (gfc_symbol * sym, gfc_expr * expr)
1208 if (sym->attr.external || sym->attr.if_source == IFSRC_IFBODY)
1210 if (sym->attr.dummy)
1212 sym->attr.proc = PROC_DUMMY;
1216 sym->attr.proc = PROC_EXTERNAL;
1220 if (sym->attr.proc == PROC_MODULE
1221 || sym->attr.proc == PROC_ST_FUNCTION
1222 || sym->attr.proc == PROC_INTERNAL)
1225 if (sym->attr.intrinsic)
1227 m = gfc_intrinsic_func_interface (expr, 1);
1232 ("Function '%s' at %L is INTRINSIC but is not compatible with "
1233 "an intrinsic", sym->name, &expr->where);
1241 gfc_procedure_use (sym, &expr->value.function.actual, &expr->where);
1244 expr->value.function.name = sym->name;
1245 expr->value.function.esym = sym;
1246 if (sym->as != NULL)
1247 expr->rank = sym->as->rank;
1254 resolve_specific_f (gfc_expr * expr)
1259 sym = expr->symtree->n.sym;
1263 m = resolve_specific_f0 (sym, expr);
1266 if (m == MATCH_ERROR)
1269 if (sym->ns->parent == NULL)
1272 gfc_find_symbol (sym->name, sym->ns->parent, 1, &sym);
1278 gfc_error ("Unable to resolve the specific function '%s' at %L",
1279 expr->symtree->n.sym->name, &expr->where);
1285 /* Resolve a procedure call not known to be generic nor specific. */
1288 resolve_unknown_f (gfc_expr * expr)
1293 sym = expr->symtree->n.sym;
1295 if (sym->attr.dummy)
1297 sym->attr.proc = PROC_DUMMY;
1298 expr->value.function.name = sym->name;
1302 /* See if we have an intrinsic function reference. */
1304 if (gfc_intrinsic_name (sym->name, 0))
1306 if (gfc_intrinsic_func_interface (expr, 1) == MATCH_YES)
1311 /* The reference is to an external name. */
1313 sym->attr.proc = PROC_EXTERNAL;
1314 expr->value.function.name = sym->name;
1315 expr->value.function.esym = expr->symtree->n.sym;
1317 if (sym->as != NULL)
1318 expr->rank = sym->as->rank;
1320 /* Type of the expression is either the type of the symbol or the
1321 default type of the symbol. */
1324 gfc_procedure_use (sym, &expr->value.function.actual, &expr->where);
1326 if (sym->ts.type != BT_UNKNOWN)
1330 ts = gfc_get_default_type (sym, sym->ns);
1332 if (ts->type == BT_UNKNOWN)
1334 gfc_error ("Function '%s' at %L has no IMPLICIT type",
1335 sym->name, &expr->where);
1346 /* Figure out if a function reference is pure or not. Also set the name
1347 of the function for a potential error message. Return nonzero if the
1348 function is PURE, zero if not. */
1351 pure_function (gfc_expr * e, const char **name)
1355 if (e->value.function.esym)
1357 pure = gfc_pure (e->value.function.esym);
1358 *name = e->value.function.esym->name;
1360 else if (e->value.function.isym)
1362 pure = e->value.function.isym->pure
1363 || e->value.function.isym->elemental;
1364 *name = e->value.function.isym->name;
1368 /* Implicit functions are not pure. */
1370 *name = e->value.function.name;
1377 /* Resolve a function call, which means resolving the arguments, then figuring
1378 out which entity the name refers to. */
1379 /* TODO: Check procedure arguments so that an INTENT(IN) isn't passed
1380 to INTENT(OUT) or INTENT(INOUT). */
1383 resolve_function (gfc_expr * expr)
1385 gfc_actual_arglist *arg;
1393 sym = expr->symtree->n.sym;
1395 /* If the procedure is not internal, a statement function or a module
1396 procedure,it must be external and should be checked for usage. */
1397 if (sym && !sym->attr.dummy && !sym->attr.contained
1398 && sym->attr.proc != PROC_ST_FUNCTION
1399 && !sym->attr.use_assoc)
1400 resolve_global_procedure (sym, &expr->where, 0);
1402 /* Switch off assumed size checking and do this again for certain kinds
1403 of procedure, once the procedure itself is resolved. */
1404 need_full_assumed_size++;
1406 if (resolve_actual_arglist (expr->value.function.actual) == FAILURE)
1409 /* Resume assumed_size checking. */
1410 need_full_assumed_size--;
1412 if (sym && sym->ts.type == BT_CHARACTER
1414 && sym->ts.cl->length == NULL
1416 && !sym->attr.contained)
1418 /* Internal procedures are taken care of in resolve_contained_fntype. */
1419 gfc_error ("Function '%s' is declared CHARACTER(*) and cannot "
1420 "be used at %L since it is not a dummy argument",
1421 sym->name, &expr->where);
1425 /* See if function is already resolved. */
1427 if (expr->value.function.name != NULL)
1429 if (expr->ts.type == BT_UNKNOWN)
1435 /* Apply the rules of section 14.1.2. */
1437 switch (procedure_kind (sym))
1440 t = resolve_generic_f (expr);
1443 case PTYPE_SPECIFIC:
1444 t = resolve_specific_f (expr);
1448 t = resolve_unknown_f (expr);
1452 gfc_internal_error ("resolve_function(): bad function type");
1456 /* If the expression is still a function (it might have simplified),
1457 then we check to see if we are calling an elemental function. */
1459 if (expr->expr_type != EXPR_FUNCTION)
1462 temp = need_full_assumed_size;
1463 need_full_assumed_size = 0;
1465 if (resolve_elemental_actual (expr, NULL) == FAILURE)
1468 if (omp_workshare_flag
1469 && expr->value.function.esym
1470 && ! gfc_elemental (expr->value.function.esym))
1472 gfc_error ("User defined non-ELEMENTAL function '%s' at %L not allowed"
1473 " in WORKSHARE construct", expr->value.function.esym->name,
1478 else if (expr->value.function.actual != NULL
1479 && expr->value.function.isym != NULL
1480 && expr->value.function.isym->generic_id != GFC_ISYM_LBOUND
1481 && expr->value.function.isym->generic_id != GFC_ISYM_LOC
1482 && expr->value.function.isym->generic_id != GFC_ISYM_PRESENT)
1484 /* Array instrinsics must also have the last upper bound of an
1485 assumed size array argument. UBOUND and SIZE have to be
1486 excluded from the check if the second argument is anything
1489 inquiry = expr->value.function.isym->generic_id == GFC_ISYM_UBOUND
1490 || expr->value.function.isym->generic_id == GFC_ISYM_SIZE;
1492 for (arg = expr->value.function.actual; arg; arg = arg->next)
1494 if (inquiry && arg->next != NULL && arg->next->expr
1495 && arg->next->expr->expr_type != EXPR_CONSTANT)
1498 if (arg->expr != NULL
1499 && arg->expr->rank > 0
1500 && resolve_assumed_size_actual (arg->expr))
1505 need_full_assumed_size = temp;
1507 if (!pure_function (expr, &name) && name)
1512 ("reference to non-PURE function '%s' at %L inside a "
1513 "FORALL %s", name, &expr->where, forall_flag == 2 ?
1517 else if (gfc_pure (NULL))
1519 gfc_error ("Function reference to '%s' at %L is to a non-PURE "
1520 "procedure within a PURE procedure", name, &expr->where);
1525 /* Functions without the RECURSIVE attribution are not allowed to
1526 * call themselves. */
1527 if (expr->value.function.esym && !expr->value.function.esym->attr.recursive)
1529 gfc_symbol *esym, *proc;
1530 esym = expr->value.function.esym;
1531 proc = gfc_current_ns->proc_name;
1534 gfc_error ("Function '%s' at %L cannot call itself, as it is not "
1535 "RECURSIVE", name, &expr->where);
1539 if (esym->attr.entry && esym->ns->entries && proc->ns->entries
1540 && esym->ns->entries->sym == proc->ns->entries->sym)
1542 gfc_error ("Call to ENTRY '%s' at %L is recursive, but function "
1543 "'%s' is not declared as RECURSIVE",
1544 esym->name, &expr->where, esym->ns->entries->sym->name);
1549 /* Character lengths of use associated functions may contains references to
1550 symbols not referenced from the current program unit otherwise. Make sure
1551 those symbols are marked as referenced. */
1553 if (expr->ts.type == BT_CHARACTER && expr->value.function.esym
1554 && expr->value.function.esym->attr.use_assoc)
1556 gfc_expr_set_symbols_referenced (expr->ts.cl->length);
1560 find_noncopying_intrinsics (expr->value.function.esym,
1561 expr->value.function.actual);
1566 /************* Subroutine resolution *************/
1569 pure_subroutine (gfc_code * c, gfc_symbol * sym)
1576 gfc_error ("Subroutine call to '%s' in FORALL block at %L is not PURE",
1577 sym->name, &c->loc);
1578 else if (gfc_pure (NULL))
1579 gfc_error ("Subroutine call to '%s' at %L is not PURE", sym->name,
1585 resolve_generic_s0 (gfc_code * c, gfc_symbol * sym)
1589 if (sym->attr.generic)
1591 s = gfc_search_interface (sym->generic, 1, &c->ext.actual);
1594 c->resolved_sym = s;
1595 pure_subroutine (c, s);
1599 /* TODO: Need to search for elemental references in generic interface. */
1602 if (sym->attr.intrinsic)
1603 return gfc_intrinsic_sub_interface (c, 0);
1610 resolve_generic_s (gfc_code * c)
1615 sym = c->symtree->n.sym;
1619 m = resolve_generic_s0 (c, sym);
1622 else if (m == MATCH_ERROR)
1626 if (sym->ns->parent == NULL)
1628 gfc_find_symbol (sym->name, sym->ns->parent, 1, &sym);
1632 if (!generic_sym (sym))
1636 /* Last ditch attempt. */
1637 sym = c->symtree->n.sym;
1638 if (!gfc_generic_intrinsic (sym->name))
1641 ("There is no specific subroutine for the generic '%s' at %L",
1642 sym->name, &c->loc);
1646 m = gfc_intrinsic_sub_interface (c, 0);
1650 gfc_error ("Generic subroutine '%s' at %L is not consistent with an "
1651 "intrinsic subroutine interface", sym->name, &c->loc);
1657 /* Resolve a subroutine call known to be specific. */
1660 resolve_specific_s0 (gfc_code * c, gfc_symbol * sym)
1664 if (sym->attr.external || sym->attr.if_source == IFSRC_IFBODY)
1666 if (sym->attr.dummy)
1668 sym->attr.proc = PROC_DUMMY;
1672 sym->attr.proc = PROC_EXTERNAL;
1676 if (sym->attr.proc == PROC_MODULE || sym->attr.proc == PROC_INTERNAL)
1679 if (sym->attr.intrinsic)
1681 m = gfc_intrinsic_sub_interface (c, 1);
1685 gfc_error ("Subroutine '%s' at %L is INTRINSIC but is not compatible "
1686 "with an intrinsic", sym->name, &c->loc);
1694 gfc_procedure_use (sym, &c->ext.actual, &c->loc);
1696 c->resolved_sym = sym;
1697 pure_subroutine (c, sym);
1704 resolve_specific_s (gfc_code * c)
1709 sym = c->symtree->n.sym;
1713 m = resolve_specific_s0 (c, sym);
1716 if (m == MATCH_ERROR)
1719 if (sym->ns->parent == NULL)
1722 gfc_find_symbol (sym->name, sym->ns->parent, 1, &sym);
1728 sym = c->symtree->n.sym;
1729 gfc_error ("Unable to resolve the specific subroutine '%s' at %L",
1730 sym->name, &c->loc);
1736 /* Resolve a subroutine call not known to be generic nor specific. */
1739 resolve_unknown_s (gfc_code * c)
1743 sym = c->symtree->n.sym;
1745 if (sym->attr.dummy)
1747 sym->attr.proc = PROC_DUMMY;
1751 /* See if we have an intrinsic function reference. */
1753 if (gfc_intrinsic_name (sym->name, 1))
1755 if (gfc_intrinsic_sub_interface (c, 1) == MATCH_YES)
1760 /* The reference is to an external name. */
1763 gfc_procedure_use (sym, &c->ext.actual, &c->loc);
1765 c->resolved_sym = sym;
1767 pure_subroutine (c, sym);
1773 /* Resolve a subroutine call. Although it was tempting to use the same code
1774 for functions, subroutines and functions are stored differently and this
1775 makes things awkward. */
1778 resolve_call (gfc_code * c)
1782 if (c->symtree && c->symtree->n.sym
1783 && c->symtree->n.sym->ts.type != BT_UNKNOWN)
1785 gfc_error ("'%s' at %L has a type, which is not consistent with "
1786 "the CALL at %L", c->symtree->n.sym->name,
1787 &c->symtree->n.sym->declared_at, &c->loc);
1791 /* If the procedure is not internal or module, it must be external and
1792 should be checked for usage. */
1793 if (c->symtree && c->symtree->n.sym
1794 && !c->symtree->n.sym->attr.dummy
1795 && !c->symtree->n.sym->attr.contained
1796 && !c->symtree->n.sym->attr.use_assoc)
1797 resolve_global_procedure (c->symtree->n.sym, &c->loc, 1);
1799 /* Subroutines without the RECURSIVE attribution are not allowed to
1800 * call themselves. */
1801 if (c->symtree && c->symtree->n.sym && !c->symtree->n.sym->attr.recursive)
1803 gfc_symbol *csym, *proc;
1804 csym = c->symtree->n.sym;
1805 proc = gfc_current_ns->proc_name;
1808 gfc_error ("SUBROUTINE '%s' at %L cannot call itself, as it is not "
1809 "RECURSIVE", csym->name, &c->loc);
1813 if (csym->attr.entry && csym->ns->entries && proc->ns->entries
1814 && csym->ns->entries->sym == proc->ns->entries->sym)
1816 gfc_error ("Call to ENTRY '%s' at %L is recursive, but subroutine "
1817 "'%s' is not declared as RECURSIVE",
1818 csym->name, &c->loc, csym->ns->entries->sym->name);
1823 /* Switch off assumed size checking and do this again for certain kinds
1824 of procedure, once the procedure itself is resolved. */
1825 need_full_assumed_size++;
1827 if (resolve_actual_arglist (c->ext.actual) == FAILURE)
1830 /* Resume assumed_size checking. */
1831 need_full_assumed_size--;
1835 if (c->resolved_sym == NULL)
1836 switch (procedure_kind (c->symtree->n.sym))
1839 t = resolve_generic_s (c);
1842 case PTYPE_SPECIFIC:
1843 t = resolve_specific_s (c);
1847 t = resolve_unknown_s (c);
1851 gfc_internal_error ("resolve_subroutine(): bad function type");
1854 /* Some checks of elemental subroutine actual arguments. */
1855 if (resolve_elemental_actual (NULL, c) == FAILURE)
1859 find_noncopying_intrinsics (c->resolved_sym, c->ext.actual);
1863 /* Compare the shapes of two arrays that have non-NULL shapes. If both
1864 op1->shape and op2->shape are non-NULL return SUCCESS if their shapes
1865 match. If both op1->shape and op2->shape are non-NULL return FAILURE
1866 if their shapes do not match. If either op1->shape or op2->shape is
1867 NULL, return SUCCESS. */
1870 compare_shapes (gfc_expr * op1, gfc_expr * op2)
1877 if (op1->shape != NULL && op2->shape != NULL)
1879 for (i = 0; i < op1->rank; i++)
1881 if (mpz_cmp (op1->shape[i], op2->shape[i]) != 0)
1883 gfc_error ("Shapes for operands at %L and %L are not conformable",
1884 &op1->where, &op2->where);
1894 /* Resolve an operator expression node. This can involve replacing the
1895 operation with a user defined function call. */
1898 resolve_operator (gfc_expr * e)
1900 gfc_expr *op1, *op2;
1904 /* Resolve all subnodes-- give them types. */
1906 switch (e->value.op.operator)
1909 if (gfc_resolve_expr (e->value.op.op2) == FAILURE)
1912 /* Fall through... */
1915 case INTRINSIC_UPLUS:
1916 case INTRINSIC_UMINUS:
1917 case INTRINSIC_PARENTHESES:
1918 if (gfc_resolve_expr (e->value.op.op1) == FAILURE)
1923 /* Typecheck the new node. */
1925 op1 = e->value.op.op1;
1926 op2 = e->value.op.op2;
1928 switch (e->value.op.operator)
1930 case INTRINSIC_UPLUS:
1931 case INTRINSIC_UMINUS:
1932 if (op1->ts.type == BT_INTEGER
1933 || op1->ts.type == BT_REAL
1934 || op1->ts.type == BT_COMPLEX)
1940 sprintf (msg, _("Operand of unary numeric operator '%s' at %%L is %s"),
1941 gfc_op2string (e->value.op.operator), gfc_typename (&e->ts));
1944 case INTRINSIC_PLUS:
1945 case INTRINSIC_MINUS:
1946 case INTRINSIC_TIMES:
1947 case INTRINSIC_DIVIDE:
1948 case INTRINSIC_POWER:
1949 if (gfc_numeric_ts (&op1->ts) && gfc_numeric_ts (&op2->ts))
1951 gfc_type_convert_binary (e);
1956 _("Operands of binary numeric operator '%s' at %%L are %s/%s"),
1957 gfc_op2string (e->value.op.operator), gfc_typename (&op1->ts),
1958 gfc_typename (&op2->ts));
1961 case INTRINSIC_CONCAT:
1962 if (op1->ts.type == BT_CHARACTER && op2->ts.type == BT_CHARACTER)
1964 e->ts.type = BT_CHARACTER;
1965 e->ts.kind = op1->ts.kind;
1970 _("Operands of string concatenation operator at %%L are %s/%s"),
1971 gfc_typename (&op1->ts), gfc_typename (&op2->ts));
1977 case INTRINSIC_NEQV:
1978 if (op1->ts.type == BT_LOGICAL && op2->ts.type == BT_LOGICAL)
1980 e->ts.type = BT_LOGICAL;
1981 e->ts.kind = gfc_kind_max (op1, op2);
1982 if (op1->ts.kind < e->ts.kind)
1983 gfc_convert_type (op1, &e->ts, 2);
1984 else if (op2->ts.kind < e->ts.kind)
1985 gfc_convert_type (op2, &e->ts, 2);
1989 sprintf (msg, _("Operands of logical operator '%s' at %%L are %s/%s"),
1990 gfc_op2string (e->value.op.operator), gfc_typename (&op1->ts),
1991 gfc_typename (&op2->ts));
1996 if (op1->ts.type == BT_LOGICAL)
1998 e->ts.type = BT_LOGICAL;
1999 e->ts.kind = op1->ts.kind;
2003 sprintf (msg, _("Operand of .NOT. operator at %%L is %s"),
2004 gfc_typename (&op1->ts));
2011 if (op1->ts.type == BT_COMPLEX || op2->ts.type == BT_COMPLEX)
2013 strcpy (msg, _("COMPLEX quantities cannot be compared at %L"));
2017 /* Fall through... */
2021 if (op1->ts.type == BT_CHARACTER && op2->ts.type == BT_CHARACTER)
2023 e->ts.type = BT_LOGICAL;
2024 e->ts.kind = gfc_default_logical_kind;
2028 if (gfc_numeric_ts (&op1->ts) && gfc_numeric_ts (&op2->ts))
2030 gfc_type_convert_binary (e);
2032 e->ts.type = BT_LOGICAL;
2033 e->ts.kind = gfc_default_logical_kind;
2037 if (op1->ts.type == BT_LOGICAL && op2->ts.type == BT_LOGICAL)
2039 _("Logicals at %%L must be compared with %s instead of %s"),
2040 e->value.op.operator == INTRINSIC_EQ ? ".EQV." : ".NEQV.",
2041 gfc_op2string (e->value.op.operator));
2044 _("Operands of comparison operator '%s' at %%L are %s/%s"),
2045 gfc_op2string (e->value.op.operator), gfc_typename (&op1->ts),
2046 gfc_typename (&op2->ts));
2050 case INTRINSIC_USER:
2052 sprintf (msg, _("Operand of user operator '%s' at %%L is %s"),
2053 e->value.op.uop->name, gfc_typename (&op1->ts));
2055 sprintf (msg, _("Operands of user operator '%s' at %%L are %s/%s"),
2056 e->value.op.uop->name, gfc_typename (&op1->ts),
2057 gfc_typename (&op2->ts));
2061 case INTRINSIC_PARENTHESES:
2065 gfc_internal_error ("resolve_operator(): Bad intrinsic");
2068 /* Deal with arrayness of an operand through an operator. */
2072 switch (e->value.op.operator)
2074 case INTRINSIC_PLUS:
2075 case INTRINSIC_MINUS:
2076 case INTRINSIC_TIMES:
2077 case INTRINSIC_DIVIDE:
2078 case INTRINSIC_POWER:
2079 case INTRINSIC_CONCAT:
2083 case INTRINSIC_NEQV:
2091 if (op1->rank == 0 && op2->rank == 0)
2094 if (op1->rank == 0 && op2->rank != 0)
2096 e->rank = op2->rank;
2098 if (e->shape == NULL)
2099 e->shape = gfc_copy_shape (op2->shape, op2->rank);
2102 if (op1->rank != 0 && op2->rank == 0)
2104 e->rank = op1->rank;
2106 if (e->shape == NULL)
2107 e->shape = gfc_copy_shape (op1->shape, op1->rank);
2110 if (op1->rank != 0 && op2->rank != 0)
2112 if (op1->rank == op2->rank)
2114 e->rank = op1->rank;
2115 if (e->shape == NULL)
2117 t = compare_shapes(op1, op2);
2121 e->shape = gfc_copy_shape (op1->shape, op1->rank);
2126 gfc_error ("Inconsistent ranks for operator at %L and %L",
2127 &op1->where, &op2->where);
2130 /* Allow higher level expressions to work. */
2138 case INTRINSIC_UPLUS:
2139 case INTRINSIC_UMINUS:
2140 case INTRINSIC_PARENTHESES:
2141 e->rank = op1->rank;
2143 if (e->shape == NULL)
2144 e->shape = gfc_copy_shape (op1->shape, op1->rank);
2146 /* Simply copy arrayness attribute */
2153 /* Attempt to simplify the expression. */
2155 t = gfc_simplify_expr (e, 0);
2160 if (gfc_extend_expr (e) == SUCCESS)
2163 gfc_error (msg, &e->where);
2169 /************** Array resolution subroutines **************/
2173 { CMP_LT, CMP_EQ, CMP_GT, CMP_UNKNOWN }
2176 /* Compare two integer expressions. */
2179 compare_bound (gfc_expr * a, gfc_expr * b)
2183 if (a == NULL || a->expr_type != EXPR_CONSTANT
2184 || b == NULL || b->expr_type != EXPR_CONSTANT)
2187 if (a->ts.type != BT_INTEGER || b->ts.type != BT_INTEGER)
2188 gfc_internal_error ("compare_bound(): Bad expression");
2190 i = mpz_cmp (a->value.integer, b->value.integer);
2200 /* Compare an integer expression with an integer. */
2203 compare_bound_int (gfc_expr * a, int b)
2207 if (a == NULL || a->expr_type != EXPR_CONSTANT)
2210 if (a->ts.type != BT_INTEGER)
2211 gfc_internal_error ("compare_bound_int(): Bad expression");
2213 i = mpz_cmp_si (a->value.integer, b);
2223 /* Compare an integer expression with a mpz_t. */
2226 compare_bound_mpz_t (gfc_expr * a, mpz_t b)
2230 if (a == NULL || a->expr_type != EXPR_CONSTANT)
2233 if (a->ts.type != BT_INTEGER)
2234 gfc_internal_error ("compare_bound_int(): Bad expression");
2236 i = mpz_cmp (a->value.integer, b);
2246 /* Compute the last value of a sequence given by a triplet.
2247 Return 0 if it wasn't able to compute the last value, or if the
2248 sequence if empty, and 1 otherwise. */
2251 compute_last_value_for_triplet (gfc_expr * start, gfc_expr * end,
2252 gfc_expr * stride, mpz_t last)
2256 if (start == NULL || start->expr_type != EXPR_CONSTANT
2257 || end == NULL || end->expr_type != EXPR_CONSTANT
2258 || (stride != NULL && stride->expr_type != EXPR_CONSTANT))
2261 if (start->ts.type != BT_INTEGER || end->ts.type != BT_INTEGER
2262 || (stride != NULL && stride->ts.type != BT_INTEGER))
2265 if (stride == NULL || compare_bound_int(stride, 1) == CMP_EQ)
2267 if (compare_bound (start, end) == CMP_GT)
2269 mpz_set (last, end->value.integer);
2273 if (compare_bound_int (stride, 0) == CMP_GT)
2275 /* Stride is positive */
2276 if (mpz_cmp (start->value.integer, end->value.integer) > 0)
2281 /* Stride is negative */
2282 if (mpz_cmp (start->value.integer, end->value.integer) < 0)
2287 mpz_sub (rem, end->value.integer, start->value.integer);
2288 mpz_tdiv_r (rem, rem, stride->value.integer);
2289 mpz_sub (last, end->value.integer, rem);
2296 /* Compare a single dimension of an array reference to the array
2300 check_dimension (int i, gfc_array_ref * ar, gfc_array_spec * as)
2304 /* Given start, end and stride values, calculate the minimum and
2305 maximum referenced indexes. */
2313 if (compare_bound (ar->start[i], as->lower[i]) == CMP_LT)
2315 if (compare_bound (ar->start[i], as->upper[i]) == CMP_GT)
2321 if (compare_bound_int (ar->stride[i], 0) == CMP_EQ)
2323 gfc_error ("Illegal stride of zero at %L", &ar->c_where[i]);
2327 #define AR_START (ar->start[i] ? ar->start[i] : as->lower[i])
2328 #define AR_END (ar->end[i] ? ar->end[i] : as->upper[i])
2330 if (compare_bound (AR_START, AR_END) == CMP_EQ
2331 && (compare_bound (AR_START, as->lower[i]) == CMP_LT
2332 || compare_bound (AR_START, as->upper[i]) == CMP_GT))
2335 if (((compare_bound_int (ar->stride[i], 0) == CMP_GT
2336 || ar->stride[i] == NULL)
2337 && compare_bound (AR_START, AR_END) != CMP_GT)
2338 || (compare_bound_int (ar->stride[i], 0) == CMP_LT
2339 && compare_bound (AR_START, AR_END) != CMP_LT))
2341 if (compare_bound (AR_START, as->lower[i]) == CMP_LT)
2343 if (compare_bound (AR_START, as->upper[i]) == CMP_GT)
2347 mpz_init (last_value);
2348 if (compute_last_value_for_triplet (AR_START, AR_END, ar->stride[i],
2351 if (compare_bound_mpz_t (as->lower[i], last_value) == CMP_GT
2352 || compare_bound_mpz_t (as->upper[i], last_value) == CMP_LT)
2354 mpz_clear (last_value);
2358 mpz_clear (last_value);
2366 gfc_internal_error ("check_dimension(): Bad array reference");
2372 gfc_warning ("Array reference at %L is out of bounds", &ar->c_where[i]);
2377 /* Compare an array reference with an array specification. */
2380 compare_spec_to_ref (gfc_array_ref * ar)
2387 /* TODO: Full array sections are only allowed as actual parameters. */
2388 if (as->type == AS_ASSUMED_SIZE
2389 && (/*ar->type == AR_FULL
2390 ||*/ (ar->type == AR_SECTION
2391 && ar->dimen_type[i] == DIMEN_RANGE && ar->end[i] == NULL)))
2393 gfc_error ("Rightmost upper bound of assumed size array section"
2394 " not specified at %L", &ar->where);
2398 if (ar->type == AR_FULL)
2401 if (as->rank != ar->dimen)
2403 gfc_error ("Rank mismatch in array reference at %L (%d/%d)",
2404 &ar->where, ar->dimen, as->rank);
2408 for (i = 0; i < as->rank; i++)
2409 if (check_dimension (i, ar, as) == FAILURE)
2416 /* Resolve one part of an array index. */
2419 gfc_resolve_index (gfc_expr * index, int check_scalar)
2426 if (gfc_resolve_expr (index) == FAILURE)
2429 if (check_scalar && index->rank != 0)
2431 gfc_error ("Array index at %L must be scalar", &index->where);
2435 if (index->ts.type != BT_INTEGER && index->ts.type != BT_REAL)
2437 gfc_error ("Array index at %L must be of INTEGER type",
2442 if (index->ts.type == BT_REAL)
2443 if (gfc_notify_std (GFC_STD_LEGACY, "Extension: REAL array index at %L",
2444 &index->where) == FAILURE)
2447 if (index->ts.kind != gfc_index_integer_kind
2448 || index->ts.type != BT_INTEGER)
2451 ts.type = BT_INTEGER;
2452 ts.kind = gfc_index_integer_kind;
2454 gfc_convert_type_warn (index, &ts, 2, 0);
2460 /* Resolve a dim argument to an intrinsic function. */
2463 gfc_resolve_dim_arg (gfc_expr *dim)
2468 if (gfc_resolve_expr (dim) == FAILURE)
2473 gfc_error ("Argument dim at %L must be scalar", &dim->where);
2477 if (dim->ts.type != BT_INTEGER)
2479 gfc_error ("Argument dim at %L must be of INTEGER type", &dim->where);
2482 if (dim->ts.kind != gfc_index_integer_kind)
2486 ts.type = BT_INTEGER;
2487 ts.kind = gfc_index_integer_kind;
2489 gfc_convert_type_warn (dim, &ts, 2, 0);
2495 /* Given an expression that contains array references, update those array
2496 references to point to the right array specifications. While this is
2497 filled in during matching, this information is difficult to save and load
2498 in a module, so we take care of it here.
2500 The idea here is that the original array reference comes from the
2501 base symbol. We traverse the list of reference structures, setting
2502 the stored reference to references. Component references can
2503 provide an additional array specification. */
2506 find_array_spec (gfc_expr * e)
2510 gfc_symbol *derived;
2513 as = e->symtree->n.sym->as;
2516 for (ref = e->ref; ref; ref = ref->next)
2521 gfc_internal_error ("find_array_spec(): Missing spec");
2528 if (derived == NULL)
2529 derived = e->symtree->n.sym->ts.derived;
2531 c = derived->components;
2533 for (; c; c = c->next)
2534 if (c == ref->u.c.component)
2536 /* Track the sequence of component references. */
2537 if (c->ts.type == BT_DERIVED)
2538 derived = c->ts.derived;
2543 gfc_internal_error ("find_array_spec(): Component not found");
2548 gfc_internal_error ("find_array_spec(): unused as(1)");
2559 gfc_internal_error ("find_array_spec(): unused as(2)");
2563 /* Resolve an array reference. */
2566 resolve_array_ref (gfc_array_ref * ar)
2568 int i, check_scalar;
2571 for (i = 0; i < ar->dimen; i++)
2573 check_scalar = ar->dimen_type[i] == DIMEN_RANGE;
2575 if (gfc_resolve_index (ar->start[i], check_scalar) == FAILURE)
2577 if (gfc_resolve_index (ar->end[i], check_scalar) == FAILURE)
2579 if (gfc_resolve_index (ar->stride[i], check_scalar) == FAILURE)
2584 if (ar->dimen_type[i] == DIMEN_UNKNOWN)
2588 ar->dimen_type[i] = DIMEN_ELEMENT;
2592 ar->dimen_type[i] = DIMEN_VECTOR;
2593 if (e->expr_type == EXPR_VARIABLE
2594 && e->symtree->n.sym->ts.type == BT_DERIVED)
2595 ar->start[i] = gfc_get_parentheses (e);
2599 gfc_error ("Array index at %L is an array of rank %d",
2600 &ar->c_where[i], e->rank);
2605 /* If the reference type is unknown, figure out what kind it is. */
2607 if (ar->type == AR_UNKNOWN)
2609 ar->type = AR_ELEMENT;
2610 for (i = 0; i < ar->dimen; i++)
2611 if (ar->dimen_type[i] == DIMEN_RANGE
2612 || ar->dimen_type[i] == DIMEN_VECTOR)
2614 ar->type = AR_SECTION;
2619 if (!ar->as->cray_pointee && compare_spec_to_ref (ar) == FAILURE)
2627 resolve_substring (gfc_ref * ref)
2630 if (ref->u.ss.start != NULL)
2632 if (gfc_resolve_expr (ref->u.ss.start) == FAILURE)
2635 if (ref->u.ss.start->ts.type != BT_INTEGER)
2637 gfc_error ("Substring start index at %L must be of type INTEGER",
2638 &ref->u.ss.start->where);
2642 if (ref->u.ss.start->rank != 0)
2644 gfc_error ("Substring start index at %L must be scalar",
2645 &ref->u.ss.start->where);
2649 if (compare_bound_int (ref->u.ss.start, 1) == CMP_LT
2650 && (compare_bound (ref->u.ss.end, ref->u.ss.start) == CMP_EQ
2651 || compare_bound (ref->u.ss.end, ref->u.ss.start) == CMP_GT))
2653 gfc_error ("Substring start index at %L is less than one",
2654 &ref->u.ss.start->where);
2659 if (ref->u.ss.end != NULL)
2661 if (gfc_resolve_expr (ref->u.ss.end) == FAILURE)
2664 if (ref->u.ss.end->ts.type != BT_INTEGER)
2666 gfc_error ("Substring end index at %L must be of type INTEGER",
2667 &ref->u.ss.end->where);
2671 if (ref->u.ss.end->rank != 0)
2673 gfc_error ("Substring end index at %L must be scalar",
2674 &ref->u.ss.end->where);
2678 if (ref->u.ss.length != NULL
2679 && compare_bound (ref->u.ss.end, ref->u.ss.length->length) == CMP_GT
2680 && (compare_bound (ref->u.ss.end, ref->u.ss.start) == CMP_EQ
2681 || compare_bound (ref->u.ss.end, ref->u.ss.start) == CMP_GT))
2683 gfc_error ("Substring end index at %L exceeds the string length",
2684 &ref->u.ss.start->where);
2693 /* Resolve subtype references. */
2696 resolve_ref (gfc_expr * expr)
2698 int current_part_dimension, n_components, seen_part_dimension;
2701 for (ref = expr->ref; ref; ref = ref->next)
2702 if (ref->type == REF_ARRAY && ref->u.ar.as == NULL)
2704 find_array_spec (expr);
2708 for (ref = expr->ref; ref; ref = ref->next)
2712 if (resolve_array_ref (&ref->u.ar) == FAILURE)
2720 resolve_substring (ref);
2724 /* Check constraints on part references. */
2726 current_part_dimension = 0;
2727 seen_part_dimension = 0;
2730 for (ref = expr->ref; ref; ref = ref->next)
2735 switch (ref->u.ar.type)
2739 current_part_dimension = 1;
2743 current_part_dimension = 0;
2747 gfc_internal_error ("resolve_ref(): Bad array reference");
2753 if ((current_part_dimension || seen_part_dimension)
2754 && ref->u.c.component->pointer)
2757 ("Component to the right of a part reference with nonzero "
2758 "rank must not have the POINTER attribute at %L",
2770 if (((ref->type == REF_COMPONENT && n_components > 1)
2771 || ref->next == NULL)
2772 && current_part_dimension
2773 && seen_part_dimension)
2776 gfc_error ("Two or more part references with nonzero rank must "
2777 "not be specified at %L", &expr->where);
2781 if (ref->type == REF_COMPONENT)
2783 if (current_part_dimension)
2784 seen_part_dimension = 1;
2786 /* reset to make sure */
2787 current_part_dimension = 0;
2795 /* Given an expression, determine its shape. This is easier than it sounds.
2796 Leaves the shape array NULL if it is not possible to determine the shape. */
2799 expression_shape (gfc_expr * e)
2801 mpz_t array[GFC_MAX_DIMENSIONS];
2804 if (e->rank == 0 || e->shape != NULL)
2807 for (i = 0; i < e->rank; i++)
2808 if (gfc_array_dimen_size (e, i, &array[i]) == FAILURE)
2811 e->shape = gfc_get_shape (e->rank);
2813 memcpy (e->shape, array, e->rank * sizeof (mpz_t));
2818 for (i--; i >= 0; i--)
2819 mpz_clear (array[i]);
2823 /* Given a variable expression node, compute the rank of the expression by
2824 examining the base symbol and any reference structures it may have. */
2827 expression_rank (gfc_expr * e)
2834 if (e->expr_type == EXPR_ARRAY)
2836 /* Constructors can have a rank different from one via RESHAPE(). */
2838 if (e->symtree == NULL)
2844 e->rank = (e->symtree->n.sym->as == NULL)
2845 ? 0 : e->symtree->n.sym->as->rank;
2851 for (ref = e->ref; ref; ref = ref->next)
2853 if (ref->type != REF_ARRAY)
2856 if (ref->u.ar.type == AR_FULL)
2858 rank = ref->u.ar.as->rank;
2862 if (ref->u.ar.type == AR_SECTION)
2864 /* Figure out the rank of the section. */
2866 gfc_internal_error ("expression_rank(): Two array specs");
2868 for (i = 0; i < ref->u.ar.dimen; i++)
2869 if (ref->u.ar.dimen_type[i] == DIMEN_RANGE
2870 || ref->u.ar.dimen_type[i] == DIMEN_VECTOR)
2880 expression_shape (e);
2884 /* Resolve a variable expression. */
2887 resolve_variable (gfc_expr * e)
2894 if (e->symtree == NULL)
2897 if (e->ref && resolve_ref (e) == FAILURE)
2900 sym = e->symtree->n.sym;
2901 if (sym->attr.flavor == FL_PROCEDURE && !sym->attr.function)
2903 e->ts.type = BT_PROCEDURE;
2907 if (sym->ts.type != BT_UNKNOWN)
2908 gfc_variable_attr (e, &e->ts);
2911 /* Must be a simple variable reference. */
2912 if (gfc_set_default_type (sym, 1, NULL) == FAILURE)
2917 if (check_assumed_size_reference (sym, e))
2920 /* Deal with forward references to entries during resolve_code, to
2921 satisfy, at least partially, 12.5.2.5. */
2922 if (gfc_current_ns->entries
2923 && current_entry_id == sym->entry_id
2926 && cs_base->current->op != EXEC_ENTRY)
2928 gfc_entry_list *entry;
2929 gfc_formal_arglist *formal;
2933 /* If the symbol is a dummy... */
2934 if (sym->attr.dummy)
2936 entry = gfc_current_ns->entries;
2939 /* ...test if the symbol is a parameter of previous entries. */
2940 for (; entry && entry->id <= current_entry_id; entry = entry->next)
2941 for (formal = entry->sym->formal; formal; formal = formal->next)
2943 if (formal->sym && sym->name == formal->sym->name)
2947 /* If it has not been seen as a dummy, this is an error. */
2950 if (specification_expr)
2951 gfc_error ("Variable '%s',used in a specification expression, "
2952 "is referenced at %L before the ENTRY statement "
2953 "in which it is a parameter",
2954 sym->name, &cs_base->current->loc);
2956 gfc_error ("Variable '%s' is used at %L before the ENTRY "
2957 "statement in which it is a parameter",
2958 sym->name, &cs_base->current->loc);
2963 /* Now do the same check on the specification expressions. */
2964 specification_expr = 1;
2965 if (sym->ts.type == BT_CHARACTER
2966 && gfc_resolve_expr (sym->ts.cl->length) == FAILURE)
2970 for (n = 0; n < sym->as->rank; n++)
2972 specification_expr = 1;
2973 if (gfc_resolve_expr (sym->as->lower[n]) == FAILURE)
2975 specification_expr = 1;
2976 if (gfc_resolve_expr (sym->as->upper[n]) == FAILURE)
2979 specification_expr = 0;
2982 /* Update the symbol's entry level. */
2983 sym->entry_id = current_entry_id + 1;
2990 /* Resolve an expression. That is, make sure that types of operands agree
2991 with their operators, intrinsic operators are converted to function calls
2992 for overloaded types and unresolved function references are resolved. */
2995 gfc_resolve_expr (gfc_expr * e)
3002 switch (e->expr_type)
3005 t = resolve_operator (e);
3009 t = resolve_function (e);
3013 t = resolve_variable (e);
3015 expression_rank (e);
3018 case EXPR_SUBSTRING:
3019 t = resolve_ref (e);
3029 if (resolve_ref (e) == FAILURE)
3032 t = gfc_resolve_array_constructor (e);
3033 /* Also try to expand a constructor. */
3036 expression_rank (e);
3037 gfc_expand_constructor (e);
3040 /* This provides the opportunity for the length of constructors with character
3041 valued function elements to propogate the string length to the expression. */
3042 if (e->ts.type == BT_CHARACTER)
3043 gfc_resolve_character_array_constructor (e);
3047 case EXPR_STRUCTURE:
3048 t = resolve_ref (e);
3052 t = resolve_structure_cons (e);
3056 t = gfc_simplify_expr (e, 0);
3060 gfc_internal_error ("gfc_resolve_expr(): Bad expression type");
3067 /* Resolve an expression from an iterator. They must be scalar and have
3068 INTEGER or (optionally) REAL type. */
3071 gfc_resolve_iterator_expr (gfc_expr * expr, bool real_ok,
3072 const char * name_msgid)
3074 if (gfc_resolve_expr (expr) == FAILURE)
3077 if (expr->rank != 0)
3079 gfc_error ("%s at %L must be a scalar", _(name_msgid), &expr->where);
3083 if (!(expr->ts.type == BT_INTEGER
3084 || (expr->ts.type == BT_REAL && real_ok)))
3087 gfc_error ("%s at %L must be INTEGER or REAL", _(name_msgid),
3090 gfc_error ("%s at %L must be INTEGER", _(name_msgid), &expr->where);
3097 /* Resolve the expressions in an iterator structure. If REAL_OK is
3098 false allow only INTEGER type iterators, otherwise allow REAL types. */
3101 gfc_resolve_iterator (gfc_iterator * iter, bool real_ok)
3104 if (iter->var->ts.type == BT_REAL)
3105 gfc_notify_std (GFC_STD_F95_DEL,
3106 "Obsolete: REAL DO loop iterator at %L",
3109 if (gfc_resolve_iterator_expr (iter->var, real_ok, "Loop variable")
3113 if (gfc_pure (NULL) && gfc_impure_variable (iter->var->symtree->n.sym))
3115 gfc_error ("Cannot assign to loop variable in PURE procedure at %L",
3120 if (gfc_resolve_iterator_expr (iter->start, real_ok,
3121 "Start expression in DO loop") == FAILURE)
3124 if (gfc_resolve_iterator_expr (iter->end, real_ok,
3125 "End expression in DO loop") == FAILURE)
3128 if (gfc_resolve_iterator_expr (iter->step, real_ok,
3129 "Step expression in DO loop") == FAILURE)
3132 if (iter->step->expr_type == EXPR_CONSTANT)
3134 if ((iter->step->ts.type == BT_INTEGER
3135 && mpz_cmp_ui (iter->step->value.integer, 0) == 0)
3136 || (iter->step->ts.type == BT_REAL
3137 && mpfr_sgn (iter->step->value.real) == 0))
3139 gfc_error ("Step expression in DO loop at %L cannot be zero",
3140 &iter->step->where);
3145 /* Convert start, end, and step to the same type as var. */
3146 if (iter->start->ts.kind != iter->var->ts.kind
3147 || iter->start->ts.type != iter->var->ts.type)
3148 gfc_convert_type (iter->start, &iter->var->ts, 2);
3150 if (iter->end->ts.kind != iter->var->ts.kind
3151 || iter->end->ts.type != iter->var->ts.type)
3152 gfc_convert_type (iter->end, &iter->var->ts, 2);
3154 if (iter->step->ts.kind != iter->var->ts.kind
3155 || iter->step->ts.type != iter->var->ts.type)
3156 gfc_convert_type (iter->step, &iter->var->ts, 2);
3162 /* Resolve a list of FORALL iterators. The FORALL index-name is constrained
3163 to be a scalar INTEGER variable. The subscripts and stride are scalar
3164 INTEGERs, and if stride is a constant it must be nonzero. */
3167 resolve_forall_iterators (gfc_forall_iterator * iter)
3172 if (gfc_resolve_expr (iter->var) == SUCCESS
3173 && (iter->var->ts.type != BT_INTEGER || iter->var->rank != 0))
3174 gfc_error ("FORALL index-name at %L must be a scalar INTEGER",
3177 if (gfc_resolve_expr (iter->start) == SUCCESS
3178 && (iter->start->ts.type != BT_INTEGER || iter->start->rank != 0))
3179 gfc_error ("FORALL start expression at %L must be a scalar INTEGER",
3180 &iter->start->where);
3181 if (iter->var->ts.kind != iter->start->ts.kind)
3182 gfc_convert_type (iter->start, &iter->var->ts, 2);
3184 if (gfc_resolve_expr (iter->end) == SUCCESS
3185 && (iter->end->ts.type != BT_INTEGER || iter->end->rank != 0))
3186 gfc_error ("FORALL end expression at %L must be a scalar INTEGER",
3188 if (iter->var->ts.kind != iter->end->ts.kind)
3189 gfc_convert_type (iter->end, &iter->var->ts, 2);
3191 if (gfc_resolve_expr (iter->stride) == SUCCESS)
3193 if (iter->stride->ts.type != BT_INTEGER || iter->stride->rank != 0)
3194 gfc_error ("FORALL stride expression at %L must be a scalar %s",
3195 &iter->stride->where, "INTEGER");
3197 if (iter->stride->expr_type == EXPR_CONSTANT
3198 && mpz_cmp_ui(iter->stride->value.integer, 0) == 0)
3199 gfc_error ("FORALL stride expression at %L cannot be zero",
3200 &iter->stride->where);
3202 if (iter->var->ts.kind != iter->stride->ts.kind)
3203 gfc_convert_type (iter->stride, &iter->var->ts, 2);
3210 /* Given a pointer to a symbol that is a derived type, see if any components
3211 have the POINTER attribute. The search is recursive if necessary.
3212 Returns zero if no pointer components are found, nonzero otherwise. */
3215 derived_pointer (gfc_symbol * sym)
3219 for (c = sym->components; c; c = c->next)
3224 if (c->ts.type == BT_DERIVED && derived_pointer (c->ts.derived))
3232 /* Given a pointer to a symbol that is a derived type, see if it's
3233 inaccessible, i.e. if it's defined in another module and the components are
3234 PRIVATE. The search is recursive if necessary. Returns zero if no
3235 inaccessible components are found, nonzero otherwise. */
3238 derived_inaccessible (gfc_symbol *sym)
3242 if (sym->attr.use_assoc && sym->component_access == ACCESS_PRIVATE)
3245 for (c = sym->components; c; c = c->next)
3247 if (c->ts.type == BT_DERIVED && derived_inaccessible (c->ts.derived))
3255 /* Resolve the argument of a deallocate expression. The expression must be
3256 a pointer or a full array. */
3259 resolve_deallocate_expr (gfc_expr * e)
3261 symbol_attribute attr;
3265 if (gfc_resolve_expr (e) == FAILURE)
3268 attr = gfc_expr_attr (e);
3272 if (e->expr_type != EXPR_VARIABLE)
3275 allocatable = e->symtree->n.sym->attr.allocatable;
3276 for (ref = e->ref; ref; ref = ref->next)
3280 if (ref->u.ar.type != AR_FULL)
3285 allocatable = (ref->u.c.component->as != NULL
3286 && ref->u.c.component->as->type == AS_DEFERRED);
3294 if (allocatable == 0)
3297 gfc_error ("Expression in DEALLOCATE statement at %L must be "
3298 "ALLOCATABLE or a POINTER", &e->where);
3301 if (e->symtree->n.sym->attr.intent == INTENT_IN)
3303 gfc_error ("Can't deallocate INTENT(IN) variable '%s' at %L",
3304 e->symtree->n.sym->name, &e->where);
3312 /* Given the expression node e for an allocatable/pointer of derived type to be
3313 allocated, get the expression node to be initialized afterwards (needed for
3314 derived types with default initializers). */
3317 expr_to_initialize (gfc_expr * e)
3323 result = gfc_copy_expr (e);
3325 /* Change the last array reference from AR_ELEMENT to AR_FULL. */
3326 for (ref = result->ref; ref; ref = ref->next)
3327 if (ref->type == REF_ARRAY && ref->next == NULL)
3329 ref->u.ar.type = AR_FULL;
3331 for (i = 0; i < ref->u.ar.dimen; i++)
3332 ref->u.ar.start[i] = ref->u.ar.end[i] = ref->u.ar.stride[i] = NULL;
3334 result->rank = ref->u.ar.dimen;
3342 /* Resolve the expression in an ALLOCATE statement, doing the additional
3343 checks to see whether the expression is OK or not. The expression must
3344 have a trailing array reference that gives the size of the array. */
3347 resolve_allocate_expr (gfc_expr * e, gfc_code * code)
3349 int i, pointer, allocatable, dimension;
3350 symbol_attribute attr;
3351 gfc_ref *ref, *ref2;
3356 if (gfc_resolve_expr (e) == FAILURE)
3359 /* Make sure the expression is allocatable or a pointer. If it is
3360 pointer, the next-to-last reference must be a pointer. */
3364 if (e->expr_type != EXPR_VARIABLE)
3368 attr = gfc_expr_attr (e);
3369 pointer = attr.pointer;
3370 dimension = attr.dimension;
3375 allocatable = e->symtree->n.sym->attr.allocatable;
3376 pointer = e->symtree->n.sym->attr.pointer;
3377 dimension = e->symtree->n.sym->attr.dimension;
3379 for (ref = e->ref; ref; ref2 = ref, ref = ref->next)
3383 if (ref->next != NULL)
3388 allocatable = (ref->u.c.component->as != NULL
3389 && ref->u.c.component->as->type == AS_DEFERRED);
3391 pointer = ref->u.c.component->pointer;
3392 dimension = ref->u.c.component->dimension;
3402 if (allocatable == 0 && pointer == 0)
3404 gfc_error ("Expression in ALLOCATE statement at %L must be "
3405 "ALLOCATABLE or a POINTER", &e->where);
3409 if (e->symtree->n.sym->attr.intent == INTENT_IN)
3411 gfc_error ("Can't allocate INTENT(IN) variable '%s' at %L",
3412 e->symtree->n.sym->name, &e->where);
3416 /* Add default initializer for those derived types that need them. */
3417 if (e->ts.type == BT_DERIVED && (init_e = gfc_default_initializer (&e->ts)))
3419 init_st = gfc_get_code ();
3420 init_st->loc = code->loc;
3421 init_st->op = EXEC_ASSIGN;
3422 init_st->expr = expr_to_initialize (e);
3423 init_st->expr2 = init_e;
3425 init_st->next = code->next;
3426 code->next = init_st;
3429 if (pointer && dimension == 0)
3432 /* Make sure the next-to-last reference node is an array specification. */
3434 if (ref2 == NULL || ref2->type != REF_ARRAY || ref2->u.ar.type == AR_FULL)
3436 gfc_error ("Array specification required in ALLOCATE statement "
3437 "at %L", &e->where);
3441 if (ref2->u.ar.type == AR_ELEMENT)
3444 /* Make sure that the array section reference makes sense in the
3445 context of an ALLOCATE specification. */
3449 for (i = 0; i < ar->dimen; i++)
3450 switch (ar->dimen_type[i])
3456 if (ar->start[i] != NULL
3457 && ar->end[i] != NULL
3458 && ar->stride[i] == NULL)
3461 /* Fall Through... */
3465 gfc_error ("Bad array specification in ALLOCATE statement at %L",
3474 /************ SELECT CASE resolution subroutines ************/
3476 /* Callback function for our mergesort variant. Determines interval
3477 overlaps for CASEs. Return <0 if op1 < op2, 0 for overlap, >0 for
3478 op1 > op2. Assumes we're not dealing with the default case.
3479 We have op1 = (:L), (K:L) or (K:) and op2 = (:N), (M:N) or (M:).
3480 There are nine situations to check. */
3483 compare_cases (const gfc_case * op1, const gfc_case * op2)
3487 if (op1->low == NULL) /* op1 = (:L) */
3489 /* op2 = (:N), so overlap. */
3491 /* op2 = (M:) or (M:N), L < M */
3492 if (op2->low != NULL
3493 && gfc_compare_expr (op1->high, op2->low) < 0)
3496 else if (op1->high == NULL) /* op1 = (K:) */
3498 /* op2 = (M:), so overlap. */
3500 /* op2 = (:N) or (M:N), K > N */
3501 if (op2->high != NULL
3502 && gfc_compare_expr (op1->low, op2->high) > 0)
3505 else /* op1 = (K:L) */
3507 if (op2->low == NULL) /* op2 = (:N), K > N */
3508 retval = (gfc_compare_expr (op1->low, op2->high) > 0) ? 1 : 0;
3509 else if (op2->high == NULL) /* op2 = (M:), L < M */
3510 retval = (gfc_compare_expr (op1->high, op2->low) < 0) ? -1 : 0;
3511 else /* op2 = (M:N) */
3515 if (gfc_compare_expr (op1->high, op2->low) < 0)
3518 else if (gfc_compare_expr (op1->low, op2->high) > 0)
3527 /* Merge-sort a double linked case list, detecting overlap in the
3528 process. LIST is the head of the double linked case list before it
3529 is sorted. Returns the head of the sorted list if we don't see any
3530 overlap, or NULL otherwise. */
3533 check_case_overlap (gfc_case * list)
3535 gfc_case *p, *q, *e, *tail;
3536 int insize, nmerges, psize, qsize, cmp, overlap_seen;
3538 /* If the passed list was empty, return immediately. */
3545 /* Loop unconditionally. The only exit from this loop is a return
3546 statement, when we've finished sorting the case list. */
3553 /* Count the number of merges we do in this pass. */
3556 /* Loop while there exists a merge to be done. */
3561 /* Count this merge. */
3564 /* Cut the list in two pieces by stepping INSIZE places
3565 forward in the list, starting from P. */
3568 for (i = 0; i < insize; i++)
3577 /* Now we have two lists. Merge them! */
3578 while (psize > 0 || (qsize > 0 && q != NULL))
3581 /* See from which the next case to merge comes from. */
3584 /* P is empty so the next case must come from Q. */
3589 else if (qsize == 0 || q == NULL)
3598 cmp = compare_cases (p, q);
3601 /* The whole case range for P is less than the
3609 /* The whole case range for Q is greater than
3610 the case range for P. */
3617 /* The cases overlap, or they are the same
3618 element in the list. Either way, we must
3619 issue an error and get the next case from P. */
3620 /* FIXME: Sort P and Q by line number. */
3621 gfc_error ("CASE label at %L overlaps with CASE "
3622 "label at %L", &p->where, &q->where);
3630 /* Add the next element to the merged list. */
3639 /* P has now stepped INSIZE places along, and so has Q. So
3640 they're the same. */
3645 /* If we have done only one merge or none at all, we've
3646 finished sorting the cases. */
3655 /* Otherwise repeat, merging lists twice the size. */
3661 /* Check to see if an expression is suitable for use in a CASE statement.
3662 Makes sure that all case expressions are scalar constants of the same
3663 type. Return FAILURE if anything is wrong. */
3666 validate_case_label_expr (gfc_expr * e, gfc_expr * case_expr)
3668 if (e == NULL) return SUCCESS;
3670 if (e->ts.type != case_expr->ts.type)
3672 gfc_error ("Expression in CASE statement at %L must be of type %s",
3673 &e->where, gfc_basic_typename (case_expr->ts.type));
3677 /* C805 (R808) For a given case-construct, each case-value shall be of
3678 the same type as case-expr. For character type, length differences
3679 are allowed, but the kind type parameters shall be the same. */
3681 if (case_expr->ts.type == BT_CHARACTER && e->ts.kind != case_expr->ts.kind)
3683 gfc_error("Expression in CASE statement at %L must be kind %d",
3684 &e->where, case_expr->ts.kind);
3688 /* Convert the case value kind to that of case expression kind, if needed.
3689 FIXME: Should a warning be issued? */
3690 if (e->ts.kind != case_expr->ts.kind)
3691 gfc_convert_type_warn (e, &case_expr->ts, 2, 0);
3695 gfc_error ("Expression in CASE statement at %L must be scalar",
3704 /* Given a completely parsed select statement, we:
3706 - Validate all expressions and code within the SELECT.
3707 - Make sure that the selection expression is not of the wrong type.
3708 - Make sure that no case ranges overlap.
3709 - Eliminate unreachable cases and unreachable code resulting from
3710 removing case labels.
3712 The standard does allow unreachable cases, e.g. CASE (5:3). But
3713 they are a hassle for code generation, and to prevent that, we just
3714 cut them out here. This is not necessary for overlapping cases
3715 because they are illegal and we never even try to generate code.
3717 We have the additional caveat that a SELECT construct could have
3718 been a computed GOTO in the source code. Fortunately we can fairly
3719 easily work around that here: The case_expr for a "real" SELECT CASE
3720 is in code->expr1, but for a computed GOTO it is in code->expr2. All
3721 we have to do is make sure that the case_expr is a scalar integer
3725 resolve_select (gfc_code * code)
3728 gfc_expr *case_expr;
3729 gfc_case *cp, *default_case, *tail, *head;
3730 int seen_unreachable;
3736 if (code->expr == NULL)
3738 /* This was actually a computed GOTO statement. */
3739 case_expr = code->expr2;
3740 if (case_expr->ts.type != BT_INTEGER
3741 || case_expr->rank != 0)
3742 gfc_error ("Selection expression in computed GOTO statement "
3743 "at %L must be a scalar integer expression",
3746 /* Further checking is not necessary because this SELECT was built
3747 by the compiler, so it should always be OK. Just move the
3748 case_expr from expr2 to expr so that we can handle computed
3749 GOTOs as normal SELECTs from here on. */
3750 code->expr = code->expr2;
3755 case_expr = code->expr;
3757 type = case_expr->ts.type;
3758 if (type != BT_LOGICAL && type != BT_INTEGER && type != BT_CHARACTER)
3760 gfc_error ("Argument of SELECT statement at %L cannot be %s",
3761 &case_expr->where, gfc_typename (&case_expr->ts));
3763 /* Punt. Going on here just produce more garbage error messages. */
3767 if (case_expr->rank != 0)
3769 gfc_error ("Argument of SELECT statement at %L must be a scalar "
3770 "expression", &case_expr->where);
3776 /* PR 19168 has a long discussion concerning a mismatch of the kinds
3777 of the SELECT CASE expression and its CASE values. Walk the lists
3778 of case values, and if we find a mismatch, promote case_expr to
3779 the appropriate kind. */
3781 if (type == BT_LOGICAL || type == BT_INTEGER)
3783 for (body = code->block; body; body = body->block)
3785 /* Walk the case label list. */
3786 for (cp = body->ext.case_list; cp; cp = cp->next)
3788 /* Intercept the DEFAULT case. It does not have a kind. */
3789 if (cp->low == NULL && cp->high == NULL)
3792 /* Unreachable case ranges are discarded, so ignore. */
3793 if (cp->low != NULL && cp->high != NULL
3794 && cp->low != cp->high
3795 && gfc_compare_expr (cp->low, cp->high) > 0)
3798 /* FIXME: Should a warning be issued? */
3800 && case_expr->ts.kind != gfc_kind_max(case_expr, cp->low))
3801 gfc_convert_type_warn (case_expr, &cp->low->ts, 2, 0);
3803 if (cp->high != NULL
3804 && case_expr->ts.kind != gfc_kind_max(case_expr, cp->high))
3805 gfc_convert_type_warn (case_expr, &cp->high->ts, 2, 0);
3810 /* Assume there is no DEFAULT case. */
3811 default_case = NULL;
3816 for (body = code->block; body; body = body->block)
3818 /* Assume the CASE list is OK, and all CASE labels can be matched. */
3820 seen_unreachable = 0;
3822 /* Walk the case label list, making sure that all case labels
3824 for (cp = body->ext.case_list; cp; cp = cp->next)
3826 /* Count the number of cases in the whole construct. */
3829 /* Intercept the DEFAULT case. */
3830 if (cp->low == NULL && cp->high == NULL)
3832 if (default_case != NULL)
3834 gfc_error ("The DEFAULT CASE at %L cannot be followed "
3835 "by a second DEFAULT CASE at %L",
3836 &default_case->where, &cp->where);
3847 /* Deal with single value cases and case ranges. Errors are
3848 issued from the validation function. */
3849 if(validate_case_label_expr (cp->low, case_expr) != SUCCESS
3850 || validate_case_label_expr (cp->high, case_expr) != SUCCESS)
3856 if (type == BT_LOGICAL
3857 && ((cp->low == NULL || cp->high == NULL)
3858 || cp->low != cp->high))
3861 ("Logical range in CASE statement at %L is not allowed",
3867 if (type == BT_LOGICAL && cp->low->expr_type == EXPR_CONSTANT)
3870 value = cp->low->value.logical == 0 ? 2 : 1;
3871 if (value & seen_logical)
3873 gfc_error ("constant logical value in CASE statement "
3874 "is repeated at %L",
3879 seen_logical |= value;
3882 if (cp->low != NULL && cp->high != NULL
3883 && cp->low != cp->high
3884 && gfc_compare_expr (cp->low, cp->high) > 0)
3886 if (gfc_option.warn_surprising)
3887 gfc_warning ("Range specification at %L can never "
3888 "be matched", &cp->where);
3890 cp->unreachable = 1;
3891 seen_unreachable = 1;
3895 /* If the case range can be matched, it can also overlap with
3896 other cases. To make sure it does not, we put it in a
3897 double linked list here. We sort that with a merge sort
3898 later on to detect any overlapping cases. */
3902 head->right = head->left = NULL;
3907 tail->right->left = tail;
3914 /* It there was a failure in the previous case label, give up
3915 for this case label list. Continue with the next block. */
3919 /* See if any case labels that are unreachable have been seen.
3920 If so, we eliminate them. This is a bit of a kludge because
3921 the case lists for a single case statement (label) is a
3922 single forward linked lists. */
3923 if (seen_unreachable)
3925 /* Advance until the first case in the list is reachable. */
3926 while (body->ext.case_list != NULL
3927 && body->ext.case_list->unreachable)
3929 gfc_case *n = body->ext.case_list;
3930 body->ext.case_list = body->ext.case_list->next;
3932 gfc_free_case_list (n);
3935 /* Strip all other unreachable cases. */
3936 if (body->ext.case_list)
3938 for (cp = body->ext.case_list; cp->next; cp = cp->next)
3940 if (cp->next->unreachable)
3942 gfc_case *n = cp->next;
3943 cp->next = cp->next->next;
3945 gfc_free_case_list (n);
3952 /* See if there were overlapping cases. If the check returns NULL,
3953 there was overlap. In that case we don't do anything. If head
3954 is non-NULL, we prepend the DEFAULT case. The sorted list can
3955 then used during code generation for SELECT CASE constructs with
3956 a case expression of a CHARACTER type. */
3959 head = check_case_overlap (head);
3961 /* Prepend the default_case if it is there. */
3962 if (head != NULL && default_case)
3964 default_case->left = NULL;
3965 default_case->right = head;
3966 head->left = default_case;
3970 /* Eliminate dead blocks that may be the result if we've seen
3971 unreachable case labels for a block. */
3972 for (body = code; body && body->block; body = body->block)
3974 if (body->block->ext.case_list == NULL)
3976 /* Cut the unreachable block from the code chain. */
3977 gfc_code *c = body->block;
3978 body->block = c->block;
3980 /* Kill the dead block, but not the blocks below it. */
3982 gfc_free_statements (c);
3986 /* More than two cases is legal but insane for logical selects.
3987 Issue a warning for it. */
3988 if (gfc_option.warn_surprising && type == BT_LOGICAL
3990 gfc_warning ("Logical SELECT CASE block at %L has more that two cases",
3995 /* Resolve a transfer statement. This is making sure that:
3996 -- a derived type being transferred has only non-pointer components
3997 -- a derived type being transferred doesn't have private components, unless
3998 it's being transferred from the module where the type was defined
3999 -- we're not trying to transfer a whole assumed size array. */
4002 resolve_transfer (gfc_code * code)
4011 if (exp->expr_type != EXPR_VARIABLE)
4014 sym = exp->symtree->n.sym;
4017 /* Go to actual component transferred. */
4018 for (ref = code->expr->ref; ref; ref = ref->next)
4019 if (ref->type == REF_COMPONENT)
4020 ts = &ref->u.c.component->ts;
4022 if (ts->type == BT_DERIVED)
4024 /* Check that transferred derived type doesn't contain POINTER
4026 if (derived_pointer (ts->derived))
4028 gfc_error ("Data transfer element at %L cannot have "
4029 "POINTER components", &code->loc);
4033 if (derived_inaccessible (ts->derived))
4035 gfc_error ("Data transfer element at %L cannot have "
4036 "PRIVATE components",&code->loc);
4041 if (sym->as != NULL && sym->as->type == AS_ASSUMED_SIZE
4042 && exp->ref->type == REF_ARRAY && exp->ref->u.ar.type == AR_FULL)
4044 gfc_error ("Data transfer element at %L cannot be a full reference to "
4045 "an assumed-size array", &code->loc);
4051 /*********** Toplevel code resolution subroutines ***********/
4053 /* Given a branch to a label and a namespace, if the branch is conforming.
4054 The code node described where the branch is located. */
4057 resolve_branch (gfc_st_label * label, gfc_code * code)
4059 gfc_code *block, *found;
4067 /* Step one: is this a valid branching target? */
4069 if (lp->defined == ST_LABEL_UNKNOWN)
4071 gfc_error ("Label %d referenced at %L is never defined", lp->value,
4076 if (lp->defined != ST_LABEL_TARGET)
4078 gfc_error ("Statement at %L is not a valid branch target statement "
4079 "for the branch statement at %L", &lp->where, &code->loc);
4083 /* Step two: make sure this branch is not a branch to itself ;-) */
4085 if (code->here == label)
4087 gfc_warning ("Branch at %L causes an infinite loop", &code->loc);
4091 /* Step three: Try to find the label in the parse tree. To do this,
4092 we traverse the tree block-by-block: first the block that
4093 contains this GOTO, then the block that it is nested in, etc. We
4094 can ignore other blocks because branching into another block is
4099 for (stack = cs_base; stack; stack = stack->prev)
4101 for (block = stack->head; block; block = block->next)
4103 if (block->here == label)
4116 /* The label is not in an enclosing block, so illegal. This was
4117 allowed in Fortran 66, so we allow it as extension. We also
4118 forego further checks if we run into this. */
4119 gfc_notify_std (GFC_STD_LEGACY,
4120 "Label at %L is not in the same block as the "
4121 "GOTO statement at %L", &lp->where, &code->loc);
4125 /* Step four: Make sure that the branching target is legal if
4126 the statement is an END {SELECT,DO,IF}. */
4128 if (found->op == EXEC_NOP)
4130 for (stack = cs_base; stack; stack = stack->prev)
4131 if (stack->current->next == found)
4135 gfc_notify_std (GFC_STD_F95_DEL,
4136 "Obsolete: GOTO at %L jumps to END of construct at %L",
4137 &code->loc, &found->loc);
4142 /* Check whether EXPR1 has the same shape as EXPR2. */
4145 resolve_where_shape (gfc_expr *expr1, gfc_expr *expr2)
4147 mpz_t shape[GFC_MAX_DIMENSIONS];
4148 mpz_t shape2[GFC_MAX_DIMENSIONS];
4149 try result = FAILURE;
4152 /* Compare the rank. */
4153 if (expr1->rank != expr2->rank)
4156 /* Compare the size of each dimension. */
4157 for (i=0; i<expr1->rank; i++)
4159 if (gfc_array_dimen_size (expr1, i, &shape[i]) == FAILURE)
4162 if (gfc_array_dimen_size (expr2, i, &shape2[i]) == FAILURE)
4165 if (mpz_cmp (shape[i], shape2[i]))
4169 /* When either of the two expression is an assumed size array, we
4170 ignore the comparison of dimension sizes. */
4175 for (i--; i>=0; i--)
4177 mpz_clear (shape[i]);
4178 mpz_clear (shape2[i]);
4184 /* Check whether a WHERE assignment target or a WHERE mask expression
4185 has the same shape as the outmost WHERE mask expression. */
4188 resolve_where (gfc_code *code, gfc_expr *mask)
4194 cblock = code->block;
4196 /* Store the first WHERE mask-expr of the WHERE statement or construct.
4197 In case of nested WHERE, only the outmost one is stored. */
4198 if (mask == NULL) /* outmost WHERE */
4200 else /* inner WHERE */
4207 /* Check if the mask-expr has a consistent shape with the
4208 outmost WHERE mask-expr. */
4209 if (resolve_where_shape (cblock->expr, e) == FAILURE)
4210 gfc_error ("WHERE mask at %L has inconsistent shape",
4211 &cblock->expr->where);
4214 /* the assignment statement of a WHERE statement, or the first
4215 statement in where-body-construct of a WHERE construct */
4216 cnext = cblock->next;
4221 /* WHERE assignment statement */
4224 /* Check shape consistent for WHERE assignment target. */
4225 if (e && resolve_where_shape (cnext->expr, e) == FAILURE)
4226 gfc_error ("WHERE assignment target at %L has "
4227 "inconsistent shape", &cnext->expr->where);
4230 /* WHERE or WHERE construct is part of a where-body-construct */
4232 resolve_where (cnext, e);
4236 gfc_error ("Unsupported statement inside WHERE at %L",
4239 /* the next statement within the same where-body-construct */
4240 cnext = cnext->next;
4242 /* the next masked-elsewhere-stmt, elsewhere-stmt, or end-where-stmt */
4243 cblock = cblock->block;
4248 /* Check whether the FORALL index appears in the expression or not. */
4251 gfc_find_forall_index (gfc_expr *expr, gfc_symbol *symbol)
4255 gfc_actual_arglist *args;
4258 switch (expr->expr_type)
4261 gcc_assert (expr->symtree->n.sym);
4263 /* A scalar assignment */
4266 if (expr->symtree->n.sym == symbol)
4272 /* the expr is array ref, substring or struct component. */
4279 /* Check if the symbol appears in the array subscript. */
4281 for (i = 0; i < GFC_MAX_DIMENSIONS; i++)
4284 if (gfc_find_forall_index (ar.start[i], symbol) == SUCCESS)
4288 if (gfc_find_forall_index (ar.end[i], symbol) == SUCCESS)
4292 if (gfc_find_forall_index (ar.stride[i], symbol) == SUCCESS)
4298 if (expr->symtree->n.sym == symbol)
4301 /* Check if the symbol appears in the substring section. */
4302 if (gfc_find_forall_index (tmp->u.ss.start, symbol) == SUCCESS)
4304 if (gfc_find_forall_index (tmp->u.ss.end, symbol) == SUCCESS)
4312 gfc_error("expression reference type error at %L", &expr->where);
4318 /* If the expression is a function call, then check if the symbol
4319 appears in the actual arglist of the function. */
4321 for (args = expr->value.function.actual; args; args = args->next)
4323 if (gfc_find_forall_index(args->expr,symbol) == SUCCESS)
4328 /* It seems not to happen. */
4329 case EXPR_SUBSTRING:
4333 gcc_assert (expr->ref->type == REF_SUBSTRING);
4334 if (gfc_find_forall_index (tmp->u.ss.start, symbol) == SUCCESS)
4336 if (gfc_find_forall_index (tmp->u.ss.end, symbol) == SUCCESS)
4341 /* It seems not to happen. */
4342 case EXPR_STRUCTURE:
4344 gfc_error ("Unsupported statement while finding forall index in "
4349 /* Find the FORALL index in the first operand. */
4350 if (expr->value.op.op1)
4352 if (gfc_find_forall_index (expr->value.op.op1, symbol) == SUCCESS)
4356 /* Find the FORALL index in the second operand. */
4357 if (expr->value.op.op2)
4359 if (gfc_find_forall_index (expr->value.op.op2, symbol) == SUCCESS)
4372 /* Resolve assignment in FORALL construct.
4373 NVAR is the number of FORALL index variables, and VAR_EXPR records the
4374 FORALL index variables. */
4377 gfc_resolve_assign_in_forall (gfc_code *code, int nvar, gfc_expr **var_expr)
4381 for (n = 0; n < nvar; n++)
4383 gfc_symbol *forall_index;
4385 forall_index = var_expr[n]->symtree->n.sym;
4387 /* Check whether the assignment target is one of the FORALL index
4389 if ((code->expr->expr_type == EXPR_VARIABLE)
4390 && (code->expr->symtree->n.sym == forall_index))
4391 gfc_error ("Assignment to a FORALL index variable at %L",
4392 &code->expr->where);
4395 /* If one of the FORALL index variables doesn't appear in the
4396 assignment target, then there will be a many-to-one
4398 if (gfc_find_forall_index (code->expr, forall_index) == FAILURE)
4399 gfc_error ("The FORALL with index '%s' cause more than one "
4400 "assignment to this object at %L",
4401 var_expr[n]->symtree->name, &code->expr->where);
4407 /* Resolve WHERE statement in FORALL construct. */
4410 gfc_resolve_where_code_in_forall (gfc_code *code, int nvar, gfc_expr **var_expr){
4414 cblock = code->block;
4417 /* the assignment statement of a WHERE statement, or the first
4418 statement in where-body-construct of a WHERE construct */
4419 cnext = cblock->next;
4424 /* WHERE assignment statement */
4426 gfc_resolve_assign_in_forall (cnext, nvar, var_expr);
4429 /* WHERE or WHERE construct is part of a where-body-construct */
4431 gfc_resolve_where_code_in_forall (cnext, nvar, var_expr);
4435 gfc_error ("Unsupported statement inside WHERE at %L",
4438 /* the next statement within the same where-body-construct */
4439 cnext = cnext->next;
4441 /* the next masked-elsewhere-stmt, elsewhere-stmt, or end-where-stmt */
4442 cblock = cblock->block;
4447 /* Traverse the FORALL body to check whether the following errors exist:
4448 1. For assignment, check if a many-to-one assignment happens.
4449 2. For WHERE statement, check the WHERE body to see if there is any
4450 many-to-one assignment. */
4453 gfc_resolve_forall_body (gfc_code *code, int nvar, gfc_expr **var_expr)
4457 c = code->block->next;
4463 case EXEC_POINTER_ASSIGN:
4464 gfc_resolve_assign_in_forall (c, nvar, var_expr);
4467 /* Because the gfc_resolve_blocks() will handle the nested FORALL,
4468 there is no need to handle it here. */
4472 gfc_resolve_where_code_in_forall(c, nvar, var_expr);
4477 /* The next statement in the FORALL body. */
4483 /* Given a FORALL construct, first resolve the FORALL iterator, then call
4484 gfc_resolve_forall_body to resolve the FORALL body. */
4487 gfc_resolve_forall (gfc_code *code, gfc_namespace *ns, int forall_save)
4489 static gfc_expr **var_expr;
4490 static int total_var = 0;
4491 static int nvar = 0;
4492 gfc_forall_iterator *fa;
4493 gfc_symbol *forall_index;
4497 /* Start to resolve a FORALL construct */
4498 if (forall_save == 0)
4500 /* Count the total number of FORALL index in the nested FORALL
4501 construct in order to allocate the VAR_EXPR with proper size. */
4503 while ((next != NULL) && (next->op == EXEC_FORALL))
4505 for (fa = next->ext.forall_iterator; fa; fa = fa->next)
4507 next = next->block->next;
4510 /* Allocate VAR_EXPR with NUMBER_OF_FORALL_INDEX elements. */
4511 var_expr = (gfc_expr **) gfc_getmem (total_var * sizeof (gfc_expr *));
4514 /* The information about FORALL iterator, including FORALL index start, end
4515 and stride. The FORALL index can not appear in start, end or stride. */
4516 for (fa = code->ext.forall_iterator; fa; fa = fa->next)
4518 /* Check if any outer FORALL index name is the same as the current
4520 for (i = 0; i < nvar; i++)
4522 if (fa->var->symtree->n.sym == var_expr[i]->symtree->n.sym)
4524 gfc_error ("An outer FORALL construct already has an index "
4525 "with this name %L", &fa->var->where);
4529 /* Record the current FORALL index. */
4530 var_expr[nvar] = gfc_copy_expr (fa->var);
4532 forall_index = fa->var->symtree->n.sym;
4534 /* Check if the FORALL index appears in start, end or stride. */
4535 if (gfc_find_forall_index (fa->start, forall_index) == SUCCESS)
4536 gfc_error ("A FORALL index must not appear in a limit or stride "
4537 "expression in the same FORALL at %L", &fa->start->where);
4538 if (gfc_find_forall_index (fa->end, forall_index) == SUCCESS)
4539 gfc_error ("A FORALL index must not appear in a limit or stride "
4540 "expression in the same FORALL at %L", &fa->end->where);
4541 if (gfc_find_forall_index (fa->stride, forall_index) == SUCCESS)
4542 gfc_error ("A FORALL index must not appear in a limit or stride "
4543 "expression in the same FORALL at %L", &fa->stride->where);
4547 /* Resolve the FORALL body. */
4548 gfc_resolve_forall_body (code, nvar, var_expr);
4550 /* May call gfc_resolve_forall to resolve the inner FORALL loop. */
4551 gfc_resolve_blocks (code->block, ns);
4553 /* Free VAR_EXPR after the whole FORALL construct resolved. */
4554 for (i = 0; i < total_var; i++)
4555 gfc_free_expr (var_expr[i]);
4557 /* Reset the counters. */
4563 /* Resolve lists of blocks found in IF, SELECT CASE, WHERE, FORALL ,GOTO and
4566 static void resolve_code (gfc_code *, gfc_namespace *);
4569 gfc_resolve_blocks (gfc_code * b, gfc_namespace * ns)
4573 for (; b; b = b->block)
4575 t = gfc_resolve_expr (b->expr);
4576 if (gfc_resolve_expr (b->expr2) == FAILURE)
4582 if (t == SUCCESS && b->expr != NULL
4583 && (b->expr->ts.type != BT_LOGICAL || b->expr->rank != 0))
4585 ("ELSE IF clause at %L requires a scalar LOGICAL expression",
4592 && (b->expr->ts.type != BT_LOGICAL
4593 || b->expr->rank == 0))
4595 ("WHERE/ELSEWHERE clause at %L requires a LOGICAL array",
4600 resolve_branch (b->label, b);
4612 case EXEC_OMP_ATOMIC:
4613 case EXEC_OMP_CRITICAL:
4615 case EXEC_OMP_MASTER:
4616 case EXEC_OMP_ORDERED:
4617 case EXEC_OMP_PARALLEL:
4618 case EXEC_OMP_PARALLEL_DO:
4619 case EXEC_OMP_PARALLEL_SECTIONS:
4620 case EXEC_OMP_PARALLEL_WORKSHARE:
4621 case EXEC_OMP_SECTIONS:
4622 case EXEC_OMP_SINGLE:
4623 case EXEC_OMP_WORKSHARE:
4627 gfc_internal_error ("resolve_block(): Bad block type");
4630 resolve_code (b->next, ns);
4635 /* Given a block of code, recursively resolve everything pointed to by this
4639 resolve_code (gfc_code * code, gfc_namespace * ns)
4641 int omp_workshare_save;
4647 frame.prev = cs_base;
4651 for (; code; code = code->next)
4653 frame.current = code;
4654 forall_save = forall_flag;
4656 if (code->op == EXEC_FORALL)
4659 gfc_resolve_forall (code, ns, forall_save);
4662 else if (code->block)
4664 omp_workshare_save = -1;
4667 case EXEC_OMP_PARALLEL_WORKSHARE:
4668 omp_workshare_save = omp_workshare_flag;
4669 omp_workshare_flag = 1;
4670 gfc_resolve_omp_parallel_blocks (code, ns);
4672 case EXEC_OMP_PARALLEL:
4673 case EXEC_OMP_PARALLEL_DO:
4674 case EXEC_OMP_PARALLEL_SECTIONS:
4675 omp_workshare_save = omp_workshare_flag;
4676 omp_workshare_flag = 0;
4677 gfc_resolve_omp_parallel_blocks (code, ns);
4680 gfc_resolve_omp_do_blocks (code, ns);
4682 case EXEC_OMP_WORKSHARE:
4683 omp_workshare_save = omp_workshare_flag;
4684 omp_workshare_flag = 1;
4687 gfc_resolve_blocks (code->block, ns);
4691 if (omp_workshare_save != -1)
4692 omp_workshare_flag = omp_workshare_save;
4695 t = gfc_resolve_expr (code->expr);
4696 forall_flag = forall_save;
4698 if (gfc_resolve_expr (code->expr2) == FAILURE)
4713 /* Keep track of which entry we are up to. */
4714 current_entry_id = code->ext.entry->id;
4718 resolve_where (code, NULL);
4722 if (code->expr != NULL)
4724 if (code->expr->ts.type != BT_INTEGER)
4725 gfc_error ("ASSIGNED GOTO statement at %L requires an INTEGER "
4726 "variable", &code->expr->where);
4727 else if (code->expr->symtree->n.sym->attr.assign != 1)
4728 gfc_error ("Variable '%s' has not been assigned a target label "
4729 "at %L", code->expr->symtree->n.sym->name,
4730 &code->expr->where);
4733 resolve_branch (code->label, code);
4737 if (code->expr != NULL
4738 && (code->expr->ts.type != BT_INTEGER || code->expr->rank))
4739 gfc_error ("Alternate RETURN statement at %L requires a SCALAR-"
4740 "INTEGER return specifier", &code->expr->where);
4747 if (gfc_extend_assign (code, ns) == SUCCESS)
4749 if (gfc_pure (NULL) && !gfc_pure (code->symtree->n.sym))
4751 gfc_error ("Subroutine '%s' called instead of assignment at "
4752 "%L must be PURE", code->symtree->n.sym->name,
4759 if (gfc_pure (NULL))
4761 if (gfc_impure_variable (code->expr->symtree->n.sym))
4764 ("Cannot assign to variable '%s' in PURE procedure at %L",
4765 code->expr->symtree->n.sym->name, &code->expr->where);
4769 if (code->expr2->ts.type == BT_DERIVED
4770 && derived_pointer (code->expr2->ts.derived))
4773 ("Right side of assignment at %L is a derived type "
4774 "containing a POINTER in a PURE procedure",
4775 &code->expr2->where);
4780 gfc_check_assign (code->expr, code->expr2, 1);
4783 case EXEC_LABEL_ASSIGN:
4784 if (code->label->defined == ST_LABEL_UNKNOWN)
4785 gfc_error ("Label %d referenced at %L is never defined",
4786 code->label->value, &code->label->where);
4788 && (code->expr->expr_type != EXPR_VARIABLE
4789 || code->expr->symtree->n.sym->ts.type != BT_INTEGER
4790 || code->expr->symtree->n.sym->ts.kind
4791 != gfc_default_integer_kind
4792 || code->expr->symtree->n.sym->as != NULL))
4793 gfc_error ("ASSIGN statement at %L requires a scalar "
4794 "default INTEGER variable", &code->expr->where);
4797 case EXEC_POINTER_ASSIGN:
4801 gfc_check_pointer_assign (code->expr, code->expr2);
4804 case EXEC_ARITHMETIC_IF:
4806 && code->expr->ts.type != BT_INTEGER
4807 && code->expr->ts.type != BT_REAL)
4808 gfc_error ("Arithmetic IF statement at %L requires a numeric "
4809 "expression", &code->expr->where);
4811 resolve_branch (code->label, code);
4812 resolve_branch (code->label2, code);
4813 resolve_branch (code->label3, code);
4817 if (t == SUCCESS && code->expr != NULL
4818 && (code->expr->ts.type != BT_LOGICAL
4819 || code->expr->rank != 0))
4820 gfc_error ("IF clause at %L requires a scalar LOGICAL expression",
4821 &code->expr->where);
4826 resolve_call (code);
4830 /* Select is complicated. Also, a SELECT construct could be
4831 a transformed computed GOTO. */
4832 resolve_select (code);
4836 if (code->ext.iterator != NULL)
4838 gfc_iterator *iter = code->ext.iterator;
4839 if (gfc_resolve_iterator (iter, true) != FAILURE)
4840 gfc_resolve_do_iterator (code, iter->var->symtree->n.sym);
4845 if (code->expr == NULL)
4846 gfc_internal_error ("resolve_code(): No expression on DO WHILE");
4848 && (code->expr->rank != 0
4849 || code->expr->ts.type != BT_LOGICAL))
4850 gfc_error ("Exit condition of DO WHILE loop at %L must be "
4851 "a scalar LOGICAL expression", &code->expr->where);
4855 if (t == SUCCESS && code->expr != NULL
4856 && code->expr->ts.type != BT_INTEGER)
4857 gfc_error ("STAT tag in ALLOCATE statement at %L must be "
4858 "of type INTEGER", &code->expr->where);
4860 for (a = code->ext.alloc_list; a; a = a->next)
4861 resolve_allocate_expr (a->expr, code);
4865 case EXEC_DEALLOCATE:
4866 if (t == SUCCESS && code->expr != NULL
4867 && code->expr->ts.type != BT_INTEGER)
4869 ("STAT tag in DEALLOCATE statement at %L must be of type "
4870 "INTEGER", &code->expr->where);
4872 for (a = code->ext.alloc_list; a; a = a->next)
4873 resolve_deallocate_expr (a->expr);
4878 if (gfc_resolve_open (code->ext.open) == FAILURE)
4881 resolve_branch (code->ext.open->err, code);
4885 if (gfc_resolve_close (code->ext.close) == FAILURE)
4888 resolve_branch (code->ext.close->err, code);
4891 case EXEC_BACKSPACE:
4895 if (gfc_resolve_filepos (code->ext.filepos) == FAILURE)
4898 resolve_branch (code->ext.filepos->err, code);
4902 if (gfc_resolve_inquire (code->ext.inquire) == FAILURE)
4905 resolve_branch (code->ext.inquire->err, code);
4909 gcc_assert (code->ext.inquire != NULL);
4910 if (gfc_resolve_inquire (code->ext.inquire) == FAILURE)
4913 resolve_branch (code->ext.inquire->err, code);
4918 if (gfc_resolve_dt (code->ext.dt) == FAILURE)
4921 resolve_branch (code->ext.dt->err, code);
4922 resolve_branch (code->ext.dt->end, code);
4923 resolve_branch (code->ext.dt->eor, code);
4927 resolve_transfer (code);
4931 resolve_forall_iterators (code->ext.forall_iterator);
4933 if (code->expr != NULL && code->expr->ts.type != BT_LOGICAL)
4935 ("FORALL mask clause at %L requires a LOGICAL expression",
4936 &code->expr->where);
4939 case EXEC_OMP_ATOMIC:
4940 case EXEC_OMP_BARRIER:
4941 case EXEC_OMP_CRITICAL:
4942 case EXEC_OMP_FLUSH:
4944 case EXEC_OMP_MASTER:
4945 case EXEC_OMP_ORDERED:
4946 case EXEC_OMP_SECTIONS:
4947 case EXEC_OMP_SINGLE:
4948 case EXEC_OMP_WORKSHARE:
4949 gfc_resolve_omp_directive (code, ns);
4952 case EXEC_OMP_PARALLEL:
4953 case EXEC_OMP_PARALLEL_DO:
4954 case EXEC_OMP_PARALLEL_SECTIONS:
4955 case EXEC_OMP_PARALLEL_WORKSHARE:
4956 omp_workshare_save = omp_workshare_flag;
4957 omp_workshare_flag = 0;
4958 gfc_resolve_omp_directive (code, ns);
4959 omp_workshare_flag = omp_workshare_save;
4963 gfc_internal_error ("resolve_code(): Bad statement code");
4967 cs_base = frame.prev;
4971 /* Resolve initial values and make sure they are compatible with
4975 resolve_values (gfc_symbol * sym)
4978 if (sym->value == NULL)
4981 if (gfc_resolve_expr (sym->value) == FAILURE)
4984 gfc_check_assign_symbol (sym, sym->value);
4988 /* Resolve an index expression. */
4991 resolve_index_expr (gfc_expr * e)
4993 if (gfc_resolve_expr (e) == FAILURE)
4996 if (gfc_simplify_expr (e, 0) == FAILURE)
4999 if (gfc_specification_expr (e) == FAILURE)
5005 /* Resolve a charlen structure. */
5008 resolve_charlen (gfc_charlen *cl)
5015 specification_expr = 1;
5017 if (resolve_index_expr (cl->length) == FAILURE)
5019 specification_expr = 0;
5027 /* Test for non-constant shape arrays. */
5030 is_non_constant_shape_array (gfc_symbol *sym)
5036 not_constant = false;
5037 if (sym->as != NULL)
5039 /* Unfortunately, !gfc_is_compile_time_shape hits a legal case that
5040 has not been simplified; parameter array references. Do the
5041 simplification now. */
5042 for (i = 0; i < sym->as->rank; i++)
5044 e = sym->as->lower[i];
5045 if (e && (resolve_index_expr (e) == FAILURE
5046 || !gfc_is_constant_expr (e)))
5047 not_constant = true;
5049 e = sym->as->upper[i];
5050 if (e && (resolve_index_expr (e) == FAILURE
5051 || !gfc_is_constant_expr (e)))
5052 not_constant = true;
5055 return not_constant;
5058 /* Resolution of common features of flavors variable and procedure. */
5061 resolve_fl_var_and_proc (gfc_symbol *sym, int mp_flag)
5063 /* Constraints on deferred shape variable. */
5064 if (sym->as == NULL || sym->as->type != AS_DEFERRED)
5066 if (sym->attr.allocatable)
5068 if (sym->attr.dimension)
5069 gfc_error ("Allocatable array '%s' at %L must have "
5070 "a deferred shape", sym->name, &sym->declared_at);
5072 gfc_error ("Scalar object '%s' at %L may not be ALLOCATABLE",
5073 sym->name, &sym->declared_at);
5077 if (sym->attr.pointer && sym->attr.dimension)
5079 gfc_error ("Array pointer '%s' at %L must have a deferred shape",
5080 sym->name, &sym->declared_at);
5087 if (!mp_flag && !sym->attr.allocatable
5088 && !sym->attr.pointer && !sym->attr.dummy)
5090 gfc_error ("Array '%s' at %L cannot have a deferred shape",
5091 sym->name, &sym->declared_at);
5098 /* Resolve symbols with flavor variable. */
5101 resolve_fl_variable (gfc_symbol *sym, int mp_flag)
5106 gfc_expr *constructor_expr;
5107 const char * auto_save_msg;
5109 auto_save_msg = "automatic object '%s' at %L cannot have the "
5112 if (resolve_fl_var_and_proc (sym, mp_flag) == FAILURE)
5115 /* Set this flag to check that variables are parameters of all entries.
5116 This check is effected by the call to gfc_resolve_expr through
5117 is_non_constant_shape_array. */
5118 specification_expr = 1;
5120 if (!sym->attr.use_assoc
5121 && !sym->attr.allocatable
5122 && !sym->attr.pointer
5123 && is_non_constant_shape_array (sym))
5125 /* The shape of a main program or module array needs to be constant. */
5126 if (sym->ns->proc_name
5127 && (sym->ns->proc_name->attr.flavor == FL_MODULE
5128 || sym->ns->proc_name->attr.is_main_program))
5130 gfc_error ("The module or main program array '%s' at %L must "
5131 "have constant shape", sym->name, &sym->declared_at);
5132 specification_expr = 0;
5137 if (sym->ts.type == BT_CHARACTER)
5139 /* Make sure that character string variables with assumed length are
5141 e = sym->ts.cl->length;
5142 if (e == NULL && !sym->attr.dummy && !sym->attr.result)
5144 gfc_error ("Entity with assumed character length at %L must be a "
5145 "dummy argument or a PARAMETER", &sym->declared_at);
5149 if (e && sym->attr.save && !gfc_is_constant_expr (e))
5151 gfc_error (auto_save_msg, sym->name, &sym->declared_at);
5155 if (!gfc_is_constant_expr (e)
5156 && !(e->expr_type == EXPR_VARIABLE
5157 && e->symtree->n.sym->attr.flavor == FL_PARAMETER)
5158 && sym->ns->proc_name
5159 && (sym->ns->proc_name->attr.flavor == FL_MODULE
5160 || sym->ns->proc_name->attr.is_main_program)
5161 && !sym->attr.use_assoc)
5163 gfc_error ("'%s' at %L must have constant character length "
5164 "in this context", sym->name, &sym->declared_at);
5169 /* Can the symbol have an initializer? */
5171 if (sym->attr.allocatable || sym->attr.external || sym->attr.dummy
5172 || sym->attr.intrinsic || sym->attr.result)
5174 else if (sym->attr.dimension && !sym->attr.pointer)
5176 /* Don't allow initialization of automatic arrays. */
5177 for (i = 0; i < sym->as->rank; i++)
5179 if (sym->as->lower[i] == NULL
5180 || sym->as->lower[i]->expr_type != EXPR_CONSTANT
5181 || sym->as->upper[i] == NULL
5182 || sym->as->upper[i]->expr_type != EXPR_CONSTANT)
5189 /* Also, they must not have the SAVE attribute. */
5190 if (flag && sym->attr.save)
5192 gfc_error (auto_save_msg, sym->name, &sym->declared_at);
5197 /* Reject illegal initializers. */
5198 if (sym->value && flag)
5200 if (sym->attr.allocatable)
5201 gfc_error ("Allocatable '%s' at %L cannot have an initializer",
5202 sym->name, &sym->declared_at);
5203 else if (sym->attr.external)
5204 gfc_error ("External '%s' at %L cannot have an initializer",
5205 sym->name, &sym->declared_at);
5206 else if (sym->attr.dummy)
5207 gfc_error ("Dummy '%s' at %L cannot have an initializer",
5208 sym->name, &sym->declared_at);
5209 else if (sym->attr.intrinsic)
5210 gfc_error ("Intrinsic '%s' at %L cannot have an initializer",
5211 sym->name, &sym->declared_at);
5212 else if (sym->attr.result)
5213 gfc_error ("Function result '%s' at %L cannot have an initializer",
5214 sym->name, &sym->declared_at);
5216 gfc_error ("Automatic array '%s' at %L cannot have an initializer",
5217 sym->name, &sym->declared_at);
5221 /* 4th constraint in section 11.3: "If an object of a type for which
5222 component-initialization is specified (R429) appears in the
5223 specification-part of a module and does not have the ALLOCATABLE
5224 or POINTER attribute, the object shall have the SAVE attribute." */
5226 constructor_expr = NULL;
5227 if (sym->ts.type == BT_DERIVED && !(sym->value || flag))
5228 constructor_expr = gfc_default_initializer (&sym->ts);
5230 if (sym->ns->proc_name
5231 && sym->ns->proc_name->attr.flavor == FL_MODULE
5233 && !sym->ns->save_all && !sym->attr.save
5234 && !sym->attr.pointer && !sym->attr.allocatable)
5236 gfc_error("Object '%s' at %L must have the SAVE attribute %s",
5237 sym->name, &sym->declared_at,
5238 "for default initialization of a component");
5242 /* Assign default initializer. */
5243 if (sym->ts.type == BT_DERIVED && !sym->value && !sym->attr.pointer
5244 && !sym->attr.allocatable && (!flag || sym->attr.intent == INTENT_OUT))
5245 sym->value = gfc_default_initializer (&sym->ts);
5251 /* Resolve a procedure. */
5254 resolve_fl_procedure (gfc_symbol *sym, int mp_flag)
5256 gfc_formal_arglist *arg;
5258 if (sym->attr.function
5259 && resolve_fl_var_and_proc (sym, mp_flag) == FAILURE)
5262 if (sym->attr.proc == PROC_ST_FUNCTION)
5264 if (sym->ts.type == BT_CHARACTER)
5266 gfc_charlen *cl = sym->ts.cl;
5267 if (!cl || !cl->length || cl->length->expr_type != EXPR_CONSTANT)
5269 gfc_error ("Character-valued statement function '%s' at %L must "
5270 "have constant length", sym->name, &sym->declared_at);
5276 /* Ensure that derived type for are not of a private type. Internal
5277 module procedures are excluded by 2.2.3.3 - ie. they are not
5278 externally accessible and can access all the objects accessible in
5280 if (!(sym->ns->parent
5281 && sym->ns->parent->proc_name->attr.flavor == FL_MODULE)
5282 && gfc_check_access(sym->attr.access, sym->ns->default_access))
5284 for (arg = sym->formal; arg; arg = arg->next)
5287 && arg->sym->ts.type == BT_DERIVED
5288 && !arg->sym->ts.derived->attr.use_assoc
5289 && !gfc_check_access(arg->sym->ts.derived->attr.access,
5290 arg->sym->ts.derived->ns->default_access))
5292 gfc_error_now ("'%s' is of a PRIVATE type and cannot be "
5293 "a dummy argument of '%s', which is "
5294 "PUBLIC at %L", arg->sym->name, sym->name,
5296 /* Stop this message from recurring. */
5297 arg->sym->ts.derived->attr.access = ACCESS_PUBLIC;
5303 /* An external symbol may not have an initializer because it is taken to be
5305 if (sym->attr.external && sym->value)
5307 gfc_error ("External object '%s' at %L may not have an initializer",
5308 sym->name, &sym->declared_at);
5312 /* An elemental function is required to return a scalar 12.7.1 */
5313 if (sym->attr.elemental && sym->attr.function && sym->as)
5315 gfc_error ("ELEMENTAL function '%s' at %L must have a scalar "
5316 "result", sym->name, &sym->declared_at);
5317 /* Reset so that the error only occurs once. */
5318 sym->attr.elemental = 0;
5322 /* 5.1.1.5 of the Standard: A function name declared with an asterisk
5323 char-len-param shall not be array-valued, pointer-valued, recursive
5324 or pure. ....snip... A character value of * may only be used in the
5325 following ways: (i) Dummy arg of procedure - dummy associates with
5326 actual length; (ii) To declare a named constant; or (iii) External
5327 function - but length must be declared in calling scoping unit. */
5328 if (sym->attr.function
5329 && sym->ts.type == BT_CHARACTER
5330 && sym->ts.cl && sym->ts.cl->length == NULL)
5332 if ((sym->as && sym->as->rank) || (sym->attr.pointer)
5333 || (sym->attr.recursive) || (sym->attr.pure))
5335 if (sym->as && sym->as->rank)
5336 gfc_error ("CHARACTER(*) function '%s' at %L cannot be "
5337 "array-valued", sym->name, &sym->declared_at);
5339 if (sym->attr.pointer)
5340 gfc_error ("CHARACTER(*) function '%s' at %L cannot be "
5341 "pointer-valued", sym->name, &sym->declared_at);
5344 gfc_error ("CHARACTER(*) function '%s' at %L cannot be "
5345 "pure", sym->name, &sym->declared_at);
5347 if (sym->attr.recursive)
5348 gfc_error ("CHARACTER(*) function '%s' at %L cannot be "
5349 "recursive", sym->name, &sym->declared_at);
5354 /* Appendix B.2 of the standard. Contained functions give an
5355 error anyway. Fixed-form is likely to be F77/legacy. */
5356 if (!sym->attr.contained && gfc_current_form != FORM_FIXED)
5357 gfc_notify_std (GFC_STD_F95_OBS, "CHARACTER(*) function "
5358 "'%s' at %L is obsolescent in fortran 95",
5359 sym->name, &sym->declared_at);
5365 /* Resolve the components of a derived type. */
5368 resolve_fl_derived (gfc_symbol *sym)
5373 for (c = sym->components; c != NULL; c = c->next)
5375 if (c->ts.type == BT_CHARACTER)
5377 if (c->ts.cl->length == NULL
5378 || (resolve_charlen (c->ts.cl) == FAILURE)
5379 || !gfc_is_constant_expr (c->ts.cl->length))
5381 gfc_error ("Character length of component '%s' needs to "
5382 "be a constant specification expression at %L.",
5384 c->ts.cl->length ? &c->ts.cl->length->where : &c->loc);
5389 if (c->ts.type == BT_DERIVED
5390 && sym->component_access != ACCESS_PRIVATE
5391 && gfc_check_access(sym->attr.access, sym->ns->default_access)
5392 && !c->ts.derived->attr.use_assoc
5393 && !gfc_check_access(c->ts.derived->attr.access,
5394 c->ts.derived->ns->default_access))
5396 gfc_error ("The component '%s' is a PRIVATE type and cannot be "
5397 "a component of '%s', which is PUBLIC at %L",
5398 c->name, sym->name, &sym->declared_at);
5402 if (sym->attr.sequence)
5404 if (c->ts.type == BT_DERIVED && c->ts.derived->attr.sequence == 0)
5406 gfc_error ("Component %s of SEQUENCE type declared at %L does "
5407 "not have the SEQUENCE attribute",
5408 c->ts.derived->name, &sym->declared_at);
5413 if (c->pointer || c->as == NULL)
5416 for (i = 0; i < c->as->rank; i++)
5418 if (c->as->lower[i] == NULL
5419 || !gfc_is_constant_expr (c->as->lower[i])
5420 || (resolve_index_expr (c->as->lower[i]) == FAILURE)
5421 || c->as->upper[i] == NULL
5422 || (resolve_index_expr (c->as->upper[i]) == FAILURE)
5423 || !gfc_is_constant_expr (c->as->upper[i]))
5425 gfc_error ("Component '%s' of '%s' at %L must have "
5426 "constant array bounds.",
5427 c->name, sym->name, &c->loc);
5438 resolve_fl_namelist (gfc_symbol *sym)
5443 /* Reject PRIVATE objects in a PUBLIC namelist. */
5444 if (gfc_check_access(sym->attr.access, sym->ns->default_access))
5446 for (nl = sym->namelist; nl; nl = nl->next)
5448 if (!nl->sym->attr.use_assoc
5449 && !(sym->ns->parent == nl->sym->ns)
5450 && !gfc_check_access(nl->sym->attr.access,
5451 nl->sym->ns->default_access))
5453 gfc_error ("PRIVATE symbol '%s' cannot be member of "
5454 "PUBLIC namelist at %L", nl->sym->name,
5461 /* Reject namelist arrays that are not constant shape. */
5462 for (nl = sym->namelist; nl; nl = nl->next)
5464 if (is_non_constant_shape_array (nl->sym))
5466 gfc_error ("The array '%s' must have constant shape to be "
5467 "a NAMELIST object at %L", nl->sym->name,
5473 /* 14.1.2 A module or internal procedure represent local entities
5474 of the same type as a namelist member and so are not allowed.
5475 Note that this is sometimes caught by check_conflict so the
5476 same message has been used. */
5477 for (nl = sym->namelist; nl; nl = nl->next)
5480 if (sym->ns->parent && nl->sym && nl->sym->name)
5481 gfc_find_symbol (nl->sym->name, sym->ns->parent, 0, &nlsym);
5482 if (nlsym && nlsym->attr.flavor == FL_PROCEDURE)
5484 gfc_error ("PROCEDURE attribute conflicts with NAMELIST "
5485 "attribute in '%s' at %L", nlsym->name,
5496 resolve_fl_parameter (gfc_symbol *sym)
5498 /* A parameter array's shape needs to be constant. */
5499 if (sym->as != NULL && !gfc_is_compile_time_shape (sym->as))
5501 gfc_error ("Parameter array '%s' at %L cannot be automatic "
5502 "or assumed shape", sym->name, &sym->declared_at);
5506 /* Make sure a parameter that has been implicitly typed still
5507 matches the implicit type, since PARAMETER statements can precede
5508 IMPLICIT statements. */
5509 if (sym->attr.implicit_type
5510 && !gfc_compare_types (&sym->ts,
5511 gfc_get_default_type (sym, sym->ns)))
5513 gfc_error ("Implicitly typed PARAMETER '%s' at %L doesn't match a "
5514 "later IMPLICIT type", sym->name, &sym->declared_at);
5518 /* Make sure the types of derived parameters are consistent. This
5519 type checking is deferred until resolution because the type may
5520 refer to a derived type from the host. */
5521 if (sym->ts.type == BT_DERIVED
5522 && !gfc_compare_types (&sym->ts, &sym->value->ts))
5524 gfc_error ("Incompatible derived type in PARAMETER at %L",
5525 &sym->value->where);
5532 /* Do anything necessary to resolve a symbol. Right now, we just
5533 assume that an otherwise unknown symbol is a variable. This sort
5534 of thing commonly happens for symbols in module. */
5537 resolve_symbol (gfc_symbol * sym)
5539 /* Zero if we are checking a formal namespace. */
5540 static int formal_ns_flag = 1;
5541 int formal_ns_save, check_constant, mp_flag;
5542 gfc_symtree *symtree;
5543 gfc_symtree *this_symtree;
5547 if (sym->attr.flavor == FL_UNKNOWN)
5550 /* If we find that a flavorless symbol is an interface in one of the
5551 parent namespaces, find its symtree in this namespace, free the
5552 symbol and set the symtree to point to the interface symbol. */
5553 for (ns = gfc_current_ns->parent; ns; ns = ns->parent)
5555 symtree = gfc_find_symtree (ns->sym_root, sym->name);
5556 if (symtree && symtree->n.sym->generic)
5558 this_symtree = gfc_find_symtree (gfc_current_ns->sym_root,
5562 gfc_free_symbol (sym);
5563 symtree->n.sym->refs++;
5564 this_symtree->n.sym = symtree->n.sym;
5569 /* Otherwise give it a flavor according to such attributes as
5571 if (sym->attr.external == 0 && sym->attr.intrinsic == 0)
5572 sym->attr.flavor = FL_VARIABLE;
5575 sym->attr.flavor = FL_PROCEDURE;
5576 if (sym->attr.dimension)
5577 sym->attr.function = 1;
5581 if (sym->attr.flavor == FL_DERIVED && resolve_fl_derived (sym) == FAILURE)
5584 /* Symbols that are module procedures with results (functions) have
5585 the types and array specification copied for type checking in
5586 procedures that call them, as well as for saving to a module
5587 file. These symbols can't stand the scrutiny that their results
5589 mp_flag = (sym->result != NULL && sym->result != sym);
5591 /* Assign default type to symbols that need one and don't have one. */
5592 if (sym->ts.type == BT_UNKNOWN)
5594 if (sym->attr.flavor == FL_VARIABLE || sym->attr.flavor == FL_PARAMETER)
5595 gfc_set_default_type (sym, 1, NULL);
5597 if (sym->attr.flavor == FL_PROCEDURE && sym->attr.function)
5599 /* The specific case of an external procedure should emit an error
5600 in the case that there is no implicit type. */
5602 gfc_set_default_type (sym, sym->attr.external, NULL);
5605 /* Result may be in another namespace. */
5606 resolve_symbol (sym->result);
5608 sym->ts = sym->result->ts;
5609 sym->as = gfc_copy_array_spec (sym->result->as);
5610 sym->attr.dimension = sym->result->attr.dimension;
5611 sym->attr.pointer = sym->result->attr.pointer;
5612 sym->attr.allocatable = sym->result->attr.allocatable;
5617 /* Assumed size arrays and assumed shape arrays must be dummy
5621 && (sym->as->type == AS_ASSUMED_SIZE
5622 || sym->as->type == AS_ASSUMED_SHAPE)
5623 && sym->attr.dummy == 0)
5625 if (sym->as->type == AS_ASSUMED_SIZE)
5626 gfc_error ("Assumed size array at %L must be a dummy argument",
5629 gfc_error ("Assumed shape array at %L must be a dummy argument",
5634 /* Make sure symbols with known intent or optional are really dummy
5635 variable. Because of ENTRY statement, this has to be deferred
5636 until resolution time. */
5638 if (!sym->attr.dummy
5639 && (sym->attr.optional
5640 || sym->attr.intent != INTENT_UNKNOWN))
5642 gfc_error ("Symbol at %L is not a DUMMY variable", &sym->declared_at);
5646 /* If a derived type symbol has reached this point, without its
5647 type being declared, we have an error. Notice that most
5648 conditions that produce undefined derived types have already
5649 been dealt with. However, the likes of:
5650 implicit type(t) (t) ..... call foo (t) will get us here if
5651 the type is not declared in the scope of the implicit
5652 statement. Change the type to BT_UNKNOWN, both because it is so
5653 and to prevent an ICE. */
5654 if (sym->ts.type == BT_DERIVED
5655 && sym->ts.derived->components == NULL)
5657 gfc_error ("The derived type '%s' at %L is of type '%s', "
5658 "which has not been defined.", sym->name,
5659 &sym->declared_at, sym->ts.derived->name);
5660 sym->ts.type = BT_UNKNOWN;
5664 /* An assumed-size array with INTENT(OUT) shall not be of a type for which
5665 default initialization is defined (5.1.2.4.4). */
5666 if (sym->ts.type == BT_DERIVED
5668 && sym->attr.intent == INTENT_OUT
5670 && sym->as->type == AS_ASSUMED_SIZE)
5672 for (c = sym->ts.derived->components; c; c = c->next)
5676 gfc_error ("The INTENT(OUT) dummy argument '%s' at %L is "
5677 "ASSUMED SIZE and so cannot have a default initializer",
5678 sym->name, &sym->declared_at);
5684 switch (sym->attr.flavor)
5687 if (resolve_fl_variable (sym, mp_flag) == FAILURE)
5692 if (resolve_fl_procedure (sym, mp_flag) == FAILURE)
5697 if (resolve_fl_namelist (sym) == FAILURE)
5702 if (resolve_fl_parameter (sym) == FAILURE)
5712 /* Make sure that intrinsic exist */
5713 if (sym->attr.intrinsic
5714 && ! gfc_intrinsic_name(sym->name, 0)
5715 && ! gfc_intrinsic_name(sym->name, 1))
5716 gfc_error("Intrinsic at %L does not exist", &sym->declared_at);
5718 /* Resolve array specifier. Check as well some constraints
5719 on COMMON blocks. */
5721 check_constant = sym->attr.in_common && !sym->attr.pointer;
5722 gfc_resolve_array_spec (sym->as, check_constant);
5724 /* Resolve formal namespaces. */
5726 if (formal_ns_flag && sym != NULL && sym->formal_ns != NULL)
5728 formal_ns_save = formal_ns_flag;
5730 gfc_resolve (sym->formal_ns);
5731 formal_ns_flag = formal_ns_save;
5734 /* Check threadprivate restrictions. */
5735 if (sym->attr.threadprivate && !sym->attr.save
5736 && (!sym->attr.in_common
5737 && sym->module == NULL
5738 && (sym->ns->proc_name == NULL
5739 || sym->ns->proc_name->attr.flavor != FL_MODULE)))
5740 gfc_error ("Threadprivate at %L isn't SAVEd", &sym->declared_at);
5745 /************* Resolve DATA statements *************/
5749 gfc_data_value *vnode;
5755 /* Advance the values structure to point to the next value in the data list. */
5758 next_data_value (void)
5760 while (values.left == 0)
5762 if (values.vnode->next == NULL)
5765 values.vnode = values.vnode->next;
5766 values.left = values.vnode->repeat;
5774 check_data_variable (gfc_data_variable * var, locus * where)
5780 ar_type mark = AR_UNKNOWN;
5782 mpz_t section_index[GFC_MAX_DIMENSIONS];
5786 if (gfc_resolve_expr (var->expr) == FAILURE)
5790 mpz_init_set_si (offset, 0);
5793 if (e->expr_type != EXPR_VARIABLE)
5794 gfc_internal_error ("check_data_variable(): Bad expression");
5796 if (e->symtree->n.sym->ns->is_block_data
5797 && !e->symtree->n.sym->attr.in_common)
5799 gfc_error ("BLOCK DATA element '%s' at %L must be in COMMON",
5800 e->symtree->n.sym->name, &e->symtree->n.sym->declared_at);
5805 mpz_init_set_ui (size, 1);
5812 /* Find the array section reference. */
5813 for (ref = e->ref; ref; ref = ref->next)
5815 if (ref->type != REF_ARRAY)
5817 if (ref->u.ar.type == AR_ELEMENT)
5823 /* Set marks according to the reference pattern. */
5824 switch (ref->u.ar.type)
5832 /* Get the start position of array section. */
5833 gfc_get_section_index (ar, section_index, &offset);
5841 if (gfc_array_size (e, &size) == FAILURE)
5843 gfc_error ("Nonconstant array section at %L in DATA statement",
5852 while (mpz_cmp_ui (size, 0) > 0)
5854 if (next_data_value () == FAILURE)
5856 gfc_error ("DATA statement at %L has more variables than values",
5862 t = gfc_check_assign (var->expr, values.vnode->expr, 0);
5866 /* If we have more than one element left in the repeat count,
5867 and we have more than one element left in the target variable,
5868 then create a range assignment. */
5869 /* ??? Only done for full arrays for now, since array sections
5871 if (mark == AR_FULL && ref && ref->next == NULL
5872 && values.left > 1 && mpz_cmp_ui (size, 1) > 0)
5876 if (mpz_cmp_ui (size, values.left) >= 0)
5878 mpz_init_set_ui (range, values.left);
5879 mpz_sub_ui (size, size, values.left);
5884 mpz_init_set (range, size);
5885 values.left -= mpz_get_ui (size);
5886 mpz_set_ui (size, 0);
5889 gfc_assign_data_value_range (var->expr, values.vnode->expr,
5892 mpz_add (offset, offset, range);
5896 /* Assign initial value to symbol. */
5900 mpz_sub_ui (size, size, 1);
5902 gfc_assign_data_value (var->expr, values.vnode->expr, offset);
5904 if (mark == AR_FULL)
5905 mpz_add_ui (offset, offset, 1);
5907 /* Modify the array section indexes and recalculate the offset
5908 for next element. */
5909 else if (mark == AR_SECTION)
5910 gfc_advance_section (section_index, ar, &offset);
5914 if (mark == AR_SECTION)
5916 for (i = 0; i < ar->dimen; i++)
5917 mpz_clear (section_index[i]);
5927 static try traverse_data_var (gfc_data_variable *, locus *);
5929 /* Iterate over a list of elements in a DATA statement. */
5932 traverse_data_list (gfc_data_variable * var, locus * where)
5935 iterator_stack frame;
5938 mpz_init (frame.value);
5940 mpz_init_set (trip, var->iter.end->value.integer);
5941 mpz_sub (trip, trip, var->iter.start->value.integer);
5942 mpz_add (trip, trip, var->iter.step->value.integer);
5944 mpz_div (trip, trip, var->iter.step->value.integer);
5946 mpz_set (frame.value, var->iter.start->value.integer);
5948 frame.prev = iter_stack;
5949 frame.variable = var->iter.var->symtree;
5950 iter_stack = &frame;
5952 while (mpz_cmp_ui (trip, 0) > 0)
5954 if (traverse_data_var (var->list, where) == FAILURE)
5960 e = gfc_copy_expr (var->expr);
5961 if (gfc_simplify_expr (e, 1) == FAILURE)
5967 mpz_add (frame.value, frame.value, var->iter.step->value.integer);
5969 mpz_sub_ui (trip, trip, 1);
5973 mpz_clear (frame.value);
5975 iter_stack = frame.prev;
5980 /* Type resolve variables in the variable list of a DATA statement. */
5983 traverse_data_var (gfc_data_variable * var, locus * where)
5987 for (; var; var = var->next)
5989 if (var->expr == NULL)
5990 t = traverse_data_list (var, where);
5992 t = check_data_variable (var, where);
6002 /* Resolve the expressions and iterators associated with a data statement.
6003 This is separate from the assignment checking because data lists should
6004 only be resolved once. */
6007 resolve_data_variables (gfc_data_variable * d)
6009 for (; d; d = d->next)
6011 if (d->list == NULL)
6013 if (gfc_resolve_expr (d->expr) == FAILURE)
6018 if (gfc_resolve_iterator (&d->iter, false) == FAILURE)
6021 if (d->iter.start->expr_type != EXPR_CONSTANT
6022 || d->iter.end->expr_type != EXPR_CONSTANT
6023 || d->iter.step->expr_type != EXPR_CONSTANT)
6024 gfc_internal_error ("resolve_data_variables(): Bad iterator");
6026 if (resolve_data_variables (d->list) == FAILURE)
6035 /* Resolve a single DATA statement. We implement this by storing a pointer to
6036 the value list into static variables, and then recursively traversing the
6037 variables list, expanding iterators and such. */
6040 resolve_data (gfc_data * d)
6042 if (resolve_data_variables (d->var) == FAILURE)
6045 values.vnode = d->value;
6046 values.left = (d->value == NULL) ? 0 : d->value->repeat;
6048 if (traverse_data_var (d->var, &d->where) == FAILURE)
6051 /* At this point, we better not have any values left. */
6053 if (next_data_value () == SUCCESS)
6054 gfc_error ("DATA statement at %L has more values than variables",
6059 /* Determines if a variable is not 'pure', ie not assignable within a pure
6060 procedure. Returns zero if assignment is OK, nonzero if there is a problem.
6064 gfc_impure_variable (gfc_symbol * sym)
6066 if (sym->attr.use_assoc || sym->attr.in_common)
6069 if (sym->ns != gfc_current_ns)
6070 return !sym->attr.function;
6072 /* TODO: Check storage association through EQUIVALENCE statements */
6078 /* Test whether a symbol is pure or not. For a NULL pointer, checks the
6079 symbol of the current procedure. */
6082 gfc_pure (gfc_symbol * sym)
6084 symbol_attribute attr;
6087 sym = gfc_current_ns->proc_name;
6093 return attr.flavor == FL_PROCEDURE && (attr.pure || attr.elemental);
6097 /* Test whether the current procedure is elemental or not. */
6100 gfc_elemental (gfc_symbol * sym)
6102 symbol_attribute attr;
6105 sym = gfc_current_ns->proc_name;
6110 return attr.flavor == FL_PROCEDURE && attr.elemental;
6114 /* Warn about unused labels. */
6117 warn_unused_fortran_label (gfc_st_label * label)
6122 warn_unused_fortran_label (label->left);
6124 if (label->defined == ST_LABEL_UNKNOWN)
6127 switch (label->referenced)
6129 case ST_LABEL_UNKNOWN:
6130 gfc_warning ("Label %d at %L defined but not used", label->value,
6134 case ST_LABEL_BAD_TARGET:
6135 gfc_warning ("Label %d at %L defined but cannot be used",
6136 label->value, &label->where);
6143 warn_unused_fortran_label (label->right);
6147 /* Returns the sequence type of a symbol or sequence. */
6150 sequence_type (gfc_typespec ts)
6159 if (ts.derived->components == NULL)
6160 return SEQ_NONDEFAULT;
6162 result = sequence_type (ts.derived->components->ts);
6163 for (c = ts.derived->components->next; c; c = c->next)
6164 if (sequence_type (c->ts) != result)
6170 if (ts.kind != gfc_default_character_kind)
6171 return SEQ_NONDEFAULT;
6173 return SEQ_CHARACTER;
6176 if (ts.kind != gfc_default_integer_kind)
6177 return SEQ_NONDEFAULT;
6182 if (!(ts.kind == gfc_default_real_kind
6183 || ts.kind == gfc_default_double_kind))
6184 return SEQ_NONDEFAULT;
6189 if (ts.kind != gfc_default_complex_kind)
6190 return SEQ_NONDEFAULT;
6195 if (ts.kind != gfc_default_logical_kind)
6196 return SEQ_NONDEFAULT;
6201 return SEQ_NONDEFAULT;
6206 /* Resolve derived type EQUIVALENCE object. */
6209 resolve_equivalence_derived (gfc_symbol *derived, gfc_symbol *sym, gfc_expr *e)
6212 gfc_component *c = derived->components;
6217 /* Shall not be an object of nonsequence derived type. */
6218 if (!derived->attr.sequence)
6220 gfc_error ("Derived type variable '%s' at %L must have SEQUENCE "
6221 "attribute to be an EQUIVALENCE object", sym->name, &e->where);
6225 for (; c ; c = c->next)
6228 if (d && (resolve_equivalence_derived (c->ts.derived, sym, e) == FAILURE))
6231 /* Shall not be an object of sequence derived type containing a pointer
6232 in the structure. */
6235 gfc_error ("Derived type variable '%s' at %L with pointer component(s) "
6236 "cannot be an EQUIVALENCE object", sym->name, &e->where);
6242 gfc_error ("Derived type variable '%s' at %L with default initializer "
6243 "cannot be an EQUIVALENCE object", sym->name, &e->where);
6251 /* Resolve equivalence object.
6252 An EQUIVALENCE object shall not be a dummy argument, a pointer, a target,
6253 an allocatable array, an object of nonsequence derived type, an object of
6254 sequence derived type containing a pointer at any level of component
6255 selection, an automatic object, a function name, an entry name, a result
6256 name, a named constant, a structure component, or a subobject of any of
6257 the preceding objects. A substring shall not have length zero. A
6258 derived type shall not have components with default initialization nor
6259 shall two objects of an equivalence group be initialized.
6260 The simple constraints are done in symbol.c(check_conflict) and the rest
6261 are implemented here. */
6264 resolve_equivalence (gfc_equiv *eq)
6267 gfc_symbol *derived;
6268 gfc_symbol *first_sym;
6271 locus *last_where = NULL;
6272 seq_type eq_type, last_eq_type;
6273 gfc_typespec *last_ts;
6275 const char *value_name;
6279 last_ts = &eq->expr->symtree->n.sym->ts;
6281 first_sym = eq->expr->symtree->n.sym;
6283 for (object = 1; eq; eq = eq->eq, object++)
6287 e->ts = e->symtree->n.sym->ts;
6288 /* match_varspec might not know yet if it is seeing
6289 array reference or substring reference, as it doesn't
6291 if (e->ref && e->ref->type == REF_ARRAY)
6293 gfc_ref *ref = e->ref;
6294 sym = e->symtree->n.sym;
6296 if (sym->attr.dimension)
6298 ref->u.ar.as = sym->as;
6302 /* For substrings, convert REF_ARRAY into REF_SUBSTRING. */
6303 if (e->ts.type == BT_CHARACTER
6305 && ref->type == REF_ARRAY
6306 && ref->u.ar.dimen == 1
6307 && ref->u.ar.dimen_type[0] == DIMEN_RANGE
6308 && ref->u.ar.stride[0] == NULL)
6310 gfc_expr *start = ref->u.ar.start[0];
6311 gfc_expr *end = ref->u.ar.end[0];
6314 /* Optimize away the (:) reference. */
6315 if (start == NULL && end == NULL)
6320 e->ref->next = ref->next;
6325 ref->type = REF_SUBSTRING;
6327 start = gfc_int_expr (1);
6328 ref->u.ss.start = start;
6329 if (end == NULL && e->ts.cl)
6330 end = gfc_copy_expr (e->ts.cl->length);
6331 ref->u.ss.end = end;
6332 ref->u.ss.length = e->ts.cl;
6339 /* Any further ref is an error. */
6342 gcc_assert (ref->type == REF_ARRAY);
6343 gfc_error ("Syntax error in EQUIVALENCE statement at %L",
6349 if (gfc_resolve_expr (e) == FAILURE)
6352 sym = e->symtree->n.sym;
6354 /* An equivalence statement cannot have more than one initialized
6358 if (value_name != NULL)
6360 gfc_error ("Initialized objects '%s' and '%s' cannot both "
6361 "be in the EQUIVALENCE statement at %L",
6362 value_name, sym->name, &e->where);
6366 value_name = sym->name;
6369 /* Shall not equivalence common block variables in a PURE procedure. */
6370 if (sym->ns->proc_name
6371 && sym->ns->proc_name->attr.pure
6372 && sym->attr.in_common)
6374 gfc_error ("Common block member '%s' at %L cannot be an EQUIVALENCE "
6375 "object in the pure procedure '%s'",
6376 sym->name, &e->where, sym->ns->proc_name->name);
6380 /* Shall not be a named constant. */
6381 if (e->expr_type == EXPR_CONSTANT)
6383 gfc_error ("Named constant '%s' at %L cannot be an EQUIVALENCE "
6384 "object", sym->name, &e->where);
6388 derived = e->ts.derived;
6389 if (derived && resolve_equivalence_derived (derived, sym, e) == FAILURE)
6392 /* Check that the types correspond correctly:
6394 A numeric sequence structure may be equivalenced to another sequence
6395 structure, an object of default integer type, default real type, double
6396 precision real type, default logical type such that components of the
6397 structure ultimately only become associated to objects of the same
6398 kind. A character sequence structure may be equivalenced to an object
6399 of default character kind or another character sequence structure.
6400 Other objects may be equivalenced only to objects of the same type and
6403 /* Identical types are unconditionally OK. */
6404 if (object == 1 || gfc_compare_types (last_ts, &sym->ts))
6405 goto identical_types;
6407 last_eq_type = sequence_type (*last_ts);
6408 eq_type = sequence_type (sym->ts);
6410 /* Since the pair of objects is not of the same type, mixed or
6411 non-default sequences can be rejected. */
6413 msg = "Sequence %s with mixed components in EQUIVALENCE "
6414 "statement at %L with different type objects";
6416 && last_eq_type == SEQ_MIXED
6417 && gfc_notify_std (GFC_STD_GNU, msg, first_sym->name,
6418 last_where) == FAILURE)
6419 || (eq_type == SEQ_MIXED
6420 && gfc_notify_std (GFC_STD_GNU, msg,sym->name,
6421 &e->where) == FAILURE))
6424 msg = "Non-default type object or sequence %s in EQUIVALENCE "
6425 "statement at %L with objects of different type";
6427 && last_eq_type == SEQ_NONDEFAULT
6428 && gfc_notify_std (GFC_STD_GNU, msg, first_sym->name,
6429 last_where) == FAILURE)
6430 || (eq_type == SEQ_NONDEFAULT
6431 && gfc_notify_std (GFC_STD_GNU, msg, sym->name,
6432 &e->where) == FAILURE))
6435 msg ="Non-CHARACTER object '%s' in default CHARACTER "
6436 "EQUIVALENCE statement at %L";
6437 if (last_eq_type == SEQ_CHARACTER
6438 && eq_type != SEQ_CHARACTER
6439 && gfc_notify_std (GFC_STD_GNU, msg, sym->name,
6440 &e->where) == FAILURE)
6443 msg ="Non-NUMERIC object '%s' in default NUMERIC "
6444 "EQUIVALENCE statement at %L";
6445 if (last_eq_type == SEQ_NUMERIC
6446 && eq_type != SEQ_NUMERIC
6447 && gfc_notify_std (GFC_STD_GNU, msg, sym->name,
6448 &e->where) == FAILURE)
6453 last_where = &e->where;
6458 /* Shall not be an automatic array. */
6459 if (e->ref->type == REF_ARRAY
6460 && gfc_resolve_array_spec (e->ref->u.ar.as, 1) == FAILURE)
6462 gfc_error ("Array '%s' at %L with non-constant bounds cannot be "
6463 "an EQUIVALENCE object", sym->name, &e->where);
6470 /* Shall not be a structure component. */
6471 if (r->type == REF_COMPONENT)
6473 gfc_error ("Structure component '%s' at %L cannot be an "
6474 "EQUIVALENCE object",
6475 r->u.c.component->name, &e->where);
6479 /* A substring shall not have length zero. */
6480 if (r->type == REF_SUBSTRING)
6482 if (compare_bound (r->u.ss.start, r->u.ss.end) == CMP_GT)
6484 gfc_error ("Substring at %L has length zero",
6485 &r->u.ss.start->where);
6495 /* Resolve function and ENTRY types, issue diagnostics if needed. */
6498 resolve_fntype (gfc_namespace * ns)
6503 if (ns->proc_name == NULL || !ns->proc_name->attr.function)
6506 /* If there are any entries, ns->proc_name is the entry master
6507 synthetic symbol and ns->entries->sym actual FUNCTION symbol. */
6509 sym = ns->entries->sym;
6511 sym = ns->proc_name;
6512 if (sym->result == sym
6513 && sym->ts.type == BT_UNKNOWN
6514 && gfc_set_default_type (sym, 0, NULL) == FAILURE
6515 && !sym->attr.untyped)
6517 gfc_error ("Function '%s' at %L has no IMPLICIT type",
6518 sym->name, &sym->declared_at);
6519 sym->attr.untyped = 1;
6522 if (sym->ts.type == BT_DERIVED && !sym->ts.derived->attr.use_assoc
6523 && !gfc_check_access (sym->ts.derived->attr.access,
6524 sym->ts.derived->ns->default_access)
6525 && gfc_check_access (sym->attr.access, sym->ns->default_access))
6527 gfc_error ("PUBLIC function '%s' at %L cannot be of PRIVATE type '%s'",
6528 sym->name, &sym->declared_at, sym->ts.derived->name);
6532 for (el = ns->entries->next; el; el = el->next)
6534 if (el->sym->result == el->sym
6535 && el->sym->ts.type == BT_UNKNOWN
6536 && gfc_set_default_type (el->sym, 0, NULL) == FAILURE
6537 && !el->sym->attr.untyped)
6539 gfc_error ("ENTRY '%s' at %L has no IMPLICIT type",
6540 el->sym->name, &el->sym->declared_at);
6541 el->sym->attr.untyped = 1;
6546 /* 12.3.2.1.1 Defined operators. */
6549 gfc_resolve_uops(gfc_symtree *symtree)
6553 gfc_formal_arglist *formal;
6555 if (symtree == NULL)
6558 gfc_resolve_uops (symtree->left);
6559 gfc_resolve_uops (symtree->right);
6561 for (itr = symtree->n.uop->operator; itr; itr = itr->next)
6564 if (!sym->attr.function)
6565 gfc_error("User operator procedure '%s' at %L must be a FUNCTION",
6566 sym->name, &sym->declared_at);
6568 if (sym->ts.type == BT_CHARACTER
6569 && !(sym->ts.cl && sym->ts.cl->length)
6570 && !(sym->result && sym->result->ts.cl && sym->result->ts.cl->length))
6571 gfc_error("User operator procedure '%s' at %L cannot be assumed character "
6572 "length", sym->name, &sym->declared_at);
6574 formal = sym->formal;
6575 if (!formal || !formal->sym)
6577 gfc_error("User operator procedure '%s' at %L must have at least "
6578 "one argument", sym->name, &sym->declared_at);
6582 if (formal->sym->attr.intent != INTENT_IN)
6583 gfc_error ("First argument of operator interface at %L must be "
6584 "INTENT(IN)", &sym->declared_at);
6586 if (formal->sym->attr.optional)
6587 gfc_error ("First argument of operator interface at %L cannot be "
6588 "optional", &sym->declared_at);
6590 formal = formal->next;
6591 if (!formal || !formal->sym)
6594 if (formal->sym->attr.intent != INTENT_IN)
6595 gfc_error ("Second argument of operator interface at %L must be "
6596 "INTENT(IN)", &sym->declared_at);
6598 if (formal->sym->attr.optional)
6599 gfc_error ("Second argument of operator interface at %L cannot be "
6600 "optional", &sym->declared_at);
6603 gfc_error ("Operator interface at %L must have, at most, two "
6604 "arguments", &sym->declared_at);
6609 /* Examine all of the expressions associated with a program unit,
6610 assign types to all intermediate expressions, make sure that all
6611 assignments are to compatible types and figure out which names
6612 refer to which functions or subroutines. It doesn't check code
6613 block, which is handled by resolve_code. */
6616 resolve_types (gfc_namespace * ns)
6623 gfc_current_ns = ns;
6625 resolve_entries (ns);
6627 resolve_contained_functions (ns);
6629 gfc_traverse_ns (ns, resolve_symbol);
6631 resolve_fntype (ns);
6633 for (n = ns->contained; n; n = n->sibling)
6635 if (gfc_pure (ns->proc_name) && !gfc_pure (n->proc_name))
6636 gfc_error ("Contained procedure '%s' at %L of a PURE procedure must "
6637 "also be PURE", n->proc_name->name,
6638 &n->proc_name->declared_at);
6644 gfc_check_interfaces (ns);
6646 for (cl = ns->cl_list; cl; cl = cl->next)
6647 resolve_charlen (cl);
6649 gfc_traverse_ns (ns, resolve_values);
6655 for (d = ns->data; d; d = d->next)
6659 gfc_traverse_ns (ns, gfc_formalize_init_value);
6661 for (eq = ns->equiv; eq; eq = eq->next)
6662 resolve_equivalence (eq);
6664 /* Warn about unused labels. */
6665 if (gfc_option.warn_unused_labels)
6666 warn_unused_fortran_label (ns->st_labels);
6668 gfc_resolve_uops (ns->uop_root);
6673 /* Call resolve_code recursively. */
6676 resolve_codes (gfc_namespace * ns)
6680 for (n = ns->contained; n; n = n->sibling)
6683 gfc_current_ns = ns;
6685 /* Set to an out of range value. */
6686 current_entry_id = -1;
6687 resolve_code (ns->code, ns);
6691 /* This function is called after a complete program unit has been compiled.
6692 Its purpose is to examine all of the expressions associated with a program
6693 unit, assign types to all intermediate expressions, make sure that all
6694 assignments are to compatible types and figure out which names refer to
6695 which functions or subroutines. */
6698 gfc_resolve (gfc_namespace * ns)
6700 gfc_namespace *old_ns;
6702 old_ns = gfc_current_ns;
6707 gfc_current_ns = old_ns;