]> git.ipfire.org Git - thirdparty/gcc.git/blame - gcc/fortran/primary.c
Convert ChangeLog files to UTF-8.
[thirdparty/gcc.git] / gcc / fortran / primary.c
CommitLineData
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 6This file is part of GCC.
6de9cd9a 7
d1d61a00
TS
8GCC is free software; you can redistribute it and/or modify it under
9the terms of the GNU General Public License as published by the Free
d234d788 10Software Foundation; either version 3, or (at your option) any later
d1d61a00 11version.
6de9cd9a 12
d1d61a00
TS
13GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14WARRANTY; without even the implied warranty of MERCHANTABILITY or
15FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16for more details.
6de9cd9a
DN
17
18You should have received a copy of the GNU General Public License
d234d788
NC
19along 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
35static match
36match_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
79static int
80get_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
99int
100gfc_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
135static int
136match_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
183static match
edf1eac2 184match_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
236static match
edf1eac2 237match_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
306cleanup:
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
318static match
edf1eac2 319match_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
451backup:
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
460static match
edf1eac2 461match_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
553done:
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
642cleanup:
643 gfc_free_expr (e);
644 return MATCH_ERROR;
645}
646
647
648/* Match a substring reference. */
649
650static match
edf1eac2 651match_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
722syntax:
723 gfc_error ("Syntax error in SUBSTRING specification at %C");
724 m = MATCH_ERROR;
725
726cleanup:
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
745static gfc_char_t
746next_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
798static match
799match_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
851static match
edf1eac2 852match_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
939got_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
1019no_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. */
1027static int
1028match_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
1062static match
edf1eac2 1063match_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
1102static match
edf1eac2 1103match_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
1164error:
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
1172static match
edf1eac2 1173match_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
1191static match
edf1eac2 1192match_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
1293syntax:
1294 gfc_error ("Syntax error in COMPLEX constant at %C");
1295 m = MATCH_ERROR;
1296
1297cleanup:
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
1310match
edf1eac2 1311gfc_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
1354static match
edf1eac2 1355match_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
63645982 1363 where = gfc_current_locus;
6de9cd9a
DN
1364
1365 switch (gfc_match_name (name))
1366 {
1367 case MATCH_ERROR:
1368 return MATCH_ERROR;
1369
1370 case MATCH_NO:
1371 break;
1372
1373 case MATCH_YES:
63645982 1374 w = gfc_current_locus;
6de9cd9a 1375 gfc_gobble_whitespace ();
8fc541d3 1376 c = gfc_next_ascii_char ();
63645982 1377 gfc_current_locus = w;
6de9cd9a
DN
1378
1379 if (c != ',' && c != ')')
1380 break;
1381
1382 if (gfc_find_sym_tree (name, NULL, 1, &symtree))
1383 break;
1384 /* Handle error elsewhere. */
1385
1386 /* Eliminate a couple of common cases where we know we don't
edf1eac2 1387 have a function argument. */
6de9cd9a 1388 if (symtree == NULL)
edf1eac2 1389 {
6de9cd9a 1390 gfc_get_sym_tree (name, NULL, &symtree);
edf1eac2
SK
1391 gfc_set_sym_referenced (symtree->n.sym);
1392 }
6de9cd9a
DN
1393 else
1394 {
edf1eac2 1395 gfc_symbol *sym;
6de9cd9a 1396
edf1eac2
SK
1397 sym = symtree->n.sym;
1398 gfc_set_sym_referenced (sym);
6de9cd9a
DN
1399 if (sym->attr.flavor != FL_PROCEDURE
1400 && sym->attr.flavor != FL_UNKNOWN)
1401 break;
1402
1403 /* If the symbol is a function with itself as the result and
1404 is being defined, then we have a variable. */
7a4ef45b
JJ
1405 if (sym->attr.function && sym->result == sym)
1406 {
1407 if (gfc_current_ns->proc_name == sym
6de9cd9a 1408 || (gfc_current_ns->parent != NULL
7a4ef45b
JJ
1409 && gfc_current_ns->parent->proc_name == sym))
1410 break;
1411
1412 if (sym->attr.entry
1413 && (sym->ns == gfc_current_ns
1414 || sym->ns == gfc_current_ns->parent))
1415 {
1416 gfc_entry_list *el = NULL;
1417
1418 for (el = sym->ns->entries; el; el = el->next)
1419 if (sym == el->sym)
1420 break;
1421
1422 if (el)
1423 break;
1424 }
1425 }
6de9cd9a
DN
1426 }
1427
1428 e = gfc_get_expr (); /* Leave it unknown for now */
1429 e->symtree = symtree;
1430 e->expr_type = EXPR_VARIABLE;
1431 e->ts.type = BT_PROCEDURE;
1432 e->where = where;
1433
1434 *result = e;
1435 return MATCH_YES;
1436 }
1437
63645982 1438 gfc_current_locus = where;
6de9cd9a
DN
1439 return gfc_match_expr (result);
1440}
1441
1442
1443/* Match a keyword argument. */
1444
1445static match
edf1eac2 1446match_keyword_arg (gfc_actual_arglist *actual, gfc_actual_arglist *base)
6de9cd9a
DN
1447{
1448 char name[GFC_MAX_SYMBOL_LEN + 1];
1449 gfc_actual_arglist *a;
1450 locus name_locus;
1451 match m;
1452
63645982 1453 name_locus = gfc_current_locus;
6de9cd9a
DN
1454 m = gfc_match_name (name);
1455
1456 if (m != MATCH_YES)
1457 goto cleanup;
1458 if (gfc_match_char ('=') != MATCH_YES)
1459 {
1460 m = MATCH_NO;
1461 goto cleanup;
1462 }
1463
1464 m = match_actual_arg (&actual->expr);
1465 if (m != MATCH_YES)
1466 goto cleanup;
1467
1468 /* Make sure this name has not appeared yet. */
1469
1470 if (name[0] != '\0')
1471 {
1472 for (a = base; a; a = a->next)
cb9e4f55 1473 if (a->name != NULL && strcmp (a->name, name) == 0)
6de9cd9a 1474 {
edf1eac2
SK
1475 gfc_error ("Keyword '%s' at %C has already appeared in the "
1476 "current argument list", name);
6de9cd9a
DN
1477 return MATCH_ERROR;
1478 }
1479 }
1480
cb9e4f55 1481 actual->name = gfc_get_string (name);
6de9cd9a
DN
1482 return MATCH_YES;
1483
1484cleanup:
63645982 1485 gfc_current_locus = name_locus;
6de9cd9a
DN
1486 return m;
1487}
1488
1489
7fcafa71
PT
1490/* Match an argument list function, such as %VAL. */
1491
1492static match
1493match_arg_list_function (gfc_actual_arglist *result)
1494{
1495 char name[GFC_MAX_SYMBOL_LEN + 1];
1496 locus old_locus;
1497 match m;
1498
1499 old_locus = gfc_current_locus;
1500
1501 if (gfc_match_char ('%') != MATCH_YES)
1502 {
1503 m = MATCH_NO;
1504 goto cleanup;
1505 }
1506
1507 m = gfc_match ("%n (", name);
1508 if (m != MATCH_YES)
1509 goto cleanup;
1510
1511 if (name[0] != '\0')
1512 {
1513 switch (name[0])
1514 {
1515 case 'l':
edf1eac2 1516 if (strncmp (name, "loc", 3) == 0)
7fcafa71
PT
1517 {
1518 result->name = "%LOC";
1519 break;
1520 }
1521 case 'r':
edf1eac2 1522 if (strncmp (name, "ref", 3) == 0)
7fcafa71
PT
1523 {
1524 result->name = "%REF";
1525 break;
1526 }
1527 case 'v':
edf1eac2 1528 if (strncmp (name, "val", 3) == 0)
7fcafa71
PT
1529 {
1530 result->name = "%VAL";
1531 break;
1532 }
1533 default:
1534 m = MATCH_ERROR;
1535 goto cleanup;
1536 }
1537 }
1538
1539 if (gfc_notify_std (GFC_STD_GNU, "Extension: argument list "
1540 "function at %C") == FAILURE)
1541 {
1542 m = MATCH_ERROR;
1543 goto cleanup;
1544 }
1545
1546 m = match_actual_arg (&result->expr);
1547 if (m != MATCH_YES)
1548 goto cleanup;
1549
1550 if (gfc_match_char (')') != MATCH_YES)
1551 {
1552 m = MATCH_NO;
1553 goto cleanup;
1554 }
1555
1556 return MATCH_YES;
1557
1558cleanup:
1559 gfc_current_locus = old_locus;
1560 return m;
1561}
1562
1563
6de9cd9a
DN
1564/* Matches an actual argument list of a function or subroutine, from
1565 the opening parenthesis to the closing parenthesis. The argument
1566 list is assumed to allow keyword arguments because we don't know if
1567 the symbol associated with the procedure has an implicit interface
ed5ee445 1568 or not. We make sure keywords are unique. If sub_flag is set,
d3fcc995 1569 we're matching the argument list of a subroutine. */
6de9cd9a
DN
1570
1571match
edf1eac2 1572gfc_match_actual_arglist (int sub_flag, gfc_actual_arglist **argp)
6de9cd9a
DN
1573{
1574 gfc_actual_arglist *head, *tail;
1575 int seen_keyword;
1576 gfc_st_label *label;
1577 locus old_loc;
1578 match m;
1579
1580 *argp = tail = NULL;
63645982 1581 old_loc = gfc_current_locus;
6de9cd9a
DN
1582
1583 seen_keyword = 0;
1584
1585 if (gfc_match_char ('(') == MATCH_NO)
1586 return (sub_flag) ? MATCH_YES : MATCH_NO;
1587
1588 if (gfc_match_char (')') == MATCH_YES)
1589 return MATCH_YES;
1590 head = NULL;
1591
1592 for (;;)
1593 {
1594 if (head == NULL)
1595 head = tail = gfc_get_actual_arglist ();
1596 else
1597 {
1598 tail->next = gfc_get_actual_arglist ();
1599 tail = tail->next;
1600 }
1601
1602 if (sub_flag && gfc_match_char ('*') == MATCH_YES)
1603 {
a34a91f0 1604 m = gfc_match_st_label (&label);
6de9cd9a
DN
1605 if (m == MATCH_NO)
1606 gfc_error ("Expected alternate return label at %C");
1607 if (m != MATCH_YES)
1608 goto cleanup;
1609
1610 tail->label = label;
1611 goto next;
1612 }
1613
1614 /* After the first keyword argument is seen, the following
edf1eac2 1615 arguments must also have keywords. */
6de9cd9a
DN
1616 if (seen_keyword)
1617 {
1618 m = match_keyword_arg (tail, head);
1619
1620 if (m == MATCH_ERROR)
1621 goto cleanup;
1622 if (m == MATCH_NO)
1623 {
edf1eac2 1624 gfc_error ("Missing keyword name in actual argument list at %C");
6de9cd9a
DN
1625 goto cleanup;
1626 }
1627
1628 }
1629 else
1630 {
7fcafa71
PT
1631 /* Try an argument list function, like %VAL. */
1632 m = match_arg_list_function (tail);
6de9cd9a
DN
1633 if (m == MATCH_ERROR)
1634 goto cleanup;
1635
7fcafa71
PT
1636 /* See if we have the first keyword argument. */
1637 if (m == MATCH_NO)
1638 {
1639 m = match_keyword_arg (tail, head);
1640 if (m == MATCH_YES)
1641 seen_keyword = 1;
1642 if (m == MATCH_ERROR)
1643 goto cleanup;
1644 }
1645
6de9cd9a
DN
1646 if (m == MATCH_NO)
1647 {
1648 /* Try for a non-keyword argument. */
1649 m = match_actual_arg (&tail->expr);
1650 if (m == MATCH_ERROR)
1651 goto cleanup;
1652 if (m == MATCH_NO)
1653 goto syntax;
1654 }
1655 }
1656
7fcafa71 1657
6de9cd9a
DN
1658 next:
1659 if (gfc_match_char (')') == MATCH_YES)
1660 break;
1661 if (gfc_match_char (',') != MATCH_YES)
1662 goto syntax;
1663 }
1664
1665 *argp = head;
1666 return MATCH_YES;
1667
1668syntax:
1669 gfc_error ("Syntax error in argument list at %C");
1670
1671cleanup:
1672 gfc_free_actual_arglist (head);
63645982 1673 gfc_current_locus = old_loc;
6de9cd9a
DN
1674
1675 return MATCH_ERROR;
1676}
1677
1678
8e1f752a 1679/* Used by gfc_match_varspec() to extend the reference list by one
6de9cd9a
DN
1680 element. */
1681
1682static gfc_ref *
edf1eac2 1683extend_ref (gfc_expr *primary, gfc_ref *tail)
6de9cd9a 1684{
6de9cd9a
DN
1685 if (primary->ref == NULL)
1686 primary->ref = tail = gfc_get_ref ();
1687 else
1688 {
1689 if (tail == NULL)
1690 gfc_internal_error ("extend_ref(): Bad tail");
1691 tail->next = gfc_get_ref ();
1692 tail = tail->next;
1693 }
1694
1695 return tail;
1696}
1697
1698
1699/* Match any additional specifications associated with the current
1700 variable like member references or substrings. If equiv_flag is
1701 set we only match stuff that is allowed inside an EQUIVALENCE
8e1f752a
DK
1702 statement. sub_flag tells whether we expect a type-bound procedure found
1703 to be a subroutine as part of CALL or a FUNCTION. */
6de9cd9a 1704
8e1f752a
DK
1705match
1706gfc_match_varspec (gfc_expr *primary, int equiv_flag, bool sub_flag)
6de9cd9a
DN
1707{
1708 char name[GFC_MAX_SYMBOL_LEN + 1];
1709 gfc_ref *substring, *tail;
1710 gfc_component *component;
a8006d09 1711 gfc_symbol *sym = primary->symtree->n.sym;
6de9cd9a 1712 match m;
f2d3cb25 1713 bool unknown;
6de9cd9a
DN
1714
1715 tail = NULL;
1716
3c721513 1717 gfc_gobble_whitespace ();
8fc541d3 1718 if ((equiv_flag && gfc_peek_ascii_char () == '(') || sym->attr.dimension)
6de9cd9a 1719 {
a8006d09
JJ
1720 /* In EQUIVALENCE, we don't know yet whether we are seeing
1721 an array, character variable or array of character
edf1eac2 1722 variables. We'll leave the decision till resolve time. */
6de9cd9a
DN
1723 tail = extend_ref (primary, tail);
1724 tail->type = REF_ARRAY;
1725
a8006d09
JJ
1726 m = gfc_match_array_ref (&tail->u.ar, equiv_flag ? NULL : sym->as,
1727 equiv_flag);
6de9cd9a
DN
1728 if (m != MATCH_YES)
1729 return m;
a8006d09 1730
3c721513 1731 gfc_gobble_whitespace ();
8fc541d3 1732 if (equiv_flag && gfc_peek_ascii_char () == '(')
a8006d09
JJ
1733 {
1734 tail = extend_ref (primary, tail);
1735 tail->type = REF_ARRAY;
1736
1737 m = gfc_match_array_ref (&tail->u.ar, NULL, equiv_flag);
1738 if (m != MATCH_YES)
1739 return m;
1740 }
6de9cd9a
DN
1741 }
1742
6de9cd9a
DN
1743 primary->ts = sym->ts;
1744
a8006d09
JJ
1745 if (equiv_flag)
1746 return MATCH_YES;
1747
6de9cd9a
DN
1748 if (sym->ts.type != BT_DERIVED || gfc_match_char ('%') != MATCH_YES)
1749 goto check_substring;
1750
1751 sym = sym->ts.derived;
1752
1753 for (;;)
1754 {
8e1f752a 1755 gfc_try t;
e157f736 1756 gfc_symtree *tbp;
8e1f752a 1757
6de9cd9a
DN
1758 m = gfc_match_name (name);
1759 if (m == MATCH_NO)
1760 gfc_error ("Expected structure component name at %C");
1761 if (m != MATCH_YES)
1762 return MATCH_ERROR;
1763
8e1f752a
DK
1764 tbp = gfc_find_typebound_proc (sym, &t, name, false);
1765 if (tbp)
1766 {
1767 gfc_symbol* tbp_sym;
1768
1769 if (t == FAILURE)
1770 return MATCH_ERROR;
1771
1772 gcc_assert (!tail || !tail->next);
1773 gcc_assert (primary->expr_type == EXPR_VARIABLE);
1774
e157f736
DK
1775 if (tbp->typebound->is_generic)
1776 tbp_sym = NULL;
1777 else
1778 tbp_sym = tbp->typebound->u.specific->n.sym;
8e1f752a
DK
1779
1780 primary->expr_type = EXPR_COMPCALL;
e157f736 1781 primary->value.compcall.tbp = tbp->typebound;
e157f736
DK
1782 primary->value.compcall.name = tbp->name;
1783 gcc_assert (primary->symtree->n.sym->attr.referenced);
1784 if (tbp_sym)
1785 primary->ts = tbp_sym->ts;
1786
1787 m = gfc_match_actual_arglist (tbp->typebound->subroutine,
8e1f752a
DK
1788 &primary->value.compcall.actual);
1789 if (m == MATCH_ERROR)
1790 return MATCH_ERROR;
1791 if (m == MATCH_NO)
1792 {
1793 if (sub_flag)
1794 primary->value.compcall.actual = NULL;
1795 else
1796 {
1797 gfc_error ("Expected argument list at %C");
1798 return MATCH_ERROR;
1799 }
1800 }
1801
e157f736 1802 gfc_set_sym_referenced (tbp->n.sym);
8e1f752a
DK
1803
1804 break;
1805 }
1806
9d1210f4 1807 component = gfc_find_component (sym, name, false, false);
6de9cd9a
DN
1808 if (component == NULL)
1809 return MATCH_ERROR;
1810
1811 tail = extend_ref (primary, tail);
1812 tail->type = REF_COMPONENT;
1813
1814 tail->u.c.component = component;
1815 tail->u.c.sym = sym;
1816
1817 primary->ts = component->ts;
1818
1819 if (component->as != NULL)
1820 {
1821 tail = extend_ref (primary, tail);
1822 tail->type = REF_ARRAY;
1823
1824 m = gfc_match_array_ref (&tail->u.ar, component->as, equiv_flag);
1825 if (m != MATCH_YES)
1826 return m;
1827 }
1828
1829 if (component->ts.type != BT_DERIVED
1830 || gfc_match_char ('%') != MATCH_YES)
1831 break;
1832
1833 sym = component->ts.derived;
1834 }
1835
1836check_substring:
f2d3cb25 1837 unknown = false;
c040ffff
TS
1838 if (primary->ts.type == BT_UNKNOWN)
1839 {
1840 if (gfc_get_default_type (sym, sym->ns)->type == BT_CHARACTER)
1841 {
edf1eac2
SK
1842 gfc_set_default_type (sym, 0, sym->ns);
1843 primary->ts = sym->ts;
f2d3cb25 1844 unknown = true;
c040ffff
TS
1845 }
1846 }
1847
6de9cd9a
DN
1848 if (primary->ts.type == BT_CHARACTER)
1849 {
1850 switch (match_substring (primary->ts.cl, equiv_flag, &substring))
1851 {
1852 case MATCH_YES:
1853 if (tail == NULL)
1854 primary->ref = substring;
1855 else
1856 tail->next = substring;
1857
1858 if (primary->expr_type == EXPR_CONSTANT)
1859 primary->expr_type = EXPR_SUBSTRING;
1860
860c8f3b
PB
1861 if (substring)
1862 primary->ts.cl = NULL;
1863
6de9cd9a
DN
1864 break;
1865
1866 case MATCH_NO:
f2d3cb25
PT
1867 if (unknown)
1868 gfc_clear_ts (&primary->ts);
6de9cd9a
DN
1869 break;
1870
1871 case MATCH_ERROR:
1872 return MATCH_ERROR;
1873 }
1874 }
1875
1876 return MATCH_YES;
1877}
1878
1879
1880/* Given an expression that is a variable, figure out what the
1881 ultimate variable's type and attribute is, traversing the reference
1882 structures if necessary.
1883
1884 This subroutine is trickier than it looks. We start at the base
1885 symbol and store the attribute. Component references load a
1886 completely new attribute.
1887
1888 A couple of rules come into play. Subobjects of targets are always
1889 targets themselves. If we see a component that goes through a
1890 pointer, then the expression must also be a target, since the
1891 pointer is associated with something (if it isn't core will soon be
1892 dumped). If we see a full part or section of an array, the
1893 expression is also an array.
1894
f7b529fa 1895 We can have at most one full array reference. */
6de9cd9a
DN
1896
1897symbol_attribute
edf1eac2 1898gfc_variable_attr (gfc_expr *expr, gfc_typespec *ts)
6de9cd9a 1899{
5046aff5 1900 int dimension, pointer, allocatable, target;
6de9cd9a
DN
1901 symbol_attribute attr;
1902 gfc_ref *ref;
1903
1904 if (expr->expr_type != EXPR_VARIABLE)
1905 gfc_internal_error ("gfc_variable_attr(): Expression isn't a variable");
1906
1907 ref = expr->ref;
1908 attr = expr->symtree->n.sym->attr;
1909
1910 dimension = attr.dimension;
1911 pointer = attr.pointer;
5046aff5 1912 allocatable = attr.allocatable;
6de9cd9a
DN
1913
1914 target = attr.target;
1915 if (pointer)
1916 target = 1;
1917
1918 if (ts != NULL && expr->ts.type == BT_UNKNOWN)
1919 *ts = expr->symtree->n.sym->ts;
1920
1921 for (; ref; ref = ref->next)
1922 switch (ref->type)
1923 {
1924 case REF_ARRAY:
1925
1926 switch (ref->u.ar.type)
1927 {
1928 case AR_FULL:
1929 dimension = 1;
1930 break;
1931
1932 case AR_SECTION:
5046aff5 1933 allocatable = pointer = 0;
6de9cd9a
DN
1934 dimension = 1;
1935 break;
1936
1937 case AR_ELEMENT:
5046aff5 1938 allocatable = pointer = 0;
6de9cd9a
DN
1939 break;
1940
1941 case AR_UNKNOWN:
1942 gfc_internal_error ("gfc_variable_attr(): Bad array reference");
1943 }
1944
1945 break;
1946
1947 case REF_COMPONENT:
d4b7d0f0 1948 attr = ref->u.c.component->attr;
6de9cd9a 1949 if (ts != NULL)
e8a25349
TS
1950 {
1951 *ts = ref->u.c.component->ts;
1952 /* Don't set the string length if a substring reference
1953 follows. */
1954 if (ts->type == BT_CHARACTER
1955 && ref->next && ref->next->type == REF_SUBSTRING)
1956 ts->cl = NULL;
1957 }
6de9cd9a 1958
d4b7d0f0
JW
1959 pointer = ref->u.c.component->attr.pointer;
1960 allocatable = ref->u.c.component->attr.allocatable;
6de9cd9a
DN
1961 if (pointer)
1962 target = 1;
1963
1964 break;
1965
1966 case REF_SUBSTRING:
5046aff5 1967 allocatable = pointer = 0;
6de9cd9a
DN
1968 break;
1969 }
1970
1971 attr.dimension = dimension;
1972 attr.pointer = pointer;
5046aff5 1973 attr.allocatable = allocatable;
6de9cd9a
DN
1974 attr.target = target;
1975
1976 return attr;
1977}
1978
1979
1980/* Return the attribute from a general expression. */
1981
1982symbol_attribute
edf1eac2 1983gfc_expr_attr (gfc_expr *e)
6de9cd9a
DN
1984{
1985 symbol_attribute attr;
1986
1987 switch (e->expr_type)
1988 {
1989 case EXPR_VARIABLE:
1990 attr = gfc_variable_attr (e, NULL);
1991 break;
1992
1993 case EXPR_FUNCTION:
1994 gfc_clear_attr (&attr);
1995
1996 if (e->value.function.esym != NULL)
1997 attr = e->value.function.esym->result->attr;
1998
1999 /* TODO: NULL() returns pointers. May have to take care of this
edf1eac2 2000 here. */
6de9cd9a
DN
2001
2002 break;
2003
2004 default:
2005 gfc_clear_attr (&attr);
2006 break;
2007 }
2008
2009 return attr;
2010}
2011
2012
2013/* Match a structure constructor. The initial symbol has already been
2014 seen. */
2015
fa9290d3
DK
2016typedef struct gfc_structure_ctor_component
2017{
2018 char* name;
2019 gfc_expr* val;
2020 locus where;
2021 struct gfc_structure_ctor_component* next;
2022}
2023gfc_structure_ctor_component;
2024
ece3f663 2025#define gfc_get_structure_ctor_component() XCNEW (gfc_structure_ctor_component)
fa9290d3
DK
2026
2027static void
2028gfc_free_structure_ctor_component (gfc_structure_ctor_component *comp)
2029{
2030 gfc_free (comp->name);
2031 gfc_free_expr (comp->val);
2032}
2033
7d1f1e61
PT
2034
2035/* Translate the component list into the actual constructor by sorting it in
2036 the order required; this also checks along the way that each and every
2037 component actually has an initializer and handles default initializers
2038 for components without explicit value given. */
2039static gfc_try
2040build_actual_constructor (gfc_structure_ctor_component **comp_head,
2041 gfc_constructor **ctor_head, gfc_symbol *sym)
6de9cd9a 2042{
fa9290d3 2043 gfc_structure_ctor_component *comp_iter;
7d1f1e61
PT
2044 gfc_constructor *ctor_tail = NULL;
2045 gfc_component *comp;
2046
2047 for (comp = sym->components; comp; comp = comp->next)
2048 {
2049 gfc_structure_ctor_component **next_ptr;
2050 gfc_expr *value = NULL;
2051
2052 /* Try to find the initializer for the current component by name. */
2053 next_ptr = comp_head;
2054 for (comp_iter = *comp_head; comp_iter; comp_iter = comp_iter->next)
2055 {
2056 if (!strcmp (comp_iter->name, comp->name))
2057 break;
2058 next_ptr = &comp_iter->next;
2059 }
2060
2061 /* If an extension, try building the parent derived type by building
2062 a value expression for the parent derived type and calling self. */
2063 if (!comp_iter && comp == sym->components && sym->attr.extension)
2064 {
2065 value = gfc_get_expr ();
2066 value->expr_type = EXPR_STRUCTURE;
2067 value->value.constructor = NULL;
2068 value->ts = comp->ts;
2069 value->where = gfc_current_locus;
2070
2071 if (build_actual_constructor (comp_head, &value->value.constructor,
2072 comp->ts.derived) == FAILURE)
2073 {
2074 gfc_free_expr (value);
2075 return FAILURE;
2076 }
2077 *ctor_head = ctor_tail = gfc_get_constructor ();
2078 ctor_tail->expr = value;
2079 continue;
2080 }
2081
2082 /* If it was not found, try the default initializer if there's any;
2083 otherwise, it's an error. */
2084 if (!comp_iter)
2085 {
2086 if (comp->initializer)
2087 {
2088 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: Structure"
2089 " constructor with missing optional arguments"
2090 " at %C") == FAILURE)
2091 return FAILURE;
2092 value = gfc_copy_expr (comp->initializer);
2093 }
2094 else
2095 {
2096 gfc_error ("No initializer for component '%s' given in the"
2097 " structure constructor at %C!", comp->name);
2098 return FAILURE;
2099 }
2100 }
2101 else
2102 value = comp_iter->val;
2103
2104 /* Add the value to the constructor chain built. */
2105 if (ctor_tail)
2106 {
2107 ctor_tail->next = gfc_get_constructor ();
2108 ctor_tail = ctor_tail->next;
2109 }
2110 else
2111 *ctor_head = ctor_tail = gfc_get_constructor ();
2112 gcc_assert (value);
2113 ctor_tail->expr = value;
2114
2115 /* Remove the entry from the component list. We don't want the expression
2116 value to be free'd, so set it to NULL. */
2117 if (comp_iter)
2118 {
2119 *next_ptr = comp_iter->next;
2120 comp_iter->val = NULL;
2121 gfc_free_structure_ctor_component (comp_iter);
2122 }
2123 }
2124 return SUCCESS;
2125}
2126
2127match
52f49934
DK
2128gfc_match_structure_constructor (gfc_symbol *sym, gfc_expr **result,
2129 bool parent)
7d1f1e61
PT
2130{
2131 gfc_structure_ctor_component *comp_tail, *comp_head, *comp_iter;
fa9290d3
DK
2132 gfc_constructor *ctor_head, *ctor_tail;
2133 gfc_component *comp; /* Is set NULL when named component is first seen */
6de9cd9a
DN
2134 gfc_expr *e;
2135 locus where;
2136 match m;
fa9290d3 2137 const char* last_name = NULL;
6de9cd9a 2138
7d1f1e61 2139 comp_tail = comp_head = NULL;
fa9290d3 2140 ctor_head = ctor_tail = NULL;
6de9cd9a 2141
7d1f1e61 2142 if (!parent && gfc_match_char ('(') != MATCH_YES)
6de9cd9a
DN
2143 goto syntax;
2144
63645982 2145 where = gfc_current_locus;
6de9cd9a 2146
9d1210f4 2147 gfc_find_component (sym, NULL, false, true);
6de9cd9a 2148
52f49934
DK
2149 /* Check that we're not about to construct an ABSTRACT type. */
2150 if (!parent && sym->attr.abstract)
2151 {
2152 gfc_error ("Can't construct ABSTRACT type '%s' at %C", sym->name);
2153 return MATCH_ERROR;
2154 }
2155
fa9290d3
DK
2156 /* Match the component list and store it in a list together with the
2157 corresponding component names. Check for empty argument list first. */
2158 if (gfc_match_char (')') != MATCH_YES)
6de9cd9a 2159 {
fa9290d3
DK
2160 comp = sym->components;
2161 do
2eae3dc7 2162 {
fa9290d3 2163 gfc_component *this_comp = NULL;
6de9cd9a 2164
fa9290d3
DK
2165 if (!comp_head)
2166 comp_tail = comp_head = gfc_get_structure_ctor_component ();
2167 else
2168 {
2169 comp_tail->next = gfc_get_structure_ctor_component ();
2170 comp_tail = comp_tail->next;
2171 }
ece3f663 2172 comp_tail->name = XCNEWVEC (char, GFC_MAX_SYMBOL_LEN + 1);
fa9290d3
DK
2173 comp_tail->val = NULL;
2174 comp_tail->where = gfc_current_locus;
6de9cd9a 2175
fa9290d3
DK
2176 /* Try matching a component name. */
2177 if (gfc_match_name (comp_tail->name) == MATCH_YES
2178 && gfc_match_char ('=') == MATCH_YES)
2179 {
2180 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: Structure"
2181 " constructor with named arguments at %C")
2182 == FAILURE)
2183 goto cleanup;
2184
2185 last_name = comp_tail->name;
2186 comp = NULL;
2187 }
2188 else
2189 {
2190 /* Components without name are not allowed after the first named
2191 component initializer! */
2192 if (!comp)
2193 {
2194 if (last_name)
2195 gfc_error ("Component initializer without name after"
2196 " component named %s at %C!", last_name);
7d1f1e61 2197 else if (!parent)
fa9290d3
DK
2198 gfc_error ("Too many components in structure constructor at"
2199 " %C!");
2200 goto cleanup;
2201 }
2202
2203 gfc_current_locus = comp_tail->where;
2204 strncpy (comp_tail->name, comp->name, GFC_MAX_SYMBOL_LEN + 1);
2205 }
2206
9d1210f4
DK
2207 /* Find the current component in the structure definition and check
2208 its access is not private. */
fa9290d3 2209 if (comp)
9d1210f4 2210 this_comp = gfc_find_component (sym, comp->name, false, false);
fa9290d3
DK
2211 else
2212 {
9d1210f4
DK
2213 this_comp = gfc_find_component (sym,
2214 (const char *)comp_tail->name,
2215 false, false);
fa9290d3 2216 comp = NULL; /* Reset needed! */
fa9290d3 2217 }
fa9290d3 2218
7d1f1e61
PT
2219 /* Here we can check if a component name is given which does not
2220 correspond to any component of the defined structure. */
2221 if (!this_comp)
2222 goto cleanup;
6de9cd9a 2223
fa9290d3
DK
2224 /* Check if this component is already given a value. */
2225 for (comp_iter = comp_head; comp_iter != comp_tail;
2226 comp_iter = comp_iter->next)
2227 {
2228 gcc_assert (comp_iter);
2229 if (!strcmp (comp_iter->name, comp_tail->name))
2230 {
2231 gfc_error ("Component '%s' is initialized twice in the"
2232 " structure constructor at %C!", comp_tail->name);
2233 goto cleanup;
2234 }
2235 }
2236
2237 /* Match the current initializer expression. */
2238 m = gfc_match_expr (&comp_tail->val);
2239 if (m == MATCH_NO)
2240 goto syntax;
2241 if (m == MATCH_ERROR)
2242 goto cleanup;
2243
7d1f1e61
PT
2244 /* If not explicitly a parent constructor, gather up the components
2245 and build one. */
2246 if (comp && comp == sym->components
2247 && sym->attr.extension
2248 && (comp_tail->val->ts.type != BT_DERIVED
2249 ||
2250 comp_tail->val->ts.derived != this_comp->ts.derived))
2251 {
2252 gfc_current_locus = where;
2253 gfc_free_expr (comp_tail->val);
52f49934 2254 comp_tail->val = NULL;
6de9cd9a 2255
7d1f1e61
PT
2256 m = gfc_match_structure_constructor (comp->ts.derived,
2257 &comp_tail->val, true);
2258 if (m == MATCH_NO)
2259 goto syntax;
2260 if (m == MATCH_ERROR)
2261 goto cleanup;
2262 }
6de9cd9a 2263
7d1f1e61
PT
2264 if (comp)
2265 comp = comp->next;
2eae3dc7 2266
7d1f1e61 2267 if (parent && !comp)
fa9290d3 2268 break;
fa9290d3 2269 }
fa9290d3 2270
7d1f1e61 2271 while (gfc_match_char (',') == MATCH_YES);
fa9290d3 2272
7d1f1e61
PT
2273 if (!parent && gfc_match_char (')') != MATCH_YES)
2274 goto syntax;
6de9cd9a
DN
2275 }
2276
7d1f1e61
PT
2277 if (build_actual_constructor (&comp_head, &ctor_head, sym) == FAILURE)
2278 goto cleanup;
2279
fa9290d3
DK
2280 /* No component should be left, as this should have caused an error in the
2281 loop constructing the component-list (name that does not correspond to any
2282 component in the structure definition). */
7d1f1e61
PT
2283 if (comp_head && sym->attr.extension)
2284 {
2285 for (comp_iter = comp_head; comp_iter; comp_iter = comp_iter->next)
2286 {
2287 gfc_error ("component '%s' at %L has already been set by a "
2288 "parent derived type constructor", comp_iter->name,
2289 &comp_iter->where);
2290 }
2291 goto cleanup;
2292 }
2293 else
2294 gcc_assert (!comp_head);
fa9290d3 2295
6de9cd9a
DN
2296 e = gfc_get_expr ();
2297
2298 e->expr_type = EXPR_STRUCTURE;
2299
2300 e->ts.type = BT_DERIVED;
2301 e->ts.derived = sym;
2302 e->where = where;
2303
fa9290d3 2304 e->value.constructor = ctor_head;
6de9cd9a
DN
2305
2306 *result = e;
2307 return MATCH_YES;
2308
2309syntax:
2310 gfc_error ("Syntax error in structure constructor at %C");
2311
2312cleanup:
fa9290d3
DK
2313 for (comp_iter = comp_head; comp_iter; )
2314 {
2315 gfc_structure_ctor_component *next = comp_iter->next;
2316 gfc_free_structure_ctor_component (comp_iter);
2317 comp_iter = next;
2318 }
2319 gfc_free_constructor (ctor_head);
6de9cd9a
DN
2320 return MATCH_ERROR;
2321}
2322
2323
9a3db5a3
PT
2324/* If the symbol is an implicit do loop index and implicitly typed,
2325 it should not be host associated. Provide a symtree from the
2326 current namespace. */
2327static match
2328check_for_implicit_index (gfc_symtree **st, gfc_symbol **sym)
2329{
2330 if ((*sym)->attr.flavor == FL_VARIABLE
2331 && (*sym)->ns != gfc_current_ns
2332 && (*sym)->attr.implied_index
2333 && (*sym)->attr.implicit_type
2334 && !(*sym)->attr.use_assoc)
2335 {
2336 int i;
2337 i = gfc_get_sym_tree ((*sym)->name, NULL, st);
2338 if (i)
2339 return MATCH_ERROR;
2340 *sym = (*st)->n.sym;
2341 }
2342 return MATCH_YES;
2343}
2344
2345
6de9cd9a
DN
2346/* Matches a variable name followed by anything that might follow it--
2347 array reference, argument list of a function, etc. */
2348
2349match
edf1eac2 2350gfc_match_rvalue (gfc_expr **result)
6de9cd9a
DN
2351{
2352 gfc_actual_arglist *actual_arglist;
d3fcc995 2353 char name[GFC_MAX_SYMBOL_LEN + 1], argname[GFC_MAX_SYMBOL_LEN + 1];
6de9cd9a
DN
2354 gfc_state_data *st;
2355 gfc_symbol *sym;
2356 gfc_symtree *symtree;
d3fcc995 2357 locus where, old_loc;
6de9cd9a 2358 gfc_expr *e;
d3fcc995 2359 match m, m2;
6de9cd9a 2360 int i;
5270c302
AL
2361 gfc_typespec *ts;
2362 bool implicit_char;
a99288e5 2363 gfc_ref *ref;
6de9cd9a
DN
2364
2365 m = gfc_match_name (name);
2366 if (m != MATCH_YES)
2367 return m;
2368
2a6dcee5
TB
2369 if (gfc_find_state (COMP_INTERFACE) == SUCCESS
2370 && !gfc_current_ns->has_import_set)
6de9cd9a
DN
2371 i = gfc_get_sym_tree (name, NULL, &symtree);
2372 else
2373 i = gfc_get_ha_sym_tree (name, &symtree);
2374
2375 if (i)
2376 return MATCH_ERROR;
2377
2378 sym = symtree->n.sym;
2379 e = NULL;
63645982 2380 where = gfc_current_locus;
6de9cd9a 2381
9a3db5a3
PT
2382 /* If this is an implicit do loop index and implicitly typed,
2383 it should not be host associated. */
2384 m = check_for_implicit_index (&symtree, &sym);
2385 if (m != MATCH_YES)
2386 return m;
2387
6de9cd9a 2388 gfc_set_sym_referenced (sym);
9a3db5a3 2389 sym->attr.implied_index = 0;
6de9cd9a 2390
0921bc44
JJ
2391 if (sym->attr.function && sym->result == sym)
2392 {
811849c0
PT
2393 /* See if this is a directly recursive function call. */
2394 gfc_gobble_whitespace ();
2395 if (sym->attr.recursive
8fc541d3 2396 && gfc_peek_ascii_char () == '('
fc2d8680
PT
2397 && gfc_current_ns->proc_name == sym
2398 && !sym->attr.dimension)
811849c0 2399 {
fc2d8680
PT
2400 gfc_error ("'%s' at %C is the name of a recursive function "
2401 "and so refers to the result variable. Use an "
2402 "explicit RESULT variable for direct recursion "
2403 "(12.5.2.1)", sym->name);
811849c0
PT
2404 return MATCH_ERROR;
2405 }
fc2d8680 2406
0921bc44 2407 if (gfc_current_ns->proc_name == sym
6de9cd9a 2408 || (gfc_current_ns->parent != NULL
0921bc44
JJ
2409 && gfc_current_ns->parent->proc_name == sym))
2410 goto variable;
2411
2412 if (sym->attr.entry
2413 && (sym->ns == gfc_current_ns
2414 || sym->ns == gfc_current_ns->parent))
2415 {
2416 gfc_entry_list *el = NULL;
2417
2418 for (el = sym->ns->entries; el; el = el->next)
2419 if (sym == el->sym)
2420 goto variable;
2421 }
2422 }
6de9cd9a 2423
8fb74da4
JW
2424 if (gfc_matching_procptr_assignment)
2425 goto procptr0;
2426
6de9cd9a
DN
2427 if (sym->attr.function || sym->attr.external || sym->attr.intrinsic)
2428 goto function0;
2429
2430 if (sym->attr.generic)
2431 goto generic_function;
2432
2433 switch (sym->attr.flavor)
2434 {
2435 case FL_VARIABLE:
2436 variable:
8fc541d3 2437 if (sym->ts.type == BT_UNKNOWN && gfc_peek_ascii_char () == '%'
6de9cd9a
DN
2438 && gfc_get_default_type (sym, sym->ns)->type == BT_DERIVED)
2439 gfc_set_default_type (sym, 0, sym->ns);
2440
2441 e = gfc_get_expr ();
2442
2443 e->expr_type = EXPR_VARIABLE;
2444 e->symtree = symtree;
2445
8e1f752a 2446 m = gfc_match_varspec (e, 0, false);
6de9cd9a
DN
2447 break;
2448
2449 case FL_PARAMETER:
b7263e8f
EE
2450 /* A statement of the form "REAL, parameter :: a(0:10) = 1" will
2451 end up here. Unfortunately, sym->value->expr_type is set to
2452 EXPR_CONSTANT, and so the if () branch would be followed without
2453 the !sym->as check. */
2454 if (sym->value && sym->value->expr_type != EXPR_ARRAY && !sym->as)
6de9cd9a
DN
2455 e = gfc_copy_expr (sym->value);
2456 else
2457 {
2458 e = gfc_get_expr ();
2459 e->expr_type = EXPR_VARIABLE;
2460 }
2461
2462 e->symtree = symtree;
8e1f752a 2463 m = gfc_match_varspec (e, 0, false);
a99288e5
PT
2464
2465 if (sym->ts.is_c_interop || sym->ts.is_iso_c)
2466 break;
2467
927171bf
PT
2468 /* Variable array references to derived type parameters cause
2469 all sorts of headaches in simplification. Treating such
2470 expressions as variable works just fine for all array
2471 references. */
2472 if (sym->value && sym->ts.type == BT_DERIVED && e->ref)
a99288e5
PT
2473 {
2474 for (ref = e->ref; ref; ref = ref->next)
2475 if (ref->type == REF_ARRAY)
2476 break;
2477
927171bf 2478 if (ref == NULL || ref->u.ar.type == AR_FULL)
a99288e5
PT
2479 break;
2480
2481 ref = e->ref;
2482 e->ref = NULL;
2483 gfc_free_expr (e);
2484 e = gfc_get_expr ();
2485 e->expr_type = EXPR_VARIABLE;
2486 e->symtree = symtree;
2487 e->ref = ref;
a99288e5
PT
2488 }
2489
6de9cd9a
DN
2490 break;
2491
2492 case FL_DERIVED:
2493 sym = gfc_use_derived (sym);
2494 if (sym == NULL)
2495 m = MATCH_ERROR;
2496 else
7d1f1e61 2497 m = gfc_match_structure_constructor (sym, &e, false);
6de9cd9a
DN
2498 break;
2499
2500 /* If we're here, then the name is known to be the name of a
2501 procedure, yet it is not sure to be the name of a function. */
2502 case FL_PROCEDURE:
8fb74da4
JW
2503
2504 /* Procedure Pointer Assignments. */
2505 procptr0:
2506 if (gfc_matching_procptr_assignment)
2507 {
2508 gfc_gobble_whitespace ();
2509 if (sym->attr.function && gfc_peek_ascii_char () == '(')
2510 /* Parse functions returning a procptr. */
2511 goto function0;
2512
2513 if (sym->attr.flavor == FL_UNKNOWN) sym->attr.flavor = FL_PROCEDURE;
c3005b0f
DK
2514 if (gfc_is_intrinsic (sym, 0, gfc_current_locus)
2515 || gfc_is_intrinsic (sym, 1, gfc_current_locus))
8fb74da4
JW
2516 sym->attr.intrinsic = 1;
2517 e = gfc_get_expr ();
2518 e->expr_type = EXPR_VARIABLE;
2519 e->symtree = symtree;
8e1f752a 2520 m = gfc_match_varspec (e, 0, false);
8fb74da4
JW
2521 break;
2522 }
2523
6de9cd9a
DN
2524 if (sym->attr.subroutine)
2525 {
2526 gfc_error ("Unexpected use of subroutine name '%s' at %C",
2527 sym->name);
2528 m = MATCH_ERROR;
2529 break;
2530 }
2531
2532 /* At this point, the name has to be a non-statement function.
edf1eac2
SK
2533 If the name is the same as the current function being
2534 compiled, then we have a variable reference (to the function
2535 result) if the name is non-recursive. */
6de9cd9a
DN
2536
2537 st = gfc_enclosing_unit (NULL);
2538
2539 if (st != NULL && st->state == COMP_FUNCTION
2540 && st->sym == sym
2541 && !sym->attr.recursive)
2542 {
2543 e = gfc_get_expr ();
2544 e->symtree = symtree;
2545 e->expr_type = EXPR_VARIABLE;
2546
8e1f752a 2547 m = gfc_match_varspec (e, 0, false);
6de9cd9a
DN
2548 break;
2549 }
2550
2551 /* Match a function reference. */
2552 function0:
2553 m = gfc_match_actual_arglist (0, &actual_arglist);
2554 if (m == MATCH_NO)
2555 {
2556 if (sym->attr.proc == PROC_ST_FUNCTION)
2557 gfc_error ("Statement function '%s' requires argument list at %C",
2558 sym->name);
2559 else
2560 gfc_error ("Function '%s' requires an argument list at %C",
2561 sym->name);
2562
2563 m = MATCH_ERROR;
2564 break;
2565 }
2566
2567 if (m != MATCH_YES)
2568 {
2569 m = MATCH_ERROR;
2570 break;
2571 }
2572
2573 gfc_get_ha_sym_tree (name, &symtree); /* Can't fail */
2574 sym = symtree->n.sym;
2575
2576 e = gfc_get_expr ();
2577 e->symtree = symtree;
2578 e->expr_type = EXPR_FUNCTION;
2579 e->value.function.actual = actual_arglist;
63645982 2580 e->where = gfc_current_locus;
6de9cd9a
DN
2581
2582 if (sym->as != NULL)
2583 e->rank = sym->as->rank;
2584
2585 if (!sym->attr.function
231b2fcc 2586 && gfc_add_function (&sym->attr, sym->name, NULL) == FAILURE)
6de9cd9a
DN
2587 {
2588 m = MATCH_ERROR;
2589 break;
2590 }
2591
a8b3b0b6
CR
2592 /* Check here for the existence of at least one argument for the
2593 iso_c_binding functions C_LOC, C_FUNLOC, and C_ASSOCIATED. The
2594 argument(s) given will be checked in gfc_iso_c_func_interface,
2595 during resolution of the function call. */
2596 if (sym->attr.is_iso_c == 1
2597 && (sym->from_intmod == INTMOD_ISO_C_BINDING
2598 && (sym->intmod_sym_id == ISOCBINDING_LOC
2599 || sym->intmod_sym_id == ISOCBINDING_FUNLOC
2600 || sym->intmod_sym_id == ISOCBINDING_ASSOCIATED)))
2601 {
2602 /* make sure we were given a param */
2603 if (actual_arglist == NULL)
2604 {
2605 gfc_error ("Missing argument to '%s' at %C", sym->name);
2606 m = MATCH_ERROR;
2607 break;
2608 }
2609 }
2610
6de9cd9a
DN
2611 if (sym->result == NULL)
2612 sym->result = sym;
2613
2614 m = MATCH_YES;
2615 break;
2616
2617 case FL_UNKNOWN:
2618
2619 /* Special case for derived type variables that get their types
edf1eac2
SK
2620 via an IMPLICIT statement. This can't wait for the
2621 resolution phase. */
6de9cd9a 2622
8fc541d3 2623 if (gfc_peek_ascii_char () == '%'
0dd973dd 2624 && sym->ts.type == BT_UNKNOWN
6de9cd9a
DN
2625 && gfc_get_default_type (sym, sym->ns)->type == BT_DERIVED)
2626 gfc_set_default_type (sym, 0, sym->ns);
2627
2628 /* If the symbol has a dimension attribute, the expression is a
edf1eac2 2629 variable. */
6de9cd9a
DN
2630
2631 if (sym->attr.dimension)
2632 {
231b2fcc
TS
2633 if (gfc_add_flavor (&sym->attr, FL_VARIABLE,
2634 sym->name, NULL) == FAILURE)
6de9cd9a
DN
2635 {
2636 m = MATCH_ERROR;
2637 break;
2638 }
2639
2640 e = gfc_get_expr ();
2641 e->symtree = symtree;
2642 e->expr_type = EXPR_VARIABLE;
8e1f752a 2643 m = gfc_match_varspec (e, 0, false);
6de9cd9a
DN
2644 break;
2645 }
2646
2647 /* Name is not an array, so we peek to see if a '(' implies a
edf1eac2
SK
2648 function call or a substring reference. Otherwise the
2649 variable is just a scalar. */
6de9cd9a
DN
2650
2651 gfc_gobble_whitespace ();
8fc541d3 2652 if (gfc_peek_ascii_char () != '(')
6de9cd9a
DN
2653 {
2654 /* Assume a scalar variable */
2655 e = gfc_get_expr ();
2656 e->symtree = symtree;
2657 e->expr_type = EXPR_VARIABLE;
2658
231b2fcc
TS
2659 if (gfc_add_flavor (&sym->attr, FL_VARIABLE,
2660 sym->name, NULL) == FAILURE)
6de9cd9a
DN
2661 {
2662 m = MATCH_ERROR;
2663 break;
2664 }
2665
8e1f752a 2666 /*FIXME:??? gfc_match_varspec does set this for us: */
6de9cd9a 2667 e->ts = sym->ts;
8e1f752a 2668 m = gfc_match_varspec (e, 0, false);
6de9cd9a
DN
2669 break;
2670 }
2671
d3fcc995
TS
2672 /* See if this is a function reference with a keyword argument
2673 as first argument. We do this because otherwise a spurious
2674 symbol would end up in the symbol table. */
2675
2676 old_loc = gfc_current_locus;
2677 m2 = gfc_match (" ( %n =", argname);
2678 gfc_current_locus = old_loc;
6de9cd9a
DN
2679
2680 e = gfc_get_expr ();
2681 e->symtree = symtree;
2682
d3fcc995 2683 if (m2 != MATCH_YES)
6de9cd9a 2684 {
5270c302
AL
2685 /* Try to figure out whether we're dealing with a character type.
2686 We're peeking ahead here, because we don't want to call
2687 match_substring if we're dealing with an implicitly typed
2688 non-character variable. */
2689 implicit_char = false;
2690 if (sym->ts.type == BT_UNKNOWN)
2691 {
2692 ts = gfc_get_default_type (sym,NULL);
2693 if (ts->type == BT_CHARACTER)
2694 implicit_char = true;
2695 }
2696
d3fcc995
TS
2697 /* See if this could possibly be a substring reference of a name
2698 that we're not sure is a variable yet. */
6de9cd9a 2699
5270c302 2700 if ((implicit_char || sym->ts.type == BT_CHARACTER)
d3fcc995 2701 && match_substring (sym->ts.cl, 0, &e->ref) == MATCH_YES)
6de9cd9a 2702 {
6de9cd9a 2703
d3fcc995
TS
2704 e->expr_type = EXPR_VARIABLE;
2705
2706 if (sym->attr.flavor != FL_VARIABLE
231b2fcc
TS
2707 && gfc_add_flavor (&sym->attr, FL_VARIABLE,
2708 sym->name, NULL) == FAILURE)
d3fcc995
TS
2709 {
2710 m = MATCH_ERROR;
2711 break;
2712 }
2713
2714 if (sym->ts.type == BT_UNKNOWN
2715 && gfc_set_default_type (sym, 1, NULL) == FAILURE)
2716 {
2717 m = MATCH_ERROR;
2718 break;
2719 }
2720
2721 e->ts = sym->ts;
860c8f3b
PB
2722 if (e->ref)
2723 e->ts.cl = NULL;
d3fcc995 2724 m = MATCH_YES;
6de9cd9a
DN
2725 break;
2726 }
6de9cd9a
DN
2727 }
2728
2729 /* Give up, assume we have a function. */
2730
2731 gfc_get_sym_tree (name, NULL, &symtree); /* Can't fail */
2732 sym = symtree->n.sym;
2733 e->expr_type = EXPR_FUNCTION;
2734
2735 if (!sym->attr.function
231b2fcc 2736 && gfc_add_function (&sym->attr, sym->name, NULL) == FAILURE)
6de9cd9a
DN
2737 {
2738 m = MATCH_ERROR;
2739 break;
2740 }
2741
2742 sym->result = sym;
2743
2744 m = gfc_match_actual_arglist (0, &e->value.function.actual);
2745 if (m == MATCH_NO)
2746 gfc_error ("Missing argument list in function '%s' at %C", sym->name);
2747
2748 if (m != MATCH_YES)
2749 {
2750 m = MATCH_ERROR;
2751 break;
2752 }
2753
2754 /* If our new function returns a character, array or structure
edf1eac2 2755 type, it might have subsequent references. */
6de9cd9a 2756
8e1f752a 2757 m = gfc_match_varspec (e, 0, false);
6de9cd9a
DN
2758 if (m == MATCH_NO)
2759 m = MATCH_YES;
2760
2761 break;
2762
2763 generic_function:
2764 gfc_get_sym_tree (name, NULL, &symtree); /* Can't fail */
2765
2766 e = gfc_get_expr ();
2767 e->symtree = symtree;
2768 e->expr_type = EXPR_FUNCTION;
2769
2770 m = gfc_match_actual_arglist (0, &e->value.function.actual);
2771 break;
2772
2773 default:
2774 gfc_error ("Symbol at %C is not appropriate for an expression");
2775 return MATCH_ERROR;
2776 }
2777
2778 if (m == MATCH_YES)
2779 {
2780 e->where = where;
2781 *result = e;
2782 }
2783 else
2784 gfc_free_expr (e);
2785
2786 return m;
2787}
2788
2789
df2fba9e 2790/* Match a variable, i.e. something that can be assigned to. This
6de9cd9a
DN
2791 starts as a symbol, can be a structure component or an array
2792 reference. It can be a function if the function doesn't have a
2793 separate RESULT variable. If the symbol has not been previously
30aabb86 2794 seen, we assume it is a variable.
6de9cd9a 2795
30aabb86
PT
2796 This function is called by two interface functions:
2797 gfc_match_variable, which has host_flag = 1, and
2798 gfc_match_equiv_variable, with host_flag = 0, to restrict the
2799 match of the symbol to the local scope. */
2800
2801static match
edf1eac2 2802match_variable (gfc_expr **result, int equiv_flag, int host_flag)
6de9cd9a
DN
2803{
2804 gfc_symbol *sym;
2805 gfc_symtree *st;
2806 gfc_expr *expr;
2807 locus where;
2808 match m;
2809
fd2aa7ad
PT
2810 /* Since nothing has any business being an lvalue in a module
2811 specification block, an interface block or a contains section,
2812 we force the changed_symbols mechanism to work by setting
2813 host_flag to 0. This prevents valid symbols that have the name
2814 of keywords, such as 'end', being turned into variables by
df2fba9e 2815 failed matching to assignments for, e.g., END INTERFACE. */
fd2aa7ad
PT
2816 if (gfc_current_state () == COMP_MODULE
2817 || gfc_current_state () == COMP_INTERFACE
2818 || gfc_current_state () == COMP_CONTAINS)
2819 host_flag = 0;
2820
30aabb86 2821 m = gfc_match_sym_tree (&st, host_flag);
6de9cd9a
DN
2822 if (m != MATCH_YES)
2823 return m;
63645982 2824 where = gfc_current_locus;
6de9cd9a
DN
2825
2826 sym = st->n.sym;
9a3db5a3
PT
2827
2828 /* If this is an implicit do loop index and implicitly typed,
2829 it should not be host associated. */
2830 m = check_for_implicit_index (&st, &sym);
2831 if (m != MATCH_YES)
2832 return m;
2833
2834 sym->attr.implied_index = 0;
2835
6de9cd9a
DN
2836 gfc_set_sym_referenced (sym);
2837 switch (sym->attr.flavor)
2838 {
2839 case FL_VARIABLE:
9aa433c2 2840 if (sym->attr.is_protected && sym->attr.use_assoc)
edf1eac2 2841 {
ee7e677f 2842 gfc_error ("Assigning to PROTECTED variable at %C");
edf1eac2
SK
2843 return MATCH_ERROR;
2844 }
6de9cd9a
DN
2845 break;
2846
2847 case FL_UNKNOWN:
d7e2fcd0
TB
2848 {
2849 sym_flavor flavor = FL_UNKNOWN;
2850
2851 gfc_gobble_whitespace ();
2852
2853 if (sym->attr.external || sym->attr.procedure
2854 || sym->attr.function || sym->attr.subroutine)
2855 flavor = FL_PROCEDURE;
b9332b09
PT
2856
2857 /* If it is not a procedure, is not typed and is host associated,
2858 we cannot give it a flavor yet. */
2859 else if (sym->ns == gfc_current_ns->parent
2860 && sym->ts.type == BT_UNKNOWN)
2861 break;
2862
2863 /* These are definitive indicators that this is a variable. */
8fc541d3 2864 else if (gfc_peek_ascii_char () != '(' || sym->ts.type != BT_UNKNOWN
d7e2fcd0
TB
2865 || sym->attr.pointer || sym->as != NULL)
2866 flavor = FL_VARIABLE;
2867
2868 if (flavor != FL_UNKNOWN
2869 && gfc_add_flavor (&sym->attr, flavor, sym->name, NULL) == FAILURE)
2870 return MATCH_ERROR;
2871 }
6de9cd9a
DN
2872 break;
2873
5056a350
SK
2874 case FL_PARAMETER:
2875 if (equiv_flag)
2876 gfc_error ("Named constant at %C in an EQUIVALENCE");
2877 else
2878 gfc_error ("Cannot assign to a named constant at %C");
2879 return MATCH_ERROR;
2880 break;
2881
6de9cd9a 2882 case FL_PROCEDURE:
01d2a7d7
DF
2883 /* Check for a nonrecursive function result variable. */
2884 if (sym->attr.function
2885 && !sym->attr.external
2886 && sym->result == sym
2887 && ((sym == gfc_current_ns->proc_name
2888 && sym == gfc_current_ns->proc_name->result)
2889 || (gfc_current_ns->parent
2890 && sym == gfc_current_ns->parent->proc_name->result)
2891 || (sym->attr.entry
2892 && sym->ns == gfc_current_ns)
2893 || (sym->attr.entry
2894 && sym->ns == gfc_current_ns->parent)))
6de9cd9a 2895 {
6de9cd9a
DN
2896 /* If a function result is a derived type, then the derived
2897 type may still have to be resolved. */
2898
2899 if (sym->ts.type == BT_DERIVED
2900 && gfc_use_derived (sym->ts.derived) == NULL)
2901 return MATCH_ERROR;
6de9cd9a
DN
2902 break;
2903 }
2904
8fb74da4
JW
2905 if (sym->attr.proc_pointer)
2906 break;
2907
6de9cd9a
DN
2908 /* Fall through to error */
2909
2910 default:
d7e2fcd0 2911 gfc_error ("'%s' at %C is not a variable", sym->name);
6de9cd9a
DN
2912 return MATCH_ERROR;
2913 }
2914
0dd973dd
PB
2915 /* Special case for derived type variables that get their types
2916 via an IMPLICIT statement. This can't wait for the
2917 resolution phase. */
2918
2919 {
2920 gfc_namespace * implicit_ns;
2921
2922 if (gfc_current_ns->proc_name == sym)
2923 implicit_ns = gfc_current_ns;
2924 else
2925 implicit_ns = sym->ns;
2926
8fc541d3 2927 if (gfc_peek_ascii_char () == '%'
0dd973dd
PB
2928 && sym->ts.type == BT_UNKNOWN
2929 && gfc_get_default_type (sym, implicit_ns)->type == BT_DERIVED)
2930 gfc_set_default_type (sym, 0, implicit_ns);
2931 }
2932
6de9cd9a
DN
2933 expr = gfc_get_expr ();
2934
2935 expr->expr_type = EXPR_VARIABLE;
2936 expr->symtree = st;
2937 expr->ts = sym->ts;
2938 expr->where = where;
2939
2940 /* Now see if we have to do more. */
8e1f752a 2941 m = gfc_match_varspec (expr, equiv_flag, false);
6de9cd9a
DN
2942 if (m != MATCH_YES)
2943 {
2944 gfc_free_expr (expr);
2945 return m;
2946 }
2947
2948 *result = expr;
2949 return MATCH_YES;
2950}
30aabb86 2951
edf1eac2 2952
30aabb86 2953match
edf1eac2 2954gfc_match_variable (gfc_expr **result, int equiv_flag)
30aabb86
PT
2955{
2956 return match_variable (result, equiv_flag, 1);
2957}
2958
edf1eac2 2959
30aabb86 2960match
edf1eac2 2961gfc_match_equiv_variable (gfc_expr **result)
30aabb86
PT
2962{
2963 return match_variable (result, 1, 0);
2964}
2965