]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* Primary expression subroutines |
835aac92 | 2 | Copyright (C) 2000, 2001, 2002, 2004, 2005, 2006, 2007, 2008 |
5056a350 | 3 | Free Software Foundation, Inc. |
6de9cd9a DN |
4 | Contributed by Andy Vaught |
5 | ||
d1d61a00 | 6 | This file is part of GCC. |
6de9cd9a | 7 | |
d1d61a00 TS |
8 | GCC is free software; you can redistribute it and/or modify it under |
9 | the terms of the GNU General Public License as published by the Free | |
d234d788 | 10 | Software Foundation; either version 3, or (at your option) any later |
d1d61a00 | 11 | version. |
6de9cd9a | 12 | |
d1d61a00 TS |
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
6de9cd9a DN |
17 | |
18 | You should have received a copy of the GNU General Public License | |
d234d788 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a | 21 | |
6de9cd9a DN |
22 | #include "config.h" |
23 | #include "system.h" | |
24 | #include "flags.h" | |
6de9cd9a DN |
25 | #include "gfortran.h" |
26 | #include "arith.h" | |
27 | #include "match.h" | |
28 | #include "parse.h" | |
8fc541d3 | 29 | #include "toplev.h" |
6de9cd9a DN |
30 | |
31 | /* Matches a kind-parameter expression, which is either a named | |
32 | symbolic constant or a nonnegative integer constant. If | |
33 | successful, sets the kind value to the correct integer. */ | |
34 | ||
35 | static match | |
36 | match_kind_param (int *kind) | |
37 | { | |
38 | char name[GFC_MAX_SYMBOL_LEN + 1]; | |
39 | gfc_symbol *sym; | |
40 | const char *p; | |
41 | match m; | |
42 | ||
5cf54585 | 43 | m = gfc_match_small_literal_int (kind, NULL); |
6de9cd9a DN |
44 | if (m != MATCH_NO) |
45 | return m; | |
46 | ||
47 | m = gfc_match_name (name); | |
48 | if (m != MATCH_YES) | |
49 | return m; | |
50 | ||
51 | if (gfc_find_symbol (name, NULL, 1, &sym)) | |
52 | return MATCH_ERROR; | |
53 | ||
54 | if (sym == NULL) | |
55 | return MATCH_NO; | |
56 | ||
57 | if (sym->attr.flavor != FL_PARAMETER) | |
58 | return MATCH_NO; | |
59 | ||
60 | p = gfc_extract_int (sym->value, kind); | |
61 | if (p != NULL) | |
62 | return MATCH_NO; | |
63 | ||
a39fafac FXC |
64 | gfc_set_sym_referenced (sym); |
65 | ||
6de9cd9a DN |
66 | if (*kind < 0) |
67 | return MATCH_NO; | |
68 | ||
69 | return MATCH_YES; | |
70 | } | |
71 | ||
72 | ||
73 | /* Get a trailing kind-specification for non-character variables. | |
74 | Returns: | |
75 | the integer kind value or: | |
76 | -1 if an error was generated | |
77 | -2 if no kind was found */ | |
78 | ||
79 | static int | |
80 | get_kind (void) | |
81 | { | |
82 | int kind; | |
83 | match m; | |
84 | ||
85 | if (gfc_match_char ('_') != MATCH_YES) | |
86 | return -2; | |
87 | ||
88 | m = match_kind_param (&kind); | |
89 | if (m == MATCH_NO) | |
90 | gfc_error ("Missing kind-parameter at %C"); | |
91 | ||
92 | return (m == MATCH_YES) ? kind : -1; | |
93 | } | |
94 | ||
95 | ||
96 | /* Given a character and a radix, see if the character is a valid | |
97 | digit in that radix. */ | |
98 | ||
8fc541d3 FXC |
99 | int |
100 | gfc_check_digit (char c, int radix) | |
6de9cd9a DN |
101 | { |
102 | int r; | |
103 | ||
104 | switch (radix) | |
105 | { | |
106 | case 2: | |
107 | r = ('0' <= c && c <= '1'); | |
108 | break; | |
109 | ||
110 | case 8: | |
111 | r = ('0' <= c && c <= '7'); | |
112 | break; | |
113 | ||
114 | case 10: | |
115 | r = ('0' <= c && c <= '9'); | |
116 | break; | |
117 | ||
118 | case 16: | |
da8309c6 | 119 | r = ISXDIGIT (c); |
6de9cd9a DN |
120 | break; |
121 | ||
122 | default: | |
8fc541d3 | 123 | gfc_internal_error ("gfc_check_digit(): bad radix"); |
6de9cd9a DN |
124 | } |
125 | ||
126 | return r; | |
127 | } | |
128 | ||
129 | ||
130 | /* Match the digit string part of an integer if signflag is not set, | |
131 | the signed digit string part if signflag is set. If the buffer | |
132 | is NULL, we just count characters for the resolution pass. Returns | |
133 | the number of characters matched, -1 for no match. */ | |
134 | ||
135 | static int | |
136 | match_digits (int signflag, int radix, char *buffer) | |
137 | { | |
138 | locus old_loc; | |
8fc541d3 FXC |
139 | int length; |
140 | char c; | |
6de9cd9a DN |
141 | |
142 | length = 0; | |
8fc541d3 | 143 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
144 | |
145 | if (signflag && (c == '+' || c == '-')) | |
146 | { | |
147 | if (buffer != NULL) | |
148 | *buffer++ = c; | |
69029c61 | 149 | gfc_gobble_whitespace (); |
8fc541d3 | 150 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
151 | length++; |
152 | } | |
153 | ||
8fc541d3 | 154 | if (!gfc_check_digit (c, radix)) |
6de9cd9a DN |
155 | return -1; |
156 | ||
157 | length++; | |
158 | if (buffer != NULL) | |
159 | *buffer++ = c; | |
160 | ||
161 | for (;;) | |
162 | { | |
63645982 | 163 | old_loc = gfc_current_locus; |
8fc541d3 | 164 | c = gfc_next_ascii_char (); |
6de9cd9a | 165 | |
8fc541d3 | 166 | if (!gfc_check_digit (c, radix)) |
6de9cd9a DN |
167 | break; |
168 | ||
169 | if (buffer != NULL) | |
170 | *buffer++ = c; | |
171 | length++; | |
172 | } | |
173 | ||
63645982 | 174 | gfc_current_locus = old_loc; |
6de9cd9a DN |
175 | |
176 | return length; | |
177 | } | |
178 | ||
179 | ||
180 | /* Match an integer (digit string and optional kind). | |
181 | A sign will be accepted if signflag is set. */ | |
182 | ||
183 | static match | |
edf1eac2 | 184 | match_integer_constant (gfc_expr **result, int signflag) |
6de9cd9a DN |
185 | { |
186 | int length, kind; | |
187 | locus old_loc; | |
188 | char *buffer; | |
189 | gfc_expr *e; | |
190 | ||
63645982 | 191 | old_loc = gfc_current_locus; |
6de9cd9a DN |
192 | gfc_gobble_whitespace (); |
193 | ||
194 | length = match_digits (signflag, 10, NULL); | |
63645982 | 195 | gfc_current_locus = old_loc; |
6de9cd9a DN |
196 | if (length == -1) |
197 | return MATCH_NO; | |
198 | ||
ece3f663 | 199 | buffer = (char *) alloca (length + 1); |
6de9cd9a DN |
200 | memset (buffer, '\0', length + 1); |
201 | ||
202 | gfc_gobble_whitespace (); | |
203 | ||
204 | match_digits (signflag, 10, buffer); | |
205 | ||
206 | kind = get_kind (); | |
207 | if (kind == -2) | |
9d64df18 | 208 | kind = gfc_default_integer_kind; |
6de9cd9a DN |
209 | if (kind == -1) |
210 | return MATCH_ERROR; | |
211 | ||
e7a2d5fb | 212 | if (gfc_validate_kind (BT_INTEGER, kind, true) < 0) |
6de9cd9a DN |
213 | { |
214 | gfc_error ("Integer kind %d at %C not available", kind); | |
215 | return MATCH_ERROR; | |
216 | } | |
217 | ||
63645982 | 218 | e = gfc_convert_integer (buffer, kind, 10, &gfc_current_locus); |
6de9cd9a DN |
219 | |
220 | if (gfc_range_check (e) != ARITH_OK) | |
221 | { | |
b2458f91 TB |
222 | gfc_error ("Integer too big for its kind at %C. This check can be " |
223 | "disabled with the option -fno-range-check"); | |
6de9cd9a DN |
224 | |
225 | gfc_free_expr (e); | |
226 | return MATCH_ERROR; | |
227 | } | |
228 | ||
229 | *result = e; | |
230 | return MATCH_YES; | |
231 | } | |
232 | ||
233 | ||
d3642f89 FW |
234 | /* Match a Hollerith constant. */ |
235 | ||
236 | static match | |
edf1eac2 | 237 | match_hollerith_constant (gfc_expr **result) |
d3642f89 FW |
238 | { |
239 | locus old_loc; | |
edf1eac2 SK |
240 | gfc_expr *e = NULL; |
241 | const char *msg; | |
24bce1fd SB |
242 | int num; |
243 | int i; | |
d3642f89 FW |
244 | |
245 | old_loc = gfc_current_locus; | |
246 | gfc_gobble_whitespace (); | |
247 | ||
248 | if (match_integer_constant (&e, 0) == MATCH_YES | |
edf1eac2 | 249 | && gfc_match_char ('h') == MATCH_YES) |
d3642f89 | 250 | { |
edf1eac2 SK |
251 | if (gfc_notify_std (GFC_STD_LEGACY, "Extension: Hollerith constant " |
252 | "at %C") == FAILURE) | |
d3642f89 FW |
253 | goto cleanup; |
254 | ||
255 | msg = gfc_extract_int (e, &num); | |
256 | if (msg != NULL) | |
257 | { | |
258 | gfc_error (msg); | |
259 | goto cleanup; | |
260 | } | |
261 | if (num == 0) | |
262 | { | |
edf1eac2 SK |
263 | gfc_error ("Invalid Hollerith constant: %L must contain at least " |
264 | "one character", &old_loc); | |
d3642f89 FW |
265 | goto cleanup; |
266 | } | |
267 | if (e->ts.kind != gfc_default_integer_kind) | |
268 | { | |
eb6d74fa | 269 | gfc_error ("Invalid Hollerith constant: Integer kind at %L " |
edf1eac2 | 270 | "should be default", &old_loc); |
d3642f89 FW |
271 | goto cleanup; |
272 | } | |
273 | else | |
274 | { | |
d3642f89 | 275 | gfc_free_expr (e); |
edf1eac2 SK |
276 | e = gfc_constant_result (BT_HOLLERITH, gfc_default_character_kind, |
277 | &gfc_current_locus); | |
20585ad6 | 278 | |
ece3f663 | 279 | e->representation.string = XCNEWVEC (char, num + 1); |
8fc541d3 | 280 | |
20585ad6 | 281 | for (i = 0; i < num; i++) |
00660189 FXC |
282 | { |
283 | gfc_char_t c = gfc_next_char_literal (1); | |
284 | if (! gfc_wide_fits_in_byte (c)) | |
285 | { | |
286 | gfc_error ("Invalid Hollerith constant at %L contains a " | |
287 | "wide character", &old_loc); | |
288 | goto cleanup; | |
289 | } | |
290 | ||
291 | e->representation.string[i] = (unsigned char) c; | |
292 | } | |
8fc541d3 | 293 | |
20585ad6 BM |
294 | e->representation.string[num] = '\0'; |
295 | e->representation.length = num; | |
296 | ||
d3642f89 FW |
297 | *result = e; |
298 | return MATCH_YES; | |
299 | } | |
300 | } | |
301 | ||
302 | gfc_free_expr (e); | |
303 | gfc_current_locus = old_loc; | |
304 | return MATCH_NO; | |
305 | ||
306 | cleanup: | |
307 | gfc_free_expr (e); | |
308 | return MATCH_ERROR; | |
309 | } | |
310 | ||
311 | ||
6de9cd9a | 312 | /* Match a binary, octal or hexadecimal constant that can be found in |
78019d16 SK |
313 | a DATA statement. The standard permits b'010...', o'73...', and |
314 | z'a1...' where b, o, and z can be capital letters. This function | |
315 | also accepts postfixed forms of the constants: '01...'b, '73...'o, | |
316 | and 'a1...'z. An additional extension is the use of x for z. */ | |
6de9cd9a DN |
317 | |
318 | static match | |
edf1eac2 | 319 | match_boz_constant (gfc_expr **result) |
6de9cd9a | 320 | { |
8fc541d3 | 321 | int radix, length, x_hex, kind; |
78019d16 | 322 | locus old_loc, start_loc; |
8fc541d3 | 323 | char *buffer, post, delim; |
6de9cd9a | 324 | gfc_expr *e; |
6de9cd9a | 325 | |
78019d16 | 326 | start_loc = old_loc = gfc_current_locus; |
6de9cd9a DN |
327 | gfc_gobble_whitespace (); |
328 | ||
88199e7c | 329 | x_hex = 0; |
8fc541d3 | 330 | switch (post = gfc_next_ascii_char ()) |
6de9cd9a DN |
331 | { |
332 | case 'b': | |
333 | radix = 2; | |
78019d16 | 334 | post = 0; |
6de9cd9a DN |
335 | break; |
336 | case 'o': | |
337 | radix = 8; | |
78019d16 | 338 | post = 0; |
6de9cd9a DN |
339 | break; |
340 | case 'x': | |
88199e7c | 341 | x_hex = 1; |
6de9cd9a DN |
342 | /* Fall through. */ |
343 | case 'z': | |
344 | radix = 16; | |
78019d16 SK |
345 | post = 0; |
346 | break; | |
347 | case '\'': | |
348 | /* Fall through. */ | |
349 | case '\"': | |
350 | delim = post; | |
351 | post = 1; | |
352 | radix = 16; /* Set to accept any valid digit string. */ | |
6de9cd9a DN |
353 | break; |
354 | default: | |
355 | goto backup; | |
356 | } | |
357 | ||
358 | /* No whitespace allowed here. */ | |
359 | ||
78019d16 | 360 | if (post == 0) |
8fc541d3 | 361 | delim = gfc_next_ascii_char (); |
78019d16 | 362 | |
6de9cd9a DN |
363 | if (delim != '\'' && delim != '\"') |
364 | goto backup; | |
365 | ||
00a4618b | 366 | if (x_hex |
5d874166 | 367 | && (gfc_notify_std (GFC_STD_GNU, "Extension: Hexadecimal " |
0bf0efd5 | 368 | "constant at %C uses non-standard syntax") |
5d874166 TS |
369 | == FAILURE)) |
370 | return MATCH_ERROR; | |
371 | ||
63645982 | 372 | old_loc = gfc_current_locus; |
6de9cd9a DN |
373 | |
374 | length = match_digits (0, radix, NULL); | |
375 | if (length == -1) | |
376 | { | |
78019d16 | 377 | gfc_error ("Empty set of digits in BOZ constant at %C"); |
6de9cd9a DN |
378 | return MATCH_ERROR; |
379 | } | |
380 | ||
8fc541d3 | 381 | if (gfc_next_ascii_char () != delim) |
6de9cd9a | 382 | { |
78019d16 SK |
383 | gfc_error ("Illegal character in BOZ constant at %C"); |
384 | return MATCH_ERROR; | |
385 | } | |
386 | ||
387 | if (post == 1) | |
388 | { | |
8fc541d3 | 389 | switch (gfc_next_ascii_char ()) |
78019d16 SK |
390 | { |
391 | case 'b': | |
392 | radix = 2; | |
21dac32c | 393 | break; |
78019d16 SK |
394 | case 'o': |
395 | radix = 8; | |
21dac32c | 396 | break; |
78019d16 SK |
397 | case 'x': |
398 | /* Fall through. */ | |
399 | case 'z': | |
400 | radix = 16; | |
21dac32c | 401 | break; |
31043f6c | 402 | default: |
78019d16 | 403 | goto backup; |
31043f6c | 404 | } |
0bf0efd5 TB |
405 | |
406 | if (gfc_notify_std (GFC_STD_GNU, "Extension: BOZ constant " | |
407 | "at %C uses non-standard postfix syntax") | |
408 | == FAILURE) | |
409 | return MATCH_ERROR; | |
6de9cd9a DN |
410 | } |
411 | ||
63645982 | 412 | gfc_current_locus = old_loc; |
6de9cd9a | 413 | |
ece3f663 | 414 | buffer = (char *) alloca (length + 1); |
6de9cd9a DN |
415 | memset (buffer, '\0', length + 1); |
416 | ||
417 | match_digits (0, radix, buffer); | |
8fc541d3 | 418 | gfc_next_ascii_char (); /* Eat delimiter. */ |
78019d16 | 419 | if (post == 1) |
8fc541d3 | 420 | gfc_next_ascii_char (); /* Eat postfixed b, o, z, or x. */ |
6de9cd9a | 421 | |
f4e7375a SK |
422 | /* In section 5.2.5 and following C567 in the Fortran 2003 standard, we find |
423 | "If a data-stmt-constant is a boz-literal-constant, the corresponding | |
424 | variable shall be of type integer. The boz-literal-constant is treated | |
425 | as if it were an int-literal-constant with a kind-param that specifies | |
426 | the representation method with the largest decimal exponent range | |
427 | supported by the processor." */ | |
428 | ||
429 | kind = gfc_max_integer_kind; | |
5d874166 | 430 | e = gfc_convert_integer (buffer, kind, radix, &gfc_current_locus); |
6de9cd9a | 431 | |
00a4618b TB |
432 | /* Mark as boz variable. */ |
433 | e->is_boz = 1; | |
434 | ||
6de9cd9a DN |
435 | if (gfc_range_check (e) != ARITH_OK) |
436 | { | |
5d874166 | 437 | gfc_error ("Integer too big for integer kind %i at %C", kind); |
88199e7c TS |
438 | gfc_free_expr (e); |
439 | return MATCH_ERROR; | |
440 | } | |
441 | ||
0bf0efd5 | 442 | if (!gfc_in_match_data () |
00a4618b | 443 | && (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: BOZ used outside a DATA " |
0bf0efd5 TB |
444 | "statement at %C") |
445 | == FAILURE)) | |
446 | return MATCH_ERROR; | |
447 | ||
6de9cd9a DN |
448 | *result = e; |
449 | return MATCH_YES; | |
450 | ||
451 | backup: | |
78019d16 | 452 | gfc_current_locus = start_loc; |
6de9cd9a DN |
453 | return MATCH_NO; |
454 | } | |
455 | ||
456 | ||
69029c61 | 457 | /* Match a real constant of some sort. Allow a signed constant if signflag |
00a4618b | 458 | is nonzero. */ |
6de9cd9a DN |
459 | |
460 | static match | |
edf1eac2 | 461 | match_real_constant (gfc_expr **result, int signflag) |
6de9cd9a | 462 | { |
8fc541d3 | 463 | int kind, count, seen_dp, seen_digits; |
6de9cd9a | 464 | locus old_loc, temp_loc; |
8fc541d3 | 465 | char *p, *buffer, c, exp_char; |
6de9cd9a | 466 | gfc_expr *e; |
69029c61 | 467 | bool negate; |
6de9cd9a | 468 | |
63645982 | 469 | old_loc = gfc_current_locus; |
6de9cd9a DN |
470 | gfc_gobble_whitespace (); |
471 | ||
472 | e = NULL; | |
473 | ||
474 | count = 0; | |
475 | seen_dp = 0; | |
476 | seen_digits = 0; | |
477 | exp_char = ' '; | |
69029c61 | 478 | negate = FALSE; |
6de9cd9a | 479 | |
8fc541d3 | 480 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
481 | if (signflag && (c == '+' || c == '-')) |
482 | { | |
69029c61 PB |
483 | if (c == '-') |
484 | negate = TRUE; | |
485 | ||
486 | gfc_gobble_whitespace (); | |
8fc541d3 | 487 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
488 | } |
489 | ||
02712c16 | 490 | /* Scan significand. */ |
8fc541d3 | 491 | for (;; c = gfc_next_ascii_char (), count++) |
6de9cd9a DN |
492 | { |
493 | if (c == '.') | |
494 | { | |
495 | if (seen_dp) | |
496 | goto done; | |
497 | ||
edf1eac2 SK |
498 | /* Check to see if "." goes with a following operator like |
499 | ".eq.". */ | |
63645982 | 500 | temp_loc = gfc_current_locus; |
8fc541d3 | 501 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
502 | |
503 | if (c == 'e' || c == 'd' || c == 'q') | |
504 | { | |
8fc541d3 | 505 | c = gfc_next_ascii_char (); |
6de9cd9a | 506 | if (c == '.') |
f7b529fa | 507 | goto done; /* Operator named .e. or .d. */ |
6de9cd9a DN |
508 | } |
509 | ||
510 | if (ISALPHA (c)) | |
511 | goto done; /* Distinguish 1.e9 from 1.eq.2 */ | |
512 | ||
63645982 | 513 | gfc_current_locus = temp_loc; |
6de9cd9a DN |
514 | seen_dp = 1; |
515 | continue; | |
516 | } | |
517 | ||
518 | if (ISDIGIT (c)) | |
519 | { | |
520 | seen_digits = 1; | |
521 | continue; | |
522 | } | |
523 | ||
524 | break; | |
525 | } | |
526 | ||
edf1eac2 | 527 | if (!seen_digits || (c != 'e' && c != 'd' && c != 'q')) |
6de9cd9a DN |
528 | goto done; |
529 | exp_char = c; | |
530 | ||
531 | /* Scan exponent. */ | |
8fc541d3 | 532 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
533 | count++; |
534 | ||
535 | if (c == '+' || c == '-') | |
536 | { /* optional sign */ | |
8fc541d3 | 537 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
538 | count++; |
539 | } | |
540 | ||
541 | if (!ISDIGIT (c)) | |
542 | { | |
6de9cd9a DN |
543 | gfc_error ("Missing exponent in real number at %C"); |
544 | return MATCH_ERROR; | |
545 | } | |
546 | ||
547 | while (ISDIGIT (c)) | |
548 | { | |
8fc541d3 | 549 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
550 | count++; |
551 | } | |
552 | ||
553 | done: | |
69029c61 | 554 | /* Check that we have a numeric constant. */ |
6de9cd9a DN |
555 | if (!seen_digits || (!seen_dp && exp_char == ' ')) |
556 | { | |
63645982 | 557 | gfc_current_locus = old_loc; |
6de9cd9a DN |
558 | return MATCH_NO; |
559 | } | |
560 | ||
561 | /* Convert the number. */ | |
63645982 | 562 | gfc_current_locus = old_loc; |
6de9cd9a DN |
563 | gfc_gobble_whitespace (); |
564 | ||
ece3f663 | 565 | buffer = (char *) alloca (count + 1); |
6de9cd9a DN |
566 | memset (buffer, '\0', count + 1); |
567 | ||
6de9cd9a | 568 | p = buffer; |
8fc541d3 | 569 | c = gfc_next_ascii_char (); |
69029c61 | 570 | if (c == '+' || c == '-') |
6de9cd9a | 571 | { |
69029c61 | 572 | gfc_gobble_whitespace (); |
8fc541d3 | 573 | c = gfc_next_ascii_char (); |
69029c61 PB |
574 | } |
575 | ||
576 | /* Hack for mpfr_set_str(). */ | |
577 | for (;;) | |
578 | { | |
579 | if (c == 'd' || c == 'q') | |
6de9cd9a | 580 | *p = 'e'; |
69029c61 PB |
581 | else |
582 | *p = c; | |
6de9cd9a | 583 | p++; |
69029c61 PB |
584 | if (--count == 0) |
585 | break; | |
586 | ||
8fc541d3 | 587 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
588 | } |
589 | ||
590 | kind = get_kind (); | |
591 | if (kind == -1) | |
592 | goto cleanup; | |
593 | ||
594 | switch (exp_char) | |
595 | { | |
596 | case 'd': | |
597 | if (kind != -2) | |
598 | { | |
edf1eac2 SK |
599 | gfc_error ("Real number at %C has a 'd' exponent and an explicit " |
600 | "kind"); | |
6de9cd9a DN |
601 | goto cleanup; |
602 | } | |
9d64df18 | 603 | kind = gfc_default_double_kind; |
6de9cd9a DN |
604 | break; |
605 | ||
6de9cd9a DN |
606 | default: |
607 | if (kind == -2) | |
9d64df18 | 608 | kind = gfc_default_real_kind; |
6de9cd9a | 609 | |
e7a2d5fb | 610 | if (gfc_validate_kind (BT_REAL, kind, true) < 0) |
6de9cd9a DN |
611 | { |
612 | gfc_error ("Invalid real kind %d at %C", kind); | |
613 | goto cleanup; | |
614 | } | |
615 | } | |
616 | ||
63645982 | 617 | e = gfc_convert_real (buffer, kind, &gfc_current_locus); |
69029c61 PB |
618 | if (negate) |
619 | mpfr_neg (e->value.real, e->value.real, GFC_RND_MODE); | |
6de9cd9a DN |
620 | |
621 | switch (gfc_range_check (e)) | |
622 | { | |
623 | case ARITH_OK: | |
624 | break; | |
625 | case ARITH_OVERFLOW: | |
626 | gfc_error ("Real constant overflows its kind at %C"); | |
627 | goto cleanup; | |
628 | ||
629 | case ARITH_UNDERFLOW: | |
2d8b59df | 630 | if (gfc_option.warn_underflow) |
edf1eac2 | 631 | gfc_warning ("Real constant underflows its kind at %C"); |
f8e566e5 | 632 | mpfr_set_ui (e->value.real, 0, GFC_RND_MODE); |
2d8b59df | 633 | break; |
6de9cd9a DN |
634 | |
635 | default: | |
636 | gfc_internal_error ("gfc_range_check() returned bad value"); | |
637 | } | |
638 | ||
639 | *result = e; | |
640 | return MATCH_YES; | |
641 | ||
642 | cleanup: | |
643 | gfc_free_expr (e); | |
644 | return MATCH_ERROR; | |
645 | } | |
646 | ||
647 | ||
648 | /* Match a substring reference. */ | |
649 | ||
650 | static match | |
edf1eac2 | 651 | match_substring (gfc_charlen *cl, int init, gfc_ref **result) |
6de9cd9a DN |
652 | { |
653 | gfc_expr *start, *end; | |
654 | locus old_loc; | |
655 | gfc_ref *ref; | |
656 | match m; | |
657 | ||
658 | start = NULL; | |
659 | end = NULL; | |
660 | ||
63645982 | 661 | old_loc = gfc_current_locus; |
6de9cd9a DN |
662 | |
663 | m = gfc_match_char ('('); | |
664 | if (m != MATCH_YES) | |
665 | return MATCH_NO; | |
666 | ||
667 | if (gfc_match_char (':') != MATCH_YES) | |
668 | { | |
669 | if (init) | |
670 | m = gfc_match_init_expr (&start); | |
671 | else | |
672 | m = gfc_match_expr (&start); | |
673 | ||
674 | if (m != MATCH_YES) | |
675 | { | |
676 | m = MATCH_NO; | |
677 | goto cleanup; | |
678 | } | |
679 | ||
680 | m = gfc_match_char (':'); | |
681 | if (m != MATCH_YES) | |
682 | goto cleanup; | |
683 | } | |
684 | ||
685 | if (gfc_match_char (')') != MATCH_YES) | |
686 | { | |
687 | if (init) | |
688 | m = gfc_match_init_expr (&end); | |
689 | else | |
690 | m = gfc_match_expr (&end); | |
691 | ||
692 | if (m == MATCH_NO) | |
693 | goto syntax; | |
694 | if (m == MATCH_ERROR) | |
695 | goto cleanup; | |
696 | ||
697 | m = gfc_match_char (')'); | |
698 | if (m == MATCH_NO) | |
699 | goto syntax; | |
700 | } | |
701 | ||
702 | /* Optimize away the (:) reference. */ | |
703 | if (start == NULL && end == NULL) | |
704 | ref = NULL; | |
705 | else | |
706 | { | |
707 | ref = gfc_get_ref (); | |
708 | ||
709 | ref->type = REF_SUBSTRING; | |
710 | if (start == NULL) | |
711 | start = gfc_int_expr (1); | |
712 | ref->u.ss.start = start; | |
713 | if (end == NULL && cl) | |
714 | end = gfc_copy_expr (cl->length); | |
715 | ref->u.ss.end = end; | |
716 | ref->u.ss.length = cl; | |
717 | } | |
718 | ||
719 | *result = ref; | |
720 | return MATCH_YES; | |
721 | ||
722 | syntax: | |
723 | gfc_error ("Syntax error in SUBSTRING specification at %C"); | |
724 | m = MATCH_ERROR; | |
725 | ||
726 | cleanup: | |
727 | gfc_free_expr (start); | |
728 | gfc_free_expr (end); | |
729 | ||
63645982 | 730 | gfc_current_locus = old_loc; |
6de9cd9a DN |
731 | return m; |
732 | } | |
733 | ||
734 | ||
735 | /* Reads the next character of a string constant, taking care to | |
736 | return doubled delimiters on the input as a single instance of | |
737 | the delimiter. | |
738 | ||
8fc541d3 | 739 | Special return values for "ret" argument are: |
6de9cd9a DN |
740 | -1 End of the string, as determined by the delimiter |
741 | -2 Unterminated string detected | |
742 | ||
743 | Backslash codes are also expanded at this time. */ | |
744 | ||
8fc541d3 FXC |
745 | static gfc_char_t |
746 | next_string_char (gfc_char_t delimiter, int *ret) | |
6de9cd9a DN |
747 | { |
748 | locus old_locus; | |
8fc541d3 | 749 | gfc_char_t c; |
6de9cd9a DN |
750 | |
751 | c = gfc_next_char_literal (1); | |
8fc541d3 | 752 | *ret = 0; |
6de9cd9a DN |
753 | |
754 | if (c == '\n') | |
8fc541d3 FXC |
755 | { |
756 | *ret = -2; | |
757 | return 0; | |
758 | } | |
6de9cd9a | 759 | |
131c66cd | 760 | if (gfc_option.flag_backslash && c == '\\') |
6de9cd9a | 761 | { |
63645982 | 762 | old_locus = gfc_current_locus; |
6de9cd9a | 763 | |
a88a266c SK |
764 | if (gfc_match_special_char (&c) == MATCH_NO) |
765 | gfc_current_locus = old_locus; | |
2e6a83a7 SK |
766 | |
767 | if (!(gfc_option.allow_std & GFC_STD_GNU) && !inhibit_warnings) | |
768 | gfc_warning ("Extension: backslash character at %C"); | |
6de9cd9a DN |
769 | } |
770 | ||
771 | if (c != delimiter) | |
772 | return c; | |
773 | ||
63645982 | 774 | old_locus = gfc_current_locus; |
1355d8e7 | 775 | c = gfc_next_char_literal (0); |
6de9cd9a DN |
776 | |
777 | if (c == delimiter) | |
778 | return c; | |
63645982 | 779 | gfc_current_locus = old_locus; |
6de9cd9a | 780 | |
8fc541d3 FXC |
781 | *ret = -1; |
782 | return 0; | |
6de9cd9a DN |
783 | } |
784 | ||
785 | ||
786 | /* Special case of gfc_match_name() that matches a parameter kind name | |
787 | before a string constant. This takes case of the weird but legal | |
4f8ea09e | 788 | case of: |
6de9cd9a DN |
789 | |
790 | kind_____'string' | |
791 | ||
792 | where kind____ is a parameter. gfc_match_name() will happily slurp | |
793 | up all the underscores, which leads to problems. If we return | |
794 | MATCH_YES, the parse pointer points to the final underscore, which | |
795 | is not part of the name. We never return MATCH_ERROR-- errors in | |
796 | the name will be detected later. */ | |
797 | ||
798 | static match | |
799 | match_charkind_name (char *name) | |
800 | { | |
801 | locus old_loc; | |
802 | char c, peek; | |
803 | int len; | |
804 | ||
805 | gfc_gobble_whitespace (); | |
8fc541d3 | 806 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
807 | if (!ISALPHA (c)) |
808 | return MATCH_NO; | |
809 | ||
810 | *name++ = c; | |
811 | len = 1; | |
812 | ||
813 | for (;;) | |
814 | { | |
63645982 | 815 | old_loc = gfc_current_locus; |
8fc541d3 | 816 | c = gfc_next_ascii_char (); |
6de9cd9a DN |
817 | |
818 | if (c == '_') | |
819 | { | |
8fc541d3 | 820 | peek = gfc_peek_ascii_char (); |
6de9cd9a DN |
821 | |
822 | if (peek == '\'' || peek == '\"') | |
823 | { | |
63645982 | 824 | gfc_current_locus = old_loc; |
6de9cd9a DN |
825 | *name = '\0'; |
826 | return MATCH_YES; | |
827 | } | |
828 | } | |
829 | ||
830 | if (!ISALNUM (c) | |
831 | && c != '_' | |
832 | && (gfc_option.flag_dollar_ok && c != '$')) | |
833 | break; | |
834 | ||
835 | *name++ = c; | |
836 | if (++len > GFC_MAX_SYMBOL_LEN) | |
837 | break; | |
838 | } | |
839 | ||
840 | return MATCH_NO; | |
841 | } | |
842 | ||
843 | ||
844 | /* See if the current input matches a character constant. Lots of | |
845 | contortions have to be done to match the kind parameter which comes | |
846 | before the actual string. The main consideration is that we don't | |
847 | want to error out too quickly. For example, we don't actually do | |
848 | any validation of the kinds until we have actually seen a legal | |
849 | delimiter. Using match_kind_param() generates errors too quickly. */ | |
850 | ||
851 | static match | |
edf1eac2 | 852 | match_string_constant (gfc_expr **result) |
6de9cd9a | 853 | { |
00660189 | 854 | char name[GFC_MAX_SYMBOL_LEN + 1], peek; |
8fc541d3 | 855 | int i, kind, length, warn_ampersand, ret; |
6de9cd9a DN |
856 | locus old_locus, start_locus; |
857 | gfc_symbol *sym; | |
858 | gfc_expr *e; | |
859 | const char *q; | |
860 | match m; | |
00660189 | 861 | gfc_char_t c, delimiter, *p; |
6de9cd9a | 862 | |
63645982 | 863 | old_locus = gfc_current_locus; |
6de9cd9a DN |
864 | |
865 | gfc_gobble_whitespace (); | |
866 | ||
63645982 | 867 | start_locus = gfc_current_locus; |
6de9cd9a DN |
868 | |
869 | c = gfc_next_char (); | |
870 | if (c == '\'' || c == '"') | |
871 | { | |
9d64df18 | 872 | kind = gfc_default_character_kind; |
6de9cd9a DN |
873 | goto got_delim; |
874 | } | |
875 | ||
8fc541d3 | 876 | if (gfc_wide_is_digit (c)) |
6de9cd9a DN |
877 | { |
878 | kind = 0; | |
879 | ||
8fc541d3 | 880 | while (gfc_wide_is_digit (c)) |
6de9cd9a DN |
881 | { |
882 | kind = kind * 10 + c - '0'; | |
883 | if (kind > 9999999) | |
884 | goto no_match; | |
885 | c = gfc_next_char (); | |
886 | } | |
887 | ||
888 | } | |
889 | else | |
890 | { | |
63645982 | 891 | gfc_current_locus = old_locus; |
6de9cd9a DN |
892 | |
893 | m = match_charkind_name (name); | |
894 | if (m != MATCH_YES) | |
895 | goto no_match; | |
896 | ||
897 | if (gfc_find_symbol (name, NULL, 1, &sym) | |
898 | || sym == NULL | |
899 | || sym->attr.flavor != FL_PARAMETER) | |
900 | goto no_match; | |
901 | ||
902 | kind = -1; | |
903 | c = gfc_next_char (); | |
904 | } | |
905 | ||
906 | if (c == ' ') | |
907 | { | |
908 | gfc_gobble_whitespace (); | |
909 | c = gfc_next_char (); | |
910 | } | |
911 | ||
912 | if (c != '_') | |
913 | goto no_match; | |
914 | ||
915 | gfc_gobble_whitespace (); | |
63645982 | 916 | start_locus = gfc_current_locus; |
6de9cd9a DN |
917 | |
918 | c = gfc_next_char (); | |
919 | if (c != '\'' && c != '"') | |
920 | goto no_match; | |
921 | ||
922 | if (kind == -1) | |
923 | { | |
924 | q = gfc_extract_int (sym->value, &kind); | |
925 | if (q != NULL) | |
926 | { | |
927 | gfc_error (q); | |
928 | return MATCH_ERROR; | |
929 | } | |
a39fafac | 930 | gfc_set_sym_referenced (sym); |
6de9cd9a DN |
931 | } |
932 | ||
e7a2d5fb | 933 | if (gfc_validate_kind (BT_CHARACTER, kind, true) < 0) |
6de9cd9a DN |
934 | { |
935 | gfc_error ("Invalid kind %d for CHARACTER constant at %C", kind); | |
936 | return MATCH_ERROR; | |
937 | } | |
938 | ||
939 | got_delim: | |
940 | /* Scan the string into a block of memory by first figuring out how | |
941 | long it is, allocating the structure, then re-reading it. This | |
942 | isn't particularly efficient, but string constants aren't that | |
943 | common in most code. TODO: Use obstacks? */ | |
944 | ||
945 | delimiter = c; | |
946 | length = 0; | |
947 | ||
948 | for (;;) | |
949 | { | |
8fc541d3 FXC |
950 | c = next_string_char (delimiter, &ret); |
951 | if (ret == -1) | |
6de9cd9a | 952 | break; |
8fc541d3 | 953 | if (ret == -2) |
6de9cd9a | 954 | { |
63645982 | 955 | gfc_current_locus = start_locus; |
6de9cd9a DN |
956 | gfc_error ("Unterminated character constant beginning at %C"); |
957 | return MATCH_ERROR; | |
958 | } | |
959 | ||
960 | length++; | |
961 | } | |
962 | ||
78019d16 SK |
963 | /* Peek at the next character to see if it is a b, o, z, or x for the |
964 | postfixed BOZ literal constants. */ | |
8fc541d3 FXC |
965 | peek = gfc_peek_ascii_char (); |
966 | if (peek == 'b' || peek == 'o' || peek =='z' || peek == 'x') | |
78019d16 SK |
967 | goto no_match; |
968 | ||
969 | ||
6de9cd9a DN |
970 | e = gfc_get_expr (); |
971 | ||
972 | e->expr_type = EXPR_CONSTANT; | |
973 | e->ref = NULL; | |
974 | e->ts.type = BT_CHARACTER; | |
975 | e->ts.kind = kind; | |
a8b3b0b6 CR |
976 | e->ts.is_c_interop = 0; |
977 | e->ts.is_iso_c = 0; | |
6de9cd9a DN |
978 | e->where = start_locus; |
979 | ||
00660189 | 980 | e->value.character.string = p = gfc_get_wide_string (length + 1); |
6de9cd9a DN |
981 | e->value.character.length = length; |
982 | ||
63645982 | 983 | gfc_current_locus = start_locus; |
6de9cd9a DN |
984 | gfc_next_char (); /* Skip delimiter */ |
985 | ||
1355d8e7 TB |
986 | /* We disable the warning for the following loop as the warning has already |
987 | been printed in the loop above. */ | |
988 | warn_ampersand = gfc_option.warn_ampersand; | |
989 | gfc_option.warn_ampersand = 0; | |
990 | ||
6de9cd9a | 991 | for (i = 0; i < length; i++) |
8fc541d3 FXC |
992 | { |
993 | c = next_string_char (delimiter, &ret); | |
994 | ||
d393bbd7 | 995 | if (!gfc_check_character_range (c, kind)) |
8fc541d3 | 996 | { |
d393bbd7 FXC |
997 | gfc_error ("Character '%s' in string at %C is not representable " |
998 | "in character kind %d", gfc_print_wide_char (c), kind); | |
8fc541d3 FXC |
999 | return MATCH_ERROR; |
1000 | } | |
1001 | ||
00660189 | 1002 | *p++ = c; |
8fc541d3 | 1003 | } |
6de9cd9a DN |
1004 | |
1005 | *p = '\0'; /* TODO: C-style string is for development/debug purposes. */ | |
1355d8e7 | 1006 | gfc_option.warn_ampersand = warn_ampersand; |
6de9cd9a | 1007 | |
8fc541d3 FXC |
1008 | next_string_char (delimiter, &ret); |
1009 | if (ret != -1) | |
6de9cd9a DN |
1010 | gfc_internal_error ("match_string_constant(): Delimiter not found"); |
1011 | ||
1012 | if (match_substring (NULL, 0, &e->ref) != MATCH_NO) | |
1013 | e->expr_type = EXPR_SUBSTRING; | |
1014 | ||
1015 | *result = e; | |
1016 | ||
1017 | return MATCH_YES; | |
1018 | ||
1019 | no_match: | |
63645982 | 1020 | gfc_current_locus = old_locus; |
6de9cd9a DN |
1021 | return MATCH_NO; |
1022 | } | |
1023 | ||
1024 | ||
500f8f7b RS |
1025 | /* Match a .true. or .false. Returns 1 if a .true. was found, |
1026 | 0 if a .false. was found, and -1 otherwise. */ | |
1027 | static int | |
1028 | match_logical_constant_string (void) | |
1029 | { | |
1030 | locus orig_loc = gfc_current_locus; | |
1031 | ||
1032 | gfc_gobble_whitespace (); | |
8fc541d3 | 1033 | if (gfc_next_ascii_char () == '.') |
500f8f7b | 1034 | { |
8fc541d3 | 1035 | char ch = gfc_next_ascii_char (); |
500f8f7b RS |
1036 | if (ch == 'f') |
1037 | { | |
8fc541d3 FXC |
1038 | if (gfc_next_ascii_char () == 'a' |
1039 | && gfc_next_ascii_char () == 'l' | |
1040 | && gfc_next_ascii_char () == 's' | |
1041 | && gfc_next_ascii_char () == 'e' | |
1042 | && gfc_next_ascii_char () == '.') | |
500f8f7b RS |
1043 | /* Matched ".false.". */ |
1044 | return 0; | |
1045 | } | |
1046 | else if (ch == 't') | |
1047 | { | |
8fc541d3 FXC |
1048 | if (gfc_next_ascii_char () == 'r' |
1049 | && gfc_next_ascii_char () == 'u' | |
1050 | && gfc_next_ascii_char () == 'e' | |
1051 | && gfc_next_ascii_char () == '.') | |
500f8f7b RS |
1052 | /* Matched ".true.". */ |
1053 | return 1; | |
1054 | } | |
1055 | } | |
1056 | gfc_current_locus = orig_loc; | |
1057 | return -1; | |
1058 | } | |
1059 | ||
6de9cd9a DN |
1060 | /* Match a .true. or .false. */ |
1061 | ||
1062 | static match | |
edf1eac2 | 1063 | match_logical_constant (gfc_expr **result) |
6de9cd9a | 1064 | { |
6de9cd9a DN |
1065 | gfc_expr *e; |
1066 | int i, kind; | |
1067 | ||
500f8f7b | 1068 | i = match_logical_constant_string (); |
6de9cd9a DN |
1069 | if (i == -1) |
1070 | return MATCH_NO; | |
1071 | ||
1072 | kind = get_kind (); | |
1073 | if (kind == -1) | |
1074 | return MATCH_ERROR; | |
1075 | if (kind == -2) | |
9d64df18 | 1076 | kind = gfc_default_logical_kind; |
6de9cd9a | 1077 | |
e7a2d5fb | 1078 | if (gfc_validate_kind (BT_LOGICAL, kind, true) < 0) |
eb62be44 SK |
1079 | { |
1080 | gfc_error ("Bad kind for logical constant at %C"); | |
1081 | return MATCH_ERROR; | |
1082 | } | |
6de9cd9a DN |
1083 | |
1084 | e = gfc_get_expr (); | |
1085 | ||
1086 | e->expr_type = EXPR_CONSTANT; | |
1087 | e->value.logical = i; | |
1088 | e->ts.type = BT_LOGICAL; | |
1089 | e->ts.kind = kind; | |
a8b3b0b6 CR |
1090 | e->ts.is_c_interop = 0; |
1091 | e->ts.is_iso_c = 0; | |
63645982 | 1092 | e->where = gfc_current_locus; |
6de9cd9a DN |
1093 | |
1094 | *result = e; | |
1095 | return MATCH_YES; | |
1096 | } | |
1097 | ||
1098 | ||
1099 | /* Match a real or imaginary part of a complex constant that is a | |
1100 | symbolic constant. */ | |
1101 | ||
1102 | static match | |
edf1eac2 | 1103 | match_sym_complex_part (gfc_expr **result) |
6de9cd9a DN |
1104 | { |
1105 | char name[GFC_MAX_SYMBOL_LEN + 1]; | |
1106 | gfc_symbol *sym; | |
1107 | gfc_expr *e; | |
1108 | match m; | |
1109 | ||
1110 | m = gfc_match_name (name); | |
1111 | if (m != MATCH_YES) | |
1112 | return m; | |
1113 | ||
1114 | if (gfc_find_symbol (name, NULL, 1, &sym) || sym == NULL) | |
1115 | return MATCH_NO; | |
1116 | ||
1117 | if (sym->attr.flavor != FL_PARAMETER) | |
1118 | { | |
1119 | gfc_error ("Expected PARAMETER symbol in complex constant at %C"); | |
1120 | return MATCH_ERROR; | |
1121 | } | |
1122 | ||
1123 | if (!gfc_numeric_ts (&sym->value->ts)) | |
1124 | { | |
1125 | gfc_error ("Numeric PARAMETER required in complex constant at %C"); | |
1126 | return MATCH_ERROR; | |
1127 | } | |
1128 | ||
1129 | if (sym->value->rank != 0) | |
1130 | { | |
1131 | gfc_error ("Scalar PARAMETER required in complex constant at %C"); | |
1132 | return MATCH_ERROR; | |
1133 | } | |
1134 | ||
e227ac57 FXC |
1135 | if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: PARAMETER symbol in " |
1136 | "complex constant at %C") == FAILURE) | |
1137 | return MATCH_ERROR; | |
1138 | ||
6de9cd9a DN |
1139 | switch (sym->value->ts.type) |
1140 | { | |
1141 | case BT_REAL: | |
1142 | e = gfc_copy_expr (sym->value); | |
1143 | break; | |
1144 | ||
1145 | case BT_COMPLEX: | |
1146 | e = gfc_complex2real (sym->value, sym->value->ts.kind); | |
1147 | if (e == NULL) | |
1148 | goto error; | |
1149 | break; | |
1150 | ||
1151 | case BT_INTEGER: | |
9d64df18 | 1152 | e = gfc_int2real (sym->value, gfc_default_real_kind); |
6de9cd9a DN |
1153 | if (e == NULL) |
1154 | goto error; | |
1155 | break; | |
1156 | ||
1157 | default: | |
1158 | gfc_internal_error ("gfc_match_sym_complex_part(): Bad type"); | |
1159 | } | |
1160 | ||
edf1eac2 | 1161 | *result = e; /* e is a scalar, real, constant expression. */ |
6de9cd9a DN |
1162 | return MATCH_YES; |
1163 | ||
1164 | error: | |
1165 | gfc_error ("Error converting PARAMETER constant in complex constant at %C"); | |
1166 | return MATCH_ERROR; | |
1167 | } | |
1168 | ||
1169 | ||
6de9cd9a DN |
1170 | /* Match a real or imaginary part of a complex number. */ |
1171 | ||
1172 | static match | |
edf1eac2 | 1173 | match_complex_part (gfc_expr **result) |
6de9cd9a DN |
1174 | { |
1175 | match m; | |
1176 | ||
1177 | m = match_sym_complex_part (result); | |
1178 | if (m != MATCH_NO) | |
1179 | return m; | |
1180 | ||
69029c61 PB |
1181 | m = match_real_constant (result, 1); |
1182 | if (m != MATCH_NO) | |
1183 | return m; | |
1184 | ||
1185 | return match_integer_constant (result, 1); | |
6de9cd9a DN |
1186 | } |
1187 | ||
1188 | ||
1189 | /* Try to match a complex constant. */ | |
1190 | ||
1191 | static match | |
edf1eac2 | 1192 | match_complex_constant (gfc_expr **result) |
6de9cd9a DN |
1193 | { |
1194 | gfc_expr *e, *real, *imag; | |
1195 | gfc_error_buf old_error; | |
1196 | gfc_typespec target; | |
1197 | locus old_loc; | |
1198 | int kind; | |
1199 | match m; | |
1200 | ||
63645982 | 1201 | old_loc = gfc_current_locus; |
6de9cd9a DN |
1202 | real = imag = e = NULL; |
1203 | ||
1204 | m = gfc_match_char ('('); | |
1205 | if (m != MATCH_YES) | |
1206 | return m; | |
1207 | ||
1208 | gfc_push_error (&old_error); | |
1209 | ||
1210 | m = match_complex_part (&real); | |
1211 | if (m == MATCH_NO) | |
d71b89ca JJ |
1212 | { |
1213 | gfc_free_error (&old_error); | |
1214 | goto cleanup; | |
1215 | } | |
6de9cd9a DN |
1216 | |
1217 | if (gfc_match_char (',') == MATCH_NO) | |
1218 | { | |
1219 | gfc_pop_error (&old_error); | |
1220 | m = MATCH_NO; | |
1221 | goto cleanup; | |
1222 | } | |
1223 | ||
1224 | /* If m is error, then something was wrong with the real part and we | |
1225 | assume we have a complex constant because we've seen the ','. An | |
1226 | ambiguous case here is the start of an iterator list of some | |
1227 | sort. These sort of lists are matched prior to coming here. */ | |
1228 | ||
1229 | if (m == MATCH_ERROR) | |
d71b89ca JJ |
1230 | { |
1231 | gfc_free_error (&old_error); | |
1232 | goto cleanup; | |
1233 | } | |
6de9cd9a DN |
1234 | gfc_pop_error (&old_error); |
1235 | ||
1236 | m = match_complex_part (&imag); | |
1237 | if (m == MATCH_NO) | |
1238 | goto syntax; | |
1239 | if (m == MATCH_ERROR) | |
1240 | goto cleanup; | |
1241 | ||
1242 | m = gfc_match_char (')'); | |
1243 | if (m == MATCH_NO) | |
87ebdf2f SK |
1244 | { |
1245 | /* Give the matcher for implied do-loops a chance to run. This | |
1246 | yields a much saner error message for (/ (i, 4=i, 6) /). */ | |
8fc541d3 | 1247 | if (gfc_peek_ascii_char () == '=') |
87ebdf2f SK |
1248 | { |
1249 | m = MATCH_ERROR; | |
1250 | goto cleanup; | |
1251 | } | |
1252 | else | |
6de9cd9a | 1253 | goto syntax; |
87ebdf2f | 1254 | } |
6de9cd9a DN |
1255 | |
1256 | if (m == MATCH_ERROR) | |
1257 | goto cleanup; | |
1258 | ||
1259 | /* Decide on the kind of this complex number. */ | |
69029c61 PB |
1260 | if (real->ts.type == BT_REAL) |
1261 | { | |
1262 | if (imag->ts.type == BT_REAL) | |
1263 | kind = gfc_kind_max (real, imag); | |
1264 | else | |
1265 | kind = real->ts.kind; | |
1266 | } | |
1267 | else | |
1268 | { | |
1269 | if (imag->ts.type == BT_REAL) | |
1270 | kind = imag->ts.kind; | |
1271 | else | |
1272 | kind = gfc_default_real_kind; | |
1273 | } | |
6de9cd9a DN |
1274 | target.type = BT_REAL; |
1275 | target.kind = kind; | |
a8b3b0b6 CR |
1276 | target.is_c_interop = 0; |
1277 | target.is_iso_c = 0; | |
6de9cd9a | 1278 | |
69029c61 | 1279 | if (real->ts.type != BT_REAL || kind != real->ts.kind) |
6de9cd9a | 1280 | gfc_convert_type (real, &target, 2); |
69029c61 | 1281 | if (imag->ts.type != BT_REAL || kind != imag->ts.kind) |
6de9cd9a DN |
1282 | gfc_convert_type (imag, &target, 2); |
1283 | ||
1284 | e = gfc_convert_complex (real, imag, kind); | |
63645982 | 1285 | e->where = gfc_current_locus; |
6de9cd9a DN |
1286 | |
1287 | gfc_free_expr (real); | |
1288 | gfc_free_expr (imag); | |
1289 | ||
1290 | *result = e; | |
1291 | return MATCH_YES; | |
1292 | ||
1293 | syntax: | |
1294 | gfc_error ("Syntax error in COMPLEX constant at %C"); | |
1295 | m = MATCH_ERROR; | |
1296 | ||
1297 | cleanup: | |
1298 | gfc_free_expr (e); | |
1299 | gfc_free_expr (real); | |
1300 | gfc_free_expr (imag); | |
63645982 | 1301 | gfc_current_locus = old_loc; |
6de9cd9a DN |
1302 | |
1303 | return m; | |
1304 | } | |
1305 | ||
1306 | ||
1307 | /* Match constants in any of several forms. Returns nonzero for a | |
1308 | match, zero for no match. */ | |
1309 | ||
1310 | match | |
edf1eac2 | 1311 | gfc_match_literal_constant (gfc_expr **result, int signflag) |
6de9cd9a DN |
1312 | { |
1313 | match m; | |
1314 | ||
1315 | m = match_complex_constant (result); | |
1316 | if (m != MATCH_NO) | |
1317 | return m; | |
1318 | ||
1319 | m = match_string_constant (result); | |
1320 | if (m != MATCH_NO) | |
1321 | return m; | |
1322 | ||
1323 | m = match_boz_constant (result); | |
1324 | if (m != MATCH_NO) | |
1325 | return m; | |
1326 | ||
1327 | m = match_real_constant (result, signflag); | |
1328 | if (m != MATCH_NO) | |
1329 | return m; | |
1330 | ||
d3642f89 FW |
1331 | m = match_hollerith_constant (result); |
1332 | if (m != MATCH_NO) | |
1333 | return m; | |
1334 | ||
6de9cd9a DN |
1335 | m = match_integer_constant (result, signflag); |
1336 | if (m != MATCH_NO) | |
1337 | return m; | |
1338 | ||
1339 | m = match_logical_constant (result); | |
1340 | if (m != MATCH_NO) | |
1341 | return m; | |
1342 | ||
1343 | return MATCH_NO; | |
1344 | } | |
1345 | ||
1346 | ||
1347 | /* Match a single actual argument value. An actual argument is | |
1348 | usually an expression, but can also be a procedure name. If the | |
1349 | argument is a single name, it is not always possible to tell | |
1350 | whether the name is a dummy procedure or not. We treat these cases | |
1351 | by creating an argument that looks like a dummy procedure and | |
1352 | fixing things later during resolution. */ | |
1353 | ||
1354 | static match | |
edf1eac2 | 1355 | match_actual_arg (gfc_expr **result) |
6de9cd9a DN |
1356 | { |
1357 | char name[GFC_MAX_SYMBOL_LEN + 1]; | |
1358 | gfc_symtree *symtree; | |
1359 | locus where, w; | |
1360 | gfc_expr *e; | |
8fc541d3 | 1361 | char c; |
6de9cd9a | 1362 | |
618f4f46 | 1363 | gfc_gobble_whitespace (); |
63645982 | 1364 | where = gfc_current_locus; |
6de9cd9a DN |
1365 | |
1366 | switch (gfc_match_name (name)) | |
1367 | { | |
1368 | case MATCH_ERROR: | |
1369 | return MATCH_ERROR; | |
1370 | ||
1371 | case MATCH_NO: | |
1372 | break; | |
1373 | ||
1374 | case MATCH_YES: | |
63645982 | 1375 | w = gfc_current_locus; |
6de9cd9a | 1376 | gfc_gobble_whitespace (); |
8fc541d3 | 1377 | c = gfc_next_ascii_char (); |
63645982 | 1378 | gfc_current_locus = w; |
6de9cd9a DN |
1379 | |
1380 | if (c != ',' && c != ')') | |
1381 | break; | |
1382 | ||
1383 | if (gfc_find_sym_tree (name, NULL, 1, &symtree)) | |
1384 | break; | |
1385 | /* Handle error elsewhere. */ | |
1386 | ||
1387 | /* Eliminate a couple of common cases where we know we don't | |
edf1eac2 | 1388 | have a function argument. */ |
6de9cd9a | 1389 | if (symtree == NULL) |
edf1eac2 | 1390 | { |
6de9cd9a | 1391 | gfc_get_sym_tree (name, NULL, &symtree); |
edf1eac2 SK |
1392 | gfc_set_sym_referenced (symtree->n.sym); |
1393 | } | |
6de9cd9a DN |
1394 | else |
1395 | { | |
edf1eac2 | 1396 | gfc_symbol *sym; |
6de9cd9a | 1397 | |
edf1eac2 SK |
1398 | sym = symtree->n.sym; |
1399 | gfc_set_sym_referenced (sym); | |
6de9cd9a DN |
1400 | if (sym->attr.flavor != FL_PROCEDURE |
1401 | && sym->attr.flavor != FL_UNKNOWN) | |
1402 | break; | |
1403 | ||
6f9c9d6d TB |
1404 | if (sym->attr.in_common && !sym->attr.proc_pointer) |
1405 | { | |
1406 | gfc_add_flavor (&sym->attr, FL_VARIABLE, sym->name, | |
1407 | &sym->declared_at); | |
1408 | break; | |
1409 | } | |
1410 | ||
6de9cd9a DN |
1411 | /* If the symbol is a function with itself as the result and |
1412 | is being defined, then we have a variable. */ | |
7a4ef45b JJ |
1413 | if (sym->attr.function && sym->result == sym) |
1414 | { | |
1415 | if (gfc_current_ns->proc_name == sym | |
6de9cd9a | 1416 | || (gfc_current_ns->parent != NULL |
7a4ef45b JJ |
1417 | && gfc_current_ns->parent->proc_name == sym)) |
1418 | break; | |
1419 | ||
1420 | if (sym->attr.entry | |
1421 | && (sym->ns == gfc_current_ns | |
1422 | || sym->ns == gfc_current_ns->parent)) | |
1423 | { | |
1424 | gfc_entry_list *el = NULL; | |
1425 | ||
1426 | for (el = sym->ns->entries; el; el = el->next) | |
1427 | if (sym == el->sym) | |
1428 | break; | |
1429 | ||
1430 | if (el) | |
1431 | break; | |
1432 | } | |
1433 | } | |
6de9cd9a DN |
1434 | } |
1435 | ||
1436 | e = gfc_get_expr (); /* Leave it unknown for now */ | |
1437 | e->symtree = symtree; | |
1438 | e->expr_type = EXPR_VARIABLE; | |
1439 | e->ts.type = BT_PROCEDURE; | |
1440 | e->where = where; | |
1441 | ||
1442 | *result = e; | |
1443 | return MATCH_YES; | |
1444 | } | |
1445 | ||
63645982 | 1446 | gfc_current_locus = where; |
6de9cd9a DN |
1447 | return gfc_match_expr (result); |
1448 | } | |
1449 | ||
1450 | ||
1451 | /* Match a keyword argument. */ | |
1452 | ||
1453 | static match | |
edf1eac2 | 1454 | match_keyword_arg (gfc_actual_arglist *actual, gfc_actual_arglist *base) |
6de9cd9a DN |
1455 | { |
1456 | char name[GFC_MAX_SYMBOL_LEN + 1]; | |
1457 | gfc_actual_arglist *a; | |
1458 | locus name_locus; | |
1459 | match m; | |
1460 | ||
63645982 | 1461 | name_locus = gfc_current_locus; |
6de9cd9a DN |
1462 | m = gfc_match_name (name); |
1463 | ||
1464 | if (m != MATCH_YES) | |
1465 | goto cleanup; | |
1466 | if (gfc_match_char ('=') != MATCH_YES) | |
1467 | { | |
1468 | m = MATCH_NO; | |
1469 | goto cleanup; | |
1470 | } | |
1471 | ||
1472 | m = match_actual_arg (&actual->expr); | |
1473 | if (m != MATCH_YES) | |
1474 | goto cleanup; | |
1475 | ||
1476 | /* Make sure this name has not appeared yet. */ | |
1477 | ||
1478 | if (name[0] != '\0') | |
1479 | { | |
1480 | for (a = base; a; a = a->next) | |
cb9e4f55 | 1481 | if (a->name != NULL && strcmp (a->name, name) == 0) |
6de9cd9a | 1482 | { |
edf1eac2 SK |
1483 | gfc_error ("Keyword '%s' at %C has already appeared in the " |
1484 | "current argument list", name); | |
6de9cd9a DN |
1485 | return MATCH_ERROR; |
1486 | } | |
1487 | } | |
1488 | ||
cb9e4f55 | 1489 | actual->name = gfc_get_string (name); |
6de9cd9a DN |
1490 | return MATCH_YES; |
1491 | ||
1492 | cleanup: | |
63645982 | 1493 | gfc_current_locus = name_locus; |
6de9cd9a DN |
1494 | return m; |
1495 | } | |
1496 | ||
1497 | ||
7fcafa71 PT |
1498 | /* Match an argument list function, such as %VAL. */ |
1499 | ||
1500 | static match | |
1501 | match_arg_list_function (gfc_actual_arglist *result) | |
1502 | { | |
1503 | char name[GFC_MAX_SYMBOL_LEN + 1]; | |
1504 | locus old_locus; | |
1505 | match m; | |
1506 | ||
1507 | old_locus = gfc_current_locus; | |
1508 | ||
1509 | if (gfc_match_char ('%') != MATCH_YES) | |
1510 | { | |
1511 | m = MATCH_NO; | |
1512 | goto cleanup; | |
1513 | } | |
1514 | ||
1515 | m = gfc_match ("%n (", name); | |
1516 | if (m != MATCH_YES) | |
1517 | goto cleanup; | |
1518 | ||
1519 | if (name[0] != '\0') | |
1520 | { | |
1521 | switch (name[0]) | |
1522 | { | |
1523 | case 'l': | |
edf1eac2 | 1524 | if (strncmp (name, "loc", 3) == 0) |
7fcafa71 PT |
1525 | { |
1526 | result->name = "%LOC"; | |
1527 | break; | |
1528 | } | |
1529 | case 'r': | |
edf1eac2 | 1530 | if (strncmp (name, "ref", 3) == 0) |
7fcafa71 PT |
1531 | { |
1532 | result->name = "%REF"; | |
1533 | break; | |
1534 | } | |
1535 | case 'v': | |
edf1eac2 | 1536 | if (strncmp (name, "val", 3) == 0) |
7fcafa71 PT |
1537 | { |
1538 | result->name = "%VAL"; | |
1539 | break; | |
1540 | } | |
1541 | default: | |
1542 | m = MATCH_ERROR; | |
1543 | goto cleanup; | |
1544 | } | |
1545 | } | |
1546 | ||
1547 | if (gfc_notify_std (GFC_STD_GNU, "Extension: argument list " | |
1548 | "function at %C") == FAILURE) | |
1549 | { | |
1550 | m = MATCH_ERROR; | |
1551 | goto cleanup; | |
1552 | } | |
1553 | ||
1554 | m = match_actual_arg (&result->expr); | |
1555 | if (m != MATCH_YES) | |
1556 | goto cleanup; | |
1557 | ||
1558 | if (gfc_match_char (')') != MATCH_YES) | |
1559 | { | |
1560 | m = MATCH_NO; | |
1561 | goto cleanup; | |
1562 | } | |
1563 | ||
1564 | return MATCH_YES; | |
1565 | ||
1566 | cleanup: | |
1567 | gfc_current_locus = old_locus; | |
1568 | return m; | |
1569 | } | |
1570 | ||
1571 | ||
6de9cd9a DN |
1572 | /* Matches an actual argument list of a function or subroutine, from |
1573 | the opening parenthesis to the closing parenthesis. The argument | |
1574 | list is assumed to allow keyword arguments because we don't know if | |
1575 | the symbol associated with the procedure has an implicit interface | |
ed5ee445 | 1576 | or not. We make sure keywords are unique. If sub_flag is set, |
d3fcc995 | 1577 | we're matching the argument list of a subroutine. */ |
6de9cd9a DN |
1578 | |
1579 | match | |
edf1eac2 | 1580 | gfc_match_actual_arglist (int sub_flag, gfc_actual_arglist **argp) |
6de9cd9a DN |
1581 | { |
1582 | gfc_actual_arglist *head, *tail; | |
1583 | int seen_keyword; | |
1584 | gfc_st_label *label; | |
1585 | locus old_loc; | |
1586 | match m; | |
1587 | ||
1588 | *argp = tail = NULL; | |
63645982 | 1589 | old_loc = gfc_current_locus; |
6de9cd9a DN |
1590 | |
1591 | seen_keyword = 0; | |
1592 | ||
1593 | if (gfc_match_char ('(') == MATCH_NO) | |
1594 | return (sub_flag) ? MATCH_YES : MATCH_NO; | |
1595 | ||
1596 | if (gfc_match_char (')') == MATCH_YES) | |
1597 | return MATCH_YES; | |
1598 | head = NULL; | |
1599 | ||
1600 | for (;;) | |
1601 | { | |
1602 | if (head == NULL) | |
1603 | head = tail = gfc_get_actual_arglist (); | |
1604 | else | |
1605 | { | |
1606 | tail->next = gfc_get_actual_arglist (); | |
1607 | tail = tail->next; | |
1608 | } | |
1609 | ||
1610 | if (sub_flag && gfc_match_char ('*') == MATCH_YES) | |
1611 | { | |
a34a91f0 | 1612 | m = gfc_match_st_label (&label); |
6de9cd9a DN |
1613 | if (m == MATCH_NO) |
1614 | gfc_error ("Expected alternate return label at %C"); | |
1615 | if (m != MATCH_YES) | |
1616 | goto cleanup; | |
1617 | ||
1618 | tail->label = label; | |
1619 | goto next; | |
1620 | } | |
1621 | ||
1622 | /* After the first keyword argument is seen, the following | |
edf1eac2 | 1623 | arguments must also have keywords. */ |
6de9cd9a DN |
1624 | if (seen_keyword) |
1625 | { | |
1626 | m = match_keyword_arg (tail, head); | |
1627 | ||
1628 | if (m == MATCH_ERROR) | |
1629 | goto cleanup; | |
1630 | if (m == MATCH_NO) | |
1631 | { | |
edf1eac2 | 1632 | gfc_error ("Missing keyword name in actual argument list at %C"); |
6de9cd9a DN |
1633 | goto cleanup; |
1634 | } | |
1635 | ||
1636 | } | |
1637 | else | |
1638 | { | |
7fcafa71 PT |
1639 | /* Try an argument list function, like %VAL. */ |
1640 | m = match_arg_list_function (tail); | |
6de9cd9a DN |
1641 | if (m == MATCH_ERROR) |
1642 | goto cleanup; | |
1643 | ||
7fcafa71 PT |
1644 | /* See if we have the first keyword argument. */ |
1645 | if (m == MATCH_NO) | |
1646 | { | |
1647 | m = match_keyword_arg (tail, head); | |
1648 | if (m == MATCH_YES) | |
1649 | seen_keyword = 1; | |
1650 | if (m == MATCH_ERROR) | |
1651 | goto cleanup; | |
1652 | } | |
1653 | ||
6de9cd9a DN |
1654 | if (m == MATCH_NO) |
1655 | { | |
1656 | /* Try for a non-keyword argument. */ | |
1657 | m = match_actual_arg (&tail->expr); | |
1658 | if (m == MATCH_ERROR) | |
1659 | goto cleanup; | |
1660 | if (m == MATCH_NO) | |
1661 | goto syntax; | |
1662 | } | |
1663 | } | |
1664 | ||
7fcafa71 | 1665 | |
6de9cd9a DN |
1666 | next: |
1667 | if (gfc_match_char (')') == MATCH_YES) | |
1668 | break; | |
1669 | if (gfc_match_char (',') != MATCH_YES) | |
1670 | goto syntax; | |
1671 | } | |
1672 | ||
1673 | *argp = head; | |
1674 | return MATCH_YES; | |
1675 | ||
1676 | syntax: | |
1677 | gfc_error ("Syntax error in argument list at %C"); | |
1678 | ||
1679 | cleanup: | |
1680 | gfc_free_actual_arglist (head); | |
63645982 | 1681 | gfc_current_locus = old_loc; |
6de9cd9a DN |
1682 | |
1683 | return MATCH_ERROR; | |
1684 | } | |
1685 | ||
1686 | ||
8e1f752a | 1687 | /* Used by gfc_match_varspec() to extend the reference list by one |
6de9cd9a DN |
1688 | element. */ |
1689 | ||
1690 | static gfc_ref * | |
edf1eac2 | 1691 | extend_ref (gfc_expr *primary, gfc_ref *tail) |
6de9cd9a | 1692 | { |
6de9cd9a DN |
1693 | if (primary->ref == NULL) |
1694 | primary->ref = tail = gfc_get_ref (); | |
1695 | else | |
1696 | { | |
1697 | if (tail == NULL) | |
1698 | gfc_internal_error ("extend_ref(): Bad tail"); | |
1699 | tail->next = gfc_get_ref (); | |
1700 | tail = tail->next; | |
1701 | } | |
1702 | ||
1703 | return tail; | |
1704 | } | |
1705 | ||
1706 | ||
1707 | /* Match any additional specifications associated with the current | |
1708 | variable like member references or substrings. If equiv_flag is | |
1709 | set we only match stuff that is allowed inside an EQUIVALENCE | |
8e1f752a DK |
1710 | statement. sub_flag tells whether we expect a type-bound procedure found |
1711 | to be a subroutine as part of CALL or a FUNCTION. */ | |
6de9cd9a | 1712 | |
8e1f752a DK |
1713 | match |
1714 | gfc_match_varspec (gfc_expr *primary, int equiv_flag, bool sub_flag) | |
6de9cd9a DN |
1715 | { |
1716 | char name[GFC_MAX_SYMBOL_LEN + 1]; | |
1717 | gfc_ref *substring, *tail; | |
1718 | gfc_component *component; | |
a8006d09 | 1719 | gfc_symbol *sym = primary->symtree->n.sym; |
6de9cd9a | 1720 | match m; |
f2d3cb25 | 1721 | bool unknown; |
6de9cd9a DN |
1722 | |
1723 | tail = NULL; | |
1724 | ||
3c721513 | 1725 | gfc_gobble_whitespace (); |
8fc541d3 | 1726 | if ((equiv_flag && gfc_peek_ascii_char () == '(') || sym->attr.dimension) |
6de9cd9a | 1727 | { |
a8006d09 JJ |
1728 | /* In EQUIVALENCE, we don't know yet whether we are seeing |
1729 | an array, character variable or array of character | |
edf1eac2 | 1730 | variables. We'll leave the decision till resolve time. */ |
6de9cd9a DN |
1731 | tail = extend_ref (primary, tail); |
1732 | tail->type = REF_ARRAY; | |
1733 | ||
a8006d09 JJ |
1734 | m = gfc_match_array_ref (&tail->u.ar, equiv_flag ? NULL : sym->as, |
1735 | equiv_flag); | |
6de9cd9a DN |
1736 | if (m != MATCH_YES) |
1737 | return m; | |
a8006d09 | 1738 | |
3c721513 | 1739 | gfc_gobble_whitespace (); |
8fc541d3 | 1740 | if (equiv_flag && gfc_peek_ascii_char () == '(') |
a8006d09 JJ |
1741 | { |
1742 | tail = extend_ref (primary, tail); | |
1743 | tail->type = REF_ARRAY; | |
1744 | ||
1745 | m = gfc_match_array_ref (&tail->u.ar, NULL, equiv_flag); | |
1746 | if (m != MATCH_YES) | |
1747 | return m; | |
1748 | } | |
6de9cd9a DN |
1749 | } |
1750 | ||
6de9cd9a DN |
1751 | primary->ts = sym->ts; |
1752 | ||
a8006d09 JJ |
1753 | if (equiv_flag) |
1754 | return MATCH_YES; | |
1755 | ||
ebac6d9c DK |
1756 | if (sym->ts.type == BT_UNKNOWN && gfc_peek_ascii_char () == '%' |
1757 | && gfc_get_default_type (sym, sym->ns)->type == BT_DERIVED) | |
1758 | gfc_set_default_type (sym, 0, sym->ns); | |
1759 | ||
6de9cd9a DN |
1760 | if (sym->ts.type != BT_DERIVED || gfc_match_char ('%') != MATCH_YES) |
1761 | goto check_substring; | |
1762 | ||
1763 | sym = sym->ts.derived; | |
1764 | ||
1765 | for (;;) | |
1766 | { | |
8e1f752a | 1767 | gfc_try t; |
e157f736 | 1768 | gfc_symtree *tbp; |
8e1f752a | 1769 | |
6de9cd9a DN |
1770 | m = gfc_match_name (name); |
1771 | if (m == MATCH_NO) | |
1772 | gfc_error ("Expected structure component name at %C"); | |
1773 | if (m != MATCH_YES) | |
1774 | return MATCH_ERROR; | |
1775 | ||
8e1f752a DK |
1776 | tbp = gfc_find_typebound_proc (sym, &t, name, false); |
1777 | if (tbp) | |
1778 | { | |
1779 | gfc_symbol* tbp_sym; | |
1780 | ||
1781 | if (t == FAILURE) | |
1782 | return MATCH_ERROR; | |
1783 | ||
1784 | gcc_assert (!tail || !tail->next); | |
1785 | gcc_assert (primary->expr_type == EXPR_VARIABLE); | |
1786 | ||
e157f736 DK |
1787 | if (tbp->typebound->is_generic) |
1788 | tbp_sym = NULL; | |
1789 | else | |
1790 | tbp_sym = tbp->typebound->u.specific->n.sym; | |
8e1f752a DK |
1791 | |
1792 | primary->expr_type = EXPR_COMPCALL; | |
e157f736 | 1793 | primary->value.compcall.tbp = tbp->typebound; |
e157f736 DK |
1794 | primary->value.compcall.name = tbp->name; |
1795 | gcc_assert (primary->symtree->n.sym->attr.referenced); | |
1796 | if (tbp_sym) | |
1797 | primary->ts = tbp_sym->ts; | |
1798 | ||
1799 | m = gfc_match_actual_arglist (tbp->typebound->subroutine, | |
8e1f752a DK |
1800 | &primary->value.compcall.actual); |
1801 | if (m == MATCH_ERROR) | |
1802 | return MATCH_ERROR; | |
1803 | if (m == MATCH_NO) | |
1804 | { | |
1805 | if (sub_flag) | |
1806 | primary->value.compcall.actual = NULL; | |
1807 | else | |
1808 | { | |
1809 | gfc_error ("Expected argument list at %C"); | |
1810 | return MATCH_ERROR; | |
1811 | } | |
1812 | } | |
1813 | ||
e157f736 | 1814 | gfc_set_sym_referenced (tbp->n.sym); |
8e1f752a DK |
1815 | |
1816 | break; | |
1817 | } | |
1818 | ||
9d1210f4 | 1819 | component = gfc_find_component (sym, name, false, false); |
6de9cd9a DN |
1820 | if (component == NULL) |
1821 | return MATCH_ERROR; | |
1822 | ||
1823 | tail = extend_ref (primary, tail); | |
1824 | tail->type = REF_COMPONENT; | |
1825 | ||
1826 | tail->u.c.component = component; | |
1827 | tail->u.c.sym = sym; | |
1828 | ||
1829 | primary->ts = component->ts; | |
1830 | ||
1831 | if (component->as != NULL) | |
1832 | { | |
1833 | tail = extend_ref (primary, tail); | |
1834 | tail->type = REF_ARRAY; | |
1835 | ||
1836 | m = gfc_match_array_ref (&tail->u.ar, component->as, equiv_flag); | |
1837 | if (m != MATCH_YES) | |
1838 | return m; | |
1839 | } | |
1840 | ||
1841 | if (component->ts.type != BT_DERIVED | |
1842 | || gfc_match_char ('%') != MATCH_YES) | |
1843 | break; | |
1844 | ||
1845 | sym = component->ts.derived; | |
1846 | } | |
1847 | ||
1848 | check_substring: | |
f2d3cb25 | 1849 | unknown = false; |
c040ffff TS |
1850 | if (primary->ts.type == BT_UNKNOWN) |
1851 | { | |
1852 | if (gfc_get_default_type (sym, sym->ns)->type == BT_CHARACTER) | |
1853 | { | |
edf1eac2 SK |
1854 | gfc_set_default_type (sym, 0, sym->ns); |
1855 | primary->ts = sym->ts; | |
f2d3cb25 | 1856 | unknown = true; |
c040ffff TS |
1857 | } |
1858 | } | |
1859 | ||
6de9cd9a DN |
1860 | if (primary->ts.type == BT_CHARACTER) |
1861 | { | |
1862 | switch (match_substring (primary->ts.cl, equiv_flag, &substring)) | |
1863 | { | |
1864 | case MATCH_YES: | |
1865 | if (tail == NULL) | |
1866 | primary->ref = substring; | |
1867 | else | |
1868 | tail->next = substring; | |
1869 | ||
1870 | if (primary->expr_type == EXPR_CONSTANT) | |
1871 | primary->expr_type = EXPR_SUBSTRING; | |
1872 | ||
860c8f3b PB |
1873 | if (substring) |
1874 | primary->ts.cl = NULL; | |
1875 | ||
6de9cd9a DN |
1876 | break; |
1877 | ||
1878 | case MATCH_NO: | |
f2d3cb25 | 1879 | if (unknown) |
858f1fa2 DK |
1880 | { |
1881 | gfc_clear_ts (&primary->ts); | |
1882 | gfc_clear_ts (&sym->ts); | |
1883 | } | |
6de9cd9a DN |
1884 | break; |
1885 | ||
1886 | case MATCH_ERROR: | |
1887 | return MATCH_ERROR; | |
1888 | } | |
1889 | } | |
1890 | ||
1891 | return MATCH_YES; | |
1892 | } | |
1893 | ||
1894 | ||
1895 | /* Given an expression that is a variable, figure out what the | |
1896 | ultimate variable's type and attribute is, traversing the reference | |
1897 | structures if necessary. | |
1898 | ||
1899 | This subroutine is trickier than it looks. We start at the base | |
1900 | symbol and store the attribute. Component references load a | |
1901 | completely new attribute. | |
1902 | ||
1903 | A couple of rules come into play. Subobjects of targets are always | |
1904 | targets themselves. If we see a component that goes through a | |
1905 | pointer, then the expression must also be a target, since the | |
1906 | pointer is associated with something (if it isn't core will soon be | |
1907 | dumped). If we see a full part or section of an array, the | |
1908 | expression is also an array. | |
1909 | ||
f7b529fa | 1910 | We can have at most one full array reference. */ |
6de9cd9a DN |
1911 | |
1912 | symbol_attribute | |
edf1eac2 | 1913 | gfc_variable_attr (gfc_expr *expr, gfc_typespec *ts) |
6de9cd9a | 1914 | { |
5046aff5 | 1915 | int dimension, pointer, allocatable, target; |
6de9cd9a DN |
1916 | symbol_attribute attr; |
1917 | gfc_ref *ref; | |
1918 | ||
1919 | if (expr->expr_type != EXPR_VARIABLE) | |
1920 | gfc_internal_error ("gfc_variable_attr(): Expression isn't a variable"); | |
1921 | ||
1922 | ref = expr->ref; | |
1923 | attr = expr->symtree->n.sym->attr; | |
1924 | ||
1925 | dimension = attr.dimension; | |
1926 | pointer = attr.pointer; | |
5046aff5 | 1927 | allocatable = attr.allocatable; |
6de9cd9a DN |
1928 | |
1929 | target = attr.target; | |
1930 | if (pointer) | |
1931 | target = 1; | |
1932 | ||
1933 | if (ts != NULL && expr->ts.type == BT_UNKNOWN) | |
1934 | *ts = expr->symtree->n.sym->ts; | |
1935 | ||
1936 | for (; ref; ref = ref->next) | |
1937 | switch (ref->type) | |
1938 | { | |
1939 | case REF_ARRAY: | |
1940 | ||
1941 | switch (ref->u.ar.type) | |
1942 | { | |
1943 | case AR_FULL: | |
1944 | dimension = 1; | |
1945 | break; | |
1946 | ||
1947 | case AR_SECTION: | |
5046aff5 | 1948 | allocatable = pointer = 0; |
6de9cd9a DN |
1949 | dimension = 1; |
1950 | break; | |
1951 | ||
1952 | case AR_ELEMENT: | |
5046aff5 | 1953 | allocatable = pointer = 0; |
6de9cd9a DN |
1954 | break; |
1955 | ||
1956 | case AR_UNKNOWN: | |
1957 | gfc_internal_error ("gfc_variable_attr(): Bad array reference"); | |
1958 | } | |
1959 | ||
1960 | break; | |
1961 | ||
1962 | case REF_COMPONENT: | |
d4b7d0f0 | 1963 | attr = ref->u.c.component->attr; |
6de9cd9a | 1964 | if (ts != NULL) |
e8a25349 TS |
1965 | { |
1966 | *ts = ref->u.c.component->ts; | |
1967 | /* Don't set the string length if a substring reference | |
1968 | follows. */ | |
1969 | if (ts->type == BT_CHARACTER | |
1970 | && ref->next && ref->next->type == REF_SUBSTRING) | |
1971 | ts->cl = NULL; | |
1972 | } | |
6de9cd9a | 1973 | |
d4b7d0f0 JW |
1974 | pointer = ref->u.c.component->attr.pointer; |
1975 | allocatable = ref->u.c.component->attr.allocatable; | |
6de9cd9a DN |
1976 | if (pointer) |
1977 | target = 1; | |
1978 | ||
1979 | break; | |
1980 | ||
1981 | case REF_SUBSTRING: | |
5046aff5 | 1982 | allocatable = pointer = 0; |
6de9cd9a DN |
1983 | break; |
1984 | } | |
1985 | ||
1986 | attr.dimension = dimension; | |
1987 | attr.pointer = pointer; | |
5046aff5 | 1988 | attr.allocatable = allocatable; |
6de9cd9a DN |
1989 | attr.target = target; |
1990 | ||
1991 | return attr; | |
1992 | } | |
1993 | ||
1994 | ||
1995 | /* Return the attribute from a general expression. */ | |
1996 | ||
1997 | symbol_attribute | |
edf1eac2 | 1998 | gfc_expr_attr (gfc_expr *e) |
6de9cd9a DN |
1999 | { |
2000 | symbol_attribute attr; | |
2001 | ||
2002 | switch (e->expr_type) | |
2003 | { | |
2004 | case EXPR_VARIABLE: | |
2005 | attr = gfc_variable_attr (e, NULL); | |
2006 | break; | |
2007 | ||
2008 | case EXPR_FUNCTION: | |
2009 | gfc_clear_attr (&attr); | |
2010 | ||
2011 | if (e->value.function.esym != NULL) | |
2012 | attr = e->value.function.esym->result->attr; | |
2013 | ||
2014 | /* TODO: NULL() returns pointers. May have to take care of this | |
edf1eac2 | 2015 | here. */ |
6de9cd9a DN |
2016 | |
2017 | break; | |
2018 | ||
2019 | default: | |
2020 | gfc_clear_attr (&attr); | |
2021 | break; | |
2022 | } | |
2023 | ||
2024 | return attr; | |
2025 | } | |
2026 | ||
2027 | ||
2028 | /* Match a structure constructor. The initial symbol has already been | |
2029 | seen. */ | |
2030 | ||
fa9290d3 DK |
2031 | typedef struct gfc_structure_ctor_component |
2032 | { | |
2033 | char* name; | |
2034 | gfc_expr* val; | |
2035 | locus where; | |
2036 | struct gfc_structure_ctor_component* next; | |
2037 | } | |
2038 | gfc_structure_ctor_component; | |
2039 | ||
ece3f663 | 2040 | #define gfc_get_structure_ctor_component() XCNEW (gfc_structure_ctor_component) |
fa9290d3 DK |
2041 | |
2042 | static void | |
2043 | gfc_free_structure_ctor_component (gfc_structure_ctor_component *comp) | |
2044 | { | |
2045 | gfc_free (comp->name); | |
2046 | gfc_free_expr (comp->val); | |
2047 | } | |
2048 | ||
7d1f1e61 PT |
2049 | |
2050 | /* Translate the component list into the actual constructor by sorting it in | |
2051 | the order required; this also checks along the way that each and every | |
2052 | component actually has an initializer and handles default initializers | |
2053 | for components without explicit value given. */ | |
2054 | static gfc_try | |
2055 | build_actual_constructor (gfc_structure_ctor_component **comp_head, | |
2056 | gfc_constructor **ctor_head, gfc_symbol *sym) | |
6de9cd9a | 2057 | { |
fa9290d3 | 2058 | gfc_structure_ctor_component *comp_iter; |
7d1f1e61 PT |
2059 | gfc_constructor *ctor_tail = NULL; |
2060 | gfc_component *comp; | |
2061 | ||
2062 | for (comp = sym->components; comp; comp = comp->next) | |
2063 | { | |
2064 | gfc_structure_ctor_component **next_ptr; | |
2065 | gfc_expr *value = NULL; | |
2066 | ||
2067 | /* Try to find the initializer for the current component by name. */ | |
2068 | next_ptr = comp_head; | |
2069 | for (comp_iter = *comp_head; comp_iter; comp_iter = comp_iter->next) | |
2070 | { | |
2071 | if (!strcmp (comp_iter->name, comp->name)) | |
2072 | break; | |
2073 | next_ptr = &comp_iter->next; | |
2074 | } | |
2075 | ||
2076 | /* If an extension, try building the parent derived type by building | |
2077 | a value expression for the parent derived type and calling self. */ | |
2078 | if (!comp_iter && comp == sym->components && sym->attr.extension) | |
2079 | { | |
2080 | value = gfc_get_expr (); | |
2081 | value->expr_type = EXPR_STRUCTURE; | |
2082 | value->value.constructor = NULL; | |
2083 | value->ts = comp->ts; | |
2084 | value->where = gfc_current_locus; | |
2085 | ||
2086 | if (build_actual_constructor (comp_head, &value->value.constructor, | |
2087 | comp->ts.derived) == FAILURE) | |
2088 | { | |
2089 | gfc_free_expr (value); | |
2090 | return FAILURE; | |
2091 | } | |
2092 | *ctor_head = ctor_tail = gfc_get_constructor (); | |
2093 | ctor_tail->expr = value; | |
2094 | continue; | |
2095 | } | |
2096 | ||
2097 | /* If it was not found, try the default initializer if there's any; | |
2098 | otherwise, it's an error. */ | |
2099 | if (!comp_iter) | |
2100 | { | |
2101 | if (comp->initializer) | |
2102 | { | |
2103 | if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: Structure" | |
2104 | " constructor with missing optional arguments" | |
2105 | " at %C") == FAILURE) | |
2106 | return FAILURE; | |
2107 | value = gfc_copy_expr (comp->initializer); | |
2108 | } | |
2109 | else | |
2110 | { | |
2111 | gfc_error ("No initializer for component '%s' given in the" | |
2112 | " structure constructor at %C!", comp->name); | |
2113 | return FAILURE; | |
2114 | } | |
2115 | } | |
2116 | else | |
2117 | value = comp_iter->val; | |
2118 | ||
2119 | /* Add the value to the constructor chain built. */ | |
2120 | if (ctor_tail) | |
2121 | { | |
2122 | ctor_tail->next = gfc_get_constructor (); | |
2123 | ctor_tail = ctor_tail->next; | |
2124 | } | |
2125 | else | |
2126 | *ctor_head = ctor_tail = gfc_get_constructor (); | |
2127 | gcc_assert (value); | |
2128 | ctor_tail->expr = value; | |
2129 | ||
2130 | /* Remove the entry from the component list. We don't want the expression | |
2131 | value to be free'd, so set it to NULL. */ | |
2132 | if (comp_iter) | |
2133 | { | |
2134 | *next_ptr = comp_iter->next; | |
2135 | comp_iter->val = NULL; | |
2136 | gfc_free_structure_ctor_component (comp_iter); | |
2137 | } | |
2138 | } | |
2139 | return SUCCESS; | |
2140 | } | |
2141 | ||
2142 | match | |
52f49934 DK |
2143 | gfc_match_structure_constructor (gfc_symbol *sym, gfc_expr **result, |
2144 | bool parent) | |
7d1f1e61 PT |
2145 | { |
2146 | gfc_structure_ctor_component *comp_tail, *comp_head, *comp_iter; | |
fa9290d3 DK |
2147 | gfc_constructor *ctor_head, *ctor_tail; |
2148 | gfc_component *comp; /* Is set NULL when named component is first seen */ | |
6de9cd9a DN |
2149 | gfc_expr *e; |
2150 | locus where; | |
2151 | match m; | |
fa9290d3 | 2152 | const char* last_name = NULL; |
6de9cd9a | 2153 | |
7d1f1e61 | 2154 | comp_tail = comp_head = NULL; |
fa9290d3 | 2155 | ctor_head = ctor_tail = NULL; |
6de9cd9a | 2156 | |
7d1f1e61 | 2157 | if (!parent && gfc_match_char ('(') != MATCH_YES) |
6de9cd9a DN |
2158 | goto syntax; |
2159 | ||
63645982 | 2160 | where = gfc_current_locus; |
6de9cd9a | 2161 | |
9d1210f4 | 2162 | gfc_find_component (sym, NULL, false, true); |
6de9cd9a | 2163 | |
52f49934 DK |
2164 | /* Check that we're not about to construct an ABSTRACT type. */ |
2165 | if (!parent && sym->attr.abstract) | |
2166 | { | |
2167 | gfc_error ("Can't construct ABSTRACT type '%s' at %C", sym->name); | |
2168 | return MATCH_ERROR; | |
2169 | } | |
2170 | ||
fa9290d3 DK |
2171 | /* Match the component list and store it in a list together with the |
2172 | corresponding component names. Check for empty argument list first. */ | |
2173 | if (gfc_match_char (')') != MATCH_YES) | |
6de9cd9a | 2174 | { |
fa9290d3 DK |
2175 | comp = sym->components; |
2176 | do | |
2eae3dc7 | 2177 | { |
fa9290d3 | 2178 | gfc_component *this_comp = NULL; |
6de9cd9a | 2179 | |
fa9290d3 DK |
2180 | if (!comp_head) |
2181 | comp_tail = comp_head = gfc_get_structure_ctor_component (); | |
2182 | else | |
2183 | { | |
2184 | comp_tail->next = gfc_get_structure_ctor_component (); | |
2185 | comp_tail = comp_tail->next; | |
2186 | } | |
ece3f663 | 2187 | comp_tail->name = XCNEWVEC (char, GFC_MAX_SYMBOL_LEN + 1); |
fa9290d3 DK |
2188 | comp_tail->val = NULL; |
2189 | comp_tail->where = gfc_current_locus; | |
6de9cd9a | 2190 | |
fa9290d3 DK |
2191 | /* Try matching a component name. */ |
2192 | if (gfc_match_name (comp_tail->name) == MATCH_YES | |
2193 | && gfc_match_char ('=') == MATCH_YES) | |
2194 | { | |
2195 | if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: Structure" | |
2196 | " constructor with named arguments at %C") | |
2197 | == FAILURE) | |
2198 | goto cleanup; | |
2199 | ||
2200 | last_name = comp_tail->name; | |
2201 | comp = NULL; | |
2202 | } | |
2203 | else | |
2204 | { | |
2205 | /* Components without name are not allowed after the first named | |
2206 | component initializer! */ | |
2207 | if (!comp) | |
2208 | { | |
2209 | if (last_name) | |
2210 | gfc_error ("Component initializer without name after" | |
2211 | " component named %s at %C!", last_name); | |
7d1f1e61 | 2212 | else if (!parent) |
fa9290d3 DK |
2213 | gfc_error ("Too many components in structure constructor at" |
2214 | " %C!"); | |
2215 | goto cleanup; | |
2216 | } | |
2217 | ||
2218 | gfc_current_locus = comp_tail->where; | |
2219 | strncpy (comp_tail->name, comp->name, GFC_MAX_SYMBOL_LEN + 1); | |
2220 | } | |
2221 | ||
9d1210f4 DK |
2222 | /* Find the current component in the structure definition and check |
2223 | its access is not private. */ | |
fa9290d3 | 2224 | if (comp) |
9d1210f4 | 2225 | this_comp = gfc_find_component (sym, comp->name, false, false); |
fa9290d3 DK |
2226 | else |
2227 | { | |
9d1210f4 DK |
2228 | this_comp = gfc_find_component (sym, |
2229 | (const char *)comp_tail->name, | |
2230 | false, false); | |
fa9290d3 | 2231 | comp = NULL; /* Reset needed! */ |
fa9290d3 | 2232 | } |
fa9290d3 | 2233 | |
7d1f1e61 PT |
2234 | /* Here we can check if a component name is given which does not |
2235 | correspond to any component of the defined structure. */ | |
2236 | if (!this_comp) | |
2237 | goto cleanup; | |
6de9cd9a | 2238 | |
fa9290d3 DK |
2239 | /* Check if this component is already given a value. */ |
2240 | for (comp_iter = comp_head; comp_iter != comp_tail; | |
2241 | comp_iter = comp_iter->next) | |
2242 | { | |
2243 | gcc_assert (comp_iter); | |
2244 | if (!strcmp (comp_iter->name, comp_tail->name)) | |
2245 | { | |
2246 | gfc_error ("Component '%s' is initialized twice in the" | |
2247 | " structure constructor at %C!", comp_tail->name); | |
2248 | goto cleanup; | |
2249 | } | |
2250 | } | |
2251 | ||
2252 | /* Match the current initializer expression. */ | |
2253 | m = gfc_match_expr (&comp_tail->val); | |
2254 | if (m == MATCH_NO) | |
2255 | goto syntax; | |
2256 | if (m == MATCH_ERROR) | |
2257 | goto cleanup; | |
2258 | ||
7d1f1e61 PT |
2259 | /* If not explicitly a parent constructor, gather up the components |
2260 | and build one. */ | |
2261 | if (comp && comp == sym->components | |
2262 | && sym->attr.extension | |
2263 | && (comp_tail->val->ts.type != BT_DERIVED | |
2264 | || | |
2265 | comp_tail->val->ts.derived != this_comp->ts.derived)) | |
2266 | { | |
2267 | gfc_current_locus = where; | |
2268 | gfc_free_expr (comp_tail->val); | |
52f49934 | 2269 | comp_tail->val = NULL; |
6de9cd9a | 2270 | |
7d1f1e61 PT |
2271 | m = gfc_match_structure_constructor (comp->ts.derived, |
2272 | &comp_tail->val, true); | |
2273 | if (m == MATCH_NO) | |
2274 | goto syntax; | |
2275 | if (m == MATCH_ERROR) | |
2276 | goto cleanup; | |
2277 | } | |
6de9cd9a | 2278 | |
7d1f1e61 PT |
2279 | if (comp) |
2280 | comp = comp->next; | |
2eae3dc7 | 2281 | |
7d1f1e61 | 2282 | if (parent && !comp) |
fa9290d3 | 2283 | break; |
fa9290d3 | 2284 | } |
fa9290d3 | 2285 | |
7d1f1e61 | 2286 | while (gfc_match_char (',') == MATCH_YES); |
fa9290d3 | 2287 | |
7d1f1e61 PT |
2288 | if (!parent && gfc_match_char (')') != MATCH_YES) |
2289 | goto syntax; | |
6de9cd9a DN |
2290 | } |
2291 | ||
7d1f1e61 PT |
2292 | if (build_actual_constructor (&comp_head, &ctor_head, sym) == FAILURE) |
2293 | goto cleanup; | |
2294 | ||
fa9290d3 DK |
2295 | /* No component should be left, as this should have caused an error in the |
2296 | loop constructing the component-list (name that does not correspond to any | |
2297 | component in the structure definition). */ | |
7d1f1e61 PT |
2298 | if (comp_head && sym->attr.extension) |
2299 | { | |
2300 | for (comp_iter = comp_head; comp_iter; comp_iter = comp_iter->next) | |
2301 | { | |
2302 | gfc_error ("component '%s' at %L has already been set by a " | |
2303 | "parent derived type constructor", comp_iter->name, | |
2304 | &comp_iter->where); | |
2305 | } | |
2306 | goto cleanup; | |
2307 | } | |
2308 | else | |
2309 | gcc_assert (!comp_head); | |
fa9290d3 | 2310 | |
6de9cd9a DN |
2311 | e = gfc_get_expr (); |
2312 | ||
2313 | e->expr_type = EXPR_STRUCTURE; | |
2314 | ||
2315 | e->ts.type = BT_DERIVED; | |
2316 | e->ts.derived = sym; | |
2317 | e->where = where; | |
2318 | ||
fa9290d3 | 2319 | e->value.constructor = ctor_head; |
6de9cd9a DN |
2320 | |
2321 | *result = e; | |
2322 | return MATCH_YES; | |
2323 | ||
2324 | syntax: | |
2325 | gfc_error ("Syntax error in structure constructor at %C"); | |
2326 | ||
2327 | cleanup: | |
fa9290d3 DK |
2328 | for (comp_iter = comp_head; comp_iter; ) |
2329 | { | |
2330 | gfc_structure_ctor_component *next = comp_iter->next; | |
2331 | gfc_free_structure_ctor_component (comp_iter); | |
2332 | comp_iter = next; | |
2333 | } | |
2334 | gfc_free_constructor (ctor_head); | |
6de9cd9a DN |
2335 | return MATCH_ERROR; |
2336 | } | |
2337 | ||
2338 | ||
9a3db5a3 PT |
2339 | /* If the symbol is an implicit do loop index and implicitly typed, |
2340 | it should not be host associated. Provide a symtree from the | |
2341 | current namespace. */ | |
2342 | static match | |
2343 | check_for_implicit_index (gfc_symtree **st, gfc_symbol **sym) | |
2344 | { | |
2345 | if ((*sym)->attr.flavor == FL_VARIABLE | |
2346 | && (*sym)->ns != gfc_current_ns | |
2347 | && (*sym)->attr.implied_index | |
2348 | && (*sym)->attr.implicit_type | |
2349 | && !(*sym)->attr.use_assoc) | |
2350 | { | |
2351 | int i; | |
2352 | i = gfc_get_sym_tree ((*sym)->name, NULL, st); | |
2353 | if (i) | |
2354 | return MATCH_ERROR; | |
2355 | *sym = (*st)->n.sym; | |
2356 | } | |
2357 | return MATCH_YES; | |
2358 | } | |
2359 | ||
2360 | ||
6de9cd9a DN |
2361 | /* Matches a variable name followed by anything that might follow it-- |
2362 | array reference, argument list of a function, etc. */ | |
2363 | ||
2364 | match | |
edf1eac2 | 2365 | gfc_match_rvalue (gfc_expr **result) |
6de9cd9a DN |
2366 | { |
2367 | gfc_actual_arglist *actual_arglist; | |
d3fcc995 | 2368 | char name[GFC_MAX_SYMBOL_LEN + 1], argname[GFC_MAX_SYMBOL_LEN + 1]; |
6de9cd9a DN |
2369 | gfc_state_data *st; |
2370 | gfc_symbol *sym; | |
2371 | gfc_symtree *symtree; | |
d3fcc995 | 2372 | locus where, old_loc; |
6de9cd9a | 2373 | gfc_expr *e; |
d3fcc995 | 2374 | match m, m2; |
6de9cd9a | 2375 | int i; |
5270c302 AL |
2376 | gfc_typespec *ts; |
2377 | bool implicit_char; | |
a99288e5 | 2378 | gfc_ref *ref; |
6de9cd9a DN |
2379 | |
2380 | m = gfc_match_name (name); | |
2381 | if (m != MATCH_YES) | |
2382 | return m; | |
2383 | ||
2a6dcee5 TB |
2384 | if (gfc_find_state (COMP_INTERFACE) == SUCCESS |
2385 | && !gfc_current_ns->has_import_set) | |
6de9cd9a DN |
2386 | i = gfc_get_sym_tree (name, NULL, &symtree); |
2387 | else | |
2388 | i = gfc_get_ha_sym_tree (name, &symtree); | |
2389 | ||
2390 | if (i) | |
2391 | return MATCH_ERROR; | |
2392 | ||
2393 | sym = symtree->n.sym; | |
2394 | e = NULL; | |
63645982 | 2395 | where = gfc_current_locus; |
6de9cd9a | 2396 | |
9a3db5a3 PT |
2397 | /* If this is an implicit do loop index and implicitly typed, |
2398 | it should not be host associated. */ | |
2399 | m = check_for_implicit_index (&symtree, &sym); | |
2400 | if (m != MATCH_YES) | |
2401 | return m; | |
2402 | ||
6de9cd9a | 2403 | gfc_set_sym_referenced (sym); |
9a3db5a3 | 2404 | sym->attr.implied_index = 0; |
6de9cd9a | 2405 | |
0921bc44 JJ |
2406 | if (sym->attr.function && sym->result == sym) |
2407 | { | |
811849c0 PT |
2408 | /* See if this is a directly recursive function call. */ |
2409 | gfc_gobble_whitespace (); | |
2410 | if (sym->attr.recursive | |
8fc541d3 | 2411 | && gfc_peek_ascii_char () == '(' |
fc2d8680 PT |
2412 | && gfc_current_ns->proc_name == sym |
2413 | && !sym->attr.dimension) | |
811849c0 | 2414 | { |
fc2d8680 PT |
2415 | gfc_error ("'%s' at %C is the name of a recursive function " |
2416 | "and so refers to the result variable. Use an " | |
2417 | "explicit RESULT variable for direct recursion " | |
2418 | "(12.5.2.1)", sym->name); | |
811849c0 PT |
2419 | return MATCH_ERROR; |
2420 | } | |
fc2d8680 | 2421 | |
0921bc44 | 2422 | if (gfc_current_ns->proc_name == sym |
6de9cd9a | 2423 | || (gfc_current_ns->parent != NULL |
0921bc44 JJ |
2424 | && gfc_current_ns->parent->proc_name == sym)) |
2425 | goto variable; | |
2426 | ||
2427 | if (sym->attr.entry | |
2428 | && (sym->ns == gfc_current_ns | |
2429 | || sym->ns == gfc_current_ns->parent)) | |
2430 | { | |
2431 | gfc_entry_list *el = NULL; | |
2432 | ||
2433 | for (el = sym->ns->entries; el; el = el->next) | |
2434 | if (sym == el->sym) | |
2435 | goto variable; | |
2436 | } | |
2437 | } | |
6de9cd9a | 2438 | |
8fb74da4 JW |
2439 | if (gfc_matching_procptr_assignment) |
2440 | goto procptr0; | |
2441 | ||
6de9cd9a DN |
2442 | if (sym->attr.function || sym->attr.external || sym->attr.intrinsic) |
2443 | goto function0; | |
2444 | ||
2445 | if (sym->attr.generic) | |
2446 | goto generic_function; | |
2447 | ||
2448 | switch (sym->attr.flavor) | |
2449 | { | |
2450 | case FL_VARIABLE: | |
2451 | variable: | |
6de9cd9a DN |
2452 | e = gfc_get_expr (); |
2453 | ||
2454 | e->expr_type = EXPR_VARIABLE; | |
2455 | e->symtree = symtree; | |
2456 | ||
8e1f752a | 2457 | m = gfc_match_varspec (e, 0, false); |
6de9cd9a DN |
2458 | break; |
2459 | ||
2460 | case FL_PARAMETER: | |
b7263e8f EE |
2461 | /* A statement of the form "REAL, parameter :: a(0:10) = 1" will |
2462 | end up here. Unfortunately, sym->value->expr_type is set to | |
2463 | EXPR_CONSTANT, and so the if () branch would be followed without | |
2464 | the !sym->as check. */ | |
2465 | if (sym->value && sym->value->expr_type != EXPR_ARRAY && !sym->as) | |
6de9cd9a DN |
2466 | e = gfc_copy_expr (sym->value); |
2467 | else | |
2468 | { | |
2469 | e = gfc_get_expr (); | |
2470 | e->expr_type = EXPR_VARIABLE; | |
2471 | } | |
2472 | ||
2473 | e->symtree = symtree; | |
8e1f752a | 2474 | m = gfc_match_varspec (e, 0, false); |
a99288e5 PT |
2475 | |
2476 | if (sym->ts.is_c_interop || sym->ts.is_iso_c) | |
2477 | break; | |
2478 | ||
927171bf PT |
2479 | /* Variable array references to derived type parameters cause |
2480 | all sorts of headaches in simplification. Treating such | |
2481 | expressions as variable works just fine for all array | |
2482 | references. */ | |
2483 | if (sym->value && sym->ts.type == BT_DERIVED && e->ref) | |
a99288e5 PT |
2484 | { |
2485 | for (ref = e->ref; ref; ref = ref->next) | |
2486 | if (ref->type == REF_ARRAY) | |
2487 | break; | |
2488 | ||
927171bf | 2489 | if (ref == NULL || ref->u.ar.type == AR_FULL) |
a99288e5 PT |
2490 | break; |
2491 | ||
2492 | ref = e->ref; | |
2493 | e->ref = NULL; | |
2494 | gfc_free_expr (e); | |
2495 | e = gfc_get_expr (); | |
2496 | e->expr_type = EXPR_VARIABLE; | |
2497 | e->symtree = symtree; | |
2498 | e->ref = ref; | |
a99288e5 PT |
2499 | } |
2500 | ||
6de9cd9a DN |
2501 | break; |
2502 | ||
2503 | case FL_DERIVED: | |
2504 | sym = gfc_use_derived (sym); | |
2505 | if (sym == NULL) | |
2506 | m = MATCH_ERROR; | |
2507 | else | |
7d1f1e61 | 2508 | m = gfc_match_structure_constructor (sym, &e, false); |
6de9cd9a DN |
2509 | break; |
2510 | ||
2511 | /* If we're here, then the name is known to be the name of a | |
2512 | procedure, yet it is not sure to be the name of a function. */ | |
2513 | case FL_PROCEDURE: | |
8fb74da4 JW |
2514 | |
2515 | /* Procedure Pointer Assignments. */ | |
2516 | procptr0: | |
2517 | if (gfc_matching_procptr_assignment) | |
2518 | { | |
2519 | gfc_gobble_whitespace (); | |
726d8566 | 2520 | if (gfc_peek_ascii_char () == '(') |
8fb74da4 JW |
2521 | /* Parse functions returning a procptr. */ |
2522 | goto function0; | |
2523 | ||
c3005b0f DK |
2524 | if (gfc_is_intrinsic (sym, 0, gfc_current_locus) |
2525 | || gfc_is_intrinsic (sym, 1, gfc_current_locus)) | |
8fb74da4 JW |
2526 | sym->attr.intrinsic = 1; |
2527 | e = gfc_get_expr (); | |
2528 | e->expr_type = EXPR_VARIABLE; | |
2529 | e->symtree = symtree; | |
8e1f752a | 2530 | m = gfc_match_varspec (e, 0, false); |
8fb74da4 JW |
2531 | break; |
2532 | } | |
2533 | ||
6de9cd9a DN |
2534 | if (sym->attr.subroutine) |
2535 | { | |
2536 | gfc_error ("Unexpected use of subroutine name '%s' at %C", | |
2537 | sym->name); | |
2538 | m = MATCH_ERROR; | |
2539 | break; | |
2540 | } | |
2541 | ||
2542 | /* At this point, the name has to be a non-statement function. | |
edf1eac2 SK |
2543 | If the name is the same as the current function being |
2544 | compiled, then we have a variable reference (to the function | |
2545 | result) if the name is non-recursive. */ | |
6de9cd9a DN |
2546 | |
2547 | st = gfc_enclosing_unit (NULL); | |
2548 | ||
2549 | if (st != NULL && st->state == COMP_FUNCTION | |
2550 | && st->sym == sym | |
2551 | && !sym->attr.recursive) | |
2552 | { | |
2553 | e = gfc_get_expr (); | |
2554 | e->symtree = symtree; | |
2555 | e->expr_type = EXPR_VARIABLE; | |
2556 | ||
8e1f752a | 2557 | m = gfc_match_varspec (e, 0, false); |
6de9cd9a DN |
2558 | break; |
2559 | } | |
2560 | ||
2561 | /* Match a function reference. */ | |
2562 | function0: | |
2563 | m = gfc_match_actual_arglist (0, &actual_arglist); | |
2564 | if (m == MATCH_NO) | |
2565 | { | |
2566 | if (sym->attr.proc == PROC_ST_FUNCTION) | |
2567 | gfc_error ("Statement function '%s' requires argument list at %C", | |
2568 | sym->name); | |
2569 | else | |
2570 | gfc_error ("Function '%s' requires an argument list at %C", | |
2571 | sym->name); | |
2572 | ||
2573 | m = MATCH_ERROR; | |
2574 | break; | |
2575 | } | |
2576 | ||
2577 | if (m != MATCH_YES) | |
2578 | { | |
2579 | m = MATCH_ERROR; | |
2580 | break; | |
2581 | } | |
2582 | ||
2583 | gfc_get_ha_sym_tree (name, &symtree); /* Can't fail */ | |
2584 | sym = symtree->n.sym; | |
2585 | ||
2586 | e = gfc_get_expr (); | |
2587 | e->symtree = symtree; | |
2588 | e->expr_type = EXPR_FUNCTION; | |
2589 | e->value.function.actual = actual_arglist; | |
63645982 | 2590 | e->where = gfc_current_locus; |
6de9cd9a DN |
2591 | |
2592 | if (sym->as != NULL) | |
2593 | e->rank = sym->as->rank; | |
2594 | ||
2595 | if (!sym->attr.function | |
231b2fcc | 2596 | && gfc_add_function (&sym->attr, sym->name, NULL) == FAILURE) |
6de9cd9a DN |
2597 | { |
2598 | m = MATCH_ERROR; | |
2599 | break; | |
2600 | } | |
2601 | ||
a8b3b0b6 CR |
2602 | /* Check here for the existence of at least one argument for the |
2603 | iso_c_binding functions C_LOC, C_FUNLOC, and C_ASSOCIATED. The | |
2604 | argument(s) given will be checked in gfc_iso_c_func_interface, | |
2605 | during resolution of the function call. */ | |
2606 | if (sym->attr.is_iso_c == 1 | |
2607 | && (sym->from_intmod == INTMOD_ISO_C_BINDING | |
2608 | && (sym->intmod_sym_id == ISOCBINDING_LOC | |
2609 | || sym->intmod_sym_id == ISOCBINDING_FUNLOC | |
2610 | || sym->intmod_sym_id == ISOCBINDING_ASSOCIATED))) | |
2611 | { | |
2612 | /* make sure we were given a param */ | |
2613 | if (actual_arglist == NULL) | |
2614 | { | |
2615 | gfc_error ("Missing argument to '%s' at %C", sym->name); | |
2616 | m = MATCH_ERROR; | |
2617 | break; | |
2618 | } | |
2619 | } | |
2620 | ||
6de9cd9a DN |
2621 | if (sym->result == NULL) |
2622 | sym->result = sym; | |
2623 | ||
2624 | m = MATCH_YES; | |
2625 | break; | |
2626 | ||
2627 | case FL_UNKNOWN: | |
2628 | ||
2629 | /* Special case for derived type variables that get their types | |
edf1eac2 SK |
2630 | via an IMPLICIT statement. This can't wait for the |
2631 | resolution phase. */ | |
6de9cd9a | 2632 | |
8fc541d3 | 2633 | if (gfc_peek_ascii_char () == '%' |
0dd973dd | 2634 | && sym->ts.type == BT_UNKNOWN |
6de9cd9a DN |
2635 | && gfc_get_default_type (sym, sym->ns)->type == BT_DERIVED) |
2636 | gfc_set_default_type (sym, 0, sym->ns); | |
2637 | ||
2638 | /* If the symbol has a dimension attribute, the expression is a | |
edf1eac2 | 2639 | variable. */ |
6de9cd9a DN |
2640 | |
2641 | if (sym->attr.dimension) | |
2642 | { | |
231b2fcc TS |
2643 | if (gfc_add_flavor (&sym->attr, FL_VARIABLE, |
2644 | sym->name, NULL) == FAILURE) | |
6de9cd9a DN |
2645 | { |
2646 | m = MATCH_ERROR; | |
2647 | break; | |
2648 | } | |
2649 | ||
2650 | e = gfc_get_expr (); | |
2651 | e->symtree = symtree; | |
2652 | e->expr_type = EXPR_VARIABLE; | |
8e1f752a | 2653 | m = gfc_match_varspec (e, 0, false); |
6de9cd9a DN |
2654 | break; |
2655 | } | |
2656 | ||
2657 | /* Name is not an array, so we peek to see if a '(' implies a | |
edf1eac2 SK |
2658 | function call or a substring reference. Otherwise the |
2659 | variable is just a scalar. */ | |
6de9cd9a DN |
2660 | |
2661 | gfc_gobble_whitespace (); | |
8fc541d3 | 2662 | if (gfc_peek_ascii_char () != '(') |
6de9cd9a DN |
2663 | { |
2664 | /* Assume a scalar variable */ | |
2665 | e = gfc_get_expr (); | |
2666 | e->symtree = symtree; | |
2667 | e->expr_type = EXPR_VARIABLE; | |
2668 | ||
231b2fcc TS |
2669 | if (gfc_add_flavor (&sym->attr, FL_VARIABLE, |
2670 | sym->name, NULL) == FAILURE) | |
6de9cd9a DN |
2671 | { |
2672 | m = MATCH_ERROR; | |
2673 | break; | |
2674 | } | |
2675 | ||
8e1f752a | 2676 | /*FIXME:??? gfc_match_varspec does set this for us: */ |
6de9cd9a | 2677 | e->ts = sym->ts; |
8e1f752a | 2678 | m = gfc_match_varspec (e, 0, false); |
6de9cd9a DN |
2679 | break; |
2680 | } | |
2681 | ||
d3fcc995 TS |
2682 | /* See if this is a function reference with a keyword argument |
2683 | as first argument. We do this because otherwise a spurious | |
2684 | symbol would end up in the symbol table. */ | |
2685 | ||
2686 | old_loc = gfc_current_locus; | |
2687 | m2 = gfc_match (" ( %n =", argname); | |
2688 | gfc_current_locus = old_loc; | |
6de9cd9a DN |
2689 | |
2690 | e = gfc_get_expr (); | |
2691 | e->symtree = symtree; | |
2692 | ||
d3fcc995 | 2693 | if (m2 != MATCH_YES) |
6de9cd9a | 2694 | { |
5270c302 AL |
2695 | /* Try to figure out whether we're dealing with a character type. |
2696 | We're peeking ahead here, because we don't want to call | |
2697 | match_substring if we're dealing with an implicitly typed | |
2698 | non-character variable. */ | |
2699 | implicit_char = false; | |
2700 | if (sym->ts.type == BT_UNKNOWN) | |
2701 | { | |
2702 | ts = gfc_get_default_type (sym,NULL); | |
2703 | if (ts->type == BT_CHARACTER) | |
2704 | implicit_char = true; | |
2705 | } | |
2706 | ||
d3fcc995 TS |
2707 | /* See if this could possibly be a substring reference of a name |
2708 | that we're not sure is a variable yet. */ | |
6de9cd9a | 2709 | |
5270c302 | 2710 | if ((implicit_char || sym->ts.type == BT_CHARACTER) |
d3fcc995 | 2711 | && match_substring (sym->ts.cl, 0, &e->ref) == MATCH_YES) |
6de9cd9a | 2712 | { |
6de9cd9a | 2713 | |
d3fcc995 TS |
2714 | e->expr_type = EXPR_VARIABLE; |
2715 | ||
2716 | if (sym->attr.flavor != FL_VARIABLE | |
231b2fcc TS |
2717 | && gfc_add_flavor (&sym->attr, FL_VARIABLE, |
2718 | sym->name, NULL) == FAILURE) | |
d3fcc995 TS |
2719 | { |
2720 | m = MATCH_ERROR; | |
2721 | break; | |
2722 | } | |
2723 | ||
2724 | if (sym->ts.type == BT_UNKNOWN | |
2725 | && gfc_set_default_type (sym, 1, NULL) == FAILURE) | |
2726 | { | |
2727 | m = MATCH_ERROR; | |
2728 | break; | |
2729 | } | |
2730 | ||
2731 | e->ts = sym->ts; | |
860c8f3b PB |
2732 | if (e->ref) |
2733 | e->ts.cl = NULL; | |
d3fcc995 | 2734 | m = MATCH_YES; |
6de9cd9a DN |
2735 | break; |
2736 | } | |
6de9cd9a DN |
2737 | } |
2738 | ||
2739 | /* Give up, assume we have a function. */ | |
2740 | ||
2741 | gfc_get_sym_tree (name, NULL, &symtree); /* Can't fail */ | |
2742 | sym = symtree->n.sym; | |
2743 | e->expr_type = EXPR_FUNCTION; | |
2744 | ||
2745 | if (!sym->attr.function | |
231b2fcc | 2746 | && gfc_add_function (&sym->attr, sym->name, NULL) == FAILURE) |
6de9cd9a DN |
2747 | { |
2748 | m = MATCH_ERROR; | |
2749 | break; | |
2750 | } | |
2751 | ||
2752 | sym->result = sym; | |
2753 | ||
2754 | m = gfc_match_actual_arglist (0, &e->value.function.actual); | |
2755 | if (m == MATCH_NO) | |
2756 | gfc_error ("Missing argument list in function '%s' at %C", sym->name); | |
2757 | ||
2758 | if (m != MATCH_YES) | |
2759 | { | |
2760 | m = MATCH_ERROR; | |
2761 | break; | |
2762 | } | |
2763 | ||
2764 | /* If our new function returns a character, array or structure | |
edf1eac2 | 2765 | type, it might have subsequent references. */ |
6de9cd9a | 2766 | |
8e1f752a | 2767 | m = gfc_match_varspec (e, 0, false); |
6de9cd9a DN |
2768 | if (m == MATCH_NO) |
2769 | m = MATCH_YES; | |
2770 | ||
2771 | break; | |
2772 | ||
2773 | generic_function: | |
2774 | gfc_get_sym_tree (name, NULL, &symtree); /* Can't fail */ | |
2775 | ||
2776 | e = gfc_get_expr (); | |
2777 | e->symtree = symtree; | |
2778 | e->expr_type = EXPR_FUNCTION; | |
2779 | ||
2780 | m = gfc_match_actual_arglist (0, &e->value.function.actual); | |
2781 | break; | |
2782 | ||
2783 | default: | |
2784 | gfc_error ("Symbol at %C is not appropriate for an expression"); | |
2785 | return MATCH_ERROR; | |
2786 | } | |
2787 | ||
2788 | if (m == MATCH_YES) | |
2789 | { | |
2790 | e->where = where; | |
2791 | *result = e; | |
2792 | } | |
2793 | else | |
2794 | gfc_free_expr (e); | |
2795 | ||
2796 | return m; | |
2797 | } | |
2798 | ||
2799 | ||
df2fba9e | 2800 | /* Match a variable, i.e. something that can be assigned to. This |
6de9cd9a DN |
2801 | starts as a symbol, can be a structure component or an array |
2802 | reference. It can be a function if the function doesn't have a | |
2803 | separate RESULT variable. If the symbol has not been previously | |
30aabb86 | 2804 | seen, we assume it is a variable. |
6de9cd9a | 2805 | |
30aabb86 PT |
2806 | This function is called by two interface functions: |
2807 | gfc_match_variable, which has host_flag = 1, and | |
2808 | gfc_match_equiv_variable, with host_flag = 0, to restrict the | |
2809 | match of the symbol to the local scope. */ | |
2810 | ||
2811 | static match | |
edf1eac2 | 2812 | match_variable (gfc_expr **result, int equiv_flag, int host_flag) |
6de9cd9a DN |
2813 | { |
2814 | gfc_symbol *sym; | |
2815 | gfc_symtree *st; | |
2816 | gfc_expr *expr; | |
2817 | locus where; | |
2818 | match m; | |
2819 | ||
fd2aa7ad PT |
2820 | /* Since nothing has any business being an lvalue in a module |
2821 | specification block, an interface block or a contains section, | |
2822 | we force the changed_symbols mechanism to work by setting | |
2823 | host_flag to 0. This prevents valid symbols that have the name | |
2824 | of keywords, such as 'end', being turned into variables by | |
df2fba9e | 2825 | failed matching to assignments for, e.g., END INTERFACE. */ |
fd2aa7ad PT |
2826 | if (gfc_current_state () == COMP_MODULE |
2827 | || gfc_current_state () == COMP_INTERFACE | |
2828 | || gfc_current_state () == COMP_CONTAINS) | |
2829 | host_flag = 0; | |
2830 | ||
618f4f46 | 2831 | where = gfc_current_locus; |
30aabb86 | 2832 | m = gfc_match_sym_tree (&st, host_flag); |
6de9cd9a DN |
2833 | if (m != MATCH_YES) |
2834 | return m; | |
6de9cd9a DN |
2835 | |
2836 | sym = st->n.sym; | |
9a3db5a3 PT |
2837 | |
2838 | /* If this is an implicit do loop index and implicitly typed, | |
2839 | it should not be host associated. */ | |
2840 | m = check_for_implicit_index (&st, &sym); | |
2841 | if (m != MATCH_YES) | |
2842 | return m; | |
2843 | ||
2844 | sym->attr.implied_index = 0; | |
2845 | ||
6de9cd9a DN |
2846 | gfc_set_sym_referenced (sym); |
2847 | switch (sym->attr.flavor) | |
2848 | { | |
2849 | case FL_VARIABLE: | |
9aa433c2 | 2850 | if (sym->attr.is_protected && sym->attr.use_assoc) |
edf1eac2 | 2851 | { |
ee7e677f | 2852 | gfc_error ("Assigning to PROTECTED variable at %C"); |
edf1eac2 SK |
2853 | return MATCH_ERROR; |
2854 | } | |
6de9cd9a DN |
2855 | break; |
2856 | ||
2857 | case FL_UNKNOWN: | |
d7e2fcd0 TB |
2858 | { |
2859 | sym_flavor flavor = FL_UNKNOWN; | |
2860 | ||
2861 | gfc_gobble_whitespace (); | |
2862 | ||
2863 | if (sym->attr.external || sym->attr.procedure | |
2864 | || sym->attr.function || sym->attr.subroutine) | |
2865 | flavor = FL_PROCEDURE; | |
b9332b09 PT |
2866 | |
2867 | /* If it is not a procedure, is not typed and is host associated, | |
2868 | we cannot give it a flavor yet. */ | |
2869 | else if (sym->ns == gfc_current_ns->parent | |
2870 | && sym->ts.type == BT_UNKNOWN) | |
2871 | break; | |
2872 | ||
2873 | /* These are definitive indicators that this is a variable. */ | |
8fc541d3 | 2874 | else if (gfc_peek_ascii_char () != '(' || sym->ts.type != BT_UNKNOWN |
d7e2fcd0 TB |
2875 | || sym->attr.pointer || sym->as != NULL) |
2876 | flavor = FL_VARIABLE; | |
2877 | ||
2878 | if (flavor != FL_UNKNOWN | |
2879 | && gfc_add_flavor (&sym->attr, flavor, sym->name, NULL) == FAILURE) | |
2880 | return MATCH_ERROR; | |
2881 | } | |
6de9cd9a DN |
2882 | break; |
2883 | ||
5056a350 SK |
2884 | case FL_PARAMETER: |
2885 | if (equiv_flag) | |
2886 | gfc_error ("Named constant at %C in an EQUIVALENCE"); | |
2887 | else | |
2888 | gfc_error ("Cannot assign to a named constant at %C"); | |
2889 | return MATCH_ERROR; | |
2890 | break; | |
2891 | ||
6de9cd9a | 2892 | case FL_PROCEDURE: |
01d2a7d7 DF |
2893 | /* Check for a nonrecursive function result variable. */ |
2894 | if (sym->attr.function | |
2895 | && !sym->attr.external | |
2896 | && sym->result == sym | |
2897 | && ((sym == gfc_current_ns->proc_name | |
2898 | && sym == gfc_current_ns->proc_name->result) | |
2899 | || (gfc_current_ns->parent | |
2900 | && sym == gfc_current_ns->parent->proc_name->result) | |
2901 | || (sym->attr.entry | |
2902 | && sym->ns == gfc_current_ns) | |
2903 | || (sym->attr.entry | |
2904 | && sym->ns == gfc_current_ns->parent))) | |
6de9cd9a | 2905 | { |
6de9cd9a DN |
2906 | /* If a function result is a derived type, then the derived |
2907 | type may still have to be resolved. */ | |
2908 | ||
2909 | if (sym->ts.type == BT_DERIVED | |
2910 | && gfc_use_derived (sym->ts.derived) == NULL) | |
2911 | return MATCH_ERROR; | |
6de9cd9a DN |
2912 | break; |
2913 | } | |
2914 | ||
8fb74da4 JW |
2915 | if (sym->attr.proc_pointer) |
2916 | break; | |
2917 | ||
6de9cd9a DN |
2918 | /* Fall through to error */ |
2919 | ||
2920 | default: | |
d7e2fcd0 | 2921 | gfc_error ("'%s' at %C is not a variable", sym->name); |
6de9cd9a DN |
2922 | return MATCH_ERROR; |
2923 | } | |
2924 | ||
0dd973dd PB |
2925 | /* Special case for derived type variables that get their types |
2926 | via an IMPLICIT statement. This can't wait for the | |
2927 | resolution phase. */ | |
2928 | ||
2929 | { | |
2930 | gfc_namespace * implicit_ns; | |
2931 | ||
2932 | if (gfc_current_ns->proc_name == sym) | |
2933 | implicit_ns = gfc_current_ns; | |
2934 | else | |
2935 | implicit_ns = sym->ns; | |
2936 | ||
8fc541d3 | 2937 | if (gfc_peek_ascii_char () == '%' |
0dd973dd PB |
2938 | && sym->ts.type == BT_UNKNOWN |
2939 | && gfc_get_default_type (sym, implicit_ns)->type == BT_DERIVED) | |
2940 | gfc_set_default_type (sym, 0, implicit_ns); | |
2941 | } | |
2942 | ||
6de9cd9a DN |
2943 | expr = gfc_get_expr (); |
2944 | ||
2945 | expr->expr_type = EXPR_VARIABLE; | |
2946 | expr->symtree = st; | |
2947 | expr->ts = sym->ts; | |
2948 | expr->where = where; | |
2949 | ||
2950 | /* Now see if we have to do more. */ | |
8e1f752a | 2951 | m = gfc_match_varspec (expr, equiv_flag, false); |
6de9cd9a DN |
2952 | if (m != MATCH_YES) |
2953 | { | |
2954 | gfc_free_expr (expr); | |
2955 | return m; | |
2956 | } | |
2957 | ||
2958 | *result = expr; | |
2959 | return MATCH_YES; | |
2960 | } | |
30aabb86 | 2961 | |
edf1eac2 | 2962 | |
30aabb86 | 2963 | match |
edf1eac2 | 2964 | gfc_match_variable (gfc_expr **result, int equiv_flag) |
30aabb86 PT |
2965 | { |
2966 | return match_variable (result, equiv_flag, 1); | |
2967 | } | |
2968 | ||
edf1eac2 | 2969 | |
30aabb86 | 2970 | match |
edf1eac2 | 2971 | gfc_match_equiv_variable (gfc_expr **result) |
30aabb86 PT |
2972 | { |
2973 | return match_variable (result, 1, 0); | |
2974 | } | |
2975 |