Fix ChangeLog
[official-gcc.git] / gcc / fortran / resolve.c
blob2787e293021d32e0c48cb154e74267b4aa79df6f
1 /* Perform type resolution on the various stuctures.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
3 Free Software Foundation, Inc.
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 3, or (at your option) any later
11 version.
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
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 #include "config.h"
23 #include "system.h"
24 #include "flags.h"
25 #include "gfortran.h"
26 #include "obstack.h"
27 #include "bitmap.h"
28 #include "arith.h" /* For gfc_compare_expr(). */
29 #include "dependency.h"
30 #include "data.h"
31 #include "target-memory.h" /* for gfc_simplify_transfer */
33 /* Types used in equivalence statements. */
35 typedef enum seq_type
37 SEQ_NONDEFAULT, SEQ_NUMERIC, SEQ_CHARACTER, SEQ_MIXED
39 seq_type;
41 /* Stack to keep track of the nesting of blocks as we move through the
42 code. See resolve_branch() and resolve_code(). */
44 typedef struct code_stack
46 struct gfc_code *head, *current, *tail;
47 struct code_stack *prev;
49 /* This bitmap keeps track of the targets valid for a branch from
50 inside this block. */
51 bitmap reachable_labels;
53 code_stack;
55 static code_stack *cs_base = NULL;
58 /* Nonzero if we're inside a FORALL block. */
60 static int forall_flag;
62 /* Nonzero if we're inside a OpenMP WORKSHARE or PARALLEL WORKSHARE block. */
64 static int omp_workshare_flag;
66 /* Nonzero if we are processing a formal arglist. The corresponding function
67 resets the flag each time that it is read. */
68 static int formal_arg_flag = 0;
70 /* True if we are resolving a specification expression. */
71 static int specification_expr = 0;
73 /* The id of the last entry seen. */
74 static int current_entry_id;
76 /* We use bitmaps to determine if a branch target is valid. */
77 static bitmap_obstack labels_obstack;
79 int
80 gfc_is_formal_arg (void)
82 return formal_arg_flag;
85 /* Resolve types of formal argument lists. These have to be done early so that
86 the formal argument lists of module procedures can be copied to the
87 containing module before the individual procedures are resolved
88 individually. We also resolve argument lists of procedures in interface
89 blocks because they are self-contained scoping units.
91 Since a dummy argument cannot be a non-dummy procedure, the only
92 resort left for untyped names are the IMPLICIT types. */
94 static void
95 resolve_formal_arglist (gfc_symbol *proc)
97 gfc_formal_arglist *f;
98 gfc_symbol *sym;
99 int i;
101 if (proc->result != NULL)
102 sym = proc->result;
103 else
104 sym = proc;
106 if (gfc_elemental (proc)
107 || sym->attr.pointer || sym->attr.allocatable
108 || (sym->as && sym->as->rank > 0))
110 proc->attr.always_explicit = 1;
111 sym->attr.always_explicit = 1;
114 formal_arg_flag = 1;
116 for (f = proc->formal; f; f = f->next)
118 sym = f->sym;
120 if (sym == NULL)
122 /* Alternate return placeholder. */
123 if (gfc_elemental (proc))
124 gfc_error ("Alternate return specifier in elemental subroutine "
125 "'%s' at %L is not allowed", proc->name,
126 &proc->declared_at);
127 if (proc->attr.function)
128 gfc_error ("Alternate return specifier in function "
129 "'%s' at %L is not allowed", proc->name,
130 &proc->declared_at);
131 continue;
134 if (sym->attr.if_source != IFSRC_UNKNOWN)
135 resolve_formal_arglist (sym);
137 if (sym->attr.subroutine || sym->attr.external || sym->attr.intrinsic)
139 if (gfc_pure (proc) && !gfc_pure (sym))
141 gfc_error ("Dummy procedure '%s' of PURE procedure at %L must "
142 "also be PURE", sym->name, &sym->declared_at);
143 continue;
146 if (gfc_elemental (proc))
148 gfc_error ("Dummy procedure at %L not allowed in ELEMENTAL "
149 "procedure", &sym->declared_at);
150 continue;
153 if (sym->attr.function
154 && sym->ts.type == BT_UNKNOWN
155 && sym->attr.intrinsic)
157 gfc_intrinsic_sym *isym;
158 isym = gfc_find_function (sym->name);
159 if (isym == NULL || !isym->specific)
161 gfc_error ("Unable to find a specific INTRINSIC procedure "
162 "for the reference '%s' at %L", sym->name,
163 &sym->declared_at);
165 sym->ts = isym->ts;
168 continue;
171 if (sym->ts.type == BT_UNKNOWN)
173 if (!sym->attr.function || sym->result == sym)
174 gfc_set_default_type (sym, 1, sym->ns);
177 gfc_resolve_array_spec (sym->as, 0);
179 /* We can't tell if an array with dimension (:) is assumed or deferred
180 shape until we know if it has the pointer or allocatable attributes.
182 if (sym->as && sym->as->rank > 0 && sym->as->type == AS_DEFERRED
183 && !(sym->attr.pointer || sym->attr.allocatable))
185 sym->as->type = AS_ASSUMED_SHAPE;
186 for (i = 0; i < sym->as->rank; i++)
187 sym->as->lower[i] = gfc_int_expr (1);
190 if ((sym->as && sym->as->rank > 0 && sym->as->type == AS_ASSUMED_SHAPE)
191 || sym->attr.pointer || sym->attr.allocatable || sym->attr.target
192 || sym->attr.optional)
194 proc->attr.always_explicit = 1;
195 if (proc->result)
196 proc->result->attr.always_explicit = 1;
199 /* If the flavor is unknown at this point, it has to be a variable.
200 A procedure specification would have already set the type. */
202 if (sym->attr.flavor == FL_UNKNOWN)
203 gfc_add_flavor (&sym->attr, FL_VARIABLE, sym->name, &sym->declared_at);
205 if (gfc_pure (proc) && !sym->attr.pointer
206 && sym->attr.flavor != FL_PROCEDURE)
208 if (proc->attr.function && sym->attr.intent != INTENT_IN)
209 gfc_error ("Argument '%s' of pure function '%s' at %L must be "
210 "INTENT(IN)", sym->name, proc->name,
211 &sym->declared_at);
213 if (proc->attr.subroutine && sym->attr.intent == INTENT_UNKNOWN)
214 gfc_error ("Argument '%s' of pure subroutine '%s' at %L must "
215 "have its INTENT specified", sym->name, proc->name,
216 &sym->declared_at);
219 if (gfc_elemental (proc))
221 if (sym->as != NULL)
223 gfc_error ("Argument '%s' of elemental procedure at %L must "
224 "be scalar", sym->name, &sym->declared_at);
225 continue;
228 if (sym->attr.pointer)
230 gfc_error ("Argument '%s' of elemental procedure at %L cannot "
231 "have the POINTER attribute", sym->name,
232 &sym->declared_at);
233 continue;
236 if (sym->attr.flavor == FL_PROCEDURE)
238 gfc_error ("Dummy procedure '%s' not allowed in elemental "
239 "procedure '%s' at %L", sym->name, proc->name,
240 &sym->declared_at);
241 continue;
245 /* Each dummy shall be specified to be scalar. */
246 if (proc->attr.proc == PROC_ST_FUNCTION)
248 if (sym->as != NULL)
250 gfc_error ("Argument '%s' of statement function at %L must "
251 "be scalar", sym->name, &sym->declared_at);
252 continue;
255 if (sym->ts.type == BT_CHARACTER)
257 gfc_charlen *cl = sym->ts.cl;
258 if (!cl || !cl->length || cl->length->expr_type != EXPR_CONSTANT)
260 gfc_error ("Character-valued argument '%s' of statement "
261 "function at %L must have constant length",
262 sym->name, &sym->declared_at);
263 continue;
268 formal_arg_flag = 0;
272 /* Work function called when searching for symbols that have argument lists
273 associated with them. */
275 static void
276 find_arglists (gfc_symbol *sym)
278 if (sym->attr.if_source == IFSRC_UNKNOWN || sym->ns != gfc_current_ns)
279 return;
281 resolve_formal_arglist (sym);
285 /* Given a namespace, resolve all formal argument lists within the namespace.
288 static void
289 resolve_formal_arglists (gfc_namespace *ns)
291 if (ns == NULL)
292 return;
294 gfc_traverse_ns (ns, find_arglists);
298 static void
299 resolve_contained_fntype (gfc_symbol *sym, gfc_namespace *ns)
301 try t;
303 /* If this namespace is not a function or an entry master function,
304 ignore it. */
305 if (! sym || !(sym->attr.function || sym->attr.flavor == FL_VARIABLE)
306 || sym->attr.entry_master)
307 return;
309 /* Try to find out of what the return type is. */
310 if (sym->result->ts.type == BT_UNKNOWN)
312 t = gfc_set_default_type (sym->result, 0, ns);
314 if (t == FAILURE && !sym->result->attr.untyped)
316 if (sym->result == sym)
317 gfc_error ("Contained function '%s' at %L has no IMPLICIT type",
318 sym->name, &sym->declared_at);
319 else
320 gfc_error ("Result '%s' of contained function '%s' at %L has "
321 "no IMPLICIT type", sym->result->name, sym->name,
322 &sym->result->declared_at);
323 sym->result->attr.untyped = 1;
327 /* Fortran 95 Draft Standard, page 51, Section 5.1.1.5, on the Character
328 type, lists the only ways a character length value of * can be used:
329 dummy arguments of procedures, named constants, and function results
330 in external functions. Internal function results are not on that list;
331 ergo, not permitted. */
333 if (sym->result->ts.type == BT_CHARACTER)
335 gfc_charlen *cl = sym->result->ts.cl;
336 if (!cl || !cl->length)
337 gfc_error ("Character-valued internal function '%s' at %L must "
338 "not be assumed length", sym->name, &sym->declared_at);
343 /* Add NEW_ARGS to the formal argument list of PROC, taking care not to
344 introduce duplicates. */
346 static void
347 merge_argument_lists (gfc_symbol *proc, gfc_formal_arglist *new_args)
349 gfc_formal_arglist *f, *new_arglist;
350 gfc_symbol *new_sym;
352 for (; new_args != NULL; new_args = new_args->next)
354 new_sym = new_args->sym;
355 /* See if this arg is already in the formal argument list. */
356 for (f = proc->formal; f; f = f->next)
358 if (new_sym == f->sym)
359 break;
362 if (f)
363 continue;
365 /* Add a new argument. Argument order is not important. */
366 new_arglist = gfc_get_formal_arglist ();
367 new_arglist->sym = new_sym;
368 new_arglist->next = proc->formal;
369 proc->formal = new_arglist;
374 /* Flag the arguments that are not present in all entries. */
376 static void
377 check_argument_lists (gfc_symbol *proc, gfc_formal_arglist *new_args)
379 gfc_formal_arglist *f, *head;
380 head = new_args;
382 for (f = proc->formal; f; f = f->next)
384 if (f->sym == NULL)
385 continue;
387 for (new_args = head; new_args; new_args = new_args->next)
389 if (new_args->sym == f->sym)
390 break;
393 if (new_args)
394 continue;
396 f->sym->attr.not_always_present = 1;
401 /* Resolve alternate entry points. If a symbol has multiple entry points we
402 create a new master symbol for the main routine, and turn the existing
403 symbol into an entry point. */
405 static void
406 resolve_entries (gfc_namespace *ns)
408 gfc_namespace *old_ns;
409 gfc_code *c;
410 gfc_symbol *proc;
411 gfc_entry_list *el;
412 char name[GFC_MAX_SYMBOL_LEN + 1];
413 static int master_count = 0;
415 if (ns->proc_name == NULL)
416 return;
418 /* No need to do anything if this procedure doesn't have alternate entry
419 points. */
420 if (!ns->entries)
421 return;
423 /* We may already have resolved alternate entry points. */
424 if (ns->proc_name->attr.entry_master)
425 return;
427 /* If this isn't a procedure something has gone horribly wrong. */
428 gcc_assert (ns->proc_name->attr.flavor == FL_PROCEDURE);
430 /* Remember the current namespace. */
431 old_ns = gfc_current_ns;
433 gfc_current_ns = ns;
435 /* Add the main entry point to the list of entry points. */
436 el = gfc_get_entry_list ();
437 el->sym = ns->proc_name;
438 el->id = 0;
439 el->next = ns->entries;
440 ns->entries = el;
441 ns->proc_name->attr.entry = 1;
443 /* If it is a module function, it needs to be in the right namespace
444 so that gfc_get_fake_result_decl can gather up the results. The
445 need for this arose in get_proc_name, where these beasts were
446 left in their own namespace, to keep prior references linked to
447 the entry declaration.*/
448 if (ns->proc_name->attr.function
449 && ns->parent && ns->parent->proc_name->attr.flavor == FL_MODULE)
450 el->sym->ns = ns;
452 /* Do the same for entries where the master is not a module
453 procedure. These are retained in the module namespace because
454 of the module procedure declaration. */
455 for (el = el->next; el; el = el->next)
456 if (el->sym->ns->proc_name->attr.flavor == FL_MODULE
457 && el->sym->attr.mod_proc)
458 el->sym->ns = ns;
459 el = ns->entries;
461 /* Add an entry statement for it. */
462 c = gfc_get_code ();
463 c->op = EXEC_ENTRY;
464 c->ext.entry = el;
465 c->next = ns->code;
466 ns->code = c;
468 /* Create a new symbol for the master function. */
469 /* Give the internal function a unique name (within this file).
470 Also include the function name so the user has some hope of figuring
471 out what is going on. */
472 snprintf (name, GFC_MAX_SYMBOL_LEN, "master.%d.%s",
473 master_count++, ns->proc_name->name);
474 gfc_get_ha_symbol (name, &proc);
475 gcc_assert (proc != NULL);
477 gfc_add_procedure (&proc->attr, PROC_INTERNAL, proc->name, NULL);
478 if (ns->proc_name->attr.subroutine)
479 gfc_add_subroutine (&proc->attr, proc->name, NULL);
480 else
482 gfc_symbol *sym;
483 gfc_typespec *ts, *fts;
484 gfc_array_spec *as, *fas;
485 gfc_add_function (&proc->attr, proc->name, NULL);
486 proc->result = proc;
487 fas = ns->entries->sym->as;
488 fas = fas ? fas : ns->entries->sym->result->as;
489 fts = &ns->entries->sym->result->ts;
490 if (fts->type == BT_UNKNOWN)
491 fts = gfc_get_default_type (ns->entries->sym->result, NULL);
492 for (el = ns->entries->next; el; el = el->next)
494 ts = &el->sym->result->ts;
495 as = el->sym->as;
496 as = as ? as : el->sym->result->as;
497 if (ts->type == BT_UNKNOWN)
498 ts = gfc_get_default_type (el->sym->result, NULL);
500 if (! gfc_compare_types (ts, fts)
501 || (el->sym->result->attr.dimension
502 != ns->entries->sym->result->attr.dimension)
503 || (el->sym->result->attr.pointer
504 != ns->entries->sym->result->attr.pointer))
505 break;
506 else if (as && fas && ns->entries->sym->result != el->sym->result
507 && gfc_compare_array_spec (as, fas) == 0)
508 gfc_error ("Function %s at %L has entries with mismatched "
509 "array specifications", ns->entries->sym->name,
510 &ns->entries->sym->declared_at);
511 /* The characteristics need to match and thus both need to have
512 the same string length, i.e. both len=*, or both len=4.
513 Having both len=<variable> is also possible, but difficult to
514 check at compile time. */
515 else if (ts->type == BT_CHARACTER && ts->cl && fts->cl
516 && (((ts->cl->length && !fts->cl->length)
517 ||(!ts->cl->length && fts->cl->length))
518 || (ts->cl->length
519 && ts->cl->length->expr_type
520 != fts->cl->length->expr_type)
521 || (ts->cl->length
522 && ts->cl->length->expr_type == EXPR_CONSTANT
523 && mpz_cmp (ts->cl->length->value.integer,
524 fts->cl->length->value.integer) != 0)))
525 gfc_notify_std (GFC_STD_GNU, "Extension: Function %s at %L with "
526 "entries returning variables of different "
527 "string lengths", ns->entries->sym->name,
528 &ns->entries->sym->declared_at);
531 if (el == NULL)
533 sym = ns->entries->sym->result;
534 /* All result types the same. */
535 proc->ts = *fts;
536 if (sym->attr.dimension)
537 gfc_set_array_spec (proc, gfc_copy_array_spec (sym->as), NULL);
538 if (sym->attr.pointer)
539 gfc_add_pointer (&proc->attr, NULL);
541 else
543 /* Otherwise the result will be passed through a union by
544 reference. */
545 proc->attr.mixed_entry_master = 1;
546 for (el = ns->entries; el; el = el->next)
548 sym = el->sym->result;
549 if (sym->attr.dimension)
551 if (el == ns->entries)
552 gfc_error ("FUNCTION result %s can't be an array in "
553 "FUNCTION %s at %L", sym->name,
554 ns->entries->sym->name, &sym->declared_at);
555 else
556 gfc_error ("ENTRY result %s can't be an array in "
557 "FUNCTION %s at %L", sym->name,
558 ns->entries->sym->name, &sym->declared_at);
560 else if (sym->attr.pointer)
562 if (el == ns->entries)
563 gfc_error ("FUNCTION result %s can't be a POINTER in "
564 "FUNCTION %s at %L", sym->name,
565 ns->entries->sym->name, &sym->declared_at);
566 else
567 gfc_error ("ENTRY result %s can't be a POINTER in "
568 "FUNCTION %s at %L", sym->name,
569 ns->entries->sym->name, &sym->declared_at);
571 else
573 ts = &sym->ts;
574 if (ts->type == BT_UNKNOWN)
575 ts = gfc_get_default_type (sym, NULL);
576 switch (ts->type)
578 case BT_INTEGER:
579 if (ts->kind == gfc_default_integer_kind)
580 sym = NULL;
581 break;
582 case BT_REAL:
583 if (ts->kind == gfc_default_real_kind
584 || ts->kind == gfc_default_double_kind)
585 sym = NULL;
586 break;
587 case BT_COMPLEX:
588 if (ts->kind == gfc_default_complex_kind)
589 sym = NULL;
590 break;
591 case BT_LOGICAL:
592 if (ts->kind == gfc_default_logical_kind)
593 sym = NULL;
594 break;
595 case BT_UNKNOWN:
596 /* We will issue error elsewhere. */
597 sym = NULL;
598 break;
599 default:
600 break;
602 if (sym)
604 if (el == ns->entries)
605 gfc_error ("FUNCTION result %s can't be of type %s "
606 "in FUNCTION %s at %L", sym->name,
607 gfc_typename (ts), ns->entries->sym->name,
608 &sym->declared_at);
609 else
610 gfc_error ("ENTRY result %s can't be of type %s "
611 "in FUNCTION %s at %L", sym->name,
612 gfc_typename (ts), ns->entries->sym->name,
613 &sym->declared_at);
619 proc->attr.access = ACCESS_PRIVATE;
620 proc->attr.entry_master = 1;
622 /* Merge all the entry point arguments. */
623 for (el = ns->entries; el; el = el->next)
624 merge_argument_lists (proc, el->sym->formal);
626 /* Check the master formal arguments for any that are not
627 present in all entry points. */
628 for (el = ns->entries; el; el = el->next)
629 check_argument_lists (proc, el->sym->formal);
631 /* Use the master function for the function body. */
632 ns->proc_name = proc;
634 /* Finalize the new symbols. */
635 gfc_commit_symbols ();
637 /* Restore the original namespace. */
638 gfc_current_ns = old_ns;
642 static bool
643 has_default_initializer (gfc_symbol *der)
645 gfc_component *c;
647 gcc_assert (der->attr.flavor == FL_DERIVED);
648 for (c = der->components; c; c = c->next)
649 if ((c->ts.type != BT_DERIVED && c->initializer)
650 || (c->ts.type == BT_DERIVED
651 && (!c->pointer && has_default_initializer (c->ts.derived))))
652 break;
654 return c != NULL;
657 /* Resolve common variables. */
658 static void
659 resolve_common_vars (gfc_symbol *sym, bool named_common)
661 gfc_symbol *csym = sym;
663 for (; csym; csym = csym->common_next)
665 if (csym->value || csym->attr.data)
667 if (!csym->ns->is_block_data)
668 gfc_notify_std (GFC_STD_GNU, "Variable '%s' at %L is in COMMON "
669 "but only in BLOCK DATA initialization is "
670 "allowed", csym->name, &csym->declared_at);
671 else if (!named_common)
672 gfc_notify_std (GFC_STD_GNU, "Initialized variable '%s' at %L is "
673 "in a blank COMMON but initialization is only "
674 "allowed in named common blocks", csym->name,
675 &csym->declared_at);
678 if (csym->ts.type != BT_DERIVED)
679 continue;
681 if (!(csym->ts.derived->attr.sequence
682 || csym->ts.derived->attr.is_bind_c))
683 gfc_error_now ("Derived type variable '%s' in COMMON at %L "
684 "has neither the SEQUENCE nor the BIND(C) "
685 "attribute", csym->name, &csym->declared_at);
686 if (csym->ts.derived->attr.alloc_comp)
687 gfc_error_now ("Derived type variable '%s' in COMMON at %L "
688 "has an ultimate component that is "
689 "allocatable", csym->name, &csym->declared_at);
690 if (has_default_initializer (csym->ts.derived))
691 gfc_error_now ("Derived type variable '%s' in COMMON at %L "
692 "may not have default initializer", csym->name,
693 &csym->declared_at);
697 /* Resolve common blocks. */
698 static void
699 resolve_common_blocks (gfc_symtree *common_root)
701 gfc_symbol *sym;
703 if (common_root == NULL)
704 return;
706 if (common_root->left)
707 resolve_common_blocks (common_root->left);
708 if (common_root->right)
709 resolve_common_blocks (common_root->right);
711 resolve_common_vars (common_root->n.common->head, true);
713 gfc_find_symbol (common_root->name, gfc_current_ns, 0, &sym);
714 if (sym == NULL)
715 return;
717 if (sym->attr.flavor == FL_PARAMETER)
718 gfc_error ("COMMON block '%s' at %L is used as PARAMETER at %L",
719 sym->name, &common_root->n.common->where, &sym->declared_at);
721 if (sym->attr.intrinsic)
722 gfc_error ("COMMON block '%s' at %L is also an intrinsic procedure",
723 sym->name, &common_root->n.common->where);
724 else if (sym->attr.result
725 ||(sym->attr.function && gfc_current_ns->proc_name == sym))
726 gfc_notify_std (GFC_STD_F2003, "Fortran 2003: COMMON block '%s' at %L "
727 "that is also a function result", sym->name,
728 &common_root->n.common->where);
729 else if (sym->attr.flavor == FL_PROCEDURE && sym->attr.proc != PROC_INTERNAL
730 && sym->attr.proc != PROC_ST_FUNCTION)
731 gfc_notify_std (GFC_STD_F2003, "Fortran 2003: COMMON block '%s' at %L "
732 "that is also a global procedure", sym->name,
733 &common_root->n.common->where);
737 /* Resolve contained function types. Because contained functions can call one
738 another, they have to be worked out before any of the contained procedures
739 can be resolved.
741 The good news is that if a function doesn't already have a type, the only
742 way it can get one is through an IMPLICIT type or a RESULT variable, because
743 by definition contained functions are contained namespace they're contained
744 in, not in a sibling or parent namespace. */
746 static void
747 resolve_contained_functions (gfc_namespace *ns)
749 gfc_namespace *child;
750 gfc_entry_list *el;
752 resolve_formal_arglists (ns);
754 for (child = ns->contained; child; child = child->sibling)
756 /* Resolve alternate entry points first. */
757 resolve_entries (child);
759 /* Then check function return types. */
760 resolve_contained_fntype (child->proc_name, child);
761 for (el = child->entries; el; el = el->next)
762 resolve_contained_fntype (el->sym, child);
767 /* Resolve all of the elements of a structure constructor and make sure that
768 the types are correct. */
770 static try
771 resolve_structure_cons (gfc_expr *expr)
773 gfc_constructor *cons;
774 gfc_component *comp;
775 try t;
776 symbol_attribute a;
778 t = SUCCESS;
779 cons = expr->value.constructor;
780 /* A constructor may have references if it is the result of substituting a
781 parameter variable. In this case we just pull out the component we
782 want. */
783 if (expr->ref)
784 comp = expr->ref->u.c.sym->components;
785 else
786 comp = expr->ts.derived->components;
788 /* See if the user is trying to invoke a structure constructor for one of
789 the iso_c_binding derived types. */
790 if (expr->ts.derived && expr->ts.derived->ts.is_iso_c && cons
791 && cons->expr != NULL)
793 gfc_error ("Components of structure constructor '%s' at %L are PRIVATE",
794 expr->ts.derived->name, &(expr->where));
795 return FAILURE;
798 for (; comp; comp = comp->next, cons = cons->next)
800 int rank;
802 if (!cons->expr)
803 continue;
805 if (gfc_resolve_expr (cons->expr) == FAILURE)
807 t = FAILURE;
808 continue;
811 rank = comp->as ? comp->as->rank : 0;
812 if (cons->expr->expr_type != EXPR_NULL && rank != cons->expr->rank
813 && (comp->allocatable || cons->expr->rank))
815 gfc_error ("The rank of the element in the derived type "
816 "constructor at %L does not match that of the "
817 "component (%d/%d)", &cons->expr->where,
818 cons->expr->rank, rank);
819 t = FAILURE;
822 /* If we don't have the right type, try to convert it. */
824 if (!gfc_compare_types (&cons->expr->ts, &comp->ts))
826 t = FAILURE;
827 if (comp->pointer && cons->expr->ts.type != BT_UNKNOWN)
828 gfc_error ("The element in the derived type constructor at %L, "
829 "for pointer component '%s', is %s but should be %s",
830 &cons->expr->where, comp->name,
831 gfc_basic_typename (cons->expr->ts.type),
832 gfc_basic_typename (comp->ts.type));
833 else
834 t = gfc_convert_type (cons->expr, &comp->ts, 1);
837 if (cons->expr->expr_type == EXPR_NULL
838 && !(comp->pointer || comp->allocatable))
840 t = FAILURE;
841 gfc_error ("The NULL in the derived type constructor at %L is "
842 "being applied to component '%s', which is neither "
843 "a POINTER nor ALLOCATABLE", &cons->expr->where,
844 comp->name);
847 if (!comp->pointer || cons->expr->expr_type == EXPR_NULL)
848 continue;
850 a = gfc_expr_attr (cons->expr);
852 if (!a.pointer && !a.target)
854 t = FAILURE;
855 gfc_error ("The element in the derived type constructor at %L, "
856 "for pointer component '%s' should be a POINTER or "
857 "a TARGET", &cons->expr->where, comp->name);
861 return t;
865 /****************** Expression name resolution ******************/
867 /* Returns 0 if a symbol was not declared with a type or
868 attribute declaration statement, nonzero otherwise. */
870 static int
871 was_declared (gfc_symbol *sym)
873 symbol_attribute a;
875 a = sym->attr;
877 if (!a.implicit_type && sym->ts.type != BT_UNKNOWN)
878 return 1;
880 if (a.allocatable || a.dimension || a.dummy || a.external || a.intrinsic
881 || a.optional || a.pointer || a.save || a.target || a.volatile_
882 || a.value || a.access != ACCESS_UNKNOWN || a.intent != INTENT_UNKNOWN)
883 return 1;
885 return 0;
889 /* Determine if a symbol is generic or not. */
891 static int
892 generic_sym (gfc_symbol *sym)
894 gfc_symbol *s;
896 if (sym->attr.generic ||
897 (sym->attr.intrinsic && gfc_generic_intrinsic (sym->name)))
898 return 1;
900 if (was_declared (sym) || sym->ns->parent == NULL)
901 return 0;
903 gfc_find_symbol (sym->name, sym->ns->parent, 1, &s);
905 if (s != NULL)
907 if (s == sym)
908 return 0;
909 else
910 return generic_sym (s);
913 return 0;
917 /* Determine if a symbol is specific or not. */
919 static int
920 specific_sym (gfc_symbol *sym)
922 gfc_symbol *s;
924 if (sym->attr.if_source == IFSRC_IFBODY
925 || sym->attr.proc == PROC_MODULE
926 || sym->attr.proc == PROC_INTERNAL
927 || sym->attr.proc == PROC_ST_FUNCTION
928 || (sym->attr.intrinsic && gfc_specific_intrinsic (sym->name))
929 || sym->attr.external)
930 return 1;
932 if (was_declared (sym) || sym->ns->parent == NULL)
933 return 0;
935 gfc_find_symbol (sym->name, sym->ns->parent, 1, &s);
937 return (s == NULL) ? 0 : specific_sym (s);
941 /* Figure out if the procedure is specific, generic or unknown. */
943 typedef enum
944 { PTYPE_GENERIC = 1, PTYPE_SPECIFIC, PTYPE_UNKNOWN }
945 proc_type;
947 static proc_type
948 procedure_kind (gfc_symbol *sym)
950 if (generic_sym (sym))
951 return PTYPE_GENERIC;
953 if (specific_sym (sym))
954 return PTYPE_SPECIFIC;
956 return PTYPE_UNKNOWN;
959 /* Check references to assumed size arrays. The flag need_full_assumed_size
960 is nonzero when matching actual arguments. */
962 static int need_full_assumed_size = 0;
964 static bool
965 check_assumed_size_reference (gfc_symbol *sym, gfc_expr *e)
967 if (need_full_assumed_size || !(sym->as && sym->as->type == AS_ASSUMED_SIZE))
968 return false;
970 if ((e->ref->u.ar.end[e->ref->u.ar.as->rank - 1] == NULL)
971 && (e->ref->u.ar.as->type == AS_ASSUMED_SIZE)
972 && (e->ref->u.ar.type == DIMEN_ELEMENT))
974 gfc_error ("The upper bound in the last dimension must "
975 "appear in the reference to the assumed size "
976 "array '%s' at %L", sym->name, &e->where);
977 return true;
979 return false;
983 /* Look for bad assumed size array references in argument expressions
984 of elemental and array valued intrinsic procedures. Since this is
985 called from procedure resolution functions, it only recurses at
986 operators. */
988 static bool
989 resolve_assumed_size_actual (gfc_expr *e)
991 if (e == NULL)
992 return false;
994 switch (e->expr_type)
996 case EXPR_VARIABLE:
997 if (e->symtree && check_assumed_size_reference (e->symtree->n.sym, e))
998 return true;
999 break;
1001 case EXPR_OP:
1002 if (resolve_assumed_size_actual (e->value.op.op1)
1003 || resolve_assumed_size_actual (e->value.op.op2))
1004 return true;
1005 break;
1007 default:
1008 break;
1010 return false;
1014 /* Resolve an actual argument list. Most of the time, this is just
1015 resolving the expressions in the list.
1016 The exception is that we sometimes have to decide whether arguments
1017 that look like procedure arguments are really simple variable
1018 references. */
1020 static try
1021 resolve_actual_arglist (gfc_actual_arglist *arg, procedure_type ptype)
1023 gfc_symbol *sym;
1024 gfc_symtree *parent_st;
1025 gfc_expr *e;
1026 int save_need_full_assumed_size;
1028 for (; arg; arg = arg->next)
1030 e = arg->expr;
1031 if (e == NULL)
1033 /* Check the label is a valid branching target. */
1034 if (arg->label)
1036 if (arg->label->defined == ST_LABEL_UNKNOWN)
1038 gfc_error ("Label %d referenced at %L is never defined",
1039 arg->label->value, &arg->label->where);
1040 return FAILURE;
1043 continue;
1046 if (e->expr_type == FL_VARIABLE && e->symtree->ambiguous)
1048 gfc_error ("'%s' at %L is ambiguous", e->symtree->n.sym->name,
1049 &e->where);
1050 return FAILURE;
1053 if (e->ts.type != BT_PROCEDURE)
1055 save_need_full_assumed_size = need_full_assumed_size;
1056 if (e->expr_type != FL_VARIABLE)
1057 need_full_assumed_size = 0;
1058 if (gfc_resolve_expr (e) != SUCCESS)
1059 return FAILURE;
1060 need_full_assumed_size = save_need_full_assumed_size;
1061 goto argument_list;
1064 /* See if the expression node should really be a variable reference. */
1066 sym = e->symtree->n.sym;
1068 if (sym->attr.flavor == FL_PROCEDURE
1069 || sym->attr.intrinsic
1070 || sym->attr.external)
1072 int actual_ok;
1074 /* If a procedure is not already determined to be something else
1075 check if it is intrinsic. */
1076 if (!sym->attr.intrinsic
1077 && !(sym->attr.external || sym->attr.use_assoc
1078 || sym->attr.if_source == IFSRC_IFBODY)
1079 && gfc_intrinsic_name (sym->name, sym->attr.subroutine))
1080 sym->attr.intrinsic = 1;
1082 if (sym->attr.proc == PROC_ST_FUNCTION)
1084 gfc_error ("Statement function '%s' at %L is not allowed as an "
1085 "actual argument", sym->name, &e->where);
1088 actual_ok = gfc_intrinsic_actual_ok (sym->name,
1089 sym->attr.subroutine);
1090 if (sym->attr.intrinsic && actual_ok == 0)
1092 gfc_error ("Intrinsic '%s' at %L is not allowed as an "
1093 "actual argument", sym->name, &e->where);
1096 if (sym->attr.contained && !sym->attr.use_assoc
1097 && sym->ns->proc_name->attr.flavor != FL_MODULE)
1099 gfc_error ("Internal procedure '%s' is not allowed as an "
1100 "actual argument at %L", sym->name, &e->where);
1103 if (sym->attr.elemental && !sym->attr.intrinsic)
1105 gfc_error ("ELEMENTAL non-INTRINSIC procedure '%s' is not "
1106 "allowed as an actual argument at %L", sym->name,
1107 &e->where);
1110 /* Check if a generic interface has a specific procedure
1111 with the same name before emitting an error. */
1112 if (sym->attr.generic)
1114 gfc_interface *p;
1115 for (p = sym->generic; p; p = p->next)
1116 if (strcmp (sym->name, p->sym->name) == 0)
1118 e->symtree = gfc_find_symtree
1119 (p->sym->ns->sym_root, sym->name);
1120 sym = p->sym;
1121 break;
1124 if (p == NULL || e->symtree == NULL)
1125 gfc_error ("GENERIC procedure '%s' is not "
1126 "allowed as an actual argument at %L", sym->name,
1127 &e->where);
1130 /* If the symbol is the function that names the current (or
1131 parent) scope, then we really have a variable reference. */
1133 if (sym->attr.function && sym->result == sym
1134 && (sym->ns->proc_name == sym
1135 || (sym->ns->parent != NULL
1136 && sym->ns->parent->proc_name == sym)))
1137 goto got_variable;
1139 /* If all else fails, see if we have a specific intrinsic. */
1140 if (sym->ts.type == BT_UNKNOWN && sym->attr.intrinsic)
1142 gfc_intrinsic_sym *isym;
1144 isym = gfc_find_function (sym->name);
1145 if (isym == NULL || !isym->specific)
1147 gfc_error ("Unable to find a specific INTRINSIC procedure "
1148 "for the reference '%s' at %L", sym->name,
1149 &e->where);
1150 return FAILURE;
1152 sym->ts = isym->ts;
1153 sym->attr.intrinsic = 1;
1154 sym->attr.function = 1;
1156 goto argument_list;
1159 /* See if the name is a module procedure in a parent unit. */
1161 if (was_declared (sym) || sym->ns->parent == NULL)
1162 goto got_variable;
1164 if (gfc_find_sym_tree (sym->name, sym->ns->parent, 1, &parent_st))
1166 gfc_error ("Symbol '%s' at %L is ambiguous", sym->name, &e->where);
1167 return FAILURE;
1170 if (parent_st == NULL)
1171 goto got_variable;
1173 sym = parent_st->n.sym;
1174 e->symtree = parent_st; /* Point to the right thing. */
1176 if (sym->attr.flavor == FL_PROCEDURE
1177 || sym->attr.intrinsic
1178 || sym->attr.external)
1180 goto argument_list;
1183 got_variable:
1184 e->expr_type = EXPR_VARIABLE;
1185 e->ts = sym->ts;
1186 if (sym->as != NULL)
1188 e->rank = sym->as->rank;
1189 e->ref = gfc_get_ref ();
1190 e->ref->type = REF_ARRAY;
1191 e->ref->u.ar.type = AR_FULL;
1192 e->ref->u.ar.as = sym->as;
1195 /* Expressions are assigned a default ts.type of BT_PROCEDURE in
1196 primary.c (match_actual_arg). If above code determines that it
1197 is a variable instead, it needs to be resolved as it was not
1198 done at the beginning of this function. */
1199 save_need_full_assumed_size = need_full_assumed_size;
1200 if (e->expr_type != FL_VARIABLE)
1201 need_full_assumed_size = 0;
1202 if (gfc_resolve_expr (e) != SUCCESS)
1203 return FAILURE;
1204 need_full_assumed_size = save_need_full_assumed_size;
1206 argument_list:
1207 /* Check argument list functions %VAL, %LOC and %REF. There is
1208 nothing to do for %REF. */
1209 if (arg->name && arg->name[0] == '%')
1211 if (strncmp ("%VAL", arg->name, 4) == 0)
1213 if (e->ts.type == BT_CHARACTER || e->ts.type == BT_DERIVED)
1215 gfc_error ("By-value argument at %L is not of numeric "
1216 "type", &e->where);
1217 return FAILURE;
1220 if (e->rank)
1222 gfc_error ("By-value argument at %L cannot be an array or "
1223 "an array section", &e->where);
1224 return FAILURE;
1227 /* Intrinsics are still PROC_UNKNOWN here. However,
1228 since same file external procedures are not resolvable
1229 in gfortran, it is a good deal easier to leave them to
1230 intrinsic.c. */
1231 if (ptype != PROC_UNKNOWN
1232 && ptype != PROC_DUMMY
1233 && ptype != PROC_EXTERNAL
1234 && ptype != PROC_MODULE)
1236 gfc_error ("By-value argument at %L is not allowed "
1237 "in this context", &e->where);
1238 return FAILURE;
1242 /* Statement functions have already been excluded above. */
1243 else if (strncmp ("%LOC", arg->name, 4) == 0
1244 && e->ts.type == BT_PROCEDURE)
1246 if (e->symtree->n.sym->attr.proc == PROC_INTERNAL)
1248 gfc_error ("Passing internal procedure at %L by location "
1249 "not allowed", &e->where);
1250 return FAILURE;
1256 return SUCCESS;
1260 /* Do the checks of the actual argument list that are specific to elemental
1261 procedures. If called with c == NULL, we have a function, otherwise if
1262 expr == NULL, we have a subroutine. */
1264 static try
1265 resolve_elemental_actual (gfc_expr *expr, gfc_code *c)
1267 gfc_actual_arglist *arg0;
1268 gfc_actual_arglist *arg;
1269 gfc_symbol *esym = NULL;
1270 gfc_intrinsic_sym *isym = NULL;
1271 gfc_expr *e = NULL;
1272 gfc_intrinsic_arg *iformal = NULL;
1273 gfc_formal_arglist *eformal = NULL;
1274 bool formal_optional = false;
1275 bool set_by_optional = false;
1276 int i;
1277 int rank = 0;
1279 /* Is this an elemental procedure? */
1280 if (expr && expr->value.function.actual != NULL)
1282 if (expr->value.function.esym != NULL
1283 && expr->value.function.esym->attr.elemental)
1285 arg0 = expr->value.function.actual;
1286 esym = expr->value.function.esym;
1288 else if (expr->value.function.isym != NULL
1289 && expr->value.function.isym->elemental)
1291 arg0 = expr->value.function.actual;
1292 isym = expr->value.function.isym;
1294 else
1295 return SUCCESS;
1297 else if (c && c->ext.actual != NULL && c->symtree->n.sym->attr.elemental)
1299 arg0 = c->ext.actual;
1300 esym = c->symtree->n.sym;
1302 else
1303 return SUCCESS;
1305 /* The rank of an elemental is the rank of its array argument(s). */
1306 for (arg = arg0; arg; arg = arg->next)
1308 if (arg->expr != NULL && arg->expr->rank > 0)
1310 rank = arg->expr->rank;
1311 if (arg->expr->expr_type == EXPR_VARIABLE
1312 && arg->expr->symtree->n.sym->attr.optional)
1313 set_by_optional = true;
1315 /* Function specific; set the result rank and shape. */
1316 if (expr)
1318 expr->rank = rank;
1319 if (!expr->shape && arg->expr->shape)
1321 expr->shape = gfc_get_shape (rank);
1322 for (i = 0; i < rank; i++)
1323 mpz_init_set (expr->shape[i], arg->expr->shape[i]);
1326 break;
1330 /* If it is an array, it shall not be supplied as an actual argument
1331 to an elemental procedure unless an array of the same rank is supplied
1332 as an actual argument corresponding to a nonoptional dummy argument of
1333 that elemental procedure(12.4.1.5). */
1334 formal_optional = false;
1335 if (isym)
1336 iformal = isym->formal;
1337 else
1338 eformal = esym->formal;
1340 for (arg = arg0; arg; arg = arg->next)
1342 if (eformal)
1344 if (eformal->sym && eformal->sym->attr.optional)
1345 formal_optional = true;
1346 eformal = eformal->next;
1348 else if (isym && iformal)
1350 if (iformal->optional)
1351 formal_optional = true;
1352 iformal = iformal->next;
1354 else if (isym)
1355 formal_optional = true;
1357 if (pedantic && arg->expr != NULL
1358 && arg->expr->expr_type == EXPR_VARIABLE
1359 && arg->expr->symtree->n.sym->attr.optional
1360 && formal_optional
1361 && arg->expr->rank
1362 && (set_by_optional || arg->expr->rank != rank)
1363 && !(isym && isym->id == GFC_ISYM_CONVERSION))
1365 gfc_warning ("'%s' at %L is an array and OPTIONAL; IF IT IS "
1366 "MISSING, it cannot be the actual argument of an "
1367 "ELEMENTAL procedure unless there is a non-optional "
1368 "argument with the same rank (12.4.1.5)",
1369 arg->expr->symtree->n.sym->name, &arg->expr->where);
1370 return FAILURE;
1374 for (arg = arg0; arg; arg = arg->next)
1376 if (arg->expr == NULL || arg->expr->rank == 0)
1377 continue;
1379 /* Being elemental, the last upper bound of an assumed size array
1380 argument must be present. */
1381 if (resolve_assumed_size_actual (arg->expr))
1382 return FAILURE;
1384 /* Elemental procedure's array actual arguments must conform. */
1385 if (e != NULL)
1387 if (gfc_check_conformance ("elemental procedure", arg->expr, e)
1388 == FAILURE)
1389 return FAILURE;
1391 else
1392 e = arg->expr;
1395 /* INTENT(OUT) is only allowed for subroutines; if any actual argument
1396 is an array, the intent inout/out variable needs to be also an array. */
1397 if (rank > 0 && esym && expr == NULL)
1398 for (eformal = esym->formal, arg = arg0; arg && eformal;
1399 arg = arg->next, eformal = eformal->next)
1400 if ((eformal->sym->attr.intent == INTENT_OUT
1401 || eformal->sym->attr.intent == INTENT_INOUT)
1402 && arg->expr && arg->expr->rank == 0)
1404 gfc_error ("Actual argument at %L for INTENT(%s) dummy '%s' of "
1405 "ELEMENTAL subroutine '%s' is a scalar, but another "
1406 "actual argument is an array", &arg->expr->where,
1407 (eformal->sym->attr.intent == INTENT_OUT) ? "OUT"
1408 : "INOUT", eformal->sym->name, esym->name);
1409 return FAILURE;
1411 return SUCCESS;
1415 /* Go through each actual argument in ACTUAL and see if it can be
1416 implemented as an inlined, non-copying intrinsic. FNSYM is the
1417 function being called, or NULL if not known. */
1419 static void
1420 find_noncopying_intrinsics (gfc_symbol *fnsym, gfc_actual_arglist *actual)
1422 gfc_actual_arglist *ap;
1423 gfc_expr *expr;
1425 for (ap = actual; ap; ap = ap->next)
1426 if (ap->expr
1427 && (expr = gfc_get_noncopying_intrinsic_argument (ap->expr))
1428 && !gfc_check_fncall_dependency (expr, INTENT_IN, fnsym, actual))
1429 ap->expr->inline_noncopying_intrinsic = 1;
1433 /* This function does the checking of references to global procedures
1434 as defined in sections 18.1 and 14.1, respectively, of the Fortran
1435 77 and 95 standards. It checks for a gsymbol for the name, making
1436 one if it does not already exist. If it already exists, then the
1437 reference being resolved must correspond to the type of gsymbol.
1438 Otherwise, the new symbol is equipped with the attributes of the
1439 reference. The corresponding code that is called in creating
1440 global entities is parse.c. */
1442 static void
1443 resolve_global_procedure (gfc_symbol *sym, locus *where, int sub)
1445 gfc_gsymbol * gsym;
1446 unsigned int type;
1448 type = sub ? GSYM_SUBROUTINE : GSYM_FUNCTION;
1450 gsym = gfc_get_gsymbol (sym->name);
1452 if ((gsym->type != GSYM_UNKNOWN && gsym->type != type))
1453 gfc_global_used (gsym, where);
1455 if (gsym->type == GSYM_UNKNOWN)
1457 gsym->type = type;
1458 gsym->where = *where;
1461 gsym->used = 1;
1465 /************* Function resolution *************/
1467 /* Resolve a function call known to be generic.
1468 Section 14.1.2.4.1. */
1470 static match
1471 resolve_generic_f0 (gfc_expr *expr, gfc_symbol *sym)
1473 gfc_symbol *s;
1475 if (sym->attr.generic)
1477 s = gfc_search_interface (sym->generic, 0, &expr->value.function.actual);
1478 if (s != NULL)
1480 expr->value.function.name = s->name;
1481 expr->value.function.esym = s;
1483 if (s->ts.type != BT_UNKNOWN)
1484 expr->ts = s->ts;
1485 else if (s->result != NULL && s->result->ts.type != BT_UNKNOWN)
1486 expr->ts = s->result->ts;
1488 if (s->as != NULL)
1489 expr->rank = s->as->rank;
1490 else if (s->result != NULL && s->result->as != NULL)
1491 expr->rank = s->result->as->rank;
1493 gfc_set_sym_referenced (expr->value.function.esym);
1495 return MATCH_YES;
1498 /* TODO: Need to search for elemental references in generic
1499 interface. */
1502 if (sym->attr.intrinsic)
1503 return gfc_intrinsic_func_interface (expr, 0);
1505 return MATCH_NO;
1509 static try
1510 resolve_generic_f (gfc_expr *expr)
1512 gfc_symbol *sym;
1513 match m;
1515 sym = expr->symtree->n.sym;
1517 for (;;)
1519 m = resolve_generic_f0 (expr, sym);
1520 if (m == MATCH_YES)
1521 return SUCCESS;
1522 else if (m == MATCH_ERROR)
1523 return FAILURE;
1525 generic:
1526 if (sym->ns->parent == NULL)
1527 break;
1528 gfc_find_symbol (sym->name, sym->ns->parent, 1, &sym);
1530 if (sym == NULL)
1531 break;
1532 if (!generic_sym (sym))
1533 goto generic;
1536 /* Last ditch attempt. See if the reference is to an intrinsic
1537 that possesses a matching interface. 14.1.2.4 */
1538 if (sym && !gfc_intrinsic_name (sym->name, 0))
1540 gfc_error ("There is no specific function for the generic '%s' at %L",
1541 expr->symtree->n.sym->name, &expr->where);
1542 return FAILURE;
1545 m = gfc_intrinsic_func_interface (expr, 0);
1546 if (m == MATCH_YES)
1547 return SUCCESS;
1548 if (m == MATCH_NO)
1549 gfc_error ("Generic function '%s' at %L is not consistent with a "
1550 "specific intrinsic interface", expr->symtree->n.sym->name,
1551 &expr->where);
1553 return FAILURE;
1557 /* Resolve a function call known to be specific. */
1559 static match
1560 resolve_specific_f0 (gfc_symbol *sym, gfc_expr *expr)
1562 match m;
1564 /* See if we have an intrinsic interface. */
1566 if (sym->ts.interface != NULL && sym->ts.interface->attr.intrinsic)
1568 gfc_intrinsic_sym *isym;
1569 isym = gfc_find_function (sym->ts.interface->name);
1571 /* Existance of isym should be checked already. */
1572 gcc_assert (isym);
1574 sym->ts.type = isym->ts.type;
1575 sym->ts.kind = isym->ts.kind;
1576 sym->attr.function = 1;
1577 sym->attr.proc = PROC_EXTERNAL;
1578 goto found;
1581 if (sym->attr.external || sym->attr.if_source == IFSRC_IFBODY)
1583 if (sym->attr.dummy)
1585 sym->attr.proc = PROC_DUMMY;
1586 goto found;
1589 sym->attr.proc = PROC_EXTERNAL;
1590 goto found;
1593 if (sym->attr.proc == PROC_MODULE
1594 || sym->attr.proc == PROC_ST_FUNCTION
1595 || sym->attr.proc == PROC_INTERNAL)
1596 goto found;
1598 if (sym->attr.intrinsic)
1600 m = gfc_intrinsic_func_interface (expr, 1);
1601 if (m == MATCH_YES)
1602 return MATCH_YES;
1603 if (m == MATCH_NO)
1604 gfc_error ("Function '%s' at %L is INTRINSIC but is not compatible "
1605 "with an intrinsic", sym->name, &expr->where);
1607 return MATCH_ERROR;
1610 return MATCH_NO;
1612 found:
1613 gfc_procedure_use (sym, &expr->value.function.actual, &expr->where);
1615 expr->ts = sym->ts;
1616 expr->value.function.name = sym->name;
1617 expr->value.function.esym = sym;
1618 if (sym->as != NULL)
1619 expr->rank = sym->as->rank;
1621 return MATCH_YES;
1625 static try
1626 resolve_specific_f (gfc_expr *expr)
1628 gfc_symbol *sym;
1629 match m;
1631 sym = expr->symtree->n.sym;
1633 for (;;)
1635 m = resolve_specific_f0 (sym, expr);
1636 if (m == MATCH_YES)
1637 return SUCCESS;
1638 if (m == MATCH_ERROR)
1639 return FAILURE;
1641 if (sym->ns->parent == NULL)
1642 break;
1644 gfc_find_symbol (sym->name, sym->ns->parent, 1, &sym);
1646 if (sym == NULL)
1647 break;
1650 gfc_error ("Unable to resolve the specific function '%s' at %L",
1651 expr->symtree->n.sym->name, &expr->where);
1653 return SUCCESS;
1657 /* Resolve a procedure call not known to be generic nor specific. */
1659 static try
1660 resolve_unknown_f (gfc_expr *expr)
1662 gfc_symbol *sym;
1663 gfc_typespec *ts;
1665 sym = expr->symtree->n.sym;
1667 if (sym->attr.dummy)
1669 sym->attr.proc = PROC_DUMMY;
1670 expr->value.function.name = sym->name;
1671 goto set_type;
1674 /* See if we have an intrinsic function reference. */
1676 if (gfc_intrinsic_name (sym->name, 0))
1678 if (gfc_intrinsic_func_interface (expr, 1) == MATCH_YES)
1679 return SUCCESS;
1680 return FAILURE;
1683 /* The reference is to an external name. */
1685 sym->attr.proc = PROC_EXTERNAL;
1686 expr->value.function.name = sym->name;
1687 expr->value.function.esym = expr->symtree->n.sym;
1689 if (sym->as != NULL)
1690 expr->rank = sym->as->rank;
1692 /* Type of the expression is either the type of the symbol or the
1693 default type of the symbol. */
1695 set_type:
1696 gfc_procedure_use (sym, &expr->value.function.actual, &expr->where);
1698 if (sym->ts.type != BT_UNKNOWN)
1699 expr->ts = sym->ts;
1700 else
1702 ts = gfc_get_default_type (sym, sym->ns);
1704 if (ts->type == BT_UNKNOWN)
1706 gfc_error ("Function '%s' at %L has no IMPLICIT type",
1707 sym->name, &expr->where);
1708 return FAILURE;
1710 else
1711 expr->ts = *ts;
1714 return SUCCESS;
1718 /* Return true, if the symbol is an external procedure. */
1719 static bool
1720 is_external_proc (gfc_symbol *sym)
1722 if (!sym->attr.dummy && !sym->attr.contained
1723 && !(sym->attr.intrinsic
1724 || gfc_intrinsic_name (sym->name, sym->attr.subroutine))
1725 && sym->attr.proc != PROC_ST_FUNCTION
1726 && !sym->attr.use_assoc
1727 && sym->name)
1728 return true;
1729 else
1730 return false;
1734 /* Figure out if a function reference is pure or not. Also set the name
1735 of the function for a potential error message. Return nonzero if the
1736 function is PURE, zero if not. */
1737 static int
1738 pure_stmt_function (gfc_expr *, gfc_symbol *);
1740 static int
1741 pure_function (gfc_expr *e, const char **name)
1743 int pure;
1745 *name = NULL;
1747 if (e->symtree != NULL
1748 && e->symtree->n.sym != NULL
1749 && e->symtree->n.sym->attr.proc == PROC_ST_FUNCTION)
1750 return pure_stmt_function (e, e->symtree->n.sym);
1752 if (e->value.function.esym)
1754 pure = gfc_pure (e->value.function.esym);
1755 *name = e->value.function.esym->name;
1757 else if (e->value.function.isym)
1759 pure = e->value.function.isym->pure
1760 || e->value.function.isym->elemental;
1761 *name = e->value.function.isym->name;
1763 else
1765 /* Implicit functions are not pure. */
1766 pure = 0;
1767 *name = e->value.function.name;
1770 return pure;
1774 static bool
1775 impure_stmt_fcn (gfc_expr *e, gfc_symbol *sym,
1776 int *f ATTRIBUTE_UNUSED)
1778 const char *name;
1780 /* Don't bother recursing into other statement functions
1781 since they will be checked individually for purity. */
1782 if (e->expr_type != EXPR_FUNCTION
1783 || !e->symtree
1784 || e->symtree->n.sym == sym
1785 || e->symtree->n.sym->attr.proc == PROC_ST_FUNCTION)
1786 return false;
1788 return pure_function (e, &name) ? false : true;
1792 static int
1793 pure_stmt_function (gfc_expr *e, gfc_symbol *sym)
1795 return gfc_traverse_expr (e, sym, impure_stmt_fcn, 0) ? 0 : 1;
1799 static try
1800 is_scalar_expr_ptr (gfc_expr *expr)
1802 try retval = SUCCESS;
1803 gfc_ref *ref;
1804 int start;
1805 int end;
1807 /* See if we have a gfc_ref, which means we have a substring, array
1808 reference, or a component. */
1809 if (expr->ref != NULL)
1811 ref = expr->ref;
1812 while (ref->next != NULL)
1813 ref = ref->next;
1815 switch (ref->type)
1817 case REF_SUBSTRING:
1818 if (ref->u.ss.length != NULL
1819 && ref->u.ss.length->length != NULL
1820 && ref->u.ss.start
1821 && ref->u.ss.start->expr_type == EXPR_CONSTANT
1822 && ref->u.ss.end
1823 && ref->u.ss.end->expr_type == EXPR_CONSTANT)
1825 start = (int) mpz_get_si (ref->u.ss.start->value.integer);
1826 end = (int) mpz_get_si (ref->u.ss.end->value.integer);
1827 if (end - start + 1 != 1)
1828 retval = FAILURE;
1830 else
1831 retval = FAILURE;
1832 break;
1833 case REF_ARRAY:
1834 if (ref->u.ar.type == AR_ELEMENT)
1835 retval = SUCCESS;
1836 else if (ref->u.ar.type == AR_FULL)
1838 /* The user can give a full array if the array is of size 1. */
1839 if (ref->u.ar.as != NULL
1840 && ref->u.ar.as->rank == 1
1841 && ref->u.ar.as->type == AS_EXPLICIT
1842 && ref->u.ar.as->lower[0] != NULL
1843 && ref->u.ar.as->lower[0]->expr_type == EXPR_CONSTANT
1844 && ref->u.ar.as->upper[0] != NULL
1845 && ref->u.ar.as->upper[0]->expr_type == EXPR_CONSTANT)
1847 /* If we have a character string, we need to check if
1848 its length is one. */
1849 if (expr->ts.type == BT_CHARACTER)
1851 if (expr->ts.cl == NULL
1852 || expr->ts.cl->length == NULL
1853 || mpz_cmp_si (expr->ts.cl->length->value.integer, 1)
1854 != 0)
1855 retval = FAILURE;
1857 else
1859 /* We have constant lower and upper bounds. If the
1860 difference between is 1, it can be considered a
1861 scalar. */
1862 start = (int) mpz_get_si
1863 (ref->u.ar.as->lower[0]->value.integer);
1864 end = (int) mpz_get_si
1865 (ref->u.ar.as->upper[0]->value.integer);
1866 if (end - start + 1 != 1)
1867 retval = FAILURE;
1870 else
1871 retval = FAILURE;
1873 else
1874 retval = FAILURE;
1875 break;
1876 default:
1877 retval = SUCCESS;
1878 break;
1881 else if (expr->ts.type == BT_CHARACTER && expr->rank == 0)
1883 /* Character string. Make sure it's of length 1. */
1884 if (expr->ts.cl == NULL
1885 || expr->ts.cl->length == NULL
1886 || mpz_cmp_si (expr->ts.cl->length->value.integer, 1) != 0)
1887 retval = FAILURE;
1889 else if (expr->rank != 0)
1890 retval = FAILURE;
1892 return retval;
1896 /* Match one of the iso_c_binding functions (c_associated or c_loc)
1897 and, in the case of c_associated, set the binding label based on
1898 the arguments. */
1900 static try
1901 gfc_iso_c_func_interface (gfc_symbol *sym, gfc_actual_arglist *args,
1902 gfc_symbol **new_sym)
1904 char name[GFC_MAX_SYMBOL_LEN + 1];
1905 char binding_label[GFC_MAX_BINDING_LABEL_LEN + 1];
1906 int optional_arg = 0;
1907 try retval = SUCCESS;
1908 gfc_symbol *args_sym;
1909 gfc_typespec *arg_ts;
1910 gfc_ref *parent_ref;
1911 gfc_ref *curr_ref;
1913 if (args->expr->expr_type == EXPR_CONSTANT
1914 || args->expr->expr_type == EXPR_OP
1915 || args->expr->expr_type == EXPR_NULL)
1917 gfc_error ("Argument to '%s' at %L is not a variable",
1918 sym->name, &(args->expr->where));
1919 return FAILURE;
1922 args_sym = args->expr->symtree->n.sym;
1924 /* The typespec for the actual arg should be that stored in the expr
1925 and not necessarily that of the expr symbol (args_sym), because
1926 the actual expression could be a part-ref of the expr symbol. */
1927 arg_ts = &(args->expr->ts);
1929 /* Get the parent reference (if any) for the expression. This happens for
1930 cases such as a%b%c. */
1931 parent_ref = args->expr->ref;
1932 curr_ref = NULL;
1933 if (parent_ref != NULL)
1935 curr_ref = parent_ref->next;
1936 while (curr_ref != NULL && curr_ref->next != NULL)
1938 parent_ref = curr_ref;
1939 curr_ref = curr_ref->next;
1943 /* If curr_ref is non-NULL, we had a part-ref expression. If the curr_ref
1944 is for a REF_COMPONENT, then we need to use it as the parent_ref for
1945 the name, etc. Otherwise, the current parent_ref should be correct. */
1946 if (curr_ref != NULL && curr_ref->type == REF_COMPONENT)
1947 parent_ref = curr_ref;
1949 if (parent_ref == args->expr->ref)
1950 parent_ref = NULL;
1951 else if (parent_ref != NULL && parent_ref->type != REF_COMPONENT)
1952 gfc_internal_error ("Unexpected expression reference type in "
1953 "gfc_iso_c_func_interface");
1955 if (sym->intmod_sym_id == ISOCBINDING_ASSOCIATED)
1957 /* If the user gave two args then they are providing something for
1958 the optional arg (the second cptr). Therefore, set the name and
1959 binding label to the c_associated for two cptrs. Otherwise,
1960 set c_associated to expect one cptr. */
1961 if (args->next)
1963 /* two args. */
1964 sprintf (name, "%s_2", sym->name);
1965 sprintf (binding_label, "%s_2", sym->binding_label);
1966 optional_arg = 1;
1968 else
1970 /* one arg. */
1971 sprintf (name, "%s_1", sym->name);
1972 sprintf (binding_label, "%s_1", sym->binding_label);
1973 optional_arg = 0;
1976 /* Get a new symbol for the version of c_associated that
1977 will get called. */
1978 *new_sym = get_iso_c_sym (sym, name, binding_label, optional_arg);
1980 else if (sym->intmod_sym_id == ISOCBINDING_LOC
1981 || sym->intmod_sym_id == ISOCBINDING_FUNLOC)
1983 sprintf (name, "%s", sym->name);
1984 sprintf (binding_label, "%s", sym->binding_label);
1986 /* Error check the call. */
1987 if (args->next != NULL)
1989 gfc_error_now ("More actual than formal arguments in '%s' "
1990 "call at %L", name, &(args->expr->where));
1991 retval = FAILURE;
1993 else if (sym->intmod_sym_id == ISOCBINDING_LOC)
1995 /* Make sure we have either the target or pointer attribute. */
1996 if (!(args_sym->attr.target)
1997 && !(args_sym->attr.pointer)
1998 && (parent_ref == NULL ||
1999 !parent_ref->u.c.component->pointer))
2001 gfc_error_now ("Parameter '%s' to '%s' at %L must be either "
2002 "a TARGET or an associated pointer",
2003 args_sym->name,
2004 sym->name, &(args->expr->where));
2005 retval = FAILURE;
2008 /* See if we have interoperable type and type param. */
2009 if (verify_c_interop (arg_ts,
2010 (parent_ref ? parent_ref->u.c.component->name
2011 : args_sym->name),
2012 &(args->expr->where)) == SUCCESS
2013 || gfc_check_any_c_kind (arg_ts) == SUCCESS)
2015 if (args_sym->attr.target == 1)
2017 /* Case 1a, section 15.1.2.5, J3/04-007: variable that
2018 has the target attribute and is interoperable. */
2019 /* Case 1b, section 15.1.2.5, J3/04-007: allocated
2020 allocatable variable that has the TARGET attribute and
2021 is not an array of zero size. */
2022 if (args_sym->attr.allocatable == 1)
2024 if (args_sym->attr.dimension != 0
2025 && (args_sym->as && args_sym->as->rank == 0))
2027 gfc_error_now ("Allocatable variable '%s' used as a "
2028 "parameter to '%s' at %L must not be "
2029 "an array of zero size",
2030 args_sym->name, sym->name,
2031 &(args->expr->where));
2032 retval = FAILURE;
2035 else
2037 /* A non-allocatable target variable with C
2038 interoperable type and type parameters must be
2039 interoperable. */
2040 if (args_sym && args_sym->attr.dimension)
2042 if (args_sym->as->type == AS_ASSUMED_SHAPE)
2044 gfc_error ("Assumed-shape array '%s' at %L "
2045 "cannot be an argument to the "
2046 "procedure '%s' because "
2047 "it is not C interoperable",
2048 args_sym->name,
2049 &(args->expr->where), sym->name);
2050 retval = FAILURE;
2052 else if (args_sym->as->type == AS_DEFERRED)
2054 gfc_error ("Deferred-shape array '%s' at %L "
2055 "cannot be an argument to the "
2056 "procedure '%s' because "
2057 "it is not C interoperable",
2058 args_sym->name,
2059 &(args->expr->where), sym->name);
2060 retval = FAILURE;
2064 /* Make sure it's not a character string. Arrays of
2065 any type should be ok if the variable is of a C
2066 interoperable type. */
2067 if (arg_ts->type == BT_CHARACTER)
2068 if (arg_ts->cl != NULL
2069 && (arg_ts->cl->length == NULL
2070 || arg_ts->cl->length->expr_type
2071 != EXPR_CONSTANT
2072 || mpz_cmp_si
2073 (arg_ts->cl->length->value.integer, 1)
2074 != 0)
2075 && is_scalar_expr_ptr (args->expr) != SUCCESS)
2077 gfc_error_now ("CHARACTER argument '%s' to '%s' "
2078 "at %L must have a length of 1",
2079 args_sym->name, sym->name,
2080 &(args->expr->where));
2081 retval = FAILURE;
2085 else if ((args_sym->attr.pointer == 1 ||
2086 (parent_ref != NULL
2087 && parent_ref->u.c.component->pointer))
2088 && is_scalar_expr_ptr (args->expr) != SUCCESS)
2090 /* Case 1c, section 15.1.2.5, J3/04-007: an associated
2091 scalar pointer. */
2092 gfc_error_now ("Argument '%s' to '%s' at %L must be an "
2093 "associated scalar POINTER", args_sym->name,
2094 sym->name, &(args->expr->where));
2095 retval = FAILURE;
2098 else
2100 /* The parameter is not required to be C interoperable. If it
2101 is not C interoperable, it must be a nonpolymorphic scalar
2102 with no length type parameters. It still must have either
2103 the pointer or target attribute, and it can be
2104 allocatable (but must be allocated when c_loc is called). */
2105 if (args->expr->rank != 0
2106 && is_scalar_expr_ptr (args->expr) != SUCCESS)
2108 gfc_error_now ("Parameter '%s' to '%s' at %L must be a "
2109 "scalar", args_sym->name, sym->name,
2110 &(args->expr->where));
2111 retval = FAILURE;
2113 else if (arg_ts->type == BT_CHARACTER
2114 && is_scalar_expr_ptr (args->expr) != SUCCESS)
2116 gfc_error_now ("CHARACTER argument '%s' to '%s' at "
2117 "%L must have a length of 1",
2118 args_sym->name, sym->name,
2119 &(args->expr->where));
2120 retval = FAILURE;
2124 else if (sym->intmod_sym_id == ISOCBINDING_FUNLOC)
2126 if (args_sym->attr.flavor != FL_PROCEDURE)
2128 /* TODO: Update this error message to allow for procedure
2129 pointers once they are implemented. */
2130 gfc_error_now ("Parameter '%s' to '%s' at %L must be a "
2131 "procedure",
2132 args_sym->name, sym->name,
2133 &(args->expr->where));
2134 retval = FAILURE;
2136 else if (args_sym->attr.is_bind_c != 1)
2138 gfc_error_now ("Parameter '%s' to '%s' at %L must be "
2139 "BIND(C)",
2140 args_sym->name, sym->name,
2141 &(args->expr->where));
2142 retval = FAILURE;
2146 /* for c_loc/c_funloc, the new symbol is the same as the old one */
2147 *new_sym = sym;
2149 else
2151 gfc_internal_error ("gfc_iso_c_func_interface(): Unhandled "
2152 "iso_c_binding function: '%s'!\n", sym->name);
2155 return retval;
2159 /* Resolve a function call, which means resolving the arguments, then figuring
2160 out which entity the name refers to. */
2161 /* TODO: Check procedure arguments so that an INTENT(IN) isn't passed
2162 to INTENT(OUT) or INTENT(INOUT). */
2164 static try
2165 resolve_function (gfc_expr *expr)
2167 gfc_actual_arglist *arg;
2168 gfc_symbol *sym;
2169 const char *name;
2170 try t;
2171 int temp;
2172 procedure_type p = PROC_INTRINSIC;
2174 sym = NULL;
2175 if (expr->symtree)
2176 sym = expr->symtree->n.sym;
2178 if (sym && sym->attr.flavor == FL_VARIABLE)
2180 gfc_error ("'%s' at %L is not a function", sym->name, &expr->where);
2181 return FAILURE;
2184 if (sym && sym->attr.abstract)
2186 gfc_error ("ABSTRACT INTERFACE '%s' must not be referenced at %L",
2187 sym->name, &expr->where);
2188 return FAILURE;
2191 /* If the procedure is external, check for usage. */
2192 if (sym && is_external_proc (sym))
2193 resolve_global_procedure (sym, &expr->where, 0);
2195 /* Switch off assumed size checking and do this again for certain kinds
2196 of procedure, once the procedure itself is resolved. */
2197 need_full_assumed_size++;
2199 if (expr->symtree && expr->symtree->n.sym)
2200 p = expr->symtree->n.sym->attr.proc;
2202 if (resolve_actual_arglist (expr->value.function.actual, p) == FAILURE)
2203 return FAILURE;
2205 /* Need to setup the call to the correct c_associated, depending on
2206 the number of cptrs to user gives to compare. */
2207 if (sym && sym->attr.is_iso_c == 1)
2209 if (gfc_iso_c_func_interface (sym, expr->value.function.actual, &sym)
2210 == FAILURE)
2211 return FAILURE;
2213 /* Get the symtree for the new symbol (resolved func).
2214 the old one will be freed later, when it's no longer used. */
2215 gfc_find_sym_tree (sym->name, sym->ns, 1, &(expr->symtree));
2218 /* Resume assumed_size checking. */
2219 need_full_assumed_size--;
2221 if (sym && sym->ts.type == BT_CHARACTER
2222 && sym->ts.cl
2223 && sym->ts.cl->length == NULL
2224 && !sym->attr.dummy
2225 && expr->value.function.esym == NULL
2226 && !sym->attr.contained)
2228 /* Internal procedures are taken care of in resolve_contained_fntype. */
2229 gfc_error ("Function '%s' is declared CHARACTER(*) and cannot "
2230 "be used at %L since it is not a dummy argument",
2231 sym->name, &expr->where);
2232 return FAILURE;
2235 /* See if function is already resolved. */
2237 if (expr->value.function.name != NULL)
2239 if (expr->ts.type == BT_UNKNOWN)
2240 expr->ts = sym->ts;
2241 t = SUCCESS;
2243 else
2245 /* Apply the rules of section 14.1.2. */
2247 switch (procedure_kind (sym))
2249 case PTYPE_GENERIC:
2250 t = resolve_generic_f (expr);
2251 break;
2253 case PTYPE_SPECIFIC:
2254 t = resolve_specific_f (expr);
2255 break;
2257 case PTYPE_UNKNOWN:
2258 t = resolve_unknown_f (expr);
2259 break;
2261 default:
2262 gfc_internal_error ("resolve_function(): bad function type");
2266 /* If the expression is still a function (it might have simplified),
2267 then we check to see if we are calling an elemental function. */
2269 if (expr->expr_type != EXPR_FUNCTION)
2270 return t;
2272 temp = need_full_assumed_size;
2273 need_full_assumed_size = 0;
2275 if (resolve_elemental_actual (expr, NULL) == FAILURE)
2276 return FAILURE;
2278 if (omp_workshare_flag
2279 && expr->value.function.esym
2280 && ! gfc_elemental (expr->value.function.esym))
2282 gfc_error ("User defined non-ELEMENTAL function '%s' at %L not allowed "
2283 "in WORKSHARE construct", expr->value.function.esym->name,
2284 &expr->where);
2285 t = FAILURE;
2288 #define GENERIC_ID expr->value.function.isym->id
2289 else if (expr->value.function.actual != NULL
2290 && expr->value.function.isym != NULL
2291 && GENERIC_ID != GFC_ISYM_LBOUND
2292 && GENERIC_ID != GFC_ISYM_LEN
2293 && GENERIC_ID != GFC_ISYM_LOC
2294 && GENERIC_ID != GFC_ISYM_PRESENT)
2296 /* Array intrinsics must also have the last upper bound of an
2297 assumed size array argument. UBOUND and SIZE have to be
2298 excluded from the check if the second argument is anything
2299 than a constant. */
2300 int inquiry;
2301 inquiry = GENERIC_ID == GFC_ISYM_UBOUND
2302 || GENERIC_ID == GFC_ISYM_SIZE;
2304 for (arg = expr->value.function.actual; arg; arg = arg->next)
2306 if (inquiry && arg->next != NULL && arg->next->expr)
2308 if (arg->next->expr->expr_type != EXPR_CONSTANT)
2309 break;
2311 if ((int)mpz_get_si (arg->next->expr->value.integer)
2312 < arg->expr->rank)
2313 break;
2316 if (arg->expr != NULL
2317 && arg->expr->rank > 0
2318 && resolve_assumed_size_actual (arg->expr))
2319 return FAILURE;
2322 #undef GENERIC_ID
2324 need_full_assumed_size = temp;
2325 name = NULL;
2327 if (!pure_function (expr, &name) && name)
2329 if (forall_flag)
2331 gfc_error ("reference to non-PURE function '%s' at %L inside a "
2332 "FORALL %s", name, &expr->where,
2333 forall_flag == 2 ? "mask" : "block");
2334 t = FAILURE;
2336 else if (gfc_pure (NULL))
2338 gfc_error ("Function reference to '%s' at %L is to a non-PURE "
2339 "procedure within a PURE procedure", name, &expr->where);
2340 t = FAILURE;
2344 /* Functions without the RECURSIVE attribution are not allowed to
2345 * call themselves. */
2346 if (expr->value.function.esym && !expr->value.function.esym->attr.recursive)
2348 gfc_symbol *esym, *proc;
2349 esym = expr->value.function.esym;
2350 proc = gfc_current_ns->proc_name;
2351 if (esym == proc)
2353 gfc_error ("Function '%s' at %L cannot call itself, as it is not "
2354 "RECURSIVE", name, &expr->where);
2355 t = FAILURE;
2358 if (esym->attr.entry && esym->ns->entries && proc->ns->entries
2359 && esym->ns->entries->sym == proc->ns->entries->sym)
2361 gfc_error ("Call to ENTRY '%s' at %L is recursive, but function "
2362 "'%s' is not declared as RECURSIVE",
2363 esym->name, &expr->where, esym->ns->entries->sym->name);
2364 t = FAILURE;
2368 /* Character lengths of use associated functions may contains references to
2369 symbols not referenced from the current program unit otherwise. Make sure
2370 those symbols are marked as referenced. */
2372 if (expr->ts.type == BT_CHARACTER && expr->value.function.esym
2373 && expr->value.function.esym->attr.use_assoc)
2375 gfc_expr_set_symbols_referenced (expr->ts.cl->length);
2378 if (t == SUCCESS
2379 && !((expr->value.function.esym
2380 && expr->value.function.esym->attr.elemental)
2382 (expr->value.function.isym
2383 && expr->value.function.isym->elemental)))
2384 find_noncopying_intrinsics (expr->value.function.esym,
2385 expr->value.function.actual);
2387 /* Make sure that the expression has a typespec that works. */
2388 if (expr->ts.type == BT_UNKNOWN)
2390 if (expr->symtree->n.sym->result
2391 && expr->symtree->n.sym->result->ts.type != BT_UNKNOWN)
2392 expr->ts = expr->symtree->n.sym->result->ts;
2395 return t;
2399 /************* Subroutine resolution *************/
2401 static void
2402 pure_subroutine (gfc_code *c, gfc_symbol *sym)
2404 if (gfc_pure (sym))
2405 return;
2407 if (forall_flag)
2408 gfc_error ("Subroutine call to '%s' in FORALL block at %L is not PURE",
2409 sym->name, &c->loc);
2410 else if (gfc_pure (NULL))
2411 gfc_error ("Subroutine call to '%s' at %L is not PURE", sym->name,
2412 &c->loc);
2416 static match
2417 resolve_generic_s0 (gfc_code *c, gfc_symbol *sym)
2419 gfc_symbol *s;
2421 if (sym->attr.generic)
2423 s = gfc_search_interface (sym->generic, 1, &c->ext.actual);
2424 if (s != NULL)
2426 c->resolved_sym = s;
2427 pure_subroutine (c, s);
2428 return MATCH_YES;
2431 /* TODO: Need to search for elemental references in generic interface. */
2434 if (sym->attr.intrinsic)
2435 return gfc_intrinsic_sub_interface (c, 0);
2437 return MATCH_NO;
2441 static try
2442 resolve_generic_s (gfc_code *c)
2444 gfc_symbol *sym;
2445 match m;
2447 sym = c->symtree->n.sym;
2449 for (;;)
2451 m = resolve_generic_s0 (c, sym);
2452 if (m == MATCH_YES)
2453 return SUCCESS;
2454 else if (m == MATCH_ERROR)
2455 return FAILURE;
2457 generic:
2458 if (sym->ns->parent == NULL)
2459 break;
2460 gfc_find_symbol (sym->name, sym->ns->parent, 1, &sym);
2462 if (sym == NULL)
2463 break;
2464 if (!generic_sym (sym))
2465 goto generic;
2468 /* Last ditch attempt. See if the reference is to an intrinsic
2469 that possesses a matching interface. 14.1.2.4 */
2470 sym = c->symtree->n.sym;
2472 if (!gfc_intrinsic_name (sym->name, 1))
2474 gfc_error ("There is no specific subroutine for the generic '%s' at %L",
2475 sym->name, &c->loc);
2476 return FAILURE;
2479 m = gfc_intrinsic_sub_interface (c, 0);
2480 if (m == MATCH_YES)
2481 return SUCCESS;
2482 if (m == MATCH_NO)
2483 gfc_error ("Generic subroutine '%s' at %L is not consistent with an "
2484 "intrinsic subroutine interface", sym->name, &c->loc);
2486 return FAILURE;
2490 /* Set the name and binding label of the subroutine symbol in the call
2491 expression represented by 'c' to include the type and kind of the
2492 second parameter. This function is for resolving the appropriate
2493 version of c_f_pointer() and c_f_procpointer(). For example, a
2494 call to c_f_pointer() for a default integer pointer could have a
2495 name of c_f_pointer_i4. If no second arg exists, which is an error
2496 for these two functions, it defaults to the generic symbol's name
2497 and binding label. */
2499 static void
2500 set_name_and_label (gfc_code *c, gfc_symbol *sym,
2501 char *name, char *binding_label)
2503 gfc_expr *arg = NULL;
2504 char type;
2505 int kind;
2507 /* The second arg of c_f_pointer and c_f_procpointer determines
2508 the type and kind for the procedure name. */
2509 arg = c->ext.actual->next->expr;
2511 if (arg != NULL)
2513 /* Set up the name to have the given symbol's name,
2514 plus the type and kind. */
2515 /* a derived type is marked with the type letter 'u' */
2516 if (arg->ts.type == BT_DERIVED)
2518 type = 'd';
2519 kind = 0; /* set the kind as 0 for now */
2521 else
2523 type = gfc_type_letter (arg->ts.type);
2524 kind = arg->ts.kind;
2527 if (arg->ts.type == BT_CHARACTER)
2528 /* Kind info for character strings not needed. */
2529 kind = 0;
2531 sprintf (name, "%s_%c%d", sym->name, type, kind);
2532 /* Set up the binding label as the given symbol's label plus
2533 the type and kind. */
2534 sprintf (binding_label, "%s_%c%d", sym->binding_label, type, kind);
2536 else
2538 /* If the second arg is missing, set the name and label as
2539 was, cause it should at least be found, and the missing
2540 arg error will be caught by compare_parameters(). */
2541 sprintf (name, "%s", sym->name);
2542 sprintf (binding_label, "%s", sym->binding_label);
2545 return;
2549 /* Resolve a generic version of the iso_c_binding procedure given
2550 (sym) to the specific one based on the type and kind of the
2551 argument(s). Currently, this function resolves c_f_pointer() and
2552 c_f_procpointer based on the type and kind of the second argument
2553 (FPTR). Other iso_c_binding procedures aren't specially handled.
2554 Upon successfully exiting, c->resolved_sym will hold the resolved
2555 symbol. Returns MATCH_ERROR if an error occurred; MATCH_YES
2556 otherwise. */
2558 match
2559 gfc_iso_c_sub_interface (gfc_code *c, gfc_symbol *sym)
2561 gfc_symbol *new_sym;
2562 /* this is fine, since we know the names won't use the max */
2563 char name[GFC_MAX_SYMBOL_LEN + 1];
2564 char binding_label[GFC_MAX_BINDING_LABEL_LEN + 1];
2565 /* default to success; will override if find error */
2566 match m = MATCH_YES;
2568 /* Make sure the actual arguments are in the necessary order (based on the
2569 formal args) before resolving. */
2570 gfc_procedure_use (sym, &c->ext.actual, &(c->loc));
2572 if ((sym->intmod_sym_id == ISOCBINDING_F_POINTER) ||
2573 (sym->intmod_sym_id == ISOCBINDING_F_PROCPOINTER))
2575 set_name_and_label (c, sym, name, binding_label);
2577 if (sym->intmod_sym_id == ISOCBINDING_F_POINTER)
2579 if (c->ext.actual != NULL && c->ext.actual->next != NULL)
2581 /* Make sure we got a third arg if the second arg has non-zero
2582 rank. We must also check that the type and rank are
2583 correct since we short-circuit this check in
2584 gfc_procedure_use() (called above to sort actual args). */
2585 if (c->ext.actual->next->expr->rank != 0)
2587 if(c->ext.actual->next->next == NULL
2588 || c->ext.actual->next->next->expr == NULL)
2590 m = MATCH_ERROR;
2591 gfc_error ("Missing SHAPE parameter for call to %s "
2592 "at %L", sym->name, &(c->loc));
2594 else if (c->ext.actual->next->next->expr->ts.type
2595 != BT_INTEGER
2596 || c->ext.actual->next->next->expr->rank != 1)
2598 m = MATCH_ERROR;
2599 gfc_error ("SHAPE parameter for call to %s at %L must "
2600 "be a rank 1 INTEGER array", sym->name,
2601 &(c->loc));
2607 if (m != MATCH_ERROR)
2609 /* the 1 means to add the optional arg to formal list */
2610 new_sym = get_iso_c_sym (sym, name, binding_label, 1);
2612 /* for error reporting, say it's declared where the original was */
2613 new_sym->declared_at = sym->declared_at;
2616 else
2618 /* no differences for c_loc or c_funloc */
2619 new_sym = sym;
2622 /* set the resolved symbol */
2623 if (m != MATCH_ERROR)
2624 c->resolved_sym = new_sym;
2625 else
2626 c->resolved_sym = sym;
2628 return m;
2632 /* Resolve a subroutine call known to be specific. */
2634 static match
2635 resolve_specific_s0 (gfc_code *c, gfc_symbol *sym)
2637 match m;
2639 /* See if we have an intrinsic interface. */
2640 if (sym->ts.interface != NULL && !sym->ts.interface->attr.abstract
2641 && !sym->ts.interface->attr.subroutine)
2643 gfc_intrinsic_sym *isym;
2645 isym = gfc_find_function (sym->ts.interface->name);
2647 /* Existance of isym should be checked already. */
2648 gcc_assert (isym);
2650 sym->ts.type = isym->ts.type;
2651 sym->ts.kind = isym->ts.kind;
2652 sym->attr.subroutine = 1;
2653 goto found;
2656 if(sym->attr.is_iso_c)
2658 m = gfc_iso_c_sub_interface (c,sym);
2659 return m;
2662 if (sym->attr.external || sym->attr.if_source == IFSRC_IFBODY)
2664 if (sym->attr.dummy)
2666 sym->attr.proc = PROC_DUMMY;
2667 goto found;
2670 sym->attr.proc = PROC_EXTERNAL;
2671 goto found;
2674 if (sym->attr.proc == PROC_MODULE || sym->attr.proc == PROC_INTERNAL)
2675 goto found;
2677 if (sym->attr.intrinsic)
2679 m = gfc_intrinsic_sub_interface (c, 1);
2680 if (m == MATCH_YES)
2681 return MATCH_YES;
2682 if (m == MATCH_NO)
2683 gfc_error ("Subroutine '%s' at %L is INTRINSIC but is not compatible "
2684 "with an intrinsic", sym->name, &c->loc);
2686 return MATCH_ERROR;
2689 return MATCH_NO;
2691 found:
2692 gfc_procedure_use (sym, &c->ext.actual, &c->loc);
2694 c->resolved_sym = sym;
2695 pure_subroutine (c, sym);
2697 return MATCH_YES;
2701 static try
2702 resolve_specific_s (gfc_code *c)
2704 gfc_symbol *sym;
2705 match m;
2707 sym = c->symtree->n.sym;
2709 for (;;)
2711 m = resolve_specific_s0 (c, sym);
2712 if (m == MATCH_YES)
2713 return SUCCESS;
2714 if (m == MATCH_ERROR)
2715 return FAILURE;
2717 if (sym->ns->parent == NULL)
2718 break;
2720 gfc_find_symbol (sym->name, sym->ns->parent, 1, &sym);
2722 if (sym == NULL)
2723 break;
2726 sym = c->symtree->n.sym;
2727 gfc_error ("Unable to resolve the specific subroutine '%s' at %L",
2728 sym->name, &c->loc);
2730 return FAILURE;
2734 /* Resolve a subroutine call not known to be generic nor specific. */
2736 static try
2737 resolve_unknown_s (gfc_code *c)
2739 gfc_symbol *sym;
2741 sym = c->symtree->n.sym;
2743 if (sym->attr.dummy)
2745 sym->attr.proc = PROC_DUMMY;
2746 goto found;
2749 /* See if we have an intrinsic function reference. */
2751 if (gfc_intrinsic_name (sym->name, 1))
2753 if (gfc_intrinsic_sub_interface (c, 1) == MATCH_YES)
2754 return SUCCESS;
2755 return FAILURE;
2758 /* The reference is to an external name. */
2760 found:
2761 gfc_procedure_use (sym, &c->ext.actual, &c->loc);
2763 c->resolved_sym = sym;
2765 pure_subroutine (c, sym);
2767 return SUCCESS;
2771 /* Resolve a subroutine call. Although it was tempting to use the same code
2772 for functions, subroutines and functions are stored differently and this
2773 makes things awkward. */
2775 static try
2776 resolve_call (gfc_code *c)
2778 try t;
2779 procedure_type ptype = PROC_INTRINSIC;
2781 if (c->symtree && c->symtree->n.sym
2782 && c->symtree->n.sym->ts.type != BT_UNKNOWN)
2784 gfc_error ("'%s' at %L has a type, which is not consistent with "
2785 "the CALL at %L", c->symtree->n.sym->name,
2786 &c->symtree->n.sym->declared_at, &c->loc);
2787 return FAILURE;
2790 /* If external, check for usage. */
2791 if (c->symtree && is_external_proc (c->symtree->n.sym))
2792 resolve_global_procedure (c->symtree->n.sym, &c->loc, 1);
2794 /* Subroutines without the RECURSIVE attribution are not allowed to
2795 * call themselves. */
2796 if (c->symtree && c->symtree->n.sym && !c->symtree->n.sym->attr.recursive)
2798 gfc_symbol *csym, *proc;
2799 csym = c->symtree->n.sym;
2800 proc = gfc_current_ns->proc_name;
2801 if (csym == proc)
2803 gfc_error ("SUBROUTINE '%s' at %L cannot call itself, as it is not "
2804 "RECURSIVE", csym->name, &c->loc);
2805 t = FAILURE;
2808 if (csym->attr.entry && csym->ns->entries && proc->ns->entries
2809 && csym->ns->entries->sym == proc->ns->entries->sym)
2811 gfc_error ("Call to ENTRY '%s' at %L is recursive, but subroutine "
2812 "'%s' is not declared as RECURSIVE",
2813 csym->name, &c->loc, csym->ns->entries->sym->name);
2814 t = FAILURE;
2818 /* Switch off assumed size checking and do this again for certain kinds
2819 of procedure, once the procedure itself is resolved. */
2820 need_full_assumed_size++;
2822 if (c->symtree && c->symtree->n.sym)
2823 ptype = c->symtree->n.sym->attr.proc;
2825 if (resolve_actual_arglist (c->ext.actual, ptype) == FAILURE)
2826 return FAILURE;
2828 /* Resume assumed_size checking. */
2829 need_full_assumed_size--;
2831 t = SUCCESS;
2832 if (c->resolved_sym == NULL)
2833 switch (procedure_kind (c->symtree->n.sym))
2835 case PTYPE_GENERIC:
2836 t = resolve_generic_s (c);
2837 break;
2839 case PTYPE_SPECIFIC:
2840 t = resolve_specific_s (c);
2841 break;
2843 case PTYPE_UNKNOWN:
2844 t = resolve_unknown_s (c);
2845 break;
2847 default:
2848 gfc_internal_error ("resolve_subroutine(): bad function type");
2851 /* Some checks of elemental subroutine actual arguments. */
2852 if (resolve_elemental_actual (NULL, c) == FAILURE)
2853 return FAILURE;
2855 if (t == SUCCESS && !(c->resolved_sym && c->resolved_sym->attr.elemental))
2856 find_noncopying_intrinsics (c->resolved_sym, c->ext.actual);
2857 return t;
2861 /* Compare the shapes of two arrays that have non-NULL shapes. If both
2862 op1->shape and op2->shape are non-NULL return SUCCESS if their shapes
2863 match. If both op1->shape and op2->shape are non-NULL return FAILURE
2864 if their shapes do not match. If either op1->shape or op2->shape is
2865 NULL, return SUCCESS. */
2867 static try
2868 compare_shapes (gfc_expr *op1, gfc_expr *op2)
2870 try t;
2871 int i;
2873 t = SUCCESS;
2875 if (op1->shape != NULL && op2->shape != NULL)
2877 for (i = 0; i < op1->rank; i++)
2879 if (mpz_cmp (op1->shape[i], op2->shape[i]) != 0)
2881 gfc_error ("Shapes for operands at %L and %L are not conformable",
2882 &op1->where, &op2->where);
2883 t = FAILURE;
2884 break;
2889 return t;
2893 /* Resolve an operator expression node. This can involve replacing the
2894 operation with a user defined function call. */
2896 static try
2897 resolve_operator (gfc_expr *e)
2899 gfc_expr *op1, *op2;
2900 char msg[200];
2901 bool dual_locus_error;
2902 try t;
2904 /* Resolve all subnodes-- give them types. */
2906 switch (e->value.op.operator)
2908 default:
2909 if (gfc_resolve_expr (e->value.op.op2) == FAILURE)
2910 return FAILURE;
2912 /* Fall through... */
2914 case INTRINSIC_NOT:
2915 case INTRINSIC_UPLUS:
2916 case INTRINSIC_UMINUS:
2917 case INTRINSIC_PARENTHESES:
2918 if (gfc_resolve_expr (e->value.op.op1) == FAILURE)
2919 return FAILURE;
2920 break;
2923 /* Typecheck the new node. */
2925 op1 = e->value.op.op1;
2926 op2 = e->value.op.op2;
2927 dual_locus_error = false;
2929 if ((op1 && op1->expr_type == EXPR_NULL)
2930 || (op2 && op2->expr_type == EXPR_NULL))
2932 sprintf (msg, _("Invalid context for NULL() pointer at %%L"));
2933 goto bad_op;
2936 switch (e->value.op.operator)
2938 case INTRINSIC_UPLUS:
2939 case INTRINSIC_UMINUS:
2940 if (op1->ts.type == BT_INTEGER
2941 || op1->ts.type == BT_REAL
2942 || op1->ts.type == BT_COMPLEX)
2944 e->ts = op1->ts;
2945 break;
2948 sprintf (msg, _("Operand of unary numeric operator '%s' at %%L is %s"),
2949 gfc_op2string (e->value.op.operator), gfc_typename (&e->ts));
2950 goto bad_op;
2952 case INTRINSIC_PLUS:
2953 case INTRINSIC_MINUS:
2954 case INTRINSIC_TIMES:
2955 case INTRINSIC_DIVIDE:
2956 case INTRINSIC_POWER:
2957 if (gfc_numeric_ts (&op1->ts) && gfc_numeric_ts (&op2->ts))
2959 gfc_type_convert_binary (e);
2960 break;
2963 sprintf (msg,
2964 _("Operands of binary numeric operator '%s' at %%L are %s/%s"),
2965 gfc_op2string (e->value.op.operator), gfc_typename (&op1->ts),
2966 gfc_typename (&op2->ts));
2967 goto bad_op;
2969 case INTRINSIC_CONCAT:
2970 if (op1->ts.type == BT_CHARACTER && op2->ts.type == BT_CHARACTER
2971 && op1->ts.kind == op2->ts.kind)
2973 e->ts.type = BT_CHARACTER;
2974 e->ts.kind = op1->ts.kind;
2975 break;
2978 sprintf (msg,
2979 _("Operands of string concatenation operator at %%L are %s/%s"),
2980 gfc_typename (&op1->ts), gfc_typename (&op2->ts));
2981 goto bad_op;
2983 case INTRINSIC_AND:
2984 case INTRINSIC_OR:
2985 case INTRINSIC_EQV:
2986 case INTRINSIC_NEQV:
2987 if (op1->ts.type == BT_LOGICAL && op2->ts.type == BT_LOGICAL)
2989 e->ts.type = BT_LOGICAL;
2990 e->ts.kind = gfc_kind_max (op1, op2);
2991 if (op1->ts.kind < e->ts.kind)
2992 gfc_convert_type (op1, &e->ts, 2);
2993 else if (op2->ts.kind < e->ts.kind)
2994 gfc_convert_type (op2, &e->ts, 2);
2995 break;
2998 sprintf (msg, _("Operands of logical operator '%s' at %%L are %s/%s"),
2999 gfc_op2string (e->value.op.operator), gfc_typename (&op1->ts),
3000 gfc_typename (&op2->ts));
3002 goto bad_op;
3004 case INTRINSIC_NOT:
3005 if (op1->ts.type == BT_LOGICAL)
3007 e->ts.type = BT_LOGICAL;
3008 e->ts.kind = op1->ts.kind;
3009 break;
3012 sprintf (msg, _("Operand of .not. operator at %%L is %s"),
3013 gfc_typename (&op1->ts));
3014 goto bad_op;
3016 case INTRINSIC_GT:
3017 case INTRINSIC_GT_OS:
3018 case INTRINSIC_GE:
3019 case INTRINSIC_GE_OS:
3020 case INTRINSIC_LT:
3021 case INTRINSIC_LT_OS:
3022 case INTRINSIC_LE:
3023 case INTRINSIC_LE_OS:
3024 if (op1->ts.type == BT_COMPLEX || op2->ts.type == BT_COMPLEX)
3026 strcpy (msg, _("COMPLEX quantities cannot be compared at %L"));
3027 goto bad_op;
3030 /* Fall through... */
3032 case INTRINSIC_EQ:
3033 case INTRINSIC_EQ_OS:
3034 case INTRINSIC_NE:
3035 case INTRINSIC_NE_OS:
3036 if (op1->ts.type == BT_CHARACTER && op2->ts.type == BT_CHARACTER
3037 && op1->ts.kind == op2->ts.kind)
3039 e->ts.type = BT_LOGICAL;
3040 e->ts.kind = gfc_default_logical_kind;
3041 break;
3044 if (gfc_numeric_ts (&op1->ts) && gfc_numeric_ts (&op2->ts))
3046 gfc_type_convert_binary (e);
3048 e->ts.type = BT_LOGICAL;
3049 e->ts.kind = gfc_default_logical_kind;
3050 break;
3053 if (op1->ts.type == BT_LOGICAL && op2->ts.type == BT_LOGICAL)
3054 sprintf (msg,
3055 _("Logicals at %%L must be compared with %s instead of %s"),
3056 (e->value.op.operator == INTRINSIC_EQ
3057 || e->value.op.operator == INTRINSIC_EQ_OS)
3058 ? ".eqv." : ".neqv.", gfc_op2string (e->value.op.operator));
3059 else
3060 sprintf (msg,
3061 _("Operands of comparison operator '%s' at %%L are %s/%s"),
3062 gfc_op2string (e->value.op.operator), gfc_typename (&op1->ts),
3063 gfc_typename (&op2->ts));
3065 goto bad_op;
3067 case INTRINSIC_USER:
3068 if (e->value.op.uop->operator == NULL)
3069 sprintf (msg, _("Unknown operator '%s' at %%L"), e->value.op.uop->name);
3070 else if (op2 == NULL)
3071 sprintf (msg, _("Operand of user operator '%s' at %%L is %s"),
3072 e->value.op.uop->name, gfc_typename (&op1->ts));
3073 else
3074 sprintf (msg, _("Operands of user operator '%s' at %%L are %s/%s"),
3075 e->value.op.uop->name, gfc_typename (&op1->ts),
3076 gfc_typename (&op2->ts));
3078 goto bad_op;
3080 case INTRINSIC_PARENTHESES:
3081 e->ts = op1->ts;
3082 if (e->ts.type == BT_CHARACTER)
3083 e->ts.cl = op1->ts.cl;
3084 break;
3086 default:
3087 gfc_internal_error ("resolve_operator(): Bad intrinsic");
3090 /* Deal with arrayness of an operand through an operator. */
3092 t = SUCCESS;
3094 switch (e->value.op.operator)
3096 case INTRINSIC_PLUS:
3097 case INTRINSIC_MINUS:
3098 case INTRINSIC_TIMES:
3099 case INTRINSIC_DIVIDE:
3100 case INTRINSIC_POWER:
3101 case INTRINSIC_CONCAT:
3102 case INTRINSIC_AND:
3103 case INTRINSIC_OR:
3104 case INTRINSIC_EQV:
3105 case INTRINSIC_NEQV:
3106 case INTRINSIC_EQ:
3107 case INTRINSIC_EQ_OS:
3108 case INTRINSIC_NE:
3109 case INTRINSIC_NE_OS:
3110 case INTRINSIC_GT:
3111 case INTRINSIC_GT_OS:
3112 case INTRINSIC_GE:
3113 case INTRINSIC_GE_OS:
3114 case INTRINSIC_LT:
3115 case INTRINSIC_LT_OS:
3116 case INTRINSIC_LE:
3117 case INTRINSIC_LE_OS:
3119 if (op1->rank == 0 && op2->rank == 0)
3120 e->rank = 0;
3122 if (op1->rank == 0 && op2->rank != 0)
3124 e->rank = op2->rank;
3126 if (e->shape == NULL)
3127 e->shape = gfc_copy_shape (op2->shape, op2->rank);
3130 if (op1->rank != 0 && op2->rank == 0)
3132 e->rank = op1->rank;
3134 if (e->shape == NULL)
3135 e->shape = gfc_copy_shape (op1->shape, op1->rank);
3138 if (op1->rank != 0 && op2->rank != 0)
3140 if (op1->rank == op2->rank)
3142 e->rank = op1->rank;
3143 if (e->shape == NULL)
3145 t = compare_shapes(op1, op2);
3146 if (t == FAILURE)
3147 e->shape = NULL;
3148 else
3149 e->shape = gfc_copy_shape (op1->shape, op1->rank);
3152 else
3154 /* Allow higher level expressions to work. */
3155 e->rank = 0;
3157 /* Try user-defined operators, and otherwise throw an error. */
3158 dual_locus_error = true;
3159 sprintf (msg,
3160 _("Inconsistent ranks for operator at %%L and %%L"));
3161 goto bad_op;
3165 break;
3167 case INTRINSIC_PARENTHESES:
3168 case INTRINSIC_NOT:
3169 case INTRINSIC_UPLUS:
3170 case INTRINSIC_UMINUS:
3171 /* Simply copy arrayness attribute */
3172 e->rank = op1->rank;
3174 if (e->shape == NULL)
3175 e->shape = gfc_copy_shape (op1->shape, op1->rank);
3177 break;
3179 default:
3180 break;
3183 /* Attempt to simplify the expression. */
3184 if (t == SUCCESS)
3186 t = gfc_simplify_expr (e, 0);
3187 /* Some calls do not succeed in simplification and return FAILURE
3188 even though there is no error; eg. variable references to
3189 PARAMETER arrays. */
3190 if (!gfc_is_constant_expr (e))
3191 t = SUCCESS;
3193 return t;
3195 bad_op:
3197 if (gfc_extend_expr (e) == SUCCESS)
3198 return SUCCESS;
3200 if (dual_locus_error)
3201 gfc_error (msg, &op1->where, &op2->where);
3202 else
3203 gfc_error (msg, &e->where);
3205 return FAILURE;
3209 /************** Array resolution subroutines **************/
3211 typedef enum
3212 { CMP_LT, CMP_EQ, CMP_GT, CMP_UNKNOWN }
3213 comparison;
3215 /* Compare two integer expressions. */
3217 static comparison
3218 compare_bound (gfc_expr *a, gfc_expr *b)
3220 int i;
3222 if (a == NULL || a->expr_type != EXPR_CONSTANT
3223 || b == NULL || b->expr_type != EXPR_CONSTANT)
3224 return CMP_UNKNOWN;
3226 /* If either of the types isn't INTEGER, we must have
3227 raised an error earlier. */
3229 if (a->ts.type != BT_INTEGER || b->ts.type != BT_INTEGER)
3230 return CMP_UNKNOWN;
3232 i = mpz_cmp (a->value.integer, b->value.integer);
3234 if (i < 0)
3235 return CMP_LT;
3236 if (i > 0)
3237 return CMP_GT;
3238 return CMP_EQ;
3242 /* Compare an integer expression with an integer. */
3244 static comparison
3245 compare_bound_int (gfc_expr *a, int b)
3247 int i;
3249 if (a == NULL || a->expr_type != EXPR_CONSTANT)
3250 return CMP_UNKNOWN;
3252 if (a->ts.type != BT_INTEGER)
3253 gfc_internal_error ("compare_bound_int(): Bad expression");
3255 i = mpz_cmp_si (a->value.integer, b);
3257 if (i < 0)
3258 return CMP_LT;
3259 if (i > 0)
3260 return CMP_GT;
3261 return CMP_EQ;
3265 /* Compare an integer expression with a mpz_t. */
3267 static comparison
3268 compare_bound_mpz_t (gfc_expr *a, mpz_t b)
3270 int i;
3272 if (a == NULL || a->expr_type != EXPR_CONSTANT)
3273 return CMP_UNKNOWN;
3275 if (a->ts.type != BT_INTEGER)
3276 gfc_internal_error ("compare_bound_int(): Bad expression");
3278 i = mpz_cmp (a->value.integer, b);
3280 if (i < 0)
3281 return CMP_LT;
3282 if (i > 0)
3283 return CMP_GT;
3284 return CMP_EQ;
3288 /* Compute the last value of a sequence given by a triplet.
3289 Return 0 if it wasn't able to compute the last value, or if the
3290 sequence if empty, and 1 otherwise. */
3292 static int
3293 compute_last_value_for_triplet (gfc_expr *start, gfc_expr *end,
3294 gfc_expr *stride, mpz_t last)
3296 mpz_t rem;
3298 if (start == NULL || start->expr_type != EXPR_CONSTANT
3299 || end == NULL || end->expr_type != EXPR_CONSTANT
3300 || (stride != NULL && stride->expr_type != EXPR_CONSTANT))
3301 return 0;
3303 if (start->ts.type != BT_INTEGER || end->ts.type != BT_INTEGER
3304 || (stride != NULL && stride->ts.type != BT_INTEGER))
3305 return 0;
3307 if (stride == NULL || compare_bound_int(stride, 1) == CMP_EQ)
3309 if (compare_bound (start, end) == CMP_GT)
3310 return 0;
3311 mpz_set (last, end->value.integer);
3312 return 1;
3315 if (compare_bound_int (stride, 0) == CMP_GT)
3317 /* Stride is positive */
3318 if (mpz_cmp (start->value.integer, end->value.integer) > 0)
3319 return 0;
3321 else
3323 /* Stride is negative */
3324 if (mpz_cmp (start->value.integer, end->value.integer) < 0)
3325 return 0;
3328 mpz_init (rem);
3329 mpz_sub (rem, end->value.integer, start->value.integer);
3330 mpz_tdiv_r (rem, rem, stride->value.integer);
3331 mpz_sub (last, end->value.integer, rem);
3332 mpz_clear (rem);
3334 return 1;
3338 /* Compare a single dimension of an array reference to the array
3339 specification. */
3341 static try
3342 check_dimension (int i, gfc_array_ref *ar, gfc_array_spec *as)
3344 mpz_t last_value;
3346 /* Given start, end and stride values, calculate the minimum and
3347 maximum referenced indexes. */
3349 switch (ar->dimen_type[i])
3351 case DIMEN_VECTOR:
3352 break;
3354 case DIMEN_ELEMENT:
3355 if (compare_bound (ar->start[i], as->lower[i]) == CMP_LT)
3357 gfc_warning ("Array reference at %L is out of bounds "
3358 "(%ld < %ld) in dimension %d", &ar->c_where[i],
3359 mpz_get_si (ar->start[i]->value.integer),
3360 mpz_get_si (as->lower[i]->value.integer), i+1);
3361 return SUCCESS;
3363 if (compare_bound (ar->start[i], as->upper[i]) == CMP_GT)
3365 gfc_warning ("Array reference at %L is out of bounds "
3366 "(%ld > %ld) in dimension %d", &ar->c_where[i],
3367 mpz_get_si (ar->start[i]->value.integer),
3368 mpz_get_si (as->upper[i]->value.integer), i+1);
3369 return SUCCESS;
3372 break;
3374 case DIMEN_RANGE:
3376 #define AR_START (ar->start[i] ? ar->start[i] : as->lower[i])
3377 #define AR_END (ar->end[i] ? ar->end[i] : as->upper[i])
3379 comparison comp_start_end = compare_bound (AR_START, AR_END);
3381 /* Check for zero stride, which is not allowed. */
3382 if (compare_bound_int (ar->stride[i], 0) == CMP_EQ)
3384 gfc_error ("Illegal stride of zero at %L", &ar->c_where[i]);
3385 return FAILURE;
3388 /* if start == len || (stride > 0 && start < len)
3389 || (stride < 0 && start > len),
3390 then the array section contains at least one element. In this
3391 case, there is an out-of-bounds access if
3392 (start < lower || start > upper). */
3393 if (compare_bound (AR_START, AR_END) == CMP_EQ
3394 || ((compare_bound_int (ar->stride[i], 0) == CMP_GT
3395 || ar->stride[i] == NULL) && comp_start_end == CMP_LT)
3396 || (compare_bound_int (ar->stride[i], 0) == CMP_LT
3397 && comp_start_end == CMP_GT))
3399 if (compare_bound (AR_START, as->lower[i]) == CMP_LT)
3401 gfc_warning ("Lower array reference at %L is out of bounds "
3402 "(%ld < %ld) in dimension %d", &ar->c_where[i],
3403 mpz_get_si (AR_START->value.integer),
3404 mpz_get_si (as->lower[i]->value.integer), i+1);
3405 return SUCCESS;
3407 if (compare_bound (AR_START, as->upper[i]) == CMP_GT)
3409 gfc_warning ("Lower array reference at %L is out of bounds "
3410 "(%ld > %ld) in dimension %d", &ar->c_where[i],
3411 mpz_get_si (AR_START->value.integer),
3412 mpz_get_si (as->upper[i]->value.integer), i+1);
3413 return SUCCESS;
3417 /* If we can compute the highest index of the array section,
3418 then it also has to be between lower and upper. */
3419 mpz_init (last_value);
3420 if (compute_last_value_for_triplet (AR_START, AR_END, ar->stride[i],
3421 last_value))
3423 if (compare_bound_mpz_t (as->lower[i], last_value) == CMP_GT)
3425 gfc_warning ("Upper array reference at %L is out of bounds "
3426 "(%ld < %ld) in dimension %d", &ar->c_where[i],
3427 mpz_get_si (last_value),
3428 mpz_get_si (as->lower[i]->value.integer), i+1);
3429 mpz_clear (last_value);
3430 return SUCCESS;
3432 if (compare_bound_mpz_t (as->upper[i], last_value) == CMP_LT)
3434 gfc_warning ("Upper array reference at %L is out of bounds "
3435 "(%ld > %ld) in dimension %d", &ar->c_where[i],
3436 mpz_get_si (last_value),
3437 mpz_get_si (as->upper[i]->value.integer), i+1);
3438 mpz_clear (last_value);
3439 return SUCCESS;
3442 mpz_clear (last_value);
3444 #undef AR_START
3445 #undef AR_END
3447 break;
3449 default:
3450 gfc_internal_error ("check_dimension(): Bad array reference");
3453 return SUCCESS;
3457 /* Compare an array reference with an array specification. */
3459 static try
3460 compare_spec_to_ref (gfc_array_ref *ar)
3462 gfc_array_spec *as;
3463 int i;
3465 as = ar->as;
3466 i = as->rank - 1;
3467 /* TODO: Full array sections are only allowed as actual parameters. */
3468 if (as->type == AS_ASSUMED_SIZE
3469 && (/*ar->type == AR_FULL
3470 ||*/ (ar->type == AR_SECTION
3471 && ar->dimen_type[i] == DIMEN_RANGE && ar->end[i] == NULL)))
3473 gfc_error ("Rightmost upper bound of assumed size array section "
3474 "not specified at %L", &ar->where);
3475 return FAILURE;
3478 if (ar->type == AR_FULL)
3479 return SUCCESS;
3481 if (as->rank != ar->dimen)
3483 gfc_error ("Rank mismatch in array reference at %L (%d/%d)",
3484 &ar->where, ar->dimen, as->rank);
3485 return FAILURE;
3488 for (i = 0; i < as->rank; i++)
3489 if (check_dimension (i, ar, as) == FAILURE)
3490 return FAILURE;
3492 return SUCCESS;
3496 /* Resolve one part of an array index. */
3499 gfc_resolve_index (gfc_expr *index, int check_scalar)
3501 gfc_typespec ts;
3503 if (index == NULL)
3504 return SUCCESS;
3506 if (gfc_resolve_expr (index) == FAILURE)
3507 return FAILURE;
3509 if (check_scalar && index->rank != 0)
3511 gfc_error ("Array index at %L must be scalar", &index->where);
3512 return FAILURE;
3515 if (index->ts.type != BT_INTEGER && index->ts.type != BT_REAL)
3517 gfc_error ("Array index at %L must be of INTEGER type, found %s",
3518 &index->where, gfc_basic_typename (index->ts.type));
3519 return FAILURE;
3522 if (index->ts.type == BT_REAL)
3523 if (gfc_notify_std (GFC_STD_LEGACY, "Extension: REAL array index at %L",
3524 &index->where) == FAILURE)
3525 return FAILURE;
3527 if (index->ts.kind != gfc_index_integer_kind
3528 || index->ts.type != BT_INTEGER)
3530 gfc_clear_ts (&ts);
3531 ts.type = BT_INTEGER;
3532 ts.kind = gfc_index_integer_kind;
3534 gfc_convert_type_warn (index, &ts, 2, 0);
3537 return SUCCESS;
3540 /* Resolve a dim argument to an intrinsic function. */
3543 gfc_resolve_dim_arg (gfc_expr *dim)
3545 if (dim == NULL)
3546 return SUCCESS;
3548 if (gfc_resolve_expr (dim) == FAILURE)
3549 return FAILURE;
3551 if (dim->rank != 0)
3553 gfc_error ("Argument dim at %L must be scalar", &dim->where);
3554 return FAILURE;
3558 if (dim->ts.type != BT_INTEGER)
3560 gfc_error ("Argument dim at %L must be of INTEGER type", &dim->where);
3561 return FAILURE;
3564 if (dim->ts.kind != gfc_index_integer_kind)
3566 gfc_typespec ts;
3568 ts.type = BT_INTEGER;
3569 ts.kind = gfc_index_integer_kind;
3571 gfc_convert_type_warn (dim, &ts, 2, 0);
3574 return SUCCESS;
3577 /* Given an expression that contains array references, update those array
3578 references to point to the right array specifications. While this is
3579 filled in during matching, this information is difficult to save and load
3580 in a module, so we take care of it here.
3582 The idea here is that the original array reference comes from the
3583 base symbol. We traverse the list of reference structures, setting
3584 the stored reference to references. Component references can
3585 provide an additional array specification. */
3587 static void
3588 find_array_spec (gfc_expr *e)
3590 gfc_array_spec *as;
3591 gfc_component *c;
3592 gfc_symbol *derived;
3593 gfc_ref *ref;
3595 as = e->symtree->n.sym->as;
3596 derived = NULL;
3598 for (ref = e->ref; ref; ref = ref->next)
3599 switch (ref->type)
3601 case REF_ARRAY:
3602 if (as == NULL)
3603 gfc_internal_error ("find_array_spec(): Missing spec");
3605 ref->u.ar.as = as;
3606 as = NULL;
3607 break;
3609 case REF_COMPONENT:
3610 if (derived == NULL)
3611 derived = e->symtree->n.sym->ts.derived;
3613 c = derived->components;
3615 for (; c; c = c->next)
3616 if (c == ref->u.c.component)
3618 /* Track the sequence of component references. */
3619 if (c->ts.type == BT_DERIVED)
3620 derived = c->ts.derived;
3621 break;
3624 if (c == NULL)
3625 gfc_internal_error ("find_array_spec(): Component not found");
3627 if (c->dimension)
3629 if (as != NULL)
3630 gfc_internal_error ("find_array_spec(): unused as(1)");
3631 as = c->as;
3634 break;
3636 case REF_SUBSTRING:
3637 break;
3640 if (as != NULL)
3641 gfc_internal_error ("find_array_spec(): unused as(2)");
3645 /* Resolve an array reference. */
3647 static try
3648 resolve_array_ref (gfc_array_ref *ar)
3650 int i, check_scalar;
3651 gfc_expr *e;
3653 for (i = 0; i < ar->dimen; i++)
3655 check_scalar = ar->dimen_type[i] == DIMEN_RANGE;
3657 if (gfc_resolve_index (ar->start[i], check_scalar) == FAILURE)
3658 return FAILURE;
3659 if (gfc_resolve_index (ar->end[i], check_scalar) == FAILURE)
3660 return FAILURE;
3661 if (gfc_resolve_index (ar->stride[i], check_scalar) == FAILURE)
3662 return FAILURE;
3664 e = ar->start[i];
3666 if (ar->dimen_type[i] == DIMEN_UNKNOWN)
3667 switch (e->rank)
3669 case 0:
3670 ar->dimen_type[i] = DIMEN_ELEMENT;
3671 break;
3673 case 1:
3674 ar->dimen_type[i] = DIMEN_VECTOR;
3675 if (e->expr_type == EXPR_VARIABLE
3676 && e->symtree->n.sym->ts.type == BT_DERIVED)
3677 ar->start[i] = gfc_get_parentheses (e);
3678 break;
3680 default:
3681 gfc_error ("Array index at %L is an array of rank %d",
3682 &ar->c_where[i], e->rank);
3683 return FAILURE;
3687 /* If the reference type is unknown, figure out what kind it is. */
3689 if (ar->type == AR_UNKNOWN)
3691 ar->type = AR_ELEMENT;
3692 for (i = 0; i < ar->dimen; i++)
3693 if (ar->dimen_type[i] == DIMEN_RANGE
3694 || ar->dimen_type[i] == DIMEN_VECTOR)
3696 ar->type = AR_SECTION;
3697 break;
3701 if (!ar->as->cray_pointee && compare_spec_to_ref (ar) == FAILURE)
3702 return FAILURE;
3704 return SUCCESS;
3708 static try
3709 resolve_substring (gfc_ref *ref)
3711 if (ref->u.ss.start != NULL)
3713 if (gfc_resolve_expr (ref->u.ss.start) == FAILURE)
3714 return FAILURE;
3716 if (ref->u.ss.start->ts.type != BT_INTEGER)
3718 gfc_error ("Substring start index at %L must be of type INTEGER",
3719 &ref->u.ss.start->where);
3720 return FAILURE;
3723 if (ref->u.ss.start->rank != 0)
3725 gfc_error ("Substring start index at %L must be scalar",
3726 &ref->u.ss.start->where);
3727 return FAILURE;
3730 if (compare_bound_int (ref->u.ss.start, 1) == CMP_LT
3731 && (compare_bound (ref->u.ss.end, ref->u.ss.start) == CMP_EQ
3732 || compare_bound (ref->u.ss.end, ref->u.ss.start) == CMP_GT))
3734 gfc_error ("Substring start index at %L is less than one",
3735 &ref->u.ss.start->where);
3736 return FAILURE;
3740 if (ref->u.ss.end != NULL)
3742 if (gfc_resolve_expr (ref->u.ss.end) == FAILURE)
3743 return FAILURE;
3745 if (ref->u.ss.end->ts.type != BT_INTEGER)
3747 gfc_error ("Substring end index at %L must be of type INTEGER",
3748 &ref->u.ss.end->where);
3749 return FAILURE;
3752 if (ref->u.ss.end->rank != 0)
3754 gfc_error ("Substring end index at %L must be scalar",
3755 &ref->u.ss.end->where);
3756 return FAILURE;
3759 if (ref->u.ss.length != NULL
3760 && compare_bound (ref->u.ss.end, ref->u.ss.length->length) == CMP_GT
3761 && (compare_bound (ref->u.ss.end, ref->u.ss.start) == CMP_EQ
3762 || compare_bound (ref->u.ss.end, ref->u.ss.start) == CMP_GT))
3764 gfc_error ("Substring end index at %L exceeds the string length",
3765 &ref->u.ss.start->where);
3766 return FAILURE;
3770 return SUCCESS;
3774 /* This function supplies missing substring charlens. */
3776 void
3777 gfc_resolve_substring_charlen (gfc_expr *e)
3779 gfc_ref *char_ref;
3780 gfc_expr *start, *end;
3782 for (char_ref = e->ref; char_ref; char_ref = char_ref->next)
3783 if (char_ref->type == REF_SUBSTRING)
3784 break;
3786 if (!char_ref)
3787 return;
3789 gcc_assert (char_ref->next == NULL);
3791 if (e->ts.cl)
3793 if (e->ts.cl->length)
3794 gfc_free_expr (e->ts.cl->length);
3795 else if (e->expr_type == EXPR_VARIABLE
3796 && e->symtree->n.sym->attr.dummy)
3797 return;
3800 e->ts.type = BT_CHARACTER;
3801 e->ts.kind = gfc_default_character_kind;
3803 if (!e->ts.cl)
3805 e->ts.cl = gfc_get_charlen ();
3806 e->ts.cl->next = gfc_current_ns->cl_list;
3807 gfc_current_ns->cl_list = e->ts.cl;
3810 if (char_ref->u.ss.start)
3811 start = gfc_copy_expr (char_ref->u.ss.start);
3812 else
3813 start = gfc_int_expr (1);
3815 if (char_ref->u.ss.end)
3816 end = gfc_copy_expr (char_ref->u.ss.end);
3817 else if (e->expr_type == EXPR_VARIABLE)
3818 end = gfc_copy_expr (e->symtree->n.sym->ts.cl->length);
3819 else
3820 end = NULL;
3822 if (!start || !end)
3823 return;
3825 /* Length = (end - start +1). */
3826 e->ts.cl->length = gfc_subtract (end, start);
3827 e->ts.cl->length = gfc_add (e->ts.cl->length, gfc_int_expr (1));
3829 e->ts.cl->length->ts.type = BT_INTEGER;
3830 e->ts.cl->length->ts.kind = gfc_charlen_int_kind;;
3832 /* Make sure that the length is simplified. */
3833 gfc_simplify_expr (e->ts.cl->length, 1);
3834 gfc_resolve_expr (e->ts.cl->length);
3838 /* Resolve subtype references. */
3840 static try
3841 resolve_ref (gfc_expr *expr)
3843 int current_part_dimension, n_components, seen_part_dimension;
3844 gfc_ref *ref;
3846 for (ref = expr->ref; ref; ref = ref->next)
3847 if (ref->type == REF_ARRAY && ref->u.ar.as == NULL)
3849 find_array_spec (expr);
3850 break;
3853 for (ref = expr->ref; ref; ref = ref->next)
3854 switch (ref->type)
3856 case REF_ARRAY:
3857 if (resolve_array_ref (&ref->u.ar) == FAILURE)
3858 return FAILURE;
3859 break;
3861 case REF_COMPONENT:
3862 break;
3864 case REF_SUBSTRING:
3865 resolve_substring (ref);
3866 break;
3869 /* Check constraints on part references. */
3871 current_part_dimension = 0;
3872 seen_part_dimension = 0;
3873 n_components = 0;
3875 for (ref = expr->ref; ref; ref = ref->next)
3877 switch (ref->type)
3879 case REF_ARRAY:
3880 switch (ref->u.ar.type)
3882 case AR_FULL:
3883 case AR_SECTION:
3884 current_part_dimension = 1;
3885 break;
3887 case AR_ELEMENT:
3888 current_part_dimension = 0;
3889 break;
3891 case AR_UNKNOWN:
3892 gfc_internal_error ("resolve_ref(): Bad array reference");
3895 break;
3897 case REF_COMPONENT:
3898 if (current_part_dimension || seen_part_dimension)
3900 if (ref->u.c.component->pointer)
3902 gfc_error ("Component to the right of a part reference "
3903 "with nonzero rank must not have the POINTER "
3904 "attribute at %L", &expr->where);
3905 return FAILURE;
3907 else if (ref->u.c.component->allocatable)
3909 gfc_error ("Component to the right of a part reference "
3910 "with nonzero rank must not have the ALLOCATABLE "
3911 "attribute at %L", &expr->where);
3912 return FAILURE;
3916 n_components++;
3917 break;
3919 case REF_SUBSTRING:
3920 break;
3923 if (((ref->type == REF_COMPONENT && n_components > 1)
3924 || ref->next == NULL)
3925 && current_part_dimension
3926 && seen_part_dimension)
3928 gfc_error ("Two or more part references with nonzero rank must "
3929 "not be specified at %L", &expr->where);
3930 return FAILURE;
3933 if (ref->type == REF_COMPONENT)
3935 if (current_part_dimension)
3936 seen_part_dimension = 1;
3938 /* reset to make sure */
3939 current_part_dimension = 0;
3943 return SUCCESS;
3947 /* Given an expression, determine its shape. This is easier than it sounds.
3948 Leaves the shape array NULL if it is not possible to determine the shape. */
3950 static void
3951 expression_shape (gfc_expr *e)
3953 mpz_t array[GFC_MAX_DIMENSIONS];
3954 int i;
3956 if (e->rank == 0 || e->shape != NULL)
3957 return;
3959 for (i = 0; i < e->rank; i++)
3960 if (gfc_array_dimen_size (e, i, &array[i]) == FAILURE)
3961 goto fail;
3963 e->shape = gfc_get_shape (e->rank);
3965 memcpy (e->shape, array, e->rank * sizeof (mpz_t));
3967 return;
3969 fail:
3970 for (i--; i >= 0; i--)
3971 mpz_clear (array[i]);
3975 /* Given a variable expression node, compute the rank of the expression by
3976 examining the base symbol and any reference structures it may have. */
3978 static void
3979 expression_rank (gfc_expr *e)
3981 gfc_ref *ref;
3982 int i, rank;
3984 if (e->ref == NULL)
3986 if (e->expr_type == EXPR_ARRAY)
3987 goto done;
3988 /* Constructors can have a rank different from one via RESHAPE(). */
3990 if (e->symtree == NULL)
3992 e->rank = 0;
3993 goto done;
3996 e->rank = (e->symtree->n.sym->as == NULL)
3997 ? 0 : e->symtree->n.sym->as->rank;
3998 goto done;
4001 rank = 0;
4003 for (ref = e->ref; ref; ref = ref->next)
4005 if (ref->type != REF_ARRAY)
4006 continue;
4008 if (ref->u.ar.type == AR_FULL)
4010 rank = ref->u.ar.as->rank;
4011 break;
4014 if (ref->u.ar.type == AR_SECTION)
4016 /* Figure out the rank of the section. */
4017 if (rank != 0)
4018 gfc_internal_error ("expression_rank(): Two array specs");
4020 for (i = 0; i < ref->u.ar.dimen; i++)
4021 if (ref->u.ar.dimen_type[i] == DIMEN_RANGE
4022 || ref->u.ar.dimen_type[i] == DIMEN_VECTOR)
4023 rank++;
4025 break;
4029 e->rank = rank;
4031 done:
4032 expression_shape (e);
4036 /* Resolve a variable expression. */
4038 static try
4039 resolve_variable (gfc_expr *e)
4041 gfc_symbol *sym;
4042 try t;
4044 t = SUCCESS;
4046 if (e->symtree == NULL)
4047 return FAILURE;
4049 if (e->ref && resolve_ref (e) == FAILURE)
4050 return FAILURE;
4052 sym = e->symtree->n.sym;
4053 if (sym->attr.flavor == FL_PROCEDURE && !sym->attr.function)
4055 e->ts.type = BT_PROCEDURE;
4056 return SUCCESS;
4059 if (sym->ts.type != BT_UNKNOWN)
4060 gfc_variable_attr (e, &e->ts);
4061 else
4063 /* Must be a simple variable reference. */
4064 if (gfc_set_default_type (sym, 1, sym->ns) == FAILURE)
4065 return FAILURE;
4066 e->ts = sym->ts;
4069 if (check_assumed_size_reference (sym, e))
4070 return FAILURE;
4072 /* Deal with forward references to entries during resolve_code, to
4073 satisfy, at least partially, 12.5.2.5. */
4074 if (gfc_current_ns->entries
4075 && current_entry_id == sym->entry_id
4076 && cs_base
4077 && cs_base->current
4078 && cs_base->current->op != EXEC_ENTRY)
4080 gfc_entry_list *entry;
4081 gfc_formal_arglist *formal;
4082 int n;
4083 bool seen;
4085 /* If the symbol is a dummy... */
4086 if (sym->attr.dummy && sym->ns == gfc_current_ns)
4088 entry = gfc_current_ns->entries;
4089 seen = false;
4091 /* ...test if the symbol is a parameter of previous entries. */
4092 for (; entry && entry->id <= current_entry_id; entry = entry->next)
4093 for (formal = entry->sym->formal; formal; formal = formal->next)
4095 if (formal->sym && sym->name == formal->sym->name)
4096 seen = true;
4099 /* If it has not been seen as a dummy, this is an error. */
4100 if (!seen)
4102 if (specification_expr)
4103 gfc_error ("Variable '%s', used in a specification expression"
4104 ", is referenced at %L before the ENTRY statement "
4105 "in which it is a parameter",
4106 sym->name, &cs_base->current->loc);
4107 else
4108 gfc_error ("Variable '%s' is used at %L before the ENTRY "
4109 "statement in which it is a parameter",
4110 sym->name, &cs_base->current->loc);
4111 t = FAILURE;
4115 /* Now do the same check on the specification expressions. */
4116 specification_expr = 1;
4117 if (sym->ts.type == BT_CHARACTER
4118 && gfc_resolve_expr (sym->ts.cl->length) == FAILURE)
4119 t = FAILURE;
4121 if (sym->as)
4122 for (n = 0; n < sym->as->rank; n++)
4124 specification_expr = 1;
4125 if (gfc_resolve_expr (sym->as->lower[n]) == FAILURE)
4126 t = FAILURE;
4127 specification_expr = 1;
4128 if (gfc_resolve_expr (sym->as->upper[n]) == FAILURE)
4129 t = FAILURE;
4131 specification_expr = 0;
4133 if (t == SUCCESS)
4134 /* Update the symbol's entry level. */
4135 sym->entry_id = current_entry_id + 1;
4138 return t;
4142 /* Checks to see that the correct symbol has been host associated.
4143 The only situation where this arises is that in which a twice
4144 contained function is parsed after the host association is made.
4145 Therefore, on detecting this, the line is rematched, having got
4146 rid of the existing references and actual_arg_list. */
4147 static bool
4148 check_host_association (gfc_expr *e)
4150 gfc_symbol *sym, *old_sym;
4151 locus temp_locus;
4152 gfc_expr *expr;
4153 int n;
4154 bool retval = e->expr_type == EXPR_FUNCTION;
4156 if (e->symtree == NULL || e->symtree->n.sym == NULL)
4157 return retval;
4159 old_sym = e->symtree->n.sym;
4161 if (old_sym->attr.use_assoc)
4162 return retval;
4164 if (gfc_current_ns->parent
4165 && old_sym->ns != gfc_current_ns)
4167 gfc_find_symbol (old_sym->name, gfc_current_ns, 1, &sym);
4168 if (sym && old_sym != sym
4169 && sym->attr.flavor == FL_PROCEDURE
4170 && sym->attr.contained)
4172 temp_locus = gfc_current_locus;
4173 gfc_current_locus = e->where;
4175 gfc_buffer_error (1);
4177 gfc_free_ref_list (e->ref);
4178 e->ref = NULL;
4180 if (retval)
4182 gfc_free_actual_arglist (e->value.function.actual);
4183 e->value.function.actual = NULL;
4186 if (e->shape != NULL)
4188 for (n = 0; n < e->rank; n++)
4189 mpz_clear (e->shape[n]);
4191 gfc_free (e->shape);
4194 gfc_match_rvalue (&expr);
4195 gfc_clear_error ();
4196 gfc_buffer_error (0);
4198 gcc_assert (expr && sym == expr->symtree->n.sym);
4200 *e = *expr;
4201 gfc_free (expr);
4202 sym->refs++;
4204 gfc_current_locus = temp_locus;
4207 /* This might have changed! */
4208 return e->expr_type == EXPR_FUNCTION;
4212 static void
4213 gfc_resolve_character_operator (gfc_expr *e)
4215 gfc_expr *op1 = e->value.op.op1;
4216 gfc_expr *op2 = e->value.op.op2;
4217 gfc_expr *e1 = NULL;
4218 gfc_expr *e2 = NULL;
4220 gcc_assert (e->value.op.operator == INTRINSIC_CONCAT);
4222 if (op1->ts.cl && op1->ts.cl->length)
4223 e1 = gfc_copy_expr (op1->ts.cl->length);
4224 else if (op1->expr_type == EXPR_CONSTANT)
4225 e1 = gfc_int_expr (op1->value.character.length);
4227 if (op2->ts.cl && op2->ts.cl->length)
4228 e2 = gfc_copy_expr (op2->ts.cl->length);
4229 else if (op2->expr_type == EXPR_CONSTANT)
4230 e2 = gfc_int_expr (op2->value.character.length);
4232 e->ts.cl = gfc_get_charlen ();
4233 e->ts.cl->next = gfc_current_ns->cl_list;
4234 gfc_current_ns->cl_list = e->ts.cl;
4236 if (!e1 || !e2)
4237 return;
4239 e->ts.cl->length = gfc_add (e1, e2);
4240 e->ts.cl->length->ts.type = BT_INTEGER;
4241 e->ts.cl->length->ts.kind = gfc_charlen_int_kind;;
4242 gfc_simplify_expr (e->ts.cl->length, 0);
4243 gfc_resolve_expr (e->ts.cl->length);
4245 return;
4249 /* Ensure that an character expression has a charlen and, if possible, a
4250 length expression. */
4252 static void
4253 fixup_charlen (gfc_expr *e)
4255 /* The cases fall through so that changes in expression type and the need
4256 for multiple fixes are picked up. In all circumstances, a charlen should
4257 be available for the middle end to hang a backend_decl on. */
4258 switch (e->expr_type)
4260 case EXPR_OP:
4261 gfc_resolve_character_operator (e);
4263 case EXPR_ARRAY:
4264 if (e->expr_type == EXPR_ARRAY)
4265 gfc_resolve_character_array_constructor (e);
4267 case EXPR_SUBSTRING:
4268 if (!e->ts.cl && e->ref)
4269 gfc_resolve_substring_charlen (e);
4271 default:
4272 if (!e->ts.cl)
4274 e->ts.cl = gfc_get_charlen ();
4275 e->ts.cl->next = gfc_current_ns->cl_list;
4276 gfc_current_ns->cl_list = e->ts.cl;
4279 break;
4284 /* Resolve an expression. That is, make sure that types of operands agree
4285 with their operators, intrinsic operators are converted to function calls
4286 for overloaded types and unresolved function references are resolved. */
4289 gfc_resolve_expr (gfc_expr *e)
4291 try t;
4293 if (e == NULL)
4294 return SUCCESS;
4296 switch (e->expr_type)
4298 case EXPR_OP:
4299 t = resolve_operator (e);
4300 break;
4302 case EXPR_FUNCTION:
4303 case EXPR_VARIABLE:
4305 if (check_host_association (e))
4306 t = resolve_function (e);
4307 else
4309 t = resolve_variable (e);
4310 if (t == SUCCESS)
4311 expression_rank (e);
4314 if (e->ts.type == BT_CHARACTER && e->ts.cl == NULL && e->ref
4315 && e->ref->type != REF_SUBSTRING)
4316 gfc_resolve_substring_charlen (e);
4318 break;
4320 case EXPR_SUBSTRING:
4321 t = resolve_ref (e);
4322 break;
4324 case EXPR_CONSTANT:
4325 case EXPR_NULL:
4326 t = SUCCESS;
4327 break;
4329 case EXPR_ARRAY:
4330 t = FAILURE;
4331 if (resolve_ref (e) == FAILURE)
4332 break;
4334 t = gfc_resolve_array_constructor (e);
4335 /* Also try to expand a constructor. */
4336 if (t == SUCCESS)
4338 expression_rank (e);
4339 gfc_expand_constructor (e);
4342 /* This provides the opportunity for the length of constructors with
4343 character valued function elements to propagate the string length
4344 to the expression. */
4345 if (e->ts.type == BT_CHARACTER)
4346 gfc_resolve_character_array_constructor (e);
4348 break;
4350 case EXPR_STRUCTURE:
4351 t = resolve_ref (e);
4352 if (t == FAILURE)
4353 break;
4355 t = resolve_structure_cons (e);
4356 if (t == FAILURE)
4357 break;
4359 t = gfc_simplify_expr (e, 0);
4360 break;
4362 default:
4363 gfc_internal_error ("gfc_resolve_expr(): Bad expression type");
4366 if (e->ts.type == BT_CHARACTER && t == SUCCESS && !e->ts.cl)
4367 fixup_charlen (e);
4369 return t;
4373 /* Resolve an expression from an iterator. They must be scalar and have
4374 INTEGER or (optionally) REAL type. */
4376 static try
4377 gfc_resolve_iterator_expr (gfc_expr *expr, bool real_ok,
4378 const char *name_msgid)
4380 if (gfc_resolve_expr (expr) == FAILURE)
4381 return FAILURE;
4383 if (expr->rank != 0)
4385 gfc_error ("%s at %L must be a scalar", _(name_msgid), &expr->where);
4386 return FAILURE;
4389 if (expr->ts.type != BT_INTEGER)
4391 if (expr->ts.type == BT_REAL)
4393 if (real_ok)
4394 return gfc_notify_std (GFC_STD_F95_DEL,
4395 "Deleted feature: %s at %L must be integer",
4396 _(name_msgid), &expr->where);
4397 else
4399 gfc_error ("%s at %L must be INTEGER", _(name_msgid),
4400 &expr->where);
4401 return FAILURE;
4404 else
4406 gfc_error ("%s at %L must be INTEGER", _(name_msgid), &expr->where);
4407 return FAILURE;
4410 return SUCCESS;
4414 /* Resolve the expressions in an iterator structure. If REAL_OK is
4415 false allow only INTEGER type iterators, otherwise allow REAL types. */
4418 gfc_resolve_iterator (gfc_iterator *iter, bool real_ok)
4420 if (gfc_resolve_iterator_expr (iter->var, real_ok, "Loop variable")
4421 == FAILURE)
4422 return FAILURE;
4424 if (gfc_pure (NULL) && gfc_impure_variable (iter->var->symtree->n.sym))
4426 gfc_error ("Cannot assign to loop variable in PURE procedure at %L",
4427 &iter->var->where);
4428 return FAILURE;
4431 if (gfc_resolve_iterator_expr (iter->start, real_ok,
4432 "Start expression in DO loop") == FAILURE)
4433 return FAILURE;
4435 if (gfc_resolve_iterator_expr (iter->end, real_ok,
4436 "End expression in DO loop") == FAILURE)
4437 return FAILURE;
4439 if (gfc_resolve_iterator_expr (iter->step, real_ok,
4440 "Step expression in DO loop") == FAILURE)
4441 return FAILURE;
4443 if (iter->step->expr_type == EXPR_CONSTANT)
4445 if ((iter->step->ts.type == BT_INTEGER
4446 && mpz_cmp_ui (iter->step->value.integer, 0) == 0)
4447 || (iter->step->ts.type == BT_REAL
4448 && mpfr_sgn (iter->step->value.real) == 0))
4450 gfc_error ("Step expression in DO loop at %L cannot be zero",
4451 &iter->step->where);
4452 return FAILURE;
4456 /* Convert start, end, and step to the same type as var. */
4457 if (iter->start->ts.kind != iter->var->ts.kind
4458 || iter->start->ts.type != iter->var->ts.type)
4459 gfc_convert_type (iter->start, &iter->var->ts, 2);
4461 if (iter->end->ts.kind != iter->var->ts.kind
4462 || iter->end->ts.type != iter->var->ts.type)
4463 gfc_convert_type (iter->end, &iter->var->ts, 2);
4465 if (iter->step->ts.kind != iter->var->ts.kind
4466 || iter->step->ts.type != iter->var->ts.type)
4467 gfc_convert_type (iter->step, &iter->var->ts, 2);
4469 return SUCCESS;
4473 /* Traversal function for find_forall_index. f == 2 signals that
4474 that variable itself is not to be checked - only the references. */
4476 static bool
4477 forall_index (gfc_expr *expr, gfc_symbol *sym, int *f)
4479 if (expr->expr_type != EXPR_VARIABLE)
4480 return false;
4482 /* A scalar assignment */
4483 if (!expr->ref || *f == 1)
4485 if (expr->symtree->n.sym == sym)
4486 return true;
4487 else
4488 return false;
4491 if (*f == 2)
4492 *f = 1;
4493 return false;
4497 /* Check whether the FORALL index appears in the expression or not.
4498 Returns SUCCESS if SYM is found in EXPR. */
4501 find_forall_index (gfc_expr *expr, gfc_symbol *sym, int f)
4503 if (gfc_traverse_expr (expr, sym, forall_index, f))
4504 return SUCCESS;
4505 else
4506 return FAILURE;
4510 /* Resolve a list of FORALL iterators. The FORALL index-name is constrained
4511 to be a scalar INTEGER variable. The subscripts and stride are scalar
4512 INTEGERs, and if stride is a constant it must be nonzero.
4513 Furthermore "A subscript or stride in a forall-triplet-spec shall
4514 not contain a reference to any index-name in the
4515 forall-triplet-spec-list in which it appears." (7.5.4.1) */
4517 static void
4518 resolve_forall_iterators (gfc_forall_iterator *it)
4520 gfc_forall_iterator *iter, *iter2;
4522 for (iter = it; iter; iter = iter->next)
4524 if (gfc_resolve_expr (iter->var) == SUCCESS
4525 && (iter->var->ts.type != BT_INTEGER || iter->var->rank != 0))
4526 gfc_error ("FORALL index-name at %L must be a scalar INTEGER",
4527 &iter->var->where);
4529 if (gfc_resolve_expr (iter->start) == SUCCESS
4530 && (iter->start->ts.type != BT_INTEGER || iter->start->rank != 0))
4531 gfc_error ("FORALL start expression at %L must be a scalar INTEGER",
4532 &iter->start->where);
4533 if (iter->var->ts.kind != iter->start->ts.kind)
4534 gfc_convert_type (iter->start, &iter->var->ts, 2);
4536 if (gfc_resolve_expr (iter->end) == SUCCESS
4537 && (iter->end->ts.type != BT_INTEGER || iter->end->rank != 0))
4538 gfc_error ("FORALL end expression at %L must be a scalar INTEGER",
4539 &iter->end->where);
4540 if (iter->var->ts.kind != iter->end->ts.kind)
4541 gfc_convert_type (iter->end, &iter->var->ts, 2);
4543 if (gfc_resolve_expr (iter->stride) == SUCCESS)
4545 if (iter->stride->ts.type != BT_INTEGER || iter->stride->rank != 0)
4546 gfc_error ("FORALL stride expression at %L must be a scalar %s",
4547 &iter->stride->where, "INTEGER");
4549 if (iter->stride->expr_type == EXPR_CONSTANT
4550 && mpz_cmp_ui(iter->stride->value.integer, 0) == 0)
4551 gfc_error ("FORALL stride expression at %L cannot be zero",
4552 &iter->stride->where);
4554 if (iter->var->ts.kind != iter->stride->ts.kind)
4555 gfc_convert_type (iter->stride, &iter->var->ts, 2);
4558 for (iter = it; iter; iter = iter->next)
4559 for (iter2 = iter; iter2; iter2 = iter2->next)
4561 if (find_forall_index (iter2->start,
4562 iter->var->symtree->n.sym, 0) == SUCCESS
4563 || find_forall_index (iter2->end,
4564 iter->var->symtree->n.sym, 0) == SUCCESS
4565 || find_forall_index (iter2->stride,
4566 iter->var->symtree->n.sym, 0) == SUCCESS)
4567 gfc_error ("FORALL index '%s' may not appear in triplet "
4568 "specification at %L", iter->var->symtree->name,
4569 &iter2->start->where);
4574 /* Given a pointer to a symbol that is a derived type, see if it's
4575 inaccessible, i.e. if it's defined in another module and the components are
4576 PRIVATE. The search is recursive if necessary. Returns zero if no
4577 inaccessible components are found, nonzero otherwise. */
4579 static int
4580 derived_inaccessible (gfc_symbol *sym)
4582 gfc_component *c;
4584 if (sym->attr.use_assoc && sym->attr.private_comp)
4585 return 1;
4587 for (c = sym->components; c; c = c->next)
4589 if (c->ts.type == BT_DERIVED && derived_inaccessible (c->ts.derived))
4590 return 1;
4593 return 0;
4597 /* Resolve the argument of a deallocate expression. The expression must be
4598 a pointer or a full array. */
4600 static try
4601 resolve_deallocate_expr (gfc_expr *e)
4603 symbol_attribute attr;
4604 int allocatable, pointer, check_intent_in;
4605 gfc_ref *ref;
4607 /* Check INTENT(IN), unless the object is a sub-component of a pointer. */
4608 check_intent_in = 1;
4610 if (gfc_resolve_expr (e) == FAILURE)
4611 return FAILURE;
4613 if (e->expr_type != EXPR_VARIABLE)
4614 goto bad;
4616 allocatable = e->symtree->n.sym->attr.allocatable;
4617 pointer = e->symtree->n.sym->attr.pointer;
4618 for (ref = e->ref; ref; ref = ref->next)
4620 if (pointer)
4621 check_intent_in = 0;
4623 switch (ref->type)
4625 case REF_ARRAY:
4626 if (ref->u.ar.type != AR_FULL)
4627 allocatable = 0;
4628 break;
4630 case REF_COMPONENT:
4631 allocatable = (ref->u.c.component->as != NULL
4632 && ref->u.c.component->as->type == AS_DEFERRED);
4633 pointer = ref->u.c.component->pointer;
4634 break;
4636 case REF_SUBSTRING:
4637 allocatable = 0;
4638 break;
4642 attr = gfc_expr_attr (e);
4644 if (allocatable == 0 && attr.pointer == 0)
4646 bad:
4647 gfc_error ("Expression in DEALLOCATE statement at %L must be "
4648 "ALLOCATABLE or a POINTER", &e->where);
4651 if (check_intent_in
4652 && e->symtree->n.sym->attr.intent == INTENT_IN)
4654 gfc_error ("Cannot deallocate INTENT(IN) variable '%s' at %L",
4655 e->symtree->n.sym->name, &e->where);
4656 return FAILURE;
4659 return SUCCESS;
4663 /* Returns true if the expression e contains a reference to the symbol sym. */
4664 static bool
4665 sym_in_expr (gfc_expr *e, gfc_symbol *sym, int *f ATTRIBUTE_UNUSED)
4667 if (e->expr_type == EXPR_VARIABLE && e->symtree->n.sym == sym)
4668 return true;
4670 return false;
4673 bool
4674 gfc_find_sym_in_expr (gfc_symbol *sym, gfc_expr *e)
4676 return gfc_traverse_expr (e, sym, sym_in_expr, 0);
4680 /* Given the expression node e for an allocatable/pointer of derived type to be
4681 allocated, get the expression node to be initialized afterwards (needed for
4682 derived types with default initializers, and derived types with allocatable
4683 components that need nullification.) */
4685 static gfc_expr *
4686 expr_to_initialize (gfc_expr *e)
4688 gfc_expr *result;
4689 gfc_ref *ref;
4690 int i;
4692 result = gfc_copy_expr (e);
4694 /* Change the last array reference from AR_ELEMENT to AR_FULL. */
4695 for (ref = result->ref; ref; ref = ref->next)
4696 if (ref->type == REF_ARRAY && ref->next == NULL)
4698 ref->u.ar.type = AR_FULL;
4700 for (i = 0; i < ref->u.ar.dimen; i++)
4701 ref->u.ar.start[i] = ref->u.ar.end[i] = ref->u.ar.stride[i] = NULL;
4703 result->rank = ref->u.ar.dimen;
4704 break;
4707 return result;
4711 /* Resolve the expression in an ALLOCATE statement, doing the additional
4712 checks to see whether the expression is OK or not. The expression must
4713 have a trailing array reference that gives the size of the array. */
4715 static try
4716 resolve_allocate_expr (gfc_expr *e, gfc_code *code)
4718 int i, pointer, allocatable, dimension, check_intent_in;
4719 symbol_attribute attr;
4720 gfc_ref *ref, *ref2;
4721 gfc_array_ref *ar;
4722 gfc_code *init_st;
4723 gfc_expr *init_e;
4724 gfc_symbol *sym;
4725 gfc_alloc *a;
4727 /* Check INTENT(IN), unless the object is a sub-component of a pointer. */
4728 check_intent_in = 1;
4730 if (gfc_resolve_expr (e) == FAILURE)
4731 return FAILURE;
4733 if (code->expr && code->expr->expr_type == EXPR_VARIABLE)
4734 sym = code->expr->symtree->n.sym;
4735 else
4736 sym = NULL;
4738 /* Make sure the expression is allocatable or a pointer. If it is
4739 pointer, the next-to-last reference must be a pointer. */
4741 ref2 = NULL;
4743 if (e->expr_type != EXPR_VARIABLE)
4745 allocatable = 0;
4746 attr = gfc_expr_attr (e);
4747 pointer = attr.pointer;
4748 dimension = attr.dimension;
4750 else
4752 allocatable = e->symtree->n.sym->attr.allocatable;
4753 pointer = e->symtree->n.sym->attr.pointer;
4754 dimension = e->symtree->n.sym->attr.dimension;
4756 if (sym == e->symtree->n.sym && sym->ts.type != BT_DERIVED)
4758 gfc_error ("The STAT variable '%s' in an ALLOCATE statement must "
4759 "not be allocated in the same statement at %L",
4760 sym->name, &e->where);
4761 return FAILURE;
4764 for (ref = e->ref; ref; ref2 = ref, ref = ref->next)
4766 if (pointer)
4767 check_intent_in = 0;
4769 switch (ref->type)
4771 case REF_ARRAY:
4772 if (ref->next != NULL)
4773 pointer = 0;
4774 break;
4776 case REF_COMPONENT:
4777 allocatable = (ref->u.c.component->as != NULL
4778 && ref->u.c.component->as->type == AS_DEFERRED);
4780 pointer = ref->u.c.component->pointer;
4781 dimension = ref->u.c.component->dimension;
4782 break;
4784 case REF_SUBSTRING:
4785 allocatable = 0;
4786 pointer = 0;
4787 break;
4792 if (allocatable == 0 && pointer == 0)
4794 gfc_error ("Expression in ALLOCATE statement at %L must be "
4795 "ALLOCATABLE or a POINTER", &e->where);
4796 return FAILURE;
4799 if (check_intent_in
4800 && e->symtree->n.sym->attr.intent == INTENT_IN)
4802 gfc_error ("Cannot allocate INTENT(IN) variable '%s' at %L",
4803 e->symtree->n.sym->name, &e->where);
4804 return FAILURE;
4807 /* Add default initializer for those derived types that need them. */
4808 if (e->ts.type == BT_DERIVED && (init_e = gfc_default_initializer (&e->ts)))
4810 init_st = gfc_get_code ();
4811 init_st->loc = code->loc;
4812 init_st->op = EXEC_INIT_ASSIGN;
4813 init_st->expr = expr_to_initialize (e);
4814 init_st->expr2 = init_e;
4815 init_st->next = code->next;
4816 code->next = init_st;
4819 if (pointer && dimension == 0)
4820 return SUCCESS;
4822 /* Make sure the next-to-last reference node is an array specification. */
4824 if (ref2 == NULL || ref2->type != REF_ARRAY || ref2->u.ar.type == AR_FULL)
4826 gfc_error ("Array specification required in ALLOCATE statement "
4827 "at %L", &e->where);
4828 return FAILURE;
4831 /* Make sure that the array section reference makes sense in the
4832 context of an ALLOCATE specification. */
4834 ar = &ref2->u.ar;
4836 for (i = 0; i < ar->dimen; i++)
4838 if (ref2->u.ar.type == AR_ELEMENT)
4839 goto check_symbols;
4841 switch (ar->dimen_type[i])
4843 case DIMEN_ELEMENT:
4844 break;
4846 case DIMEN_RANGE:
4847 if (ar->start[i] != NULL
4848 && ar->end[i] != NULL
4849 && ar->stride[i] == NULL)
4850 break;
4852 /* Fall Through... */
4854 case DIMEN_UNKNOWN:
4855 case DIMEN_VECTOR:
4856 gfc_error ("Bad array specification in ALLOCATE statement at %L",
4857 &e->where);
4858 return FAILURE;
4861 check_symbols:
4863 for (a = code->ext.alloc_list; a; a = a->next)
4865 sym = a->expr->symtree->n.sym;
4867 /* TODO - check derived type components. */
4868 if (sym->ts.type == BT_DERIVED)
4869 continue;
4871 if ((ar->start[i] != NULL
4872 && gfc_find_sym_in_expr (sym, ar->start[i]))
4873 || (ar->end[i] != NULL
4874 && gfc_find_sym_in_expr (sym, ar->end[i])))
4876 gfc_error ("'%s' must not appear an the array specification at "
4877 "%L in the same ALLOCATE statement where it is "
4878 "itself allocated", sym->name, &ar->where);
4879 return FAILURE;
4884 return SUCCESS;
4887 static void
4888 resolve_allocate_deallocate (gfc_code *code, const char *fcn)
4890 gfc_symbol *s = NULL;
4891 gfc_alloc *a;
4893 if (code->expr)
4894 s = code->expr->symtree->n.sym;
4896 if (s)
4898 if (s->attr.intent == INTENT_IN)
4899 gfc_error ("STAT variable '%s' of %s statement at %C cannot "
4900 "be INTENT(IN)", s->name, fcn);
4902 if (gfc_pure (NULL) && gfc_impure_variable (s))
4903 gfc_error ("Illegal STAT variable in %s statement at %C "
4904 "for a PURE procedure", fcn);
4907 if (s && code->expr->ts.type != BT_INTEGER)
4908 gfc_error ("STAT tag in %s statement at %L must be "
4909 "of type INTEGER", fcn, &code->expr->where);
4911 if (strcmp (fcn, "ALLOCATE") == 0)
4913 for (a = code->ext.alloc_list; a; a = a->next)
4914 resolve_allocate_expr (a->expr, code);
4916 else
4918 for (a = code->ext.alloc_list; a; a = a->next)
4919 resolve_deallocate_expr (a->expr);
4923 /************ SELECT CASE resolution subroutines ************/
4925 /* Callback function for our mergesort variant. Determines interval
4926 overlaps for CASEs. Return <0 if op1 < op2, 0 for overlap, >0 for
4927 op1 > op2. Assumes we're not dealing with the default case.
4928 We have op1 = (:L), (K:L) or (K:) and op2 = (:N), (M:N) or (M:).
4929 There are nine situations to check. */
4931 static int
4932 compare_cases (const gfc_case *op1, const gfc_case *op2)
4934 int retval;
4936 if (op1->low == NULL) /* op1 = (:L) */
4938 /* op2 = (:N), so overlap. */
4939 retval = 0;
4940 /* op2 = (M:) or (M:N), L < M */
4941 if (op2->low != NULL
4942 && gfc_compare_expr (op1->high, op2->low, INTRINSIC_LT) < 0)
4943 retval = -1;
4945 else if (op1->high == NULL) /* op1 = (K:) */
4947 /* op2 = (M:), so overlap. */
4948 retval = 0;
4949 /* op2 = (:N) or (M:N), K > N */
4950 if (op2->high != NULL
4951 && gfc_compare_expr (op1->low, op2->high, INTRINSIC_GT) > 0)
4952 retval = 1;
4954 else /* op1 = (K:L) */
4956 if (op2->low == NULL) /* op2 = (:N), K > N */
4957 retval = (gfc_compare_expr (op1->low, op2->high, INTRINSIC_GT) > 0)
4958 ? 1 : 0;
4959 else if (op2->high == NULL) /* op2 = (M:), L < M */
4960 retval = (gfc_compare_expr (op1->high, op2->low, INTRINSIC_LT) < 0)
4961 ? -1 : 0;
4962 else /* op2 = (M:N) */
4964 retval = 0;
4965 /* L < M */
4966 if (gfc_compare_expr (op1->high, op2->low, INTRINSIC_LT) < 0)
4967 retval = -1;
4968 /* K > N */
4969 else if (gfc_compare_expr (op1->low, op2->high, INTRINSIC_GT) > 0)
4970 retval = 1;
4974 return retval;
4978 /* Merge-sort a double linked case list, detecting overlap in the
4979 process. LIST is the head of the double linked case list before it
4980 is sorted. Returns the head of the sorted list if we don't see any
4981 overlap, or NULL otherwise. */
4983 static gfc_case *
4984 check_case_overlap (gfc_case *list)
4986 gfc_case *p, *q, *e, *tail;
4987 int insize, nmerges, psize, qsize, cmp, overlap_seen;
4989 /* If the passed list was empty, return immediately. */
4990 if (!list)
4991 return NULL;
4993 overlap_seen = 0;
4994 insize = 1;
4996 /* Loop unconditionally. The only exit from this loop is a return
4997 statement, when we've finished sorting the case list. */
4998 for (;;)
5000 p = list;
5001 list = NULL;
5002 tail = NULL;
5004 /* Count the number of merges we do in this pass. */
5005 nmerges = 0;
5007 /* Loop while there exists a merge to be done. */
5008 while (p)
5010 int i;
5012 /* Count this merge. */
5013 nmerges++;
5015 /* Cut the list in two pieces by stepping INSIZE places
5016 forward in the list, starting from P. */
5017 psize = 0;
5018 q = p;
5019 for (i = 0; i < insize; i++)
5021 psize++;
5022 q = q->right;
5023 if (!q)
5024 break;
5026 qsize = insize;
5028 /* Now we have two lists. Merge them! */
5029 while (psize > 0 || (qsize > 0 && q != NULL))
5031 /* See from which the next case to merge comes from. */
5032 if (psize == 0)
5034 /* P is empty so the next case must come from Q. */
5035 e = q;
5036 q = q->right;
5037 qsize--;
5039 else if (qsize == 0 || q == NULL)
5041 /* Q is empty. */
5042 e = p;
5043 p = p->right;
5044 psize--;
5046 else
5048 cmp = compare_cases (p, q);
5049 if (cmp < 0)
5051 /* The whole case range for P is less than the
5052 one for Q. */
5053 e = p;
5054 p = p->right;
5055 psize--;
5057 else if (cmp > 0)
5059 /* The whole case range for Q is greater than
5060 the case range for P. */
5061 e = q;
5062 q = q->right;
5063 qsize--;
5065 else
5067 /* The cases overlap, or they are the same
5068 element in the list. Either way, we must
5069 issue an error and get the next case from P. */
5070 /* FIXME: Sort P and Q by line number. */
5071 gfc_error ("CASE label at %L overlaps with CASE "
5072 "label at %L", &p->where, &q->where);
5073 overlap_seen = 1;
5074 e = p;
5075 p = p->right;
5076 psize--;
5080 /* Add the next element to the merged list. */
5081 if (tail)
5082 tail->right = e;
5083 else
5084 list = e;
5085 e->left = tail;
5086 tail = e;
5089 /* P has now stepped INSIZE places along, and so has Q. So
5090 they're the same. */
5091 p = q;
5093 tail->right = NULL;
5095 /* If we have done only one merge or none at all, we've
5096 finished sorting the cases. */
5097 if (nmerges <= 1)
5099 if (!overlap_seen)
5100 return list;
5101 else
5102 return NULL;
5105 /* Otherwise repeat, merging lists twice the size. */
5106 insize *= 2;
5111 /* Check to see if an expression is suitable for use in a CASE statement.
5112 Makes sure that all case expressions are scalar constants of the same
5113 type. Return FAILURE if anything is wrong. */
5115 static try
5116 validate_case_label_expr (gfc_expr *e, gfc_expr *case_expr)
5118 if (e == NULL) return SUCCESS;
5120 if (e->ts.type != case_expr->ts.type)
5122 gfc_error ("Expression in CASE statement at %L must be of type %s",
5123 &e->where, gfc_basic_typename (case_expr->ts.type));
5124 return FAILURE;
5127 /* C805 (R808) For a given case-construct, each case-value shall be of
5128 the same type as case-expr. For character type, length differences
5129 are allowed, but the kind type parameters shall be the same. */
5131 if (case_expr->ts.type == BT_CHARACTER && e->ts.kind != case_expr->ts.kind)
5133 gfc_error ("Expression in CASE statement at %L must be of kind %d",
5134 &e->where, case_expr->ts.kind);
5135 return FAILURE;
5138 /* Convert the case value kind to that of case expression kind, if needed.
5139 FIXME: Should a warning be issued? */
5140 if (e->ts.kind != case_expr->ts.kind)
5141 gfc_convert_type_warn (e, &case_expr->ts, 2, 0);
5143 if (e->rank != 0)
5145 gfc_error ("Expression in CASE statement at %L must be scalar",
5146 &e->where);
5147 return FAILURE;
5150 return SUCCESS;
5154 /* Given a completely parsed select statement, we:
5156 - Validate all expressions and code within the SELECT.
5157 - Make sure that the selection expression is not of the wrong type.
5158 - Make sure that no case ranges overlap.
5159 - Eliminate unreachable cases and unreachable code resulting from
5160 removing case labels.
5162 The standard does allow unreachable cases, e.g. CASE (5:3). But
5163 they are a hassle for code generation, and to prevent that, we just
5164 cut them out here. This is not necessary for overlapping cases
5165 because they are illegal and we never even try to generate code.
5167 We have the additional caveat that a SELECT construct could have
5168 been a computed GOTO in the source code. Fortunately we can fairly
5169 easily work around that here: The case_expr for a "real" SELECT CASE
5170 is in code->expr1, but for a computed GOTO it is in code->expr2. All
5171 we have to do is make sure that the case_expr is a scalar integer
5172 expression. */
5174 static void
5175 resolve_select (gfc_code *code)
5177 gfc_code *body;
5178 gfc_expr *case_expr;
5179 gfc_case *cp, *default_case, *tail, *head;
5180 int seen_unreachable;
5181 int seen_logical;
5182 int ncases;
5183 bt type;
5184 try t;
5186 if (code->expr == NULL)
5188 /* This was actually a computed GOTO statement. */
5189 case_expr = code->expr2;
5190 if (case_expr->ts.type != BT_INTEGER|| case_expr->rank != 0)
5191 gfc_error ("Selection expression in computed GOTO statement "
5192 "at %L must be a scalar integer expression",
5193 &case_expr->where);
5195 /* Further checking is not necessary because this SELECT was built
5196 by the compiler, so it should always be OK. Just move the
5197 case_expr from expr2 to expr so that we can handle computed
5198 GOTOs as normal SELECTs from here on. */
5199 code->expr = code->expr2;
5200 code->expr2 = NULL;
5201 return;
5204 case_expr = code->expr;
5206 type = case_expr->ts.type;
5207 if (type != BT_LOGICAL && type != BT_INTEGER && type != BT_CHARACTER)
5209 gfc_error ("Argument of SELECT statement at %L cannot be %s",
5210 &case_expr->where, gfc_typename (&case_expr->ts));
5212 /* Punt. Going on here just produce more garbage error messages. */
5213 return;
5216 if (case_expr->rank != 0)
5218 gfc_error ("Argument of SELECT statement at %L must be a scalar "
5219 "expression", &case_expr->where);
5221 /* Punt. */
5222 return;
5225 /* PR 19168 has a long discussion concerning a mismatch of the kinds
5226 of the SELECT CASE expression and its CASE values. Walk the lists
5227 of case values, and if we find a mismatch, promote case_expr to
5228 the appropriate kind. */
5230 if (type == BT_LOGICAL || type == BT_INTEGER)
5232 for (body = code->block; body; body = body->block)
5234 /* Walk the case label list. */
5235 for (cp = body->ext.case_list; cp; cp = cp->next)
5237 /* Intercept the DEFAULT case. It does not have a kind. */
5238 if (cp->low == NULL && cp->high == NULL)
5239 continue;
5241 /* Unreachable case ranges are discarded, so ignore. */
5242 if (cp->low != NULL && cp->high != NULL
5243 && cp->low != cp->high
5244 && gfc_compare_expr (cp->low, cp->high, INTRINSIC_GT) > 0)
5245 continue;
5247 /* FIXME: Should a warning be issued? */
5248 if (cp->low != NULL
5249 && case_expr->ts.kind != gfc_kind_max(case_expr, cp->low))
5250 gfc_convert_type_warn (case_expr, &cp->low->ts, 2, 0);
5252 if (cp->high != NULL
5253 && case_expr->ts.kind != gfc_kind_max(case_expr, cp->high))
5254 gfc_convert_type_warn (case_expr, &cp->high->ts, 2, 0);
5259 /* Assume there is no DEFAULT case. */
5260 default_case = NULL;
5261 head = tail = NULL;
5262 ncases = 0;
5263 seen_logical = 0;
5265 for (body = code->block; body; body = body->block)
5267 /* Assume the CASE list is OK, and all CASE labels can be matched. */
5268 t = SUCCESS;
5269 seen_unreachable = 0;
5271 /* Walk the case label list, making sure that all case labels
5272 are legal. */
5273 for (cp = body->ext.case_list; cp; cp = cp->next)
5275 /* Count the number of cases in the whole construct. */
5276 ncases++;
5278 /* Intercept the DEFAULT case. */
5279 if (cp->low == NULL && cp->high == NULL)
5281 if (default_case != NULL)
5283 gfc_error ("The DEFAULT CASE at %L cannot be followed "
5284 "by a second DEFAULT CASE at %L",
5285 &default_case->where, &cp->where);
5286 t = FAILURE;
5287 break;
5289 else
5291 default_case = cp;
5292 continue;
5296 /* Deal with single value cases and case ranges. Errors are
5297 issued from the validation function. */
5298 if(validate_case_label_expr (cp->low, case_expr) != SUCCESS
5299 || validate_case_label_expr (cp->high, case_expr) != SUCCESS)
5301 t = FAILURE;
5302 break;
5305 if (type == BT_LOGICAL
5306 && ((cp->low == NULL || cp->high == NULL)
5307 || cp->low != cp->high))
5309 gfc_error ("Logical range in CASE statement at %L is not "
5310 "allowed", &cp->low->where);
5311 t = FAILURE;
5312 break;
5315 if (type == BT_LOGICAL && cp->low->expr_type == EXPR_CONSTANT)
5317 int value;
5318 value = cp->low->value.logical == 0 ? 2 : 1;
5319 if (value & seen_logical)
5321 gfc_error ("constant logical value in CASE statement "
5322 "is repeated at %L",
5323 &cp->low->where);
5324 t = FAILURE;
5325 break;
5327 seen_logical |= value;
5330 if (cp->low != NULL && cp->high != NULL
5331 && cp->low != cp->high
5332 && gfc_compare_expr (cp->low, cp->high, INTRINSIC_GT) > 0)
5334 if (gfc_option.warn_surprising)
5335 gfc_warning ("Range specification at %L can never "
5336 "be matched", &cp->where);
5338 cp->unreachable = 1;
5339 seen_unreachable = 1;
5341 else
5343 /* If the case range can be matched, it can also overlap with
5344 other cases. To make sure it does not, we put it in a
5345 double linked list here. We sort that with a merge sort
5346 later on to detect any overlapping cases. */
5347 if (!head)
5349 head = tail = cp;
5350 head->right = head->left = NULL;
5352 else
5354 tail->right = cp;
5355 tail->right->left = tail;
5356 tail = tail->right;
5357 tail->right = NULL;
5362 /* It there was a failure in the previous case label, give up
5363 for this case label list. Continue with the next block. */
5364 if (t == FAILURE)
5365 continue;
5367 /* See if any case labels that are unreachable have been seen.
5368 If so, we eliminate them. This is a bit of a kludge because
5369 the case lists for a single case statement (label) is a
5370 single forward linked lists. */
5371 if (seen_unreachable)
5373 /* Advance until the first case in the list is reachable. */
5374 while (body->ext.case_list != NULL
5375 && body->ext.case_list->unreachable)
5377 gfc_case *n = body->ext.case_list;
5378 body->ext.case_list = body->ext.case_list->next;
5379 n->next = NULL;
5380 gfc_free_case_list (n);
5383 /* Strip all other unreachable cases. */
5384 if (body->ext.case_list)
5386 for (cp = body->ext.case_list; cp->next; cp = cp->next)
5388 if (cp->next->unreachable)
5390 gfc_case *n = cp->next;
5391 cp->next = cp->next->next;
5392 n->next = NULL;
5393 gfc_free_case_list (n);
5400 /* See if there were overlapping cases. If the check returns NULL,
5401 there was overlap. In that case we don't do anything. If head
5402 is non-NULL, we prepend the DEFAULT case. The sorted list can
5403 then used during code generation for SELECT CASE constructs with
5404 a case expression of a CHARACTER type. */
5405 if (head)
5407 head = check_case_overlap (head);
5409 /* Prepend the default_case if it is there. */
5410 if (head != NULL && default_case)
5412 default_case->left = NULL;
5413 default_case->right = head;
5414 head->left = default_case;
5418 /* Eliminate dead blocks that may be the result if we've seen
5419 unreachable case labels for a block. */
5420 for (body = code; body && body->block; body = body->block)
5422 if (body->block->ext.case_list == NULL)
5424 /* Cut the unreachable block from the code chain. */
5425 gfc_code *c = body->block;
5426 body->block = c->block;
5428 /* Kill the dead block, but not the blocks below it. */
5429 c->block = NULL;
5430 gfc_free_statements (c);
5434 /* More than two cases is legal but insane for logical selects.
5435 Issue a warning for it. */
5436 if (gfc_option.warn_surprising && type == BT_LOGICAL
5437 && ncases > 2)
5438 gfc_warning ("Logical SELECT CASE block at %L has more that two cases",
5439 &code->loc);
5443 /* Resolve a transfer statement. This is making sure that:
5444 -- a derived type being transferred has only non-pointer components
5445 -- a derived type being transferred doesn't have private components, unless
5446 it's being transferred from the module where the type was defined
5447 -- we're not trying to transfer a whole assumed size array. */
5449 static void
5450 resolve_transfer (gfc_code *code)
5452 gfc_typespec *ts;
5453 gfc_symbol *sym;
5454 gfc_ref *ref;
5455 gfc_expr *exp;
5457 exp = code->expr;
5459 if (exp->expr_type != EXPR_VARIABLE && exp->expr_type != EXPR_FUNCTION)
5460 return;
5462 sym = exp->symtree->n.sym;
5463 ts = &sym->ts;
5465 /* Go to actual component transferred. */
5466 for (ref = code->expr->ref; ref; ref = ref->next)
5467 if (ref->type == REF_COMPONENT)
5468 ts = &ref->u.c.component->ts;
5470 if (ts->type == BT_DERIVED)
5472 /* Check that transferred derived type doesn't contain POINTER
5473 components. */
5474 if (ts->derived->attr.pointer_comp)
5476 gfc_error ("Data transfer element at %L cannot have "
5477 "POINTER components", &code->loc);
5478 return;
5481 if (ts->derived->attr.alloc_comp)
5483 gfc_error ("Data transfer element at %L cannot have "
5484 "ALLOCATABLE components", &code->loc);
5485 return;
5488 if (derived_inaccessible (ts->derived))
5490 gfc_error ("Data transfer element at %L cannot have "
5491 "PRIVATE components",&code->loc);
5492 return;
5496 if (sym->as != NULL && sym->as->type == AS_ASSUMED_SIZE
5497 && exp->ref->type == REF_ARRAY && exp->ref->u.ar.type == AR_FULL)
5499 gfc_error ("Data transfer element at %L cannot be a full reference to "
5500 "an assumed-size array", &code->loc);
5501 return;
5506 /*********** Toplevel code resolution subroutines ***********/
5508 /* Find the set of labels that are reachable from this block. We also
5509 record the last statement in each block so that we don't have to do
5510 a linear search to find the END DO statements of the blocks. */
5512 static void
5513 reachable_labels (gfc_code *block)
5515 gfc_code *c;
5517 if (!block)
5518 return;
5520 cs_base->reachable_labels = bitmap_obstack_alloc (&labels_obstack);
5522 /* Collect labels in this block. */
5523 for (c = block; c; c = c->next)
5525 if (c->here)
5526 bitmap_set_bit (cs_base->reachable_labels, c->here->value);
5528 if (!c->next && cs_base->prev)
5529 cs_base->prev->tail = c;
5532 /* Merge with labels from parent block. */
5533 if (cs_base->prev)
5535 gcc_assert (cs_base->prev->reachable_labels);
5536 bitmap_ior_into (cs_base->reachable_labels,
5537 cs_base->prev->reachable_labels);
5541 /* Given a branch to a label and a namespace, if the branch is conforming.
5542 The code node describes where the branch is located. */
5544 static void
5545 resolve_branch (gfc_st_label *label, gfc_code *code)
5547 code_stack *stack;
5549 if (label == NULL)
5550 return;
5552 /* Step one: is this a valid branching target? */
5554 if (label->defined == ST_LABEL_UNKNOWN)
5556 gfc_error ("Label %d referenced at %L is never defined", label->value,
5557 &label->where);
5558 return;
5561 if (label->defined != ST_LABEL_TARGET)
5563 gfc_error ("Statement at %L is not a valid branch target statement "
5564 "for the branch statement at %L", &label->where, &code->loc);
5565 return;
5568 /* Step two: make sure this branch is not a branch to itself ;-) */
5570 if (code->here == label)
5572 gfc_warning ("Branch at %L may result in an infinite loop", &code->loc);
5573 return;
5576 /* Step three: See if the label is in the same block as the
5577 branching statement. The hard work has been done by setting up
5578 the bitmap reachable_labels. */
5580 if (!bitmap_bit_p (cs_base->reachable_labels, label->value))
5582 /* The label is not in an enclosing block, so illegal. This was
5583 allowed in Fortran 66, so we allow it as extension. No
5584 further checks are necessary in this case. */
5585 gfc_notify_std (GFC_STD_LEGACY, "Label at %L is not in the same block "
5586 "as the GOTO statement at %L", &label->where,
5587 &code->loc);
5588 return;
5591 /* Step four: Make sure that the branching target is legal if
5592 the statement is an END {SELECT,IF}. */
5594 for (stack = cs_base; stack; stack = stack->prev)
5595 if (stack->current->next && stack->current->next->here == label)
5596 break;
5598 if (stack && stack->current->next->op == EXEC_NOP)
5600 gfc_notify_std (GFC_STD_F95_DEL, "Deleted feature: GOTO at %L jumps to "
5601 "END of construct at %L", &code->loc,
5602 &stack->current->next->loc);
5603 return; /* We know this is not an END DO. */
5606 /* Step five: Make sure that we're not jumping to the end of a DO
5607 loop from within the loop. */
5609 for (stack = cs_base; stack; stack = stack->prev)
5610 if ((stack->current->op == EXEC_DO
5611 || stack->current->op == EXEC_DO_WHILE)
5612 && stack->tail->here == label && stack->tail->op == EXEC_NOP)
5614 gfc_notify_std (GFC_STD_F95_DEL, "Deleted feature: GOTO at %L jumps "
5615 "to END of construct at %L", &code->loc,
5616 &stack->tail->loc);
5617 return;
5623 /* Check whether EXPR1 has the same shape as EXPR2. */
5625 static try
5626 resolve_where_shape (gfc_expr *expr1, gfc_expr *expr2)
5628 mpz_t shape[GFC_MAX_DIMENSIONS];
5629 mpz_t shape2[GFC_MAX_DIMENSIONS];
5630 try result = FAILURE;
5631 int i;
5633 /* Compare the rank. */
5634 if (expr1->rank != expr2->rank)
5635 return result;
5637 /* Compare the size of each dimension. */
5638 for (i=0; i<expr1->rank; i++)
5640 if (gfc_array_dimen_size (expr1, i, &shape[i]) == FAILURE)
5641 goto ignore;
5643 if (gfc_array_dimen_size (expr2, i, &shape2[i]) == FAILURE)
5644 goto ignore;
5646 if (mpz_cmp (shape[i], shape2[i]))
5647 goto over;
5650 /* When either of the two expression is an assumed size array, we
5651 ignore the comparison of dimension sizes. */
5652 ignore:
5653 result = SUCCESS;
5655 over:
5656 for (i--; i >= 0; i--)
5658 mpz_clear (shape[i]);
5659 mpz_clear (shape2[i]);
5661 return result;
5665 /* Check whether a WHERE assignment target or a WHERE mask expression
5666 has the same shape as the outmost WHERE mask expression. */
5668 static void
5669 resolve_where (gfc_code *code, gfc_expr *mask)
5671 gfc_code *cblock;
5672 gfc_code *cnext;
5673 gfc_expr *e = NULL;
5675 cblock = code->block;
5677 /* Store the first WHERE mask-expr of the WHERE statement or construct.
5678 In case of nested WHERE, only the outmost one is stored. */
5679 if (mask == NULL) /* outmost WHERE */
5680 e = cblock->expr;
5681 else /* inner WHERE */
5682 e = mask;
5684 while (cblock)
5686 if (cblock->expr)
5688 /* Check if the mask-expr has a consistent shape with the
5689 outmost WHERE mask-expr. */
5690 if (resolve_where_shape (cblock->expr, e) == FAILURE)
5691 gfc_error ("WHERE mask at %L has inconsistent shape",
5692 &cblock->expr->where);
5695 /* the assignment statement of a WHERE statement, or the first
5696 statement in where-body-construct of a WHERE construct */
5697 cnext = cblock->next;
5698 while (cnext)
5700 switch (cnext->op)
5702 /* WHERE assignment statement */
5703 case EXEC_ASSIGN:
5705 /* Check shape consistent for WHERE assignment target. */
5706 if (e && resolve_where_shape (cnext->expr, e) == FAILURE)
5707 gfc_error ("WHERE assignment target at %L has "
5708 "inconsistent shape", &cnext->expr->where);
5709 break;
5712 case EXEC_ASSIGN_CALL:
5713 resolve_call (cnext);
5714 if (!cnext->resolved_sym->attr.elemental)
5715 gfc_error("Non-ELEMENTAL user-defined assignment in WHERE at %L",
5716 &cnext->ext.actual->expr->where);
5717 break;
5719 /* WHERE or WHERE construct is part of a where-body-construct */
5720 case EXEC_WHERE:
5721 resolve_where (cnext, e);
5722 break;
5724 default:
5725 gfc_error ("Unsupported statement inside WHERE at %L",
5726 &cnext->loc);
5728 /* the next statement within the same where-body-construct */
5729 cnext = cnext->next;
5731 /* the next masked-elsewhere-stmt, elsewhere-stmt, or end-where-stmt */
5732 cblock = cblock->block;
5737 /* Resolve assignment in FORALL construct.
5738 NVAR is the number of FORALL index variables, and VAR_EXPR records the
5739 FORALL index variables. */
5741 static void
5742 gfc_resolve_assign_in_forall (gfc_code *code, int nvar, gfc_expr **var_expr)
5744 int n;
5746 for (n = 0; n < nvar; n++)
5748 gfc_symbol *forall_index;
5750 forall_index = var_expr[n]->symtree->n.sym;
5752 /* Check whether the assignment target is one of the FORALL index
5753 variable. */
5754 if ((code->expr->expr_type == EXPR_VARIABLE)
5755 && (code->expr->symtree->n.sym == forall_index))
5756 gfc_error ("Assignment to a FORALL index variable at %L",
5757 &code->expr->where);
5758 else
5760 /* If one of the FORALL index variables doesn't appear in the
5761 assignment target, then there will be a many-to-one
5762 assignment. */
5763 if (find_forall_index (code->expr, forall_index, 0) == FAILURE)
5764 gfc_error ("The FORALL with index '%s' cause more than one "
5765 "assignment to this object at %L",
5766 var_expr[n]->symtree->name, &code->expr->where);
5772 /* Resolve WHERE statement in FORALL construct. */
5774 static void
5775 gfc_resolve_where_code_in_forall (gfc_code *code, int nvar,
5776 gfc_expr **var_expr)
5778 gfc_code *cblock;
5779 gfc_code *cnext;
5781 cblock = code->block;
5782 while (cblock)
5784 /* the assignment statement of a WHERE statement, or the first
5785 statement in where-body-construct of a WHERE construct */
5786 cnext = cblock->next;
5787 while (cnext)
5789 switch (cnext->op)
5791 /* WHERE assignment statement */
5792 case EXEC_ASSIGN:
5793 gfc_resolve_assign_in_forall (cnext, nvar, var_expr);
5794 break;
5796 /* WHERE operator assignment statement */
5797 case EXEC_ASSIGN_CALL:
5798 resolve_call (cnext);
5799 if (!cnext->resolved_sym->attr.elemental)
5800 gfc_error("Non-ELEMENTAL user-defined assignment in WHERE at %L",
5801 &cnext->ext.actual->expr->where);
5802 break;
5804 /* WHERE or WHERE construct is part of a where-body-construct */
5805 case EXEC_WHERE:
5806 gfc_resolve_where_code_in_forall (cnext, nvar, var_expr);
5807 break;
5809 default:
5810 gfc_error ("Unsupported statement inside WHERE at %L",
5811 &cnext->loc);
5813 /* the next statement within the same where-body-construct */
5814 cnext = cnext->next;
5816 /* the next masked-elsewhere-stmt, elsewhere-stmt, or end-where-stmt */
5817 cblock = cblock->block;
5822 /* Traverse the FORALL body to check whether the following errors exist:
5823 1. For assignment, check if a many-to-one assignment happens.
5824 2. For WHERE statement, check the WHERE body to see if there is any
5825 many-to-one assignment. */
5827 static void
5828 gfc_resolve_forall_body (gfc_code *code, int nvar, gfc_expr **var_expr)
5830 gfc_code *c;
5832 c = code->block->next;
5833 while (c)
5835 switch (c->op)
5837 case EXEC_ASSIGN:
5838 case EXEC_POINTER_ASSIGN:
5839 gfc_resolve_assign_in_forall (c, nvar, var_expr);
5840 break;
5842 case EXEC_ASSIGN_CALL:
5843 resolve_call (c);
5844 break;
5846 /* Because the gfc_resolve_blocks() will handle the nested FORALL,
5847 there is no need to handle it here. */
5848 case EXEC_FORALL:
5849 break;
5850 case EXEC_WHERE:
5851 gfc_resolve_where_code_in_forall(c, nvar, var_expr);
5852 break;
5853 default:
5854 break;
5856 /* The next statement in the FORALL body. */
5857 c = c->next;
5862 /* Given a FORALL construct, first resolve the FORALL iterator, then call
5863 gfc_resolve_forall_body to resolve the FORALL body. */
5865 static void
5866 gfc_resolve_forall (gfc_code *code, gfc_namespace *ns, int forall_save)
5868 static gfc_expr **var_expr;
5869 static int total_var = 0;
5870 static int nvar = 0;
5871 gfc_forall_iterator *fa;
5872 gfc_code *next;
5873 int i;
5875 /* Start to resolve a FORALL construct */
5876 if (forall_save == 0)
5878 /* Count the total number of FORALL index in the nested FORALL
5879 construct in order to allocate the VAR_EXPR with proper size. */
5880 next = code;
5881 while ((next != NULL) && (next->op == EXEC_FORALL))
5883 for (fa = next->ext.forall_iterator; fa; fa = fa->next)
5884 total_var ++;
5885 next = next->block->next;
5888 /* Allocate VAR_EXPR with NUMBER_OF_FORALL_INDEX elements. */
5889 var_expr = (gfc_expr **) gfc_getmem (total_var * sizeof (gfc_expr *));
5892 /* The information about FORALL iterator, including FORALL index start, end
5893 and stride. The FORALL index can not appear in start, end or stride. */
5894 for (fa = code->ext.forall_iterator; fa; fa = fa->next)
5896 /* Check if any outer FORALL index name is the same as the current
5897 one. */
5898 for (i = 0; i < nvar; i++)
5900 if (fa->var->symtree->n.sym == var_expr[i]->symtree->n.sym)
5902 gfc_error ("An outer FORALL construct already has an index "
5903 "with this name %L", &fa->var->where);
5907 /* Record the current FORALL index. */
5908 var_expr[nvar] = gfc_copy_expr (fa->var);
5910 nvar++;
5913 /* Resolve the FORALL body. */
5914 gfc_resolve_forall_body (code, nvar, var_expr);
5916 /* May call gfc_resolve_forall to resolve the inner FORALL loop. */
5917 gfc_resolve_blocks (code->block, ns);
5919 /* Free VAR_EXPR after the whole FORALL construct resolved. */
5920 for (i = 0; i < total_var; i++)
5921 gfc_free_expr (var_expr[i]);
5923 /* Reset the counters. */
5924 total_var = 0;
5925 nvar = 0;
5929 /* Resolve lists of blocks found in IF, SELECT CASE, WHERE, FORALL ,GOTO and
5930 DO code nodes. */
5932 static void resolve_code (gfc_code *, gfc_namespace *);
5934 void
5935 gfc_resolve_blocks (gfc_code *b, gfc_namespace *ns)
5937 try t;
5939 for (; b; b = b->block)
5941 t = gfc_resolve_expr (b->expr);
5942 if (gfc_resolve_expr (b->expr2) == FAILURE)
5943 t = FAILURE;
5945 switch (b->op)
5947 case EXEC_IF:
5948 if (t == SUCCESS && b->expr != NULL
5949 && (b->expr->ts.type != BT_LOGICAL || b->expr->rank != 0))
5950 gfc_error ("IF clause at %L requires a scalar LOGICAL expression",
5951 &b->expr->where);
5952 break;
5954 case EXEC_WHERE:
5955 if (t == SUCCESS
5956 && b->expr != NULL
5957 && (b->expr->ts.type != BT_LOGICAL || b->expr->rank == 0))
5958 gfc_error ("WHERE/ELSEWHERE clause at %L requires a LOGICAL array",
5959 &b->expr->where);
5960 break;
5962 case EXEC_GOTO:
5963 resolve_branch (b->label, b);
5964 break;
5966 case EXEC_SELECT:
5967 case EXEC_FORALL:
5968 case EXEC_DO:
5969 case EXEC_DO_WHILE:
5970 case EXEC_READ:
5971 case EXEC_WRITE:
5972 case EXEC_IOLENGTH:
5973 case EXEC_WAIT:
5974 break;
5976 case EXEC_OMP_ATOMIC:
5977 case EXEC_OMP_CRITICAL:
5978 case EXEC_OMP_DO:
5979 case EXEC_OMP_MASTER:
5980 case EXEC_OMP_ORDERED:
5981 case EXEC_OMP_PARALLEL:
5982 case EXEC_OMP_PARALLEL_DO:
5983 case EXEC_OMP_PARALLEL_SECTIONS:
5984 case EXEC_OMP_PARALLEL_WORKSHARE:
5985 case EXEC_OMP_SECTIONS:
5986 case EXEC_OMP_SINGLE:
5987 case EXEC_OMP_TASK:
5988 case EXEC_OMP_TASKWAIT:
5989 case EXEC_OMP_WORKSHARE:
5990 break;
5992 default:
5993 gfc_internal_error ("resolve_block(): Bad block type");
5996 resolve_code (b->next, ns);
6001 /* Does everything to resolve an ordinary assignment. Returns true
6002 if this is an interface asignment. */
6003 static bool
6004 resolve_ordinary_assign (gfc_code *code, gfc_namespace *ns)
6006 bool rval = false;
6007 gfc_expr *lhs;
6008 gfc_expr *rhs;
6009 int llen = 0;
6010 int rlen = 0;
6011 int n;
6012 gfc_ref *ref;
6014 if (gfc_extend_assign (code, ns) == SUCCESS)
6016 lhs = code->ext.actual->expr;
6017 rhs = code->ext.actual->next->expr;
6018 if (gfc_pure (NULL) && !gfc_pure (code->symtree->n.sym))
6020 gfc_error ("Subroutine '%s' called instead of assignment at "
6021 "%L must be PURE", code->symtree->n.sym->name,
6022 &code->loc);
6023 return rval;
6026 /* Make a temporary rhs when there is a default initializer
6027 and rhs is the same symbol as the lhs. */
6028 if (rhs->expr_type == EXPR_VARIABLE
6029 && rhs->symtree->n.sym->ts.type == BT_DERIVED
6030 && has_default_initializer (rhs->symtree->n.sym->ts.derived)
6031 && (lhs->symtree->n.sym == rhs->symtree->n.sym))
6032 code->ext.actual->next->expr = gfc_get_parentheses (rhs);
6034 return true;
6037 lhs = code->expr;
6038 rhs = code->expr2;
6040 if (rhs->is_boz
6041 && gfc_notify_std (GFC_STD_GNU, "Extension: BOZ literal at %L outside "
6042 "a DATA statement and outside INT/REAL/DBLE/CMPLX",
6043 &code->loc) == FAILURE)
6044 return false;
6046 /* Handle the case of a BOZ literal on the RHS. */
6047 if (rhs->is_boz && lhs->ts.type != BT_INTEGER)
6049 int rc;
6050 if (gfc_option.warn_surprising)
6051 gfc_warning ("BOZ literal at %L is bitwise transferred "
6052 "non-integer symbol '%s'", &code->loc,
6053 lhs->symtree->n.sym->name);
6055 if (!gfc_convert_boz (rhs, &lhs->ts))
6056 return false;
6057 if ((rc = gfc_range_check (rhs)) != ARITH_OK)
6059 if (rc == ARITH_UNDERFLOW)
6060 gfc_error ("Arithmetic underflow of bit-wise transferred BOZ at %L"
6061 ". This check can be disabled with the option "
6062 "-fno-range-check", &rhs->where);
6063 else if (rc == ARITH_OVERFLOW)
6064 gfc_error ("Arithmetic overflow of bit-wise transferred BOZ at %L"
6065 ". This check can be disabled with the option "
6066 "-fno-range-check", &rhs->where);
6067 else if (rc == ARITH_NAN)
6068 gfc_error ("Arithmetic NaN of bit-wise transferred BOZ at %L"
6069 ". This check can be disabled with the option "
6070 "-fno-range-check", &rhs->where);
6071 return false;
6076 if (lhs->ts.type == BT_CHARACTER
6077 && gfc_option.warn_character_truncation)
6079 if (lhs->ts.cl != NULL
6080 && lhs->ts.cl->length != NULL
6081 && lhs->ts.cl->length->expr_type == EXPR_CONSTANT)
6082 llen = mpz_get_si (lhs->ts.cl->length->value.integer);
6084 if (rhs->expr_type == EXPR_CONSTANT)
6085 rlen = rhs->value.character.length;
6087 else if (rhs->ts.cl != NULL
6088 && rhs->ts.cl->length != NULL
6089 && rhs->ts.cl->length->expr_type == EXPR_CONSTANT)
6090 rlen = mpz_get_si (rhs->ts.cl->length->value.integer);
6092 if (rlen && llen && rlen > llen)
6093 gfc_warning_now ("CHARACTER expression will be truncated "
6094 "in assignment (%d/%d) at %L",
6095 llen, rlen, &code->loc);
6098 /* Ensure that a vector index expression for the lvalue is evaluated
6099 to a temporary if the lvalue symbol is referenced in it. */
6100 if (lhs->rank)
6102 for (ref = lhs->ref; ref; ref= ref->next)
6103 if (ref->type == REF_ARRAY)
6105 for (n = 0; n < ref->u.ar.dimen; n++)
6106 if (ref->u.ar.dimen_type[n] == DIMEN_VECTOR
6107 && gfc_find_sym_in_expr (lhs->symtree->n.sym,
6108 ref->u.ar.start[n]))
6109 ref->u.ar.start[n]
6110 = gfc_get_parentheses (ref->u.ar.start[n]);
6114 if (gfc_pure (NULL))
6116 if (gfc_impure_variable (lhs->symtree->n.sym))
6118 gfc_error ("Cannot assign to variable '%s' in PURE "
6119 "procedure at %L",
6120 lhs->symtree->n.sym->name,
6121 &lhs->where);
6122 return rval;
6125 if (lhs->ts.type == BT_DERIVED
6126 && lhs->expr_type == EXPR_VARIABLE
6127 && lhs->ts.derived->attr.pointer_comp
6128 && gfc_impure_variable (rhs->symtree->n.sym))
6130 gfc_error ("The impure variable at %L is assigned to "
6131 "a derived type variable with a POINTER "
6132 "component in a PURE procedure (12.6)",
6133 &rhs->where);
6134 return rval;
6138 gfc_check_assign (lhs, rhs, 1);
6139 return false;
6142 /* Given a block of code, recursively resolve everything pointed to by this
6143 code block. */
6145 static void
6146 resolve_code (gfc_code *code, gfc_namespace *ns)
6148 int omp_workshare_save;
6149 int forall_save;
6150 code_stack frame;
6151 try t;
6153 frame.prev = cs_base;
6154 frame.head = code;
6155 cs_base = &frame;
6157 reachable_labels (code);
6159 for (; code; code = code->next)
6161 frame.current = code;
6162 forall_save = forall_flag;
6164 if (code->op == EXEC_FORALL)
6166 forall_flag = 1;
6167 gfc_resolve_forall (code, ns, forall_save);
6168 forall_flag = 2;
6170 else if (code->block)
6172 omp_workshare_save = -1;
6173 switch (code->op)
6175 case EXEC_OMP_PARALLEL_WORKSHARE:
6176 omp_workshare_save = omp_workshare_flag;
6177 omp_workshare_flag = 1;
6178 gfc_resolve_omp_parallel_blocks (code, ns);
6179 break;
6180 case EXEC_OMP_PARALLEL:
6181 case EXEC_OMP_PARALLEL_DO:
6182 case EXEC_OMP_PARALLEL_SECTIONS:
6183 case EXEC_OMP_TASK:
6184 omp_workshare_save = omp_workshare_flag;
6185 omp_workshare_flag = 0;
6186 gfc_resolve_omp_parallel_blocks (code, ns);
6187 break;
6188 case EXEC_OMP_DO:
6189 gfc_resolve_omp_do_blocks (code, ns);
6190 break;
6191 case EXEC_OMP_WORKSHARE:
6192 omp_workshare_save = omp_workshare_flag;
6193 omp_workshare_flag = 1;
6194 /* FALLTHROUGH */
6195 default:
6196 gfc_resolve_blocks (code->block, ns);
6197 break;
6200 if (omp_workshare_save != -1)
6201 omp_workshare_flag = omp_workshare_save;
6204 t = gfc_resolve_expr (code->expr);
6205 forall_flag = forall_save;
6207 if (gfc_resolve_expr (code->expr2) == FAILURE)
6208 t = FAILURE;
6210 switch (code->op)
6212 case EXEC_NOP:
6213 case EXEC_CYCLE:
6214 case EXEC_PAUSE:
6215 case EXEC_STOP:
6216 case EXEC_EXIT:
6217 case EXEC_CONTINUE:
6218 case EXEC_DT_END:
6219 break;
6221 case EXEC_ENTRY:
6222 /* Keep track of which entry we are up to. */
6223 current_entry_id = code->ext.entry->id;
6224 break;
6226 case EXEC_WHERE:
6227 resolve_where (code, NULL);
6228 break;
6230 case EXEC_GOTO:
6231 if (code->expr != NULL)
6233 if (code->expr->ts.type != BT_INTEGER)
6234 gfc_error ("ASSIGNED GOTO statement at %L requires an "
6235 "INTEGER variable", &code->expr->where);
6236 else if (code->expr->symtree->n.sym->attr.assign != 1)
6237 gfc_error ("Variable '%s' has not been assigned a target "
6238 "label at %L", code->expr->symtree->n.sym->name,
6239 &code->expr->where);
6241 else
6242 resolve_branch (code->label, code);
6243 break;
6245 case EXEC_RETURN:
6246 if (code->expr != NULL
6247 && (code->expr->ts.type != BT_INTEGER || code->expr->rank))
6248 gfc_error ("Alternate RETURN statement at %L requires a SCALAR-"
6249 "INTEGER return specifier", &code->expr->where);
6250 break;
6252 case EXEC_INIT_ASSIGN:
6253 break;
6255 case EXEC_ASSIGN:
6256 if (t == FAILURE)
6257 break;
6259 if (resolve_ordinary_assign (code, ns))
6260 goto call;
6262 break;
6264 case EXEC_LABEL_ASSIGN:
6265 if (code->label->defined == ST_LABEL_UNKNOWN)
6266 gfc_error ("Label %d referenced at %L is never defined",
6267 code->label->value, &code->label->where);
6268 if (t == SUCCESS
6269 && (code->expr->expr_type != EXPR_VARIABLE
6270 || code->expr->symtree->n.sym->ts.type != BT_INTEGER
6271 || code->expr->symtree->n.sym->ts.kind
6272 != gfc_default_integer_kind
6273 || code->expr->symtree->n.sym->as != NULL))
6274 gfc_error ("ASSIGN statement at %L requires a scalar "
6275 "default INTEGER variable", &code->expr->where);
6276 break;
6278 case EXEC_POINTER_ASSIGN:
6279 if (t == FAILURE)
6280 break;
6282 gfc_check_pointer_assign (code->expr, code->expr2);
6283 break;
6285 case EXEC_ARITHMETIC_IF:
6286 if (t == SUCCESS
6287 && code->expr->ts.type != BT_INTEGER
6288 && code->expr->ts.type != BT_REAL)
6289 gfc_error ("Arithmetic IF statement at %L requires a numeric "
6290 "expression", &code->expr->where);
6292 resolve_branch (code->label, code);
6293 resolve_branch (code->label2, code);
6294 resolve_branch (code->label3, code);
6295 break;
6297 case EXEC_IF:
6298 if (t == SUCCESS && code->expr != NULL
6299 && (code->expr->ts.type != BT_LOGICAL
6300 || code->expr->rank != 0))
6301 gfc_error ("IF clause at %L requires a scalar LOGICAL expression",
6302 &code->expr->where);
6303 break;
6305 case EXEC_CALL:
6306 call:
6307 resolve_call (code);
6308 break;
6310 case EXEC_SELECT:
6311 /* Select is complicated. Also, a SELECT construct could be
6312 a transformed computed GOTO. */
6313 resolve_select (code);
6314 break;
6316 case EXEC_DO:
6317 if (code->ext.iterator != NULL)
6319 gfc_iterator *iter = code->ext.iterator;
6320 if (gfc_resolve_iterator (iter, true) != FAILURE)
6321 gfc_resolve_do_iterator (code, iter->var->symtree->n.sym);
6323 break;
6325 case EXEC_DO_WHILE:
6326 if (code->expr == NULL)
6327 gfc_internal_error ("resolve_code(): No expression on DO WHILE");
6328 if (t == SUCCESS
6329 && (code->expr->rank != 0
6330 || code->expr->ts.type != BT_LOGICAL))
6331 gfc_error ("Exit condition of DO WHILE loop at %L must be "
6332 "a scalar LOGICAL expression", &code->expr->where);
6333 break;
6335 case EXEC_ALLOCATE:
6336 if (t == SUCCESS)
6337 resolve_allocate_deallocate (code, "ALLOCATE");
6339 break;
6341 case EXEC_DEALLOCATE:
6342 if (t == SUCCESS)
6343 resolve_allocate_deallocate (code, "DEALLOCATE");
6345 break;
6347 case EXEC_OPEN:
6348 if (gfc_resolve_open (code->ext.open) == FAILURE)
6349 break;
6351 resolve_branch (code->ext.open->err, code);
6352 break;
6354 case EXEC_CLOSE:
6355 if (gfc_resolve_close (code->ext.close) == FAILURE)
6356 break;
6358 resolve_branch (code->ext.close->err, code);
6359 break;
6361 case EXEC_BACKSPACE:
6362 case EXEC_ENDFILE:
6363 case EXEC_REWIND:
6364 case EXEC_FLUSH:
6365 if (gfc_resolve_filepos (code->ext.filepos) == FAILURE)
6366 break;
6368 resolve_branch (code->ext.filepos->err, code);
6369 break;
6371 case EXEC_INQUIRE:
6372 if (gfc_resolve_inquire (code->ext.inquire) == FAILURE)
6373 break;
6375 resolve_branch (code->ext.inquire->err, code);
6376 break;
6378 case EXEC_IOLENGTH:
6379 gcc_assert (code->ext.inquire != NULL);
6380 if (gfc_resolve_inquire (code->ext.inquire) == FAILURE)
6381 break;
6383 resolve_branch (code->ext.inquire->err, code);
6384 break;
6386 case EXEC_WAIT:
6387 if (gfc_resolve_wait (code->ext.wait) == FAILURE)
6388 break;
6390 resolve_branch (code->ext.wait->err, code);
6391 resolve_branch (code->ext.wait->end, code);
6392 resolve_branch (code->ext.wait->eor, code);
6393 break;
6395 case EXEC_READ:
6396 case EXEC_WRITE:
6397 if (gfc_resolve_dt (code->ext.dt) == FAILURE)
6398 break;
6400 resolve_branch (code->ext.dt->err, code);
6401 resolve_branch (code->ext.dt->end, code);
6402 resolve_branch (code->ext.dt->eor, code);
6403 break;
6405 case EXEC_TRANSFER:
6406 resolve_transfer (code);
6407 break;
6409 case EXEC_FORALL:
6410 resolve_forall_iterators (code->ext.forall_iterator);
6412 if (code->expr != NULL && code->expr->ts.type != BT_LOGICAL)
6413 gfc_error ("FORALL mask clause at %L requires a LOGICAL "
6414 "expression", &code->expr->where);
6415 break;
6417 case EXEC_OMP_ATOMIC:
6418 case EXEC_OMP_BARRIER:
6419 case EXEC_OMP_CRITICAL:
6420 case EXEC_OMP_FLUSH:
6421 case EXEC_OMP_DO:
6422 case EXEC_OMP_MASTER:
6423 case EXEC_OMP_ORDERED:
6424 case EXEC_OMP_SECTIONS:
6425 case EXEC_OMP_SINGLE:
6426 case EXEC_OMP_TASKWAIT:
6427 case EXEC_OMP_WORKSHARE:
6428 gfc_resolve_omp_directive (code, ns);
6429 break;
6431 case EXEC_OMP_PARALLEL:
6432 case EXEC_OMP_PARALLEL_DO:
6433 case EXEC_OMP_PARALLEL_SECTIONS:
6434 case EXEC_OMP_PARALLEL_WORKSHARE:
6435 case EXEC_OMP_TASK:
6436 omp_workshare_save = omp_workshare_flag;
6437 omp_workshare_flag = 0;
6438 gfc_resolve_omp_directive (code, ns);
6439 omp_workshare_flag = omp_workshare_save;
6440 break;
6442 default:
6443 gfc_internal_error ("resolve_code(): Bad statement code");
6447 cs_base = frame.prev;
6451 /* Resolve initial values and make sure they are compatible with
6452 the variable. */
6454 static void
6455 resolve_values (gfc_symbol *sym)
6457 if (sym->value == NULL)
6458 return;
6460 if (gfc_resolve_expr (sym->value) == FAILURE)
6461 return;
6463 gfc_check_assign_symbol (sym, sym->value);
6467 /* Verify the binding labels for common blocks that are BIND(C). The label
6468 for a BIND(C) common block must be identical in all scoping units in which
6469 the common block is declared. Further, the binding label can not collide
6470 with any other global entity in the program. */
6472 static void
6473 resolve_bind_c_comms (gfc_symtree *comm_block_tree)
6475 if (comm_block_tree->n.common->is_bind_c == 1)
6477 gfc_gsymbol *binding_label_gsym;
6478 gfc_gsymbol *comm_name_gsym;
6480 /* See if a global symbol exists by the common block's name. It may
6481 be NULL if the common block is use-associated. */
6482 comm_name_gsym = gfc_find_gsymbol (gfc_gsym_root,
6483 comm_block_tree->n.common->name);
6484 if (comm_name_gsym != NULL && comm_name_gsym->type != GSYM_COMMON)
6485 gfc_error ("Binding label '%s' for common block '%s' at %L collides "
6486 "with the global entity '%s' at %L",
6487 comm_block_tree->n.common->binding_label,
6488 comm_block_tree->n.common->name,
6489 &(comm_block_tree->n.common->where),
6490 comm_name_gsym->name, &(comm_name_gsym->where));
6491 else if (comm_name_gsym != NULL
6492 && strcmp (comm_name_gsym->name,
6493 comm_block_tree->n.common->name) == 0)
6495 /* TODO: Need to make sure the fields of gfc_gsymbol are initialized
6496 as expected. */
6497 if (comm_name_gsym->binding_label == NULL)
6498 /* No binding label for common block stored yet; save this one. */
6499 comm_name_gsym->binding_label =
6500 comm_block_tree->n.common->binding_label;
6501 else
6502 if (strcmp (comm_name_gsym->binding_label,
6503 comm_block_tree->n.common->binding_label) != 0)
6505 /* Common block names match but binding labels do not. */
6506 gfc_error ("Binding label '%s' for common block '%s' at %L "
6507 "does not match the binding label '%s' for common "
6508 "block '%s' at %L",
6509 comm_block_tree->n.common->binding_label,
6510 comm_block_tree->n.common->name,
6511 &(comm_block_tree->n.common->where),
6512 comm_name_gsym->binding_label,
6513 comm_name_gsym->name,
6514 &(comm_name_gsym->where));
6515 return;
6519 /* There is no binding label (NAME="") so we have nothing further to
6520 check and nothing to add as a global symbol for the label. */
6521 if (comm_block_tree->n.common->binding_label[0] == '\0' )
6522 return;
6524 binding_label_gsym =
6525 gfc_find_gsymbol (gfc_gsym_root,
6526 comm_block_tree->n.common->binding_label);
6527 if (binding_label_gsym == NULL)
6529 /* Need to make a global symbol for the binding label to prevent
6530 it from colliding with another. */
6531 binding_label_gsym =
6532 gfc_get_gsymbol (comm_block_tree->n.common->binding_label);
6533 binding_label_gsym->sym_name = comm_block_tree->n.common->name;
6534 binding_label_gsym->type = GSYM_COMMON;
6536 else
6538 /* If comm_name_gsym is NULL, the name common block is use
6539 associated and the name could be colliding. */
6540 if (binding_label_gsym->type != GSYM_COMMON)
6541 gfc_error ("Binding label '%s' for common block '%s' at %L "
6542 "collides with the global entity '%s' at %L",
6543 comm_block_tree->n.common->binding_label,
6544 comm_block_tree->n.common->name,
6545 &(comm_block_tree->n.common->where),
6546 binding_label_gsym->name,
6547 &(binding_label_gsym->where));
6548 else if (comm_name_gsym != NULL
6549 && (strcmp (binding_label_gsym->name,
6550 comm_name_gsym->binding_label) != 0)
6551 && (strcmp (binding_label_gsym->sym_name,
6552 comm_name_gsym->name) != 0))
6553 gfc_error ("Binding label '%s' for common block '%s' at %L "
6554 "collides with global entity '%s' at %L",
6555 binding_label_gsym->name, binding_label_gsym->sym_name,
6556 &(comm_block_tree->n.common->where),
6557 comm_name_gsym->name, &(comm_name_gsym->where));
6561 return;
6565 /* Verify any BIND(C) derived types in the namespace so we can report errors
6566 for them once, rather than for each variable declared of that type. */
6568 static void
6569 resolve_bind_c_derived_types (gfc_symbol *derived_sym)
6571 if (derived_sym != NULL && derived_sym->attr.flavor == FL_DERIVED
6572 && derived_sym->attr.is_bind_c == 1)
6573 verify_bind_c_derived_type (derived_sym);
6575 return;
6579 /* Verify that any binding labels used in a given namespace do not collide
6580 with the names or binding labels of any global symbols. */
6582 static void
6583 gfc_verify_binding_labels (gfc_symbol *sym)
6585 int has_error = 0;
6587 if (sym != NULL && sym->attr.is_bind_c && sym->attr.is_iso_c == 0
6588 && sym->attr.flavor != FL_DERIVED && sym->binding_label[0] != '\0')
6590 gfc_gsymbol *bind_c_sym;
6592 bind_c_sym = gfc_find_gsymbol (gfc_gsym_root, sym->binding_label);
6593 if (bind_c_sym != NULL
6594 && strcmp (bind_c_sym->name, sym->binding_label) == 0)
6596 if (sym->attr.if_source == IFSRC_DECL
6597 && (bind_c_sym->type != GSYM_SUBROUTINE
6598 && bind_c_sym->type != GSYM_FUNCTION)
6599 && ((sym->attr.contained == 1
6600 && strcmp (bind_c_sym->sym_name, sym->name) != 0)
6601 || (sym->attr.use_assoc == 1
6602 && (strcmp (bind_c_sym->mod_name, sym->module) != 0))))
6604 /* Make sure global procedures don't collide with anything. */
6605 gfc_error ("Binding label '%s' at %L collides with the global "
6606 "entity '%s' at %L", sym->binding_label,
6607 &(sym->declared_at), bind_c_sym->name,
6608 &(bind_c_sym->where));
6609 has_error = 1;
6611 else if (sym->attr.contained == 0
6612 && (sym->attr.if_source == IFSRC_IFBODY
6613 && sym->attr.flavor == FL_PROCEDURE)
6614 && (bind_c_sym->sym_name != NULL
6615 && strcmp (bind_c_sym->sym_name, sym->name) != 0))
6617 /* Make sure procedures in interface bodies don't collide. */
6618 gfc_error ("Binding label '%s' in interface body at %L collides "
6619 "with the global entity '%s' at %L",
6620 sym->binding_label,
6621 &(sym->declared_at), bind_c_sym->name,
6622 &(bind_c_sym->where));
6623 has_error = 1;
6625 else if (sym->attr.contained == 0
6626 && sym->attr.if_source == IFSRC_UNKNOWN)
6627 if ((sym->attr.use_assoc && bind_c_sym->mod_name
6628 && strcmp (bind_c_sym->mod_name, sym->module) != 0)
6629 || sym->attr.use_assoc == 0)
6631 gfc_error ("Binding label '%s' at %L collides with global "
6632 "entity '%s' at %L", sym->binding_label,
6633 &(sym->declared_at), bind_c_sym->name,
6634 &(bind_c_sym->where));
6635 has_error = 1;
6638 if (has_error != 0)
6639 /* Clear the binding label to prevent checking multiple times. */
6640 sym->binding_label[0] = '\0';
6642 else if (bind_c_sym == NULL)
6644 bind_c_sym = gfc_get_gsymbol (sym->binding_label);
6645 bind_c_sym->where = sym->declared_at;
6646 bind_c_sym->sym_name = sym->name;
6648 if (sym->attr.use_assoc == 1)
6649 bind_c_sym->mod_name = sym->module;
6650 else
6651 if (sym->ns->proc_name != NULL)
6652 bind_c_sym->mod_name = sym->ns->proc_name->name;
6654 if (sym->attr.contained == 0)
6656 if (sym->attr.subroutine)
6657 bind_c_sym->type = GSYM_SUBROUTINE;
6658 else if (sym->attr.function)
6659 bind_c_sym->type = GSYM_FUNCTION;
6663 return;
6667 /* Resolve an index expression. */
6669 static try
6670 resolve_index_expr (gfc_expr *e)
6672 if (gfc_resolve_expr (e) == FAILURE)
6673 return FAILURE;
6675 if (gfc_simplify_expr (e, 0) == FAILURE)
6676 return FAILURE;
6678 if (gfc_specification_expr (e) == FAILURE)
6679 return FAILURE;
6681 return SUCCESS;
6684 /* Resolve a charlen structure. */
6686 static try
6687 resolve_charlen (gfc_charlen *cl)
6689 int i;
6691 if (cl->resolved)
6692 return SUCCESS;
6694 cl->resolved = 1;
6696 specification_expr = 1;
6698 if (resolve_index_expr (cl->length) == FAILURE)
6700 specification_expr = 0;
6701 return FAILURE;
6704 /* "If the character length parameter value evaluates to a negative
6705 value, the length of character entities declared is zero." */
6706 if (cl->length && !gfc_extract_int (cl->length, &i) && i < 0)
6708 gfc_warning_now ("CHARACTER variable has zero length at %L",
6709 &cl->length->where);
6710 gfc_replace_expr (cl->length, gfc_int_expr (0));
6713 return SUCCESS;
6717 /* Test for non-constant shape arrays. */
6719 static bool
6720 is_non_constant_shape_array (gfc_symbol *sym)
6722 gfc_expr *e;
6723 int i;
6724 bool not_constant;
6726 not_constant = false;
6727 if (sym->as != NULL)
6729 /* Unfortunately, !gfc_is_compile_time_shape hits a legal case that
6730 has not been simplified; parameter array references. Do the
6731 simplification now. */
6732 for (i = 0; i < sym->as->rank; i++)
6734 e = sym->as->lower[i];
6735 if (e && (resolve_index_expr (e) == FAILURE
6736 || !gfc_is_constant_expr (e)))
6737 not_constant = true;
6739 e = sym->as->upper[i];
6740 if (e && (resolve_index_expr (e) == FAILURE
6741 || !gfc_is_constant_expr (e)))
6742 not_constant = true;
6745 return not_constant;
6748 /* Given a symbol and an initialization expression, add code to initialize
6749 the symbol to the function entry. */
6750 static void
6751 build_init_assign (gfc_symbol *sym, gfc_expr *init)
6753 gfc_expr *lval;
6754 gfc_code *init_st;
6755 gfc_namespace *ns = sym->ns;
6757 /* Search for the function namespace if this is a contained
6758 function without an explicit result. */
6759 if (sym->attr.function && sym == sym->result
6760 && sym->name != sym->ns->proc_name->name)
6762 ns = ns->contained;
6763 for (;ns; ns = ns->sibling)
6764 if (strcmp (ns->proc_name->name, sym->name) == 0)
6765 break;
6768 if (ns == NULL)
6770 gfc_free_expr (init);
6771 return;
6774 /* Build an l-value expression for the result. */
6775 lval = gfc_lval_expr_from_sym (sym);
6777 /* Add the code at scope entry. */
6778 init_st = gfc_get_code ();
6779 init_st->next = ns->code;
6780 ns->code = init_st;
6782 /* Assign the default initializer to the l-value. */
6783 init_st->loc = sym->declared_at;
6784 init_st->op = EXEC_INIT_ASSIGN;
6785 init_st->expr = lval;
6786 init_st->expr2 = init;
6789 /* Assign the default initializer to a derived type variable or result. */
6791 static void
6792 apply_default_init (gfc_symbol *sym)
6794 gfc_expr *init = NULL;
6796 if (sym->attr.flavor != FL_VARIABLE && !sym->attr.function)
6797 return;
6799 if (sym->ts.type == BT_DERIVED && sym->ts.derived)
6800 init = gfc_default_initializer (&sym->ts);
6802 if (init == NULL)
6803 return;
6805 build_init_assign (sym, init);
6808 /* Build an initializer for a local integer, real, complex, logical, or
6809 character variable, based on the command line flags finit-local-zero,
6810 finit-integer=, finit-real=, finit-logical=, and finit-runtime. Returns
6811 null if the symbol should not have a default initialization. */
6812 static gfc_expr *
6813 build_default_init_expr (gfc_symbol *sym)
6815 int char_len;
6816 gfc_expr *init_expr;
6817 int i;
6819 /* These symbols should never have a default initialization. */
6820 if ((sym->attr.dimension && !gfc_is_compile_time_shape (sym->as))
6821 || sym->attr.external
6822 || sym->attr.dummy
6823 || sym->attr.pointer
6824 || sym->attr.in_equivalence
6825 || sym->attr.in_common
6826 || sym->attr.data
6827 || sym->module
6828 || sym->attr.cray_pointee
6829 || sym->attr.cray_pointer)
6830 return NULL;
6832 /* Now we'll try to build an initializer expression. */
6833 init_expr = gfc_get_expr ();
6834 init_expr->expr_type = EXPR_CONSTANT;
6835 init_expr->ts.type = sym->ts.type;
6836 init_expr->ts.kind = sym->ts.kind;
6837 init_expr->where = sym->declared_at;
6839 /* We will only initialize integers, reals, complex, logicals, and
6840 characters, and only if the corresponding command-line flags
6841 were set. Otherwise, we free init_expr and return null. */
6842 switch (sym->ts.type)
6844 case BT_INTEGER:
6845 if (gfc_option.flag_init_integer != GFC_INIT_INTEGER_OFF)
6846 mpz_init_set_si (init_expr->value.integer,
6847 gfc_option.flag_init_integer_value);
6848 else
6850 gfc_free_expr (init_expr);
6851 init_expr = NULL;
6853 break;
6855 case BT_REAL:
6856 mpfr_init (init_expr->value.real);
6857 switch (gfc_option.flag_init_real)
6859 case GFC_INIT_REAL_NAN:
6860 mpfr_set_nan (init_expr->value.real);
6861 break;
6863 case GFC_INIT_REAL_INF:
6864 mpfr_set_inf (init_expr->value.real, 1);
6865 break;
6867 case GFC_INIT_REAL_NEG_INF:
6868 mpfr_set_inf (init_expr->value.real, -1);
6869 break;
6871 case GFC_INIT_REAL_ZERO:
6872 mpfr_set_ui (init_expr->value.real, 0.0, GFC_RND_MODE);
6873 break;
6875 default:
6876 gfc_free_expr (init_expr);
6877 init_expr = NULL;
6878 break;
6880 break;
6882 case BT_COMPLEX:
6883 mpfr_init (init_expr->value.complex.r);
6884 mpfr_init (init_expr->value.complex.i);
6885 switch (gfc_option.flag_init_real)
6887 case GFC_INIT_REAL_NAN:
6888 mpfr_set_nan (init_expr->value.complex.r);
6889 mpfr_set_nan (init_expr->value.complex.i);
6890 break;
6892 case GFC_INIT_REAL_INF:
6893 mpfr_set_inf (init_expr->value.complex.r, 1);
6894 mpfr_set_inf (init_expr->value.complex.i, 1);
6895 break;
6897 case GFC_INIT_REAL_NEG_INF:
6898 mpfr_set_inf (init_expr->value.complex.r, -1);
6899 mpfr_set_inf (init_expr->value.complex.i, -1);
6900 break;
6902 case GFC_INIT_REAL_ZERO:
6903 mpfr_set_ui (init_expr->value.complex.r, 0.0, GFC_RND_MODE);
6904 mpfr_set_ui (init_expr->value.complex.i, 0.0, GFC_RND_MODE);
6905 break;
6907 default:
6908 gfc_free_expr (init_expr);
6909 init_expr = NULL;
6910 break;
6912 break;
6914 case BT_LOGICAL:
6915 if (gfc_option.flag_init_logical == GFC_INIT_LOGICAL_FALSE)
6916 init_expr->value.logical = 0;
6917 else if (gfc_option.flag_init_logical == GFC_INIT_LOGICAL_TRUE)
6918 init_expr->value.logical = 1;
6919 else
6921 gfc_free_expr (init_expr);
6922 init_expr = NULL;
6924 break;
6926 case BT_CHARACTER:
6927 /* For characters, the length must be constant in order to
6928 create a default initializer. */
6929 if (gfc_option.flag_init_character == GFC_INIT_CHARACTER_ON
6930 && sym->ts.cl->length
6931 && sym->ts.cl->length->expr_type == EXPR_CONSTANT)
6933 char_len = mpz_get_si (sym->ts.cl->length->value.integer);
6934 init_expr->value.character.length = char_len;
6935 init_expr->value.character.string = gfc_get_wide_string (char_len+1);
6936 for (i = 0; i < char_len; i++)
6937 init_expr->value.character.string[i]
6938 = (unsigned char) gfc_option.flag_init_character_value;
6940 else
6942 gfc_free_expr (init_expr);
6943 init_expr = NULL;
6945 break;
6947 default:
6948 gfc_free_expr (init_expr);
6949 init_expr = NULL;
6951 return init_expr;
6954 /* Add an initialization expression to a local variable. */
6955 static void
6956 apply_default_init_local (gfc_symbol *sym)
6958 gfc_expr *init = NULL;
6960 /* The symbol should be a variable or a function return value. */
6961 if ((sym->attr.flavor != FL_VARIABLE && !sym->attr.function)
6962 || (sym->attr.function && sym->result != sym))
6963 return;
6965 /* Try to build the initializer expression. If we can't initialize
6966 this symbol, then init will be NULL. */
6967 init = build_default_init_expr (sym);
6968 if (init == NULL)
6969 return;
6971 /* For saved variables, we don't want to add an initializer at
6972 function entry, so we just add a static initializer. */
6973 if (sym->attr.save || sym->ns->save_all)
6975 /* Don't clobber an existing initializer! */
6976 gcc_assert (sym->value == NULL);
6977 sym->value = init;
6978 return;
6981 build_init_assign (sym, init);
6984 /* Resolution of common features of flavors variable and procedure. */
6986 static try
6987 resolve_fl_var_and_proc (gfc_symbol *sym, int mp_flag)
6989 /* Constraints on deferred shape variable. */
6990 if (sym->as == NULL || sym->as->type != AS_DEFERRED)
6992 if (sym->attr.allocatable)
6994 if (sym->attr.dimension)
6995 gfc_error ("Allocatable array '%s' at %L must have "
6996 "a deferred shape", sym->name, &sym->declared_at);
6997 else
6998 gfc_error ("Scalar object '%s' at %L may not be ALLOCATABLE",
6999 sym->name, &sym->declared_at);
7000 return FAILURE;
7003 if (sym->attr.pointer && sym->attr.dimension)
7005 gfc_error ("Array pointer '%s' at %L must have a deferred shape",
7006 sym->name, &sym->declared_at);
7007 return FAILURE;
7011 else
7013 if (!mp_flag && !sym->attr.allocatable
7014 && !sym->attr.pointer && !sym->attr.dummy)
7016 gfc_error ("Array '%s' at %L cannot have a deferred shape",
7017 sym->name, &sym->declared_at);
7018 return FAILURE;
7021 return SUCCESS;
7025 /* Additional checks for symbols with flavor variable and derived
7026 type. To be called from resolve_fl_variable. */
7028 static try
7029 resolve_fl_variable_derived (gfc_symbol *sym, int no_init_flag)
7031 gcc_assert (sym->ts.type == BT_DERIVED);
7033 /* Check to see if a derived type is blocked from being host
7034 associated by the presence of another class I symbol in the same
7035 namespace. 14.6.1.3 of the standard and the discussion on
7036 comp.lang.fortran. */
7037 if (sym->ns != sym->ts.derived->ns
7038 && sym->ns->proc_name->attr.if_source != IFSRC_IFBODY)
7040 gfc_symbol *s;
7041 gfc_find_symbol (sym->ts.derived->name, sym->ns, 0, &s);
7042 if (s && (s->attr.flavor != FL_DERIVED
7043 || !gfc_compare_derived_types (s, sym->ts.derived)))
7045 gfc_error ("The type '%s' cannot be host associated at %L "
7046 "because it is blocked by an incompatible object "
7047 "of the same name declared at %L",
7048 sym->ts.derived->name, &sym->declared_at,
7049 &s->declared_at);
7050 return FAILURE;
7054 /* 4th constraint in section 11.3: "If an object of a type for which
7055 component-initialization is specified (R429) appears in the
7056 specification-part of a module and does not have the ALLOCATABLE
7057 or POINTER attribute, the object shall have the SAVE attribute."
7059 The check for initializers is performed with
7060 has_default_initializer because gfc_default_initializer generates
7061 a hidden default for allocatable components. */
7062 if (!(sym->value || no_init_flag) && sym->ns->proc_name
7063 && sym->ns->proc_name->attr.flavor == FL_MODULE
7064 && !sym->ns->save_all && !sym->attr.save
7065 && !sym->attr.pointer && !sym->attr.allocatable
7066 && has_default_initializer (sym->ts.derived))
7068 gfc_error("Object '%s' at %L must have the SAVE attribute for "
7069 "default initialization of a component",
7070 sym->name, &sym->declared_at);
7071 return FAILURE;
7074 /* Assign default initializer. */
7075 if (!(sym->value || sym->attr.pointer || sym->attr.allocatable)
7076 && (!no_init_flag || sym->attr.intent == INTENT_OUT))
7078 sym->value = gfc_default_initializer (&sym->ts);
7081 return SUCCESS;
7085 /* Resolve symbols with flavor variable. */
7087 static try
7088 resolve_fl_variable (gfc_symbol *sym, int mp_flag)
7090 int no_init_flag, automatic_flag;
7091 gfc_expr *e;
7092 const char *auto_save_msg;
7094 auto_save_msg = "Automatic object '%s' at %L cannot have the "
7095 "SAVE attribute";
7097 if (resolve_fl_var_and_proc (sym, mp_flag) == FAILURE)
7098 return FAILURE;
7100 /* Set this flag to check that variables are parameters of all entries.
7101 This check is effected by the call to gfc_resolve_expr through
7102 is_non_constant_shape_array. */
7103 specification_expr = 1;
7105 if (sym->ns->proc_name
7106 && (sym->ns->proc_name->attr.flavor == FL_MODULE
7107 || sym->ns->proc_name->attr.is_main_program)
7108 && !sym->attr.use_assoc
7109 && !sym->attr.allocatable
7110 && !sym->attr.pointer
7111 && is_non_constant_shape_array (sym))
7113 /* The shape of a main program or module array needs to be
7114 constant. */
7115 gfc_error ("The module or main program array '%s' at %L must "
7116 "have constant shape", sym->name, &sym->declared_at);
7117 specification_expr = 0;
7118 return FAILURE;
7121 if (sym->ts.type == BT_CHARACTER)
7123 /* Make sure that character string variables with assumed length are
7124 dummy arguments. */
7125 e = sym->ts.cl->length;
7126 if (e == NULL && !sym->attr.dummy && !sym->attr.result)
7128 gfc_error ("Entity with assumed character length at %L must be a "
7129 "dummy argument or a PARAMETER", &sym->declared_at);
7130 return FAILURE;
7133 if (e && sym->attr.save && !gfc_is_constant_expr (e))
7135 gfc_error (auto_save_msg, sym->name, &sym->declared_at);
7136 return FAILURE;
7139 if (!gfc_is_constant_expr (e)
7140 && !(e->expr_type == EXPR_VARIABLE
7141 && e->symtree->n.sym->attr.flavor == FL_PARAMETER)
7142 && sym->ns->proc_name
7143 && (sym->ns->proc_name->attr.flavor == FL_MODULE
7144 || sym->ns->proc_name->attr.is_main_program)
7145 && !sym->attr.use_assoc)
7147 gfc_error ("'%s' at %L must have constant character length "
7148 "in this context", sym->name, &sym->declared_at);
7149 return FAILURE;
7153 if (sym->value == NULL && sym->attr.referenced)
7154 apply_default_init_local (sym); /* Try to apply a default initialization. */
7156 /* Determine if the symbol may not have an initializer. */
7157 no_init_flag = automatic_flag = 0;
7158 if (sym->attr.allocatable || sym->attr.external || sym->attr.dummy
7159 || sym->attr.intrinsic || sym->attr.result)
7160 no_init_flag = 1;
7161 else if (sym->attr.dimension && !sym->attr.pointer
7162 && is_non_constant_shape_array (sym))
7164 no_init_flag = automatic_flag = 1;
7166 /* Also, they must not have the SAVE attribute.
7167 SAVE_IMPLICIT is checked below. */
7168 if (sym->attr.save == SAVE_EXPLICIT)
7170 gfc_error (auto_save_msg, sym->name, &sym->declared_at);
7171 return FAILURE;
7175 /* Reject illegal initializers. */
7176 if (!sym->mark && sym->value)
7178 if (sym->attr.allocatable)
7179 gfc_error ("Allocatable '%s' at %L cannot have an initializer",
7180 sym->name, &sym->declared_at);
7181 else if (sym->attr.external)
7182 gfc_error ("External '%s' at %L cannot have an initializer",
7183 sym->name, &sym->declared_at);
7184 else if (sym->attr.dummy
7185 && !(sym->ts.type == BT_DERIVED && sym->attr.intent == INTENT_OUT))
7186 gfc_error ("Dummy '%s' at %L cannot have an initializer",
7187 sym->name, &sym->declared_at);
7188 else if (sym->attr.intrinsic)
7189 gfc_error ("Intrinsic '%s' at %L cannot have an initializer",
7190 sym->name, &sym->declared_at);
7191 else if (sym->attr.result)
7192 gfc_error ("Function result '%s' at %L cannot have an initializer",
7193 sym->name, &sym->declared_at);
7194 else if (automatic_flag)
7195 gfc_error ("Automatic array '%s' at %L cannot have an initializer",
7196 sym->name, &sym->declared_at);
7197 else
7198 goto no_init_error;
7199 return FAILURE;
7202 no_init_error:
7203 if (sym->ts.type == BT_DERIVED)
7204 return resolve_fl_variable_derived (sym, no_init_flag);
7206 return SUCCESS;
7210 /* Resolve a procedure. */
7212 static try
7213 resolve_fl_procedure (gfc_symbol *sym, int mp_flag)
7215 gfc_formal_arglist *arg;
7217 if (sym->attr.ambiguous_interfaces && !sym->attr.referenced)
7218 gfc_warning ("Although not referenced, '%s' at %L has ambiguous "
7219 "interfaces", sym->name, &sym->declared_at);
7221 if (sym->attr.function
7222 && resolve_fl_var_and_proc (sym, mp_flag) == FAILURE)
7223 return FAILURE;
7225 if (sym->ts.type == BT_CHARACTER)
7227 gfc_charlen *cl = sym->ts.cl;
7229 if (cl && cl->length && gfc_is_constant_expr (cl->length)
7230 && resolve_charlen (cl) == FAILURE)
7231 return FAILURE;
7233 if (!cl || !cl->length || cl->length->expr_type != EXPR_CONSTANT)
7235 if (sym->attr.proc == PROC_ST_FUNCTION)
7237 gfc_error ("Character-valued statement function '%s' at %L must "
7238 "have constant length", sym->name, &sym->declared_at);
7239 return FAILURE;
7242 if (sym->attr.external && sym->formal == NULL
7243 && cl && cl->length && cl->length->expr_type != EXPR_CONSTANT)
7245 gfc_error ("Automatic character length function '%s' at %L must "
7246 "have an explicit interface", sym->name,
7247 &sym->declared_at);
7248 return FAILURE;
7253 /* Ensure that derived type for are not of a private type. Internal
7254 module procedures are excluded by 2.2.3.3 - ie. they are not
7255 externally accessible and can access all the objects accessible in
7256 the host. */
7257 if (!(sym->ns->parent
7258 && sym->ns->parent->proc_name->attr.flavor == FL_MODULE)
7259 && gfc_check_access(sym->attr.access, sym->ns->default_access))
7261 gfc_interface *iface;
7263 for (arg = sym->formal; arg; arg = arg->next)
7265 if (arg->sym
7266 && arg->sym->ts.type == BT_DERIVED
7267 && !arg->sym->ts.derived->attr.use_assoc
7268 && !gfc_check_access (arg->sym->ts.derived->attr.access,
7269 arg->sym->ts.derived->ns->default_access)
7270 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: '%s' is of a "
7271 "PRIVATE type and cannot be a dummy argument"
7272 " of '%s', which is PUBLIC at %L",
7273 arg->sym->name, sym->name, &sym->declared_at)
7274 == FAILURE)
7276 /* Stop this message from recurring. */
7277 arg->sym->ts.derived->attr.access = ACCESS_PUBLIC;
7278 return FAILURE;
7282 /* PUBLIC interfaces may expose PRIVATE procedures that take types
7283 PRIVATE to the containing module. */
7284 for (iface = sym->generic; iface; iface = iface->next)
7286 for (arg = iface->sym->formal; arg; arg = arg->next)
7288 if (arg->sym
7289 && arg->sym->ts.type == BT_DERIVED
7290 && !arg->sym->ts.derived->attr.use_assoc
7291 && !gfc_check_access (arg->sym->ts.derived->attr.access,
7292 arg->sym->ts.derived->ns->default_access)
7293 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: Procedure "
7294 "'%s' in PUBLIC interface '%s' at %L "
7295 "takes dummy arguments of '%s' which is "
7296 "PRIVATE", iface->sym->name, sym->name,
7297 &iface->sym->declared_at,
7298 gfc_typename (&arg->sym->ts)) == FAILURE)
7300 /* Stop this message from recurring. */
7301 arg->sym->ts.derived->attr.access = ACCESS_PUBLIC;
7302 return FAILURE;
7307 /* PUBLIC interfaces may expose PRIVATE procedures that take types
7308 PRIVATE to the containing module. */
7309 for (iface = sym->generic; iface; iface = iface->next)
7311 for (arg = iface->sym->formal; arg; arg = arg->next)
7313 if (arg->sym
7314 && arg->sym->ts.type == BT_DERIVED
7315 && !arg->sym->ts.derived->attr.use_assoc
7316 && !gfc_check_access (arg->sym->ts.derived->attr.access,
7317 arg->sym->ts.derived->ns->default_access)
7318 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: Procedure "
7319 "'%s' in PUBLIC interface '%s' at %L "
7320 "takes dummy arguments of '%s' which is "
7321 "PRIVATE", iface->sym->name, sym->name,
7322 &iface->sym->declared_at,
7323 gfc_typename (&arg->sym->ts)) == FAILURE)
7325 /* Stop this message from recurring. */
7326 arg->sym->ts.derived->attr.access = ACCESS_PUBLIC;
7327 return FAILURE;
7333 if (sym->attr.function && sym->value && sym->attr.proc != PROC_ST_FUNCTION)
7335 gfc_error ("Function '%s' at %L cannot have an initializer",
7336 sym->name, &sym->declared_at);
7337 return FAILURE;
7340 /* An external symbol may not have an initializer because it is taken to be
7341 a procedure. */
7342 if (sym->attr.external && sym->value)
7344 gfc_error ("External object '%s' at %L may not have an initializer",
7345 sym->name, &sym->declared_at);
7346 return FAILURE;
7349 /* An elemental function is required to return a scalar 12.7.1 */
7350 if (sym->attr.elemental && sym->attr.function && sym->as)
7352 gfc_error ("ELEMENTAL function '%s' at %L must have a scalar "
7353 "result", sym->name, &sym->declared_at);
7354 /* Reset so that the error only occurs once. */
7355 sym->attr.elemental = 0;
7356 return FAILURE;
7359 /* 5.1.1.5 of the Standard: A function name declared with an asterisk
7360 char-len-param shall not be array-valued, pointer-valued, recursive
7361 or pure. ....snip... A character value of * may only be used in the
7362 following ways: (i) Dummy arg of procedure - dummy associates with
7363 actual length; (ii) To declare a named constant; or (iii) External
7364 function - but length must be declared in calling scoping unit. */
7365 if (sym->attr.function
7366 && sym->ts.type == BT_CHARACTER
7367 && sym->ts.cl && sym->ts.cl->length == NULL)
7369 if ((sym->as && sym->as->rank) || (sym->attr.pointer)
7370 || (sym->attr.recursive) || (sym->attr.pure))
7372 if (sym->as && sym->as->rank)
7373 gfc_error ("CHARACTER(*) function '%s' at %L cannot be "
7374 "array-valued", sym->name, &sym->declared_at);
7376 if (sym->attr.pointer)
7377 gfc_error ("CHARACTER(*) function '%s' at %L cannot be "
7378 "pointer-valued", sym->name, &sym->declared_at);
7380 if (sym->attr.pure)
7381 gfc_error ("CHARACTER(*) function '%s' at %L cannot be "
7382 "pure", sym->name, &sym->declared_at);
7384 if (sym->attr.recursive)
7385 gfc_error ("CHARACTER(*) function '%s' at %L cannot be "
7386 "recursive", sym->name, &sym->declared_at);
7388 return FAILURE;
7391 /* Appendix B.2 of the standard. Contained functions give an
7392 error anyway. Fixed-form is likely to be F77/legacy. */
7393 if (!sym->attr.contained && gfc_current_form != FORM_FIXED)
7394 gfc_notify_std (GFC_STD_F95_OBS, "CHARACTER(*) function "
7395 "'%s' at %L is obsolescent in fortran 95",
7396 sym->name, &sym->declared_at);
7399 if (sym->attr.is_bind_c && sym->attr.is_c_interop != 1)
7401 gfc_formal_arglist *curr_arg;
7402 int has_non_interop_arg = 0;
7404 if (verify_bind_c_sym (sym, &(sym->ts), sym->attr.in_common,
7405 sym->common_block) == FAILURE)
7407 /* Clear these to prevent looking at them again if there was an
7408 error. */
7409 sym->attr.is_bind_c = 0;
7410 sym->attr.is_c_interop = 0;
7411 sym->ts.is_c_interop = 0;
7413 else
7415 /* So far, no errors have been found. */
7416 sym->attr.is_c_interop = 1;
7417 sym->ts.is_c_interop = 1;
7420 curr_arg = sym->formal;
7421 while (curr_arg != NULL)
7423 /* Skip implicitly typed dummy args here. */
7424 if (curr_arg->sym->attr.implicit_type == 0)
7425 if (verify_c_interop_param (curr_arg->sym) == FAILURE)
7426 /* If something is found to fail, record the fact so we
7427 can mark the symbol for the procedure as not being
7428 BIND(C) to try and prevent multiple errors being
7429 reported. */
7430 has_non_interop_arg = 1;
7432 curr_arg = curr_arg->next;
7435 /* See if any of the arguments were not interoperable and if so, clear
7436 the procedure symbol to prevent duplicate error messages. */
7437 if (has_non_interop_arg != 0)
7439 sym->attr.is_c_interop = 0;
7440 sym->ts.is_c_interop = 0;
7441 sym->attr.is_bind_c = 0;
7445 return SUCCESS;
7449 /* Resolve a list of finalizer procedures. That is, after they have hopefully
7450 been defined and we now know their defined arguments, check that they fulfill
7451 the requirements of the standard for procedures used as finalizers. */
7453 static try
7454 gfc_resolve_finalizers (gfc_symbol* derived)
7456 gfc_finalizer* list;
7457 gfc_finalizer** prev_link; /* For removing wrong entries from the list. */
7458 try result = SUCCESS;
7459 bool seen_scalar = false;
7461 if (!derived->f2k_derived || !derived->f2k_derived->finalizers)
7462 return SUCCESS;
7464 /* Walk over the list of finalizer-procedures, check them, and if any one
7465 does not fit in with the standard's definition, print an error and remove
7466 it from the list. */
7467 prev_link = &derived->f2k_derived->finalizers;
7468 for (list = derived->f2k_derived->finalizers; list; list = *prev_link)
7470 gfc_symbol* arg;
7471 gfc_finalizer* i;
7472 int my_rank;
7474 /* Check this exists and is a SUBROUTINE. */
7475 if (!list->procedure->attr.subroutine)
7477 gfc_error ("FINAL procedure '%s' at %L is not a SUBROUTINE",
7478 list->procedure->name, &list->where);
7479 goto error;
7482 /* We should have exactly one argument. */
7483 if (!list->procedure->formal || list->procedure->formal->next)
7485 gfc_error ("FINAL procedure at %L must have exactly one argument",
7486 &list->where);
7487 goto error;
7489 arg = list->procedure->formal->sym;
7491 /* This argument must be of our type. */
7492 if (arg->ts.type != BT_DERIVED || arg->ts.derived != derived)
7494 gfc_error ("Argument of FINAL procedure at %L must be of type '%s'",
7495 &arg->declared_at, derived->name);
7496 goto error;
7499 /* It must neither be a pointer nor allocatable nor optional. */
7500 if (arg->attr.pointer)
7502 gfc_error ("Argument of FINAL procedure at %L must not be a POINTER",
7503 &arg->declared_at);
7504 goto error;
7506 if (arg->attr.allocatable)
7508 gfc_error ("Argument of FINAL procedure at %L must not be"
7509 " ALLOCATABLE", &arg->declared_at);
7510 goto error;
7512 if (arg->attr.optional)
7514 gfc_error ("Argument of FINAL procedure at %L must not be OPTIONAL",
7515 &arg->declared_at);
7516 goto error;
7519 /* It must not be INTENT(OUT). */
7520 if (arg->attr.intent == INTENT_OUT)
7522 gfc_error ("Argument of FINAL procedure at %L must not be"
7523 " INTENT(OUT)", &arg->declared_at);
7524 goto error;
7527 /* Warn if the procedure is non-scalar and not assumed shape. */
7528 if (gfc_option.warn_surprising && arg->as && arg->as->rank > 0
7529 && arg->as->type != AS_ASSUMED_SHAPE)
7530 gfc_warning ("Non-scalar FINAL procedure at %L should have assumed"
7531 " shape argument", &arg->declared_at);
7533 /* Check that it does not match in kind and rank with a FINAL procedure
7534 defined earlier. To really loop over the *earlier* declarations,
7535 we need to walk the tail of the list as new ones were pushed at the
7536 front. */
7537 /* TODO: Handle kind parameters once they are implemented. */
7538 my_rank = (arg->as ? arg->as->rank : 0);
7539 for (i = list->next; i; i = i->next)
7541 /* Argument list might be empty; that is an error signalled earlier,
7542 but we nevertheless continued resolving. */
7543 if (i->procedure->formal)
7545 gfc_symbol* i_arg = i->procedure->formal->sym;
7546 const int i_rank = (i_arg->as ? i_arg->as->rank : 0);
7547 if (i_rank == my_rank)
7549 gfc_error ("FINAL procedure '%s' declared at %L has the same"
7550 " rank (%d) as '%s'",
7551 list->procedure->name, &list->where, my_rank,
7552 i->procedure->name);
7553 goto error;
7558 /* Is this the/a scalar finalizer procedure? */
7559 if (!arg->as || arg->as->rank == 0)
7560 seen_scalar = true;
7562 prev_link = &list->next;
7563 continue;
7565 /* Remove wrong nodes immediatelly from the list so we don't risk any
7566 troubles in the future when they might fail later expectations. */
7567 error:
7568 result = FAILURE;
7569 i = list;
7570 *prev_link = list->next;
7571 gfc_free_finalizer (i);
7574 /* Warn if we haven't seen a scalar finalizer procedure (but we know there
7575 were nodes in the list, must have been for arrays. It is surely a good
7576 idea to have a scalar version there if there's something to finalize. */
7577 if (gfc_option.warn_surprising && result == SUCCESS && !seen_scalar)
7578 gfc_warning ("Only array FINAL procedures declared for derived type '%s'"
7579 " defined at %L, suggest also scalar one",
7580 derived->name, &derived->declared_at);
7582 /* TODO: Remove this error when finalization is finished. */
7583 gfc_error ("Finalization at %L is not yet implemented", &derived->declared_at);
7585 return result;
7589 /* Resolve the components of a derived type. */
7591 static try
7592 resolve_fl_derived (gfc_symbol *sym)
7594 gfc_component *c;
7595 gfc_dt_list * dt_list;
7596 int i;
7598 for (c = sym->components; c != NULL; c = c->next)
7600 if (c->ts.type == BT_CHARACTER)
7602 if (c->ts.cl->length == NULL
7603 || (resolve_charlen (c->ts.cl) == FAILURE)
7604 || !gfc_is_constant_expr (c->ts.cl->length))
7606 gfc_error ("Character length of component '%s' needs to "
7607 "be a constant specification expression at %L",
7608 c->name,
7609 c->ts.cl->length ? &c->ts.cl->length->where : &c->loc);
7610 return FAILURE;
7614 if (c->ts.type == BT_DERIVED
7615 && sym->component_access != ACCESS_PRIVATE
7616 && gfc_check_access (sym->attr.access, sym->ns->default_access)
7617 && !c->ts.derived->attr.use_assoc
7618 && !gfc_check_access (c->ts.derived->attr.access,
7619 c->ts.derived->ns->default_access))
7621 gfc_error ("The component '%s' is a PRIVATE type and cannot be "
7622 "a component of '%s', which is PUBLIC at %L",
7623 c->name, sym->name, &sym->declared_at);
7624 return FAILURE;
7627 if (sym->attr.sequence)
7629 if (c->ts.type == BT_DERIVED && c->ts.derived->attr.sequence == 0)
7631 gfc_error ("Component %s of SEQUENCE type declared at %L does "
7632 "not have the SEQUENCE attribute",
7633 c->ts.derived->name, &sym->declared_at);
7634 return FAILURE;
7638 if (c->ts.type == BT_DERIVED && c->pointer
7639 && c->ts.derived->components == NULL)
7641 gfc_error ("The pointer component '%s' of '%s' at %L is a type "
7642 "that has not been declared", c->name, sym->name,
7643 &c->loc);
7644 return FAILURE;
7647 if (c->pointer || c->allocatable || c->as == NULL)
7648 continue;
7650 for (i = 0; i < c->as->rank; i++)
7652 if (c->as->lower[i] == NULL
7653 || !gfc_is_constant_expr (c->as->lower[i])
7654 || (resolve_index_expr (c->as->lower[i]) == FAILURE)
7655 || c->as->upper[i] == NULL
7656 || (resolve_index_expr (c->as->upper[i]) == FAILURE)
7657 || !gfc_is_constant_expr (c->as->upper[i]))
7659 gfc_error ("Component '%s' of '%s' at %L must have "
7660 "constant array bounds",
7661 c->name, sym->name, &c->loc);
7662 return FAILURE;
7667 /* Resolve the finalizer procedures. */
7668 if (gfc_resolve_finalizers (sym) == FAILURE)
7669 return FAILURE;
7671 /* Add derived type to the derived type list. */
7672 for (dt_list = gfc_derived_types; dt_list; dt_list = dt_list->next)
7673 if (sym == dt_list->derived)
7674 break;
7676 if (dt_list == NULL)
7678 dt_list = gfc_get_dt_list ();
7679 dt_list->next = gfc_derived_types;
7680 dt_list->derived = sym;
7681 gfc_derived_types = dt_list;
7684 return SUCCESS;
7688 static try
7689 resolve_fl_namelist (gfc_symbol *sym)
7691 gfc_namelist *nl;
7692 gfc_symbol *nlsym;
7694 /* Reject PRIVATE objects in a PUBLIC namelist. */
7695 if (gfc_check_access(sym->attr.access, sym->ns->default_access))
7697 for (nl = sym->namelist; nl; nl = nl->next)
7699 if (!nl->sym->attr.use_assoc
7700 && !(sym->ns->parent == nl->sym->ns)
7701 && !(sym->ns->parent
7702 && sym->ns->parent->parent == nl->sym->ns)
7703 && !gfc_check_access(nl->sym->attr.access,
7704 nl->sym->ns->default_access))
7706 gfc_error ("NAMELIST object '%s' was declared PRIVATE and "
7707 "cannot be member of PUBLIC namelist '%s' at %L",
7708 nl->sym->name, sym->name, &sym->declared_at);
7709 return FAILURE;
7712 /* Types with private components that came here by USE-association. */
7713 if (nl->sym->ts.type == BT_DERIVED
7714 && derived_inaccessible (nl->sym->ts.derived))
7716 gfc_error ("NAMELIST object '%s' has use-associated PRIVATE "
7717 "components and cannot be member of namelist '%s' at %L",
7718 nl->sym->name, sym->name, &sym->declared_at);
7719 return FAILURE;
7722 /* Types with private components that are defined in the same module. */
7723 if (nl->sym->ts.type == BT_DERIVED
7724 && !(sym->ns->parent == nl->sym->ts.derived->ns)
7725 && !gfc_check_access (nl->sym->ts.derived->attr.private_comp
7726 ? ACCESS_PRIVATE : ACCESS_UNKNOWN,
7727 nl->sym->ns->default_access))
7729 gfc_error ("NAMELIST object '%s' has PRIVATE components and "
7730 "cannot be a member of PUBLIC namelist '%s' at %L",
7731 nl->sym->name, sym->name, &sym->declared_at);
7732 return FAILURE;
7737 for (nl = sym->namelist; nl; nl = nl->next)
7739 /* Reject namelist arrays of assumed shape. */
7740 if (nl->sym->as && nl->sym->as->type == AS_ASSUMED_SHAPE
7741 && gfc_notify_std (GFC_STD_F2003, "NAMELIST array object '%s' "
7742 "must not have assumed shape in namelist "
7743 "'%s' at %L", nl->sym->name, sym->name,
7744 &sym->declared_at) == FAILURE)
7745 return FAILURE;
7747 /* Reject namelist arrays that are not constant shape. */
7748 if (is_non_constant_shape_array (nl->sym))
7750 gfc_error ("NAMELIST array object '%s' must have constant "
7751 "shape in namelist '%s' at %L", nl->sym->name,
7752 sym->name, &sym->declared_at);
7753 return FAILURE;
7756 /* Namelist objects cannot have allocatable or pointer components. */
7757 if (nl->sym->ts.type != BT_DERIVED)
7758 continue;
7760 if (nl->sym->ts.derived->attr.alloc_comp)
7762 gfc_error ("NAMELIST object '%s' in namelist '%s' at %L cannot "
7763 "have ALLOCATABLE components",
7764 nl->sym->name, sym->name, &sym->declared_at);
7765 return FAILURE;
7768 if (nl->sym->ts.derived->attr.pointer_comp)
7770 gfc_error ("NAMELIST object '%s' in namelist '%s' at %L cannot "
7771 "have POINTER components",
7772 nl->sym->name, sym->name, &sym->declared_at);
7773 return FAILURE;
7778 /* 14.1.2 A module or internal procedure represent local entities
7779 of the same type as a namelist member and so are not allowed. */
7780 for (nl = sym->namelist; nl; nl = nl->next)
7782 if (nl->sym->ts.kind != 0 && nl->sym->attr.flavor == FL_VARIABLE)
7783 continue;
7785 if (nl->sym->attr.function && nl->sym == nl->sym->result)
7786 if ((nl->sym == sym->ns->proc_name)
7788 (sym->ns->parent && nl->sym == sym->ns->parent->proc_name))
7789 continue;
7791 nlsym = NULL;
7792 if (nl->sym && nl->sym->name)
7793 gfc_find_symbol (nl->sym->name, sym->ns, 1, &nlsym);
7794 if (nlsym && nlsym->attr.flavor == FL_PROCEDURE)
7796 gfc_error ("PROCEDURE attribute conflicts with NAMELIST "
7797 "attribute in '%s' at %L", nlsym->name,
7798 &sym->declared_at);
7799 return FAILURE;
7803 return SUCCESS;
7807 static try
7808 resolve_fl_parameter (gfc_symbol *sym)
7810 /* A parameter array's shape needs to be constant. */
7811 if (sym->as != NULL
7812 && (sym->as->type == AS_DEFERRED
7813 || is_non_constant_shape_array (sym)))
7815 gfc_error ("Parameter array '%s' at %L cannot be automatic "
7816 "or of deferred shape", sym->name, &sym->declared_at);
7817 return FAILURE;
7820 /* Make sure a parameter that has been implicitly typed still
7821 matches the implicit type, since PARAMETER statements can precede
7822 IMPLICIT statements. */
7823 if (sym->attr.implicit_type
7824 && !gfc_compare_types (&sym->ts, gfc_get_default_type (sym, sym->ns)))
7826 gfc_error ("Implicitly typed PARAMETER '%s' at %L doesn't match a "
7827 "later IMPLICIT type", sym->name, &sym->declared_at);
7828 return FAILURE;
7831 /* Make sure the types of derived parameters are consistent. This
7832 type checking is deferred until resolution because the type may
7833 refer to a derived type from the host. */
7834 if (sym->ts.type == BT_DERIVED
7835 && !gfc_compare_types (&sym->ts, &sym->value->ts))
7837 gfc_error ("Incompatible derived type in PARAMETER at %L",
7838 &sym->value->where);
7839 return FAILURE;
7841 return SUCCESS;
7845 /* Do anything necessary to resolve a symbol. Right now, we just
7846 assume that an otherwise unknown symbol is a variable. This sort
7847 of thing commonly happens for symbols in module. */
7849 static void
7850 resolve_symbol (gfc_symbol *sym)
7852 int check_constant, mp_flag;
7853 gfc_symtree *symtree;
7854 gfc_symtree *this_symtree;
7855 gfc_namespace *ns;
7856 gfc_component *c;
7858 if (sym->attr.flavor == FL_UNKNOWN)
7861 /* If we find that a flavorless symbol is an interface in one of the
7862 parent namespaces, find its symtree in this namespace, free the
7863 symbol and set the symtree to point to the interface symbol. */
7864 for (ns = gfc_current_ns->parent; ns; ns = ns->parent)
7866 symtree = gfc_find_symtree (ns->sym_root, sym->name);
7867 if (symtree && symtree->n.sym->generic)
7869 this_symtree = gfc_find_symtree (gfc_current_ns->sym_root,
7870 sym->name);
7871 sym->refs--;
7872 if (!sym->refs)
7873 gfc_free_symbol (sym);
7874 symtree->n.sym->refs++;
7875 this_symtree->n.sym = symtree->n.sym;
7876 return;
7880 /* Otherwise give it a flavor according to such attributes as
7881 it has. */
7882 if (sym->attr.external == 0 && sym->attr.intrinsic == 0)
7883 sym->attr.flavor = FL_VARIABLE;
7884 else
7886 sym->attr.flavor = FL_PROCEDURE;
7887 if (sym->attr.dimension)
7888 sym->attr.function = 1;
7892 if (sym->attr.procedure && sym->ts.interface
7893 && sym->attr.if_source != IFSRC_DECL)
7895 if (sym->ts.interface->attr.procedure)
7896 gfc_error ("Interface '%s', used by procedure '%s' at %L, is declared "
7897 "in a later PROCEDURE statement", sym->ts.interface->name,
7898 sym->name,&sym->declared_at);
7900 /* Get the attributes from the interface (now resolved). */
7901 if (sym->ts.interface->attr.if_source || sym->ts.interface->attr.intrinsic)
7903 gfc_symbol *ifc = sym->ts.interface;
7904 sym->ts = ifc->ts;
7905 sym->ts.interface = ifc;
7906 sym->attr.function = ifc->attr.function;
7907 sym->attr.subroutine = ifc->attr.subroutine;
7908 copy_formal_args (sym, ifc);
7910 else if (sym->ts.interface->name[0] != '\0')
7912 gfc_error ("Interface '%s' of procedure '%s' at %L must be explicit",
7913 sym->ts.interface->name, sym->name, &sym->declared_at);
7914 return;
7918 if (sym->attr.flavor == FL_DERIVED && resolve_fl_derived (sym) == FAILURE)
7919 return;
7921 /* Symbols that are module procedures with results (functions) have
7922 the types and array specification copied for type checking in
7923 procedures that call them, as well as for saving to a module
7924 file. These symbols can't stand the scrutiny that their results
7925 can. */
7926 mp_flag = (sym->result != NULL && sym->result != sym);
7929 /* Make sure that the intrinsic is consistent with its internal
7930 representation. This needs to be done before assigning a default
7931 type to avoid spurious warnings. */
7932 if (sym->attr.flavor != FL_MODULE && sym->attr.intrinsic)
7934 if (gfc_intrinsic_name (sym->name, 0))
7936 if (sym->ts.type != BT_UNKNOWN && gfc_option.warn_surprising)
7937 gfc_warning ("Type specified for intrinsic function '%s' at %L is ignored",
7938 sym->name, &sym->declared_at);
7940 else if (gfc_intrinsic_name (sym->name, 1))
7942 if (sym->ts.type != BT_UNKNOWN)
7944 gfc_error ("Intrinsic subroutine '%s' at %L shall not have a type specifier",
7945 sym->name, &sym->declared_at);
7946 return;
7949 else
7951 gfc_error ("Intrinsic '%s' at %L does not exist", sym->name, &sym->declared_at);
7952 return;
7956 /* Assign default type to symbols that need one and don't have one. */
7957 if (sym->ts.type == BT_UNKNOWN)
7959 if (sym->attr.flavor == FL_VARIABLE || sym->attr.flavor == FL_PARAMETER)
7960 gfc_set_default_type (sym, 1, NULL);
7962 if (sym->attr.flavor == FL_PROCEDURE && sym->attr.function)
7964 /* The specific case of an external procedure should emit an error
7965 in the case that there is no implicit type. */
7966 if (!mp_flag)
7967 gfc_set_default_type (sym, sym->attr.external, NULL);
7968 else
7970 /* Result may be in another namespace. */
7971 resolve_symbol (sym->result);
7973 sym->ts = sym->result->ts;
7974 sym->as = gfc_copy_array_spec (sym->result->as);
7975 sym->attr.dimension = sym->result->attr.dimension;
7976 sym->attr.pointer = sym->result->attr.pointer;
7977 sym->attr.allocatable = sym->result->attr.allocatable;
7982 /* Assumed size arrays and assumed shape arrays must be dummy
7983 arguments. */
7985 if (sym->as != NULL
7986 && (sym->as->type == AS_ASSUMED_SIZE
7987 || sym->as->type == AS_ASSUMED_SHAPE)
7988 && sym->attr.dummy == 0)
7990 if (sym->as->type == AS_ASSUMED_SIZE)
7991 gfc_error ("Assumed size array at %L must be a dummy argument",
7992 &sym->declared_at);
7993 else
7994 gfc_error ("Assumed shape array at %L must be a dummy argument",
7995 &sym->declared_at);
7996 return;
7999 /* Make sure symbols with known intent or optional are really dummy
8000 variable. Because of ENTRY statement, this has to be deferred
8001 until resolution time. */
8003 if (!sym->attr.dummy
8004 && (sym->attr.optional || sym->attr.intent != INTENT_UNKNOWN))
8006 gfc_error ("Symbol at %L is not a DUMMY variable", &sym->declared_at);
8007 return;
8010 if (sym->attr.value && !sym->attr.dummy)
8012 gfc_error ("'%s' at %L cannot have the VALUE attribute because "
8013 "it is not a dummy argument", sym->name, &sym->declared_at);
8014 return;
8017 if (sym->attr.value && sym->ts.type == BT_CHARACTER)
8019 gfc_charlen *cl = sym->ts.cl;
8020 if (!cl || !cl->length || cl->length->expr_type != EXPR_CONSTANT)
8022 gfc_error ("Character dummy variable '%s' at %L with VALUE "
8023 "attribute must have constant length",
8024 sym->name, &sym->declared_at);
8025 return;
8028 if (sym->ts.is_c_interop
8029 && mpz_cmp_si (cl->length->value.integer, 1) != 0)
8031 gfc_error ("C interoperable character dummy variable '%s' at %L "
8032 "with VALUE attribute must have length one",
8033 sym->name, &sym->declared_at);
8034 return;
8038 /* If the symbol is marked as bind(c), verify it's type and kind. Do not
8039 do this for something that was implicitly typed because that is handled
8040 in gfc_set_default_type. Handle dummy arguments and procedure
8041 definitions separately. Also, anything that is use associated is not
8042 handled here but instead is handled in the module it is declared in.
8043 Finally, derived type definitions are allowed to be BIND(C) since that
8044 only implies that they're interoperable, and they are checked fully for
8045 interoperability when a variable is declared of that type. */
8046 if (sym->attr.is_bind_c && sym->attr.implicit_type == 0 &&
8047 sym->attr.use_assoc == 0 && sym->attr.dummy == 0 &&
8048 sym->attr.flavor != FL_PROCEDURE && sym->attr.flavor != FL_DERIVED)
8050 try t = SUCCESS;
8052 /* First, make sure the variable is declared at the
8053 module-level scope (J3/04-007, Section 15.3). */
8054 if (sym->ns->proc_name->attr.flavor != FL_MODULE &&
8055 sym->attr.in_common == 0)
8057 gfc_error ("Variable '%s' at %L cannot be BIND(C) because it "
8058 "is neither a COMMON block nor declared at the "
8059 "module level scope", sym->name, &(sym->declared_at));
8060 t = FAILURE;
8062 else if (sym->common_head != NULL)
8064 t = verify_com_block_vars_c_interop (sym->common_head);
8066 else
8068 /* If type() declaration, we need to verify that the components
8069 of the given type are all C interoperable, etc. */
8070 if (sym->ts.type == BT_DERIVED &&
8071 sym->ts.derived->attr.is_c_interop != 1)
8073 /* Make sure the user marked the derived type as BIND(C). If
8074 not, call the verify routine. This could print an error
8075 for the derived type more than once if multiple variables
8076 of that type are declared. */
8077 if (sym->ts.derived->attr.is_bind_c != 1)
8078 verify_bind_c_derived_type (sym->ts.derived);
8079 t = FAILURE;
8082 /* Verify the variable itself as C interoperable if it
8083 is BIND(C). It is not possible for this to succeed if
8084 the verify_bind_c_derived_type failed, so don't have to handle
8085 any error returned by verify_bind_c_derived_type. */
8086 t = verify_bind_c_sym (sym, &(sym->ts), sym->attr.in_common,
8087 sym->common_block);
8090 if (t == FAILURE)
8092 /* clear the is_bind_c flag to prevent reporting errors more than
8093 once if something failed. */
8094 sym->attr.is_bind_c = 0;
8095 return;
8099 /* If a derived type symbol has reached this point, without its
8100 type being declared, we have an error. Notice that most
8101 conditions that produce undefined derived types have already
8102 been dealt with. However, the likes of:
8103 implicit type(t) (t) ..... call foo (t) will get us here if
8104 the type is not declared in the scope of the implicit
8105 statement. Change the type to BT_UNKNOWN, both because it is so
8106 and to prevent an ICE. */
8107 if (sym->ts.type == BT_DERIVED && sym->ts.derived->components == NULL
8108 && !sym->ts.derived->attr.zero_comp)
8110 gfc_error ("The derived type '%s' at %L is of type '%s', "
8111 "which has not been defined", sym->name,
8112 &sym->declared_at, sym->ts.derived->name);
8113 sym->ts.type = BT_UNKNOWN;
8114 return;
8117 /* Make sure that the derived type has been resolved and that the
8118 derived type is visible in the symbol's namespace, if it is a
8119 module function and is not PRIVATE. */
8120 if (sym->ts.type == BT_DERIVED
8121 && sym->ts.derived->attr.use_assoc
8122 && sym->ns->proc_name->attr.flavor == FL_MODULE)
8124 gfc_symbol *ds;
8126 if (resolve_fl_derived (sym->ts.derived) == FAILURE)
8127 return;
8129 gfc_find_symbol (sym->ts.derived->name, sym->ns, 1, &ds);
8130 if (!ds && sym->attr.function
8131 && gfc_check_access (sym->attr.access, sym->ns->default_access))
8133 symtree = gfc_new_symtree (&sym->ns->sym_root,
8134 sym->ts.derived->name);
8135 symtree->n.sym = sym->ts.derived;
8136 sym->ts.derived->refs++;
8140 /* Unless the derived-type declaration is use associated, Fortran 95
8141 does not allow public entries of private derived types.
8142 See 4.4.1 (F95) and 4.5.1.1 (F2003); and related interpretation
8143 161 in 95-006r3. */
8144 if (sym->ts.type == BT_DERIVED
8145 && sym->ns->proc_name && sym->ns->proc_name->attr.flavor == FL_MODULE
8146 && !sym->ts.derived->attr.use_assoc
8147 && gfc_check_access (sym->attr.access, sym->ns->default_access)
8148 && !gfc_check_access (sym->ts.derived->attr.access,
8149 sym->ts.derived->ns->default_access)
8150 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: PUBLIC %s '%s' at %L "
8151 "of PRIVATE derived type '%s'",
8152 (sym->attr.flavor == FL_PARAMETER) ? "parameter"
8153 : "variable", sym->name, &sym->declared_at,
8154 sym->ts.derived->name) == FAILURE)
8155 return;
8157 /* An assumed-size array with INTENT(OUT) shall not be of a type for which
8158 default initialization is defined (5.1.2.4.4). */
8159 if (sym->ts.type == BT_DERIVED
8160 && sym->attr.dummy
8161 && sym->attr.intent == INTENT_OUT
8162 && sym->as
8163 && sym->as->type == AS_ASSUMED_SIZE)
8165 for (c = sym->ts.derived->components; c; c = c->next)
8167 if (c->initializer)
8169 gfc_error ("The INTENT(OUT) dummy argument '%s' at %L is "
8170 "ASSUMED SIZE and so cannot have a default initializer",
8171 sym->name, &sym->declared_at);
8172 return;
8177 switch (sym->attr.flavor)
8179 case FL_VARIABLE:
8180 if (resolve_fl_variable (sym, mp_flag) == FAILURE)
8181 return;
8182 break;
8184 case FL_PROCEDURE:
8185 if (resolve_fl_procedure (sym, mp_flag) == FAILURE)
8186 return;
8187 break;
8189 case FL_NAMELIST:
8190 if (resolve_fl_namelist (sym) == FAILURE)
8191 return;
8192 break;
8194 case FL_PARAMETER:
8195 if (resolve_fl_parameter (sym) == FAILURE)
8196 return;
8197 break;
8199 default:
8200 break;
8203 /* Resolve array specifier. Check as well some constraints
8204 on COMMON blocks. */
8206 check_constant = sym->attr.in_common && !sym->attr.pointer;
8208 /* Set the formal_arg_flag so that check_conflict will not throw
8209 an error for host associated variables in the specification
8210 expression for an array_valued function. */
8211 if (sym->attr.function && sym->as)
8212 formal_arg_flag = 1;
8214 gfc_resolve_array_spec (sym->as, check_constant);
8216 formal_arg_flag = 0;
8218 /* Resolve formal namespaces. */
8219 if (sym->formal_ns && sym->formal_ns != gfc_current_ns)
8220 gfc_resolve (sym->formal_ns);
8222 /* Check threadprivate restrictions. */
8223 if (sym->attr.threadprivate && !sym->attr.save && !sym->ns->save_all
8224 && (!sym->attr.in_common
8225 && sym->module == NULL
8226 && (sym->ns->proc_name == NULL
8227 || sym->ns->proc_name->attr.flavor != FL_MODULE)))
8228 gfc_error ("Threadprivate at %L isn't SAVEd", &sym->declared_at);
8230 /* If we have come this far we can apply default-initializers, as
8231 described in 14.7.5, to those variables that have not already
8232 been assigned one. */
8233 if (sym->ts.type == BT_DERIVED
8234 && sym->attr.referenced
8235 && sym->ns == gfc_current_ns
8236 && !sym->value
8237 && !sym->attr.allocatable
8238 && !sym->attr.alloc_comp)
8240 symbol_attribute *a = &sym->attr;
8242 if ((!a->save && !a->dummy && !a->pointer
8243 && !a->in_common && !a->use_assoc
8244 && !(a->function && sym != sym->result))
8245 || (a->dummy && a->intent == INTENT_OUT))
8246 apply_default_init (sym);
8251 /************* Resolve DATA statements *************/
8253 static struct
8255 gfc_data_value *vnode;
8256 mpz_t left;
8258 values;
8261 /* Advance the values structure to point to the next value in the data list. */
8263 static try
8264 next_data_value (void)
8267 while (mpz_cmp_ui (values.left, 0) == 0)
8269 if (values.vnode->next == NULL)
8270 return FAILURE;
8272 values.vnode = values.vnode->next;
8273 mpz_set (values.left, values.vnode->repeat);
8276 return SUCCESS;
8280 static try
8281 check_data_variable (gfc_data_variable *var, locus *where)
8283 gfc_expr *e;
8284 mpz_t size;
8285 mpz_t offset;
8286 try t;
8287 ar_type mark = AR_UNKNOWN;
8288 int i;
8289 mpz_t section_index[GFC_MAX_DIMENSIONS];
8290 gfc_ref *ref;
8291 gfc_array_ref *ar;
8293 if (gfc_resolve_expr (var->expr) == FAILURE)
8294 return FAILURE;
8296 ar = NULL;
8297 mpz_init_set_si (offset, 0);
8298 e = var->expr;
8300 if (e->expr_type != EXPR_VARIABLE)
8301 gfc_internal_error ("check_data_variable(): Bad expression");
8303 if (e->symtree->n.sym->ns->is_block_data
8304 && !e->symtree->n.sym->attr.in_common)
8306 gfc_error ("BLOCK DATA element '%s' at %L must be in COMMON",
8307 e->symtree->n.sym->name, &e->symtree->n.sym->declared_at);
8310 if (e->ref == NULL && e->symtree->n.sym->as)
8312 gfc_error ("DATA array '%s' at %L must be specified in a previous"
8313 " declaration", e->symtree->n.sym->name, where);
8314 return FAILURE;
8317 if (e->rank == 0)
8319 mpz_init_set_ui (size, 1);
8320 ref = NULL;
8322 else
8324 ref = e->ref;
8326 /* Find the array section reference. */
8327 for (ref = e->ref; ref; ref = ref->next)
8329 if (ref->type != REF_ARRAY)
8330 continue;
8331 if (ref->u.ar.type == AR_ELEMENT)
8332 continue;
8333 break;
8335 gcc_assert (ref);
8337 /* Set marks according to the reference pattern. */
8338 switch (ref->u.ar.type)
8340 case AR_FULL:
8341 mark = AR_FULL;
8342 break;
8344 case AR_SECTION:
8345 ar = &ref->u.ar;
8346 /* Get the start position of array section. */
8347 gfc_get_section_index (ar, section_index, &offset);
8348 mark = AR_SECTION;
8349 break;
8351 default:
8352 gcc_unreachable ();
8355 if (gfc_array_size (e, &size) == FAILURE)
8357 gfc_error ("Nonconstant array section at %L in DATA statement",
8358 &e->where);
8359 mpz_clear (offset);
8360 return FAILURE;
8364 t = SUCCESS;
8366 while (mpz_cmp_ui (size, 0) > 0)
8368 if (next_data_value () == FAILURE)
8370 gfc_error ("DATA statement at %L has more variables than values",
8371 where);
8372 t = FAILURE;
8373 break;
8376 t = gfc_check_assign (var->expr, values.vnode->expr, 0);
8377 if (t == FAILURE)
8378 break;
8380 /* If we have more than one element left in the repeat count,
8381 and we have more than one element left in the target variable,
8382 then create a range assignment. */
8383 /* FIXME: Only done for full arrays for now, since array sections
8384 seem tricky. */
8385 if (mark == AR_FULL && ref && ref->next == NULL
8386 && mpz_cmp_ui (values.left, 1) > 0 && mpz_cmp_ui (size, 1) > 0)
8388 mpz_t range;
8390 if (mpz_cmp (size, values.left) >= 0)
8392 mpz_init_set (range, values.left);
8393 mpz_sub (size, size, values.left);
8394 mpz_set_ui (values.left, 0);
8396 else
8398 mpz_init_set (range, size);
8399 mpz_sub (values.left, values.left, size);
8400 mpz_set_ui (size, 0);
8403 gfc_assign_data_value_range (var->expr, values.vnode->expr,
8404 offset, range);
8406 mpz_add (offset, offset, range);
8407 mpz_clear (range);
8410 /* Assign initial value to symbol. */
8411 else
8413 mpz_sub_ui (values.left, values.left, 1);
8414 mpz_sub_ui (size, size, 1);
8416 t = gfc_assign_data_value (var->expr, values.vnode->expr, offset);
8417 if (t == FAILURE)
8418 break;
8420 if (mark == AR_FULL)
8421 mpz_add_ui (offset, offset, 1);
8423 /* Modify the array section indexes and recalculate the offset
8424 for next element. */
8425 else if (mark == AR_SECTION)
8426 gfc_advance_section (section_index, ar, &offset);
8430 if (mark == AR_SECTION)
8432 for (i = 0; i < ar->dimen; i++)
8433 mpz_clear (section_index[i]);
8436 mpz_clear (size);
8437 mpz_clear (offset);
8439 return t;
8443 static try traverse_data_var (gfc_data_variable *, locus *);
8445 /* Iterate over a list of elements in a DATA statement. */
8447 static try
8448 traverse_data_list (gfc_data_variable *var, locus *where)
8450 mpz_t trip;
8451 iterator_stack frame;
8452 gfc_expr *e, *start, *end, *step;
8453 try retval = SUCCESS;
8455 mpz_init (frame.value);
8457 start = gfc_copy_expr (var->iter.start);
8458 end = gfc_copy_expr (var->iter.end);
8459 step = gfc_copy_expr (var->iter.step);
8461 if (gfc_simplify_expr (start, 1) == FAILURE
8462 || start->expr_type != EXPR_CONSTANT)
8464 gfc_error ("iterator start at %L does not simplify", &start->where);
8465 retval = FAILURE;
8466 goto cleanup;
8468 if (gfc_simplify_expr (end, 1) == FAILURE
8469 || end->expr_type != EXPR_CONSTANT)
8471 gfc_error ("iterator end at %L does not simplify", &end->where);
8472 retval = FAILURE;
8473 goto cleanup;
8475 if (gfc_simplify_expr (step, 1) == FAILURE
8476 || step->expr_type != EXPR_CONSTANT)
8478 gfc_error ("iterator step at %L does not simplify", &step->where);
8479 retval = FAILURE;
8480 goto cleanup;
8483 mpz_init_set (trip, end->value.integer);
8484 mpz_sub (trip, trip, start->value.integer);
8485 mpz_add (trip, trip, step->value.integer);
8487 mpz_div (trip, trip, step->value.integer);
8489 mpz_set (frame.value, start->value.integer);
8491 frame.prev = iter_stack;
8492 frame.variable = var->iter.var->symtree;
8493 iter_stack = &frame;
8495 while (mpz_cmp_ui (trip, 0) > 0)
8497 if (traverse_data_var (var->list, where) == FAILURE)
8499 mpz_clear (trip);
8500 retval = FAILURE;
8501 goto cleanup;
8504 e = gfc_copy_expr (var->expr);
8505 if (gfc_simplify_expr (e, 1) == FAILURE)
8507 gfc_free_expr (e);
8508 mpz_clear (trip);
8509 retval = FAILURE;
8510 goto cleanup;
8513 mpz_add (frame.value, frame.value, step->value.integer);
8515 mpz_sub_ui (trip, trip, 1);
8518 mpz_clear (trip);
8519 cleanup:
8520 mpz_clear (frame.value);
8522 gfc_free_expr (start);
8523 gfc_free_expr (end);
8524 gfc_free_expr (step);
8526 iter_stack = frame.prev;
8527 return retval;
8531 /* Type resolve variables in the variable list of a DATA statement. */
8533 static try
8534 traverse_data_var (gfc_data_variable *var, locus *where)
8536 try t;
8538 for (; var; var = var->next)
8540 if (var->expr == NULL)
8541 t = traverse_data_list (var, where);
8542 else
8543 t = check_data_variable (var, where);
8545 if (t == FAILURE)
8546 return FAILURE;
8549 return SUCCESS;
8553 /* Resolve the expressions and iterators associated with a data statement.
8554 This is separate from the assignment checking because data lists should
8555 only be resolved once. */
8557 static try
8558 resolve_data_variables (gfc_data_variable *d)
8560 for (; d; d = d->next)
8562 if (d->list == NULL)
8564 if (gfc_resolve_expr (d->expr) == FAILURE)
8565 return FAILURE;
8567 else
8569 if (gfc_resolve_iterator (&d->iter, false) == FAILURE)
8570 return FAILURE;
8572 if (resolve_data_variables (d->list) == FAILURE)
8573 return FAILURE;
8577 return SUCCESS;
8581 /* Resolve a single DATA statement. We implement this by storing a pointer to
8582 the value list into static variables, and then recursively traversing the
8583 variables list, expanding iterators and such. */
8585 static void
8586 resolve_data (gfc_data *d)
8589 if (resolve_data_variables (d->var) == FAILURE)
8590 return;
8592 values.vnode = d->value;
8593 if (d->value == NULL)
8594 mpz_set_ui (values.left, 0);
8595 else
8596 mpz_set (values.left, d->value->repeat);
8598 if (traverse_data_var (d->var, &d->where) == FAILURE)
8599 return;
8601 /* At this point, we better not have any values left. */
8603 if (next_data_value () == SUCCESS)
8604 gfc_error ("DATA statement at %L has more values than variables",
8605 &d->where);
8609 /* 12.6 Constraint: In a pure subprogram any variable which is in common or
8610 accessed by host or use association, is a dummy argument to a pure function,
8611 is a dummy argument with INTENT (IN) to a pure subroutine, or an object that
8612 is storage associated with any such variable, shall not be used in the
8613 following contexts: (clients of this function). */
8615 /* Determines if a variable is not 'pure', ie not assignable within a pure
8616 procedure. Returns zero if assignment is OK, nonzero if there is a
8617 problem. */
8619 gfc_impure_variable (gfc_symbol *sym)
8621 gfc_symbol *proc;
8623 if (sym->attr.use_assoc || sym->attr.in_common)
8624 return 1;
8626 if (sym->ns != gfc_current_ns)
8627 return !sym->attr.function;
8629 proc = sym->ns->proc_name;
8630 if (sym->attr.dummy && gfc_pure (proc)
8631 && ((proc->attr.subroutine && sym->attr.intent == INTENT_IN)
8633 proc->attr.function))
8634 return 1;
8636 /* TODO: Sort out what can be storage associated, if anything, and include
8637 it here. In principle equivalences should be scanned but it does not
8638 seem to be possible to storage associate an impure variable this way. */
8639 return 0;
8643 /* Test whether a symbol is pure or not. For a NULL pointer, checks the
8644 symbol of the current procedure. */
8647 gfc_pure (gfc_symbol *sym)
8649 symbol_attribute attr;
8651 if (sym == NULL)
8652 sym = gfc_current_ns->proc_name;
8653 if (sym == NULL)
8654 return 0;
8656 attr = sym->attr;
8658 return attr.flavor == FL_PROCEDURE && (attr.pure || attr.elemental);
8662 /* Test whether the current procedure is elemental or not. */
8665 gfc_elemental (gfc_symbol *sym)
8667 symbol_attribute attr;
8669 if (sym == NULL)
8670 sym = gfc_current_ns->proc_name;
8671 if (sym == NULL)
8672 return 0;
8673 attr = sym->attr;
8675 return attr.flavor == FL_PROCEDURE && attr.elemental;
8679 /* Warn about unused labels. */
8681 static void
8682 warn_unused_fortran_label (gfc_st_label *label)
8684 if (label == NULL)
8685 return;
8687 warn_unused_fortran_label (label->left);
8689 if (label->defined == ST_LABEL_UNKNOWN)
8690 return;
8692 switch (label->referenced)
8694 case ST_LABEL_UNKNOWN:
8695 gfc_warning ("Label %d at %L defined but not used", label->value,
8696 &label->where);
8697 break;
8699 case ST_LABEL_BAD_TARGET:
8700 gfc_warning ("Label %d at %L defined but cannot be used",
8701 label->value, &label->where);
8702 break;
8704 default:
8705 break;
8708 warn_unused_fortran_label (label->right);
8712 /* Returns the sequence type of a symbol or sequence. */
8714 static seq_type
8715 sequence_type (gfc_typespec ts)
8717 seq_type result;
8718 gfc_component *c;
8720 switch (ts.type)
8722 case BT_DERIVED:
8724 if (ts.derived->components == NULL)
8725 return SEQ_NONDEFAULT;
8727 result = sequence_type (ts.derived->components->ts);
8728 for (c = ts.derived->components->next; c; c = c->next)
8729 if (sequence_type (c->ts) != result)
8730 return SEQ_MIXED;
8732 return result;
8734 case BT_CHARACTER:
8735 if (ts.kind != gfc_default_character_kind)
8736 return SEQ_NONDEFAULT;
8738 return SEQ_CHARACTER;
8740 case BT_INTEGER:
8741 if (ts.kind != gfc_default_integer_kind)
8742 return SEQ_NONDEFAULT;
8744 return SEQ_NUMERIC;
8746 case BT_REAL:
8747 if (!(ts.kind == gfc_default_real_kind
8748 || ts.kind == gfc_default_double_kind))
8749 return SEQ_NONDEFAULT;
8751 return SEQ_NUMERIC;
8753 case BT_COMPLEX:
8754 if (ts.kind != gfc_default_complex_kind)
8755 return SEQ_NONDEFAULT;
8757 return SEQ_NUMERIC;
8759 case BT_LOGICAL:
8760 if (ts.kind != gfc_default_logical_kind)
8761 return SEQ_NONDEFAULT;
8763 return SEQ_NUMERIC;
8765 default:
8766 return SEQ_NONDEFAULT;
8771 /* Resolve derived type EQUIVALENCE object. */
8773 static try
8774 resolve_equivalence_derived (gfc_symbol *derived, gfc_symbol *sym, gfc_expr *e)
8776 gfc_symbol *d;
8777 gfc_component *c = derived->components;
8779 if (!derived)
8780 return SUCCESS;
8782 /* Shall not be an object of nonsequence derived type. */
8783 if (!derived->attr.sequence)
8785 gfc_error ("Derived type variable '%s' at %L must have SEQUENCE "
8786 "attribute to be an EQUIVALENCE object", sym->name,
8787 &e->where);
8788 return FAILURE;
8791 /* Shall not have allocatable components. */
8792 if (derived->attr.alloc_comp)
8794 gfc_error ("Derived type variable '%s' at %L cannot have ALLOCATABLE "
8795 "components to be an EQUIVALENCE object",sym->name,
8796 &e->where);
8797 return FAILURE;
8800 if (sym->attr.in_common && has_default_initializer (sym->ts.derived))
8802 gfc_error ("Derived type variable '%s' at %L with default "
8803 "initialization cannot be in EQUIVALENCE with a variable "
8804 "in COMMON", sym->name, &e->where);
8805 return FAILURE;
8808 for (; c ; c = c->next)
8810 d = c->ts.derived;
8811 if (d
8812 && (resolve_equivalence_derived (c->ts.derived, sym, e) == FAILURE))
8813 return FAILURE;
8815 /* Shall not be an object of sequence derived type containing a pointer
8816 in the structure. */
8817 if (c->pointer)
8819 gfc_error ("Derived type variable '%s' at %L with pointer "
8820 "component(s) cannot be an EQUIVALENCE object",
8821 sym->name, &e->where);
8822 return FAILURE;
8825 return SUCCESS;
8829 /* Resolve equivalence object.
8830 An EQUIVALENCE object shall not be a dummy argument, a pointer, a target,
8831 an allocatable array, an object of nonsequence derived type, an object of
8832 sequence derived type containing a pointer at any level of component
8833 selection, an automatic object, a function name, an entry name, a result
8834 name, a named constant, a structure component, or a subobject of any of
8835 the preceding objects. A substring shall not have length zero. A
8836 derived type shall not have components with default initialization nor
8837 shall two objects of an equivalence group be initialized.
8838 Either all or none of the objects shall have an protected attribute.
8839 The simple constraints are done in symbol.c(check_conflict) and the rest
8840 are implemented here. */
8842 static void
8843 resolve_equivalence (gfc_equiv *eq)
8845 gfc_symbol *sym;
8846 gfc_symbol *derived;
8847 gfc_symbol *first_sym;
8848 gfc_expr *e;
8849 gfc_ref *r;
8850 locus *last_where = NULL;
8851 seq_type eq_type, last_eq_type;
8852 gfc_typespec *last_ts;
8853 int object, cnt_protected;
8854 const char *value_name;
8855 const char *msg;
8857 value_name = NULL;
8858 last_ts = &eq->expr->symtree->n.sym->ts;
8860 first_sym = eq->expr->symtree->n.sym;
8862 cnt_protected = 0;
8864 for (object = 1; eq; eq = eq->eq, object++)
8866 e = eq->expr;
8868 e->ts = e->symtree->n.sym->ts;
8869 /* match_varspec might not know yet if it is seeing
8870 array reference or substring reference, as it doesn't
8871 know the types. */
8872 if (e->ref && e->ref->type == REF_ARRAY)
8874 gfc_ref *ref = e->ref;
8875 sym = e->symtree->n.sym;
8877 if (sym->attr.dimension)
8879 ref->u.ar.as = sym->as;
8880 ref = ref->next;
8883 /* For substrings, convert REF_ARRAY into REF_SUBSTRING. */
8884 if (e->ts.type == BT_CHARACTER
8885 && ref
8886 && ref->type == REF_ARRAY
8887 && ref->u.ar.dimen == 1
8888 && ref->u.ar.dimen_type[0] == DIMEN_RANGE
8889 && ref->u.ar.stride[0] == NULL)
8891 gfc_expr *start = ref->u.ar.start[0];
8892 gfc_expr *end = ref->u.ar.end[0];
8893 void *mem = NULL;
8895 /* Optimize away the (:) reference. */
8896 if (start == NULL && end == NULL)
8898 if (e->ref == ref)
8899 e->ref = ref->next;
8900 else
8901 e->ref->next = ref->next;
8902 mem = ref;
8904 else
8906 ref->type = REF_SUBSTRING;
8907 if (start == NULL)
8908 start = gfc_int_expr (1);
8909 ref->u.ss.start = start;
8910 if (end == NULL && e->ts.cl)
8911 end = gfc_copy_expr (e->ts.cl->length);
8912 ref->u.ss.end = end;
8913 ref->u.ss.length = e->ts.cl;
8914 e->ts.cl = NULL;
8916 ref = ref->next;
8917 gfc_free (mem);
8920 /* Any further ref is an error. */
8921 if (ref)
8923 gcc_assert (ref->type == REF_ARRAY);
8924 gfc_error ("Syntax error in EQUIVALENCE statement at %L",
8925 &ref->u.ar.where);
8926 continue;
8930 if (gfc_resolve_expr (e) == FAILURE)
8931 continue;
8933 sym = e->symtree->n.sym;
8935 if (sym->attr.protected)
8936 cnt_protected++;
8937 if (cnt_protected > 0 && cnt_protected != object)
8939 gfc_error ("Either all or none of the objects in the "
8940 "EQUIVALENCE set at %L shall have the "
8941 "PROTECTED attribute",
8942 &e->where);
8943 break;
8946 /* Shall not equivalence common block variables in a PURE procedure. */
8947 if (sym->ns->proc_name
8948 && sym->ns->proc_name->attr.pure
8949 && sym->attr.in_common)
8951 gfc_error ("Common block member '%s' at %L cannot be an EQUIVALENCE "
8952 "object in the pure procedure '%s'",
8953 sym->name, &e->where, sym->ns->proc_name->name);
8954 break;
8957 /* Shall not be a named constant. */
8958 if (e->expr_type == EXPR_CONSTANT)
8960 gfc_error ("Named constant '%s' at %L cannot be an EQUIVALENCE "
8961 "object", sym->name, &e->where);
8962 continue;
8965 derived = e->ts.derived;
8966 if (derived && resolve_equivalence_derived (derived, sym, e) == FAILURE)
8967 continue;
8969 /* Check that the types correspond correctly:
8970 Note 5.28:
8971 A numeric sequence structure may be equivalenced to another sequence
8972 structure, an object of default integer type, default real type, double
8973 precision real type, default logical type such that components of the
8974 structure ultimately only become associated to objects of the same
8975 kind. A character sequence structure may be equivalenced to an object
8976 of default character kind or another character sequence structure.
8977 Other objects may be equivalenced only to objects of the same type and
8978 kind parameters. */
8980 /* Identical types are unconditionally OK. */
8981 if (object == 1 || gfc_compare_types (last_ts, &sym->ts))
8982 goto identical_types;
8984 last_eq_type = sequence_type (*last_ts);
8985 eq_type = sequence_type (sym->ts);
8987 /* Since the pair of objects is not of the same type, mixed or
8988 non-default sequences can be rejected. */
8990 msg = "Sequence %s with mixed components in EQUIVALENCE "
8991 "statement at %L with different type objects";
8992 if ((object ==2
8993 && last_eq_type == SEQ_MIXED
8994 && gfc_notify_std (GFC_STD_GNU, msg, first_sym->name, last_where)
8995 == FAILURE)
8996 || (eq_type == SEQ_MIXED
8997 && gfc_notify_std (GFC_STD_GNU, msg, sym->name,
8998 &e->where) == FAILURE))
8999 continue;
9001 msg = "Non-default type object or sequence %s in EQUIVALENCE "
9002 "statement at %L with objects of different type";
9003 if ((object ==2
9004 && last_eq_type == SEQ_NONDEFAULT
9005 && gfc_notify_std (GFC_STD_GNU, msg, first_sym->name,
9006 last_where) == FAILURE)
9007 || (eq_type == SEQ_NONDEFAULT
9008 && gfc_notify_std (GFC_STD_GNU, msg, sym->name,
9009 &e->where) == FAILURE))
9010 continue;
9012 msg ="Non-CHARACTER object '%s' in default CHARACTER "
9013 "EQUIVALENCE statement at %L";
9014 if (last_eq_type == SEQ_CHARACTER
9015 && eq_type != SEQ_CHARACTER
9016 && gfc_notify_std (GFC_STD_GNU, msg, sym->name,
9017 &e->where) == FAILURE)
9018 continue;
9020 msg ="Non-NUMERIC object '%s' in default NUMERIC "
9021 "EQUIVALENCE statement at %L";
9022 if (last_eq_type == SEQ_NUMERIC
9023 && eq_type != SEQ_NUMERIC
9024 && gfc_notify_std (GFC_STD_GNU, msg, sym->name,
9025 &e->where) == FAILURE)
9026 continue;
9028 identical_types:
9029 last_ts =&sym->ts;
9030 last_where = &e->where;
9032 if (!e->ref)
9033 continue;
9035 /* Shall not be an automatic array. */
9036 if (e->ref->type == REF_ARRAY
9037 && gfc_resolve_array_spec (e->ref->u.ar.as, 1) == FAILURE)
9039 gfc_error ("Array '%s' at %L with non-constant bounds cannot be "
9040 "an EQUIVALENCE object", sym->name, &e->where);
9041 continue;
9044 r = e->ref;
9045 while (r)
9047 /* Shall not be a structure component. */
9048 if (r->type == REF_COMPONENT)
9050 gfc_error ("Structure component '%s' at %L cannot be an "
9051 "EQUIVALENCE object",
9052 r->u.c.component->name, &e->where);
9053 break;
9056 /* A substring shall not have length zero. */
9057 if (r->type == REF_SUBSTRING)
9059 if (compare_bound (r->u.ss.start, r->u.ss.end) == CMP_GT)
9061 gfc_error ("Substring at %L has length zero",
9062 &r->u.ss.start->where);
9063 break;
9066 r = r->next;
9072 /* Resolve function and ENTRY types, issue diagnostics if needed. */
9074 static void
9075 resolve_fntype (gfc_namespace *ns)
9077 gfc_entry_list *el;
9078 gfc_symbol *sym;
9080 if (ns->proc_name == NULL || !ns->proc_name->attr.function)
9081 return;
9083 /* If there are any entries, ns->proc_name is the entry master
9084 synthetic symbol and ns->entries->sym actual FUNCTION symbol. */
9085 if (ns->entries)
9086 sym = ns->entries->sym;
9087 else
9088 sym = ns->proc_name;
9089 if (sym->result == sym
9090 && sym->ts.type == BT_UNKNOWN
9091 && gfc_set_default_type (sym, 0, NULL) == FAILURE
9092 && !sym->attr.untyped)
9094 gfc_error ("Function '%s' at %L has no IMPLICIT type",
9095 sym->name, &sym->declared_at);
9096 sym->attr.untyped = 1;
9099 if (sym->ts.type == BT_DERIVED && !sym->ts.derived->attr.use_assoc
9100 && !gfc_check_access (sym->ts.derived->attr.access,
9101 sym->ts.derived->ns->default_access)
9102 && gfc_check_access (sym->attr.access, sym->ns->default_access))
9104 gfc_error ("PUBLIC function '%s' at %L cannot be of PRIVATE type '%s'",
9105 sym->name, &sym->declared_at, sym->ts.derived->name);
9108 if (ns->entries)
9109 for (el = ns->entries->next; el; el = el->next)
9111 if (el->sym->result == el->sym
9112 && el->sym->ts.type == BT_UNKNOWN
9113 && gfc_set_default_type (el->sym, 0, NULL) == FAILURE
9114 && !el->sym->attr.untyped)
9116 gfc_error ("ENTRY '%s' at %L has no IMPLICIT type",
9117 el->sym->name, &el->sym->declared_at);
9118 el->sym->attr.untyped = 1;
9123 /* 12.3.2.1.1 Defined operators. */
9125 static void
9126 gfc_resolve_uops (gfc_symtree *symtree)
9128 gfc_interface *itr;
9129 gfc_symbol *sym;
9130 gfc_formal_arglist *formal;
9132 if (symtree == NULL)
9133 return;
9135 gfc_resolve_uops (symtree->left);
9136 gfc_resolve_uops (symtree->right);
9138 for (itr = symtree->n.uop->operator; itr; itr = itr->next)
9140 sym = itr->sym;
9141 if (!sym->attr.function)
9142 gfc_error ("User operator procedure '%s' at %L must be a FUNCTION",
9143 sym->name, &sym->declared_at);
9145 if (sym->ts.type == BT_CHARACTER
9146 && !(sym->ts.cl && sym->ts.cl->length)
9147 && !(sym->result && sym->result->ts.cl
9148 && sym->result->ts.cl->length))
9149 gfc_error ("User operator procedure '%s' at %L cannot be assumed "
9150 "character length", sym->name, &sym->declared_at);
9152 formal = sym->formal;
9153 if (!formal || !formal->sym)
9155 gfc_error ("User operator procedure '%s' at %L must have at least "
9156 "one argument", sym->name, &sym->declared_at);
9157 continue;
9160 if (formal->sym->attr.intent != INTENT_IN)
9161 gfc_error ("First argument of operator interface at %L must be "
9162 "INTENT(IN)", &sym->declared_at);
9164 if (formal->sym->attr.optional)
9165 gfc_error ("First argument of operator interface at %L cannot be "
9166 "optional", &sym->declared_at);
9168 formal = formal->next;
9169 if (!formal || !formal->sym)
9170 continue;
9172 if (formal->sym->attr.intent != INTENT_IN)
9173 gfc_error ("Second argument of operator interface at %L must be "
9174 "INTENT(IN)", &sym->declared_at);
9176 if (formal->sym->attr.optional)
9177 gfc_error ("Second argument of operator interface at %L cannot be "
9178 "optional", &sym->declared_at);
9180 if (formal->next)
9181 gfc_error ("Operator interface at %L must have, at most, two "
9182 "arguments", &sym->declared_at);
9187 /* Examine all of the expressions associated with a program unit,
9188 assign types to all intermediate expressions, make sure that all
9189 assignments are to compatible types and figure out which names
9190 refer to which functions or subroutines. It doesn't check code
9191 block, which is handled by resolve_code. */
9193 static void
9194 resolve_types (gfc_namespace *ns)
9196 gfc_namespace *n;
9197 gfc_charlen *cl;
9198 gfc_data *d;
9199 gfc_equiv *eq;
9201 gfc_current_ns = ns;
9203 resolve_entries (ns);
9205 resolve_common_vars (ns->blank_common.head, false);
9206 resolve_common_blocks (ns->common_root);
9208 resolve_contained_functions (ns);
9210 gfc_traverse_ns (ns, resolve_bind_c_derived_types);
9212 for (cl = ns->cl_list; cl; cl = cl->next)
9213 resolve_charlen (cl);
9215 gfc_traverse_ns (ns, resolve_symbol);
9217 resolve_fntype (ns);
9219 for (n = ns->contained; n; n = n->sibling)
9221 if (gfc_pure (ns->proc_name) && !gfc_pure (n->proc_name))
9222 gfc_error ("Contained procedure '%s' at %L of a PURE procedure must "
9223 "also be PURE", n->proc_name->name,
9224 &n->proc_name->declared_at);
9226 resolve_types (n);
9229 forall_flag = 0;
9230 gfc_check_interfaces (ns);
9232 gfc_traverse_ns (ns, resolve_values);
9234 if (ns->save_all)
9235 gfc_save_all (ns);
9237 iter_stack = NULL;
9238 for (d = ns->data; d; d = d->next)
9239 resolve_data (d);
9241 iter_stack = NULL;
9242 gfc_traverse_ns (ns, gfc_formalize_init_value);
9244 gfc_traverse_ns (ns, gfc_verify_binding_labels);
9246 if (ns->common_root != NULL)
9247 gfc_traverse_symtree (ns->common_root, resolve_bind_c_comms);
9249 for (eq = ns->equiv; eq; eq = eq->next)
9250 resolve_equivalence (eq);
9252 /* Warn about unused labels. */
9253 if (warn_unused_label)
9254 warn_unused_fortran_label (ns->st_labels);
9256 gfc_resolve_uops (ns->uop_root);
9260 /* Call resolve_code recursively. */
9262 static void
9263 resolve_codes (gfc_namespace *ns)
9265 gfc_namespace *n;
9267 for (n = ns->contained; n; n = n->sibling)
9268 resolve_codes (n);
9270 gfc_current_ns = ns;
9271 cs_base = NULL;
9272 /* Set to an out of range value. */
9273 current_entry_id = -1;
9275 bitmap_obstack_initialize (&labels_obstack);
9276 resolve_code (ns->code, ns);
9277 bitmap_obstack_release (&labels_obstack);
9281 /* This function is called after a complete program unit has been compiled.
9282 Its purpose is to examine all of the expressions associated with a program
9283 unit, assign types to all intermediate expressions, make sure that all
9284 assignments are to compatible types and figure out which names refer to
9285 which functions or subroutines. */
9287 void
9288 gfc_resolve (gfc_namespace *ns)
9290 gfc_namespace *old_ns;
9292 old_ns = gfc_current_ns;
9294 resolve_types (ns);
9295 resolve_codes (ns);
9297 gfc_current_ns = old_ns;