]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* Deal with interfaces. |
cbe34bb5 | 2 | Copyright (C) 2000-2017 Free Software Foundation, Inc. |
6de9cd9a DN |
3 | Contributed by Andy Vaught |
4 | ||
9fc4d79b | 5 | This file is part of GCC. |
6de9cd9a | 6 | |
9fc4d79b TS |
7 | GCC is free software; you can redistribute it and/or modify it under |
8 | the terms of the GNU General Public License as published by the Free | |
d234d788 | 9 | Software Foundation; either version 3, or (at your option) any later |
9fc4d79b | 10 | version. |
6de9cd9a | 11 | |
9fc4d79b TS |
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
6de9cd9a DN |
16 | |
17 | You should have received a copy of the GNU General Public License | |
d234d788 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a DN |
20 | |
21 | ||
22 | /* Deal with interfaces. An explicit interface is represented as a | |
23 | singly linked list of formal argument structures attached to the | |
24 | relevant symbols. For an implicit interface, the arguments don't | |
25 | point to symbols. Explicit interfaces point to namespaces that | |
26 | contain the symbols within that interface. | |
27 | ||
28 | Implicit interfaces are linked together in a singly linked list | |
29 | along the next_if member of symbol nodes. Since a particular | |
30 | symbol can only have a single explicit interface, the symbol cannot | |
31 | be part of multiple lists and a single next-member suffices. | |
32 | ||
33 | This is not the case for general classes, though. An operator | |
34 | definition is independent of just about all other uses and has it's | |
35 | own head pointer. | |
36 | ||
37 | Nameless interfaces: | |
38 | Nameless interfaces create symbols with explicit interfaces within | |
39 | the current namespace. They are otherwise unlinked. | |
40 | ||
41 | Generic interfaces: | |
42 | The generic name points to a linked list of symbols. Each symbol | |
6892757c | 43 | has an explicit interface. Each explicit interface has its own |
6de9cd9a DN |
44 | namespace containing the arguments. Module procedures are symbols in |
45 | which the interface is added later when the module procedure is parsed. | |
46 | ||
47 | User operators: | |
48 | User-defined operators are stored in a their own set of symtrees | |
49 | separate from regular symbols. The symtrees point to gfc_user_op | |
50 | structures which in turn head up a list of relevant interfaces. | |
51 | ||
52 | Extended intrinsics and assignment: | |
53 | The head of these interface lists are stored in the containing namespace. | |
54 | ||
55 | Implicit interfaces: | |
56 | An implicit interface is represented as a singly linked list of | |
57 | formal argument list structures that don't point to any symbol | |
58 | nodes -- they just contain types. | |
59 | ||
60 | ||
61 | When a subprogram is defined, the program unit's name points to an | |
62 | interface as usual, but the link to the namespace is NULL and the | |
63 | formal argument list points to symbols within the same namespace as | |
64 | the program unit name. */ | |
65 | ||
66 | #include "config.h" | |
d22e4895 | 67 | #include "system.h" |
953bee7c | 68 | #include "coretypes.h" |
1916bcb5 | 69 | #include "options.h" |
6de9cd9a DN |
70 | #include "gfortran.h" |
71 | #include "match.h" | |
97f26732 | 72 | #include "arith.h" |
6de9cd9a | 73 | |
6de9cd9a DN |
74 | /* The current_interface structure holds information about the |
75 | interface currently being parsed. This structure is saved and | |
76 | restored during recursive interfaces. */ | |
77 | ||
78 | gfc_interface_info current_interface; | |
79 | ||
80 | ||
81 | /* Free a singly linked list of gfc_interface structures. */ | |
82 | ||
83 | void | |
b251af97 | 84 | gfc_free_interface (gfc_interface *intr) |
6de9cd9a DN |
85 | { |
86 | gfc_interface *next; | |
87 | ||
88 | for (; intr; intr = next) | |
89 | { | |
90 | next = intr->next; | |
cede9502 | 91 | free (intr); |
6de9cd9a DN |
92 | } |
93 | } | |
94 | ||
95 | ||
96 | /* Change the operators unary plus and minus into binary plus and | |
97 | minus respectively, leaving the rest unchanged. */ | |
98 | ||
99 | static gfc_intrinsic_op | |
e8d4f3fc | 100 | fold_unary_intrinsic (gfc_intrinsic_op op) |
6de9cd9a | 101 | { |
a1ee985f | 102 | switch (op) |
6de9cd9a DN |
103 | { |
104 | case INTRINSIC_UPLUS: | |
a1ee985f | 105 | op = INTRINSIC_PLUS; |
6de9cd9a DN |
106 | break; |
107 | case INTRINSIC_UMINUS: | |
a1ee985f | 108 | op = INTRINSIC_MINUS; |
6de9cd9a DN |
109 | break; |
110 | default: | |
111 | break; | |
112 | } | |
113 | ||
a1ee985f | 114 | return op; |
6de9cd9a DN |
115 | } |
116 | ||
117 | ||
195d1431 PT |
118 | /* Return the operator depending on the DTIO moded string. Note that |
119 | these are not operators in the normal sense and so have been placed | |
120 | beyond GFC_INTRINSIC_END in gfortran.h:enum gfc_intrinsic_op. */ | |
e73d3ca6 PT |
121 | |
122 | static gfc_intrinsic_op | |
123 | dtio_op (char* mode) | |
124 | { | |
125 | if (strncmp (mode, "formatted", 9) == 0) | |
126 | return INTRINSIC_FORMATTED; | |
127 | if (strncmp (mode, "unformatted", 9) == 0) | |
128 | return INTRINSIC_UNFORMATTED; | |
129 | return INTRINSIC_NONE; | |
130 | } | |
131 | ||
132 | ||
6de9cd9a | 133 | /* Match a generic specification. Depending on which type of |
a1ee985f | 134 | interface is found, the 'name' or 'op' pointers may be set. |
6de9cd9a DN |
135 | This subroutine doesn't return MATCH_NO. */ |
136 | ||
137 | match | |
b251af97 | 138 | gfc_match_generic_spec (interface_type *type, |
6de9cd9a | 139 | char *name, |
a1ee985f | 140 | gfc_intrinsic_op *op) |
6de9cd9a DN |
141 | { |
142 | char buffer[GFC_MAX_SYMBOL_LEN + 1]; | |
143 | match m; | |
144 | gfc_intrinsic_op i; | |
145 | ||
146 | if (gfc_match (" assignment ( = )") == MATCH_YES) | |
147 | { | |
148 | *type = INTERFACE_INTRINSIC_OP; | |
a1ee985f | 149 | *op = INTRINSIC_ASSIGN; |
6de9cd9a DN |
150 | return MATCH_YES; |
151 | } | |
152 | ||
153 | if (gfc_match (" operator ( %o )", &i) == MATCH_YES) | |
154 | { /* Operator i/f */ | |
155 | *type = INTERFACE_INTRINSIC_OP; | |
e8d4f3fc | 156 | *op = fold_unary_intrinsic (i); |
6de9cd9a DN |
157 | return MATCH_YES; |
158 | } | |
159 | ||
e8d4f3fc | 160 | *op = INTRINSIC_NONE; |
6de9cd9a DN |
161 | if (gfc_match (" operator ( ") == MATCH_YES) |
162 | { | |
163 | m = gfc_match_defined_op_name (buffer, 1); | |
164 | if (m == MATCH_NO) | |
165 | goto syntax; | |
166 | if (m != MATCH_YES) | |
167 | return MATCH_ERROR; | |
168 | ||
169 | m = gfc_match_char (')'); | |
170 | if (m == MATCH_NO) | |
171 | goto syntax; | |
172 | if (m != MATCH_YES) | |
173 | return MATCH_ERROR; | |
174 | ||
175 | strcpy (name, buffer); | |
176 | *type = INTERFACE_USER_OP; | |
177 | return MATCH_YES; | |
178 | } | |
179 | ||
e73d3ca6 PT |
180 | if (gfc_match (" read ( %n )", buffer) == MATCH_YES) |
181 | { | |
182 | *op = dtio_op (buffer); | |
183 | if (*op == INTRINSIC_FORMATTED) | |
184 | { | |
185 | strcpy (name, gfc_code2string (dtio_procs, DTIO_RF)); | |
186 | *type = INTERFACE_DTIO; | |
187 | } | |
188 | if (*op == INTRINSIC_UNFORMATTED) | |
189 | { | |
190 | strcpy (name, gfc_code2string (dtio_procs, DTIO_RUF)); | |
191 | *type = INTERFACE_DTIO; | |
192 | } | |
193 | if (*op != INTRINSIC_NONE) | |
194 | return MATCH_YES; | |
195 | } | |
196 | ||
197 | if (gfc_match (" write ( %n )", buffer) == MATCH_YES) | |
198 | { | |
199 | *op = dtio_op (buffer); | |
200 | if (*op == INTRINSIC_FORMATTED) | |
201 | { | |
202 | strcpy (name, gfc_code2string (dtio_procs, DTIO_WF)); | |
203 | *type = INTERFACE_DTIO; | |
204 | } | |
205 | if (*op == INTRINSIC_UNFORMATTED) | |
206 | { | |
207 | strcpy (name, gfc_code2string (dtio_procs, DTIO_WUF)); | |
208 | *type = INTERFACE_DTIO; | |
209 | } | |
210 | if (*op != INTRINSIC_NONE) | |
211 | return MATCH_YES; | |
212 | } | |
213 | ||
6de9cd9a DN |
214 | if (gfc_match_name (buffer) == MATCH_YES) |
215 | { | |
216 | strcpy (name, buffer); | |
217 | *type = INTERFACE_GENERIC; | |
218 | return MATCH_YES; | |
219 | } | |
220 | ||
221 | *type = INTERFACE_NAMELESS; | |
222 | return MATCH_YES; | |
223 | ||
224 | syntax: | |
225 | gfc_error ("Syntax error in generic specification at %C"); | |
226 | return MATCH_ERROR; | |
227 | } | |
228 | ||
229 | ||
9e1d712c TB |
230 | /* Match one of the five F95 forms of an interface statement. The |
231 | matcher for the abstract interface follows. */ | |
6de9cd9a DN |
232 | |
233 | match | |
234 | gfc_match_interface (void) | |
235 | { | |
236 | char name[GFC_MAX_SYMBOL_LEN + 1]; | |
237 | interface_type type; | |
238 | gfc_symbol *sym; | |
a1ee985f | 239 | gfc_intrinsic_op op; |
6de9cd9a DN |
240 | match m; |
241 | ||
242 | m = gfc_match_space (); | |
243 | ||
a1ee985f | 244 | if (gfc_match_generic_spec (&type, name, &op) == MATCH_ERROR) |
6de9cd9a DN |
245 | return MATCH_ERROR; |
246 | ||
6de9cd9a DN |
247 | /* If we're not looking at the end of the statement now, or if this |
248 | is not a nameless interface but we did not see a space, punt. */ | |
249 | if (gfc_match_eos () != MATCH_YES | |
b251af97 | 250 | || (type != INTERFACE_NAMELESS && m != MATCH_YES)) |
6de9cd9a | 251 | { |
b251af97 SK |
252 | gfc_error ("Syntax error: Trailing garbage in INTERFACE statement " |
253 | "at %C"); | |
6de9cd9a DN |
254 | return MATCH_ERROR; |
255 | } | |
256 | ||
257 | current_interface.type = type; | |
258 | ||
259 | switch (type) | |
260 | { | |
e73d3ca6 | 261 | case INTERFACE_DTIO: |
6de9cd9a DN |
262 | case INTERFACE_GENERIC: |
263 | if (gfc_get_symbol (name, NULL, &sym)) | |
264 | return MATCH_ERROR; | |
265 | ||
8b704316 | 266 | if (!sym->attr.generic |
524af0d6 | 267 | && !gfc_add_generic (&sym->attr, sym->name, NULL)) |
6de9cd9a DN |
268 | return MATCH_ERROR; |
269 | ||
e5d7f6f7 FXC |
270 | if (sym->attr.dummy) |
271 | { | |
c4100eae | 272 | gfc_error ("Dummy procedure %qs at %C cannot have a " |
e5d7f6f7 FXC |
273 | "generic interface", sym->name); |
274 | return MATCH_ERROR; | |
275 | } | |
276 | ||
6de9cd9a DN |
277 | current_interface.sym = gfc_new_block = sym; |
278 | break; | |
279 | ||
280 | case INTERFACE_USER_OP: | |
281 | current_interface.uop = gfc_get_uop (name); | |
282 | break; | |
283 | ||
284 | case INTERFACE_INTRINSIC_OP: | |
a1ee985f | 285 | current_interface.op = op; |
6de9cd9a DN |
286 | break; |
287 | ||
288 | case INTERFACE_NAMELESS: | |
9e1d712c | 289 | case INTERFACE_ABSTRACT: |
6de9cd9a DN |
290 | break; |
291 | } | |
292 | ||
293 | return MATCH_YES; | |
294 | } | |
295 | ||
296 | ||
9e1d712c TB |
297 | |
298 | /* Match a F2003 abstract interface. */ | |
299 | ||
300 | match | |
301 | gfc_match_abstract_interface (void) | |
302 | { | |
303 | match m; | |
304 | ||
524af0d6 | 305 | if (!gfc_notify_std (GFC_STD_F2003, "ABSTRACT INTERFACE at %C")) |
9e1d712c TB |
306 | return MATCH_ERROR; |
307 | ||
308 | m = gfc_match_eos (); | |
309 | ||
310 | if (m != MATCH_YES) | |
311 | { | |
312 | gfc_error ("Syntax error in ABSTRACT INTERFACE statement at %C"); | |
313 | return MATCH_ERROR; | |
314 | } | |
315 | ||
316 | current_interface.type = INTERFACE_ABSTRACT; | |
317 | ||
318 | return m; | |
319 | } | |
320 | ||
321 | ||
6de9cd9a DN |
322 | /* Match the different sort of generic-specs that can be present after |
323 | the END INTERFACE itself. */ | |
324 | ||
325 | match | |
326 | gfc_match_end_interface (void) | |
327 | { | |
328 | char name[GFC_MAX_SYMBOL_LEN + 1]; | |
329 | interface_type type; | |
a1ee985f | 330 | gfc_intrinsic_op op; |
6de9cd9a DN |
331 | match m; |
332 | ||
333 | m = gfc_match_space (); | |
334 | ||
a1ee985f | 335 | if (gfc_match_generic_spec (&type, name, &op) == MATCH_ERROR) |
6de9cd9a DN |
336 | return MATCH_ERROR; |
337 | ||
338 | /* If we're not looking at the end of the statement now, or if this | |
339 | is not a nameless interface but we did not see a space, punt. */ | |
340 | if (gfc_match_eos () != MATCH_YES | |
b251af97 | 341 | || (type != INTERFACE_NAMELESS && m != MATCH_YES)) |
6de9cd9a | 342 | { |
b251af97 SK |
343 | gfc_error ("Syntax error: Trailing garbage in END INTERFACE " |
344 | "statement at %C"); | |
6de9cd9a DN |
345 | return MATCH_ERROR; |
346 | } | |
347 | ||
348 | m = MATCH_YES; | |
349 | ||
350 | switch (current_interface.type) | |
351 | { | |
352 | case INTERFACE_NAMELESS: | |
9e1d712c TB |
353 | case INTERFACE_ABSTRACT: |
354 | if (type != INTERFACE_NAMELESS) | |
6de9cd9a DN |
355 | { |
356 | gfc_error ("Expected a nameless interface at %C"); | |
357 | m = MATCH_ERROR; | |
358 | } | |
359 | ||
360 | break; | |
361 | ||
362 | case INTERFACE_INTRINSIC_OP: | |
a1ee985f | 363 | if (type != current_interface.type || op != current_interface.op) |
6de9cd9a DN |
364 | { |
365 | ||
366 | if (current_interface.op == INTRINSIC_ASSIGN) | |
c6d6e62f SK |
367 | { |
368 | m = MATCH_ERROR; | |
a4d9b221 | 369 | gfc_error ("Expected %<END INTERFACE ASSIGNMENT (=)%> at %C"); |
c6d6e62f | 370 | } |
6de9cd9a | 371 | else |
c6d6e62f | 372 | { |
915acec4 | 373 | const char *s1, *s2; |
c6d6e62f SK |
374 | s1 = gfc_op2string (current_interface.op); |
375 | s2 = gfc_op2string (op); | |
376 | ||
377 | /* The following if-statements are used to enforce C1202 | |
378 | from F2003. */ | |
524af0d6 JB |
379 | if ((strcmp(s1, "==") == 0 && strcmp (s2, ".eq.") == 0) |
380 | || (strcmp(s1, ".eq.") == 0 && strcmp (s2, "==") == 0)) | |
c6d6e62f | 381 | break; |
524af0d6 JB |
382 | if ((strcmp(s1, "/=") == 0 && strcmp (s2, ".ne.") == 0) |
383 | || (strcmp(s1, ".ne.") == 0 && strcmp (s2, "/=") == 0)) | |
c6d6e62f | 384 | break; |
524af0d6 JB |
385 | if ((strcmp(s1, "<=") == 0 && strcmp (s2, ".le.") == 0) |
386 | || (strcmp(s1, ".le.") == 0 && strcmp (s2, "<=") == 0)) | |
c6d6e62f | 387 | break; |
524af0d6 JB |
388 | if ((strcmp(s1, "<") == 0 && strcmp (s2, ".lt.") == 0) |
389 | || (strcmp(s1, ".lt.") == 0 && strcmp (s2, "<") == 0)) | |
c6d6e62f | 390 | break; |
524af0d6 JB |
391 | if ((strcmp(s1, ">=") == 0 && strcmp (s2, ".ge.") == 0) |
392 | || (strcmp(s1, ".ge.") == 0 && strcmp (s2, ">=") == 0)) | |
c6d6e62f | 393 | break; |
524af0d6 JB |
394 | if ((strcmp(s1, ">") == 0 && strcmp (s2, ".gt.") == 0) |
395 | || (strcmp(s1, ".gt.") == 0 && strcmp (s2, ">") == 0)) | |
c6d6e62f SK |
396 | break; |
397 | ||
398 | m = MATCH_ERROR; | |
898344a9 SK |
399 | if (strcmp(s2, "none") == 0) |
400 | gfc_error ("Expecting %<END INTERFACE OPERATOR (%s)%> " | |
77be9417 | 401 | "at %C", s1); |
e73d3ca6 | 402 | else |
898344a9 | 403 | gfc_error ("Expecting %<END INTERFACE OPERATOR (%s)%> at %C, " |
77be9417 | 404 | "but got %qs", s1, s2); |
c6d6e62f | 405 | } |
8b704316 | 406 | |
6de9cd9a DN |
407 | } |
408 | ||
409 | break; | |
410 | ||
411 | case INTERFACE_USER_OP: | |
412 | /* Comparing the symbol node names is OK because only use-associated | |
b251af97 | 413 | symbols can be renamed. */ |
6de9cd9a | 414 | if (type != current_interface.type |
9b46f94f | 415 | || strcmp (current_interface.uop->name, name) != 0) |
6de9cd9a | 416 | { |
a4d9b221 | 417 | gfc_error ("Expecting %<END INTERFACE OPERATOR (.%s.)%> at %C", |
55898b2c | 418 | current_interface.uop->name); |
6de9cd9a DN |
419 | m = MATCH_ERROR; |
420 | } | |
421 | ||
422 | break; | |
423 | ||
e73d3ca6 | 424 | case INTERFACE_DTIO: |
6de9cd9a DN |
425 | case INTERFACE_GENERIC: |
426 | if (type != current_interface.type | |
427 | || strcmp (current_interface.sym->name, name) != 0) | |
428 | { | |
a4d9b221 | 429 | gfc_error ("Expecting %<END INTERFACE %s%> at %C", |
6de9cd9a DN |
430 | current_interface.sym->name); |
431 | m = MATCH_ERROR; | |
432 | } | |
433 | ||
434 | break; | |
435 | } | |
436 | ||
437 | return m; | |
438 | } | |
439 | ||
440 | ||
5f88e9b2 FR |
441 | /* Return whether the component was defined anonymously. */ |
442 | ||
443 | static bool | |
444 | is_anonymous_component (gfc_component *cmp) | |
445 | { | |
446 | /* Only UNION and MAP components are anonymous. In the case of a MAP, | |
447 | the derived type symbol is FL_STRUCT and the component name looks like mM*. | |
448 | This is the only case in which the second character of a component name is | |
449 | uppercase. */ | |
450 | return cmp->ts.type == BT_UNION | |
451 | || (cmp->ts.type == BT_DERIVED | |
452 | && cmp->ts.u.derived->attr.flavor == FL_STRUCT | |
453 | && cmp->name[0] && cmp->name[1] && ISUPPER (cmp->name[1])); | |
454 | } | |
455 | ||
456 | ||
457 | /* Return whether the derived type was defined anonymously. */ | |
458 | ||
459 | static bool | |
460 | is_anonymous_dt (gfc_symbol *derived) | |
461 | { | |
462 | /* UNION and MAP types are always anonymous. Otherwise, only nested STRUCTURE | |
463 | types can be anonymous. For anonymous MAP/STRUCTURE, we have FL_STRUCT | |
464 | and the type name looks like XX*. This is the only case in which the | |
465 | second character of a type name is uppercase. */ | |
466 | return derived->attr.flavor == FL_UNION | |
467 | || (derived->attr.flavor == FL_STRUCT | |
468 | && derived->name[0] && derived->name[1] && ISUPPER (derived->name[1])); | |
469 | } | |
470 | ||
471 | ||
f6288c24 FR |
472 | /* Compare components according to 4.4.2 of the Fortran standard. */ |
473 | ||
f3e1097b | 474 | static bool |
f6288c24 FR |
475 | compare_components (gfc_component *cmp1, gfc_component *cmp2, |
476 | gfc_symbol *derived1, gfc_symbol *derived2) | |
477 | { | |
5f88e9b2 FR |
478 | /* Compare names, but not for anonymous components such as UNION or MAP. */ |
479 | if (!is_anonymous_component (cmp1) && !is_anonymous_component (cmp2) | |
480 | && strcmp (cmp1->name, cmp2->name) != 0) | |
f3e1097b | 481 | return false; |
f6288c24 FR |
482 | |
483 | if (cmp1->attr.access != cmp2->attr.access) | |
f3e1097b | 484 | return false; |
f6288c24 FR |
485 | |
486 | if (cmp1->attr.pointer != cmp2->attr.pointer) | |
f3e1097b | 487 | return false; |
f6288c24 FR |
488 | |
489 | if (cmp1->attr.dimension != cmp2->attr.dimension) | |
f3e1097b | 490 | return false; |
f6288c24 FR |
491 | |
492 | if (cmp1->attr.allocatable != cmp2->attr.allocatable) | |
f3e1097b | 493 | return false; |
f6288c24 FR |
494 | |
495 | if (cmp1->attr.dimension && gfc_compare_array_spec (cmp1->as, cmp2->as) == 0) | |
f3e1097b | 496 | return false; |
f6288c24 | 497 | |
56d3a930 FR |
498 | if (cmp1->ts.type == BT_CHARACTER && cmp2->ts.type == BT_CHARACTER) |
499 | { | |
500 | gfc_charlen *l1 = cmp1->ts.u.cl; | |
501 | gfc_charlen *l2 = cmp2->ts.u.cl; | |
502 | if (l1 && l2 && l1->length && l2->length | |
503 | && l1->length->expr_type == EXPR_CONSTANT | |
504 | && l2->length->expr_type == EXPR_CONSTANT | |
505 | && gfc_dep_compare_expr (l1->length, l2->length) != 0) | |
f3e1097b | 506 | return false; |
56d3a930 FR |
507 | } |
508 | ||
f6288c24 FR |
509 | /* Make sure that link lists do not put this function into an |
510 | endless recursive loop! */ | |
511 | if (!(cmp1->ts.type == BT_DERIVED && derived1 == cmp1->ts.u.derived) | |
512 | && !(cmp2->ts.type == BT_DERIVED && derived2 == cmp2->ts.u.derived) | |
f3e1097b JW |
513 | && !gfc_compare_types (&cmp1->ts, &cmp2->ts)) |
514 | return false; | |
f6288c24 FR |
515 | |
516 | else if ( (cmp1->ts.type == BT_DERIVED && derived1 == cmp1->ts.u.derived) | |
517 | && !(cmp2->ts.type == BT_DERIVED && derived2 == cmp2->ts.u.derived)) | |
f3e1097b | 518 | return false; |
f6288c24 FR |
519 | |
520 | else if (!(cmp1->ts.type == BT_DERIVED && derived1 == cmp1->ts.u.derived) | |
521 | && (cmp2->ts.type == BT_DERIVED && derived2 == cmp2->ts.u.derived)) | |
f3e1097b | 522 | return false; |
f6288c24 | 523 | |
f3e1097b | 524 | return true; |
f6288c24 FR |
525 | } |
526 | ||
527 | ||
528 | /* Compare two union types by comparing the components of their maps. | |
529 | Because unions and maps are anonymous their types get special internal | |
530 | names; therefore the usual derived type comparison will fail on them. | |
531 | ||
532 | Returns nonzero if equal, as with gfc_compare_derived_types. Also as with | |
533 | gfc_compare_derived_types, 'equal' is closer to meaning 'duplicate | |
534 | definitions' than 'equivalent structure'. */ | |
535 | ||
f3e1097b JW |
536 | static bool |
537 | compare_union_types (gfc_symbol *un1, gfc_symbol *un2) | |
f6288c24 FR |
538 | { |
539 | gfc_component *map1, *map2, *cmp1, *cmp2; | |
c39747d2 | 540 | gfc_symbol *map1_t, *map2_t; |
f6288c24 FR |
541 | |
542 | if (un1->attr.flavor != FL_UNION || un2->attr.flavor != FL_UNION) | |
f3e1097b | 543 | return false; |
f6288c24 | 544 | |
908b8296 | 545 | if (un1->attr.zero_comp != un2->attr.zero_comp) |
f3e1097b | 546 | return false; |
908b8296 FR |
547 | |
548 | if (un1->attr.zero_comp) | |
f3e1097b | 549 | return true; |
908b8296 | 550 | |
f6288c24 FR |
551 | map1 = un1->components; |
552 | map2 = un2->components; | |
553 | ||
554 | /* In terms of 'equality' here we are worried about types which are | |
555 | declared the same in two places, not types that represent equivalent | |
556 | structures. (This is common because of FORTRAN's weird scoping rules.) | |
557 | Though two unions with their maps in different orders could be equivalent, | |
558 | we will say they are not equal for the purposes of this test; therefore | |
559 | we compare the maps sequentially. */ | |
560 | for (;;) | |
05b8fcb4 FR |
561 | { |
562 | map1_t = map1->ts.u.derived; | |
563 | map2_t = map2->ts.u.derived; | |
c39747d2 | 564 | |
05b8fcb4 FR |
565 | cmp1 = map1_t->components; |
566 | cmp2 = map2_t->components; | |
c39747d2 | 567 | |
05b8fcb4 FR |
568 | /* Protect against null components. */ |
569 | if (map1_t->attr.zero_comp != map2_t->attr.zero_comp) | |
f3e1097b | 570 | return false; |
c39747d2 | 571 | |
05b8fcb4 | 572 | if (map1_t->attr.zero_comp) |
f3e1097b | 573 | return true; |
c39747d2 | 574 | |
05b8fcb4 FR |
575 | for (;;) |
576 | { | |
577 | /* No two fields will ever point to the same map type unless they are | |
578 | the same component, because one map field is created with its type | |
579 | declaration. Therefore don't worry about recursion here. */ | |
580 | /* TODO: worry about recursion into parent types of the unions? */ | |
f3e1097b JW |
581 | if (!compare_components (cmp1, cmp2, map1_t, map2_t)) |
582 | return false; | |
05b8fcb4 FR |
583 | |
584 | cmp1 = cmp1->next; | |
585 | cmp2 = cmp2->next; | |
586 | ||
587 | if (cmp1 == NULL && cmp2 == NULL) | |
588 | break; | |
589 | if (cmp1 == NULL || cmp2 == NULL) | |
f3e1097b | 590 | return false; |
05b8fcb4 | 591 | } |
f6288c24 | 592 | |
05b8fcb4 FR |
593 | map1 = map1->next; |
594 | map2 = map2->next; | |
f6288c24 | 595 | |
05b8fcb4 FR |
596 | if (map1 == NULL && map2 == NULL) |
597 | break; | |
598 | if (map1 == NULL || map2 == NULL) | |
f3e1097b | 599 | return false; |
f6288c24 FR |
600 | } |
601 | ||
f3e1097b | 602 | return true; |
f6288c24 FR |
603 | } |
604 | ||
605 | ||
606 | ||
e0e85e06 PT |
607 | /* Compare two derived types using the criteria in 4.4.2 of the standard, |
608 | recursing through gfc_compare_types for the components. */ | |
6de9cd9a | 609 | |
f3e1097b | 610 | bool |
b251af97 | 611 | gfc_compare_derived_types (gfc_symbol *derived1, gfc_symbol *derived2) |
6de9cd9a | 612 | { |
f6288c24 | 613 | gfc_component *cmp1, *cmp2; |
6de9cd9a | 614 | |
cf2b3c22 | 615 | if (derived1 == derived2) |
f3e1097b | 616 | return true; |
cf2b3c22 | 617 | |
c7082171 SK |
618 | if (!derived1 || !derived2) |
619 | gfc_internal_error ("gfc_compare_derived_types: invalid derived type"); | |
c6423ef3 | 620 | |
00074dd8 FR |
621 | /* Compare UNION types specially. */ |
622 | if (derived1->attr.flavor == FL_UNION || derived2->attr.flavor == FL_UNION) | |
f3e1097b | 623 | return compare_union_types (derived1, derived2); |
00074dd8 | 624 | |
6de9cd9a DN |
625 | /* Special case for comparing derived types across namespaces. If the |
626 | true names and module names are the same and the module name is | |
627 | nonnull, then they are equal. */ | |
c6423ef3 | 628 | if (strcmp (derived1->name, derived2->name) == 0 |
b251af97 SK |
629 | && derived1->module != NULL && derived2->module != NULL |
630 | && strcmp (derived1->module, derived2->module) == 0) | |
f3e1097b | 631 | return true; |
6de9cd9a DN |
632 | |
633 | /* Compare type via the rules of the standard. Both types must have | |
f6288c24 FR |
634 | the SEQUENCE or BIND(C) attribute to be equal. STRUCTUREs are special |
635 | because they can be anonymous; therefore two structures with different | |
636 | names may be equal. */ | |
6de9cd9a | 637 | |
5f88e9b2 FR |
638 | /* Compare names, but not for anonymous types such as UNION or MAP. */ |
639 | if (!is_anonymous_dt (derived1) && !is_anonymous_dt (derived2) | |
640 | && strcmp (derived1->name, derived2->name) != 0) | |
f3e1097b | 641 | return false; |
6de9cd9a | 642 | |
e0e85e06 | 643 | if (derived1->component_access == ACCESS_PRIVATE |
b251af97 | 644 | || derived2->component_access == ACCESS_PRIVATE) |
f3e1097b | 645 | return false; |
6de9cd9a | 646 | |
a9e88ec6 TB |
647 | if (!(derived1->attr.sequence && derived2->attr.sequence) |
648 | && !(derived1->attr.is_bind_c && derived2->attr.is_bind_c)) | |
f3e1097b | 649 | return false; |
6de9cd9a | 650 | |
f6288c24 FR |
651 | /* Protect against null components. */ |
652 | if (derived1->attr.zero_comp != derived2->attr.zero_comp) | |
f3e1097b | 653 | return false; |
f6288c24 FR |
654 | |
655 | if (derived1->attr.zero_comp) | |
f3e1097b | 656 | return true; |
f6288c24 FR |
657 | |
658 | cmp1 = derived1->components; | |
659 | cmp2 = derived2->components; | |
e0e85e06 | 660 | |
6de9cd9a DN |
661 | /* Since subtypes of SEQUENCE types must be SEQUENCE types as well, a |
662 | simple test can speed things up. Otherwise, lots of things have to | |
663 | match. */ | |
664 | for (;;) | |
665 | { | |
f6288c24 | 666 | if (!compare_components (cmp1, cmp2, derived1, derived2)) |
f3e1097b | 667 | return false; |
6de9cd9a | 668 | |
f6288c24 FR |
669 | cmp1 = cmp1->next; |
670 | cmp2 = cmp2->next; | |
2eae3dc7 | 671 | |
f6288c24 | 672 | if (cmp1 == NULL && cmp2 == NULL) |
6de9cd9a | 673 | break; |
f6288c24 | 674 | if (cmp1 == NULL || cmp2 == NULL) |
f3e1097b | 675 | return false; |
6de9cd9a DN |
676 | } |
677 | ||
f3e1097b | 678 | return true; |
6de9cd9a DN |
679 | } |
680 | ||
b251af97 | 681 | |
e0e85e06 PT |
682 | /* Compare two typespecs, recursively if necessary. */ |
683 | ||
f3e1097b | 684 | bool |
b251af97 | 685 | gfc_compare_types (gfc_typespec *ts1, gfc_typespec *ts2) |
e0e85e06 | 686 | { |
a8b3b0b6 CR |
687 | /* See if one of the typespecs is a BT_VOID, which is what is being used |
688 | to allow the funcs like c_f_pointer to accept any pointer type. | |
689 | TODO: Possibly should narrow this to just the one typespec coming in | |
690 | that is for the formal arg, but oh well. */ | |
691 | if (ts1->type == BT_VOID || ts2->type == BT_VOID) | |
f3e1097b | 692 | return true; |
8b704316 | 693 | |
77b7d71e AV |
694 | /* The _data component is not always present, therefore check for its |
695 | presence before assuming, that its derived->attr is available. | |
696 | When the _data component is not present, then nevertheless the | |
697 | unlimited_polymorphic flag may be set in the derived type's attr. */ | |
698 | if (ts1->type == BT_CLASS && ts1->u.derived->components | |
699 | && ((ts1->u.derived->attr.is_class | |
700 | && ts1->u.derived->components->ts.u.derived->attr | |
701 | .unlimited_polymorphic) | |
702 | || ts1->u.derived->attr.unlimited_polymorphic)) | |
f3e1097b | 703 | return true; |
8b704316 PT |
704 | |
705 | /* F2003: C717 */ | |
706 | if (ts2->type == BT_CLASS && ts1->type == BT_DERIVED | |
77b7d71e AV |
707 | && ts2->u.derived->components |
708 | && ((ts2->u.derived->attr.is_class | |
709 | && ts2->u.derived->components->ts.u.derived->attr | |
710 | .unlimited_polymorphic) | |
711 | || ts2->u.derived->attr.unlimited_polymorphic) | |
8b704316 | 712 | && (ts1->u.derived->attr.sequence || ts1->u.derived->attr.is_bind_c)) |
f3e1097b | 713 | return true; |
8b704316 | 714 | |
cf2b3c22 | 715 | if (ts1->type != ts2->type |
908b8296 FR |
716 | && ((ts1->type != BT_DERIVED && ts1->type != BT_CLASS) |
717 | || (ts2->type != BT_DERIVED && ts2->type != BT_CLASS))) | |
f3e1097b | 718 | return false; |
908b8296 FR |
719 | |
720 | if (ts1->type == BT_UNION) | |
f3e1097b | 721 | return compare_union_types (ts1->u.derived, ts2->u.derived); |
908b8296 | 722 | |
cf2b3c22 | 723 | if (ts1->type != BT_DERIVED && ts1->type != BT_CLASS) |
e0e85e06 PT |
724 | return (ts1->kind == ts2->kind); |
725 | ||
726 | /* Compare derived types. */ | |
f6288c24 | 727 | return gfc_type_compatible (ts1, ts2); |
e0e85e06 PT |
728 | } |
729 | ||
6de9cd9a | 730 | |
f3e1097b | 731 | static bool |
e7333b69 JW |
732 | compare_type (gfc_symbol *s1, gfc_symbol *s2) |
733 | { | |
734 | if (s2->attr.ext_attr & (1 << EXT_ATTR_NO_ARG_CHECK)) | |
f3e1097b | 735 | return true; |
e7333b69 | 736 | |
60de1c7d TB |
737 | /* TYPE and CLASS of the same declared type are type compatible, |
738 | but have different characteristics. */ | |
739 | if ((s1->ts.type == BT_CLASS && s2->ts.type == BT_DERIVED) | |
740 | || (s1->ts.type == BT_DERIVED && s2->ts.type == BT_CLASS)) | |
f3e1097b | 741 | return false; |
60de1c7d | 742 | |
e7333b69 JW |
743 | return gfc_compare_types (&s1->ts, &s2->ts) || s2->ts.type == BT_ASSUMED; |
744 | } | |
745 | ||
6de9cd9a | 746 | |
f3e1097b | 747 | static bool |
e7333b69 | 748 | compare_rank (gfc_symbol *s1, gfc_symbol *s2) |
6de9cd9a | 749 | { |
aa6590cf | 750 | gfc_array_spec *as1, *as2; |
6de9cd9a DN |
751 | int r1, r2; |
752 | ||
e7333b69 | 753 | if (s2->attr.ext_attr & (1 << EXT_ATTR_NO_ARG_CHECK)) |
f3e1097b | 754 | return true; |
e7ac6a7c | 755 | |
aa6590cf JW |
756 | as1 = (s1->ts.type == BT_CLASS) ? CLASS_DATA (s1)->as : s1->as; |
757 | as2 = (s2->ts.type == BT_CLASS) ? CLASS_DATA (s2)->as : s2->as; | |
758 | ||
759 | r1 = as1 ? as1->rank : 0; | |
760 | r2 = as2 ? as2->rank : 0; | |
6de9cd9a | 761 | |
e7333b69 | 762 | if (r1 != r2 && (!as2 || as2->type != AS_ASSUMED_RANK)) |
f3e1097b | 763 | return false; /* Ranks differ. */ |
6de9cd9a | 764 | |
f3e1097b | 765 | return true; |
e7333b69 JW |
766 | } |
767 | ||
768 | ||
769 | /* Given two symbols that are formal arguments, compare their ranks | |
f3e1097b JW |
770 | and types. Returns true if they have the same rank and type, |
771 | false otherwise. */ | |
e7333b69 | 772 | |
f3e1097b | 773 | static bool |
e7333b69 JW |
774 | compare_type_rank (gfc_symbol *s1, gfc_symbol *s2) |
775 | { | |
776 | return compare_type (s1, s2) && compare_rank (s1, s2); | |
6de9cd9a DN |
777 | } |
778 | ||
779 | ||
6de9cd9a DN |
780 | /* Given two symbols that are formal arguments, compare their types |
781 | and rank and their formal interfaces if they are both dummy | |
f3e1097b | 782 | procedures. Returns true if the same, false if different. */ |
6de9cd9a | 783 | |
f3e1097b | 784 | static bool |
b251af97 | 785 | compare_type_rank_if (gfc_symbol *s1, gfc_symbol *s2) |
6de9cd9a | 786 | { |
26f2ca2b | 787 | if (s1 == NULL || s2 == NULL) |
f3e1097b | 788 | return (s1 == s2); |
6de9cd9a | 789 | |
489ec4e3 | 790 | if (s1 == s2) |
f3e1097b | 791 | return true; |
489ec4e3 | 792 | |
6de9cd9a DN |
793 | if (s1->attr.flavor != FL_PROCEDURE && s2->attr.flavor != FL_PROCEDURE) |
794 | return compare_type_rank (s1, s2); | |
795 | ||
796 | if (s1->attr.flavor != FL_PROCEDURE || s2->attr.flavor != FL_PROCEDURE) | |
f3e1097b | 797 | return false; |
6de9cd9a | 798 | |
489ec4e3 PT |
799 | /* At this point, both symbols are procedures. It can happen that |
800 | external procedures are compared, where one is identified by usage | |
801 | to be a function or subroutine but the other is not. Check TKR | |
802 | nonetheless for these cases. */ | |
803 | if (s1->attr.function == 0 && s1->attr.subroutine == 0) | |
f3e1097b | 804 | return s1->attr.external ? compare_type_rank (s1, s2) : false; |
489ec4e3 PT |
805 | |
806 | if (s2->attr.function == 0 && s2->attr.subroutine == 0) | |
f3e1097b | 807 | return s2->attr.external ? compare_type_rank (s1, s2) : false; |
6de9cd9a | 808 | |
489ec4e3 | 809 | /* Now the type of procedure has been identified. */ |
6de9cd9a DN |
810 | if (s1->attr.function != s2->attr.function |
811 | || s1->attr.subroutine != s2->attr.subroutine) | |
f3e1097b | 812 | return false; |
6de9cd9a | 813 | |
f3e1097b JW |
814 | if (s1->attr.function && !compare_type_rank (s1, s2)) |
815 | return false; | |
6de9cd9a | 816 | |
993ef28f PT |
817 | /* Originally, gfortran recursed here to check the interfaces of passed |
818 | procedures. This is explicitly not required by the standard. */ | |
f3e1097b | 819 | return true; |
6de9cd9a DN |
820 | } |
821 | ||
822 | ||
823 | /* Given a formal argument list and a keyword name, search the list | |
824 | for that keyword. Returns the correct symbol node if found, NULL | |
825 | if not found. */ | |
826 | ||
827 | static gfc_symbol * | |
b251af97 | 828 | find_keyword_arg (const char *name, gfc_formal_arglist *f) |
6de9cd9a | 829 | { |
6de9cd9a DN |
830 | for (; f; f = f->next) |
831 | if (strcmp (f->sym->name, name) == 0) | |
832 | return f->sym; | |
833 | ||
834 | return NULL; | |
835 | } | |
836 | ||
837 | ||
838 | /******** Interface checking subroutines **********/ | |
839 | ||
840 | ||
841 | /* Given an operator interface and the operator, make sure that all | |
842 | interfaces for that operator are legal. */ | |
843 | ||
94747289 DK |
844 | bool |
845 | gfc_check_operator_interface (gfc_symbol *sym, gfc_intrinsic_op op, | |
846 | locus opwhere) | |
6de9cd9a DN |
847 | { |
848 | gfc_formal_arglist *formal; | |
849 | sym_intent i1, i2; | |
6de9cd9a | 850 | bt t1, t2; |
27189292 | 851 | int args, r1, r2, k1, k2; |
6de9cd9a | 852 | |
94747289 | 853 | gcc_assert (sym); |
6de9cd9a DN |
854 | |
855 | args = 0; | |
856 | t1 = t2 = BT_UNKNOWN; | |
857 | i1 = i2 = INTENT_UNKNOWN; | |
27189292 FXC |
858 | r1 = r2 = -1; |
859 | k1 = k2 = -1; | |
6de9cd9a | 860 | |
4cbc9039 | 861 | for (formal = gfc_sym_get_dummy_args (sym); formal; formal = formal->next) |
6de9cd9a | 862 | { |
94747289 DK |
863 | gfc_symbol *fsym = formal->sym; |
864 | if (fsym == NULL) | |
8c086c9c PT |
865 | { |
866 | gfc_error ("Alternate return cannot appear in operator " | |
94747289 DK |
867 | "interface at %L", &sym->declared_at); |
868 | return false; | |
8c086c9c | 869 | } |
6de9cd9a DN |
870 | if (args == 0) |
871 | { | |
94747289 DK |
872 | t1 = fsym->ts.type; |
873 | i1 = fsym->attr.intent; | |
874 | r1 = (fsym->as != NULL) ? fsym->as->rank : 0; | |
875 | k1 = fsym->ts.kind; | |
6de9cd9a DN |
876 | } |
877 | if (args == 1) | |
878 | { | |
94747289 DK |
879 | t2 = fsym->ts.type; |
880 | i2 = fsym->attr.intent; | |
881 | r2 = (fsym->as != NULL) ? fsym->as->rank : 0; | |
882 | k2 = fsym->ts.kind; | |
6de9cd9a DN |
883 | } |
884 | args++; | |
885 | } | |
886 | ||
27189292 FXC |
887 | /* Only +, - and .not. can be unary operators. |
888 | .not. cannot be a binary operator. */ | |
a1ee985f KG |
889 | if (args == 0 || args > 2 || (args == 1 && op != INTRINSIC_PLUS |
890 | && op != INTRINSIC_MINUS | |
891 | && op != INTRINSIC_NOT) | |
892 | || (args == 2 && op == INTRINSIC_NOT)) | |
27189292 | 893 | { |
efb63364 TB |
894 | if (op == INTRINSIC_ASSIGN) |
895 | gfc_error ("Assignment operator interface at %L must have " | |
896 | "two arguments", &sym->declared_at); | |
897 | else | |
898 | gfc_error ("Operator interface at %L has the wrong number of arguments", | |
899 | &sym->declared_at); | |
94747289 | 900 | return false; |
27189292 FXC |
901 | } |
902 | ||
903 | /* Check that intrinsics are mapped to functions, except | |
904 | INTRINSIC_ASSIGN which should map to a subroutine. */ | |
a1ee985f | 905 | if (op == INTRINSIC_ASSIGN) |
6de9cd9a | 906 | { |
4cbc9039 JW |
907 | gfc_formal_arglist *dummy_args; |
908 | ||
6de9cd9a DN |
909 | if (!sym->attr.subroutine) |
910 | { | |
b251af97 | 911 | gfc_error ("Assignment operator interface at %L must be " |
94747289 DK |
912 | "a SUBROUTINE", &sym->declared_at); |
913 | return false; | |
6de9cd9a | 914 | } |
e19bb186 TB |
915 | |
916 | /* Allowed are (per F2003, 12.3.2.1.2 Defined assignments): | |
94747289 | 917 | - First argument an array with different rank than second, |
315d905f TB |
918 | - First argument is a scalar and second an array, |
919 | - Types and kinds do not conform, or | |
94747289 | 920 | - First argument is of derived type. */ |
4cbc9039 JW |
921 | dummy_args = gfc_sym_get_dummy_args (sym); |
922 | if (dummy_args->sym->ts.type != BT_DERIVED | |
923 | && dummy_args->sym->ts.type != BT_CLASS | |
315d905f | 924 | && (r2 == 0 || r1 == r2) |
4cbc9039 JW |
925 | && (dummy_args->sym->ts.type == dummy_args->next->sym->ts.type |
926 | || (gfc_numeric_ts (&dummy_args->sym->ts) | |
927 | && gfc_numeric_ts (&dummy_args->next->sym->ts)))) | |
8c086c9c | 928 | { |
b251af97 | 929 | gfc_error ("Assignment operator interface at %L must not redefine " |
94747289 DK |
930 | "an INTRINSIC type assignment", &sym->declared_at); |
931 | return false; | |
8c086c9c | 932 | } |
6de9cd9a DN |
933 | } |
934 | else | |
935 | { | |
936 | if (!sym->attr.function) | |
937 | { | |
938 | gfc_error ("Intrinsic operator interface at %L must be a FUNCTION", | |
94747289 DK |
939 | &sym->declared_at); |
940 | return false; | |
6de9cd9a DN |
941 | } |
942 | } | |
943 | ||
27189292 | 944 | /* Check intents on operator interfaces. */ |
a1ee985f | 945 | if (op == INTRINSIC_ASSIGN) |
6de9cd9a | 946 | { |
27189292 | 947 | if (i1 != INTENT_OUT && i1 != INTENT_INOUT) |
94747289 DK |
948 | { |
949 | gfc_error ("First argument of defined assignment at %L must be " | |
950 | "INTENT(OUT) or INTENT(INOUT)", &sym->declared_at); | |
951 | return false; | |
952 | } | |
27189292 FXC |
953 | |
954 | if (i2 != INTENT_IN) | |
94747289 DK |
955 | { |
956 | gfc_error ("Second argument of defined assignment at %L must be " | |
957 | "INTENT(IN)", &sym->declared_at); | |
958 | return false; | |
959 | } | |
27189292 FXC |
960 | } |
961 | else | |
962 | { | |
963 | if (i1 != INTENT_IN) | |
94747289 DK |
964 | { |
965 | gfc_error ("First argument of operator interface at %L must be " | |
966 | "INTENT(IN)", &sym->declared_at); | |
967 | return false; | |
968 | } | |
27189292 FXC |
969 | |
970 | if (args == 2 && i2 != INTENT_IN) | |
94747289 DK |
971 | { |
972 | gfc_error ("Second argument of operator interface at %L must be " | |
973 | "INTENT(IN)", &sym->declared_at); | |
974 | return false; | |
975 | } | |
27189292 FXC |
976 | } |
977 | ||
978 | /* From now on, all we have to do is check that the operator definition | |
979 | doesn't conflict with an intrinsic operator. The rules for this | |
980 | game are defined in 7.1.2 and 7.1.3 of both F95 and F2003 standards, | |
981 | as well as 12.3.2.1.1 of Fortran 2003: | |
982 | ||
983 | "If the operator is an intrinsic-operator (R310), the number of | |
984 | function arguments shall be consistent with the intrinsic uses of | |
985 | that operator, and the types, kind type parameters, or ranks of the | |
986 | dummy arguments shall differ from those required for the intrinsic | |
987 | operation (7.1.2)." */ | |
988 | ||
989 | #define IS_NUMERIC_TYPE(t) \ | |
990 | ((t) == BT_INTEGER || (t) == BT_REAL || (t) == BT_COMPLEX) | |
991 | ||
992 | /* Unary ops are easy, do them first. */ | |
a1ee985f | 993 | if (op == INTRINSIC_NOT) |
27189292 FXC |
994 | { |
995 | if (t1 == BT_LOGICAL) | |
6de9cd9a | 996 | goto bad_repl; |
27189292 | 997 | else |
94747289 | 998 | return true; |
27189292 | 999 | } |
6de9cd9a | 1000 | |
a1ee985f | 1001 | if (args == 1 && (op == INTRINSIC_PLUS || op == INTRINSIC_MINUS)) |
27189292 FXC |
1002 | { |
1003 | if (IS_NUMERIC_TYPE (t1)) | |
6de9cd9a | 1004 | goto bad_repl; |
27189292 | 1005 | else |
94747289 | 1006 | return true; |
27189292 | 1007 | } |
6de9cd9a | 1008 | |
27189292 FXC |
1009 | /* Character intrinsic operators have same character kind, thus |
1010 | operator definitions with operands of different character kinds | |
1011 | are always safe. */ | |
1012 | if (t1 == BT_CHARACTER && t2 == BT_CHARACTER && k1 != k2) | |
94747289 | 1013 | return true; |
6de9cd9a | 1014 | |
27189292 FXC |
1015 | /* Intrinsic operators always perform on arguments of same rank, |
1016 | so different ranks is also always safe. (rank == 0) is an exception | |
1017 | to that, because all intrinsic operators are elemental. */ | |
1018 | if (r1 != r2 && r1 != 0 && r2 != 0) | |
94747289 | 1019 | return true; |
6de9cd9a | 1020 | |
a1ee985f | 1021 | switch (op) |
27189292 | 1022 | { |
6de9cd9a | 1023 | case INTRINSIC_EQ: |
3bed9dd0 | 1024 | case INTRINSIC_EQ_OS: |
6de9cd9a | 1025 | case INTRINSIC_NE: |
3bed9dd0 | 1026 | case INTRINSIC_NE_OS: |
27189292 | 1027 | if (t1 == BT_CHARACTER && t2 == BT_CHARACTER) |
6de9cd9a | 1028 | goto bad_repl; |
27189292 | 1029 | /* Fall through. */ |
6de9cd9a | 1030 | |
27189292 FXC |
1031 | case INTRINSIC_PLUS: |
1032 | case INTRINSIC_MINUS: | |
1033 | case INTRINSIC_TIMES: | |
1034 | case INTRINSIC_DIVIDE: | |
1035 | case INTRINSIC_POWER: | |
1036 | if (IS_NUMERIC_TYPE (t1) && IS_NUMERIC_TYPE (t2)) | |
1037 | goto bad_repl; | |
6de9cd9a DN |
1038 | break; |
1039 | ||
6de9cd9a | 1040 | case INTRINSIC_GT: |
3bed9dd0 | 1041 | case INTRINSIC_GT_OS: |
27189292 | 1042 | case INTRINSIC_GE: |
3bed9dd0 | 1043 | case INTRINSIC_GE_OS: |
27189292 | 1044 | case INTRINSIC_LT: |
3bed9dd0 | 1045 | case INTRINSIC_LT_OS: |
27189292 | 1046 | case INTRINSIC_LE: |
3bed9dd0 | 1047 | case INTRINSIC_LE_OS: |
27189292 FXC |
1048 | if (t1 == BT_CHARACTER && t2 == BT_CHARACTER) |
1049 | goto bad_repl; | |
6de9cd9a DN |
1050 | if ((t1 == BT_INTEGER || t1 == BT_REAL) |
1051 | && (t2 == BT_INTEGER || t2 == BT_REAL)) | |
1052 | goto bad_repl; | |
27189292 | 1053 | break; |
6de9cd9a | 1054 | |
27189292 FXC |
1055 | case INTRINSIC_CONCAT: |
1056 | if (t1 == BT_CHARACTER && t2 == BT_CHARACTER) | |
1057 | goto bad_repl; | |
6de9cd9a DN |
1058 | break; |
1059 | ||
6de9cd9a | 1060 | case INTRINSIC_AND: |
27189292 | 1061 | case INTRINSIC_OR: |
6de9cd9a DN |
1062 | case INTRINSIC_EQV: |
1063 | case INTRINSIC_NEQV: | |
6de9cd9a DN |
1064 | if (t1 == BT_LOGICAL && t2 == BT_LOGICAL) |
1065 | goto bad_repl; | |
1066 | break; | |
1067 | ||
6de9cd9a | 1068 | default: |
27189292 FXC |
1069 | break; |
1070 | } | |
6de9cd9a | 1071 | |
94747289 | 1072 | return true; |
6de9cd9a | 1073 | |
27189292 FXC |
1074 | #undef IS_NUMERIC_TYPE |
1075 | ||
6de9cd9a DN |
1076 | bad_repl: |
1077 | gfc_error ("Operator interface at %L conflicts with intrinsic interface", | |
94747289 DK |
1078 | &opwhere); |
1079 | return false; | |
6de9cd9a DN |
1080 | } |
1081 | ||
1082 | ||
1083 | /* Given a pair of formal argument lists, we see if the two lists can | |
1084 | be distinguished by counting the number of nonoptional arguments of | |
1085 | a given type/rank in f1 and seeing if there are less then that | |
1086 | number of those arguments in f2 (including optional arguments). | |
1087 | Since this test is asymmetric, it has to be called twice to make it | |
6f3ab30d JW |
1088 | symmetric. Returns nonzero if the argument lists are incompatible |
1089 | by this test. This subroutine implements rule 1 of section F03:16.2.3. | |
1090 | 'p1' and 'p2' are the PASS arguments of both procedures (if applicable). */ | |
6de9cd9a | 1091 | |
f3e1097b | 1092 | static bool |
6f3ab30d JW |
1093 | count_types_test (gfc_formal_arglist *f1, gfc_formal_arglist *f2, |
1094 | const char *p1, const char *p2) | |
6de9cd9a | 1095 | { |
f3e1097b | 1096 | int ac1, ac2, i, j, k, n1; |
6de9cd9a DN |
1097 | gfc_formal_arglist *f; |
1098 | ||
1099 | typedef struct | |
1100 | { | |
1101 | int flag; | |
1102 | gfc_symbol *sym; | |
1103 | } | |
1104 | arginfo; | |
1105 | ||
1106 | arginfo *arg; | |
1107 | ||
1108 | n1 = 0; | |
1109 | ||
1110 | for (f = f1; f; f = f->next) | |
1111 | n1++; | |
1112 | ||
1113 | /* Build an array of integers that gives the same integer to | |
1114 | arguments of the same type/rank. */ | |
ece3f663 | 1115 | arg = XCNEWVEC (arginfo, n1); |
6de9cd9a DN |
1116 | |
1117 | f = f1; | |
1118 | for (i = 0; i < n1; i++, f = f->next) | |
1119 | { | |
1120 | arg[i].flag = -1; | |
1121 | arg[i].sym = f->sym; | |
1122 | } | |
1123 | ||
1124 | k = 0; | |
1125 | ||
1126 | for (i = 0; i < n1; i++) | |
1127 | { | |
1128 | if (arg[i].flag != -1) | |
1129 | continue; | |
1130 | ||
6f3ab30d JW |
1131 | if (arg[i].sym && (arg[i].sym->attr.optional |
1132 | || (p1 && strcmp (arg[i].sym->name, p1) == 0))) | |
1133 | continue; /* Skip OPTIONAL and PASS arguments. */ | |
6de9cd9a DN |
1134 | |
1135 | arg[i].flag = k; | |
1136 | ||
6f3ab30d | 1137 | /* Find other non-optional, non-pass arguments of the same type/rank. */ |
6de9cd9a | 1138 | for (j = i + 1; j < n1; j++) |
6f3ab30d JW |
1139 | if ((arg[j].sym == NULL |
1140 | || !(arg[j].sym->attr.optional | |
1141 | || (p1 && strcmp (arg[j].sym->name, p1) == 0))) | |
2b603773 JW |
1142 | && (compare_type_rank_if (arg[i].sym, arg[j].sym) |
1143 | || compare_type_rank_if (arg[j].sym, arg[i].sym))) | |
6de9cd9a DN |
1144 | arg[j].flag = k; |
1145 | ||
1146 | k++; | |
1147 | } | |
1148 | ||
1149 | /* Now loop over each distinct type found in f1. */ | |
1150 | k = 0; | |
f3e1097b | 1151 | bool rc = false; |
6de9cd9a DN |
1152 | |
1153 | for (i = 0; i < n1; i++) | |
1154 | { | |
1155 | if (arg[i].flag != k) | |
1156 | continue; | |
1157 | ||
1158 | ac1 = 1; | |
1159 | for (j = i + 1; j < n1; j++) | |
1160 | if (arg[j].flag == k) | |
1161 | ac1++; | |
1162 | ||
6f3ab30d JW |
1163 | /* Count the number of non-pass arguments in f2 with that type, |
1164 | including those that are optional. */ | |
6de9cd9a DN |
1165 | ac2 = 0; |
1166 | ||
1167 | for (f = f2; f; f = f->next) | |
6f3ab30d JW |
1168 | if ((!p2 || strcmp (f->sym->name, p2) != 0) |
1169 | && (compare_type_rank_if (arg[i].sym, f->sym) | |
1170 | || compare_type_rank_if (f->sym, arg[i].sym))) | |
6de9cd9a DN |
1171 | ac2++; |
1172 | ||
1173 | if (ac1 > ac2) | |
1174 | { | |
f3e1097b | 1175 | rc = true; |
6de9cd9a DN |
1176 | break; |
1177 | } | |
1178 | ||
1179 | k++; | |
1180 | } | |
1181 | ||
cede9502 | 1182 | free (arg); |
6de9cd9a DN |
1183 | |
1184 | return rc; | |
1185 | } | |
1186 | ||
1187 | ||
e9355cc3 JW |
1188 | /* Perform the correspondence test in rule (3) of F08:C1215. |
1189 | Returns zero if no argument is found that satisfies this rule, | |
1190 | nonzero otherwise. 'p1' and 'p2' are the PASS arguments of both procedures | |
6f3ab30d | 1191 | (if applicable). |
6de9cd9a DN |
1192 | |
1193 | This test is also not symmetric in f1 and f2 and must be called | |
1194 | twice. This test finds problems caused by sorting the actual | |
1195 | argument list with keywords. For example: | |
1196 | ||
1197 | INTERFACE FOO | |
e9355cc3 JW |
1198 | SUBROUTINE F1(A, B) |
1199 | INTEGER :: A ; REAL :: B | |
1200 | END SUBROUTINE F1 | |
6de9cd9a | 1201 | |
e9355cc3 JW |
1202 | SUBROUTINE F2(B, A) |
1203 | INTEGER :: A ; REAL :: B | |
1204 | END SUBROUTINE F1 | |
6de9cd9a DN |
1205 | END INTERFACE FOO |
1206 | ||
1207 | At this point, 'CALL FOO(A=1, B=1.0)' is ambiguous. */ | |
1208 | ||
f3e1097b | 1209 | static bool |
6f3ab30d JW |
1210 | generic_correspondence (gfc_formal_arglist *f1, gfc_formal_arglist *f2, |
1211 | const char *p1, const char *p2) | |
6de9cd9a | 1212 | { |
6de9cd9a DN |
1213 | gfc_formal_arglist *f2_save, *g; |
1214 | gfc_symbol *sym; | |
1215 | ||
1216 | f2_save = f2; | |
1217 | ||
1218 | while (f1) | |
1219 | { | |
1220 | if (f1->sym->attr.optional) | |
1221 | goto next; | |
1222 | ||
6f3ab30d JW |
1223 | if (p1 && strcmp (f1->sym->name, p1) == 0) |
1224 | f1 = f1->next; | |
1225 | if (f2 && p2 && strcmp (f2->sym->name, p2) == 0) | |
1226 | f2 = f2->next; | |
1227 | ||
2b603773 | 1228 | if (f2 != NULL && (compare_type_rank (f1->sym, f2->sym) |
e9355cc3 JW |
1229 | || compare_type_rank (f2->sym, f1->sym)) |
1230 | && !((gfc_option.allow_std & GFC_STD_F2008) | |
1231 | && ((f1->sym->attr.allocatable && f2->sym->attr.pointer) | |
1232 | || (f2->sym->attr.allocatable && f1->sym->attr.pointer)))) | |
6de9cd9a DN |
1233 | goto next; |
1234 | ||
1235 | /* Now search for a disambiguating keyword argument starting at | |
b251af97 | 1236 | the current non-match. */ |
6de9cd9a DN |
1237 | for (g = f1; g; g = g->next) |
1238 | { | |
6f3ab30d | 1239 | if (g->sym->attr.optional || (p1 && strcmp (g->sym->name, p1) == 0)) |
6de9cd9a DN |
1240 | continue; |
1241 | ||
1242 | sym = find_keyword_arg (g->sym->name, f2_save); | |
e9355cc3 JW |
1243 | if (sym == NULL || !compare_type_rank (g->sym, sym) |
1244 | || ((gfc_option.allow_std & GFC_STD_F2008) | |
1245 | && ((sym->attr.allocatable && g->sym->attr.pointer) | |
1246 | || (sym->attr.pointer && g->sym->attr.allocatable)))) | |
f3e1097b | 1247 | return true; |
6de9cd9a DN |
1248 | } |
1249 | ||
1250 | next: | |
6f3ab30d JW |
1251 | if (f1 != NULL) |
1252 | f1 = f1->next; | |
6de9cd9a DN |
1253 | if (f2 != NULL) |
1254 | f2 = f2->next; | |
1255 | } | |
1256 | ||
f3e1097b | 1257 | return false; |
6de9cd9a DN |
1258 | } |
1259 | ||
1260 | ||
e7333b69 JW |
1261 | static int |
1262 | symbol_rank (gfc_symbol *sym) | |
1263 | { | |
1264 | gfc_array_spec *as; | |
1265 | as = (sym->ts.type == BT_CLASS) ? CLASS_DATA (sym)->as : sym->as; | |
1266 | return as ? as->rank : 0; | |
1267 | } | |
1268 | ||
1269 | ||
9795c594 JW |
1270 | /* Check if the characteristics of two dummy arguments match, |
1271 | cf. F08:12.3.2. */ | |
1272 | ||
4668d6f9 PT |
1273 | bool |
1274 | gfc_check_dummy_characteristics (gfc_symbol *s1, gfc_symbol *s2, | |
1275 | bool type_must_agree, char *errmsg, | |
1276 | int err_len) | |
9795c594 | 1277 | { |
9362a03b | 1278 | if (s1 == NULL || s2 == NULL) |
524af0d6 | 1279 | return s1 == s2 ? true : false; |
9362a03b | 1280 | |
9795c594 | 1281 | /* Check type and rank. */ |
e7333b69 | 1282 | if (type_must_agree) |
9795c594 | 1283 | { |
e7333b69 JW |
1284 | if (!compare_type (s1, s2) || !compare_type (s2, s1)) |
1285 | { | |
1286 | snprintf (errmsg, err_len, "Type mismatch in argument '%s' (%s/%s)", | |
1287 | s1->name, gfc_typename (&s1->ts), gfc_typename (&s2->ts)); | |
1288 | return false; | |
1289 | } | |
1290 | if (!compare_rank (s1, s2)) | |
1291 | { | |
1292 | snprintf (errmsg, err_len, "Rank mismatch in argument '%s' (%i/%i)", | |
1293 | s1->name, symbol_rank (s1), symbol_rank (s2)); | |
1294 | return false; | |
1295 | } | |
9795c594 JW |
1296 | } |
1297 | ||
1298 | /* Check INTENT. */ | |
1299 | if (s1->attr.intent != s2->attr.intent) | |
1300 | { | |
1301 | snprintf (errmsg, err_len, "INTENT mismatch in argument '%s'", | |
1302 | s1->name); | |
524af0d6 | 1303 | return false; |
9795c594 JW |
1304 | } |
1305 | ||
1306 | /* Check OPTIONAL attribute. */ | |
1307 | if (s1->attr.optional != s2->attr.optional) | |
1308 | { | |
1309 | snprintf (errmsg, err_len, "OPTIONAL mismatch in argument '%s'", | |
1310 | s1->name); | |
524af0d6 | 1311 | return false; |
9795c594 JW |
1312 | } |
1313 | ||
1314 | /* Check ALLOCATABLE attribute. */ | |
1315 | if (s1->attr.allocatable != s2->attr.allocatable) | |
1316 | { | |
1317 | snprintf (errmsg, err_len, "ALLOCATABLE mismatch in argument '%s'", | |
1318 | s1->name); | |
524af0d6 | 1319 | return false; |
9795c594 JW |
1320 | } |
1321 | ||
1322 | /* Check POINTER attribute. */ | |
1323 | if (s1->attr.pointer != s2->attr.pointer) | |
1324 | { | |
1325 | snprintf (errmsg, err_len, "POINTER mismatch in argument '%s'", | |
1326 | s1->name); | |
524af0d6 | 1327 | return false; |
9795c594 JW |
1328 | } |
1329 | ||
1330 | /* Check TARGET attribute. */ | |
1331 | if (s1->attr.target != s2->attr.target) | |
1332 | { | |
1333 | snprintf (errmsg, err_len, "TARGET mismatch in argument '%s'", | |
1334 | s1->name); | |
524af0d6 | 1335 | return false; |
9795c594 JW |
1336 | } |
1337 | ||
688974a3 JW |
1338 | /* Check ASYNCHRONOUS attribute. */ |
1339 | if (s1->attr.asynchronous != s2->attr.asynchronous) | |
1340 | { | |
1341 | snprintf (errmsg, err_len, "ASYNCHRONOUS mismatch in argument '%s'", | |
1342 | s1->name); | |
1343 | return false; | |
1344 | } | |
1345 | ||
1346 | /* Check CONTIGUOUS attribute. */ | |
1347 | if (s1->attr.contiguous != s2->attr.contiguous) | |
1348 | { | |
1349 | snprintf (errmsg, err_len, "CONTIGUOUS mismatch in argument '%s'", | |
1350 | s1->name); | |
1351 | return false; | |
1352 | } | |
1353 | ||
1354 | /* Check VALUE attribute. */ | |
1355 | if (s1->attr.value != s2->attr.value) | |
1356 | { | |
1357 | snprintf (errmsg, err_len, "VALUE mismatch in argument '%s'", | |
1358 | s1->name); | |
1359 | return false; | |
1360 | } | |
1361 | ||
1362 | /* Check VOLATILE attribute. */ | |
1363 | if (s1->attr.volatile_ != s2->attr.volatile_) | |
1364 | { | |
1365 | snprintf (errmsg, err_len, "VOLATILE mismatch in argument '%s'", | |
1366 | s1->name); | |
1367 | return false; | |
1368 | } | |
9795c594 | 1369 | |
f2f8171f JW |
1370 | /* Check interface of dummy procedures. */ |
1371 | if (s1->attr.flavor == FL_PROCEDURE) | |
1372 | { | |
1373 | char err[200]; | |
1374 | if (!gfc_compare_interfaces (s1, s2, s2->name, 0, 1, err, sizeof(err), | |
1375 | NULL, NULL)) | |
1376 | { | |
1377 | snprintf (errmsg, err_len, "Interface mismatch in dummy procedure " | |
1378 | "'%s': %s", s1->name, err); | |
524af0d6 | 1379 | return false; |
f2f8171f JW |
1380 | } |
1381 | } | |
1382 | ||
9795c594 JW |
1383 | /* Check string length. */ |
1384 | if (s1->ts.type == BT_CHARACTER | |
1385 | && s1->ts.u.cl && s1->ts.u.cl->length | |
1386 | && s2->ts.u.cl && s2->ts.u.cl->length) | |
1387 | { | |
1388 | int compval = gfc_dep_compare_expr (s1->ts.u.cl->length, | |
1389 | s2->ts.u.cl->length); | |
1390 | switch (compval) | |
1391 | { | |
1392 | case -1: | |
1393 | case 1: | |
1394 | case -3: | |
1395 | snprintf (errmsg, err_len, "Character length mismatch " | |
1396 | "in argument '%s'", s1->name); | |
524af0d6 | 1397 | return false; |
9795c594 JW |
1398 | |
1399 | case -2: | |
1400 | /* FIXME: Implement a warning for this case. | |
db30e21c | 1401 | gfc_warning (0, "Possible character length mismatch in argument %qs", |
9795c594 JW |
1402 | s1->name);*/ |
1403 | break; | |
1404 | ||
1405 | case 0: | |
1406 | break; | |
1407 | ||
1408 | default: | |
1409 | gfc_internal_error ("check_dummy_characteristics: Unexpected result " | |
1410 | "%i of gfc_dep_compare_expr", compval); | |
1411 | break; | |
1412 | } | |
1413 | } | |
1414 | ||
1415 | /* Check array shape. */ | |
1416 | if (s1->as && s2->as) | |
1417 | { | |
97f26732 JW |
1418 | int i, compval; |
1419 | gfc_expr *shape1, *shape2; | |
1420 | ||
9795c594 JW |
1421 | if (s1->as->type != s2->as->type) |
1422 | { | |
1423 | snprintf (errmsg, err_len, "Shape mismatch in argument '%s'", | |
1424 | s1->name); | |
524af0d6 | 1425 | return false; |
9795c594 | 1426 | } |
97f26732 | 1427 | |
b25affbd TB |
1428 | if (s1->as->corank != s2->as->corank) |
1429 | { | |
1430 | snprintf (errmsg, err_len, "Corank mismatch in argument '%s' (%i/%i)", | |
1431 | s1->name, s1->as->corank, s2->as->corank); | |
1432 | return false; | |
1433 | } | |
1434 | ||
97f26732 | 1435 | if (s1->as->type == AS_EXPLICIT) |
47da0bf6 | 1436 | for (i = 0; i < s1->as->rank + MAX (0, s1->as->corank-1); i++) |
97f26732 JW |
1437 | { |
1438 | shape1 = gfc_subtract (gfc_copy_expr (s1->as->upper[i]), | |
1439 | gfc_copy_expr (s1->as->lower[i])); | |
1440 | shape2 = gfc_subtract (gfc_copy_expr (s2->as->upper[i]), | |
1441 | gfc_copy_expr (s2->as->lower[i])); | |
1442 | compval = gfc_dep_compare_expr (shape1, shape2); | |
1443 | gfc_free_expr (shape1); | |
1444 | gfc_free_expr (shape2); | |
1445 | switch (compval) | |
1446 | { | |
1447 | case -1: | |
1448 | case 1: | |
1449 | case -3: | |
b25affbd TB |
1450 | if (i < s1->as->rank) |
1451 | snprintf (errmsg, err_len, "Shape mismatch in dimension %i of" | |
1452 | " argument '%s'", i + 1, s1->name); | |
1453 | else | |
1454 | snprintf (errmsg, err_len, "Shape mismatch in codimension %i " | |
1455 | "of argument '%s'", i - s1->as->rank + 1, s1->name); | |
524af0d6 | 1456 | return false; |
97f26732 JW |
1457 | |
1458 | case -2: | |
1459 | /* FIXME: Implement a warning for this case. | |
db30e21c | 1460 | gfc_warning (0, "Possible shape mismatch in argument %qs", |
97f26732 JW |
1461 | s1->name);*/ |
1462 | break; | |
1463 | ||
1464 | case 0: | |
1465 | break; | |
1466 | ||
1467 | default: | |
1468 | gfc_internal_error ("check_dummy_characteristics: Unexpected " | |
1469 | "result %i of gfc_dep_compare_expr", | |
1470 | compval); | |
1471 | break; | |
1472 | } | |
1473 | } | |
9795c594 | 1474 | } |
8b704316 | 1475 | |
524af0d6 | 1476 | return true; |
9795c594 JW |
1477 | } |
1478 | ||
1479 | ||
edc802c7 JW |
1480 | /* Check if the characteristics of two function results match, |
1481 | cf. F08:12.3.3. */ | |
1482 | ||
4668d6f9 PT |
1483 | bool |
1484 | gfc_check_result_characteristics (gfc_symbol *s1, gfc_symbol *s2, | |
edc802c7 JW |
1485 | char *errmsg, int err_len) |
1486 | { | |
1487 | gfc_symbol *r1, *r2; | |
1488 | ||
82b541a1 JW |
1489 | if (s1->ts.interface && s1->ts.interface->result) |
1490 | r1 = s1->ts.interface->result; | |
1491 | else | |
1492 | r1 = s1->result ? s1->result : s1; | |
1493 | ||
1494 | if (s2->ts.interface && s2->ts.interface->result) | |
1495 | r2 = s2->ts.interface->result; | |
1496 | else | |
1497 | r2 = s2->result ? s2->result : s2; | |
edc802c7 JW |
1498 | |
1499 | if (r1->ts.type == BT_UNKNOWN) | |
524af0d6 | 1500 | return true; |
edc802c7 JW |
1501 | |
1502 | /* Check type and rank. */ | |
e7333b69 | 1503 | if (!compare_type (r1, r2)) |
edc802c7 | 1504 | { |
e7333b69 JW |
1505 | snprintf (errmsg, err_len, "Type mismatch in function result (%s/%s)", |
1506 | gfc_typename (&r1->ts), gfc_typename (&r2->ts)); | |
1507 | return false; | |
1508 | } | |
1509 | if (!compare_rank (r1, r2)) | |
1510 | { | |
1511 | snprintf (errmsg, err_len, "Rank mismatch in function result (%i/%i)", | |
1512 | symbol_rank (r1), symbol_rank (r2)); | |
524af0d6 | 1513 | return false; |
edc802c7 JW |
1514 | } |
1515 | ||
1516 | /* Check ALLOCATABLE attribute. */ | |
1517 | if (r1->attr.allocatable != r2->attr.allocatable) | |
1518 | { | |
1519 | snprintf (errmsg, err_len, "ALLOCATABLE attribute mismatch in " | |
1520 | "function result"); | |
524af0d6 | 1521 | return false; |
edc802c7 JW |
1522 | } |
1523 | ||
1524 | /* Check POINTER attribute. */ | |
1525 | if (r1->attr.pointer != r2->attr.pointer) | |
1526 | { | |
1527 | snprintf (errmsg, err_len, "POINTER attribute mismatch in " | |
1528 | "function result"); | |
524af0d6 | 1529 | return false; |
edc802c7 JW |
1530 | } |
1531 | ||
1532 | /* Check CONTIGUOUS attribute. */ | |
1533 | if (r1->attr.contiguous != r2->attr.contiguous) | |
1534 | { | |
1535 | snprintf (errmsg, err_len, "CONTIGUOUS attribute mismatch in " | |
1536 | "function result"); | |
524af0d6 | 1537 | return false; |
edc802c7 JW |
1538 | } |
1539 | ||
1540 | /* Check PROCEDURE POINTER attribute. */ | |
1541 | if (r1 != s1 && r1->attr.proc_pointer != r2->attr.proc_pointer) | |
1542 | { | |
1543 | snprintf (errmsg, err_len, "PROCEDURE POINTER mismatch in " | |
1544 | "function result"); | |
524af0d6 | 1545 | return false; |
edc802c7 JW |
1546 | } |
1547 | ||
1548 | /* Check string length. */ | |
1549 | if (r1->ts.type == BT_CHARACTER && r1->ts.u.cl && r2->ts.u.cl) | |
1550 | { | |
1551 | if (r1->ts.deferred != r2->ts.deferred) | |
1552 | { | |
1553 | snprintf (errmsg, err_len, "Character length mismatch " | |
1554 | "in function result"); | |
524af0d6 | 1555 | return false; |
edc802c7 JW |
1556 | } |
1557 | ||
96486998 | 1558 | if (r1->ts.u.cl->length && r2->ts.u.cl->length) |
edc802c7 JW |
1559 | { |
1560 | int compval = gfc_dep_compare_expr (r1->ts.u.cl->length, | |
1561 | r2->ts.u.cl->length); | |
1562 | switch (compval) | |
1563 | { | |
1564 | case -1: | |
1565 | case 1: | |
1566 | case -3: | |
1567 | snprintf (errmsg, err_len, "Character length mismatch " | |
1568 | "in function result"); | |
524af0d6 | 1569 | return false; |
edc802c7 JW |
1570 | |
1571 | case -2: | |
1572 | /* FIXME: Implement a warning for this case. | |
1573 | snprintf (errmsg, err_len, "Possible character length mismatch " | |
1574 | "in function result");*/ | |
1575 | break; | |
1576 | ||
1577 | case 0: | |
1578 | break; | |
1579 | ||
1580 | default: | |
1581 | gfc_internal_error ("check_result_characteristics (1): Unexpected " | |
1582 | "result %i of gfc_dep_compare_expr", compval); | |
1583 | break; | |
1584 | } | |
1585 | } | |
1586 | } | |
1587 | ||
1588 | /* Check array shape. */ | |
1589 | if (!r1->attr.allocatable && !r1->attr.pointer && r1->as && r2->as) | |
1590 | { | |
1591 | int i, compval; | |
1592 | gfc_expr *shape1, *shape2; | |
1593 | ||
1594 | if (r1->as->type != r2->as->type) | |
1595 | { | |
1596 | snprintf (errmsg, err_len, "Shape mismatch in function result"); | |
524af0d6 | 1597 | return false; |
edc802c7 JW |
1598 | } |
1599 | ||
1600 | if (r1->as->type == AS_EXPLICIT) | |
1601 | for (i = 0; i < r1->as->rank + r1->as->corank; i++) | |
1602 | { | |
1603 | shape1 = gfc_subtract (gfc_copy_expr (r1->as->upper[i]), | |
1604 | gfc_copy_expr (r1->as->lower[i])); | |
1605 | shape2 = gfc_subtract (gfc_copy_expr (r2->as->upper[i]), | |
1606 | gfc_copy_expr (r2->as->lower[i])); | |
1607 | compval = gfc_dep_compare_expr (shape1, shape2); | |
1608 | gfc_free_expr (shape1); | |
1609 | gfc_free_expr (shape2); | |
1610 | switch (compval) | |
1611 | { | |
1612 | case -1: | |
1613 | case 1: | |
1614 | case -3: | |
1615 | snprintf (errmsg, err_len, "Shape mismatch in dimension %i of " | |
1616 | "function result", i + 1); | |
524af0d6 | 1617 | return false; |
edc802c7 JW |
1618 | |
1619 | case -2: | |
1620 | /* FIXME: Implement a warning for this case. | |
db30e21c | 1621 | gfc_warning (0, "Possible shape mismatch in return value");*/ |
edc802c7 JW |
1622 | break; |
1623 | ||
1624 | case 0: | |
1625 | break; | |
1626 | ||
1627 | default: | |
1628 | gfc_internal_error ("check_result_characteristics (2): " | |
1629 | "Unexpected result %i of " | |
1630 | "gfc_dep_compare_expr", compval); | |
1631 | break; | |
1632 | } | |
1633 | } | |
1634 | } | |
1635 | ||
524af0d6 | 1636 | return true; |
edc802c7 JW |
1637 | } |
1638 | ||
1639 | ||
6de9cd9a | 1640 | /* 'Compare' two formal interfaces associated with a pair of symbols. |
f3e1097b | 1641 | We return true if there exists an actual argument list that |
8ad15a0a | 1642 | would be ambiguous between the two interfaces, zero otherwise. |
58c1ae36 | 1643 | 'strict_flag' specifies whether all the characteristics are |
6f3ab30d JW |
1644 | required to match, which is not the case for ambiguity checks. |
1645 | 'p1' and 'p2' are the PASS arguments of both procedures (if applicable). */ | |
6de9cd9a | 1646 | |
f3e1097b | 1647 | bool |
889dc035 | 1648 | gfc_compare_interfaces (gfc_symbol *s1, gfc_symbol *s2, const char *name2, |
58c1ae36 | 1649 | int generic_flag, int strict_flag, |
6f3ab30d JW |
1650 | char *errmsg, int err_len, |
1651 | const char *p1, const char *p2) | |
6de9cd9a DN |
1652 | { |
1653 | gfc_formal_arglist *f1, *f2; | |
1654 | ||
0175478d JD |
1655 | gcc_assert (name2 != NULL); |
1656 | ||
9b63f282 JW |
1657 | if (s1->attr.function && (s2->attr.subroutine |
1658 | || (!s2->attr.function && s2->ts.type == BT_UNKNOWN | |
889dc035 | 1659 | && gfc_get_default_type (name2, s2->ns)->type == BT_UNKNOWN))) |
8ad15a0a JW |
1660 | { |
1661 | if (errmsg != NULL) | |
889dc035 | 1662 | snprintf (errmsg, err_len, "'%s' is not a function", name2); |
f3e1097b | 1663 | return false; |
8ad15a0a JW |
1664 | } |
1665 | ||
1666 | if (s1->attr.subroutine && s2->attr.function) | |
1667 | { | |
1668 | if (errmsg != NULL) | |
889dc035 | 1669 | snprintf (errmsg, err_len, "'%s' is not a subroutine", name2); |
f3e1097b | 1670 | return false; |
8ad15a0a | 1671 | } |
3afadac3 | 1672 | |
58c1ae36 JW |
1673 | /* Do strict checks on all characteristics |
1674 | (for dummy procedures and procedure pointer assignments). */ | |
1675 | if (!generic_flag && strict_flag) | |
6cc309c9 | 1676 | { |
58c1ae36 | 1677 | if (s1->attr.function && s2->attr.function) |
8ad15a0a | 1678 | { |
edc802c7 | 1679 | /* If both are functions, check result characteristics. */ |
4668d6f9 PT |
1680 | if (!gfc_check_result_characteristics (s1, s2, errmsg, err_len) |
1681 | || !gfc_check_result_characteristics (s2, s1, errmsg, err_len)) | |
f3e1097b | 1682 | return false; |
58c1ae36 JW |
1683 | } |
1684 | ||
1685 | if (s1->attr.pure && !s2->attr.pure) | |
1686 | { | |
1687 | snprintf (errmsg, err_len, "Mismatch in PURE attribute"); | |
f3e1097b | 1688 | return false; |
58c1ae36 JW |
1689 | } |
1690 | if (s1->attr.elemental && !s2->attr.elemental) | |
1691 | { | |
1692 | snprintf (errmsg, err_len, "Mismatch in ELEMENTAL attribute"); | |
f3e1097b | 1693 | return false; |
8ad15a0a | 1694 | } |
6cc309c9 | 1695 | } |
26033479 | 1696 | |
8ad15a0a JW |
1697 | if (s1->attr.if_source == IFSRC_UNKNOWN |
1698 | || s2->attr.if_source == IFSRC_UNKNOWN) | |
f3e1097b | 1699 | return true; |
26033479 | 1700 | |
4cbc9039 JW |
1701 | f1 = gfc_sym_get_dummy_args (s1); |
1702 | f2 = gfc_sym_get_dummy_args (s2); | |
26033479 | 1703 | |
bd845c14 | 1704 | /* Special case: No arguments. */ |
c73b6478 | 1705 | if (f1 == NULL && f2 == NULL) |
f3e1097b | 1706 | return true; |
6cc309c9 | 1707 | |
c73b6478 | 1708 | if (generic_flag) |
6cc309c9 | 1709 | { |
6f3ab30d JW |
1710 | if (count_types_test (f1, f2, p1, p2) |
1711 | || count_types_test (f2, f1, p2, p1)) | |
f3e1097b | 1712 | return false; |
bd845c14 SK |
1713 | |
1714 | /* Special case: alternate returns. If both f1->sym and f2->sym are | |
e4e659b9 JW |
1715 | NULL, then the leading formal arguments are alternate returns. |
1716 | The previous conditional should catch argument lists with | |
bd845c14 SK |
1717 | different number of argument. */ |
1718 | if (f1 && f1->sym == NULL && f2 && f2->sym == NULL) | |
f3e1097b | 1719 | return true; |
bd845c14 | 1720 | |
6f3ab30d JW |
1721 | if (generic_correspondence (f1, f2, p1, p2) |
1722 | || generic_correspondence (f2, f1, p2, p1)) | |
f3e1097b | 1723 | return false; |
6cc309c9 | 1724 | } |
c73b6478 | 1725 | else |
8ad15a0a JW |
1726 | /* Perform the abbreviated correspondence test for operators (the |
1727 | arguments cannot be optional and are always ordered correctly). | |
1728 | This is also done when comparing interfaces for dummy procedures and in | |
1729 | procedure pointer assignments. */ | |
1730 | ||
f76c4d97 | 1731 | for (; f1 || f2; f1 = f1->next, f2 = f2->next) |
8ad15a0a JW |
1732 | { |
1733 | /* Check existence. */ | |
8ad15a0a JW |
1734 | if (f1 == NULL || f2 == NULL) |
1735 | { | |
1736 | if (errmsg != NULL) | |
1737 | snprintf (errmsg, err_len, "'%s' has the wrong number of " | |
889dc035 | 1738 | "arguments", name2); |
f3e1097b | 1739 | return false; |
8ad15a0a JW |
1740 | } |
1741 | ||
58c1ae36 | 1742 | if (strict_flag) |
8ad15a0a | 1743 | { |
9795c594 | 1744 | /* Check all characteristics. */ |
4668d6f9 | 1745 | if (!gfc_check_dummy_characteristics (f1->sym, f2->sym, true, |
524af0d6 | 1746 | errmsg, err_len)) |
f3e1097b | 1747 | return false; |
9795c594 | 1748 | } |
e7333b69 | 1749 | else |
9795c594 JW |
1750 | { |
1751 | /* Only check type and rank. */ | |
e7333b69 JW |
1752 | if (!compare_type (f2->sym, f1->sym)) |
1753 | { | |
1754 | if (errmsg != NULL) | |
1755 | snprintf (errmsg, err_len, "Type mismatch in argument '%s' " | |
1756 | "(%s/%s)", f1->sym->name, | |
1757 | gfc_typename (&f1->sym->ts), | |
1758 | gfc_typename (&f2->sym->ts)); | |
f3e1097b | 1759 | return false; |
e7333b69 JW |
1760 | } |
1761 | if (!compare_rank (f2->sym, f1->sym)) | |
1762 | { | |
1763 | if (errmsg != NULL) | |
1764 | snprintf (errmsg, err_len, "Rank mismatch in argument '%s' " | |
1765 | "(%i/%i)", f1->sym->name, symbol_rank (f1->sym), | |
1766 | symbol_rank (f2->sym)); | |
f3e1097b | 1767 | return false; |
e7333b69 | 1768 | } |
8ad15a0a | 1769 | } |
8ad15a0a JW |
1770 | } |
1771 | ||
f3e1097b | 1772 | return true; |
6cc309c9 JD |
1773 | } |
1774 | ||
1775 | ||
6de9cd9a | 1776 | /* Given a pointer to an interface pointer, remove duplicate |
284d58f1 | 1777 | interfaces and make sure that all symbols are either functions |
f3e1097b | 1778 | or subroutines, and all of the same kind. Returns true if |
284d58f1 | 1779 | something goes wrong. */ |
6de9cd9a | 1780 | |
f3e1097b | 1781 | static bool |
b251af97 | 1782 | check_interface0 (gfc_interface *p, const char *interface_name) |
6de9cd9a DN |
1783 | { |
1784 | gfc_interface *psave, *q, *qlast; | |
1785 | ||
1786 | psave = p; | |
6de9cd9a | 1787 | for (; p; p = p->next) |
284d58f1 DF |
1788 | { |
1789 | /* Make sure all symbols in the interface have been defined as | |
1790 | functions or subroutines. */ | |
c3f34952 TB |
1791 | if (((!p->sym->attr.function && !p->sym->attr.subroutine) |
1792 | || !p->sym->attr.if_source) | |
f6288c24 | 1793 | && !gfc_fl_struct (p->sym->attr.flavor)) |
284d58f1 DF |
1794 | { |
1795 | if (p->sym->attr.external) | |
c4100eae | 1796 | gfc_error ("Procedure %qs in %s at %L has no explicit interface", |
284d58f1 DF |
1797 | p->sym->name, interface_name, &p->sym->declared_at); |
1798 | else | |
c4100eae | 1799 | gfc_error ("Procedure %qs in %s at %L is neither function nor " |
284d58f1 DF |
1800 | "subroutine", p->sym->name, interface_name, |
1801 | &p->sym->declared_at); | |
f3e1097b | 1802 | return true; |
284d58f1 DF |
1803 | } |
1804 | ||
1805 | /* Verify that procedures are either all SUBROUTINEs or all FUNCTIONs. */ | |
c3f34952 | 1806 | if ((psave->sym->attr.function && !p->sym->attr.function |
f6288c24 | 1807 | && !gfc_fl_struct (p->sym->attr.flavor)) |
284d58f1 DF |
1808 | || (psave->sym->attr.subroutine && !p->sym->attr.subroutine)) |
1809 | { | |
f6288c24 | 1810 | if (!gfc_fl_struct (p->sym->attr.flavor)) |
c3f34952 TB |
1811 | gfc_error ("In %s at %L procedures must be either all SUBROUTINEs" |
1812 | " or all FUNCTIONs", interface_name, | |
1813 | &p->sym->declared_at); | |
f6288c24 | 1814 | else if (p->sym->attr.flavor == FL_DERIVED) |
c3f34952 TB |
1815 | gfc_error ("In %s at %L procedures must be all FUNCTIONs as the " |
1816 | "generic name is also the name of a derived type", | |
1817 | interface_name, &p->sym->declared_at); | |
f3e1097b | 1818 | return true; |
284d58f1 | 1819 | } |
a300121e | 1820 | |
d2c5dbf2 | 1821 | /* F2003, C1207. F2008, C1207. */ |
a300121e | 1822 | if (p->sym->attr.proc == PROC_INTERNAL |
524af0d6 | 1823 | && !gfc_notify_std (GFC_STD_F2008, "Internal procedure " |
a4d9b221 | 1824 | "%qs in %s at %L", p->sym->name, |
524af0d6 | 1825 | interface_name, &p->sym->declared_at)) |
f3e1097b | 1826 | return true; |
284d58f1 | 1827 | } |
6de9cd9a DN |
1828 | p = psave; |
1829 | ||
1830 | /* Remove duplicate interfaces in this interface list. */ | |
1831 | for (; p; p = p->next) | |
1832 | { | |
1833 | qlast = p; | |
1834 | ||
1835 | for (q = p->next; q;) | |
1836 | { | |
1837 | if (p->sym != q->sym) | |
1838 | { | |
1839 | qlast = q; | |
1840 | q = q->next; | |
6de9cd9a DN |
1841 | } |
1842 | else | |
1843 | { | |
66e4ab31 | 1844 | /* Duplicate interface. */ |
6de9cd9a | 1845 | qlast->next = q->next; |
cede9502 | 1846 | free (q); |
6de9cd9a DN |
1847 | q = qlast->next; |
1848 | } | |
1849 | } | |
1850 | } | |
1851 | ||
f3e1097b | 1852 | return false; |
6de9cd9a DN |
1853 | } |
1854 | ||
1855 | ||
1856 | /* Check lists of interfaces to make sure that no two interfaces are | |
66e4ab31 | 1857 | ambiguous. Duplicate interfaces (from the same symbol) are OK here. */ |
6de9cd9a | 1858 | |
f3e1097b | 1859 | static bool |
b251af97 | 1860 | check_interface1 (gfc_interface *p, gfc_interface *q0, |
993ef28f | 1861 | int generic_flag, const char *interface_name, |
26f2ca2b | 1862 | bool referenced) |
6de9cd9a | 1863 | { |
b251af97 | 1864 | gfc_interface *q; |
6de9cd9a | 1865 | for (; p; p = p->next) |
991f3b12 | 1866 | for (q = q0; q; q = q->next) |
6de9cd9a DN |
1867 | { |
1868 | if (p->sym == q->sym) | |
66e4ab31 | 1869 | continue; /* Duplicates OK here. */ |
6de9cd9a | 1870 | |
312ae8f4 | 1871 | if (p->sym->name == q->sym->name && p->sym->module == q->sym->module) |
6de9cd9a DN |
1872 | continue; |
1873 | ||
f6288c24 FR |
1874 | if (!gfc_fl_struct (p->sym->attr.flavor) |
1875 | && !gfc_fl_struct (q->sym->attr.flavor) | |
c3f34952 | 1876 | && gfc_compare_interfaces (p->sym, q->sym, q->sym->name, |
6f3ab30d | 1877 | generic_flag, 0, NULL, 0, NULL, NULL)) |
6de9cd9a | 1878 | { |
993ef28f | 1879 | if (referenced) |
bd845c14 SK |
1880 | gfc_error ("Ambiguous interfaces in %s for %qs at %L " |
1881 | "and %qs at %L", interface_name, | |
1882 | q->sym->name, &q->sym->declared_at, | |
1883 | p->sym->name, &p->sym->declared_at); | |
ae7c61de | 1884 | else if (!p->sym->attr.use_assoc && q->sym->attr.use_assoc) |
bd845c14 SK |
1885 | gfc_warning (0, "Ambiguous interfaces in %s for %qs at %L " |
1886 | "and %qs at %L", interface_name, | |
1887 | q->sym->name, &q->sym->declared_at, | |
1888 | p->sym->name, &p->sym->declared_at); | |
ae7c61de | 1889 | else |
db30e21c | 1890 | gfc_warning (0, "Although not referenced, %qs has ambiguous " |
ae7c61de | 1891 | "interfaces at %L", interface_name, &p->where); |
f3e1097b | 1892 | return true; |
6de9cd9a DN |
1893 | } |
1894 | } | |
f3e1097b | 1895 | return false; |
6de9cd9a DN |
1896 | } |
1897 | ||
1898 | ||
1899 | /* Check the generic and operator interfaces of symbols to make sure | |
1900 | that none of the interfaces conflict. The check has to be done | |
1901 | after all of the symbols are actually loaded. */ | |
1902 | ||
1903 | static void | |
b251af97 | 1904 | check_sym_interfaces (gfc_symbol *sym) |
6de9cd9a DN |
1905 | { |
1906 | char interface_name[100]; | |
71f77fd7 | 1907 | gfc_interface *p; |
6de9cd9a DN |
1908 | |
1909 | if (sym->ns != gfc_current_ns) | |
1910 | return; | |
1911 | ||
1912 | if (sym->generic != NULL) | |
1913 | { | |
1914 | sprintf (interface_name, "generic interface '%s'", sym->name); | |
1915 | if (check_interface0 (sym->generic, interface_name)) | |
1916 | return; | |
1917 | ||
71f77fd7 PT |
1918 | for (p = sym->generic; p; p = p->next) |
1919 | { | |
abf86978 | 1920 | if (p->sym->attr.mod_proc |
4668d6f9 | 1921 | && !p->sym->attr.module_procedure |
abf86978 TB |
1922 | && (p->sym->attr.if_source != IFSRC_DECL |
1923 | || p->sym->attr.procedure)) | |
71f77fd7 | 1924 | { |
c4100eae | 1925 | gfc_error ("%qs at %L is not a module procedure", |
e9f63ace | 1926 | p->sym->name, &p->where); |
71f77fd7 PT |
1927 | return; |
1928 | } | |
1929 | } | |
1930 | ||
4c256e34 | 1931 | /* Originally, this test was applied to host interfaces too; |
993ef28f PT |
1932 | this is incorrect since host associated symbols, from any |
1933 | source, cannot be ambiguous with local symbols. */ | |
ae7c61de JW |
1934 | check_interface1 (sym->generic, sym->generic, 1, interface_name, |
1935 | sym->attr.referenced || !sym->attr.use_assoc); | |
6de9cd9a DN |
1936 | } |
1937 | } | |
1938 | ||
1939 | ||
1940 | static void | |
b251af97 | 1941 | check_uop_interfaces (gfc_user_op *uop) |
6de9cd9a DN |
1942 | { |
1943 | char interface_name[100]; | |
1944 | gfc_user_op *uop2; | |
1945 | gfc_namespace *ns; | |
1946 | ||
1947 | sprintf (interface_name, "operator interface '%s'", uop->name); | |
a1ee985f | 1948 | if (check_interface0 (uop->op, interface_name)) |
6de9cd9a DN |
1949 | return; |
1950 | ||
1951 | for (ns = gfc_current_ns; ns; ns = ns->parent) | |
1952 | { | |
1953 | uop2 = gfc_find_uop (uop->name, ns); | |
1954 | if (uop2 == NULL) | |
1955 | continue; | |
1956 | ||
a1ee985f | 1957 | check_interface1 (uop->op, uop2->op, 0, |
26f2ca2b | 1958 | interface_name, true); |
6de9cd9a DN |
1959 | } |
1960 | } | |
1961 | ||
fb03a37e TK |
1962 | /* Given an intrinsic op, return an equivalent op if one exists, |
1963 | or INTRINSIC_NONE otherwise. */ | |
1964 | ||
1965 | gfc_intrinsic_op | |
1966 | gfc_equivalent_op (gfc_intrinsic_op op) | |
1967 | { | |
1968 | switch(op) | |
1969 | { | |
1970 | case INTRINSIC_EQ: | |
1971 | return INTRINSIC_EQ_OS; | |
1972 | ||
1973 | case INTRINSIC_EQ_OS: | |
1974 | return INTRINSIC_EQ; | |
1975 | ||
1976 | case INTRINSIC_NE: | |
1977 | return INTRINSIC_NE_OS; | |
1978 | ||
1979 | case INTRINSIC_NE_OS: | |
1980 | return INTRINSIC_NE; | |
1981 | ||
1982 | case INTRINSIC_GT: | |
1983 | return INTRINSIC_GT_OS; | |
1984 | ||
1985 | case INTRINSIC_GT_OS: | |
1986 | return INTRINSIC_GT; | |
1987 | ||
1988 | case INTRINSIC_GE: | |
1989 | return INTRINSIC_GE_OS; | |
1990 | ||
1991 | case INTRINSIC_GE_OS: | |
1992 | return INTRINSIC_GE; | |
1993 | ||
1994 | case INTRINSIC_LT: | |
1995 | return INTRINSIC_LT_OS; | |
1996 | ||
1997 | case INTRINSIC_LT_OS: | |
1998 | return INTRINSIC_LT; | |
1999 | ||
2000 | case INTRINSIC_LE: | |
2001 | return INTRINSIC_LE_OS; | |
2002 | ||
2003 | case INTRINSIC_LE_OS: | |
2004 | return INTRINSIC_LE; | |
2005 | ||
2006 | default: | |
2007 | return INTRINSIC_NONE; | |
2008 | } | |
2009 | } | |
6de9cd9a DN |
2010 | |
2011 | /* For the namespace, check generic, user operator and intrinsic | |
2012 | operator interfaces for consistency and to remove duplicate | |
2013 | interfaces. We traverse the whole namespace, counting on the fact | |
2014 | that most symbols will not have generic or operator interfaces. */ | |
2015 | ||
2016 | void | |
b251af97 | 2017 | gfc_check_interfaces (gfc_namespace *ns) |
6de9cd9a DN |
2018 | { |
2019 | gfc_namespace *old_ns, *ns2; | |
2020 | char interface_name[100]; | |
09639a83 | 2021 | int i; |
6de9cd9a DN |
2022 | |
2023 | old_ns = gfc_current_ns; | |
2024 | gfc_current_ns = ns; | |
2025 | ||
2026 | gfc_traverse_ns (ns, check_sym_interfaces); | |
2027 | ||
2028 | gfc_traverse_user_op (ns, check_uop_interfaces); | |
2029 | ||
2030 | for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++) | |
2031 | { | |
2032 | if (i == INTRINSIC_USER) | |
2033 | continue; | |
2034 | ||
2035 | if (i == INTRINSIC_ASSIGN) | |
2036 | strcpy (interface_name, "intrinsic assignment operator"); | |
2037 | else | |
2038 | sprintf (interface_name, "intrinsic '%s' operator", | |
09639a83 | 2039 | gfc_op2string ((gfc_intrinsic_op) i)); |
6de9cd9a | 2040 | |
a1ee985f | 2041 | if (check_interface0 (ns->op[i], interface_name)) |
6de9cd9a DN |
2042 | continue; |
2043 | ||
94747289 DK |
2044 | if (ns->op[i]) |
2045 | gfc_check_operator_interface (ns->op[i]->sym, (gfc_intrinsic_op) i, | |
2046 | ns->op[i]->where); | |
6de9cd9a | 2047 | |
3bed9dd0 DF |
2048 | for (ns2 = ns; ns2; ns2 = ns2->parent) |
2049 | { | |
fb03a37e | 2050 | gfc_intrinsic_op other_op; |
8b704316 | 2051 | |
a1ee985f | 2052 | if (check_interface1 (ns->op[i], ns2->op[i], 0, |
3bed9dd0 DF |
2053 | interface_name, true)) |
2054 | goto done; | |
2055 | ||
fb03a37e TK |
2056 | /* i should be gfc_intrinsic_op, but has to be int with this cast |
2057 | here for stupid C++ compatibility rules. */ | |
2058 | other_op = gfc_equivalent_op ((gfc_intrinsic_op) i); | |
2059 | if (other_op != INTRINSIC_NONE | |
2060 | && check_interface1 (ns->op[i], ns2->op[other_op], | |
2061 | 0, interface_name, true)) | |
2062 | goto done; | |
3bed9dd0 | 2063 | } |
6de9cd9a DN |
2064 | } |
2065 | ||
3bed9dd0 | 2066 | done: |
6de9cd9a DN |
2067 | gfc_current_ns = old_ns; |
2068 | } | |
2069 | ||
2070 | ||
aa08038d EE |
2071 | /* Given a symbol of a formal argument list and an expression, if the |
2072 | formal argument is allocatable, check that the actual argument is | |
f3e1097b | 2073 | allocatable. Returns true if compatible, zero if not compatible. */ |
aa08038d | 2074 | |
f3e1097b | 2075 | static bool |
b251af97 | 2076 | compare_allocatable (gfc_symbol *formal, gfc_expr *actual) |
aa08038d | 2077 | { |
5ac13b8e JW |
2078 | if (formal->attr.allocatable |
2079 | || (formal->ts.type == BT_CLASS && CLASS_DATA (formal)->attr.allocatable)) | |
aa08038d | 2080 | { |
fec5ce24 JW |
2081 | symbol_attribute attr = gfc_expr_attr (actual); |
2082 | if (actual->ts.type == BT_CLASS && !attr.class_ok) | |
f3e1097b | 2083 | return true; |
fec5ce24 | 2084 | else if (!attr.allocatable) |
f3e1097b | 2085 | return false; |
aa08038d EE |
2086 | } |
2087 | ||
f3e1097b | 2088 | return true; |
aa08038d EE |
2089 | } |
2090 | ||
2091 | ||
6de9cd9a DN |
2092 | /* Given a symbol of a formal argument list and an expression, if the |
2093 | formal argument is a pointer, see if the actual argument is a | |
2094 | pointer. Returns nonzero if compatible, zero if not compatible. */ | |
2095 | ||
2096 | static int | |
b251af97 | 2097 | compare_pointer (gfc_symbol *formal, gfc_expr *actual) |
6de9cd9a DN |
2098 | { |
2099 | symbol_attribute attr; | |
2100 | ||
f18075ff TB |
2101 | if (formal->attr.pointer |
2102 | || (formal->ts.type == BT_CLASS && CLASS_DATA (formal) | |
2103 | && CLASS_DATA (formal)->attr.class_pointer)) | |
6de9cd9a DN |
2104 | { |
2105 | attr = gfc_expr_attr (actual); | |
7d54ef80 TB |
2106 | |
2107 | /* Fortran 2008 allows non-pointer actual arguments. */ | |
2108 | if (!attr.pointer && attr.target && formal->attr.intent == INTENT_IN) | |
2109 | return 2; | |
2110 | ||
6de9cd9a DN |
2111 | if (!attr.pointer) |
2112 | return 0; | |
2113 | } | |
2114 | ||
2115 | return 1; | |
2116 | } | |
2117 | ||
2118 | ||
a516520c PT |
2119 | /* Emit clear error messages for rank mismatch. */ |
2120 | ||
2121 | static void | |
2122 | argument_rank_mismatch (const char *name, locus *where, | |
2123 | int rank1, int rank2) | |
2124 | { | |
c62c6622 TB |
2125 | |
2126 | /* TS 29113, C407b. */ | |
2127 | if (rank2 == -1) | |
2700d0e3 JJ |
2128 | gfc_error ("The assumed-rank array at %L requires that the dummy argument" |
2129 | " %qs has assumed-rank", where, name); | |
c62c6622 | 2130 | else if (rank1 == 0) |
2700d0e3 JJ |
2131 | gfc_error_opt (OPT_Wargument_mismatch, "Rank mismatch in argument %qs " |
2132 | "at %L (scalar and rank-%d)", name, where, rank2); | |
a516520c | 2133 | else if (rank2 == 0) |
2700d0e3 JJ |
2134 | gfc_error_opt (OPT_Wargument_mismatch, "Rank mismatch in argument %qs " |
2135 | "at %L (rank-%d and scalar)", name, where, rank1); | |
a516520c | 2136 | else |
2700d0e3 JJ |
2137 | gfc_error_opt (OPT_Wargument_mismatch, "Rank mismatch in argument %qs " |
2138 | "at %L (rank-%d and rank-%d)", name, where, rank1, rank2); | |
a516520c PT |
2139 | } |
2140 | ||
2141 | ||
6de9cd9a | 2142 | /* Given a symbol of a formal argument list and an expression, see if |
f3e1097b JW |
2143 | the two are compatible as arguments. Returns true if |
2144 | compatible, false if not compatible. */ | |
6de9cd9a | 2145 | |
f3e1097b | 2146 | static bool |
b251af97 | 2147 | compare_parameter (gfc_symbol *formal, gfc_expr *actual, |
5ad6345e | 2148 | int ranks_must_agree, int is_elemental, locus *where) |
6de9cd9a DN |
2149 | { |
2150 | gfc_ref *ref; | |
975b975b | 2151 | bool rank_check, is_pointer; |
5c0ba546 JW |
2152 | char err[200]; |
2153 | gfc_component *ppc; | |
6de9cd9a | 2154 | |
a8b3b0b6 CR |
2155 | /* If the formal arg has type BT_VOID, it's to one of the iso_c_binding |
2156 | procs c_f_pointer or c_f_procpointer, and we need to accept most | |
2157 | pointers the user could give us. This should allow that. */ | |
2158 | if (formal->ts.type == BT_VOID) | |
f3e1097b | 2159 | return true; |
a8b3b0b6 CR |
2160 | |
2161 | if (formal->ts.type == BT_DERIVED | |
bc21d315 | 2162 | && formal->ts.u.derived && formal->ts.u.derived->ts.is_iso_c |
a8b3b0b6 | 2163 | && actual->ts.type == BT_DERIVED |
bc21d315 | 2164 | && actual->ts.u.derived && actual->ts.u.derived->ts.is_iso_c) |
f3e1097b | 2165 | return true; |
a8b3b0b6 | 2166 | |
7d58b9e7 | 2167 | if (formal->ts.type == BT_CLASS && actual->ts.type == BT_DERIVED) |
e10f52d0 JW |
2168 | /* Make sure the vtab symbol is present when |
2169 | the module variables are generated. */ | |
7d58b9e7 | 2170 | gfc_find_derived_vtab (actual->ts.u.derived); |
e10f52d0 | 2171 | |
6de9cd9a DN |
2172 | if (actual->ts.type == BT_PROCEDURE) |
2173 | { | |
9b63f282 | 2174 | gfc_symbol *act_sym = actual->symtree->n.sym; |
6de9cd9a | 2175 | |
8ad15a0a JW |
2176 | if (formal->attr.flavor != FL_PROCEDURE) |
2177 | { | |
2178 | if (where) | |
2179 | gfc_error ("Invalid procedure argument at %L", &actual->where); | |
f3e1097b | 2180 | return false; |
8ad15a0a | 2181 | } |
6de9cd9a | 2182 | |
889dc035 | 2183 | if (!gfc_compare_interfaces (formal, act_sym, act_sym->name, 0, 1, err, |
6f3ab30d | 2184 | sizeof(err), NULL, NULL)) |
8ad15a0a JW |
2185 | { |
2186 | if (where) | |
2700d0e3 JJ |
2187 | gfc_error_opt (OPT_Wargument_mismatch, |
2188 | "Interface mismatch in dummy procedure %qs at %L:" | |
2189 | " %s", formal->name, &actual->where, err); | |
f3e1097b | 2190 | return false; |
8ad15a0a | 2191 | } |
5ad6345e | 2192 | |
9b63f282 | 2193 | if (formal->attr.function && !act_sym->attr.function) |
03bd096b JW |
2194 | { |
2195 | gfc_add_function (&act_sym->attr, act_sym->name, | |
2196 | &act_sym->declared_at); | |
2197 | if (act_sym->ts.type == BT_UNKNOWN | |
524af0d6 | 2198 | && !gfc_set_default_type (act_sym, 1, act_sym->ns)) |
f3e1097b | 2199 | return false; |
03bd096b JW |
2200 | } |
2201 | else if (formal->attr.subroutine && !act_sym->attr.subroutine) | |
9b63f282 JW |
2202 | gfc_add_subroutine (&act_sym->attr, act_sym->name, |
2203 | &act_sym->declared_at); | |
2204 | ||
f3e1097b | 2205 | return true; |
6de9cd9a DN |
2206 | } |
2207 | ||
5c0ba546 | 2208 | ppc = gfc_get_proc_ptr_comp (actual); |
228eb42a | 2209 | if (ppc && ppc->ts.interface) |
5c0ba546 JW |
2210 | { |
2211 | if (!gfc_compare_interfaces (formal, ppc->ts.interface, ppc->name, 0, 1, | |
2212 | err, sizeof(err), NULL, NULL)) | |
2213 | { | |
2214 | if (where) | |
2700d0e3 JJ |
2215 | gfc_error_opt (OPT_Wargument_mismatch, |
2216 | "Interface mismatch in dummy procedure %qs at %L:" | |
2217 | " %s", formal->name, &actual->where, err); | |
f3e1097b | 2218 | return false; |
5c0ba546 JW |
2219 | } |
2220 | } | |
2221 | ||
fe4e525c TB |
2222 | /* F2008, C1241. */ |
2223 | if (formal->attr.pointer && formal->attr.contiguous | |
460263d0 | 2224 | && !gfc_is_simply_contiguous (actual, true, false)) |
fe4e525c TB |
2225 | { |
2226 | if (where) | |
c4100eae | 2227 | gfc_error ("Actual argument to contiguous pointer dummy %qs at %L " |
62732c30 | 2228 | "must be simply contiguous", formal->name, &actual->where); |
f3e1097b | 2229 | return false; |
fe4e525c TB |
2230 | } |
2231 | ||
fec5ce24 JW |
2232 | symbol_attribute actual_attr = gfc_expr_attr (actual); |
2233 | if (actual->ts.type == BT_CLASS && !actual_attr.class_ok) | |
f3e1097b | 2234 | return true; |
fec5ce24 | 2235 | |
90aeadcb | 2236 | if ((actual->expr_type != EXPR_NULL || actual->ts.type != BT_UNKNOWN) |
df161b69 | 2237 | && actual->ts.type != BT_HOLLERITH |
45a69325 | 2238 | && formal->ts.type != BT_ASSUMED |
e7ac6a7c | 2239 | && !(formal->attr.ext_attr & (1 << EXT_ATTR_NO_ARG_CHECK)) |
c49ea23d PT |
2240 | && !gfc_compare_types (&formal->ts, &actual->ts) |
2241 | && !(formal->ts.type == BT_DERIVED && actual->ts.type == BT_CLASS | |
8b704316 | 2242 | && gfc_compare_derived_types (formal->ts.u.derived, |
c49ea23d | 2243 | CLASS_DATA (actual)->ts.u.derived))) |
5ad6345e | 2244 | { |
d68e117b | 2245 | if (where) |
2700d0e3 JJ |
2246 | gfc_error_opt (OPT_Wargument_mismatch, |
2247 | "Type mismatch in argument %qs at %L; passed %s to %s", | |
2248 | formal->name, where, gfc_typename (&actual->ts), | |
2249 | gfc_typename (&formal->ts)); | |
f3e1097b | 2250 | return false; |
5ad6345e | 2251 | } |
f18075ff | 2252 | |
3d54e576 TB |
2253 | if (actual->ts.type == BT_ASSUMED && formal->ts.type != BT_ASSUMED) |
2254 | { | |
2255 | if (where) | |
2256 | gfc_error ("Assumed-type actual argument at %L requires that dummy " | |
c4100eae | 2257 | "argument %qs is of assumed type", &actual->where, |
3d54e576 | 2258 | formal->name); |
f3e1097b | 2259 | return false; |
3d54e576 TB |
2260 | } |
2261 | ||
f18075ff | 2262 | /* F2008, 12.5.2.5; IR F08/0073. */ |
67b1d004 JW |
2263 | if (formal->ts.type == BT_CLASS && formal->attr.class_ok |
2264 | && actual->expr_type != EXPR_NULL | |
f18075ff | 2265 | && ((CLASS_DATA (formal)->attr.class_pointer |
86eb9e2f | 2266 | && formal->attr.intent != INTENT_IN) |
5ac13b8e JW |
2267 | || CLASS_DATA (formal)->attr.allocatable)) |
2268 | { | |
2269 | if (actual->ts.type != BT_CLASS) | |
2270 | { | |
2271 | if (where) | |
c4100eae | 2272 | gfc_error ("Actual argument to %qs at %L must be polymorphic", |
5ac13b8e | 2273 | formal->name, &actual->where); |
f3e1097b | 2274 | return false; |
5ac13b8e | 2275 | } |
67b1d004 | 2276 | |
a8267f8d TB |
2277 | if ((!UNLIMITED_POLY (formal) || !UNLIMITED_POLY(actual)) |
2278 | && !gfc_compare_derived_types (CLASS_DATA (actual)->ts.u.derived, | |
2279 | CLASS_DATA (formal)->ts.u.derived)) | |
5ac13b8e JW |
2280 | { |
2281 | if (where) | |
c4100eae | 2282 | gfc_error ("Actual argument to %qs at %L must have the same " |
5ac13b8e | 2283 | "declared type", formal->name, &actual->where); |
f3e1097b | 2284 | return false; |
5ac13b8e JW |
2285 | } |
2286 | } | |
6de9cd9a | 2287 | |
8b704316 PT |
2288 | /* F08: 12.5.2.5 Allocatable and pointer dummy variables. However, this |
2289 | is necessary also for F03, so retain error for both. | |
2290 | NOTE: Other type/kind errors pre-empt this error. Since they are F03 | |
2291 | compatible, no attempt has been made to channel to this one. */ | |
2292 | if (UNLIMITED_POLY (formal) && !UNLIMITED_POLY (actual) | |
2293 | && (CLASS_DATA (formal)->attr.allocatable | |
2294 | ||CLASS_DATA (formal)->attr.class_pointer)) | |
2295 | { | |
2296 | if (where) | |
c4100eae | 2297 | gfc_error ("Actual argument to %qs at %L must be unlimited " |
8b704316 PT |
2298 | "polymorphic since the formal argument is a " |
2299 | "pointer or allocatable unlimited polymorphic " | |
2300 | "entity [F2008: 12.5.2.5]", formal->name, | |
2301 | &actual->where); | |
f3e1097b | 2302 | return false; |
8b704316 PT |
2303 | } |
2304 | ||
394d3a2e | 2305 | if (formal->attr.codimension && !gfc_is_coarray (actual)) |
d3a9eea2 | 2306 | { |
394d3a2e | 2307 | if (where) |
c4100eae | 2308 | gfc_error ("Actual argument to %qs at %L must be a coarray", |
d3a9eea2 | 2309 | formal->name, &actual->where); |
f3e1097b | 2310 | return false; |
394d3a2e | 2311 | } |
d3a9eea2 | 2312 | |
394d3a2e TB |
2313 | if (formal->attr.codimension && formal->attr.allocatable) |
2314 | { | |
2315 | gfc_ref *last = NULL; | |
a3935ffc | 2316 | |
d3a9eea2 | 2317 | for (ref = actual->ref; ref; ref = ref->next) |
394d3a2e TB |
2318 | if (ref->type == REF_COMPONENT) |
2319 | last = ref; | |
d3a9eea2 | 2320 | |
d3a9eea2 | 2321 | /* F2008, 12.5.2.6. */ |
394d3a2e TB |
2322 | if ((last && last->u.c.component->as->corank != formal->as->corank) |
2323 | || (!last | |
2324 | && actual->symtree->n.sym->as->corank != formal->as->corank)) | |
d3a9eea2 TB |
2325 | { |
2326 | if (where) | |
c4100eae | 2327 | gfc_error ("Corank mismatch in argument %qs at %L (%d and %d)", |
d3a9eea2 TB |
2328 | formal->name, &actual->where, formal->as->corank, |
2329 | last ? last->u.c.component->as->corank | |
2330 | : actual->symtree->n.sym->as->corank); | |
f3e1097b | 2331 | return false; |
d3a9eea2 | 2332 | } |
394d3a2e | 2333 | } |
fe4e525c | 2334 | |
394d3a2e TB |
2335 | if (formal->attr.codimension) |
2336 | { | |
460263d0 TB |
2337 | /* F2008, 12.5.2.8 + Corrig 2 (IR F08/0048). */ |
2338 | /* F2015, 12.5.2.8. */ | |
fe4e525c TB |
2339 | if (formal->attr.dimension |
2340 | && (formal->attr.contiguous || formal->as->type != AS_ASSUMED_SHAPE) | |
fec5ce24 | 2341 | && actual_attr.dimension |
460263d0 | 2342 | && !gfc_is_simply_contiguous (actual, true, true)) |
fe4e525c TB |
2343 | { |
2344 | if (where) | |
c4100eae | 2345 | gfc_error ("Actual argument to %qs at %L must be simply " |
460263d0 TB |
2346 | "contiguous or an element of such an array", |
2347 | formal->name, &actual->where); | |
f3e1097b | 2348 | return false; |
fe4e525c | 2349 | } |
fea54935 TB |
2350 | |
2351 | /* F2008, C1303 and C1304. */ | |
2352 | if (formal->attr.intent != INTENT_INOUT | |
2353 | && (((formal->ts.type == BT_DERIVED || formal->ts.type == BT_CLASS) | |
2354 | && formal->ts.u.derived->from_intmod == INTMOD_ISO_FORTRAN_ENV | |
2355 | && formal->ts.u.derived->intmod_sym_id == ISOFORTRAN_LOCK_TYPE) | |
2356 | || formal->attr.lock_comp)) | |
2357 | ||
2358 | { | |
2359 | if (where) | |
c4100eae | 2360 | gfc_error ("Actual argument to non-INTENT(INOUT) dummy %qs at %L, " |
fea54935 TB |
2361 | "which is LOCK_TYPE or has a LOCK_TYPE component", |
2362 | formal->name, &actual->where); | |
f3e1097b | 2363 | return false; |
fea54935 | 2364 | } |
5df445a2 TB |
2365 | |
2366 | /* TS18508, C702/C703. */ | |
2367 | if (formal->attr.intent != INTENT_INOUT | |
2368 | && (((formal->ts.type == BT_DERIVED || formal->ts.type == BT_CLASS) | |
2369 | && formal->ts.u.derived->from_intmod == INTMOD_ISO_FORTRAN_ENV | |
2370 | && formal->ts.u.derived->intmod_sym_id == ISOFORTRAN_EVENT_TYPE) | |
2371 | || formal->attr.event_comp)) | |
2372 | ||
2373 | { | |
2374 | if (where) | |
2375 | gfc_error ("Actual argument to non-INTENT(INOUT) dummy %qs at %L, " | |
2376 | "which is EVENT_TYPE or has a EVENT_TYPE component", | |
2377 | formal->name, &actual->where); | |
f3e1097b | 2378 | return false; |
5df445a2 | 2379 | } |
394d3a2e | 2380 | } |
fe4e525c TB |
2381 | |
2382 | /* F2008, C1239/C1240. */ | |
2383 | if (actual->expr_type == EXPR_VARIABLE | |
2384 | && (actual->symtree->n.sym->attr.asynchronous | |
2385 | || actual->symtree->n.sym->attr.volatile_) | |
2386 | && (formal->attr.asynchronous || formal->attr.volatile_) | |
460263d0 TB |
2387 | && actual->rank && formal->as |
2388 | && !gfc_is_simply_contiguous (actual, true, false) | |
f188272d TB |
2389 | && ((formal->as->type != AS_ASSUMED_SHAPE |
2390 | && formal->as->type != AS_ASSUMED_RANK && !formal->attr.pointer) | |
fe4e525c TB |
2391 | || formal->attr.contiguous)) |
2392 | { | |
2393 | if (where) | |
c4100eae | 2394 | gfc_error ("Dummy argument %qs has to be a pointer, assumed-shape or " |
f188272d TB |
2395 | "assumed-rank array without CONTIGUOUS attribute - as actual" |
2396 | " argument at %L is not simply contiguous and both are " | |
2397 | "ASYNCHRONOUS or VOLATILE", formal->name, &actual->where); | |
f3e1097b | 2398 | return false; |
d3a9eea2 TB |
2399 | } |
2400 | ||
427180d2 | 2401 | if (formal->attr.allocatable && !formal->attr.codimension |
fec5ce24 | 2402 | && actual_attr.codimension) |
427180d2 TB |
2403 | { |
2404 | if (formal->attr.intent == INTENT_OUT) | |
2405 | { | |
2406 | if (where) | |
2407 | gfc_error ("Passing coarray at %L to allocatable, noncoarray, " | |
c4100eae | 2408 | "INTENT(OUT) dummy argument %qs", &actual->where, |
427180d2 | 2409 | formal->name); |
f3e1097b | 2410 | return false; |
427180d2 | 2411 | } |
73e42eef | 2412 | else if (warn_surprising && where && formal->attr.intent != INTENT_IN) |
48749dbc MLI |
2413 | gfc_warning (OPT_Wsurprising, |
2414 | "Passing coarray at %L to allocatable, noncoarray dummy " | |
2415 | "argument %qs, which is invalid if the allocation status" | |
427180d2 TB |
2416 | " is modified", &actual->where, formal->name); |
2417 | } | |
2418 | ||
c62c6622 TB |
2419 | /* If the rank is the same or the formal argument has assumed-rank. */ |
2420 | if (symbol_rank (formal) == actual->rank || symbol_rank (formal) == -1) | |
f3e1097b | 2421 | return true; |
6de9cd9a | 2422 | |
5ad6345e TB |
2423 | rank_check = where != NULL && !is_elemental && formal->as |
2424 | && (formal->as->type == AS_ASSUMED_SHAPE | |
d8a8dab3 TB |
2425 | || formal->as->type == AS_DEFERRED) |
2426 | && actual->expr_type != EXPR_NULL; | |
6de9cd9a | 2427 | |
e7ac6a7c TB |
2428 | /* Skip rank checks for NO_ARG_CHECK. */ |
2429 | if (formal->attr.ext_attr & (1 << EXT_ATTR_NO_ARG_CHECK)) | |
f3e1097b | 2430 | return true; |
e7ac6a7c | 2431 | |
d3a9eea2 | 2432 | /* Scalar & coindexed, see: F2008, Section 12.5.2.4. */ |
d8a8dab3 TB |
2433 | if (rank_check || ranks_must_agree |
2434 | || (formal->attr.pointer && actual->expr_type != EXPR_NULL) | |
5ad6345e | 2435 | || (actual->rank != 0 && !(is_elemental || formal->attr.dimension)) |
c49ea23d PT |
2436 | || (actual->rank == 0 |
2437 | && ((formal->ts.type == BT_CLASS | |
2438 | && CLASS_DATA (formal)->as->type == AS_ASSUMED_SHAPE) | |
2439 | || (formal->ts.type != BT_CLASS | |
2440 | && formal->as->type == AS_ASSUMED_SHAPE)) | |
08857b61 | 2441 | && actual->expr_type != EXPR_NULL) |
d3a9eea2 TB |
2442 | || (actual->rank == 0 && formal->attr.dimension |
2443 | && gfc_is_coindexed (actual))) | |
5ad6345e TB |
2444 | { |
2445 | if (where) | |
a516520c PT |
2446 | argument_rank_mismatch (formal->name, &actual->where, |
2447 | symbol_rank (formal), actual->rank); | |
f3e1097b | 2448 | return false; |
5ad6345e TB |
2449 | } |
2450 | else if (actual->rank != 0 && (is_elemental || formal->attr.dimension)) | |
f3e1097b | 2451 | return true; |
5ad6345e TB |
2452 | |
2453 | /* At this point, we are considering a scalar passed to an array. This | |
975b975b | 2454 | is valid (cf. F95 12.4.1.1, F2003 12.4.1.2, and F2008 12.5.2.4), |
5ad6345e | 2455 | - if the actual argument is (a substring of) an element of a |
975b975b TB |
2456 | non-assumed-shape/non-pointer/non-polymorphic array; or |
2457 | - (F2003) if the actual argument is of type character of default/c_char | |
2458 | kind. */ | |
2459 | ||
2460 | is_pointer = actual->expr_type == EXPR_VARIABLE | |
2461 | ? actual->symtree->n.sym->attr.pointer : false; | |
6de9cd9a DN |
2462 | |
2463 | for (ref = actual->ref; ref; ref = ref->next) | |
975b975b TB |
2464 | { |
2465 | if (ref->type == REF_COMPONENT) | |
2466 | is_pointer = ref->u.c.component->attr.pointer; | |
2467 | else if (ref->type == REF_ARRAY && ref->u.ar.type == AR_ELEMENT | |
2468 | && ref->u.ar.dimen > 0 | |
8b704316 | 2469 | && (!ref->next |
975b975b TB |
2470 | || (ref->next->type == REF_SUBSTRING && !ref->next->next))) |
2471 | break; | |
2472 | } | |
2473 | ||
2474 | if (actual->ts.type == BT_CLASS && actual->expr_type != EXPR_NULL) | |
2475 | { | |
2476 | if (where) | |
c4100eae | 2477 | gfc_error ("Polymorphic scalar passed to array dummy argument %qs " |
975b975b | 2478 | "at %L", formal->name, &actual->where); |
f3e1097b | 2479 | return false; |
975b975b TB |
2480 | } |
2481 | ||
2482 | if (actual->expr_type != EXPR_NULL && ref && actual->ts.type != BT_CHARACTER | |
2483 | && (is_pointer || ref->u.ar.as->type == AS_ASSUMED_SHAPE)) | |
2484 | { | |
2485 | if (where) | |
2486 | gfc_error ("Element of assumed-shaped or pointer " | |
c4100eae | 2487 | "array passed to array dummy argument %qs at %L", |
975b975b | 2488 | formal->name, &actual->where); |
f3e1097b | 2489 | return false; |
975b975b | 2490 | } |
6de9cd9a | 2491 | |
975b975b TB |
2492 | if (actual->ts.type == BT_CHARACTER && actual->expr_type != EXPR_NULL |
2493 | && (!ref || is_pointer || ref->u.ar.as->type == AS_ASSUMED_SHAPE)) | |
5ad6345e | 2494 | { |
975b975b TB |
2495 | if (formal->ts.kind != 1 && (gfc_option.allow_std & GFC_STD_GNU) == 0) |
2496 | { | |
2497 | if (where) | |
2498 | gfc_error ("Extension: Scalar non-default-kind, non-C_CHAR-kind " | |
2499 | "CHARACTER actual argument with array dummy argument " | |
c4100eae | 2500 | "%qs at %L", formal->name, &actual->where); |
f3e1097b | 2501 | return false; |
975b975b TB |
2502 | } |
2503 | ||
5ad6345e TB |
2504 | if (where && (gfc_option.allow_std & GFC_STD_F2003) == 0) |
2505 | { | |
2506 | gfc_error ("Fortran 2003: Scalar CHARACTER actual argument with " | |
c4100eae | 2507 | "array dummy argument %qs at %L", |
5ad6345e | 2508 | formal->name, &actual->where); |
f3e1097b | 2509 | return false; |
5ad6345e | 2510 | } |
5ad6345e | 2511 | else |
f3e1097b | 2512 | return ((gfc_option.allow_std & GFC_STD_F2003) != 0); |
5ad6345e | 2513 | } |
975b975b TB |
2514 | |
2515 | if (ref == NULL && actual->expr_type != EXPR_NULL) | |
5ad6345e TB |
2516 | { |
2517 | if (where) | |
a516520c PT |
2518 | argument_rank_mismatch (formal->name, &actual->where, |
2519 | symbol_rank (formal), actual->rank); | |
f3e1097b | 2520 | return false; |
5ad6345e TB |
2521 | } |
2522 | ||
f3e1097b | 2523 | return true; |
6de9cd9a DN |
2524 | } |
2525 | ||
2526 | ||
2d5b90b2 TB |
2527 | /* Returns the storage size of a symbol (formal argument) or |
2528 | zero if it cannot be determined. */ | |
2529 | ||
2530 | static unsigned long | |
2531 | get_sym_storage_size (gfc_symbol *sym) | |
2532 | { | |
2533 | int i; | |
2534 | unsigned long strlen, elements; | |
2535 | ||
2536 | if (sym->ts.type == BT_CHARACTER) | |
2537 | { | |
bc21d315 JW |
2538 | if (sym->ts.u.cl && sym->ts.u.cl->length |
2539 | && sym->ts.u.cl->length->expr_type == EXPR_CONSTANT) | |
2540 | strlen = mpz_get_ui (sym->ts.u.cl->length->value.integer); | |
2d5b90b2 TB |
2541 | else |
2542 | return 0; | |
2543 | } | |
2544 | else | |
8b704316 | 2545 | strlen = 1; |
2d5b90b2 TB |
2546 | |
2547 | if (symbol_rank (sym) == 0) | |
2548 | return strlen; | |
2549 | ||
2550 | elements = 1; | |
2551 | if (sym->as->type != AS_EXPLICIT) | |
2552 | return 0; | |
2553 | for (i = 0; i < sym->as->rank; i++) | |
2554 | { | |
efb63364 | 2555 | if (sym->as->upper[i]->expr_type != EXPR_CONSTANT |
2d5b90b2 TB |
2556 | || sym->as->lower[i]->expr_type != EXPR_CONSTANT) |
2557 | return 0; | |
2558 | ||
c13af44b SK |
2559 | elements *= mpz_get_si (sym->as->upper[i]->value.integer) |
2560 | - mpz_get_si (sym->as->lower[i]->value.integer) + 1L; | |
2d5b90b2 TB |
2561 | } |
2562 | ||
2563 | return strlen*elements; | |
2564 | } | |
2565 | ||
2566 | ||
2567 | /* Returns the storage size of an expression (actual argument) or | |
2568 | zero if it cannot be determined. For an array element, it returns | |
1207ac67 | 2569 | the remaining size as the element sequence consists of all storage |
2d5b90b2 TB |
2570 | units of the actual argument up to the end of the array. */ |
2571 | ||
2572 | static unsigned long | |
2573 | get_expr_storage_size (gfc_expr *e) | |
2574 | { | |
2575 | int i; | |
2576 | long int strlen, elements; | |
6da0839a | 2577 | long int substrlen = 0; |
a0710c29 | 2578 | bool is_str_storage = false; |
2d5b90b2 TB |
2579 | gfc_ref *ref; |
2580 | ||
2581 | if (e == NULL) | |
2582 | return 0; | |
8b704316 | 2583 | |
2d5b90b2 TB |
2584 | if (e->ts.type == BT_CHARACTER) |
2585 | { | |
bc21d315 JW |
2586 | if (e->ts.u.cl && e->ts.u.cl->length |
2587 | && e->ts.u.cl->length->expr_type == EXPR_CONSTANT) | |
2588 | strlen = mpz_get_si (e->ts.u.cl->length->value.integer); | |
2d5b90b2 | 2589 | else if (e->expr_type == EXPR_CONSTANT |
bc21d315 | 2590 | && (e->ts.u.cl == NULL || e->ts.u.cl->length == NULL)) |
2d5b90b2 TB |
2591 | strlen = e->value.character.length; |
2592 | else | |
2593 | return 0; | |
2594 | } | |
2595 | else | |
2596 | strlen = 1; /* Length per element. */ | |
2597 | ||
2598 | if (e->rank == 0 && !e->ref) | |
2599 | return strlen; | |
2600 | ||
2601 | elements = 1; | |
2602 | if (!e->ref) | |
2603 | { | |
2604 | if (!e->shape) | |
2605 | return 0; | |
2606 | for (i = 0; i < e->rank; i++) | |
2607 | elements *= mpz_get_si (e->shape[i]); | |
2608 | return elements*strlen; | |
2609 | } | |
2610 | ||
2611 | for (ref = e->ref; ref; ref = ref->next) | |
2612 | { | |
6da0839a TB |
2613 | if (ref->type == REF_SUBSTRING && ref->u.ss.start |
2614 | && ref->u.ss.start->expr_type == EXPR_CONSTANT) | |
2615 | { | |
a0710c29 TB |
2616 | if (is_str_storage) |
2617 | { | |
2618 | /* The string length is the substring length. | |
2619 | Set now to full string length. */ | |
e323640f | 2620 | if (!ref->u.ss.length || !ref->u.ss.length->length |
a0710c29 TB |
2621 | || ref->u.ss.length->length->expr_type != EXPR_CONSTANT) |
2622 | return 0; | |
2623 | ||
2624 | strlen = mpz_get_ui (ref->u.ss.length->length->value.integer); | |
2625 | } | |
2626 | substrlen = strlen - mpz_get_ui (ref->u.ss.start->value.integer) + 1; | |
6da0839a TB |
2627 | continue; |
2628 | } | |
2629 | ||
efb63364 | 2630 | if (ref->type == REF_ARRAY && ref->u.ar.type == AR_SECTION) |
2d5b90b2 TB |
2631 | for (i = 0; i < ref->u.ar.dimen; i++) |
2632 | { | |
2633 | long int start, end, stride; | |
2634 | stride = 1; | |
37639728 | 2635 | |
2d5b90b2 TB |
2636 | if (ref->u.ar.stride[i]) |
2637 | { | |
2638 | if (ref->u.ar.stride[i]->expr_type == EXPR_CONSTANT) | |
2639 | stride = mpz_get_si (ref->u.ar.stride[i]->value.integer); | |
2640 | else | |
2641 | return 0; | |
2642 | } | |
2643 | ||
2644 | if (ref->u.ar.start[i]) | |
2645 | { | |
2646 | if (ref->u.ar.start[i]->expr_type == EXPR_CONSTANT) | |
2647 | start = mpz_get_si (ref->u.ar.start[i]->value.integer); | |
2648 | else | |
2649 | return 0; | |
2650 | } | |
37639728 TB |
2651 | else if (ref->u.ar.as->lower[i] |
2652 | && ref->u.ar.as->lower[i]->expr_type == EXPR_CONSTANT) | |
2653 | start = mpz_get_si (ref->u.ar.as->lower[i]->value.integer); | |
2654 | else | |
2655 | return 0; | |
2d5b90b2 TB |
2656 | |
2657 | if (ref->u.ar.end[i]) | |
2658 | { | |
2659 | if (ref->u.ar.end[i]->expr_type == EXPR_CONSTANT) | |
2660 | end = mpz_get_si (ref->u.ar.end[i]->value.integer); | |
2661 | else | |
2662 | return 0; | |
2663 | } | |
2664 | else if (ref->u.ar.as->upper[i] | |
2665 | && ref->u.ar.as->upper[i]->expr_type == EXPR_CONSTANT) | |
2666 | end = mpz_get_si (ref->u.ar.as->upper[i]->value.integer); | |
2667 | else | |
2668 | return 0; | |
2669 | ||
2670 | elements *= (end - start)/stride + 1L; | |
2671 | } | |
c6423ef3 | 2672 | else if (ref->type == REF_ARRAY && ref->u.ar.type == AR_FULL) |
2d5b90b2 TB |
2673 | for (i = 0; i < ref->u.ar.as->rank; i++) |
2674 | { | |
2675 | if (ref->u.ar.as->lower[i] && ref->u.ar.as->upper[i] | |
2676 | && ref->u.ar.as->lower[i]->expr_type == EXPR_CONSTANT | |
edcc76d5 SK |
2677 | && ref->u.ar.as->lower[i]->ts.type == BT_INTEGER |
2678 | && ref->u.ar.as->upper[i]->expr_type == EXPR_CONSTANT | |
2679 | && ref->u.ar.as->upper[i]->ts.type == BT_INTEGER) | |
da9ad923 TB |
2680 | elements *= mpz_get_si (ref->u.ar.as->upper[i]->value.integer) |
2681 | - mpz_get_si (ref->u.ar.as->lower[i]->value.integer) | |
2d5b90b2 TB |
2682 | + 1L; |
2683 | else | |
2684 | return 0; | |
2685 | } | |
6da0839a | 2686 | else if (ref->type == REF_ARRAY && ref->u.ar.type == AR_ELEMENT |
a0710c29 TB |
2687 | && e->expr_type == EXPR_VARIABLE) |
2688 | { | |
93302a24 | 2689 | if (ref->u.ar.as->type == AS_ASSUMED_SHAPE |
a0710c29 TB |
2690 | || e->symtree->n.sym->attr.pointer) |
2691 | { | |
2692 | elements = 1; | |
2693 | continue; | |
2694 | } | |
2695 | ||
2696 | /* Determine the number of remaining elements in the element | |
2697 | sequence for array element designators. */ | |
2698 | is_str_storage = true; | |
2699 | for (i = ref->u.ar.dimen - 1; i >= 0; i--) | |
2700 | { | |
2701 | if (ref->u.ar.start[i] == NULL | |
2702 | || ref->u.ar.start[i]->expr_type != EXPR_CONSTANT | |
2703 | || ref->u.ar.as->upper[i] == NULL | |
2704 | || ref->u.ar.as->lower[i] == NULL | |
2705 | || ref->u.ar.as->upper[i]->expr_type != EXPR_CONSTANT | |
2706 | || ref->u.ar.as->lower[i]->expr_type != EXPR_CONSTANT) | |
2707 | return 0; | |
2708 | ||
2709 | elements | |
2710 | = elements | |
2711 | * (mpz_get_si (ref->u.ar.as->upper[i]->value.integer) | |
2712 | - mpz_get_si (ref->u.ar.as->lower[i]->value.integer) | |
2713 | + 1L) | |
2714 | - (mpz_get_si (ref->u.ar.start[i]->value.integer) | |
2715 | - mpz_get_si (ref->u.ar.as->lower[i]->value.integer)); | |
2716 | } | |
2717 | } | |
3436db75 JW |
2718 | else if (ref->type == REF_COMPONENT && ref->u.c.component->attr.function |
2719 | && ref->u.c.component->attr.proc_pointer | |
2720 | && ref->u.c.component->attr.dimension) | |
2721 | { | |
2722 | /* Array-valued procedure-pointer components. */ | |
2723 | gfc_array_spec *as = ref->u.c.component->as; | |
2724 | for (i = 0; i < as->rank; i++) | |
2725 | { | |
2726 | if (!as->upper[i] || !as->lower[i] | |
2727 | || as->upper[i]->expr_type != EXPR_CONSTANT | |
2728 | || as->lower[i]->expr_type != EXPR_CONSTANT) | |
2729 | return 0; | |
2730 | ||
2731 | elements = elements | |
2732 | * (mpz_get_si (as->upper[i]->value.integer) | |
2733 | - mpz_get_si (as->lower[i]->value.integer) + 1L); | |
2734 | } | |
2735 | } | |
2d5b90b2 TB |
2736 | } |
2737 | ||
6da0839a | 2738 | if (substrlen) |
a0710c29 TB |
2739 | return (is_str_storage) ? substrlen + (elements-1)*strlen |
2740 | : elements*strlen; | |
2741 | else | |
2742 | return elements*strlen; | |
2d5b90b2 TB |
2743 | } |
2744 | ||
2745 | ||
59be8071 | 2746 | /* Given an expression, check whether it is an array section |
f3e1097b | 2747 | which has a vector subscript. */ |
59be8071 | 2748 | |
f3e1097b | 2749 | bool |
03af1e4c | 2750 | gfc_has_vector_subscript (gfc_expr *e) |
59be8071 TB |
2751 | { |
2752 | int i; | |
2753 | gfc_ref *ref; | |
2754 | ||
2755 | if (e == NULL || e->rank == 0 || e->expr_type != EXPR_VARIABLE) | |
f3e1097b | 2756 | return false; |
59be8071 TB |
2757 | |
2758 | for (ref = e->ref; ref; ref = ref->next) | |
2759 | if (ref->type == REF_ARRAY && ref->u.ar.type == AR_SECTION) | |
2760 | for (i = 0; i < ref->u.ar.dimen; i++) | |
2761 | if (ref->u.ar.dimen_type[i] == DIMEN_VECTOR) | |
f3e1097b | 2762 | return true; |
59be8071 | 2763 | |
f3e1097b | 2764 | return false; |
59be8071 TB |
2765 | } |
2766 | ||
2767 | ||
4294c093 JW |
2768 | static bool |
2769 | is_procptr_result (gfc_expr *expr) | |
2770 | { | |
2771 | gfc_component *c = gfc_get_proc_ptr_comp (expr); | |
2772 | if (c) | |
2773 | return (c->ts.interface && (c->ts.interface->attr.proc_pointer == 1)); | |
2774 | else | |
2775 | return ((expr->symtree->n.sym->result != expr->symtree->n.sym) | |
2776 | && (expr->symtree->n.sym->result->attr.proc_pointer == 1)); | |
2777 | } | |
2778 | ||
2779 | ||
6de9cd9a DN |
2780 | /* Given formal and actual argument lists, see if they are compatible. |
2781 | If they are compatible, the actual argument list is sorted to | |
2782 | correspond with the formal list, and elements for missing optional | |
2783 | arguments are inserted. If WHERE pointer is nonnull, then we issue | |
2784 | errors when things don't match instead of just returning the status | |
2785 | code. */ | |
2786 | ||
f3e1097b | 2787 | static bool |
f0ac18b7 DK |
2788 | compare_actual_formal (gfc_actual_arglist **ap, gfc_formal_arglist *formal, |
2789 | int ranks_must_agree, int is_elemental, locus *where) | |
6de9cd9a | 2790 | { |
fab27f52 | 2791 | gfc_actual_arglist **new_arg, *a, *actual; |
6de9cd9a DN |
2792 | gfc_formal_arglist *f; |
2793 | int i, n, na; | |
2d5b90b2 | 2794 | unsigned long actual_size, formal_size; |
c49ea23d | 2795 | bool full_array = false; |
eb401400 | 2796 | gfc_array_ref *actual_arr_ref; |
6de9cd9a DN |
2797 | |
2798 | actual = *ap; | |
2799 | ||
2800 | if (actual == NULL && formal == NULL) | |
f3e1097b | 2801 | return true; |
6de9cd9a DN |
2802 | |
2803 | n = 0; | |
2804 | for (f = formal; f; f = f->next) | |
2805 | n++; | |
2806 | ||
1145e690 | 2807 | new_arg = XALLOCAVEC (gfc_actual_arglist *, n); |
6de9cd9a DN |
2808 | |
2809 | for (i = 0; i < n; i++) | |
7b901ac4 | 2810 | new_arg[i] = NULL; |
6de9cd9a DN |
2811 | |
2812 | na = 0; | |
2813 | f = formal; | |
2814 | i = 0; | |
2815 | ||
2816 | for (a = actual; a; a = a->next, f = f->next) | |
2817 | { | |
7fcafa71 PT |
2818 | /* Look for keywords but ignore g77 extensions like %VAL. */ |
2819 | if (a->name != NULL && a->name[0] != '%') | |
6de9cd9a DN |
2820 | { |
2821 | i = 0; | |
2822 | for (f = formal; f; f = f->next, i++) | |
2823 | { | |
2824 | if (f->sym == NULL) | |
2825 | continue; | |
2826 | if (strcmp (f->sym->name, a->name) == 0) | |
2827 | break; | |
2828 | } | |
2829 | ||
2830 | if (f == NULL) | |
2831 | { | |
2832 | if (where) | |
c4100eae | 2833 | gfc_error ("Keyword argument %qs at %L is not in " |
b251af97 | 2834 | "the procedure", a->name, &a->expr->where); |
f3e1097b | 2835 | return false; |
6de9cd9a DN |
2836 | } |
2837 | ||
7b901ac4 | 2838 | if (new_arg[i] != NULL) |
6de9cd9a DN |
2839 | { |
2840 | if (where) | |
c4100eae | 2841 | gfc_error ("Keyword argument %qs at %L is already associated " |
b251af97 SK |
2842 | "with another actual argument", a->name, |
2843 | &a->expr->where); | |
f3e1097b | 2844 | return false; |
6de9cd9a DN |
2845 | } |
2846 | } | |
2847 | ||
2848 | if (f == NULL) | |
2849 | { | |
2850 | if (where) | |
b251af97 SK |
2851 | gfc_error ("More actual than formal arguments in procedure " |
2852 | "call at %L", where); | |
6de9cd9a | 2853 | |
f3e1097b | 2854 | return false; |
6de9cd9a DN |
2855 | } |
2856 | ||
2857 | if (f->sym == NULL && a->expr == NULL) | |
2858 | goto match; | |
2859 | ||
2860 | if (f->sym == NULL) | |
2861 | { | |
2862 | if (where) | |
b251af97 SK |
2863 | gfc_error ("Missing alternate return spec in subroutine call " |
2864 | "at %L", where); | |
f3e1097b | 2865 | return false; |
6de9cd9a DN |
2866 | } |
2867 | ||
2868 | if (a->expr == NULL) | |
2869 | { | |
2870 | if (where) | |
b251af97 SK |
2871 | gfc_error ("Unexpected alternate return spec in subroutine " |
2872 | "call at %L", where); | |
f3e1097b | 2873 | return false; |
6de9cd9a | 2874 | } |
08857b61 | 2875 | |
8b704316 PT |
2876 | /* Make sure that intrinsic vtables exist for calls to unlimited |
2877 | polymorphic formal arguments. */ | |
524af0d6 | 2878 | if (UNLIMITED_POLY (f->sym) |
8b704316 PT |
2879 | && a->expr->ts.type != BT_DERIVED |
2880 | && a->expr->ts.type != BT_CLASS) | |
7289d1c9 | 2881 | gfc_find_vtab (&a->expr->ts); |
8b704316 | 2882 | |
99091b70 TB |
2883 | if (a->expr->expr_type == EXPR_NULL |
2884 | && ((f->sym->ts.type != BT_CLASS && !f->sym->attr.pointer | |
2885 | && (f->sym->attr.allocatable || !f->sym->attr.optional | |
2886 | || (gfc_option.allow_std & GFC_STD_F2008) == 0)) | |
2887 | || (f->sym->ts.type == BT_CLASS | |
2888 | && !CLASS_DATA (f->sym)->attr.class_pointer | |
2889 | && (CLASS_DATA (f->sym)->attr.allocatable | |
2890 | || !f->sym->attr.optional | |
2891 | || (gfc_option.allow_std & GFC_STD_F2008) == 0)))) | |
08857b61 | 2892 | { |
99091b70 TB |
2893 | if (where |
2894 | && (!f->sym->attr.optional | |
2895 | || (f->sym->ts.type != BT_CLASS && f->sym->attr.allocatable) | |
2896 | || (f->sym->ts.type == BT_CLASS | |
2897 | && CLASS_DATA (f->sym)->attr.allocatable))) | |
c4100eae | 2898 | gfc_error ("Unexpected NULL() intrinsic at %L to dummy %qs", |
08857b61 TB |
2899 | where, f->sym->name); |
2900 | else if (where) | |
2901 | gfc_error ("Fortran 2008: Null pointer at %L to non-pointer " | |
c4100eae | 2902 | "dummy %qs", where, f->sym->name); |
08857b61 | 2903 | |
f3e1097b | 2904 | return false; |
08857b61 | 2905 | } |
8b704316 | 2906 | |
5ad6345e TB |
2907 | if (!compare_parameter (f->sym, a->expr, ranks_must_agree, |
2908 | is_elemental, where)) | |
f3e1097b | 2909 | return false; |
6de9cd9a | 2910 | |
45a69325 TB |
2911 | /* TS 29113, 6.3p2. */ |
2912 | if (f->sym->ts.type == BT_ASSUMED | |
2913 | && (a->expr->ts.type == BT_DERIVED | |
2914 | || (a->expr->ts.type == BT_CLASS && CLASS_DATA (a->expr)))) | |
2915 | { | |
2916 | gfc_namespace *f2k_derived; | |
2917 | ||
2918 | f2k_derived = a->expr->ts.type == BT_DERIVED | |
2919 | ? a->expr->ts.u.derived->f2k_derived | |
2920 | : CLASS_DATA (a->expr)->ts.u.derived->f2k_derived; | |
2921 | ||
2922 | if (f2k_derived | |
2923 | && (f2k_derived->finalizers || f2k_derived->tb_sym_root)) | |
2924 | { | |
2925 | gfc_error ("Actual argument at %L to assumed-type dummy is of " | |
2926 | "derived type with type-bound or FINAL procedures", | |
2927 | &a->expr->where); | |
524af0d6 | 2928 | return false; |
45a69325 TB |
2929 | } |
2930 | } | |
2931 | ||
a0710c29 TB |
2932 | /* Special case for character arguments. For allocatable, pointer |
2933 | and assumed-shape dummies, the string length needs to match | |
2934 | exactly. */ | |
2d5b90b2 | 2935 | if (a->expr->ts.type == BT_CHARACTER |
eb401400 AV |
2936 | && a->expr->ts.u.cl && a->expr->ts.u.cl->length |
2937 | && a->expr->ts.u.cl->length->expr_type == EXPR_CONSTANT | |
2938 | && f->sym->ts.type == BT_CHARACTER && f->sym->ts.u.cl | |
2939 | && f->sym->ts.u.cl->length | |
2940 | && f->sym->ts.u.cl->length->expr_type == EXPR_CONSTANT | |
2941 | && (f->sym->attr.pointer || f->sym->attr.allocatable | |
2942 | || (f->sym->as && f->sym->as->type == AS_ASSUMED_SHAPE)) | |
2943 | && (mpz_cmp (a->expr->ts.u.cl->length->value.integer, | |
2944 | f->sym->ts.u.cl->length->value.integer) != 0)) | |
2945 | { | |
2946 | if (where && (f->sym->attr.pointer || f->sym->attr.allocatable)) | |
2947 | gfc_warning (OPT_Wargument_mismatch, | |
2948 | "Character length mismatch (%ld/%ld) between actual " | |
2949 | "argument and pointer or allocatable dummy argument " | |
2950 | "%qs at %L", | |
2951 | mpz_get_si (a->expr->ts.u.cl->length->value.integer), | |
2952 | mpz_get_si (f->sym->ts.u.cl->length->value.integer), | |
2953 | f->sym->name, &a->expr->where); | |
2954 | else if (where) | |
2955 | gfc_warning (OPT_Wargument_mismatch, | |
2956 | "Character length mismatch (%ld/%ld) between actual " | |
2957 | "argument and assumed-shape dummy argument %qs " | |
2958 | "at %L", | |
2959 | mpz_get_si (a->expr->ts.u.cl->length->value.integer), | |
2960 | mpz_get_si (f->sym->ts.u.cl->length->value.integer), | |
2961 | f->sym->name, &a->expr->where); | |
f3e1097b | 2962 | return false; |
eb401400 | 2963 | } |
a0324f7b | 2964 | |
8d51f26f | 2965 | if ((f->sym->attr.pointer || f->sym->attr.allocatable) |
eb401400 AV |
2966 | && f->sym->ts.deferred != a->expr->ts.deferred |
2967 | && a->expr->ts.type == BT_CHARACTER) | |
8d51f26f PT |
2968 | { |
2969 | if (where) | |
0c133211 | 2970 | gfc_error ("Actual argument at %L to allocatable or " |
c4100eae | 2971 | "pointer dummy argument %qs must have a deferred " |
8d51f26f PT |
2972 | "length type parameter if and only if the dummy has one", |
2973 | &a->expr->where, f->sym->name); | |
f3e1097b | 2974 | return false; |
8d51f26f PT |
2975 | } |
2976 | ||
c49ea23d PT |
2977 | if (f->sym->ts.type == BT_CLASS) |
2978 | goto skip_size_check; | |
2979 | ||
37639728 TB |
2980 | actual_size = get_expr_storage_size (a->expr); |
2981 | formal_size = get_sym_storage_size (f->sym); | |
93302a24 JW |
2982 | if (actual_size != 0 && actual_size < formal_size |
2983 | && a->expr->ts.type != BT_PROCEDURE | |
2984 | && f->sym->attr.flavor != FL_PROCEDURE) | |
2d5b90b2 TB |
2985 | { |
2986 | if (a->expr->ts.type == BT_CHARACTER && !f->sym->as && where) | |
3df19fa0 FR |
2987 | gfc_warning (OPT_Wargument_mismatch, |
2988 | "Character length of actual argument shorter " | |
48749dbc | 2989 | "than of dummy argument %qs (%lu/%lu) at %L", |
8d51f26f PT |
2990 | f->sym->name, actual_size, formal_size, |
2991 | &a->expr->where); | |
2d5b90b2 | 2992 | else if (where) |
3df19fa0 FR |
2993 | gfc_warning (OPT_Wargument_mismatch, |
2994 | "Actual argument contains too few " | |
48749dbc | 2995 | "elements for dummy argument %qs (%lu/%lu) at %L", |
8d51f26f PT |
2996 | f->sym->name, actual_size, formal_size, |
2997 | &a->expr->where); | |
f3e1097b | 2998 | return false; |
2d5b90b2 TB |
2999 | } |
3000 | ||
c49ea23d PT |
3001 | skip_size_check: |
3002 | ||
e9355cc3 JW |
3003 | /* Satisfy F03:12.4.1.3 by ensuring that a procedure pointer actual |
3004 | argument is provided for a procedure pointer formal argument. */ | |
8fb74da4 | 3005 | if (f->sym->attr.proc_pointer |
a7c0b11d | 3006 | && !((a->expr->expr_type == EXPR_VARIABLE |
4294c093 JW |
3007 | && (a->expr->symtree->n.sym->attr.proc_pointer |
3008 | || gfc_is_proc_ptr_comp (a->expr))) | |
a7c0b11d | 3009 | || (a->expr->expr_type == EXPR_FUNCTION |
4294c093 | 3010 | && is_procptr_result (a->expr)))) |
8fb74da4 JW |
3011 | { |
3012 | if (where) | |
c4100eae | 3013 | gfc_error ("Expected a procedure pointer for argument %qs at %L", |
8fb74da4 | 3014 | f->sym->name, &a->expr->where); |
f3e1097b | 3015 | return false; |
8fb74da4 JW |
3016 | } |
3017 | ||
e9355cc3 | 3018 | /* Satisfy F03:12.4.1.3 by ensuring that a procedure actual argument is |
699fa7aa | 3019 | provided for a procedure formal argument. */ |
e9355cc3 | 3020 | if (f->sym->attr.flavor == FL_PROCEDURE |
4294c093 JW |
3021 | && !((a->expr->expr_type == EXPR_VARIABLE |
3022 | && (a->expr->symtree->n.sym->attr.flavor == FL_PROCEDURE | |
3023 | || a->expr->symtree->n.sym->attr.proc_pointer | |
3024 | || gfc_is_proc_ptr_comp (a->expr))) | |
3025 | || (a->expr->expr_type == EXPR_FUNCTION | |
3026 | && is_procptr_result (a->expr)))) | |
699fa7aa | 3027 | { |
9914f8cf | 3028 | if (where) |
c4100eae | 3029 | gfc_error ("Expected a procedure for argument %qs at %L", |
9914f8cf | 3030 | f->sym->name, &a->expr->where); |
f3e1097b | 3031 | return false; |
699fa7aa PT |
3032 | } |
3033 | ||
b251af97 | 3034 | if (f->sym->as && f->sym->as->type == AS_ASSUMED_SHAPE |
bf9d2177 JJ |
3035 | && a->expr->expr_type == EXPR_VARIABLE |
3036 | && a->expr->symtree->n.sym->as | |
3037 | && a->expr->symtree->n.sym->as->type == AS_ASSUMED_SIZE | |
3038 | && (a->expr->ref == NULL | |
3039 | || (a->expr->ref->type == REF_ARRAY | |
3040 | && a->expr->ref->u.ar.type == AR_FULL))) | |
3041 | { | |
3042 | if (where) | |
c4100eae | 3043 | gfc_error ("Actual argument for %qs cannot be an assumed-size" |
bf9d2177 | 3044 | " array at %L", f->sym->name, where); |
f3e1097b | 3045 | return false; |
bf9d2177 JJ |
3046 | } |
3047 | ||
1600fe22 TS |
3048 | if (a->expr->expr_type != EXPR_NULL |
3049 | && compare_pointer (f->sym, a->expr) == 0) | |
6de9cd9a DN |
3050 | { |
3051 | if (where) | |
c4100eae | 3052 | gfc_error ("Actual argument for %qs must be a pointer at %L", |
6de9cd9a | 3053 | f->sym->name, &a->expr->where); |
f3e1097b | 3054 | return false; |
6de9cd9a DN |
3055 | } |
3056 | ||
7d54ef80 TB |
3057 | if (a->expr->expr_type != EXPR_NULL |
3058 | && (gfc_option.allow_std & GFC_STD_F2008) == 0 | |
3059 | && compare_pointer (f->sym, a->expr) == 2) | |
3060 | { | |
3061 | if (where) | |
3062 | gfc_error ("Fortran 2008: Non-pointer actual argument at %L to " | |
c4100eae | 3063 | "pointer dummy %qs", &a->expr->where,f->sym->name); |
f3e1097b | 3064 | return false; |
7d54ef80 | 3065 | } |
8b704316 | 3066 | |
7d54ef80 | 3067 | |
d3a9eea2 TB |
3068 | /* Fortran 2008, C1242. */ |
3069 | if (f->sym->attr.pointer && gfc_is_coindexed (a->expr)) | |
3070 | { | |
3071 | if (where) | |
3072 | gfc_error ("Coindexed actual argument at %L to pointer " | |
c4100eae | 3073 | "dummy %qs", |
d3a9eea2 | 3074 | &a->expr->where, f->sym->name); |
f3e1097b | 3075 | return false; |
d3a9eea2 TB |
3076 | } |
3077 | ||
3078 | /* Fortran 2008, 12.5.2.5 (no constraint). */ | |
3079 | if (a->expr->expr_type == EXPR_VARIABLE | |
3080 | && f->sym->attr.intent != INTENT_IN | |
3081 | && f->sym->attr.allocatable | |
3082 | && gfc_is_coindexed (a->expr)) | |
3083 | { | |
3084 | if (where) | |
3085 | gfc_error ("Coindexed actual argument at %L to allocatable " | |
c4100eae | 3086 | "dummy %qs requires INTENT(IN)", |
d3a9eea2 | 3087 | &a->expr->where, f->sym->name); |
f3e1097b | 3088 | return false; |
d3a9eea2 TB |
3089 | } |
3090 | ||
3091 | /* Fortran 2008, C1237. */ | |
3092 | if (a->expr->expr_type == EXPR_VARIABLE | |
3093 | && (f->sym->attr.asynchronous || f->sym->attr.volatile_) | |
3094 | && gfc_is_coindexed (a->expr) | |
3095 | && (a->expr->symtree->n.sym->attr.volatile_ | |
3096 | || a->expr->symtree->n.sym->attr.asynchronous)) | |
3097 | { | |
3098 | if (where) | |
3099 | gfc_error ("Coindexed ASYNCHRONOUS or VOLATILE actual argument at " | |
c4100eae | 3100 | "%L requires that dummy %qs has neither " |
d3a9eea2 TB |
3101 | "ASYNCHRONOUS nor VOLATILE", &a->expr->where, |
3102 | f->sym->name); | |
f3e1097b | 3103 | return false; |
d3a9eea2 TB |
3104 | } |
3105 | ||
3106 | /* Fortran 2008, 12.5.2.4 (no constraint). */ | |
3107 | if (a->expr->expr_type == EXPR_VARIABLE | |
3108 | && f->sym->attr.intent != INTENT_IN && !f->sym->attr.value | |
3109 | && gfc_is_coindexed (a->expr) | |
3110 | && gfc_has_ultimate_allocatable (a->expr)) | |
3111 | { | |
3112 | if (where) | |
3113 | gfc_error ("Coindexed actual argument at %L with allocatable " | |
c4100eae | 3114 | "ultimate component to dummy %qs requires either VALUE " |
d3a9eea2 | 3115 | "or INTENT(IN)", &a->expr->where, f->sym->name); |
f3e1097b | 3116 | return false; |
d3a9eea2 TB |
3117 | } |
3118 | ||
c49ea23d PT |
3119 | if (f->sym->ts.type == BT_CLASS |
3120 | && CLASS_DATA (f->sym)->attr.allocatable | |
3121 | && gfc_is_class_array_ref (a->expr, &full_array) | |
3122 | && !full_array) | |
3123 | { | |
3124 | if (where) | |
c4100eae | 3125 | gfc_error ("Actual CLASS array argument for %qs must be a full " |
c49ea23d | 3126 | "array at %L", f->sym->name, &a->expr->where); |
f3e1097b | 3127 | return false; |
c49ea23d PT |
3128 | } |
3129 | ||
3130 | ||
aa08038d | 3131 | if (a->expr->expr_type != EXPR_NULL |
f3e1097b | 3132 | && !compare_allocatable (f->sym, a->expr)) |
aa08038d EE |
3133 | { |
3134 | if (where) | |
c4100eae | 3135 | gfc_error ("Actual argument for %qs must be ALLOCATABLE at %L", |
aa08038d | 3136 | f->sym->name, &a->expr->where); |
f3e1097b | 3137 | return false; |
aa08038d EE |
3138 | } |
3139 | ||
a920e94a | 3140 | /* Check intent = OUT/INOUT for definable actual argument. */ |
8c91ab34 DK |
3141 | if ((f->sym->attr.intent == INTENT_OUT |
3142 | || f->sym->attr.intent == INTENT_INOUT)) | |
a920e94a | 3143 | { |
8c91ab34 DK |
3144 | const char* context = (where |
3145 | ? _("actual argument to INTENT = OUT/INOUT") | |
3146 | : NULL); | |
a920e94a | 3147 | |
bcb4ad36 TB |
3148 | if (((f->sym->ts.type == BT_CLASS && f->sym->attr.class_ok |
3149 | && CLASS_DATA (f->sym)->attr.class_pointer) | |
3150 | || (f->sym->ts.type != BT_CLASS && f->sym->attr.pointer)) | |
524af0d6 | 3151 | && !gfc_check_vardef_context (a->expr, true, false, false, context)) |
f3e1097b | 3152 | return false; |
524af0d6 | 3153 | if (!gfc_check_vardef_context (a->expr, false, false, false, context)) |
f3e1097b | 3154 | return false; |
ee7e677f TB |
3155 | } |
3156 | ||
59be8071 TB |
3157 | if ((f->sym->attr.intent == INTENT_OUT |
3158 | || f->sym->attr.intent == INTENT_INOUT | |
84efddb2 DF |
3159 | || f->sym->attr.volatile_ |
3160 | || f->sym->attr.asynchronous) | |
03af1e4c | 3161 | && gfc_has_vector_subscript (a->expr)) |
59be8071 TB |
3162 | { |
3163 | if (where) | |
84efddb2 DF |
3164 | gfc_error ("Array-section actual argument with vector " |
3165 | "subscripts at %L is incompatible with INTENT(OUT), " | |
3166 | "INTENT(INOUT), VOLATILE or ASYNCHRONOUS attribute " | |
c4100eae | 3167 | "of the dummy argument %qs", |
59be8071 | 3168 | &a->expr->where, f->sym->name); |
f3e1097b | 3169 | return false; |
59be8071 TB |
3170 | } |
3171 | ||
9bce3c1c TB |
3172 | /* C1232 (R1221) For an actual argument which is an array section or |
3173 | an assumed-shape array, the dummy argument shall be an assumed- | |
3174 | shape array, if the dummy argument has the VOLATILE attribute. */ | |
3175 | ||
3176 | if (f->sym->attr.volatile_ | |
271dd55c | 3177 | && a->expr->expr_type == EXPR_VARIABLE |
9bce3c1c TB |
3178 | && a->expr->symtree->n.sym->as |
3179 | && a->expr->symtree->n.sym->as->type == AS_ASSUMED_SHAPE | |
3180 | && !(f->sym->as && f->sym->as->type == AS_ASSUMED_SHAPE)) | |
3181 | { | |
3182 | if (where) | |
3183 | gfc_error ("Assumed-shape actual argument at %L is " | |
3184 | "incompatible with the non-assumed-shape " | |
c4100eae | 3185 | "dummy argument %qs due to VOLATILE attribute", |
9bce3c1c | 3186 | &a->expr->where,f->sym->name); |
f3e1097b | 3187 | return false; |
9bce3c1c TB |
3188 | } |
3189 | ||
eb401400 AV |
3190 | /* Find the last array_ref. */ |
3191 | actual_arr_ref = NULL; | |
3192 | if (a->expr->ref) | |
3193 | actual_arr_ref = gfc_find_array_ref (a->expr, true); | |
3194 | ||
9bce3c1c | 3195 | if (f->sym->attr.volatile_ |
eb401400 | 3196 | && actual_arr_ref && actual_arr_ref->type == AR_SECTION |
9bce3c1c TB |
3197 | && !(f->sym->as && f->sym->as->type == AS_ASSUMED_SHAPE)) |
3198 | { | |
3199 | if (where) | |
3200 | gfc_error ("Array-section actual argument at %L is " | |
3201 | "incompatible with the non-assumed-shape " | |
c4100eae | 3202 | "dummy argument %qs due to VOLATILE attribute", |
eb401400 | 3203 | &a->expr->where, f->sym->name); |
f3e1097b | 3204 | return false; |
9bce3c1c TB |
3205 | } |
3206 | ||
3207 | /* C1233 (R1221) For an actual argument which is a pointer array, the | |
3208 | dummy argument shall be an assumed-shape or pointer array, if the | |
3209 | dummy argument has the VOLATILE attribute. */ | |
3210 | ||
3211 | if (f->sym->attr.volatile_ | |
271dd55c | 3212 | && a->expr->expr_type == EXPR_VARIABLE |
9bce3c1c TB |
3213 | && a->expr->symtree->n.sym->attr.pointer |
3214 | && a->expr->symtree->n.sym->as | |
3215 | && !(f->sym->as | |
3216 | && (f->sym->as->type == AS_ASSUMED_SHAPE | |
3217 | || f->sym->attr.pointer))) | |
3218 | { | |
3219 | if (where) | |
3220 | gfc_error ("Pointer-array actual argument at %L requires " | |
3221 | "an assumed-shape or pointer-array dummy " | |
c4100eae | 3222 | "argument %qs due to VOLATILE attribute", |
9bce3c1c | 3223 | &a->expr->where,f->sym->name); |
f3e1097b | 3224 | return false; |
9bce3c1c TB |
3225 | } |
3226 | ||
6de9cd9a DN |
3227 | match: |
3228 | if (a == actual) | |
3229 | na = i; | |
3230 | ||
7b901ac4 | 3231 | new_arg[i++] = a; |
6de9cd9a DN |
3232 | } |
3233 | ||
3234 | /* Make sure missing actual arguments are optional. */ | |
3235 | i = 0; | |
3236 | for (f = formal; f; f = f->next, i++) | |
3237 | { | |
7b901ac4 | 3238 | if (new_arg[i] != NULL) |
6de9cd9a | 3239 | continue; |
3ab7b3de BM |
3240 | if (f->sym == NULL) |
3241 | { | |
3242 | if (where) | |
b251af97 SK |
3243 | gfc_error ("Missing alternate return spec in subroutine call " |
3244 | "at %L", where); | |
f3e1097b | 3245 | return false; |
3ab7b3de | 3246 | } |
6de9cd9a DN |
3247 | if (!f->sym->attr.optional) |
3248 | { | |
3249 | if (where) | |
c4100eae | 3250 | gfc_error ("Missing actual argument for argument %qs at %L", |
6de9cd9a | 3251 | f->sym->name, where); |
f3e1097b | 3252 | return false; |
6de9cd9a DN |
3253 | } |
3254 | } | |
3255 | ||
3256 | /* The argument lists are compatible. We now relink a new actual | |
3257 | argument list with null arguments in the right places. The head | |
3258 | of the list remains the head. */ | |
3259 | for (i = 0; i < n; i++) | |
7b901ac4 KG |
3260 | if (new_arg[i] == NULL) |
3261 | new_arg[i] = gfc_get_actual_arglist (); | |
6de9cd9a DN |
3262 | |
3263 | if (na != 0) | |
3264 | { | |
fab27f52 MM |
3265 | std::swap (*new_arg[0], *actual); |
3266 | std::swap (new_arg[0], new_arg[na]); | |
6de9cd9a DN |
3267 | } |
3268 | ||
3269 | for (i = 0; i < n - 1; i++) | |
7b901ac4 | 3270 | new_arg[i]->next = new_arg[i + 1]; |
6de9cd9a | 3271 | |
7b901ac4 | 3272 | new_arg[i]->next = NULL; |
6de9cd9a DN |
3273 | |
3274 | if (*ap == NULL && n > 0) | |
7b901ac4 | 3275 | *ap = new_arg[0]; |
6de9cd9a | 3276 | |
1600fe22 | 3277 | /* Note the types of omitted optional arguments. */ |
b5ca4fd2 | 3278 | for (a = *ap, f = formal; a; a = a->next, f = f->next) |
1600fe22 TS |
3279 | if (a->expr == NULL && a->label == NULL) |
3280 | a->missing_arg_type = f->sym->ts.type; | |
3281 | ||
f3e1097b | 3282 | return true; |
6de9cd9a DN |
3283 | } |
3284 | ||
3285 | ||
3286 | typedef struct | |
3287 | { | |
3288 | gfc_formal_arglist *f; | |
3289 | gfc_actual_arglist *a; | |
3290 | } | |
3291 | argpair; | |
3292 | ||
3293 | /* qsort comparison function for argument pairs, with the following | |
3294 | order: | |
3295 | - p->a->expr == NULL | |
3296 | - p->a->expr->expr_type != EXPR_VARIABLE | |
f7b529fa | 3297 | - growing p->a->expr->symbol. */ |
6de9cd9a DN |
3298 | |
3299 | static int | |
3300 | pair_cmp (const void *p1, const void *p2) | |
3301 | { | |
3302 | const gfc_actual_arglist *a1, *a2; | |
3303 | ||
3304 | /* *p1 and *p2 are elements of the to-be-sorted array. */ | |
3305 | a1 = ((const argpair *) p1)->a; | |
3306 | a2 = ((const argpair *) p2)->a; | |
3307 | if (!a1->expr) | |
3308 | { | |
3309 | if (!a2->expr) | |
3310 | return 0; | |
3311 | return -1; | |
3312 | } | |
3313 | if (!a2->expr) | |
3314 | return 1; | |
3315 | if (a1->expr->expr_type != EXPR_VARIABLE) | |
3316 | { | |
3317 | if (a2->expr->expr_type != EXPR_VARIABLE) | |
3318 | return 0; | |
3319 | return -1; | |
3320 | } | |
3321 | if (a2->expr->expr_type != EXPR_VARIABLE) | |
3322 | return 1; | |
3323 | return a1->expr->symtree->n.sym < a2->expr->symtree->n.sym; | |
3324 | } | |
3325 | ||
3326 | ||
3327 | /* Given two expressions from some actual arguments, test whether they | |
3328 | refer to the same expression. The analysis is conservative. | |
524af0d6 | 3329 | Returning false will produce no warning. */ |
6de9cd9a | 3330 | |
524af0d6 | 3331 | static bool |
b251af97 | 3332 | compare_actual_expr (gfc_expr *e1, gfc_expr *e2) |
6de9cd9a DN |
3333 | { |
3334 | const gfc_ref *r1, *r2; | |
3335 | ||
3336 | if (!e1 || !e2 | |
3337 | || e1->expr_type != EXPR_VARIABLE | |
3338 | || e2->expr_type != EXPR_VARIABLE | |
3339 | || e1->symtree->n.sym != e2->symtree->n.sym) | |
524af0d6 | 3340 | return false; |
6de9cd9a DN |
3341 | |
3342 | /* TODO: improve comparison, see expr.c:show_ref(). */ | |
3343 | for (r1 = e1->ref, r2 = e2->ref; r1 && r2; r1 = r1->next, r2 = r2->next) | |
3344 | { | |
3345 | if (r1->type != r2->type) | |
524af0d6 | 3346 | return false; |
6de9cd9a DN |
3347 | switch (r1->type) |
3348 | { | |
3349 | case REF_ARRAY: | |
3350 | if (r1->u.ar.type != r2->u.ar.type) | |
524af0d6 | 3351 | return false; |
6de9cd9a DN |
3352 | /* TODO: At the moment, consider only full arrays; |
3353 | we could do better. */ | |
3354 | if (r1->u.ar.type != AR_FULL || r2->u.ar.type != AR_FULL) | |
524af0d6 | 3355 | return false; |
6de9cd9a DN |
3356 | break; |
3357 | ||
3358 | case REF_COMPONENT: | |
3359 | if (r1->u.c.component != r2->u.c.component) | |
524af0d6 | 3360 | return false; |
6de9cd9a DN |
3361 | break; |
3362 | ||
3363 | case REF_SUBSTRING: | |
524af0d6 | 3364 | return false; |
6de9cd9a DN |
3365 | |
3366 | default: | |
3367 | gfc_internal_error ("compare_actual_expr(): Bad component code"); | |
3368 | } | |
3369 | } | |
3370 | if (!r1 && !r2) | |
524af0d6 JB |
3371 | return true; |
3372 | return false; | |
6de9cd9a DN |
3373 | } |
3374 | ||
b251af97 | 3375 | |
6de9cd9a DN |
3376 | /* Given formal and actual argument lists that correspond to one |
3377 | another, check that identical actual arguments aren't not | |
3378 | associated with some incompatible INTENTs. */ | |
3379 | ||
524af0d6 | 3380 | static bool |
b251af97 | 3381 | check_some_aliasing (gfc_formal_arglist *f, gfc_actual_arglist *a) |
6de9cd9a DN |
3382 | { |
3383 | sym_intent f1_intent, f2_intent; | |
3384 | gfc_formal_arglist *f1; | |
3385 | gfc_actual_arglist *a1; | |
3386 | size_t n, i, j; | |
3387 | argpair *p; | |
524af0d6 | 3388 | bool t = true; |
6de9cd9a DN |
3389 | |
3390 | n = 0; | |
3391 | for (f1 = f, a1 = a;; f1 = f1->next, a1 = a1->next) | |
3392 | { | |
3393 | if (f1 == NULL && a1 == NULL) | |
3394 | break; | |
3395 | if (f1 == NULL || a1 == NULL) | |
3396 | gfc_internal_error ("check_some_aliasing(): List mismatch"); | |
3397 | n++; | |
3398 | } | |
3399 | if (n == 0) | |
3400 | return t; | |
1145e690 | 3401 | p = XALLOCAVEC (argpair, n); |
6de9cd9a DN |
3402 | |
3403 | for (i = 0, f1 = f, a1 = a; i < n; i++, f1 = f1->next, a1 = a1->next) | |
3404 | { | |
3405 | p[i].f = f1; | |
3406 | p[i].a = a1; | |
3407 | } | |
3408 | ||
3409 | qsort (p, n, sizeof (argpair), pair_cmp); | |
3410 | ||
3411 | for (i = 0; i < n; i++) | |
3412 | { | |
3413 | if (!p[i].a->expr | |
3414 | || p[i].a->expr->expr_type != EXPR_VARIABLE | |
3415 | || p[i].a->expr->ts.type == BT_PROCEDURE) | |
3416 | continue; | |
3417 | f1_intent = p[i].f->sym->attr.intent; | |
3418 | for (j = i + 1; j < n; j++) | |
3419 | { | |
3420 | /* Expected order after the sort. */ | |
3421 | if (!p[j].a->expr || p[j].a->expr->expr_type != EXPR_VARIABLE) | |
3422 | gfc_internal_error ("check_some_aliasing(): corrupted data"); | |
3423 | ||
3424 | /* Are the expression the same? */ | |
524af0d6 | 3425 | if (!compare_actual_expr (p[i].a->expr, p[j].a->expr)) |
6de9cd9a DN |
3426 | break; |
3427 | f2_intent = p[j].f->sym->attr.intent; | |
3428 | if ((f1_intent == INTENT_IN && f2_intent == INTENT_OUT) | |
9f1930be TB |
3429 | || (f1_intent == INTENT_OUT && f2_intent == INTENT_IN) |
3430 | || (f1_intent == INTENT_OUT && f2_intent == INTENT_OUT)) | |
6de9cd9a | 3431 | { |
db30e21c | 3432 | gfc_warning (0, "Same actual argument associated with INTENT(%s) " |
48749dbc | 3433 | "argument %qs and INTENT(%s) argument %qs at %L", |
6de9cd9a DN |
3434 | gfc_intent_string (f1_intent), p[i].f->sym->name, |
3435 | gfc_intent_string (f2_intent), p[j].f->sym->name, | |
3436 | &p[i].a->expr->where); | |
524af0d6 | 3437 | t = false; |
6de9cd9a DN |
3438 | } |
3439 | } | |
3440 | } | |
3441 | ||
3442 | return t; | |
3443 | } | |
3444 | ||
3445 | ||
3446 | /* Given formal and actual argument lists that correspond to one | |
3447 | another, check that they are compatible in the sense that intents | |
3448 | are not mismatched. */ | |
3449 | ||
524af0d6 | 3450 | static bool |
b251af97 | 3451 | check_intents (gfc_formal_arglist *f, gfc_actual_arglist *a) |
6de9cd9a | 3452 | { |
f17facac | 3453 | sym_intent f_intent; |
6de9cd9a DN |
3454 | |
3455 | for (;; f = f->next, a = a->next) | |
3456 | { | |
99c39534 TB |
3457 | gfc_expr *expr; |
3458 | ||
6de9cd9a DN |
3459 | if (f == NULL && a == NULL) |
3460 | break; | |
3461 | if (f == NULL || a == NULL) | |
3462 | gfc_internal_error ("check_intents(): List mismatch"); | |
3463 | ||
99c39534 TB |
3464 | if (a->expr && a->expr->expr_type == EXPR_FUNCTION |
3465 | && a->expr->value.function.isym | |
3466 | && a->expr->value.function.isym->id == GFC_ISYM_CAF_GET) | |
3467 | expr = a->expr->value.function.actual->expr; | |
3468 | else | |
3469 | expr = a->expr; | |
3470 | ||
3471 | if (expr == NULL || expr->expr_type != EXPR_VARIABLE) | |
6de9cd9a DN |
3472 | continue; |
3473 | ||
6de9cd9a DN |
3474 | f_intent = f->sym->attr.intent; |
3475 | ||
99c39534 | 3476 | if (gfc_pure (NULL) && gfc_impure_variable (expr->symtree->n.sym)) |
6de9cd9a | 3477 | { |
bcb4ad36 TB |
3478 | if ((f->sym->ts.type == BT_CLASS && f->sym->attr.class_ok |
3479 | && CLASS_DATA (f->sym)->attr.class_pointer) | |
3480 | || (f->sym->ts.type != BT_CLASS && f->sym->attr.pointer)) | |
6de9cd9a | 3481 | { |
b251af97 SK |
3482 | gfc_error ("Procedure argument at %L is local to a PURE " |
3483 | "procedure and has the POINTER attribute", | |
99c39534 | 3484 | &expr->where); |
524af0d6 | 3485 | return false; |
6de9cd9a DN |
3486 | } |
3487 | } | |
d3a9eea2 TB |
3488 | |
3489 | /* Fortran 2008, C1283. */ | |
99c39534 | 3490 | if (gfc_pure (NULL) && gfc_is_coindexed (expr)) |
d3a9eea2 TB |
3491 | { |
3492 | if (f_intent == INTENT_INOUT || f_intent == INTENT_OUT) | |
3493 | { | |
3494 | gfc_error ("Coindexed actual argument at %L in PURE procedure " | |
3495 | "is passed to an INTENT(%s) argument", | |
99c39534 | 3496 | &expr->where, gfc_intent_string (f_intent)); |
524af0d6 | 3497 | return false; |
d3a9eea2 TB |
3498 | } |
3499 | ||
bcb4ad36 TB |
3500 | if ((f->sym->ts.type == BT_CLASS && f->sym->attr.class_ok |
3501 | && CLASS_DATA (f->sym)->attr.class_pointer) | |
3502 | || (f->sym->ts.type != BT_CLASS && f->sym->attr.pointer)) | |
d3a9eea2 TB |
3503 | { |
3504 | gfc_error ("Coindexed actual argument at %L in PURE procedure " | |
3505 | "is passed to a POINTER dummy argument", | |
99c39534 | 3506 | &expr->where); |
524af0d6 | 3507 | return false; |
d3a9eea2 TB |
3508 | } |
3509 | } | |
3510 | ||
3511 | /* F2008, Section 12.5.2.4. */ | |
99c39534 TB |
3512 | if (expr->ts.type == BT_CLASS && f->sym->ts.type == BT_CLASS |
3513 | && gfc_is_coindexed (expr)) | |
d3a9eea2 TB |
3514 | { |
3515 | gfc_error ("Coindexed polymorphic actual argument at %L is passed " | |
c4100eae | 3516 | "polymorphic dummy argument %qs", |
99c39534 | 3517 | &expr->where, f->sym->name); |
524af0d6 | 3518 | return false; |
d3a9eea2 | 3519 | } |
6de9cd9a DN |
3520 | } |
3521 | ||
524af0d6 | 3522 | return true; |
6de9cd9a DN |
3523 | } |
3524 | ||
3525 | ||
3526 | /* Check how a procedure is used against its interface. If all goes | |
3527 | well, the actual argument list will also end up being properly | |
3528 | sorted. */ | |
3529 | ||
524af0d6 | 3530 | bool |
b251af97 | 3531 | gfc_procedure_use (gfc_symbol *sym, gfc_actual_arglist **ap, locus *where) |
6de9cd9a | 3532 | { |
4cbc9039 JW |
3533 | gfc_formal_arglist *dummy_args; |
3534 | ||
a9c5fe7e | 3535 | /* Warn about calls with an implicit interface. Special case |
6bd2c800 | 3536 | for calling a ISO_C_BINDING because c_loc and c_funloc |
ca071303 FXC |
3537 | are pseudo-unknown. Additionally, warn about procedures not |
3538 | explicitly declared at all if requested. */ | |
8b7a967e | 3539 | if (sym->attr.if_source == IFSRC_UNKNOWN && !sym->attr.is_iso_c) |
ca071303 | 3540 | { |
8b7a967e TB |
3541 | if (sym->ns->has_implicit_none_export && sym->attr.proc == PROC_UNKNOWN) |
3542 | { | |
c4100eae | 3543 | gfc_error ("Procedure %qs called at %L is not explicitly declared", |
8b7a967e TB |
3544 | sym->name, where); |
3545 | return false; | |
3546 | } | |
73e42eef | 3547 | if (warn_implicit_interface) |
48749dbc MLI |
3548 | gfc_warning (OPT_Wimplicit_interface, |
3549 | "Procedure %qs called with an implicit interface at %L", | |
ca071303 | 3550 | sym->name, where); |
73e42eef | 3551 | else if (warn_implicit_procedure && sym->attr.proc == PROC_UNKNOWN) |
48749dbc MLI |
3552 | gfc_warning (OPT_Wimplicit_procedure, |
3553 | "Procedure %qs called at %L is not explicitly declared", | |
ca071303 FXC |
3554 | sym->name, where); |
3555 | } | |
6de9cd9a | 3556 | |
e6895430 | 3557 | if (sym->attr.if_source == IFSRC_UNKNOWN) |
ac05557c DF |
3558 | { |
3559 | gfc_actual_arglist *a; | |
86d7449c TB |
3560 | |
3561 | if (sym->attr.pointer) | |
3562 | { | |
c4100eae MLI |
3563 | gfc_error ("The pointer object %qs at %L must have an explicit " |
3564 | "function interface or be declared as array", | |
3565 | sym->name, where); | |
524af0d6 | 3566 | return false; |
86d7449c TB |
3567 | } |
3568 | ||
3569 | if (sym->attr.allocatable && !sym->attr.external) | |
3570 | { | |
c4100eae MLI |
3571 | gfc_error ("The allocatable object %qs at %L must have an explicit " |
3572 | "function interface or be declared as array", | |
3573 | sym->name, where); | |
524af0d6 | 3574 | return false; |
86d7449c TB |
3575 | } |
3576 | ||
3577 | if (sym->attr.allocatable) | |
3578 | { | |
c4100eae MLI |
3579 | gfc_error ("Allocatable function %qs at %L must have an explicit " |
3580 | "function interface", sym->name, where); | |
524af0d6 | 3581 | return false; |
86d7449c TB |
3582 | } |
3583 | ||
ac05557c DF |
3584 | for (a = *ap; a; a = a->next) |
3585 | { | |
3586 | /* Skip g77 keyword extensions like %VAL, %REF, %LOC. */ | |
3587 | if (a->name != NULL && a->name[0] != '%') | |
3588 | { | |
c4100eae MLI |
3589 | gfc_error ("Keyword argument requires explicit interface " |
3590 | "for procedure %qs at %L", sym->name, &a->expr->where); | |
ac05557c DF |
3591 | break; |
3592 | } | |
fea54935 | 3593 | |
45a69325 TB |
3594 | /* TS 29113, 6.2. */ |
3595 | if (a->expr && a->expr->ts.type == BT_ASSUMED | |
3596 | && sym->intmod_sym_id != ISOCBINDING_LOC) | |
3597 | { | |
3598 | gfc_error ("Assumed-type argument %s at %L requires an explicit " | |
3599 | "interface", a->expr->symtree->n.sym->name, | |
3600 | &a->expr->where); | |
3601 | break; | |
3602 | } | |
3603 | ||
fea54935 TB |
3604 | /* F2008, C1303 and C1304. */ |
3605 | if (a->expr | |
3606 | && (a->expr->ts.type == BT_DERIVED || a->expr->ts.type == BT_CLASS) | |
3607 | && ((a->expr->ts.u.derived->from_intmod == INTMOD_ISO_FORTRAN_ENV | |
3608 | && a->expr->ts.u.derived->intmod_sym_id == ISOFORTRAN_LOCK_TYPE) | |
3609 | || gfc_expr_attr (a->expr).lock_comp)) | |
3610 | { | |
c4100eae MLI |
3611 | gfc_error ("Actual argument of LOCK_TYPE or with LOCK_TYPE " |
3612 | "component at %L requires an explicit interface for " | |
3613 | "procedure %qs", &a->expr->where, sym->name); | |
fea54935 TB |
3614 | break; |
3615 | } | |
ea8ad3e5 | 3616 | |
5df445a2 TB |
3617 | if (a->expr |
3618 | && (a->expr->ts.type == BT_DERIVED || a->expr->ts.type == BT_CLASS) | |
3619 | && ((a->expr->ts.u.derived->from_intmod == INTMOD_ISO_FORTRAN_ENV | |
3620 | && a->expr->ts.u.derived->intmod_sym_id | |
3621 | == ISOFORTRAN_EVENT_TYPE) | |
3622 | || gfc_expr_attr (a->expr).event_comp)) | |
3623 | { | |
3624 | gfc_error ("Actual argument of EVENT_TYPE or with EVENT_TYPE " | |
3625 | "component at %L requires an explicit interface for " | |
3626 | "procedure %qs", &a->expr->where, sym->name); | |
3627 | break; | |
3628 | } | |
3629 | ||
ea8ad3e5 TB |
3630 | if (a->expr && a->expr->expr_type == EXPR_NULL |
3631 | && a->expr->ts.type == BT_UNKNOWN) | |
3632 | { | |
3633 | gfc_error ("MOLD argument to NULL required at %L", &a->expr->where); | |
524af0d6 | 3634 | return false; |
ea8ad3e5 | 3635 | } |
c62c6622 TB |
3636 | |
3637 | /* TS 29113, C407b. */ | |
3638 | if (a->expr && a->expr->expr_type == EXPR_VARIABLE | |
3639 | && symbol_rank (a->expr->symtree->n.sym) == -1) | |
3640 | { | |
3641 | gfc_error ("Assumed-rank argument requires an explicit interface " | |
3642 | "at %L", &a->expr->where); | |
524af0d6 | 3643 | return false; |
c62c6622 | 3644 | } |
ac05557c DF |
3645 | } |
3646 | ||
524af0d6 | 3647 | return true; |
ac05557c DF |
3648 | } |
3649 | ||
4cbc9039 JW |
3650 | dummy_args = gfc_sym_get_dummy_args (sym); |
3651 | ||
3652 | if (!compare_actual_formal (ap, dummy_args, 0, sym->attr.elemental, where)) | |
524af0d6 | 3653 | return false; |
f8552cd4 | 3654 | |
524af0d6 JB |
3655 | if (!check_intents (dummy_args, *ap)) |
3656 | return false; | |
6de9cd9a | 3657 | |
73e42eef | 3658 | if (warn_aliasing) |
4cbc9039 | 3659 | check_some_aliasing (dummy_args, *ap); |
f8552cd4 | 3660 | |
524af0d6 | 3661 | return true; |
6de9cd9a DN |
3662 | } |
3663 | ||
3664 | ||
7e196f89 JW |
3665 | /* Check how a procedure pointer component is used against its interface. |
3666 | If all goes well, the actual argument list will also end up being properly | |
3667 | sorted. Completely analogous to gfc_procedure_use. */ | |
3668 | ||
3669 | void | |
3670 | gfc_ppc_use (gfc_component *comp, gfc_actual_arglist **ap, locus *where) | |
3671 | { | |
7e196f89 | 3672 | /* Warn about calls with an implicit interface. Special case |
6bd2c800 | 3673 | for calling a ISO_C_BINDING because c_loc and c_funloc |
7e196f89 | 3674 | are pseudo-unknown. */ |
73e42eef | 3675 | if (warn_implicit_interface |
7e196f89 JW |
3676 | && comp->attr.if_source == IFSRC_UNKNOWN |
3677 | && !comp->attr.is_iso_c) | |
48749dbc MLI |
3678 | gfc_warning (OPT_Wimplicit_interface, |
3679 | "Procedure pointer component %qs called with an implicit " | |
7e196f89 JW |
3680 | "interface at %L", comp->name, where); |
3681 | ||
3682 | if (comp->attr.if_source == IFSRC_UNKNOWN) | |
3683 | { | |
3684 | gfc_actual_arglist *a; | |
3685 | for (a = *ap; a; a = a->next) | |
3686 | { | |
3687 | /* Skip g77 keyword extensions like %VAL, %REF, %LOC. */ | |
3688 | if (a->name != NULL && a->name[0] != '%') | |
3689 | { | |
c4100eae MLI |
3690 | gfc_error ("Keyword argument requires explicit interface " |
3691 | "for procedure pointer component %qs at %L", | |
3692 | comp->name, &a->expr->where); | |
7e196f89 JW |
3693 | break; |
3694 | } | |
3695 | } | |
3696 | ||
3697 | return; | |
3698 | } | |
3699 | ||
4cbc9039 JW |
3700 | if (!compare_actual_formal (ap, comp->ts.interface->formal, 0, |
3701 | comp->attr.elemental, where)) | |
7e196f89 JW |
3702 | return; |
3703 | ||
4cbc9039 | 3704 | check_intents (comp->ts.interface->formal, *ap); |
73e42eef | 3705 | if (warn_aliasing) |
4cbc9039 | 3706 | check_some_aliasing (comp->ts.interface->formal, *ap); |
7e196f89 JW |
3707 | } |
3708 | ||
3709 | ||
f0ac18b7 DK |
3710 | /* Try if an actual argument list matches the formal list of a symbol, |
3711 | respecting the symbol's attributes like ELEMENTAL. This is used for | |
3712 | GENERIC resolution. */ | |
3713 | ||
3714 | bool | |
3715 | gfc_arglist_matches_symbol (gfc_actual_arglist** args, gfc_symbol* sym) | |
3716 | { | |
4cbc9039 | 3717 | gfc_formal_arglist *dummy_args; |
f0ac18b7 DK |
3718 | bool r; |
3719 | ||
1d101216 JD |
3720 | if (sym->attr.flavor != FL_PROCEDURE) |
3721 | return false; | |
f0ac18b7 | 3722 | |
4cbc9039 JW |
3723 | dummy_args = gfc_sym_get_dummy_args (sym); |
3724 | ||
f0ac18b7 | 3725 | r = !sym->attr.elemental; |
4cbc9039 | 3726 | if (compare_actual_formal (args, dummy_args, r, !r, NULL)) |
f0ac18b7 | 3727 | { |
4cbc9039 | 3728 | check_intents (dummy_args, *args); |
73e42eef | 3729 | if (warn_aliasing) |
4cbc9039 | 3730 | check_some_aliasing (dummy_args, *args); |
f0ac18b7 DK |
3731 | return true; |
3732 | } | |
3733 | ||
3734 | return false; | |
3735 | } | |
3736 | ||
3737 | ||
6de9cd9a DN |
3738 | /* Given an interface pointer and an actual argument list, search for |
3739 | a formal argument list that matches the actual. If found, returns | |
3740 | a pointer to the symbol of the correct interface. Returns NULL if | |
3741 | not found. */ | |
3742 | ||
3743 | gfc_symbol * | |
b251af97 SK |
3744 | gfc_search_interface (gfc_interface *intr, int sub_flag, |
3745 | gfc_actual_arglist **ap) | |
6de9cd9a | 3746 | { |
22a0a780 | 3747 | gfc_symbol *elem_sym = NULL; |
ea8ad3e5 TB |
3748 | gfc_symbol *null_sym = NULL; |
3749 | locus null_expr_loc; | |
3750 | gfc_actual_arglist *a; | |
3751 | bool has_null_arg = false; | |
3752 | ||
3753 | for (a = *ap; a; a = a->next) | |
3754 | if (a->expr && a->expr->expr_type == EXPR_NULL | |
3755 | && a->expr->ts.type == BT_UNKNOWN) | |
3756 | { | |
3757 | has_null_arg = true; | |
3758 | null_expr_loc = a->expr->where; | |
3759 | break; | |
8b704316 | 3760 | } |
ea8ad3e5 | 3761 | |
6de9cd9a DN |
3762 | for (; intr; intr = intr->next) |
3763 | { | |
f6288c24 | 3764 | if (gfc_fl_struct (intr->sym->attr.flavor)) |
c3f34952 | 3765 | continue; |
6de9cd9a DN |
3766 | if (sub_flag && intr->sym->attr.function) |
3767 | continue; | |
3768 | if (!sub_flag && intr->sym->attr.subroutine) | |
3769 | continue; | |
3770 | ||
f0ac18b7 | 3771 | if (gfc_arglist_matches_symbol (ap, intr->sym)) |
22a0a780 | 3772 | { |
ea8ad3e5 TB |
3773 | if (has_null_arg && null_sym) |
3774 | { | |
3775 | gfc_error ("MOLD= required in NULL() argument at %L: Ambiguity " | |
3776 | "between specific functions %s and %s", | |
3777 | &null_expr_loc, null_sym->name, intr->sym->name); | |
3778 | return NULL; | |
3779 | } | |
3780 | else if (has_null_arg) | |
3781 | { | |
3782 | null_sym = intr->sym; | |
3783 | continue; | |
3784 | } | |
3785 | ||
22a0a780 | 3786 | /* Satisfy 12.4.4.1 such that an elemental match has lower |
8b704316 | 3787 | weight than a non-elemental match. */ |
22a0a780 PT |
3788 | if (intr->sym->attr.elemental) |
3789 | { | |
3790 | elem_sym = intr->sym; | |
3791 | continue; | |
3792 | } | |
3793 | return intr->sym; | |
3794 | } | |
6de9cd9a DN |
3795 | } |
3796 | ||
ea8ad3e5 TB |
3797 | if (null_sym) |
3798 | return null_sym; | |
3799 | ||
22a0a780 | 3800 | return elem_sym ? elem_sym : NULL; |
6de9cd9a DN |
3801 | } |
3802 | ||
3803 | ||
3804 | /* Do a brute force recursive search for a symbol. */ | |
3805 | ||
3806 | static gfc_symtree * | |
b251af97 | 3807 | find_symtree0 (gfc_symtree *root, gfc_symbol *sym) |
6de9cd9a DN |
3808 | { |
3809 | gfc_symtree * st; | |
3810 | ||
3811 | if (root->n.sym == sym) | |
3812 | return root; | |
3813 | ||
3814 | st = NULL; | |
3815 | if (root->left) | |
3816 | st = find_symtree0 (root->left, sym); | |
3817 | if (root->right && ! st) | |
3818 | st = find_symtree0 (root->right, sym); | |
3819 | return st; | |
3820 | } | |
3821 | ||
3822 | ||
3823 | /* Find a symtree for a symbol. */ | |
3824 | ||
f6fad28e DK |
3825 | gfc_symtree * |
3826 | gfc_find_sym_in_symtree (gfc_symbol *sym) | |
6de9cd9a DN |
3827 | { |
3828 | gfc_symtree *st; | |
3829 | gfc_namespace *ns; | |
3830 | ||
3831 | /* First try to find it by name. */ | |
3832 | gfc_find_sym_tree (sym->name, gfc_current_ns, 1, &st); | |
3833 | if (st && st->n.sym == sym) | |
3834 | return st; | |
3835 | ||
66e4ab31 | 3836 | /* If it's been renamed, resort to a brute-force search. */ |
6de9cd9a DN |
3837 | /* TODO: avoid having to do this search. If the symbol doesn't exist |
3838 | in the symtree for the current namespace, it should probably be added. */ | |
3839 | for (ns = gfc_current_ns; ns; ns = ns->parent) | |
3840 | { | |
3841 | st = find_symtree0 (ns->sym_root, sym); | |
3842 | if (st) | |
b251af97 | 3843 | return st; |
6de9cd9a | 3844 | } |
17d5d49f | 3845 | gfc_internal_error ("Unable to find symbol %qs", sym->name); |
66e4ab31 | 3846 | /* Not reached. */ |
6de9cd9a DN |
3847 | } |
3848 | ||
3849 | ||
4a44a72d DK |
3850 | /* See if the arglist to an operator-call contains a derived-type argument |
3851 | with a matching type-bound operator. If so, return the matching specific | |
3852 | procedure defined as operator-target as well as the base-object to use | |
974df0f8 PT |
3853 | (which is the found derived-type argument with operator). The generic |
3854 | name, if any, is transmitted to the final expression via 'gname'. */ | |
4a44a72d DK |
3855 | |
3856 | static gfc_typebound_proc* | |
3857 | matching_typebound_op (gfc_expr** tb_base, | |
3858 | gfc_actual_arglist* args, | |
974df0f8 PT |
3859 | gfc_intrinsic_op op, const char* uop, |
3860 | const char ** gname) | |
4a44a72d DK |
3861 | { |
3862 | gfc_actual_arglist* base; | |
3863 | ||
3864 | for (base = args; base; base = base->next) | |
4b7dd692 | 3865 | if (base->expr->ts.type == BT_DERIVED || base->expr->ts.type == BT_CLASS) |
4a44a72d DK |
3866 | { |
3867 | gfc_typebound_proc* tb; | |
3868 | gfc_symbol* derived; | |
524af0d6 | 3869 | bool result; |
4a44a72d | 3870 | |
efd2e969 PT |
3871 | while (base->expr->expr_type == EXPR_OP |
3872 | && base->expr->value.op.op == INTRINSIC_PARENTHESES) | |
3873 | base->expr = base->expr->value.op.op1; | |
3874 | ||
4b7dd692 | 3875 | if (base->expr->ts.type == BT_CLASS) |
528622fd | 3876 | { |
fba5a793 | 3877 | if (!base->expr->ts.u.derived || CLASS_DATA (base->expr) == NULL |
0a59e583 | 3878 | || !gfc_expr_attr (base->expr).class_ok) |
528622fd JW |
3879 | continue; |
3880 | derived = CLASS_DATA (base->expr)->ts.u.derived; | |
3881 | } | |
4b7dd692 JW |
3882 | else |
3883 | derived = base->expr->ts.u.derived; | |
4a44a72d DK |
3884 | |
3885 | if (op == INTRINSIC_USER) | |
3886 | { | |
3887 | gfc_symtree* tb_uop; | |
3888 | ||
3889 | gcc_assert (uop); | |
3890 | tb_uop = gfc_find_typebound_user_op (derived, &result, uop, | |
3891 | false, NULL); | |
3892 | ||
3893 | if (tb_uop) | |
3894 | tb = tb_uop->n.tb; | |
3895 | else | |
3896 | tb = NULL; | |
3897 | } | |
3898 | else | |
3899 | tb = gfc_find_typebound_intrinsic_op (derived, &result, op, | |
3900 | false, NULL); | |
3901 | ||
3902 | /* This means we hit a PRIVATE operator which is use-associated and | |
3903 | should thus not be seen. */ | |
524af0d6 | 3904 | if (!result) |
4a44a72d DK |
3905 | tb = NULL; |
3906 | ||
3907 | /* Look through the super-type hierarchy for a matching specific | |
3908 | binding. */ | |
3909 | for (; tb; tb = tb->overridden) | |
3910 | { | |
3911 | gfc_tbp_generic* g; | |
3912 | ||
3913 | gcc_assert (tb->is_generic); | |
3914 | for (g = tb->u.generic; g; g = g->next) | |
3915 | { | |
3916 | gfc_symbol* target; | |
3917 | gfc_actual_arglist* argcopy; | |
3918 | bool matches; | |
3919 | ||
3920 | gcc_assert (g->specific); | |
3921 | if (g->specific->error) | |
3922 | continue; | |
3923 | ||
3924 | target = g->specific->u.specific->n.sym; | |
3925 | ||
3926 | /* Check if this arglist matches the formal. */ | |
3927 | argcopy = gfc_copy_actual_arglist (args); | |
3928 | matches = gfc_arglist_matches_symbol (&argcopy, target); | |
3929 | gfc_free_actual_arglist (argcopy); | |
3930 | ||
3931 | /* Return if we found a match. */ | |
3932 | if (matches) | |
3933 | { | |
3934 | *tb_base = base->expr; | |
974df0f8 | 3935 | *gname = g->specific_st->name; |
4a44a72d DK |
3936 | return g->specific; |
3937 | } | |
3938 | } | |
3939 | } | |
3940 | } | |
3941 | ||
3942 | return NULL; | |
3943 | } | |
3944 | ||
3945 | ||
3946 | /* For the 'actual arglist' of an operator call and a specific typebound | |
3947 | procedure that has been found the target of a type-bound operator, build the | |
3948 | appropriate EXPR_COMPCALL and resolve it. We take this indirection over | |
3949 | type-bound procedures rather than resolving type-bound operators 'directly' | |
3950 | so that we can reuse the existing logic. */ | |
3951 | ||
3952 | static void | |
3953 | build_compcall_for_operator (gfc_expr* e, gfc_actual_arglist* actual, | |
974df0f8 PT |
3954 | gfc_expr* base, gfc_typebound_proc* target, |
3955 | const char *gname) | |
4a44a72d DK |
3956 | { |
3957 | e->expr_type = EXPR_COMPCALL; | |
3958 | e->value.compcall.tbp = target; | |
974df0f8 | 3959 | e->value.compcall.name = gname ? gname : "$op"; |
4a44a72d DK |
3960 | e->value.compcall.actual = actual; |
3961 | e->value.compcall.base_object = base; | |
3962 | e->value.compcall.ignore_pass = 1; | |
3963 | e->value.compcall.assign = 0; | |
94fae14b PT |
3964 | if (e->ts.type == BT_UNKNOWN |
3965 | && target->function) | |
3966 | { | |
3967 | if (target->is_generic) | |
3968 | e->ts = target->u.generic->specific->u.specific->n.sym->ts; | |
3969 | else | |
3970 | e->ts = target->u.specific->n.sym->ts; | |
3971 | } | |
4a44a72d DK |
3972 | } |
3973 | ||
3974 | ||
6de9cd9a DN |
3975 | /* This subroutine is called when an expression is being resolved. |
3976 | The expression node in question is either a user defined operator | |
1f2959f0 | 3977 | or an intrinsic operator with arguments that aren't compatible |
6de9cd9a DN |
3978 | with the operator. This subroutine builds an actual argument list |
3979 | corresponding to the operands, then searches for a compatible | |
3980 | interface. If one is found, the expression node is replaced with | |
eaee02a5 JW |
3981 | the appropriate function call. We use the 'match' enum to specify |
3982 | whether a replacement has been made or not, or if an error occurred. */ | |
6de9cd9a | 3983 | |
eaee02a5 JW |
3984 | match |
3985 | gfc_extend_expr (gfc_expr *e) | |
6de9cd9a DN |
3986 | { |
3987 | gfc_actual_arglist *actual; | |
3988 | gfc_symbol *sym; | |
3989 | gfc_namespace *ns; | |
3990 | gfc_user_op *uop; | |
3991 | gfc_intrinsic_op i; | |
974df0f8 | 3992 | const char *gname; |
517d78be JW |
3993 | gfc_typebound_proc* tbo; |
3994 | gfc_expr* tb_base; | |
6de9cd9a DN |
3995 | |
3996 | sym = NULL; | |
3997 | ||
3998 | actual = gfc_get_actual_arglist (); | |
58b03ab2 | 3999 | actual->expr = e->value.op.op1; |
6de9cd9a | 4000 | |
974df0f8 | 4001 | gname = NULL; |
4a44a72d | 4002 | |
58b03ab2 | 4003 | if (e->value.op.op2 != NULL) |
6de9cd9a DN |
4004 | { |
4005 | actual->next = gfc_get_actual_arglist (); | |
58b03ab2 | 4006 | actual->next->expr = e->value.op.op2; |
6de9cd9a DN |
4007 | } |
4008 | ||
e8d4f3fc | 4009 | i = fold_unary_intrinsic (e->value.op.op); |
6de9cd9a | 4010 | |
517d78be JW |
4011 | /* See if we find a matching type-bound operator. */ |
4012 | if (i == INTRINSIC_USER) | |
4013 | tbo = matching_typebound_op (&tb_base, actual, | |
4014 | i, e->value.op.uop->name, &gname); | |
4015 | else | |
4016 | switch (i) | |
4017 | { | |
4018 | #define CHECK_OS_COMPARISON(comp) \ | |
4019 | case INTRINSIC_##comp: \ | |
4020 | case INTRINSIC_##comp##_OS: \ | |
4021 | tbo = matching_typebound_op (&tb_base, actual, \ | |
4022 | INTRINSIC_##comp, NULL, &gname); \ | |
4023 | if (!tbo) \ | |
4024 | tbo = matching_typebound_op (&tb_base, actual, \ | |
4025 | INTRINSIC_##comp##_OS, NULL, &gname); \ | |
4026 | break; | |
4027 | CHECK_OS_COMPARISON(EQ) | |
4028 | CHECK_OS_COMPARISON(NE) | |
4029 | CHECK_OS_COMPARISON(GT) | |
4030 | CHECK_OS_COMPARISON(GE) | |
4031 | CHECK_OS_COMPARISON(LT) | |
4032 | CHECK_OS_COMPARISON(LE) | |
4033 | #undef CHECK_OS_COMPARISON | |
4034 | ||
4035 | default: | |
4036 | tbo = matching_typebound_op (&tb_base, actual, i, NULL, &gname); | |
4037 | break; | |
4038 | } | |
4039 | ||
4040 | /* If there is a matching typebound-operator, replace the expression with | |
4041 | a call to it and succeed. */ | |
4042 | if (tbo) | |
4043 | { | |
4044 | gcc_assert (tb_base); | |
4045 | build_compcall_for_operator (e, actual, tb_base, tbo, gname); | |
4046 | ||
4047 | if (!gfc_resolve_expr (e)) | |
4048 | return MATCH_ERROR; | |
4049 | else | |
4050 | return MATCH_YES; | |
4051 | } | |
e73d3ca6 | 4052 | |
6de9cd9a DN |
4053 | if (i == INTRINSIC_USER) |
4054 | { | |
4055 | for (ns = gfc_current_ns; ns; ns = ns->parent) | |
4056 | { | |
58b03ab2 | 4057 | uop = gfc_find_uop (e->value.op.uop->name, ns); |
6de9cd9a DN |
4058 | if (uop == NULL) |
4059 | continue; | |
4060 | ||
a1ee985f | 4061 | sym = gfc_search_interface (uop->op, 0, &actual); |
6de9cd9a DN |
4062 | if (sym != NULL) |
4063 | break; | |
4064 | } | |
4065 | } | |
4066 | else | |
4067 | { | |
4068 | for (ns = gfc_current_ns; ns; ns = ns->parent) | |
4069 | { | |
3bed9dd0 DF |
4070 | /* Due to the distinction between '==' and '.eq.' and friends, one has |
4071 | to check if either is defined. */ | |
4072 | switch (i) | |
4073 | { | |
4a44a72d DK |
4074 | #define CHECK_OS_COMPARISON(comp) \ |
4075 | case INTRINSIC_##comp: \ | |
4076 | case INTRINSIC_##comp##_OS: \ | |
4077 | sym = gfc_search_interface (ns->op[INTRINSIC_##comp], 0, &actual); \ | |
4078 | if (!sym) \ | |
4079 | sym = gfc_search_interface (ns->op[INTRINSIC_##comp##_OS], 0, &actual); \ | |
4080 | break; | |
4081 | CHECK_OS_COMPARISON(EQ) | |
4082 | CHECK_OS_COMPARISON(NE) | |
4083 | CHECK_OS_COMPARISON(GT) | |
4084 | CHECK_OS_COMPARISON(GE) | |
4085 | CHECK_OS_COMPARISON(LT) | |
4086 | CHECK_OS_COMPARISON(LE) | |
4087 | #undef CHECK_OS_COMPARISON | |
3bed9dd0 DF |
4088 | |
4089 | default: | |
a1ee985f | 4090 | sym = gfc_search_interface (ns->op[i], 0, &actual); |
3bed9dd0 DF |
4091 | } |
4092 | ||
6de9cd9a DN |
4093 | if (sym != NULL) |
4094 | break; | |
4095 | } | |
4096 | } | |
4097 | ||
4a44a72d DK |
4098 | /* TODO: Do an ambiguity-check and error if multiple matching interfaces are |
4099 | found rather than just taking the first one and not checking further. */ | |
4100 | ||
6de9cd9a DN |
4101 | if (sym == NULL) |
4102 | { | |
66e4ab31 | 4103 | /* Don't use gfc_free_actual_arglist(). */ |
04695783 | 4104 | free (actual->next); |
cede9502 | 4105 | free (actual); |
eaee02a5 | 4106 | return MATCH_NO; |
6de9cd9a DN |
4107 | } |
4108 | ||
4109 | /* Change the expression node to a function call. */ | |
4110 | e->expr_type = EXPR_FUNCTION; | |
f6fad28e | 4111 | e->symtree = gfc_find_sym_in_symtree (sym); |
6de9cd9a | 4112 | e->value.function.actual = actual; |
58b03ab2 TS |
4113 | e->value.function.esym = NULL; |
4114 | e->value.function.isym = NULL; | |
cf013e9f | 4115 | e->value.function.name = NULL; |
a1ab6660 | 4116 | e->user_operator = 1; |
6de9cd9a | 4117 | |
524af0d6 | 4118 | if (!gfc_resolve_expr (e)) |
eaee02a5 | 4119 | return MATCH_ERROR; |
6de9cd9a | 4120 | |
eaee02a5 | 4121 | return MATCH_YES; |
6de9cd9a DN |
4122 | } |
4123 | ||
4124 | ||
4f7395ff JW |
4125 | /* Tries to replace an assignment code node with a subroutine call to the |
4126 | subroutine associated with the assignment operator. Return true if the node | |
4127 | was replaced. On false, no error is generated. */ | |
6de9cd9a | 4128 | |
524af0d6 | 4129 | bool |
b251af97 | 4130 | gfc_extend_assign (gfc_code *c, gfc_namespace *ns) |
6de9cd9a DN |
4131 | { |
4132 | gfc_actual_arglist *actual; | |
4f7395ff JW |
4133 | gfc_expr *lhs, *rhs, *tb_base; |
4134 | gfc_symbol *sym = NULL; | |
4135 | const char *gname = NULL; | |
4136 | gfc_typebound_proc* tbo; | |
6de9cd9a | 4137 | |
a513927a | 4138 | lhs = c->expr1; |
6de9cd9a DN |
4139 | rhs = c->expr2; |
4140 | ||
4141 | /* Don't allow an intrinsic assignment to be replaced. */ | |
4b7dd692 | 4142 | if (lhs->ts.type != BT_DERIVED && lhs->ts.type != BT_CLASS |
e19bb186 | 4143 | && (rhs->rank == 0 || rhs->rank == lhs->rank) |
6de9cd9a | 4144 | && (lhs->ts.type == rhs->ts.type |
b251af97 | 4145 | || (gfc_numeric_ts (&lhs->ts) && gfc_numeric_ts (&rhs->ts)))) |
524af0d6 | 4146 | return false; |
6de9cd9a DN |
4147 | |
4148 | actual = gfc_get_actual_arglist (); | |
4149 | actual->expr = lhs; | |
4150 | ||
4151 | actual->next = gfc_get_actual_arglist (); | |
4152 | actual->next->expr = rhs; | |
4153 | ||
4f7395ff JW |
4154 | /* TODO: Ambiguity-check, see above for gfc_extend_expr. */ |
4155 | ||
4156 | /* See if we find a matching type-bound assignment. */ | |
4157 | tbo = matching_typebound_op (&tb_base, actual, INTRINSIC_ASSIGN, | |
4158 | NULL, &gname); | |
4159 | ||
4160 | if (tbo) | |
4161 | { | |
4162 | /* Success: Replace the expression with a type-bound call. */ | |
4163 | gcc_assert (tb_base); | |
4164 | c->expr1 = gfc_get_expr (); | |
4165 | build_compcall_for_operator (c->expr1, actual, tb_base, tbo, gname); | |
4166 | c->expr1->value.compcall.assign = 1; | |
4167 | c->expr1->where = c->loc; | |
4168 | c->expr2 = NULL; | |
4169 | c->op = EXEC_COMPCALL; | |
4170 | return true; | |
4171 | } | |
6de9cd9a | 4172 | |
4f7395ff | 4173 | /* See if we find an 'ordinary' (non-typebound) assignment procedure. */ |
6de9cd9a DN |
4174 | for (; ns; ns = ns->parent) |
4175 | { | |
a1ee985f | 4176 | sym = gfc_search_interface (ns->op[INTRINSIC_ASSIGN], 1, &actual); |
6de9cd9a DN |
4177 | if (sym != NULL) |
4178 | break; | |
4179 | } | |
4180 | ||
4f7395ff | 4181 | if (sym) |
6de9cd9a | 4182 | { |
4f7395ff JW |
4183 | /* Success: Replace the assignment with the call. */ |
4184 | c->op = EXEC_ASSIGN_CALL; | |
4185 | c->symtree = gfc_find_sym_in_symtree (sym); | |
4186 | c->expr1 = NULL; | |
4187 | c->expr2 = NULL; | |
4188 | c->ext.actual = actual; | |
4189 | return true; | |
6de9cd9a DN |
4190 | } |
4191 | ||
4f7395ff JW |
4192 | /* Failure: No assignment procedure found. */ |
4193 | free (actual->next); | |
4194 | free (actual); | |
4195 | return false; | |
6de9cd9a DN |
4196 | } |
4197 | ||
4198 | ||
4199 | /* Make sure that the interface just parsed is not already present in | |
4200 | the given interface list. Ambiguity isn't checked yet since module | |
4201 | procedures can be present without interfaces. */ | |
4202 | ||
524af0d6 | 4203 | bool |
362aa474 | 4204 | gfc_check_new_interface (gfc_interface *base, gfc_symbol *new_sym, locus loc) |
6de9cd9a DN |
4205 | { |
4206 | gfc_interface *ip; | |
4207 | ||
4208 | for (ip = base; ip; ip = ip->next) | |
4209 | { | |
7b901ac4 | 4210 | if (ip->sym == new_sym) |
6de9cd9a | 4211 | { |
c4100eae | 4212 | gfc_error ("Entity %qs at %L is already present in the interface", |
362aa474 | 4213 | new_sym->name, &loc); |
524af0d6 | 4214 | return false; |
6de9cd9a DN |
4215 | } |
4216 | } | |
4217 | ||
524af0d6 | 4218 | return true; |
6de9cd9a DN |
4219 | } |
4220 | ||
4221 | ||
4222 | /* Add a symbol to the current interface. */ | |
4223 | ||
524af0d6 | 4224 | bool |
7b901ac4 | 4225 | gfc_add_interface (gfc_symbol *new_sym) |
6de9cd9a DN |
4226 | { |
4227 | gfc_interface **head, *intr; | |
4228 | gfc_namespace *ns; | |
4229 | gfc_symbol *sym; | |
4230 | ||
4231 | switch (current_interface.type) | |
4232 | { | |
4233 | case INTERFACE_NAMELESS: | |
9e1d712c | 4234 | case INTERFACE_ABSTRACT: |
524af0d6 | 4235 | return true; |
6de9cd9a DN |
4236 | |
4237 | case INTERFACE_INTRINSIC_OP: | |
4238 | for (ns = current_interface.ns; ns; ns = ns->parent) | |
3bed9dd0 DF |
4239 | switch (current_interface.op) |
4240 | { | |
4241 | case INTRINSIC_EQ: | |
4242 | case INTRINSIC_EQ_OS: | |
e73d3ca6 | 4243 | if (!gfc_check_new_interface (ns->op[INTRINSIC_EQ], new_sym, |
524af0d6 | 4244 | gfc_current_locus) |
e73d3ca6 | 4245 | || !gfc_check_new_interface (ns->op[INTRINSIC_EQ_OS], |
524af0d6 JB |
4246 | new_sym, gfc_current_locus)) |
4247 | return false; | |
3bed9dd0 DF |
4248 | break; |
4249 | ||
4250 | case INTRINSIC_NE: | |
4251 | case INTRINSIC_NE_OS: | |
e73d3ca6 | 4252 | if (!gfc_check_new_interface (ns->op[INTRINSIC_NE], new_sym, |
524af0d6 | 4253 | gfc_current_locus) |
e73d3ca6 | 4254 | || !gfc_check_new_interface (ns->op[INTRINSIC_NE_OS], |
524af0d6 JB |
4255 | new_sym, gfc_current_locus)) |
4256 | return false; | |
3bed9dd0 DF |
4257 | break; |
4258 | ||
4259 | case INTRINSIC_GT: | |
4260 | case INTRINSIC_GT_OS: | |
e73d3ca6 | 4261 | if (!gfc_check_new_interface (ns->op[INTRINSIC_GT], |
524af0d6 | 4262 | new_sym, gfc_current_locus) |
e73d3ca6 | 4263 | || !gfc_check_new_interface (ns->op[INTRINSIC_GT_OS], |
524af0d6 JB |
4264 | new_sym, gfc_current_locus)) |
4265 | return false; | |
3bed9dd0 DF |
4266 | break; |
4267 | ||
4268 | case INTRINSIC_GE: | |
4269 | case INTRINSIC_GE_OS: | |
e73d3ca6 | 4270 | if (!gfc_check_new_interface (ns->op[INTRINSIC_GE], |
524af0d6 | 4271 | new_sym, gfc_current_locus) |
e73d3ca6 | 4272 | || !gfc_check_new_interface (ns->op[INTRINSIC_GE_OS], |
524af0d6 JB |
4273 | new_sym, gfc_current_locus)) |
4274 | return false; | |
3bed9dd0 DF |
4275 | break; |
4276 | ||
4277 | case INTRINSIC_LT: | |
4278 | case INTRINSIC_LT_OS: | |
e73d3ca6 | 4279 | if (!gfc_check_new_interface (ns->op[INTRINSIC_LT], |
524af0d6 | 4280 | new_sym, gfc_current_locus) |
e73d3ca6 | 4281 | || !gfc_check_new_interface (ns->op[INTRINSIC_LT_OS], |
524af0d6 JB |
4282 | new_sym, gfc_current_locus)) |
4283 | return false; | |
3bed9dd0 DF |
4284 | break; |
4285 | ||
4286 | case INTRINSIC_LE: | |
4287 | case INTRINSIC_LE_OS: | |
e73d3ca6 | 4288 | if (!gfc_check_new_interface (ns->op[INTRINSIC_LE], |
524af0d6 | 4289 | new_sym, gfc_current_locus) |
e73d3ca6 | 4290 | || !gfc_check_new_interface (ns->op[INTRINSIC_LE_OS], |
524af0d6 JB |
4291 | new_sym, gfc_current_locus)) |
4292 | return false; | |
3bed9dd0 DF |
4293 | break; |
4294 | ||
4295 | default: | |
e73d3ca6 | 4296 | if (!gfc_check_new_interface (ns->op[current_interface.op], |
524af0d6 JB |
4297 | new_sym, gfc_current_locus)) |
4298 | return false; | |
3bed9dd0 | 4299 | } |
6de9cd9a | 4300 | |
a1ee985f | 4301 | head = ¤t_interface.ns->op[current_interface.op]; |
6de9cd9a DN |
4302 | break; |
4303 | ||
4304 | case INTERFACE_GENERIC: | |
e73d3ca6 | 4305 | case INTERFACE_DTIO: |
6de9cd9a DN |
4306 | for (ns = current_interface.ns; ns; ns = ns->parent) |
4307 | { | |
4308 | gfc_find_symbol (current_interface.sym->name, ns, 0, &sym); | |
4309 | if (sym == NULL) | |
4310 | continue; | |
4311 | ||
e73d3ca6 | 4312 | if (!gfc_check_new_interface (sym->generic, |
524af0d6 JB |
4313 | new_sym, gfc_current_locus)) |
4314 | return false; | |
6de9cd9a DN |
4315 | } |
4316 | ||
4317 | head = ¤t_interface.sym->generic; | |
4318 | break; | |
4319 | ||
4320 | case INTERFACE_USER_OP: | |
e73d3ca6 | 4321 | if (!gfc_check_new_interface (current_interface.uop->op, |
524af0d6 JB |
4322 | new_sym, gfc_current_locus)) |
4323 | return false; | |
6de9cd9a | 4324 | |
a1ee985f | 4325 | head = ¤t_interface.uop->op; |
6de9cd9a DN |
4326 | break; |
4327 | ||
4328 | default: | |
4329 | gfc_internal_error ("gfc_add_interface(): Bad interface type"); | |
4330 | } | |
4331 | ||
4332 | intr = gfc_get_interface (); | |
7b901ac4 | 4333 | intr->sym = new_sym; |
63645982 | 4334 | intr->where = gfc_current_locus; |
6de9cd9a DN |
4335 | |
4336 | intr->next = *head; | |
4337 | *head = intr; | |
4338 | ||
524af0d6 | 4339 | return true; |
6de9cd9a DN |
4340 | } |
4341 | ||
4342 | ||
2b77e908 FXC |
4343 | gfc_interface * |
4344 | gfc_current_interface_head (void) | |
4345 | { | |
4346 | switch (current_interface.type) | |
4347 | { | |
4348 | case INTERFACE_INTRINSIC_OP: | |
a1ee985f | 4349 | return current_interface.ns->op[current_interface.op]; |
2b77e908 FXC |
4350 | |
4351 | case INTERFACE_GENERIC: | |
e73d3ca6 | 4352 | case INTERFACE_DTIO: |
2b77e908 | 4353 | return current_interface.sym->generic; |
2b77e908 FXC |
4354 | |
4355 | case INTERFACE_USER_OP: | |
a1ee985f | 4356 | return current_interface.uop->op; |
2b77e908 FXC |
4357 | |
4358 | default: | |
4359 | gcc_unreachable (); | |
4360 | } | |
4361 | } | |
4362 | ||
4363 | ||
4364 | void | |
4365 | gfc_set_current_interface_head (gfc_interface *i) | |
4366 | { | |
4367 | switch (current_interface.type) | |
4368 | { | |
4369 | case INTERFACE_INTRINSIC_OP: | |
a1ee985f | 4370 | current_interface.ns->op[current_interface.op] = i; |
2b77e908 FXC |
4371 | break; |
4372 | ||
4373 | case INTERFACE_GENERIC: | |
e73d3ca6 | 4374 | case INTERFACE_DTIO: |
2b77e908 FXC |
4375 | current_interface.sym->generic = i; |
4376 | break; | |
4377 | ||
4378 | case INTERFACE_USER_OP: | |
a1ee985f | 4379 | current_interface.uop->op = i; |
2b77e908 FXC |
4380 | break; |
4381 | ||
4382 | default: | |
4383 | gcc_unreachable (); | |
4384 | } | |
4385 | } | |
4386 | ||
4387 | ||
6de9cd9a DN |
4388 | /* Gets rid of a formal argument list. We do not free symbols. |
4389 | Symbols are freed when a namespace is freed. */ | |
4390 | ||
4391 | void | |
b251af97 | 4392 | gfc_free_formal_arglist (gfc_formal_arglist *p) |
6de9cd9a DN |
4393 | { |
4394 | gfc_formal_arglist *q; | |
4395 | ||
4396 | for (; p; p = q) | |
4397 | { | |
4398 | q = p->next; | |
cede9502 | 4399 | free (p); |
6de9cd9a DN |
4400 | } |
4401 | } | |
99fc1b90 JW |
4402 | |
4403 | ||
9795c594 JW |
4404 | /* Check that it is ok for the type-bound procedure 'proc' to override the |
4405 | procedure 'old', cf. F08:4.5.7.3. */ | |
99fc1b90 | 4406 | |
524af0d6 | 4407 | bool |
99fc1b90 JW |
4408 | gfc_check_typebound_override (gfc_symtree* proc, gfc_symtree* old) |
4409 | { | |
4410 | locus where; | |
edc802c7 | 4411 | gfc_symbol *proc_target, *old_target; |
99fc1b90 | 4412 | unsigned proc_pass_arg, old_pass_arg, argpos; |
9795c594 JW |
4413 | gfc_formal_arglist *proc_formal, *old_formal; |
4414 | bool check_type; | |
4415 | char err[200]; | |
99fc1b90 JW |
4416 | |
4417 | /* This procedure should only be called for non-GENERIC proc. */ | |
4418 | gcc_assert (!proc->n.tb->is_generic); | |
4419 | ||
4420 | /* If the overwritten procedure is GENERIC, this is an error. */ | |
4421 | if (old->n.tb->is_generic) | |
4422 | { | |
c4100eae | 4423 | gfc_error ("Can't overwrite GENERIC %qs at %L", |
99fc1b90 | 4424 | old->name, &proc->n.tb->where); |
524af0d6 | 4425 | return false; |
99fc1b90 JW |
4426 | } |
4427 | ||
4428 | where = proc->n.tb->where; | |
4429 | proc_target = proc->n.tb->u.specific->n.sym; | |
4430 | old_target = old->n.tb->u.specific->n.sym; | |
4431 | ||
4432 | /* Check that overridden binding is not NON_OVERRIDABLE. */ | |
4433 | if (old->n.tb->non_overridable) | |
4434 | { | |
c4100eae | 4435 | gfc_error ("%qs at %L overrides a procedure binding declared" |
99fc1b90 | 4436 | " NON_OVERRIDABLE", proc->name, &where); |
524af0d6 | 4437 | return false; |
99fc1b90 JW |
4438 | } |
4439 | ||
4440 | /* It's an error to override a non-DEFERRED procedure with a DEFERRED one. */ | |
4441 | if (!old->n.tb->deferred && proc->n.tb->deferred) | |
4442 | { | |
c4100eae | 4443 | gfc_error ("%qs at %L must not be DEFERRED as it overrides a" |
99fc1b90 | 4444 | " non-DEFERRED binding", proc->name, &where); |
524af0d6 | 4445 | return false; |
99fc1b90 JW |
4446 | } |
4447 | ||
4448 | /* If the overridden binding is PURE, the overriding must be, too. */ | |
4449 | if (old_target->attr.pure && !proc_target->attr.pure) | |
4450 | { | |
c4100eae | 4451 | gfc_error ("%qs at %L overrides a PURE procedure and must also be PURE", |
99fc1b90 | 4452 | proc->name, &where); |
524af0d6 | 4453 | return false; |
99fc1b90 JW |
4454 | } |
4455 | ||
4456 | /* If the overridden binding is ELEMENTAL, the overriding must be, too. If it | |
4457 | is not, the overriding must not be either. */ | |
4458 | if (old_target->attr.elemental && !proc_target->attr.elemental) | |
4459 | { | |
c4100eae | 4460 | gfc_error ("%qs at %L overrides an ELEMENTAL procedure and must also be" |
99fc1b90 | 4461 | " ELEMENTAL", proc->name, &where); |
524af0d6 | 4462 | return false; |
99fc1b90 JW |
4463 | } |
4464 | if (!old_target->attr.elemental && proc_target->attr.elemental) | |
4465 | { | |
c4100eae | 4466 | gfc_error ("%qs at %L overrides a non-ELEMENTAL procedure and must not" |
99fc1b90 | 4467 | " be ELEMENTAL, either", proc->name, &where); |
524af0d6 | 4468 | return false; |
99fc1b90 JW |
4469 | } |
4470 | ||
4471 | /* If the overridden binding is a SUBROUTINE, the overriding must also be a | |
4472 | SUBROUTINE. */ | |
4473 | if (old_target->attr.subroutine && !proc_target->attr.subroutine) | |
4474 | { | |
c4100eae | 4475 | gfc_error ("%qs at %L overrides a SUBROUTINE and must also be a" |
99fc1b90 | 4476 | " SUBROUTINE", proc->name, &where); |
524af0d6 | 4477 | return false; |
99fc1b90 JW |
4478 | } |
4479 | ||
4480 | /* If the overridden binding is a FUNCTION, the overriding must also be a | |
4481 | FUNCTION and have the same characteristics. */ | |
4482 | if (old_target->attr.function) | |
4483 | { | |
4484 | if (!proc_target->attr.function) | |
4485 | { | |
c4100eae | 4486 | gfc_error ("%qs at %L overrides a FUNCTION and must also be a" |
99fc1b90 | 4487 | " FUNCTION", proc->name, &where); |
524af0d6 | 4488 | return false; |
99fc1b90 | 4489 | } |
8b704316 | 4490 | |
4668d6f9 PT |
4491 | if (!gfc_check_result_characteristics (proc_target, old_target, |
4492 | err, sizeof(err))) | |
2240d1cf | 4493 | { |
edc802c7 | 4494 | gfc_error ("Result mismatch for the overriding procedure " |
c4100eae | 4495 | "%qs at %L: %s", proc->name, &where, err); |
524af0d6 | 4496 | return false; |
2240d1cf | 4497 | } |
99fc1b90 JW |
4498 | } |
4499 | ||
4500 | /* If the overridden binding is PUBLIC, the overriding one must not be | |
4501 | PRIVATE. */ | |
4502 | if (old->n.tb->access == ACCESS_PUBLIC | |
4503 | && proc->n.tb->access == ACCESS_PRIVATE) | |
4504 | { | |
c4100eae | 4505 | gfc_error ("%qs at %L overrides a PUBLIC procedure and must not be" |
99fc1b90 | 4506 | " PRIVATE", proc->name, &where); |
524af0d6 | 4507 | return false; |
99fc1b90 JW |
4508 | } |
4509 | ||
4510 | /* Compare the formal argument lists of both procedures. This is also abused | |
4511 | to find the position of the passed-object dummy arguments of both | |
4512 | bindings as at least the overridden one might not yet be resolved and we | |
4513 | need those positions in the check below. */ | |
4514 | proc_pass_arg = old_pass_arg = 0; | |
4515 | if (!proc->n.tb->nopass && !proc->n.tb->pass_arg) | |
4516 | proc_pass_arg = 1; | |
4517 | if (!old->n.tb->nopass && !old->n.tb->pass_arg) | |
4518 | old_pass_arg = 1; | |
4519 | argpos = 1; | |
4cbc9039 JW |
4520 | proc_formal = gfc_sym_get_dummy_args (proc_target); |
4521 | old_formal = gfc_sym_get_dummy_args (old_target); | |
4522 | for ( ; proc_formal && old_formal; | |
99fc1b90 JW |
4523 | proc_formal = proc_formal->next, old_formal = old_formal->next) |
4524 | { | |
4525 | if (proc->n.tb->pass_arg | |
4526 | && !strcmp (proc->n.tb->pass_arg, proc_formal->sym->name)) | |
4527 | proc_pass_arg = argpos; | |
4528 | if (old->n.tb->pass_arg | |
4529 | && !strcmp (old->n.tb->pass_arg, old_formal->sym->name)) | |
4530 | old_pass_arg = argpos; | |
4531 | ||
4532 | /* Check that the names correspond. */ | |
4533 | if (strcmp (proc_formal->sym->name, old_formal->sym->name)) | |
4534 | { | |
c4100eae | 4535 | gfc_error ("Dummy argument %qs of %qs at %L should be named %qs as" |
99fc1b90 JW |
4536 | " to match the corresponding argument of the overridden" |
4537 | " procedure", proc_formal->sym->name, proc->name, &where, | |
4538 | old_formal->sym->name); | |
524af0d6 | 4539 | return false; |
99fc1b90 JW |
4540 | } |
4541 | ||
9795c594 | 4542 | check_type = proc_pass_arg != argpos && old_pass_arg != argpos; |
4668d6f9 | 4543 | if (!gfc_check_dummy_characteristics (proc_formal->sym, old_formal->sym, |
524af0d6 | 4544 | check_type, err, sizeof(err))) |
99fc1b90 | 4545 | { |
2700d0e3 JJ |
4546 | gfc_error_opt (OPT_Wargument_mismatch, |
4547 | "Argument mismatch for the overriding procedure " | |
4548 | "%qs at %L: %s", proc->name, &where, err); | |
524af0d6 | 4549 | return false; |
99fc1b90 JW |
4550 | } |
4551 | ||
4552 | ++argpos; | |
4553 | } | |
4554 | if (proc_formal || old_formal) | |
4555 | { | |
c4100eae | 4556 | gfc_error ("%qs at %L must have the same number of formal arguments as" |
99fc1b90 | 4557 | " the overridden procedure", proc->name, &where); |
524af0d6 | 4558 | return false; |
99fc1b90 JW |
4559 | } |
4560 | ||
4561 | /* If the overridden binding is NOPASS, the overriding one must also be | |
4562 | NOPASS. */ | |
4563 | if (old->n.tb->nopass && !proc->n.tb->nopass) | |
4564 | { | |
c4100eae | 4565 | gfc_error ("%qs at %L overrides a NOPASS binding and must also be" |
99fc1b90 | 4566 | " NOPASS", proc->name, &where); |
524af0d6 | 4567 | return false; |
99fc1b90 JW |
4568 | } |
4569 | ||
4570 | /* If the overridden binding is PASS(x), the overriding one must also be | |
4571 | PASS and the passed-object dummy arguments must correspond. */ | |
4572 | if (!old->n.tb->nopass) | |
4573 | { | |
4574 | if (proc->n.tb->nopass) | |
4575 | { | |
c4100eae | 4576 | gfc_error ("%qs at %L overrides a binding with PASS and must also be" |
99fc1b90 | 4577 | " PASS", proc->name, &where); |
524af0d6 | 4578 | return false; |
99fc1b90 JW |
4579 | } |
4580 | ||
4581 | if (proc_pass_arg != old_pass_arg) | |
4582 | { | |
c4100eae | 4583 | gfc_error ("Passed-object dummy argument of %qs at %L must be at" |
99fc1b90 JW |
4584 | " the same position as the passed-object dummy argument of" |
4585 | " the overridden procedure", proc->name, &where); | |
524af0d6 | 4586 | return false; |
99fc1b90 JW |
4587 | } |
4588 | } | |
4589 | ||
524af0d6 | 4590 | return true; |
99fc1b90 | 4591 | } |
e73d3ca6 PT |
4592 | |
4593 | ||
4594 | /* The following three functions check that the formal arguments | |
4595 | of user defined derived type IO procedures are compliant with | |
4596 | the requirements of the standard. */ | |
4597 | ||
4598 | static void | |
4599 | check_dtio_arg_TKR_intent (gfc_symbol *fsym, bool typebound, bt type, | |
4600 | int kind, int rank, sym_intent intent) | |
4601 | { | |
4602 | if (fsym->ts.type != type) | |
739d9339 PT |
4603 | { |
4604 | gfc_error ("DTIO dummy argument at %L must be of type %s", | |
4605 | &fsym->declared_at, gfc_basic_typename (type)); | |
4606 | return; | |
4607 | } | |
e73d3ca6 PT |
4608 | |
4609 | if (fsym->ts.type != BT_CLASS && fsym->ts.type != BT_DERIVED | |
4610 | && fsym->ts.kind != kind) | |
4611 | gfc_error ("DTIO dummy argument at %L must be of KIND = %d", | |
4612 | &fsym->declared_at, kind); | |
4613 | ||
4614 | if (!typebound | |
4615 | && rank == 0 | |
4616 | && (((type == BT_CLASS) && CLASS_DATA (fsym)->attr.dimension) | |
4617 | || ((type != BT_CLASS) && fsym->attr.dimension))) | |
b93a9a15 | 4618 | gfc_error ("DTIO dummy argument at %L must be a scalar", |
e73d3ca6 PT |
4619 | &fsym->declared_at); |
4620 | else if (rank == 1 | |
4621 | && (fsym->as == NULL || fsym->as->type != AS_ASSUMED_SHAPE)) | |
4622 | gfc_error ("DTIO dummy argument at %L must be an " | |
4623 | "ASSUMED SHAPE ARRAY", &fsym->declared_at); | |
4624 | ||
4625 | if (fsym->attr.intent != intent) | |
77be9417 | 4626 | gfc_error ("DTIO dummy argument at %L must have INTENT %s", |
e73d3ca6 PT |
4627 | &fsym->declared_at, gfc_code2string (intents, (int)intent)); |
4628 | return; | |
4629 | } | |
4630 | ||
4631 | ||
4632 | static void | |
4633 | check_dtio_interface1 (gfc_symbol *derived, gfc_symtree *tb_io_st, | |
4634 | bool typebound, bool formatted, int code) | |
4635 | { | |
4636 | gfc_symbol *dtio_sub, *generic_proc, *fsym; | |
4637 | gfc_typebound_proc *tb_io_proc, *specific_proc; | |
4638 | gfc_interface *intr; | |
4639 | gfc_formal_arglist *formal; | |
4640 | int arg_num; | |
4641 | ||
4642 | bool read = ((dtio_codes)code == DTIO_RF) | |
4643 | || ((dtio_codes)code == DTIO_RUF); | |
4644 | bt type; | |
4645 | sym_intent intent; | |
4646 | int kind; | |
4647 | ||
4648 | dtio_sub = NULL; | |
4649 | if (typebound) | |
4650 | { | |
4651 | /* Typebound DTIO binding. */ | |
4652 | tb_io_proc = tb_io_st->n.tb; | |
739d9339 PT |
4653 | if (tb_io_proc == NULL) |
4654 | return; | |
4655 | ||
e73d3ca6 PT |
4656 | gcc_assert (tb_io_proc->is_generic); |
4657 | gcc_assert (tb_io_proc->u.generic->next == NULL); | |
4658 | ||
4659 | specific_proc = tb_io_proc->u.generic->specific; | |
739d9339 PT |
4660 | if (specific_proc == NULL || specific_proc->is_generic) |
4661 | return; | |
e73d3ca6 PT |
4662 | |
4663 | dtio_sub = specific_proc->u.specific->n.sym; | |
4664 | } | |
4665 | else | |
4666 | { | |
4667 | generic_proc = tb_io_st->n.sym; | |
739d9339 PT |
4668 | if (generic_proc == NULL || generic_proc->generic == NULL) |
4669 | return; | |
e73d3ca6 PT |
4670 | |
4671 | for (intr = tb_io_st->n.sym->generic; intr; intr = intr->next) | |
4672 | { | |
a8de3002 | 4673 | if (intr->sym && intr->sym->formal && intr->sym->formal->sym |
e73d3ca6 PT |
4674 | && ((intr->sym->formal->sym->ts.type == BT_CLASS |
4675 | && CLASS_DATA (intr->sym->formal->sym)->ts.u.derived | |
4676 | == derived) | |
4677 | || (intr->sym->formal->sym->ts.type == BT_DERIVED | |
4678 | && intr->sym->formal->sym->ts.u.derived == derived))) | |
4679 | { | |
4680 | dtio_sub = intr->sym; | |
4681 | break; | |
4682 | } | |
a8de3002 PT |
4683 | else if (intr->sym && intr->sym->formal && !intr->sym->formal->sym) |
4684 | { | |
4685 | gfc_error ("Alternate return at %L is not permitted in a DTIO " | |
4686 | "procedure", &intr->sym->declared_at); | |
4687 | return; | |
4688 | } | |
e73d3ca6 PT |
4689 | } |
4690 | ||
4691 | if (dtio_sub == NULL) | |
4692 | return; | |
4693 | } | |
4694 | ||
4695 | gcc_assert (dtio_sub); | |
4696 | if (!dtio_sub->attr.subroutine) | |
2f029c08 | 4697 | gfc_error ("DTIO procedure %qs at %L must be a subroutine", |
e73d3ca6 PT |
4698 | dtio_sub->name, &dtio_sub->declared_at); |
4699 | ||
a8de3002 PT |
4700 | arg_num = 0; |
4701 | for (formal = dtio_sub->formal; formal; formal = formal->next) | |
4702 | arg_num++; | |
4703 | ||
4704 | if (arg_num < (formatted ? 6 : 4)) | |
4705 | { | |
2f029c08 | 4706 | gfc_error ("Too few dummy arguments in DTIO procedure %qs at %L", |
a8de3002 PT |
4707 | dtio_sub->name, &dtio_sub->declared_at); |
4708 | return; | |
4709 | } | |
4710 | ||
4711 | if (arg_num > (formatted ? 6 : 4)) | |
4712 | { | |
2f029c08 | 4713 | gfc_error ("Too many dummy arguments in DTIO procedure %qs at %L", |
a8de3002 PT |
4714 | dtio_sub->name, &dtio_sub->declared_at); |
4715 | return; | |
4716 | } | |
4717 | ||
4718 | ||
e73d3ca6 PT |
4719 | /* Now go through the formal arglist. */ |
4720 | arg_num = 1; | |
4721 | for (formal = dtio_sub->formal; formal; formal = formal->next, arg_num++) | |
4722 | { | |
4723 | if (!formatted && arg_num == 3) | |
4724 | arg_num = 5; | |
4725 | fsym = formal->sym; | |
a8de3002 PT |
4726 | |
4727 | if (fsym == NULL) | |
4728 | { | |
4729 | gfc_error ("Alternate return at %L is not permitted in a DTIO " | |
4730 | "procedure", &dtio_sub->declared_at); | |
4731 | return; | |
4732 | } | |
4733 | ||
e73d3ca6 PT |
4734 | switch (arg_num) |
4735 | { | |
4736 | case(1): /* DTV */ | |
4737 | type = derived->attr.sequence || derived->attr.is_bind_c ? | |
4738 | BT_DERIVED : BT_CLASS; | |
4739 | kind = 0; | |
4740 | intent = read ? INTENT_INOUT : INTENT_IN; | |
4741 | check_dtio_arg_TKR_intent (fsym, typebound, type, kind, | |
4742 | 0, intent); | |
4743 | break; | |
4744 | ||
4745 | case(2): /* UNIT */ | |
4746 | type = BT_INTEGER; | |
4747 | kind = gfc_default_integer_kind; | |
4748 | intent = INTENT_IN; | |
4749 | check_dtio_arg_TKR_intent (fsym, typebound, type, kind, | |
4750 | 0, intent); | |
4751 | break; | |
4752 | case(3): /* IOTYPE */ | |
4753 | type = BT_CHARACTER; | |
4754 | kind = gfc_default_character_kind; | |
4755 | intent = INTENT_IN; | |
4756 | check_dtio_arg_TKR_intent (fsym, typebound, type, kind, | |
4757 | 0, intent); | |
4758 | break; | |
4759 | case(4): /* VLIST */ | |
4760 | type = BT_INTEGER; | |
4761 | kind = gfc_default_integer_kind; | |
4762 | intent = INTENT_IN; | |
4763 | check_dtio_arg_TKR_intent (fsym, typebound, type, kind, | |
4764 | 1, intent); | |
4765 | break; | |
4766 | case(5): /* IOSTAT */ | |
4767 | type = BT_INTEGER; | |
4768 | kind = gfc_default_integer_kind; | |
4769 | intent = INTENT_OUT; | |
4770 | check_dtio_arg_TKR_intent (fsym, typebound, type, kind, | |
4771 | 0, intent); | |
4772 | break; | |
4773 | case(6): /* IOMSG */ | |
4774 | type = BT_CHARACTER; | |
4775 | kind = gfc_default_character_kind; | |
4776 | intent = INTENT_INOUT; | |
4777 | check_dtio_arg_TKR_intent (fsym, typebound, type, kind, | |
4778 | 0, intent); | |
4779 | break; | |
4780 | default: | |
4781 | gcc_unreachable (); | |
4782 | } | |
4783 | } | |
4784 | derived->attr.has_dtio_procs = 1; | |
4785 | return; | |
4786 | } | |
4787 | ||
4788 | void | |
4789 | gfc_check_dtio_interfaces (gfc_symbol *derived) | |
4790 | { | |
4791 | gfc_symtree *tb_io_st; | |
4792 | bool t = false; | |
4793 | int code; | |
4794 | bool formatted; | |
4795 | ||
4796 | if (derived->attr.is_class == 1 || derived->attr.vtype == 1) | |
4797 | return; | |
4798 | ||
4799 | /* Check typebound DTIO bindings. */ | |
4800 | for (code = 0; code < 4; code++) | |
4801 | { | |
4802 | formatted = ((dtio_codes)code == DTIO_RF) | |
4803 | || ((dtio_codes)code == DTIO_WF); | |
4804 | ||
4805 | tb_io_st = gfc_find_typebound_proc (derived, &t, | |
4806 | gfc_code2string (dtio_procs, code), | |
4807 | true, &derived->declared_at); | |
4808 | if (tb_io_st != NULL) | |
4809 | check_dtio_interface1 (derived, tb_io_st, true, formatted, code); | |
4810 | } | |
4811 | ||
4812 | /* Check generic DTIO interfaces. */ | |
4813 | for (code = 0; code < 4; code++) | |
4814 | { | |
4815 | formatted = ((dtio_codes)code == DTIO_RF) | |
4816 | || ((dtio_codes)code == DTIO_WF); | |
4817 | ||
4818 | tb_io_st = gfc_find_symtree (derived->ns->sym_root, | |
4819 | gfc_code2string (dtio_procs, code)); | |
4820 | if (tb_io_st != NULL) | |
4821 | check_dtio_interface1 (derived, tb_io_st, false, formatted, code); | |
4822 | } | |
4823 | } | |
4824 | ||
4825 | ||
e4e659b9 JW |
4826 | gfc_symtree* |
4827 | gfc_find_typebound_dtio_proc (gfc_symbol *derived, bool write, bool formatted) | |
e73d3ca6 PT |
4828 | { |
4829 | gfc_symtree *tb_io_st = NULL; | |
e73d3ca6 PT |
4830 | bool t = false; |
4831 | ||
b93a9a15 | 4832 | if (!derived || !derived->resolved || derived->attr.flavor != FL_DERIVED) |
9beb81ed PT |
4833 | return NULL; |
4834 | ||
e73d3ca6 PT |
4835 | /* Try to find a typebound DTIO binding. */ |
4836 | if (formatted == true) | |
4837 | { | |
4838 | if (write == true) | |
4839 | tb_io_st = gfc_find_typebound_proc (derived, &t, | |
4840 | gfc_code2string (dtio_procs, | |
4841 | DTIO_WF), | |
4842 | true, | |
4843 | &derived->declared_at); | |
4844 | else | |
4845 | tb_io_st = gfc_find_typebound_proc (derived, &t, | |
4846 | gfc_code2string (dtio_procs, | |
4847 | DTIO_RF), | |
4848 | true, | |
4849 | &derived->declared_at); | |
4850 | } | |
4851 | else | |
4852 | { | |
4853 | if (write == true) | |
4854 | tb_io_st = gfc_find_typebound_proc (derived, &t, | |
4855 | gfc_code2string (dtio_procs, | |
4856 | DTIO_WUF), | |
4857 | true, | |
4858 | &derived->declared_at); | |
4859 | else | |
4860 | tb_io_st = gfc_find_typebound_proc (derived, &t, | |
4861 | gfc_code2string (dtio_procs, | |
4862 | DTIO_RUF), | |
4863 | true, | |
4864 | &derived->declared_at); | |
4865 | } | |
e4e659b9 JW |
4866 | return tb_io_st; |
4867 | } | |
4868 | ||
4869 | ||
4870 | gfc_symbol * | |
4871 | gfc_find_specific_dtio_proc (gfc_symbol *derived, bool write, bool formatted) | |
4872 | { | |
4873 | gfc_symtree *tb_io_st = NULL; | |
4874 | gfc_symbol *dtio_sub = NULL; | |
4875 | gfc_symbol *extended; | |
4876 | gfc_typebound_proc *tb_io_proc, *specific_proc; | |
4877 | ||
4878 | tb_io_st = gfc_find_typebound_dtio_proc (derived, write, formatted); | |
e73d3ca6 PT |
4879 | |
4880 | if (tb_io_st != NULL) | |
4881 | { | |
096506bb PT |
4882 | const char *genname; |
4883 | gfc_symtree *st; | |
4884 | ||
e73d3ca6 PT |
4885 | tb_io_proc = tb_io_st->n.tb; |
4886 | gcc_assert (tb_io_proc != NULL); | |
4887 | gcc_assert (tb_io_proc->is_generic); | |
4888 | gcc_assert (tb_io_proc->u.generic->next == NULL); | |
4889 | ||
4890 | specific_proc = tb_io_proc->u.generic->specific; | |
4891 | gcc_assert (!specific_proc->is_generic); | |
4892 | ||
096506bb PT |
4893 | /* Go back and make sure that we have the right specific procedure. |
4894 | Here we most likely have a procedure from the parent type, which | |
4895 | can be overridden in extensions. */ | |
4896 | genname = tb_io_proc->u.generic->specific_st->name; | |
4897 | st = gfc_find_typebound_proc (derived, NULL, genname, | |
4898 | true, &tb_io_proc->where); | |
4899 | if (st) | |
4900 | dtio_sub = st->n.tb->u.specific->n.sym; | |
4901 | else | |
4902 | dtio_sub = specific_proc->u.specific->n.sym; | |
e73d3ca6 | 4903 | |
e4e659b9 JW |
4904 | goto finish; |
4905 | } | |
e73d3ca6 PT |
4906 | |
4907 | /* If there is not a typebound binding, look for a generic | |
4908 | DTIO interface. */ | |
4909 | for (extended = derived; extended; | |
4910 | extended = gfc_get_derived_super_type (extended)) | |
4911 | { | |
e4e659b9 JW |
4912 | if (extended == NULL || extended->ns == NULL |
4913 | || extended->attr.flavor == FL_UNKNOWN) | |
a8de3002 PT |
4914 | return NULL; |
4915 | ||
e73d3ca6 PT |
4916 | if (formatted == true) |
4917 | { | |
4918 | if (write == true) | |
4919 | tb_io_st = gfc_find_symtree (extended->ns->sym_root, | |
4920 | gfc_code2string (dtio_procs, | |
4921 | DTIO_WF)); | |
4922 | else | |
4923 | tb_io_st = gfc_find_symtree (extended->ns->sym_root, | |
4924 | gfc_code2string (dtio_procs, | |
4925 | DTIO_RF)); | |
4926 | } | |
4927 | else | |
4928 | { | |
4929 | if (write == true) | |
4930 | tb_io_st = gfc_find_symtree (extended->ns->sym_root, | |
4931 | gfc_code2string (dtio_procs, | |
4932 | DTIO_WUF)); | |
4933 | else | |
4934 | tb_io_st = gfc_find_symtree (extended->ns->sym_root, | |
4935 | gfc_code2string (dtio_procs, | |
4936 | DTIO_RUF)); | |
4937 | } | |
4938 | ||
4939 | if (tb_io_st != NULL | |
4940 | && tb_io_st->n.sym | |
4941 | && tb_io_st->n.sym->generic) | |
4942 | { | |
40109581 | 4943 | for (gfc_interface *intr = tb_io_st->n.sym->generic; |
413e859c | 4944 | intr && intr->sym; intr = intr->next) |
e73d3ca6 | 4945 | { |
413e859c | 4946 | if (intr->sym->formal) |
e73d3ca6 | 4947 | { |
413e859c JW |
4948 | gfc_symbol *fsym = intr->sym->formal->sym; |
4949 | if ((fsym->ts.type == BT_CLASS | |
4950 | && CLASS_DATA (fsym)->ts.u.derived == extended) | |
4951 | || (fsym->ts.type == BT_DERIVED | |
4952 | && fsym->ts.u.derived == extended)) | |
4953 | { | |
4954 | dtio_sub = intr->sym; | |
4955 | break; | |
4956 | } | |
e73d3ca6 PT |
4957 | } |
4958 | } | |
4959 | } | |
4960 | } | |
4961 | ||
4962 | finish: | |
4963 | if (dtio_sub && derived != CLASS_DATA (dtio_sub->formal->sym)->ts.u.derived) | |
4964 | gfc_find_derived_vtab (derived); | |
4965 | ||
4966 | return dtio_sub; | |
4967 | } |