1 /* Deal with interfaces.
2 Copyright (C) 2000, 2001, 2002, 2004, 2005, 2006, 2007, 2008, 2009,
4 Free Software Foundation, Inc.
5 Contributed by Andy Vaught
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* Deal with interfaces. An explicit interface is represented as a
25 singly linked list of formal argument structures attached to the
26 relevant symbols. For an implicit interface, the arguments don't
27 point to symbols. Explicit interfaces point to namespaces that
28 contain the symbols within that interface.
30 Implicit interfaces are linked together in a singly linked list
31 along the next_if member of symbol nodes. Since a particular
32 symbol can only have a single explicit interface, the symbol cannot
33 be part of multiple lists and a single next-member suffices.
35 This is not the case for general classes, though. An operator
36 definition is independent of just about all other uses and has it's
40 Nameless interfaces create symbols with explicit interfaces within
41 the current namespace. They are otherwise unlinked.
44 The generic name points to a linked list of symbols. Each symbol
45 has an explicit interface. Each explicit interface has its own
46 namespace containing the arguments. Module procedures are symbols in
47 which the interface is added later when the module procedure is parsed.
50 User-defined operators are stored in a their own set of symtrees
51 separate from regular symbols. The symtrees point to gfc_user_op
52 structures which in turn head up a list of relevant interfaces.
54 Extended intrinsics and assignment:
55 The head of these interface lists are stored in the containing namespace.
58 An implicit interface is represented as a singly linked list of
59 formal argument list structures that don't point to any symbol
60 nodes -- they just contain types.
63 When a subprogram is defined, the program unit's name points to an
64 interface as usual, but the link to the namespace is NULL and the
65 formal argument list points to symbols within the same namespace as
66 the program unit name. */
73 /* The current_interface structure holds information about the
74 interface currently being parsed. This structure is saved and
75 restored during recursive interfaces. */
77 gfc_interface_info current_interface;
80 /* Free a singly linked list of gfc_interface structures. */
83 gfc_free_interface (gfc_interface *intr)
87 for (; intr; intr = next)
95 /* Change the operators unary plus and minus into binary plus and
96 minus respectively, leaving the rest unchanged. */
98 static gfc_intrinsic_op
99 fold_unary_intrinsic (gfc_intrinsic_op op)
103 case INTRINSIC_UPLUS:
106 case INTRINSIC_UMINUS:
107 op = INTRINSIC_MINUS;
117 /* Match a generic specification. Depending on which type of
118 interface is found, the 'name' or 'op' pointers may be set.
119 This subroutine doesn't return MATCH_NO. */
122 gfc_match_generic_spec (interface_type *type,
124 gfc_intrinsic_op *op)
126 char buffer[GFC_MAX_SYMBOL_LEN + 1];
130 if (gfc_match (" assignment ( = )") == MATCH_YES)
132 *type = INTERFACE_INTRINSIC_OP;
133 *op = INTRINSIC_ASSIGN;
137 if (gfc_match (" operator ( %o )", &i) == MATCH_YES)
139 *type = INTERFACE_INTRINSIC_OP;
140 *op = fold_unary_intrinsic (i);
144 *op = INTRINSIC_NONE;
145 if (gfc_match (" operator ( ") == MATCH_YES)
147 m = gfc_match_defined_op_name (buffer, 1);
153 m = gfc_match_char (')');
159 strcpy (name, buffer);
160 *type = INTERFACE_USER_OP;
164 if (gfc_match_name (buffer) == MATCH_YES)
166 strcpy (name, buffer);
167 *type = INTERFACE_GENERIC;
171 *type = INTERFACE_NAMELESS;
175 gfc_error ("Syntax error in generic specification at %C");
180 /* Match one of the five F95 forms of an interface statement. The
181 matcher for the abstract interface follows. */
184 gfc_match_interface (void)
186 char name[GFC_MAX_SYMBOL_LEN + 1];
192 m = gfc_match_space ();
194 if (gfc_match_generic_spec (&type, name, &op) == MATCH_ERROR)
197 /* If we're not looking at the end of the statement now, or if this
198 is not a nameless interface but we did not see a space, punt. */
199 if (gfc_match_eos () != MATCH_YES
200 || (type != INTERFACE_NAMELESS && m != MATCH_YES))
202 gfc_error ("Syntax error: Trailing garbage in INTERFACE statement "
207 current_interface.type = type;
211 case INTERFACE_GENERIC:
212 if (gfc_get_symbol (name, NULL, &sym))
215 if (!sym->attr.generic
216 && gfc_add_generic (&sym->attr, sym->name, NULL) == FAILURE)
221 gfc_error ("Dummy procedure '%s' at %C cannot have a "
222 "generic interface", sym->name);
226 current_interface.sym = gfc_new_block = sym;
229 case INTERFACE_USER_OP:
230 current_interface.uop = gfc_get_uop (name);
233 case INTERFACE_INTRINSIC_OP:
234 current_interface.op = op;
237 case INTERFACE_NAMELESS:
238 case INTERFACE_ABSTRACT:
247 /* Match a F2003 abstract interface. */
250 gfc_match_abstract_interface (void)
254 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: ABSTRACT INTERFACE at %C")
258 m = gfc_match_eos ();
262 gfc_error ("Syntax error in ABSTRACT INTERFACE statement at %C");
266 current_interface.type = INTERFACE_ABSTRACT;
272 /* Match the different sort of generic-specs that can be present after
273 the END INTERFACE itself. */
276 gfc_match_end_interface (void)
278 char name[GFC_MAX_SYMBOL_LEN + 1];
283 m = gfc_match_space ();
285 if (gfc_match_generic_spec (&type, name, &op) == MATCH_ERROR)
288 /* If we're not looking at the end of the statement now, or if this
289 is not a nameless interface but we did not see a space, punt. */
290 if (gfc_match_eos () != MATCH_YES
291 || (type != INTERFACE_NAMELESS && m != MATCH_YES))
293 gfc_error ("Syntax error: Trailing garbage in END INTERFACE "
300 switch (current_interface.type)
302 case INTERFACE_NAMELESS:
303 case INTERFACE_ABSTRACT:
304 if (type != INTERFACE_NAMELESS)
306 gfc_error ("Expected a nameless interface at %C");
312 case INTERFACE_INTRINSIC_OP:
313 if (type != current_interface.type || op != current_interface.op)
316 if (current_interface.op == INTRINSIC_ASSIGN)
317 gfc_error ("Expected 'END INTERFACE ASSIGNMENT (=)' at %C");
319 gfc_error ("Expecting 'END INTERFACE OPERATOR (%s)' at %C",
320 gfc_op2string (current_interface.op));
327 case INTERFACE_USER_OP:
328 /* Comparing the symbol node names is OK because only use-associated
329 symbols can be renamed. */
330 if (type != current_interface.type
331 || strcmp (current_interface.uop->name, name) != 0)
333 gfc_error ("Expecting 'END INTERFACE OPERATOR (.%s.)' at %C",
334 current_interface.uop->name);
340 case INTERFACE_GENERIC:
341 if (type != current_interface.type
342 || strcmp (current_interface.sym->name, name) != 0)
344 gfc_error ("Expecting 'END INTERFACE %s' at %C",
345 current_interface.sym->name);
356 /* Compare two derived types using the criteria in 4.4.2 of the standard,
357 recursing through gfc_compare_types for the components. */
360 gfc_compare_derived_types (gfc_symbol *derived1, gfc_symbol *derived2)
362 gfc_component *dt1, *dt2;
364 if (derived1 == derived2)
367 /* Special case for comparing derived types across namespaces. If the
368 true names and module names are the same and the module name is
369 nonnull, then they are equal. */
370 if (derived1 != NULL && derived2 != NULL
371 && strcmp (derived1->name, derived2->name) == 0
372 && derived1->module != NULL && derived2->module != NULL
373 && strcmp (derived1->module, derived2->module) == 0)
376 /* Compare type via the rules of the standard. Both types must have
377 the SEQUENCE attribute to be equal. */
379 if (strcmp (derived1->name, derived2->name))
382 if (derived1->component_access == ACCESS_PRIVATE
383 || derived2->component_access == ACCESS_PRIVATE)
386 if (derived1->attr.sequence == 0 || derived2->attr.sequence == 0)
389 dt1 = derived1->components;
390 dt2 = derived2->components;
392 /* Since subtypes of SEQUENCE types must be SEQUENCE types as well, a
393 simple test can speed things up. Otherwise, lots of things have to
397 if (strcmp (dt1->name, dt2->name) != 0)
400 if (dt1->attr.access != dt2->attr.access)
403 if (dt1->attr.pointer != dt2->attr.pointer)
406 if (dt1->attr.dimension != dt2->attr.dimension)
409 if (dt1->attr.allocatable != dt2->attr.allocatable)
412 if (dt1->attr.dimension && gfc_compare_array_spec (dt1->as, dt2->as) == 0)
415 /* Make sure that link lists do not put this function into an
416 endless recursive loop! */
417 if (!(dt1->ts.type == BT_DERIVED && derived1 == dt1->ts.u.derived)
418 && !(dt1->ts.type == BT_DERIVED && derived1 == dt1->ts.u.derived)
419 && gfc_compare_types (&dt1->ts, &dt2->ts) == 0)
422 else if ((dt1->ts.type == BT_DERIVED && derived1 == dt1->ts.u.derived)
423 && !(dt1->ts.type == BT_DERIVED && derived1 == dt1->ts.u.derived))
426 else if (!(dt1->ts.type == BT_DERIVED && derived1 == dt1->ts.u.derived)
427 && (dt1->ts.type == BT_DERIVED && derived1 == dt1->ts.u.derived))
433 if (dt1 == NULL && dt2 == NULL)
435 if (dt1 == NULL || dt2 == NULL)
443 /* Compare two typespecs, recursively if necessary. */
446 gfc_compare_types (gfc_typespec *ts1, gfc_typespec *ts2)
448 /* See if one of the typespecs is a BT_VOID, which is what is being used
449 to allow the funcs like c_f_pointer to accept any pointer type.
450 TODO: Possibly should narrow this to just the one typespec coming in
451 that is for the formal arg, but oh well. */
452 if (ts1->type == BT_VOID || ts2->type == BT_VOID)
455 if (ts1->type != ts2->type
456 && ((ts1->type != BT_DERIVED && ts1->type != BT_CLASS)
457 || (ts2->type != BT_DERIVED && ts2->type != BT_CLASS)))
459 if (ts1->type != BT_DERIVED && ts1->type != BT_CLASS)
460 return (ts1->kind == ts2->kind);
462 /* Compare derived types. */
463 if (gfc_type_compatible (ts1, ts2))
466 return gfc_compare_derived_types (ts1->u.derived ,ts2->u.derived);
470 /* Given two symbols that are formal arguments, compare their ranks
471 and types. Returns nonzero if they have the same rank and type,
475 compare_type_rank (gfc_symbol *s1, gfc_symbol *s2)
479 r1 = (s1->as != NULL) ? s1->as->rank : 0;
480 r2 = (s2->as != NULL) ? s2->as->rank : 0;
483 return 0; /* Ranks differ. */
485 return gfc_compare_types (&s1->ts, &s2->ts);
489 /* Given two symbols that are formal arguments, compare their types
490 and rank and their formal interfaces if they are both dummy
491 procedures. Returns nonzero if the same, zero if different. */
494 compare_type_rank_if (gfc_symbol *s1, gfc_symbol *s2)
496 if (s1 == NULL || s2 == NULL)
497 return s1 == s2 ? 1 : 0;
502 if (s1->attr.flavor != FL_PROCEDURE && s2->attr.flavor != FL_PROCEDURE)
503 return compare_type_rank (s1, s2);
505 if (s1->attr.flavor != FL_PROCEDURE || s2->attr.flavor != FL_PROCEDURE)
508 /* At this point, both symbols are procedures. It can happen that
509 external procedures are compared, where one is identified by usage
510 to be a function or subroutine but the other is not. Check TKR
511 nonetheless for these cases. */
512 if (s1->attr.function == 0 && s1->attr.subroutine == 0)
513 return s1->attr.external == 1 ? compare_type_rank (s1, s2) : 0;
515 if (s2->attr.function == 0 && s2->attr.subroutine == 0)
516 return s2->attr.external == 1 ? compare_type_rank (s1, s2) : 0;
518 /* Now the type of procedure has been identified. */
519 if (s1->attr.function != s2->attr.function
520 || s1->attr.subroutine != s2->attr.subroutine)
523 if (s1->attr.function && compare_type_rank (s1, s2) == 0)
526 /* Originally, gfortran recursed here to check the interfaces of passed
527 procedures. This is explicitly not required by the standard. */
532 /* Given a formal argument list and a keyword name, search the list
533 for that keyword. Returns the correct symbol node if found, NULL
537 find_keyword_arg (const char *name, gfc_formal_arglist *f)
539 for (; f; f = f->next)
540 if (strcmp (f->sym->name, name) == 0)
547 /******** Interface checking subroutines **********/
550 /* Given an operator interface and the operator, make sure that all
551 interfaces for that operator are legal. */
554 gfc_check_operator_interface (gfc_symbol *sym, gfc_intrinsic_op op,
557 gfc_formal_arglist *formal;
560 int args, r1, r2, k1, k2;
565 t1 = t2 = BT_UNKNOWN;
566 i1 = i2 = INTENT_UNKNOWN;
570 for (formal = sym->formal; formal; formal = formal->next)
572 gfc_symbol *fsym = formal->sym;
575 gfc_error ("Alternate return cannot appear in operator "
576 "interface at %L", &sym->declared_at);
582 i1 = fsym->attr.intent;
583 r1 = (fsym->as != NULL) ? fsym->as->rank : 0;
589 i2 = fsym->attr.intent;
590 r2 = (fsym->as != NULL) ? fsym->as->rank : 0;
596 /* Only +, - and .not. can be unary operators.
597 .not. cannot be a binary operator. */
598 if (args == 0 || args > 2 || (args == 1 && op != INTRINSIC_PLUS
599 && op != INTRINSIC_MINUS
600 && op != INTRINSIC_NOT)
601 || (args == 2 && op == INTRINSIC_NOT))
603 gfc_error ("Operator interface at %L has the wrong number of arguments",
608 /* Check that intrinsics are mapped to functions, except
609 INTRINSIC_ASSIGN which should map to a subroutine. */
610 if (op == INTRINSIC_ASSIGN)
612 if (!sym->attr.subroutine)
614 gfc_error ("Assignment operator interface at %L must be "
615 "a SUBROUTINE", &sym->declared_at);
620 gfc_error ("Assignment operator interface at %L must have "
621 "two arguments", &sym->declared_at);
625 /* Allowed are (per F2003, 12.3.2.1.2 Defined assignments):
626 - First argument an array with different rank than second,
627 - Types and kinds do not conform, and
628 - First argument is of derived type. */
629 if (sym->formal->sym->ts.type != BT_DERIVED
630 && sym->formal->sym->ts.type != BT_CLASS
631 && (r1 == 0 || r1 == r2)
632 && (sym->formal->sym->ts.type == sym->formal->next->sym->ts.type
633 || (gfc_numeric_ts (&sym->formal->sym->ts)
634 && gfc_numeric_ts (&sym->formal->next->sym->ts))))
636 gfc_error ("Assignment operator interface at %L must not redefine "
637 "an INTRINSIC type assignment", &sym->declared_at);
643 if (!sym->attr.function)
645 gfc_error ("Intrinsic operator interface at %L must be a FUNCTION",
651 /* Check intents on operator interfaces. */
652 if (op == INTRINSIC_ASSIGN)
654 if (i1 != INTENT_OUT && i1 != INTENT_INOUT)
656 gfc_error ("First argument of defined assignment at %L must be "
657 "INTENT(OUT) or INTENT(INOUT)", &sym->declared_at);
663 gfc_error ("Second argument of defined assignment at %L must be "
664 "INTENT(IN)", &sym->declared_at);
672 gfc_error ("First argument of operator interface at %L must be "
673 "INTENT(IN)", &sym->declared_at);
677 if (args == 2 && i2 != INTENT_IN)
679 gfc_error ("Second argument of operator interface at %L must be "
680 "INTENT(IN)", &sym->declared_at);
685 /* From now on, all we have to do is check that the operator definition
686 doesn't conflict with an intrinsic operator. The rules for this
687 game are defined in 7.1.2 and 7.1.3 of both F95 and F2003 standards,
688 as well as 12.3.2.1.1 of Fortran 2003:
690 "If the operator is an intrinsic-operator (R310), the number of
691 function arguments shall be consistent with the intrinsic uses of
692 that operator, and the types, kind type parameters, or ranks of the
693 dummy arguments shall differ from those required for the intrinsic
694 operation (7.1.2)." */
696 #define IS_NUMERIC_TYPE(t) \
697 ((t) == BT_INTEGER || (t) == BT_REAL || (t) == BT_COMPLEX)
699 /* Unary ops are easy, do them first. */
700 if (op == INTRINSIC_NOT)
702 if (t1 == BT_LOGICAL)
708 if (args == 1 && (op == INTRINSIC_PLUS || op == INTRINSIC_MINUS))
710 if (IS_NUMERIC_TYPE (t1))
716 /* Character intrinsic operators have same character kind, thus
717 operator definitions with operands of different character kinds
719 if (t1 == BT_CHARACTER && t2 == BT_CHARACTER && k1 != k2)
722 /* Intrinsic operators always perform on arguments of same rank,
723 so different ranks is also always safe. (rank == 0) is an exception
724 to that, because all intrinsic operators are elemental. */
725 if (r1 != r2 && r1 != 0 && r2 != 0)
731 case INTRINSIC_EQ_OS:
733 case INTRINSIC_NE_OS:
734 if (t1 == BT_CHARACTER && t2 == BT_CHARACTER)
739 case INTRINSIC_MINUS:
740 case INTRINSIC_TIMES:
741 case INTRINSIC_DIVIDE:
742 case INTRINSIC_POWER:
743 if (IS_NUMERIC_TYPE (t1) && IS_NUMERIC_TYPE (t2))
748 case INTRINSIC_GT_OS:
750 case INTRINSIC_GE_OS:
752 case INTRINSIC_LT_OS:
754 case INTRINSIC_LE_OS:
755 if (t1 == BT_CHARACTER && t2 == BT_CHARACTER)
757 if ((t1 == BT_INTEGER || t1 == BT_REAL)
758 && (t2 == BT_INTEGER || t2 == BT_REAL))
762 case INTRINSIC_CONCAT:
763 if (t1 == BT_CHARACTER && t2 == BT_CHARACTER)
771 if (t1 == BT_LOGICAL && t2 == BT_LOGICAL)
781 #undef IS_NUMERIC_TYPE
784 gfc_error ("Operator interface at %L conflicts with intrinsic interface",
790 /* Given a pair of formal argument lists, we see if the two lists can
791 be distinguished by counting the number of nonoptional arguments of
792 a given type/rank in f1 and seeing if there are less then that
793 number of those arguments in f2 (including optional arguments).
794 Since this test is asymmetric, it has to be called twice to make it
795 symmetric. Returns nonzero if the argument lists are incompatible
796 by this test. This subroutine implements rule 1 of section
797 14.1.2.3 in the Fortran 95 standard. */
800 count_types_test (gfc_formal_arglist *f1, gfc_formal_arglist *f2)
802 int rc, ac1, ac2, i, j, k, n1;
803 gfc_formal_arglist *f;
816 for (f = f1; f; f = f->next)
819 /* Build an array of integers that gives the same integer to
820 arguments of the same type/rank. */
821 arg = XCNEWVEC (arginfo, n1);
824 for (i = 0; i < n1; i++, f = f->next)
832 for (i = 0; i < n1; i++)
834 if (arg[i].flag != -1)
837 if (arg[i].sym && arg[i].sym->attr.optional)
838 continue; /* Skip optional arguments. */
842 /* Find other nonoptional arguments of the same type/rank. */
843 for (j = i + 1; j < n1; j++)
844 if ((arg[j].sym == NULL || !arg[j].sym->attr.optional)
845 && compare_type_rank_if (arg[i].sym, arg[j].sym))
851 /* Now loop over each distinct type found in f1. */
855 for (i = 0; i < n1; i++)
857 if (arg[i].flag != k)
861 for (j = i + 1; j < n1; j++)
862 if (arg[j].flag == k)
865 /* Count the number of arguments in f2 with that type, including
866 those that are optional. */
869 for (f = f2; f; f = f->next)
870 if (compare_type_rank_if (arg[i].sym, f->sym))
888 /* Perform the correspondence test in rule 2 of section 14.1.2.3.
889 Returns zero if no argument is found that satisfies rule 2, nonzero
892 This test is also not symmetric in f1 and f2 and must be called
893 twice. This test finds problems caused by sorting the actual
894 argument list with keywords. For example:
898 INTEGER :: A ; REAL :: B
902 INTEGER :: A ; REAL :: B
906 At this point, 'CALL FOO(A=1, B=1.0)' is ambiguous. */
909 generic_correspondence (gfc_formal_arglist *f1, gfc_formal_arglist *f2)
911 gfc_formal_arglist *f2_save, *g;
918 if (f1->sym->attr.optional)
921 if (f2 != NULL && compare_type_rank (f1->sym, f2->sym))
924 /* Now search for a disambiguating keyword argument starting at
925 the current non-match. */
926 for (g = f1; g; g = g->next)
928 if (g->sym->attr.optional)
931 sym = find_keyword_arg (g->sym->name, f2_save);
932 if (sym == NULL || !compare_type_rank (g->sym, sym))
946 /* 'Compare' two formal interfaces associated with a pair of symbols.
947 We return nonzero if there exists an actual argument list that
948 would be ambiguous between the two interfaces, zero otherwise.
949 'intent_flag' specifies whether INTENT and OPTIONAL of the arguments are
950 required to match, which is not the case for ambiguity checks.*/
953 gfc_compare_interfaces (gfc_symbol *s1, gfc_symbol *s2, const char *name2,
954 int generic_flag, int intent_flag,
955 char *errmsg, int err_len)
957 gfc_formal_arglist *f1, *f2;
959 gcc_assert (name2 != NULL);
961 if (s1->attr.function && (s2->attr.subroutine
962 || (!s2->attr.function && s2->ts.type == BT_UNKNOWN
963 && gfc_get_default_type (name2, s2->ns)->type == BT_UNKNOWN)))
966 snprintf (errmsg, err_len, "'%s' is not a function", name2);
970 if (s1->attr.subroutine && s2->attr.function)
973 snprintf (errmsg, err_len, "'%s' is not a subroutine", name2);
977 /* If the arguments are functions, check type and kind
978 (only for dummy procedures and procedure pointer assignments). */
979 if (!generic_flag && intent_flag && s1->attr.function && s2->attr.function)
981 if (s1->ts.type == BT_UNKNOWN)
983 if ((s1->ts.type != s2->ts.type) || (s1->ts.kind != s2->ts.kind))
986 snprintf (errmsg, err_len, "Type/kind mismatch in return value "
992 if (s1->attr.if_source == IFSRC_UNKNOWN
993 || s2->attr.if_source == IFSRC_UNKNOWN)
999 if (f1 == NULL && f2 == NULL)
1000 return 1; /* Special case: No arguments. */
1004 if (count_types_test (f1, f2) || count_types_test (f2, f1))
1006 if (generic_correspondence (f1, f2) || generic_correspondence (f2, f1))
1010 /* Perform the abbreviated correspondence test for operators (the
1011 arguments cannot be optional and are always ordered correctly).
1012 This is also done when comparing interfaces for dummy procedures and in
1013 procedure pointer assignments. */
1017 /* Check existence. */
1018 if (f1 == NULL && f2 == NULL)
1020 if (f1 == NULL || f2 == NULL)
1023 snprintf (errmsg, err_len, "'%s' has the wrong number of "
1024 "arguments", name2);
1028 /* Check type and rank. */
1029 if (!compare_type_rank (f1->sym, f2->sym))
1032 snprintf (errmsg, err_len, "Type/rank mismatch in argument '%s'",
1038 if (intent_flag && (f1->sym->attr.intent != f2->sym->attr.intent))
1040 snprintf (errmsg, err_len, "INTENT mismatch in argument '%s'",
1045 /* Check OPTIONAL. */
1046 if (intent_flag && (f1->sym->attr.optional != f2->sym->attr.optional))
1048 snprintf (errmsg, err_len, "OPTIONAL mismatch in argument '%s'",
1061 /* Given a pointer to an interface pointer, remove duplicate
1062 interfaces and make sure that all symbols are either functions or
1063 subroutines. Returns nonzero if something goes wrong. */
1066 check_interface0 (gfc_interface *p, const char *interface_name)
1068 gfc_interface *psave, *q, *qlast;
1071 /* Make sure all symbols in the interface have been defined as
1072 functions or subroutines. */
1073 for (; p; p = p->next)
1074 if ((!p->sym->attr.function && !p->sym->attr.subroutine)
1075 || !p->sym->attr.if_source)
1077 if (p->sym->attr.external)
1078 gfc_error ("Procedure '%s' in %s at %L has no explicit interface",
1079 p->sym->name, interface_name, &p->sym->declared_at);
1081 gfc_error ("Procedure '%s' in %s at %L is neither function nor "
1082 "subroutine", p->sym->name, interface_name,
1083 &p->sym->declared_at);
1088 /* Remove duplicate interfaces in this interface list. */
1089 for (; p; p = p->next)
1093 for (q = p->next; q;)
1095 if (p->sym != q->sym)
1102 /* Duplicate interface. */
1103 qlast->next = q->next;
1114 /* Check lists of interfaces to make sure that no two interfaces are
1115 ambiguous. Duplicate interfaces (from the same symbol) are OK here. */
1118 check_interface1 (gfc_interface *p, gfc_interface *q0,
1119 int generic_flag, const char *interface_name,
1123 for (; p; p = p->next)
1124 for (q = q0; q; q = q->next)
1126 if (p->sym == q->sym)
1127 continue; /* Duplicates OK here. */
1129 if (p->sym->name == q->sym->name && p->sym->module == q->sym->module)
1132 if (gfc_compare_interfaces (p->sym, q->sym, q->sym->name, generic_flag,
1136 gfc_error ("Ambiguous interfaces '%s' and '%s' in %s at %L",
1137 p->sym->name, q->sym->name, interface_name,
1139 else if (!p->sym->attr.use_assoc && q->sym->attr.use_assoc)
1140 gfc_warning ("Ambiguous interfaces '%s' and '%s' in %s at %L",
1141 p->sym->name, q->sym->name, interface_name,
1144 gfc_warning ("Although not referenced, '%s' has ambiguous "
1145 "interfaces at %L", interface_name, &p->where);
1153 /* Check the generic and operator interfaces of symbols to make sure
1154 that none of the interfaces conflict. The check has to be done
1155 after all of the symbols are actually loaded. */
1158 check_sym_interfaces (gfc_symbol *sym)
1160 char interface_name[100];
1163 if (sym->ns != gfc_current_ns)
1166 if (sym->generic != NULL)
1168 sprintf (interface_name, "generic interface '%s'", sym->name);
1169 if (check_interface0 (sym->generic, interface_name))
1172 for (p = sym->generic; p; p = p->next)
1174 if (p->sym->attr.mod_proc
1175 && (p->sym->attr.if_source != IFSRC_DECL
1176 || p->sym->attr.procedure))
1178 gfc_error ("'%s' at %L is not a module procedure",
1179 p->sym->name, &p->where);
1184 /* Originally, this test was applied to host interfaces too;
1185 this is incorrect since host associated symbols, from any
1186 source, cannot be ambiguous with local symbols. */
1187 check_interface1 (sym->generic, sym->generic, 1, interface_name,
1188 sym->attr.referenced || !sym->attr.use_assoc);
1194 check_uop_interfaces (gfc_user_op *uop)
1196 char interface_name[100];
1200 sprintf (interface_name, "operator interface '%s'", uop->name);
1201 if (check_interface0 (uop->op, interface_name))
1204 for (ns = gfc_current_ns; ns; ns = ns->parent)
1206 uop2 = gfc_find_uop (uop->name, ns);
1210 check_interface1 (uop->op, uop2->op, 0,
1211 interface_name, true);
1216 /* For the namespace, check generic, user operator and intrinsic
1217 operator interfaces for consistency and to remove duplicate
1218 interfaces. We traverse the whole namespace, counting on the fact
1219 that most symbols will not have generic or operator interfaces. */
1222 gfc_check_interfaces (gfc_namespace *ns)
1224 gfc_namespace *old_ns, *ns2;
1225 char interface_name[100];
1228 old_ns = gfc_current_ns;
1229 gfc_current_ns = ns;
1231 gfc_traverse_ns (ns, check_sym_interfaces);
1233 gfc_traverse_user_op (ns, check_uop_interfaces);
1235 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
1237 if (i == INTRINSIC_USER)
1240 if (i == INTRINSIC_ASSIGN)
1241 strcpy (interface_name, "intrinsic assignment operator");
1243 sprintf (interface_name, "intrinsic '%s' operator",
1244 gfc_op2string ((gfc_intrinsic_op) i));
1246 if (check_interface0 (ns->op[i], interface_name))
1250 gfc_check_operator_interface (ns->op[i]->sym, (gfc_intrinsic_op) i,
1253 for (ns2 = ns; ns2; ns2 = ns2->parent)
1255 if (check_interface1 (ns->op[i], ns2->op[i], 0,
1256 interface_name, true))
1262 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_EQ_OS],
1263 0, interface_name, true)) goto done;
1266 case INTRINSIC_EQ_OS:
1267 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_EQ],
1268 0, interface_name, true)) goto done;
1272 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_NE_OS],
1273 0, interface_name, true)) goto done;
1276 case INTRINSIC_NE_OS:
1277 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_NE],
1278 0, interface_name, true)) goto done;
1282 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_GT_OS],
1283 0, interface_name, true)) goto done;
1286 case INTRINSIC_GT_OS:
1287 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_GT],
1288 0, interface_name, true)) goto done;
1292 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_GE_OS],
1293 0, interface_name, true)) goto done;
1296 case INTRINSIC_GE_OS:
1297 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_GE],
1298 0, interface_name, true)) goto done;
1302 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_LT_OS],
1303 0, interface_name, true)) goto done;
1306 case INTRINSIC_LT_OS:
1307 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_LT],
1308 0, interface_name, true)) goto done;
1312 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_LE_OS],
1313 0, interface_name, true)) goto done;
1316 case INTRINSIC_LE_OS:
1317 if (check_interface1 (ns->op[i], ns2->op[INTRINSIC_LE],
1318 0, interface_name, true)) goto done;
1328 gfc_current_ns = old_ns;
1333 symbol_rank (gfc_symbol *sym)
1335 return (sym->as == NULL) ? 0 : sym->as->rank;
1339 /* Given a symbol of a formal argument list and an expression, if the
1340 formal argument is allocatable, check that the actual argument is
1341 allocatable. Returns nonzero if compatible, zero if not compatible. */
1344 compare_allocatable (gfc_symbol *formal, gfc_expr *actual)
1346 symbol_attribute attr;
1348 if (formal->attr.allocatable)
1350 attr = gfc_expr_attr (actual);
1351 if (!attr.allocatable)
1359 /* Given a symbol of a formal argument list and an expression, if the
1360 formal argument is a pointer, see if the actual argument is a
1361 pointer. Returns nonzero if compatible, zero if not compatible. */
1364 compare_pointer (gfc_symbol *formal, gfc_expr *actual)
1366 symbol_attribute attr;
1368 if (formal->attr.pointer)
1370 attr = gfc_expr_attr (actual);
1372 /* Fortran 2008 allows non-pointer actual arguments. */
1373 if (!attr.pointer && attr.target && formal->attr.intent == INTENT_IN)
1384 /* Emit clear error messages for rank mismatch. */
1387 argument_rank_mismatch (const char *name, locus *where,
1388 int rank1, int rank2)
1392 gfc_error ("Rank mismatch in argument '%s' at %L "
1393 "(scalar and rank-%d)", name, where, rank2);
1395 else if (rank2 == 0)
1397 gfc_error ("Rank mismatch in argument '%s' at %L "
1398 "(rank-%d and scalar)", name, where, rank1);
1402 gfc_error ("Rank mismatch in argument '%s' at %L "
1403 "(rank-%d and rank-%d)", name, where, rank1, rank2);
1408 /* Given a symbol of a formal argument list and an expression, see if
1409 the two are compatible as arguments. Returns nonzero if
1410 compatible, zero if not compatible. */
1413 compare_parameter (gfc_symbol *formal, gfc_expr *actual,
1414 int ranks_must_agree, int is_elemental, locus *where)
1419 /* If the formal arg has type BT_VOID, it's to one of the iso_c_binding
1420 procs c_f_pointer or c_f_procpointer, and we need to accept most
1421 pointers the user could give us. This should allow that. */
1422 if (formal->ts.type == BT_VOID)
1425 if (formal->ts.type == BT_DERIVED
1426 && formal->ts.u.derived && formal->ts.u.derived->ts.is_iso_c
1427 && actual->ts.type == BT_DERIVED
1428 && actual->ts.u.derived && actual->ts.u.derived->ts.is_iso_c)
1431 if (formal->ts.type == BT_CLASS)
1432 /* Make sure the vtab symbol is present when
1433 the module variables are generated. */
1434 gfc_find_derived_vtab (formal->ts.u.derived);
1436 if (actual->ts.type == BT_PROCEDURE)
1439 gfc_symbol *act_sym = actual->symtree->n.sym;
1441 if (formal->attr.flavor != FL_PROCEDURE)
1444 gfc_error ("Invalid procedure argument at %L", &actual->where);
1448 if (!gfc_compare_interfaces (formal, act_sym, act_sym->name, 0, 1, err,
1452 gfc_error ("Interface mismatch in dummy procedure '%s' at %L: %s",
1453 formal->name, &actual->where, err);
1457 if (formal->attr.function && !act_sym->attr.function)
1459 gfc_add_function (&act_sym->attr, act_sym->name,
1460 &act_sym->declared_at);
1461 if (act_sym->ts.type == BT_UNKNOWN
1462 && gfc_set_default_type (act_sym, 1, act_sym->ns) == FAILURE)
1465 else if (formal->attr.subroutine && !act_sym->attr.subroutine)
1466 gfc_add_subroutine (&act_sym->attr, act_sym->name,
1467 &act_sym->declared_at);
1473 if (formal->attr.pointer && formal->attr.contiguous
1474 && !gfc_is_simply_contiguous (actual, true))
1477 gfc_error ("Actual argument to contiguous pointer dummy '%s' at %L "
1478 "must be simply contigous", formal->name, &actual->where);
1482 if ((actual->expr_type != EXPR_NULL || actual->ts.type != BT_UNKNOWN)
1483 && actual->ts.type != BT_HOLLERITH
1484 && !gfc_compare_types (&formal->ts, &actual->ts))
1487 gfc_error ("Type mismatch in argument '%s' at %L; passed %s to %s",
1488 formal->name, &actual->where, gfc_typename (&actual->ts),
1489 gfc_typename (&formal->ts));
1493 if (formal->attr.codimension)
1495 gfc_ref *last = NULL;
1497 if (actual->expr_type != EXPR_VARIABLE
1498 || (actual->ref == NULL
1499 && !actual->symtree->n.sym->attr.codimension))
1502 gfc_error ("Actual argument to '%s' at %L must be a coarray",
1503 formal->name, &actual->where);
1507 for (ref = actual->ref; ref; ref = ref->next)
1509 if (ref->type == REF_ARRAY && ref->u.ar.codimen != 0)
1512 gfc_error ("Actual argument to '%s' at %L must be a coarray "
1513 "and not coindexed", formal->name, &ref->u.ar.where);
1516 if (ref->type == REF_ARRAY && ref->u.ar.as->corank
1517 && ref->u.ar.type != AR_FULL && ref->u.ar.dimen != 0)
1520 gfc_error ("Actual argument to '%s' at %L must be a coarray "
1521 "and thus shall not have an array designator",
1522 formal->name, &ref->u.ar.where);
1525 if (ref->type == REF_COMPONENT)
1529 if (last && !last->u.c.component->attr.codimension)
1532 gfc_error ("Actual argument to '%s' at %L must be a coarray",
1533 formal->name, &actual->where);
1537 /* F2008, 12.5.2.6. */
1538 if (formal->attr.allocatable &&
1539 ((last && last->u.c.component->as->corank != formal->as->corank)
1541 && actual->symtree->n.sym->as->corank != formal->as->corank)))
1544 gfc_error ("Corank mismatch in argument '%s' at %L (%d and %d)",
1545 formal->name, &actual->where, formal->as->corank,
1546 last ? last->u.c.component->as->corank
1547 : actual->symtree->n.sym->as->corank);
1551 /* F2008, 12.5.2.8. */
1552 if (formal->attr.dimension
1553 && (formal->attr.contiguous || formal->as->type != AS_ASSUMED_SHAPE)
1554 && !gfc_is_simply_contiguous (actual, true))
1557 gfc_error ("Actual argument to '%s' at %L must be simply "
1558 "contiguous", formal->name, &actual->where);
1563 /* F2008, C1239/C1240. */
1564 if (actual->expr_type == EXPR_VARIABLE
1565 && (actual->symtree->n.sym->attr.asynchronous
1566 || actual->symtree->n.sym->attr.volatile_)
1567 && (formal->attr.asynchronous || formal->attr.volatile_)
1568 && actual->rank && !gfc_is_simply_contiguous (actual, true)
1569 && ((formal->as->type != AS_ASSUMED_SHAPE && !formal->attr.pointer)
1570 || formal->attr.contiguous))
1573 gfc_error ("Dummy argument '%s' has to be a pointer or assumed-shape "
1574 "array without CONTIGUOUS attribute - as actual argument at"
1575 " %L is not simply contiguous and both are ASYNCHRONOUS "
1576 "or VOLATILE", formal->name, &actual->where);
1580 if (symbol_rank (formal) == actual->rank)
1583 rank_check = where != NULL && !is_elemental && formal->as
1584 && (formal->as->type == AS_ASSUMED_SHAPE
1585 || formal->as->type == AS_DEFERRED)
1586 && actual->expr_type != EXPR_NULL;
1588 /* Scalar & coindexed, see: F2008, Section 12.5.2.4. */
1589 if (rank_check || ranks_must_agree
1590 || (formal->attr.pointer && actual->expr_type != EXPR_NULL)
1591 || (actual->rank != 0 && !(is_elemental || formal->attr.dimension))
1592 || (actual->rank == 0 && formal->as->type == AS_ASSUMED_SHAPE)
1593 || (actual->rank == 0 && formal->attr.dimension
1594 && gfc_is_coindexed (actual)))
1597 argument_rank_mismatch (formal->name, &actual->where,
1598 symbol_rank (formal), actual->rank);
1601 else if (actual->rank != 0 && (is_elemental || formal->attr.dimension))
1604 /* At this point, we are considering a scalar passed to an array. This
1605 is valid (cf. F95 12.4.1.1; F2003 12.4.1.2),
1606 - if the actual argument is (a substring of) an element of a
1607 non-assumed-shape/non-pointer array;
1608 - (F2003) if the actual argument is of type character. */
1610 for (ref = actual->ref; ref; ref = ref->next)
1611 if (ref->type == REF_ARRAY && ref->u.ar.type == AR_ELEMENT
1612 && ref->u.ar.dimen > 0)
1615 /* Not an array element. */
1616 if (formal->ts.type == BT_CHARACTER
1618 || (actual->expr_type == EXPR_VARIABLE
1619 && (actual->symtree->n.sym->as->type == AS_ASSUMED_SHAPE
1620 || actual->symtree->n.sym->attr.pointer))))
1622 if (where && (gfc_option.allow_std & GFC_STD_F2003) == 0)
1624 gfc_error ("Fortran 2003: Scalar CHARACTER actual argument with "
1625 "array dummy argument '%s' at %L",
1626 formal->name, &actual->where);
1629 else if ((gfc_option.allow_std & GFC_STD_F2003) == 0)
1634 else if (ref == NULL && actual->expr_type != EXPR_NULL)
1637 argument_rank_mismatch (formal->name, &actual->where,
1638 symbol_rank (formal), actual->rank);
1642 if (actual->expr_type == EXPR_VARIABLE
1643 && actual->symtree->n.sym->as
1644 && (actual->symtree->n.sym->as->type == AS_ASSUMED_SHAPE
1645 || actual->symtree->n.sym->attr.pointer))
1648 gfc_error ("Element of assumed-shaped array passed to dummy "
1649 "argument '%s' at %L", formal->name, &actual->where);
1657 /* Given a symbol of a formal argument list and an expression, see if
1658 the two are compatible as arguments. Returns nonzero if
1659 compatible, zero if not compatible. */
1662 compare_parameter_protected (gfc_symbol *formal, gfc_expr *actual)
1664 if (actual->expr_type != EXPR_VARIABLE)
1667 if (!actual->symtree->n.sym->attr.is_protected)
1670 if (!actual->symtree->n.sym->attr.use_assoc)
1673 if (formal->attr.intent == INTENT_IN
1674 || formal->attr.intent == INTENT_UNKNOWN)
1677 if (!actual->symtree->n.sym->attr.pointer)
1680 if (actual->symtree->n.sym->attr.pointer && formal->attr.pointer)
1687 /* Returns the storage size of a symbol (formal argument) or
1688 zero if it cannot be determined. */
1690 static unsigned long
1691 get_sym_storage_size (gfc_symbol *sym)
1694 unsigned long strlen, elements;
1696 if (sym->ts.type == BT_CHARACTER)
1698 if (sym->ts.u.cl && sym->ts.u.cl->length
1699 && sym->ts.u.cl->length->expr_type == EXPR_CONSTANT)
1700 strlen = mpz_get_ui (sym->ts.u.cl->length->value.integer);
1707 if (symbol_rank (sym) == 0)
1711 if (sym->as->type != AS_EXPLICIT)
1713 for (i = 0; i < sym->as->rank; i++)
1715 if (!sym->as || sym->as->upper[i]->expr_type != EXPR_CONSTANT
1716 || sym->as->lower[i]->expr_type != EXPR_CONSTANT)
1719 elements *= mpz_get_si (sym->as->upper[i]->value.integer)
1720 - mpz_get_si (sym->as->lower[i]->value.integer) + 1L;
1723 return strlen*elements;
1727 /* Returns the storage size of an expression (actual argument) or
1728 zero if it cannot be determined. For an array element, it returns
1729 the remaining size as the element sequence consists of all storage
1730 units of the actual argument up to the end of the array. */
1732 static unsigned long
1733 get_expr_storage_size (gfc_expr *e)
1736 long int strlen, elements;
1737 long int substrlen = 0;
1738 bool is_str_storage = false;
1744 if (e->ts.type == BT_CHARACTER)
1746 if (e->ts.u.cl && e->ts.u.cl->length
1747 && e->ts.u.cl->length->expr_type == EXPR_CONSTANT)
1748 strlen = mpz_get_si (e->ts.u.cl->length->value.integer);
1749 else if (e->expr_type == EXPR_CONSTANT
1750 && (e->ts.u.cl == NULL || e->ts.u.cl->length == NULL))
1751 strlen = e->value.character.length;
1756 strlen = 1; /* Length per element. */
1758 if (e->rank == 0 && !e->ref)
1766 for (i = 0; i < e->rank; i++)
1767 elements *= mpz_get_si (e->shape[i]);
1768 return elements*strlen;
1771 for (ref = e->ref; ref; ref = ref->next)
1773 if (ref->type == REF_SUBSTRING && ref->u.ss.start
1774 && ref->u.ss.start->expr_type == EXPR_CONSTANT)
1778 /* The string length is the substring length.
1779 Set now to full string length. */
1780 if (ref->u.ss.length == NULL
1781 || ref->u.ss.length->length->expr_type != EXPR_CONSTANT)
1784 strlen = mpz_get_ui (ref->u.ss.length->length->value.integer);
1786 substrlen = strlen - mpz_get_ui (ref->u.ss.start->value.integer) + 1;
1790 if (ref->type == REF_ARRAY && ref->u.ar.type == AR_SECTION
1791 && ref->u.ar.start && ref->u.ar.end && ref->u.ar.stride
1792 && ref->u.ar.as->upper)
1793 for (i = 0; i < ref->u.ar.dimen; i++)
1795 long int start, end, stride;
1798 if (ref->u.ar.stride[i])
1800 if (ref->u.ar.stride[i]->expr_type == EXPR_CONSTANT)
1801 stride = mpz_get_si (ref->u.ar.stride[i]->value.integer);
1806 if (ref->u.ar.start[i])
1808 if (ref->u.ar.start[i]->expr_type == EXPR_CONSTANT)
1809 start = mpz_get_si (ref->u.ar.start[i]->value.integer);
1813 else if (ref->u.ar.as->lower[i]
1814 && ref->u.ar.as->lower[i]->expr_type == EXPR_CONSTANT)
1815 start = mpz_get_si (ref->u.ar.as->lower[i]->value.integer);
1819 if (ref->u.ar.end[i])
1821 if (ref->u.ar.end[i]->expr_type == EXPR_CONSTANT)
1822 end = mpz_get_si (ref->u.ar.end[i]->value.integer);
1826 else if (ref->u.ar.as->upper[i]
1827 && ref->u.ar.as->upper[i]->expr_type == EXPR_CONSTANT)
1828 end = mpz_get_si (ref->u.ar.as->upper[i]->value.integer);
1832 elements *= (end - start)/stride + 1L;
1834 else if (ref->type == REF_ARRAY && ref->u.ar.type == AR_FULL
1835 && ref->u.ar.as->lower && ref->u.ar.as->upper)
1836 for (i = 0; i < ref->u.ar.as->rank; i++)
1838 if (ref->u.ar.as->lower[i] && ref->u.ar.as->upper[i]
1839 && ref->u.ar.as->lower[i]->expr_type == EXPR_CONSTANT
1840 && ref->u.ar.as->upper[i]->expr_type == EXPR_CONSTANT)
1841 elements *= mpz_get_si (ref->u.ar.as->upper[i]->value.integer)
1842 - mpz_get_si (ref->u.ar.as->lower[i]->value.integer)
1847 else if (ref->type == REF_ARRAY && ref->u.ar.type == AR_ELEMENT
1848 && e->expr_type == EXPR_VARIABLE)
1850 if (e->symtree->n.sym->as->type == AS_ASSUMED_SHAPE
1851 || e->symtree->n.sym->attr.pointer)
1857 /* Determine the number of remaining elements in the element
1858 sequence for array element designators. */
1859 is_str_storage = true;
1860 for (i = ref->u.ar.dimen - 1; i >= 0; i--)
1862 if (ref->u.ar.start[i] == NULL
1863 || ref->u.ar.start[i]->expr_type != EXPR_CONSTANT
1864 || ref->u.ar.as->upper[i] == NULL
1865 || ref->u.ar.as->lower[i] == NULL
1866 || ref->u.ar.as->upper[i]->expr_type != EXPR_CONSTANT
1867 || ref->u.ar.as->lower[i]->expr_type != EXPR_CONSTANT)
1872 * (mpz_get_si (ref->u.ar.as->upper[i]->value.integer)
1873 - mpz_get_si (ref->u.ar.as->lower[i]->value.integer)
1875 - (mpz_get_si (ref->u.ar.start[i]->value.integer)
1876 - mpz_get_si (ref->u.ar.as->lower[i]->value.integer));
1884 return (is_str_storage) ? substrlen + (elements-1)*strlen
1887 return elements*strlen;
1891 /* Given an expression, check whether it is an array section
1892 which has a vector subscript. If it has, one is returned,
1896 gfc_has_vector_subscript (gfc_expr *e)
1901 if (e == NULL || e->rank == 0 || e->expr_type != EXPR_VARIABLE)
1904 for (ref = e->ref; ref; ref = ref->next)
1905 if (ref->type == REF_ARRAY && ref->u.ar.type == AR_SECTION)
1906 for (i = 0; i < ref->u.ar.dimen; i++)
1907 if (ref->u.ar.dimen_type[i] == DIMEN_VECTOR)
1914 /* Given formal and actual argument lists, see if they are compatible.
1915 If they are compatible, the actual argument list is sorted to
1916 correspond with the formal list, and elements for missing optional
1917 arguments are inserted. If WHERE pointer is nonnull, then we issue
1918 errors when things don't match instead of just returning the status
1922 compare_actual_formal (gfc_actual_arglist **ap, gfc_formal_arglist *formal,
1923 int ranks_must_agree, int is_elemental, locus *where)
1925 gfc_actual_arglist **new_arg, *a, *actual, temp;
1926 gfc_formal_arglist *f;
1928 unsigned long actual_size, formal_size;
1932 if (actual == NULL && formal == NULL)
1936 for (f = formal; f; f = f->next)
1939 new_arg = XALLOCAVEC (gfc_actual_arglist *, n);
1941 for (i = 0; i < n; i++)
1948 for (a = actual; a; a = a->next, f = f->next)
1950 /* Look for keywords but ignore g77 extensions like %VAL. */
1951 if (a->name != NULL && a->name[0] != '%')
1954 for (f = formal; f; f = f->next, i++)
1958 if (strcmp (f->sym->name, a->name) == 0)
1965 gfc_error ("Keyword argument '%s' at %L is not in "
1966 "the procedure", a->name, &a->expr->where);
1970 if (new_arg[i] != NULL)
1973 gfc_error ("Keyword argument '%s' at %L is already associated "
1974 "with another actual argument", a->name,
1983 gfc_error ("More actual than formal arguments in procedure "
1984 "call at %L", where);
1989 if (f->sym == NULL && a->expr == NULL)
1995 gfc_error ("Missing alternate return spec in subroutine call "
2000 if (a->expr == NULL)
2003 gfc_error ("Unexpected alternate return spec in subroutine "
2004 "call at %L", where);
2008 if (!compare_parameter (f->sym, a->expr, ranks_must_agree,
2009 is_elemental, where))
2012 /* Special case for character arguments. For allocatable, pointer
2013 and assumed-shape dummies, the string length needs to match
2015 if (a->expr->ts.type == BT_CHARACTER
2016 && a->expr->ts.u.cl && a->expr->ts.u.cl->length
2017 && a->expr->ts.u.cl->length->expr_type == EXPR_CONSTANT
2018 && f->sym->ts.u.cl && f->sym->ts.u.cl && f->sym->ts.u.cl->length
2019 && f->sym->ts.u.cl->length->expr_type == EXPR_CONSTANT
2020 && (f->sym->attr.pointer || f->sym->attr.allocatable
2021 || (f->sym->as && f->sym->as->type == AS_ASSUMED_SHAPE))
2022 && (mpz_cmp (a->expr->ts.u.cl->length->value.integer,
2023 f->sym->ts.u.cl->length->value.integer) != 0))
2025 if (where && (f->sym->attr.pointer || f->sym->attr.allocatable))
2026 gfc_warning ("Character length mismatch (%ld/%ld) between actual "
2027 "argument and pointer or allocatable dummy argument "
2029 mpz_get_si (a->expr->ts.u.cl->length->value.integer),
2030 mpz_get_si (f->sym->ts.u.cl->length->value.integer),
2031 f->sym->name, &a->expr->where);
2033 gfc_warning ("Character length mismatch (%ld/%ld) between actual "
2034 "argument and assumed-shape dummy argument '%s' "
2036 mpz_get_si (a->expr->ts.u.cl->length->value.integer),
2037 mpz_get_si (f->sym->ts.u.cl->length->value.integer),
2038 f->sym->name, &a->expr->where);
2042 actual_size = get_expr_storage_size (a->expr);
2043 formal_size = get_sym_storage_size (f->sym);
2044 if (actual_size != 0
2045 && actual_size < formal_size
2046 && a->expr->ts.type != BT_PROCEDURE)
2048 if (a->expr->ts.type == BT_CHARACTER && !f->sym->as && where)
2049 gfc_warning ("Character length of actual argument shorter "
2050 "than of dummy argument '%s' (%lu/%lu) at %L",
2051 f->sym->name, actual_size, formal_size,
2054 gfc_warning ("Actual argument contains too few "
2055 "elements for dummy argument '%s' (%lu/%lu) at %L",
2056 f->sym->name, actual_size, formal_size,
2061 /* Satisfy 12.4.1.3 by ensuring that a procedure pointer actual argument
2062 is provided for a procedure pointer formal argument. */
2063 if (f->sym->attr.proc_pointer
2064 && !((a->expr->expr_type == EXPR_VARIABLE
2065 && a->expr->symtree->n.sym->attr.proc_pointer)
2066 || (a->expr->expr_type == EXPR_FUNCTION
2067 && a->expr->symtree->n.sym->result->attr.proc_pointer)
2068 || gfc_is_proc_ptr_comp (a->expr, NULL)))
2071 gfc_error ("Expected a procedure pointer for argument '%s' at %L",
2072 f->sym->name, &a->expr->where);
2076 /* Satisfy 12.4.1.2 by ensuring that a procedure actual argument is
2077 provided for a procedure formal argument. */
2078 if (a->expr->ts.type != BT_PROCEDURE && !gfc_is_proc_ptr_comp (a->expr, NULL)
2079 && a->expr->expr_type == EXPR_VARIABLE
2080 && f->sym->attr.flavor == FL_PROCEDURE)
2083 gfc_error ("Expected a procedure for argument '%s' at %L",
2084 f->sym->name, &a->expr->where);
2088 if (f->sym->attr.flavor == FL_PROCEDURE && f->sym->attr.pure
2089 && a->expr->ts.type == BT_PROCEDURE
2090 && !a->expr->symtree->n.sym->attr.pure)
2093 gfc_error ("Expected a PURE procedure for argument '%s' at %L",
2094 f->sym->name, &a->expr->where);
2098 if (f->sym->as && f->sym->as->type == AS_ASSUMED_SHAPE
2099 && a->expr->expr_type == EXPR_VARIABLE
2100 && a->expr->symtree->n.sym->as
2101 && a->expr->symtree->n.sym->as->type == AS_ASSUMED_SIZE
2102 && (a->expr->ref == NULL
2103 || (a->expr->ref->type == REF_ARRAY
2104 && a->expr->ref->u.ar.type == AR_FULL)))
2107 gfc_error ("Actual argument for '%s' cannot be an assumed-size"
2108 " array at %L", f->sym->name, where);
2112 if (a->expr->expr_type != EXPR_NULL
2113 && compare_pointer (f->sym, a->expr) == 0)
2116 gfc_error ("Actual argument for '%s' must be a pointer at %L",
2117 f->sym->name, &a->expr->where);
2121 if (a->expr->expr_type != EXPR_NULL
2122 && (gfc_option.allow_std & GFC_STD_F2008) == 0
2123 && compare_pointer (f->sym, a->expr) == 2)
2126 gfc_error ("Fortran 2008: Non-pointer actual argument at %L to "
2127 "pointer dummy '%s'", &a->expr->where,f->sym->name);
2132 /* Fortran 2008, C1242. */
2133 if (f->sym->attr.pointer && gfc_is_coindexed (a->expr))
2136 gfc_error ("Coindexed actual argument at %L to pointer "
2138 &a->expr->where, f->sym->name);
2142 /* Fortran 2008, 12.5.2.5 (no constraint). */
2143 if (a->expr->expr_type == EXPR_VARIABLE
2144 && f->sym->attr.intent != INTENT_IN
2145 && f->sym->attr.allocatable
2146 && gfc_is_coindexed (a->expr))
2149 gfc_error ("Coindexed actual argument at %L to allocatable "
2150 "dummy '%s' requires INTENT(IN)",
2151 &a->expr->where, f->sym->name);
2155 /* Fortran 2008, C1237. */
2156 if (a->expr->expr_type == EXPR_VARIABLE
2157 && (f->sym->attr.asynchronous || f->sym->attr.volatile_)
2158 && gfc_is_coindexed (a->expr)
2159 && (a->expr->symtree->n.sym->attr.volatile_
2160 || a->expr->symtree->n.sym->attr.asynchronous))
2163 gfc_error ("Coindexed ASYNCHRONOUS or VOLATILE actual argument at "
2164 "at %L requires that dummy %s' has neither "
2165 "ASYNCHRONOUS nor VOLATILE", &a->expr->where,
2170 /* Fortran 2008, 12.5.2.4 (no constraint). */
2171 if (a->expr->expr_type == EXPR_VARIABLE
2172 && f->sym->attr.intent != INTENT_IN && !f->sym->attr.value
2173 && gfc_is_coindexed (a->expr)
2174 && gfc_has_ultimate_allocatable (a->expr))
2177 gfc_error ("Coindexed actual argument at %L with allocatable "
2178 "ultimate component to dummy '%s' requires either VALUE "
2179 "or INTENT(IN)", &a->expr->where, f->sym->name);
2183 if (a->expr->expr_type != EXPR_NULL
2184 && compare_allocatable (f->sym, a->expr) == 0)
2187 gfc_error ("Actual argument for '%s' must be ALLOCATABLE at %L",
2188 f->sym->name, &a->expr->where);
2192 /* Check intent = OUT/INOUT for definable actual argument. */
2193 if ((a->expr->expr_type != EXPR_VARIABLE
2194 || (a->expr->symtree->n.sym->attr.flavor != FL_VARIABLE
2195 && a->expr->symtree->n.sym->attr.flavor != FL_PROCEDURE))
2196 && (f->sym->attr.intent == INTENT_OUT
2197 || f->sym->attr.intent == INTENT_INOUT))
2200 gfc_error ("Actual argument at %L must be definable as "
2201 "the dummy argument '%s' is INTENT = OUT/INOUT",
2202 &a->expr->where, f->sym->name);
2206 if (!compare_parameter_protected(f->sym, a->expr))
2209 gfc_error ("Actual argument at %L is use-associated with "
2210 "PROTECTED attribute and dummy argument '%s' is "
2211 "INTENT = OUT/INOUT",
2212 &a->expr->where,f->sym->name);
2216 if ((f->sym->attr.intent == INTENT_OUT
2217 || f->sym->attr.intent == INTENT_INOUT
2218 || f->sym->attr.volatile_
2219 || f->sym->attr.asynchronous)
2220 && gfc_has_vector_subscript (a->expr))
2223 gfc_error ("Array-section actual argument with vector "
2224 "subscripts at %L is incompatible with INTENT(OUT), "
2225 "INTENT(INOUT), VOLATILE or ASYNCHRONOUS attribute "
2226 "of the dummy argument '%s'",
2227 &a->expr->where, f->sym->name);
2231 /* C1232 (R1221) For an actual argument which is an array section or
2232 an assumed-shape array, the dummy argument shall be an assumed-
2233 shape array, if the dummy argument has the VOLATILE attribute. */
2235 if (f->sym->attr.volatile_
2236 && a->expr->symtree->n.sym->as
2237 && a->expr->symtree->n.sym->as->type == AS_ASSUMED_SHAPE
2238 && !(f->sym->as && f->sym->as->type == AS_ASSUMED_SHAPE))
2241 gfc_error ("Assumed-shape actual argument at %L is "
2242 "incompatible with the non-assumed-shape "
2243 "dummy argument '%s' due to VOLATILE attribute",
2244 &a->expr->where,f->sym->name);
2248 if (f->sym->attr.volatile_
2249 && a->expr->ref && a->expr->ref->u.ar.type == AR_SECTION
2250 && !(f->sym->as && f->sym->as->type == AS_ASSUMED_SHAPE))
2253 gfc_error ("Array-section actual argument at %L is "
2254 "incompatible with the non-assumed-shape "
2255 "dummy argument '%s' due to VOLATILE attribute",
2256 &a->expr->where,f->sym->name);
2260 /* C1233 (R1221) For an actual argument which is a pointer array, the
2261 dummy argument shall be an assumed-shape or pointer array, if the
2262 dummy argument has the VOLATILE attribute. */
2264 if (f->sym->attr.volatile_
2265 && a->expr->symtree->n.sym->attr.pointer
2266 && a->expr->symtree->n.sym->as
2268 && (f->sym->as->type == AS_ASSUMED_SHAPE
2269 || f->sym->attr.pointer)))
2272 gfc_error ("Pointer-array actual argument at %L requires "
2273 "an assumed-shape or pointer-array dummy "
2274 "argument '%s' due to VOLATILE attribute",
2275 &a->expr->where,f->sym->name);
2286 /* Make sure missing actual arguments are optional. */
2288 for (f = formal; f; f = f->next, i++)
2290 if (new_arg[i] != NULL)
2295 gfc_error ("Missing alternate return spec in subroutine call "
2299 if (!f->sym->attr.optional)
2302 gfc_error ("Missing actual argument for argument '%s' at %L",
2303 f->sym->name, where);
2308 /* The argument lists are compatible. We now relink a new actual
2309 argument list with null arguments in the right places. The head
2310 of the list remains the head. */
2311 for (i = 0; i < n; i++)
2312 if (new_arg[i] == NULL)
2313 new_arg[i] = gfc_get_actual_arglist ();
2318 *new_arg[0] = *actual;
2322 new_arg[0] = new_arg[na];
2326 for (i = 0; i < n - 1; i++)
2327 new_arg[i]->next = new_arg[i + 1];
2329 new_arg[i]->next = NULL;
2331 if (*ap == NULL && n > 0)
2334 /* Note the types of omitted optional arguments. */
2335 for (a = *ap, f = formal; a; a = a->next, f = f->next)
2336 if (a->expr == NULL && a->label == NULL)
2337 a->missing_arg_type = f->sym->ts.type;
2345 gfc_formal_arglist *f;
2346 gfc_actual_arglist *a;
2350 /* qsort comparison function for argument pairs, with the following
2352 - p->a->expr == NULL
2353 - p->a->expr->expr_type != EXPR_VARIABLE
2354 - growing p->a->expr->symbol. */
2357 pair_cmp (const void *p1, const void *p2)
2359 const gfc_actual_arglist *a1, *a2;
2361 /* *p1 and *p2 are elements of the to-be-sorted array. */
2362 a1 = ((const argpair *) p1)->a;
2363 a2 = ((const argpair *) p2)->a;
2372 if (a1->expr->expr_type != EXPR_VARIABLE)
2374 if (a2->expr->expr_type != EXPR_VARIABLE)
2378 if (a2->expr->expr_type != EXPR_VARIABLE)
2380 return a1->expr->symtree->n.sym < a2->expr->symtree->n.sym;
2384 /* Given two expressions from some actual arguments, test whether they
2385 refer to the same expression. The analysis is conservative.
2386 Returning FAILURE will produce no warning. */
2389 compare_actual_expr (gfc_expr *e1, gfc_expr *e2)
2391 const gfc_ref *r1, *r2;
2394 || e1->expr_type != EXPR_VARIABLE
2395 || e2->expr_type != EXPR_VARIABLE
2396 || e1->symtree->n.sym != e2->symtree->n.sym)
2399 /* TODO: improve comparison, see expr.c:show_ref(). */
2400 for (r1 = e1->ref, r2 = e2->ref; r1 && r2; r1 = r1->next, r2 = r2->next)
2402 if (r1->type != r2->type)
2407 if (r1->u.ar.type != r2->u.ar.type)
2409 /* TODO: At the moment, consider only full arrays;
2410 we could do better. */
2411 if (r1->u.ar.type != AR_FULL || r2->u.ar.type != AR_FULL)
2416 if (r1->u.c.component != r2->u.c.component)
2424 gfc_internal_error ("compare_actual_expr(): Bad component code");
2433 /* Given formal and actual argument lists that correspond to one
2434 another, check that identical actual arguments aren't not
2435 associated with some incompatible INTENTs. */
2438 check_some_aliasing (gfc_formal_arglist *f, gfc_actual_arglist *a)
2440 sym_intent f1_intent, f2_intent;
2441 gfc_formal_arglist *f1;
2442 gfc_actual_arglist *a1;
2445 gfc_try t = SUCCESS;
2448 for (f1 = f, a1 = a;; f1 = f1->next, a1 = a1->next)
2450 if (f1 == NULL && a1 == NULL)
2452 if (f1 == NULL || a1 == NULL)
2453 gfc_internal_error ("check_some_aliasing(): List mismatch");
2458 p = XALLOCAVEC (argpair, n);
2460 for (i = 0, f1 = f, a1 = a; i < n; i++, f1 = f1->next, a1 = a1->next)
2466 qsort (p, n, sizeof (argpair), pair_cmp);
2468 for (i = 0; i < n; i++)
2471 || p[i].a->expr->expr_type != EXPR_VARIABLE
2472 || p[i].a->expr->ts.type == BT_PROCEDURE)
2474 f1_intent = p[i].f->sym->attr.intent;
2475 for (j = i + 1; j < n; j++)
2477 /* Expected order after the sort. */
2478 if (!p[j].a->expr || p[j].a->expr->expr_type != EXPR_VARIABLE)
2479 gfc_internal_error ("check_some_aliasing(): corrupted data");
2481 /* Are the expression the same? */
2482 if (compare_actual_expr (p[i].a->expr, p[j].a->expr) == FAILURE)
2484 f2_intent = p[j].f->sym->attr.intent;
2485 if ((f1_intent == INTENT_IN && f2_intent == INTENT_OUT)
2486 || (f1_intent == INTENT_OUT && f2_intent == INTENT_IN))
2488 gfc_warning ("Same actual argument associated with INTENT(%s) "
2489 "argument '%s' and INTENT(%s) argument '%s' at %L",
2490 gfc_intent_string (f1_intent), p[i].f->sym->name,
2491 gfc_intent_string (f2_intent), p[j].f->sym->name,
2492 &p[i].a->expr->where);
2502 /* Given a symbol of a formal argument list and an expression,
2503 return nonzero if their intents are compatible, zero otherwise. */
2506 compare_parameter_intent (gfc_symbol *formal, gfc_expr *actual)
2508 if (actual->symtree->n.sym->attr.pointer && !formal->attr.pointer)
2511 if (actual->symtree->n.sym->attr.intent != INTENT_IN)
2514 if (formal->attr.intent == INTENT_INOUT || formal->attr.intent == INTENT_OUT)
2521 /* Given formal and actual argument lists that correspond to one
2522 another, check that they are compatible in the sense that intents
2523 are not mismatched. */
2526 check_intents (gfc_formal_arglist *f, gfc_actual_arglist *a)
2528 sym_intent f_intent;
2530 for (;; f = f->next, a = a->next)
2532 if (f == NULL && a == NULL)
2534 if (f == NULL || a == NULL)
2535 gfc_internal_error ("check_intents(): List mismatch");
2537 if (a->expr == NULL || a->expr->expr_type != EXPR_VARIABLE)
2540 f_intent = f->sym->attr.intent;
2542 if (!compare_parameter_intent(f->sym, a->expr))
2544 gfc_error ("Procedure argument at %L is INTENT(IN) while interface "
2545 "specifies INTENT(%s)", &a->expr->where,
2546 gfc_intent_string (f_intent));
2550 if (gfc_pure (NULL) && gfc_impure_variable (a->expr->symtree->n.sym))
2552 if (f_intent == INTENT_INOUT || f_intent == INTENT_OUT)
2554 gfc_error ("Procedure argument at %L is local to a PURE "
2555 "procedure and is passed to an INTENT(%s) argument",
2556 &a->expr->where, gfc_intent_string (f_intent));
2560 if (f->sym->attr.pointer)
2562 gfc_error ("Procedure argument at %L is local to a PURE "
2563 "procedure and has the POINTER attribute",
2569 /* Fortran 2008, C1283. */
2570 if (gfc_pure (NULL) && gfc_is_coindexed (a->expr))
2572 if (f_intent == INTENT_INOUT || f_intent == INTENT_OUT)
2574 gfc_error ("Coindexed actual argument at %L in PURE procedure "
2575 "is passed to an INTENT(%s) argument",
2576 &a->expr->where, gfc_intent_string (f_intent));
2580 if (f->sym->attr.pointer)
2582 gfc_error ("Coindexed actual argument at %L in PURE procedure "
2583 "is passed to a POINTER dummy argument",
2589 /* F2008, Section 12.5.2.4. */
2590 if (a->expr->ts.type == BT_CLASS && f->sym->ts.type == BT_CLASS
2591 && gfc_is_coindexed (a->expr))
2593 gfc_error ("Coindexed polymorphic actual argument at %L is passed "
2594 "polymorphic dummy argument '%s'",
2595 &a->expr->where, f->sym->name);
2604 /* Check how a procedure is used against its interface. If all goes
2605 well, the actual argument list will also end up being properly
2609 gfc_procedure_use (gfc_symbol *sym, gfc_actual_arglist **ap, locus *where)
2612 /* Warn about calls with an implicit interface. Special case
2613 for calling a ISO_C_BINDING becase c_loc and c_funloc
2614 are pseudo-unknown. Additionally, warn about procedures not
2615 explicitly declared at all if requested. */
2616 if (sym->attr.if_source == IFSRC_UNKNOWN && ! sym->attr.is_iso_c)
2618 if (gfc_option.warn_implicit_interface)
2619 gfc_warning ("Procedure '%s' called with an implicit interface at %L",
2621 else if (gfc_option.warn_implicit_procedure
2622 && sym->attr.proc == PROC_UNKNOWN)
2623 gfc_warning ("Procedure '%s' called at %L is not explicitly declared",
2627 if (sym->attr.if_source == IFSRC_UNKNOWN)
2629 gfc_actual_arglist *a;
2630 for (a = *ap; a; a = a->next)
2632 /* Skip g77 keyword extensions like %VAL, %REF, %LOC. */
2633 if (a->name != NULL && a->name[0] != '%')
2635 gfc_error("Keyword argument requires explicit interface "
2636 "for procedure '%s' at %L", sym->name, &a->expr->where);
2644 if (!compare_actual_formal (ap, sym->formal, 0, sym->attr.elemental, where))
2647 check_intents (sym->formal, *ap);
2648 if (gfc_option.warn_aliasing)
2649 check_some_aliasing (sym->formal, *ap);
2653 /* Check how a procedure pointer component is used against its interface.
2654 If all goes well, the actual argument list will also end up being properly
2655 sorted. Completely analogous to gfc_procedure_use. */
2658 gfc_ppc_use (gfc_component *comp, gfc_actual_arglist **ap, locus *where)
2661 /* Warn about calls with an implicit interface. Special case
2662 for calling a ISO_C_BINDING becase c_loc and c_funloc
2663 are pseudo-unknown. */
2664 if (gfc_option.warn_implicit_interface
2665 && comp->attr.if_source == IFSRC_UNKNOWN
2666 && !comp->attr.is_iso_c)
2667 gfc_warning ("Procedure pointer component '%s' called with an implicit "
2668 "interface at %L", comp->name, where);
2670 if (comp->attr.if_source == IFSRC_UNKNOWN)
2672 gfc_actual_arglist *a;
2673 for (a = *ap; a; a = a->next)
2675 /* Skip g77 keyword extensions like %VAL, %REF, %LOC. */
2676 if (a->name != NULL && a->name[0] != '%')
2678 gfc_error("Keyword argument requires explicit interface "
2679 "for procedure pointer component '%s' at %L",
2680 comp->name, &a->expr->where);
2688 if (!compare_actual_formal (ap, comp->formal, 0, comp->attr.elemental, where))
2691 check_intents (comp->formal, *ap);
2692 if (gfc_option.warn_aliasing)
2693 check_some_aliasing (comp->formal, *ap);
2697 /* Try if an actual argument list matches the formal list of a symbol,
2698 respecting the symbol's attributes like ELEMENTAL. This is used for
2699 GENERIC resolution. */
2702 gfc_arglist_matches_symbol (gfc_actual_arglist** args, gfc_symbol* sym)
2706 gcc_assert (sym->attr.flavor == FL_PROCEDURE);
2708 r = !sym->attr.elemental;
2709 if (compare_actual_formal (args, sym->formal, r, !r, NULL))
2711 check_intents (sym->formal, *args);
2712 if (gfc_option.warn_aliasing)
2713 check_some_aliasing (sym->formal, *args);
2721 /* Given an interface pointer and an actual argument list, search for
2722 a formal argument list that matches the actual. If found, returns
2723 a pointer to the symbol of the correct interface. Returns NULL if
2727 gfc_search_interface (gfc_interface *intr, int sub_flag,
2728 gfc_actual_arglist **ap)
2730 gfc_symbol *elem_sym = NULL;
2731 for (; intr; intr = intr->next)
2733 if (sub_flag && intr->sym->attr.function)
2735 if (!sub_flag && intr->sym->attr.subroutine)
2738 if (gfc_arglist_matches_symbol (ap, intr->sym))
2740 /* Satisfy 12.4.4.1 such that an elemental match has lower
2741 weight than a non-elemental match. */
2742 if (intr->sym->attr.elemental)
2744 elem_sym = intr->sym;
2751 return elem_sym ? elem_sym : NULL;
2755 /* Do a brute force recursive search for a symbol. */
2757 static gfc_symtree *
2758 find_symtree0 (gfc_symtree *root, gfc_symbol *sym)
2762 if (root->n.sym == sym)
2767 st = find_symtree0 (root->left, sym);
2768 if (root->right && ! st)
2769 st = find_symtree0 (root->right, sym);
2774 /* Find a symtree for a symbol. */
2777 gfc_find_sym_in_symtree (gfc_symbol *sym)
2782 /* First try to find it by name. */
2783 gfc_find_sym_tree (sym->name, gfc_current_ns, 1, &st);
2784 if (st && st->n.sym == sym)
2787 /* If it's been renamed, resort to a brute-force search. */
2788 /* TODO: avoid having to do this search. If the symbol doesn't exist
2789 in the symtree for the current namespace, it should probably be added. */
2790 for (ns = gfc_current_ns; ns; ns = ns->parent)
2792 st = find_symtree0 (ns->sym_root, sym);
2796 gfc_internal_error ("Unable to find symbol %s", sym->name);
2801 /* See if the arglist to an operator-call contains a derived-type argument
2802 with a matching type-bound operator. If so, return the matching specific
2803 procedure defined as operator-target as well as the base-object to use
2804 (which is the found derived-type argument with operator). The generic
2805 name, if any, is transmitted to the final expression via 'gname'. */
2807 static gfc_typebound_proc*
2808 matching_typebound_op (gfc_expr** tb_base,
2809 gfc_actual_arglist* args,
2810 gfc_intrinsic_op op, const char* uop,
2811 const char ** gname)
2813 gfc_actual_arglist* base;
2815 for (base = args; base; base = base->next)
2816 if (base->expr->ts.type == BT_DERIVED || base->expr->ts.type == BT_CLASS)
2818 gfc_typebound_proc* tb;
2819 gfc_symbol* derived;
2822 if (base->expr->ts.type == BT_CLASS)
2823 derived = CLASS_DATA (base->expr)->ts.u.derived;
2825 derived = base->expr->ts.u.derived;
2827 if (op == INTRINSIC_USER)
2829 gfc_symtree* tb_uop;
2832 tb_uop = gfc_find_typebound_user_op (derived, &result, uop,
2841 tb = gfc_find_typebound_intrinsic_op (derived, &result, op,
2844 /* This means we hit a PRIVATE operator which is use-associated and
2845 should thus not be seen. */
2846 if (result == FAILURE)
2849 /* Look through the super-type hierarchy for a matching specific
2851 for (; tb; tb = tb->overridden)
2855 gcc_assert (tb->is_generic);
2856 for (g = tb->u.generic; g; g = g->next)
2859 gfc_actual_arglist* argcopy;
2862 gcc_assert (g->specific);
2863 if (g->specific->error)
2866 target = g->specific->u.specific->n.sym;
2868 /* Check if this arglist matches the formal. */
2869 argcopy = gfc_copy_actual_arglist (args);
2870 matches = gfc_arglist_matches_symbol (&argcopy, target);
2871 gfc_free_actual_arglist (argcopy);
2873 /* Return if we found a match. */
2876 *tb_base = base->expr;
2877 *gname = g->specific_st->name;
2888 /* For the 'actual arglist' of an operator call and a specific typebound
2889 procedure that has been found the target of a type-bound operator, build the
2890 appropriate EXPR_COMPCALL and resolve it. We take this indirection over
2891 type-bound procedures rather than resolving type-bound operators 'directly'
2892 so that we can reuse the existing logic. */
2895 build_compcall_for_operator (gfc_expr* e, gfc_actual_arglist* actual,
2896 gfc_expr* base, gfc_typebound_proc* target,
2899 e->expr_type = EXPR_COMPCALL;
2900 e->value.compcall.tbp = target;
2901 e->value.compcall.name = gname ? gname : "$op";
2902 e->value.compcall.actual = actual;
2903 e->value.compcall.base_object = base;
2904 e->value.compcall.ignore_pass = 1;
2905 e->value.compcall.assign = 0;
2909 /* This subroutine is called when an expression is being resolved.
2910 The expression node in question is either a user defined operator
2911 or an intrinsic operator with arguments that aren't compatible
2912 with the operator. This subroutine builds an actual argument list
2913 corresponding to the operands, then searches for a compatible
2914 interface. If one is found, the expression node is replaced with
2915 the appropriate function call.
2916 real_error is an additional output argument that specifies if FAILURE
2917 is because of some real error and not because no match was found. */
2920 gfc_extend_expr (gfc_expr *e, bool *real_error)
2922 gfc_actual_arglist *actual;
2931 actual = gfc_get_actual_arglist ();
2932 actual->expr = e->value.op.op1;
2934 *real_error = false;
2937 if (e->value.op.op2 != NULL)
2939 actual->next = gfc_get_actual_arglist ();
2940 actual->next->expr = e->value.op.op2;
2943 i = fold_unary_intrinsic (e->value.op.op);
2945 if (i == INTRINSIC_USER)
2947 for (ns = gfc_current_ns; ns; ns = ns->parent)
2949 uop = gfc_find_uop (e->value.op.uop->name, ns);
2953 sym = gfc_search_interface (uop->op, 0, &actual);
2960 for (ns = gfc_current_ns; ns; ns = ns->parent)
2962 /* Due to the distinction between '==' and '.eq.' and friends, one has
2963 to check if either is defined. */
2966 #define CHECK_OS_COMPARISON(comp) \
2967 case INTRINSIC_##comp: \
2968 case INTRINSIC_##comp##_OS: \
2969 sym = gfc_search_interface (ns->op[INTRINSIC_##comp], 0, &actual); \
2971 sym = gfc_search_interface (ns->op[INTRINSIC_##comp##_OS], 0, &actual); \
2973 CHECK_OS_COMPARISON(EQ)
2974 CHECK_OS_COMPARISON(NE)
2975 CHECK_OS_COMPARISON(GT)
2976 CHECK_OS_COMPARISON(GE)
2977 CHECK_OS_COMPARISON(LT)
2978 CHECK_OS_COMPARISON(LE)
2979 #undef CHECK_OS_COMPARISON
2982 sym = gfc_search_interface (ns->op[i], 0, &actual);
2990 /* TODO: Do an ambiguity-check and error if multiple matching interfaces are
2991 found rather than just taking the first one and not checking further. */
2995 gfc_typebound_proc* tbo;
2998 /* See if we find a matching type-bound operator. */
2999 if (i == INTRINSIC_USER)
3000 tbo = matching_typebound_op (&tb_base, actual,
3001 i, e->value.op.uop->name, &gname);
3005 #define CHECK_OS_COMPARISON(comp) \
3006 case INTRINSIC_##comp: \
3007 case INTRINSIC_##comp##_OS: \
3008 tbo = matching_typebound_op (&tb_base, actual, \
3009 INTRINSIC_##comp, NULL, &gname); \
3011 tbo = matching_typebound_op (&tb_base, actual, \
3012 INTRINSIC_##comp##_OS, NULL, &gname); \
3014 CHECK_OS_COMPARISON(EQ)
3015 CHECK_OS_COMPARISON(NE)
3016 CHECK_OS_COMPARISON(GT)
3017 CHECK_OS_COMPARISON(GE)
3018 CHECK_OS_COMPARISON(LT)
3019 CHECK_OS_COMPARISON(LE)
3020 #undef CHECK_OS_COMPARISON
3023 tbo = matching_typebound_op (&tb_base, actual, i, NULL, &gname);
3027 /* If there is a matching typebound-operator, replace the expression with
3028 a call to it and succeed. */
3033 gcc_assert (tb_base);
3034 build_compcall_for_operator (e, actual, tb_base, tbo, gname);
3036 result = gfc_resolve_expr (e);
3037 if (result == FAILURE)
3043 /* Don't use gfc_free_actual_arglist(). */
3044 if (actual->next != NULL)
3045 gfc_free (actual->next);
3051 /* Change the expression node to a function call. */
3052 e->expr_type = EXPR_FUNCTION;
3053 e->symtree = gfc_find_sym_in_symtree (sym);
3054 e->value.function.actual = actual;
3055 e->value.function.esym = NULL;
3056 e->value.function.isym = NULL;
3057 e->value.function.name = NULL;
3058 e->user_operator = 1;
3060 if (gfc_resolve_expr (e) == FAILURE)
3070 /* Tries to replace an assignment code node with a subroutine call to
3071 the subroutine associated with the assignment operator. Return
3072 SUCCESS if the node was replaced. On FAILURE, no error is
3076 gfc_extend_assign (gfc_code *c, gfc_namespace *ns)
3078 gfc_actual_arglist *actual;
3079 gfc_expr *lhs, *rhs;
3088 /* Don't allow an intrinsic assignment to be replaced. */
3089 if (lhs->ts.type != BT_DERIVED && lhs->ts.type != BT_CLASS
3090 && (rhs->rank == 0 || rhs->rank == lhs->rank)
3091 && (lhs->ts.type == rhs->ts.type
3092 || (gfc_numeric_ts (&lhs->ts) && gfc_numeric_ts (&rhs->ts))))
3095 actual = gfc_get_actual_arglist ();
3098 actual->next = gfc_get_actual_arglist ();
3099 actual->next->expr = rhs;
3103 for (; ns; ns = ns->parent)
3105 sym = gfc_search_interface (ns->op[INTRINSIC_ASSIGN], 1, &actual);
3110 /* TODO: Ambiguity-check, see above for gfc_extend_expr. */
3114 gfc_typebound_proc* tbo;
3117 /* See if we find a matching type-bound assignment. */
3118 tbo = matching_typebound_op (&tb_base, actual,
3119 INTRINSIC_ASSIGN, NULL, &gname);
3121 /* If there is one, replace the expression with a call to it and
3125 gcc_assert (tb_base);
3126 c->expr1 = gfc_get_expr ();
3127 build_compcall_for_operator (c->expr1, actual, tb_base, tbo, gname);
3128 c->expr1->value.compcall.assign = 1;
3130 c->op = EXEC_COMPCALL;
3132 /* c is resolved from the caller, so no need to do it here. */
3137 gfc_free (actual->next);
3142 /* Replace the assignment with the call. */
3143 c->op = EXEC_ASSIGN_CALL;
3144 c->symtree = gfc_find_sym_in_symtree (sym);
3147 c->ext.actual = actual;
3153 /* Make sure that the interface just parsed is not already present in
3154 the given interface list. Ambiguity isn't checked yet since module
3155 procedures can be present without interfaces. */
3158 check_new_interface (gfc_interface *base, gfc_symbol *new_sym)
3162 for (ip = base; ip; ip = ip->next)
3164 if (ip->sym == new_sym)
3166 gfc_error ("Entity '%s' at %C is already present in the interface",
3176 /* Add a symbol to the current interface. */
3179 gfc_add_interface (gfc_symbol *new_sym)
3181 gfc_interface **head, *intr;
3185 switch (current_interface.type)
3187 case INTERFACE_NAMELESS:
3188 case INTERFACE_ABSTRACT:
3191 case INTERFACE_INTRINSIC_OP:
3192 for (ns = current_interface.ns; ns; ns = ns->parent)
3193 switch (current_interface.op)
3196 case INTRINSIC_EQ_OS:
3197 if (check_new_interface (ns->op[INTRINSIC_EQ], new_sym) == FAILURE ||
3198 check_new_interface (ns->op[INTRINSIC_EQ_OS], new_sym) == FAILURE)
3203 case INTRINSIC_NE_OS:
3204 if (check_new_interface (ns->op[INTRINSIC_NE], new_sym) == FAILURE ||
3205 check_new_interface (ns->op[INTRINSIC_NE_OS], new_sym) == FAILURE)
3210 case INTRINSIC_GT_OS:
3211 if (check_new_interface (ns->op[INTRINSIC_GT], new_sym) == FAILURE ||
3212 check_new_interface (ns->op[INTRINSIC_GT_OS], new_sym) == FAILURE)
3217 case INTRINSIC_GE_OS:
3218 if (check_new_interface (ns->op[INTRINSIC_GE], new_sym) == FAILURE ||
3219 check_new_interface (ns->op[INTRINSIC_GE_OS], new_sym) == FAILURE)
3224 case INTRINSIC_LT_OS:
3225 if (check_new_interface (ns->op[INTRINSIC_LT], new_sym) == FAILURE ||
3226 check_new_interface (ns->op[INTRINSIC_LT_OS], new_sym) == FAILURE)
3231 case INTRINSIC_LE_OS:
3232 if (check_new_interface (ns->op[INTRINSIC_LE], new_sym) == FAILURE ||
3233 check_new_interface (ns->op[INTRINSIC_LE_OS], new_sym) == FAILURE)
3238 if (check_new_interface (ns->op[current_interface.op], new_sym) == FAILURE)
3242 head = ¤t_interface.ns->op[current_interface.op];
3245 case INTERFACE_GENERIC:
3246 for (ns = current_interface.ns; ns; ns = ns->parent)
3248 gfc_find_symbol (current_interface.sym->name, ns, 0, &sym);
3252 if (check_new_interface (sym->generic, new_sym) == FAILURE)
3256 head = ¤t_interface.sym->generic;
3259 case INTERFACE_USER_OP:
3260 if (check_new_interface (current_interface.uop->op, new_sym)
3264 head = ¤t_interface.uop->op;
3268 gfc_internal_error ("gfc_add_interface(): Bad interface type");
3271 intr = gfc_get_interface ();
3272 intr->sym = new_sym;
3273 intr->where = gfc_current_locus;
3283 gfc_current_interface_head (void)
3285 switch (current_interface.type)
3287 case INTERFACE_INTRINSIC_OP:
3288 return current_interface.ns->op[current_interface.op];
3291 case INTERFACE_GENERIC:
3292 return current_interface.sym->generic;
3295 case INTERFACE_USER_OP:
3296 return current_interface.uop->op;
3306 gfc_set_current_interface_head (gfc_interface *i)
3308 switch (current_interface.type)
3310 case INTERFACE_INTRINSIC_OP:
3311 current_interface.ns->op[current_interface.op] = i;
3314 case INTERFACE_GENERIC:
3315 current_interface.sym->generic = i;
3318 case INTERFACE_USER_OP:
3319 current_interface.uop->op = i;
3328 /* Gets rid of a formal argument list. We do not free symbols.
3329 Symbols are freed when a namespace is freed. */
3332 gfc_free_formal_arglist (gfc_formal_arglist *p)
3334 gfc_formal_arglist *q;