PR fortran/95373 - ICE in build_reference_type, at tree.c:7942
[gcc.git] / gcc / fortran / primary.c
1 /* Primary expression subroutines
2 Copyright (C) 2000-2020 Free Software Foundation, Inc.
3 Contributed by Andy Vaught
4
5 This file is part of GCC.
6
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
10 version.
11
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
20
21 #include "config.h"
22 #include "system.h"
23 #include "coretypes.h"
24 #include "options.h"
25 #include "gfortran.h"
26 #include "arith.h"
27 #include "match.h"
28 #include "parse.h"
29 #include "constructor.h"
30
31 int matching_actual_arglist = 0;
32
33 /* Matches a kind-parameter expression, which is either a named
34 symbolic constant or a nonnegative integer constant. If
35 successful, sets the kind value to the correct integer.
36 The argument 'is_iso_c' signals whether the kind is an ISO_C_BINDING
37 symbol like e.g. 'c_int'. */
38
39 static match
40 match_kind_param (int *kind, int *is_iso_c)
41 {
42 char name[GFC_MAX_SYMBOL_LEN + 1];
43 gfc_symbol *sym;
44 match m;
45
46 *is_iso_c = 0;
47
48 m = gfc_match_small_literal_int (kind, NULL);
49 if (m != MATCH_NO)
50 return m;
51
52 m = gfc_match_name (name);
53 if (m != MATCH_YES)
54 return m;
55
56 if (gfc_find_symbol (name, NULL, 1, &sym))
57 return MATCH_ERROR;
58
59 if (sym == NULL)
60 return MATCH_NO;
61
62 *is_iso_c = sym->attr.is_iso_c;
63
64 if (sym->attr.flavor != FL_PARAMETER)
65 return MATCH_NO;
66
67 if (sym->value == NULL)
68 return MATCH_NO;
69
70 if (gfc_extract_int (sym->value, kind))
71 return MATCH_NO;
72
73 gfc_set_sym_referenced (sym);
74
75 if (*kind < 0)
76 return MATCH_NO;
77
78 return MATCH_YES;
79 }
80
81
82 /* Get a trailing kind-specification for non-character variables.
83 Returns:
84 * the integer kind value or
85 * -1 if an error was generated,
86 * -2 if no kind was found.
87 The argument 'is_iso_c' signals whether the kind is an ISO_C_BINDING
88 symbol like e.g. 'c_int'. */
89
90 static int
91 get_kind (int *is_iso_c)
92 {
93 int kind;
94 match m;
95
96 *is_iso_c = 0;
97
98 if (gfc_match_char ('_') != MATCH_YES)
99 return -2;
100
101 m = match_kind_param (&kind, is_iso_c);
102 if (m == MATCH_NO)
103 gfc_error ("Missing kind-parameter at %C");
104
105 return (m == MATCH_YES) ? kind : -1;
106 }
107
108
109 /* Given a character and a radix, see if the character is a valid
110 digit in that radix. */
111
112 int
113 gfc_check_digit (char c, int radix)
114 {
115 int r;
116
117 switch (radix)
118 {
119 case 2:
120 r = ('0' <= c && c <= '1');
121 break;
122
123 case 8:
124 r = ('0' <= c && c <= '7');
125 break;
126
127 case 10:
128 r = ('0' <= c && c <= '9');
129 break;
130
131 case 16:
132 r = ISXDIGIT (c);
133 break;
134
135 default:
136 gfc_internal_error ("gfc_check_digit(): bad radix");
137 }
138
139 return r;
140 }
141
142
143 /* Match the digit string part of an integer if signflag is not set,
144 the signed digit string part if signflag is set. If the buffer
145 is NULL, we just count characters for the resolution pass. Returns
146 the number of characters matched, -1 for no match. */
147
148 static int
149 match_digits (int signflag, int radix, char *buffer)
150 {
151 locus old_loc;
152 int length;
153 char c;
154
155 length = 0;
156 c = gfc_next_ascii_char ();
157
158 if (signflag && (c == '+' || c == '-'))
159 {
160 if (buffer != NULL)
161 *buffer++ = c;
162 gfc_gobble_whitespace ();
163 c = gfc_next_ascii_char ();
164 length++;
165 }
166
167 if (!gfc_check_digit (c, radix))
168 return -1;
169
170 length++;
171 if (buffer != NULL)
172 *buffer++ = c;
173
174 for (;;)
175 {
176 old_loc = gfc_current_locus;
177 c = gfc_next_ascii_char ();
178
179 if (!gfc_check_digit (c, radix))
180 break;
181
182 if (buffer != NULL)
183 *buffer++ = c;
184 length++;
185 }
186
187 gfc_current_locus = old_loc;
188
189 return length;
190 }
191
192 /* Convert an integer string to an expression node. */
193
194 static gfc_expr *
195 convert_integer (const char *buffer, int kind, int radix, locus *where)
196 {
197 gfc_expr *e;
198 const char *t;
199
200 e = gfc_get_constant_expr (BT_INTEGER, kind, where);
201 /* A leading plus is allowed, but not by mpz_set_str. */
202 if (buffer[0] == '+')
203 t = buffer + 1;
204 else
205 t = buffer;
206 mpz_set_str (e->value.integer, t, radix);
207
208 return e;
209 }
210
211
212 /* Convert a real string to an expression node. */
213
214 static gfc_expr *
215 convert_real (const char *buffer, int kind, locus *where)
216 {
217 gfc_expr *e;
218
219 e = gfc_get_constant_expr (BT_REAL, kind, where);
220 mpfr_set_str (e->value.real, buffer, 10, GFC_RND_MODE);
221
222 return e;
223 }
224
225
226 /* Convert a pair of real, constant expression nodes to a single
227 complex expression node. */
228
229 static gfc_expr *
230 convert_complex (gfc_expr *real, gfc_expr *imag, int kind)
231 {
232 gfc_expr *e;
233
234 e = gfc_get_constant_expr (BT_COMPLEX, kind, &real->where);
235 mpc_set_fr_fr (e->value.complex, real->value.real, imag->value.real,
236 GFC_MPC_RND_MODE);
237
238 return e;
239 }
240
241
242 /* Match an integer (digit string and optional kind).
243 A sign will be accepted if signflag is set. */
244
245 static match
246 match_integer_constant (gfc_expr **result, int signflag)
247 {
248 int length, kind, is_iso_c;
249 locus old_loc;
250 char *buffer;
251 gfc_expr *e;
252
253 old_loc = gfc_current_locus;
254 gfc_gobble_whitespace ();
255
256 length = match_digits (signflag, 10, NULL);
257 gfc_current_locus = old_loc;
258 if (length == -1)
259 return MATCH_NO;
260
261 buffer = (char *) alloca (length + 1);
262 memset (buffer, '\0', length + 1);
263
264 gfc_gobble_whitespace ();
265
266 match_digits (signflag, 10, buffer);
267
268 kind = get_kind (&is_iso_c);
269 if (kind == -2)
270 kind = gfc_default_integer_kind;
271 if (kind == -1)
272 return MATCH_ERROR;
273
274 if (kind == 4 && flag_integer4_kind == 8)
275 kind = 8;
276
277 if (gfc_validate_kind (BT_INTEGER, kind, true) < 0)
278 {
279 gfc_error ("Integer kind %d at %C not available", kind);
280 return MATCH_ERROR;
281 }
282
283 e = convert_integer (buffer, kind, 10, &gfc_current_locus);
284 e->ts.is_c_interop = is_iso_c;
285
286 if (gfc_range_check (e) != ARITH_OK)
287 {
288 gfc_error ("Integer too big for its kind at %C. This check can be "
289 "disabled with the option %<-fno-range-check%>");
290
291 gfc_free_expr (e);
292 return MATCH_ERROR;
293 }
294
295 *result = e;
296 return MATCH_YES;
297 }
298
299
300 /* Match a Hollerith constant. */
301
302 static match
303 match_hollerith_constant (gfc_expr **result)
304 {
305 locus old_loc;
306 gfc_expr *e = NULL;
307 int num, pad;
308 int i;
309
310 old_loc = gfc_current_locus;
311 gfc_gobble_whitespace ();
312
313 if (match_integer_constant (&e, 0) == MATCH_YES
314 && gfc_match_char ('h') == MATCH_YES)
315 {
316 if (!gfc_notify_std (GFC_STD_LEGACY, "Hollerith constant at %C"))
317 goto cleanup;
318
319 if (gfc_extract_int (e, &num, 1))
320 goto cleanup;
321 if (num == 0)
322 {
323 gfc_error ("Invalid Hollerith constant: %L must contain at least "
324 "one character", &old_loc);
325 goto cleanup;
326 }
327 if (e->ts.kind != gfc_default_integer_kind)
328 {
329 gfc_error ("Invalid Hollerith constant: Integer kind at %L "
330 "should be default", &old_loc);
331 goto cleanup;
332 }
333 else
334 {
335 gfc_free_expr (e);
336 e = gfc_get_constant_expr (BT_HOLLERITH, gfc_default_character_kind,
337 &gfc_current_locus);
338
339 /* Calculate padding needed to fit default integer memory. */
340 pad = gfc_default_integer_kind - (num % gfc_default_integer_kind);
341
342 e->representation.string = XCNEWVEC (char, num + pad + 1);
343
344 for (i = 0; i < num; i++)
345 {
346 gfc_char_t c = gfc_next_char_literal (INSTRING_WARN);
347 if (! gfc_wide_fits_in_byte (c))
348 {
349 gfc_error ("Invalid Hollerith constant at %L contains a "
350 "wide character", &old_loc);
351 goto cleanup;
352 }
353
354 e->representation.string[i] = (unsigned char) c;
355 }
356
357 /* Now pad with blanks and end with a null char. */
358 for (i = 0; i < pad; i++)
359 e->representation.string[num + i] = ' ';
360
361 e->representation.string[num + i] = '\0';
362 e->representation.length = num + pad;
363 e->ts.u.pad = pad;
364
365 *result = e;
366 return MATCH_YES;
367 }
368 }
369
370 gfc_free_expr (e);
371 gfc_current_locus = old_loc;
372 return MATCH_NO;
373
374 cleanup:
375 gfc_free_expr (e);
376 return MATCH_ERROR;
377 }
378
379
380 /* Match a binary, octal or hexadecimal constant that can be found in
381 a DATA statement. The standard permits b'010...', o'73...', and
382 z'a1...' where b, o, and z can be capital letters. This function
383 also accepts postfixed forms of the constants: '01...'b, '73...'o,
384 and 'a1...'z. An additional extension is the use of x for z. */
385
386 static match
387 match_boz_constant (gfc_expr **result)
388 {
389 int radix, length, x_hex;
390 locus old_loc, start_loc;
391 char *buffer, post, delim;
392 gfc_expr *e;
393
394 start_loc = old_loc = gfc_current_locus;
395 gfc_gobble_whitespace ();
396
397 x_hex = 0;
398 switch (post = gfc_next_ascii_char ())
399 {
400 case 'b':
401 radix = 2;
402 post = 0;
403 break;
404 case 'o':
405 radix = 8;
406 post = 0;
407 break;
408 case 'x':
409 x_hex = 1;
410 /* Fall through. */
411 case 'z':
412 radix = 16;
413 post = 0;
414 break;
415 case '\'':
416 /* Fall through. */
417 case '\"':
418 delim = post;
419 post = 1;
420 radix = 16; /* Set to accept any valid digit string. */
421 break;
422 default:
423 goto backup;
424 }
425
426 /* No whitespace allowed here. */
427
428 if (post == 0)
429 delim = gfc_next_ascii_char ();
430
431 if (delim != '\'' && delim != '\"')
432 goto backup;
433
434 if (x_hex
435 && gfc_invalid_boz ("Hexadecimal constant at %L uses "
436 "nonstandard X instead of Z", &gfc_current_locus))
437 return MATCH_ERROR;
438
439 old_loc = gfc_current_locus;
440
441 length = match_digits (0, radix, NULL);
442 if (length == -1)
443 {
444 gfc_error ("Empty set of digits in BOZ constant at %C");
445 return MATCH_ERROR;
446 }
447
448 if (gfc_next_ascii_char () != delim)
449 {
450 gfc_error ("Illegal character in BOZ constant at %C");
451 return MATCH_ERROR;
452 }
453
454 if (post == 1)
455 {
456 switch (gfc_next_ascii_char ())
457 {
458 case 'b':
459 radix = 2;
460 break;
461 case 'o':
462 radix = 8;
463 break;
464 case 'x':
465 /* Fall through. */
466 case 'z':
467 radix = 16;
468 break;
469 default:
470 goto backup;
471 }
472
473 if (gfc_invalid_boz ("BOZ constant at %C uses nonstandard postfix "
474 "syntax", &gfc_current_locus))
475 return MATCH_ERROR;
476 }
477
478 gfc_current_locus = old_loc;
479
480 buffer = (char *) alloca (length + 1);
481 memset (buffer, '\0', length + 1);
482
483 match_digits (0, radix, buffer);
484 gfc_next_ascii_char (); /* Eat delimiter. */
485 if (post == 1)
486 gfc_next_ascii_char (); /* Eat postfixed b, o, z, or x. */
487
488 e = gfc_get_expr ();
489 e->expr_type = EXPR_CONSTANT;
490 e->ts.type = BT_BOZ;
491 e->where = gfc_current_locus;
492 e->boz.rdx = radix;
493 e->boz.len = length;
494 e->boz.str = XCNEWVEC (char, length + 1);
495 strncpy (e->boz.str, buffer, length);
496
497 if (!gfc_in_match_data ()
498 && (!gfc_notify_std(GFC_STD_F2003, "BOZ used outside a DATA "
499 "statement at %L", &e->where)))
500 return MATCH_ERROR;
501
502 *result = e;
503 return MATCH_YES;
504
505 backup:
506 gfc_current_locus = start_loc;
507 return MATCH_NO;
508 }
509
510
511 /* Match a real constant of some sort. Allow a signed constant if signflag
512 is nonzero. */
513
514 static match
515 match_real_constant (gfc_expr **result, int signflag)
516 {
517 int kind, count, seen_dp, seen_digits, is_iso_c, default_exponent;
518 locus old_loc, temp_loc;
519 char *p, *buffer, c, exp_char;
520 gfc_expr *e;
521 bool negate;
522
523 old_loc = gfc_current_locus;
524 gfc_gobble_whitespace ();
525
526 e = NULL;
527
528 default_exponent = 0;
529 count = 0;
530 seen_dp = 0;
531 seen_digits = 0;
532 exp_char = ' ';
533 negate = FALSE;
534
535 c = gfc_next_ascii_char ();
536 if (signflag && (c == '+' || c == '-'))
537 {
538 if (c == '-')
539 negate = TRUE;
540
541 gfc_gobble_whitespace ();
542 c = gfc_next_ascii_char ();
543 }
544
545 /* Scan significand. */
546 for (;; c = gfc_next_ascii_char (), count++)
547 {
548 if (c == '.')
549 {
550 if (seen_dp)
551 goto done;
552
553 /* Check to see if "." goes with a following operator like
554 ".eq.". */
555 temp_loc = gfc_current_locus;
556 c = gfc_next_ascii_char ();
557
558 if (c == 'e' || c == 'd' || c == 'q')
559 {
560 c = gfc_next_ascii_char ();
561 if (c == '.')
562 goto done; /* Operator named .e. or .d. */
563 }
564
565 if (ISALPHA (c))
566 goto done; /* Distinguish 1.e9 from 1.eq.2 */
567
568 gfc_current_locus = temp_loc;
569 seen_dp = 1;
570 continue;
571 }
572
573 if (ISDIGIT (c))
574 {
575 seen_digits = 1;
576 continue;
577 }
578
579 break;
580 }
581
582 if (!seen_digits || (c != 'e' && c != 'd' && c != 'q'))
583 goto done;
584 exp_char = c;
585
586
587 if (c == 'q')
588 {
589 if (!gfc_notify_std (GFC_STD_GNU, "exponent-letter 'q' in "
590 "real-literal-constant at %C"))
591 return MATCH_ERROR;
592 else if (warn_real_q_constant)
593 gfc_warning (OPT_Wreal_q_constant,
594 "Extension: exponent-letter %<q%> in real-literal-constant "
595 "at %C");
596 }
597
598 /* Scan exponent. */
599 c = gfc_next_ascii_char ();
600 count++;
601
602 if (c == '+' || c == '-')
603 { /* optional sign */
604 c = gfc_next_ascii_char ();
605 count++;
606 }
607
608 if (!ISDIGIT (c))
609 {
610 /* With -fdec, default exponent to 0 instead of complaining. */
611 if (flag_dec)
612 default_exponent = 1;
613 else
614 {
615 gfc_error ("Missing exponent in real number at %C");
616 return MATCH_ERROR;
617 }
618 }
619
620 while (ISDIGIT (c))
621 {
622 c = gfc_next_ascii_char ();
623 count++;
624 }
625
626 done:
627 /* Check that we have a numeric constant. */
628 if (!seen_digits || (!seen_dp && exp_char == ' '))
629 {
630 gfc_current_locus = old_loc;
631 return MATCH_NO;
632 }
633
634 /* Convert the number. */
635 gfc_current_locus = old_loc;
636 gfc_gobble_whitespace ();
637
638 buffer = (char *) alloca (count + default_exponent + 1);
639 memset (buffer, '\0', count + default_exponent + 1);
640
641 p = buffer;
642 c = gfc_next_ascii_char ();
643 if (c == '+' || c == '-')
644 {
645 gfc_gobble_whitespace ();
646 c = gfc_next_ascii_char ();
647 }
648
649 /* Hack for mpfr_set_str(). */
650 for (;;)
651 {
652 if (c == 'd' || c == 'q')
653 *p = 'e';
654 else
655 *p = c;
656 p++;
657 if (--count == 0)
658 break;
659
660 c = gfc_next_ascii_char ();
661 }
662 if (default_exponent)
663 *p++ = '0';
664
665 kind = get_kind (&is_iso_c);
666 if (kind == -1)
667 goto cleanup;
668
669 switch (exp_char)
670 {
671 case 'd':
672 if (kind != -2)
673 {
674 gfc_error ("Real number at %C has a %<d%> exponent and an explicit "
675 "kind");
676 goto cleanup;
677 }
678 kind = gfc_default_double_kind;
679
680 if (kind == 4)
681 {
682 if (flag_real4_kind == 8)
683 kind = 8;
684 if (flag_real4_kind == 10)
685 kind = 10;
686 if (flag_real4_kind == 16)
687 kind = 16;
688 }
689
690 if (kind == 8)
691 {
692 if (flag_real8_kind == 4)
693 kind = 4;
694 if (flag_real8_kind == 10)
695 kind = 10;
696 if (flag_real8_kind == 16)
697 kind = 16;
698 }
699 break;
700
701 case 'q':
702 if (kind != -2)
703 {
704 gfc_error ("Real number at %C has a %<q%> exponent and an explicit "
705 "kind");
706 goto cleanup;
707 }
708
709 /* The maximum possible real kind type parameter is 16. First, try
710 that for the kind, then fallback to trying kind=10 (Intel 80 bit)
711 extended precision. If neither value works, just given up. */
712 kind = 16;
713 if (gfc_validate_kind (BT_REAL, kind, true) < 0)
714 {
715 kind = 10;
716 if (gfc_validate_kind (BT_REAL, kind, true) < 0)
717 {
718 gfc_error ("Invalid exponent-letter %<q%> in "
719 "real-literal-constant at %C");
720 goto cleanup;
721 }
722 }
723 break;
724
725 default:
726 if (kind == -2)
727 kind = gfc_default_real_kind;
728
729 if (kind == 4)
730 {
731 if (flag_real4_kind == 8)
732 kind = 8;
733 if (flag_real4_kind == 10)
734 kind = 10;
735 if (flag_real4_kind == 16)
736 kind = 16;
737 }
738
739 if (kind == 8)
740 {
741 if (flag_real8_kind == 4)
742 kind = 4;
743 if (flag_real8_kind == 10)
744 kind = 10;
745 if (flag_real8_kind == 16)
746 kind = 16;
747 }
748
749 if (gfc_validate_kind (BT_REAL, kind, true) < 0)
750 {
751 gfc_error ("Invalid real kind %d at %C", kind);
752 goto cleanup;
753 }
754 }
755
756 e = convert_real (buffer, kind, &gfc_current_locus);
757 if (negate)
758 mpfr_neg (e->value.real, e->value.real, GFC_RND_MODE);
759 e->ts.is_c_interop = is_iso_c;
760
761 switch (gfc_range_check (e))
762 {
763 case ARITH_OK:
764 break;
765 case ARITH_OVERFLOW:
766 gfc_error ("Real constant overflows its kind at %C");
767 goto cleanup;
768
769 case ARITH_UNDERFLOW:
770 if (warn_underflow)
771 gfc_warning (OPT_Wunderflow, "Real constant underflows its kind at %C");
772 mpfr_set_ui (e->value.real, 0, GFC_RND_MODE);
773 break;
774
775 default:
776 gfc_internal_error ("gfc_range_check() returned bad value");
777 }
778
779 /* Warn about trailing digits which suggest the user added too many
780 trailing digits, which may cause the appearance of higher pecision
781 than the kind kan support.
782
783 This is done by replacing the rightmost non-zero digit with zero
784 and comparing with the original value. If these are equal, we
785 assume the user supplied more digits than intended (or forgot to
786 convert to the correct kind).
787 */
788
789 if (warn_conversion_extra)
790 {
791 mpfr_t r;
792 char *c1;
793 bool did_break;
794
795 c1 = strchr (buffer, 'e');
796 if (c1 == NULL)
797 c1 = buffer + strlen(buffer);
798
799 did_break = false;
800 for (p = c1; p > buffer;)
801 {
802 p--;
803 if (*p == '.')
804 continue;
805
806 if (*p != '0')
807 {
808 *p = '0';
809 did_break = true;
810 break;
811 }
812 }
813
814 if (did_break)
815 {
816 mpfr_init (r);
817 mpfr_set_str (r, buffer, 10, GFC_RND_MODE);
818 if (negate)
819 mpfr_neg (r, r, GFC_RND_MODE);
820
821 mpfr_sub (r, r, e->value.real, GFC_RND_MODE);
822
823 if (mpfr_cmp_ui (r, 0) == 0)
824 gfc_warning (OPT_Wconversion_extra, "Non-significant digits "
825 "in %qs number at %C, maybe incorrect KIND",
826 gfc_typename (&e->ts));
827
828 mpfr_clear (r);
829 }
830 }
831
832 *result = e;
833 return MATCH_YES;
834
835 cleanup:
836 gfc_free_expr (e);
837 return MATCH_ERROR;
838 }
839
840
841 /* Match a substring reference. */
842
843 static match
844 match_substring (gfc_charlen *cl, int init, gfc_ref **result, bool deferred)
845 {
846 gfc_expr *start, *end;
847 locus old_loc;
848 gfc_ref *ref;
849 match m;
850
851 start = NULL;
852 end = NULL;
853
854 old_loc = gfc_current_locus;
855
856 m = gfc_match_char ('(');
857 if (m != MATCH_YES)
858 return MATCH_NO;
859
860 if (gfc_match_char (':') != MATCH_YES)
861 {
862 if (init)
863 m = gfc_match_init_expr (&start);
864 else
865 m = gfc_match_expr (&start);
866
867 if (m != MATCH_YES)
868 {
869 m = MATCH_NO;
870 goto cleanup;
871 }
872
873 m = gfc_match_char (':');
874 if (m != MATCH_YES)
875 goto cleanup;
876 }
877
878 if (gfc_match_char (')') != MATCH_YES)
879 {
880 if (init)
881 m = gfc_match_init_expr (&end);
882 else
883 m = gfc_match_expr (&end);
884
885 if (m == MATCH_NO)
886 goto syntax;
887 if (m == MATCH_ERROR)
888 goto cleanup;
889
890 m = gfc_match_char (')');
891 if (m == MATCH_NO)
892 goto syntax;
893 }
894
895 /* Optimize away the (:) reference. */
896 if (start == NULL && end == NULL && !deferred)
897 ref = NULL;
898 else
899 {
900 ref = gfc_get_ref ();
901
902 ref->type = REF_SUBSTRING;
903 if (start == NULL)
904 start = gfc_get_int_expr (gfc_charlen_int_kind, NULL, 1);
905 ref->u.ss.start = start;
906 if (end == NULL && cl)
907 end = gfc_copy_expr (cl->length);
908 ref->u.ss.end = end;
909 ref->u.ss.length = cl;
910 }
911
912 *result = ref;
913 return MATCH_YES;
914
915 syntax:
916 gfc_error ("Syntax error in SUBSTRING specification at %C");
917 m = MATCH_ERROR;
918
919 cleanup:
920 gfc_free_expr (start);
921 gfc_free_expr (end);
922
923 gfc_current_locus = old_loc;
924 return m;
925 }
926
927
928 /* Reads the next character of a string constant, taking care to
929 return doubled delimiters on the input as a single instance of
930 the delimiter.
931
932 Special return values for "ret" argument are:
933 -1 End of the string, as determined by the delimiter
934 -2 Unterminated string detected
935
936 Backslash codes are also expanded at this time. */
937
938 static gfc_char_t
939 next_string_char (gfc_char_t delimiter, int *ret)
940 {
941 locus old_locus;
942 gfc_char_t c;
943
944 c = gfc_next_char_literal (INSTRING_WARN);
945 *ret = 0;
946
947 if (c == '\n')
948 {
949 *ret = -2;
950 return 0;
951 }
952
953 if (flag_backslash && c == '\\')
954 {
955 old_locus = gfc_current_locus;
956
957 if (gfc_match_special_char (&c) == MATCH_NO)
958 gfc_current_locus = old_locus;
959
960 if (!(gfc_option.allow_std & GFC_STD_GNU) && !inhibit_warnings)
961 gfc_warning (0, "Extension: backslash character at %C");
962 }
963
964 if (c != delimiter)
965 return c;
966
967 old_locus = gfc_current_locus;
968 c = gfc_next_char_literal (NONSTRING);
969
970 if (c == delimiter)
971 return c;
972 gfc_current_locus = old_locus;
973
974 *ret = -1;
975 return 0;
976 }
977
978
979 /* Special case of gfc_match_name() that matches a parameter kind name
980 before a string constant. This takes case of the weird but legal
981 case of:
982
983 kind_____'string'
984
985 where kind____ is a parameter. gfc_match_name() will happily slurp
986 up all the underscores, which leads to problems. If we return
987 MATCH_YES, the parse pointer points to the final underscore, which
988 is not part of the name. We never return MATCH_ERROR-- errors in
989 the name will be detected later. */
990
991 static match
992 match_charkind_name (char *name)
993 {
994 locus old_loc;
995 char c, peek;
996 int len;
997
998 gfc_gobble_whitespace ();
999 c = gfc_next_ascii_char ();
1000 if (!ISALPHA (c))
1001 return MATCH_NO;
1002
1003 *name++ = c;
1004 len = 1;
1005
1006 for (;;)
1007 {
1008 old_loc = gfc_current_locus;
1009 c = gfc_next_ascii_char ();
1010
1011 if (c == '_')
1012 {
1013 peek = gfc_peek_ascii_char ();
1014
1015 if (peek == '\'' || peek == '\"')
1016 {
1017 gfc_current_locus = old_loc;
1018 *name = '\0';
1019 return MATCH_YES;
1020 }
1021 }
1022
1023 if (!ISALNUM (c)
1024 && c != '_'
1025 && (c != '$' || !flag_dollar_ok))
1026 break;
1027
1028 *name++ = c;
1029 if (++len > GFC_MAX_SYMBOL_LEN)
1030 break;
1031 }
1032
1033 return MATCH_NO;
1034 }
1035
1036
1037 /* See if the current input matches a character constant. Lots of
1038 contortions have to be done to match the kind parameter which comes
1039 before the actual string. The main consideration is that we don't
1040 want to error out too quickly. For example, we don't actually do
1041 any validation of the kinds until we have actually seen a legal
1042 delimiter. Using match_kind_param() generates errors too quickly. */
1043
1044 static match
1045 match_string_constant (gfc_expr **result)
1046 {
1047 char name[GFC_MAX_SYMBOL_LEN + 1], peek;
1048 size_t length;
1049 int kind,save_warn_ampersand, ret;
1050 locus old_locus, start_locus;
1051 gfc_symbol *sym;
1052 gfc_expr *e;
1053 match m;
1054 gfc_char_t c, delimiter, *p;
1055
1056 old_locus = gfc_current_locus;
1057
1058 gfc_gobble_whitespace ();
1059
1060 c = gfc_next_char ();
1061 if (c == '\'' || c == '"')
1062 {
1063 kind = gfc_default_character_kind;
1064 start_locus = gfc_current_locus;
1065 goto got_delim;
1066 }
1067
1068 if (gfc_wide_is_digit (c))
1069 {
1070 kind = 0;
1071
1072 while (gfc_wide_is_digit (c))
1073 {
1074 kind = kind * 10 + c - '0';
1075 if (kind > 9999999)
1076 goto no_match;
1077 c = gfc_next_char ();
1078 }
1079
1080 }
1081 else
1082 {
1083 gfc_current_locus = old_locus;
1084
1085 m = match_charkind_name (name);
1086 if (m != MATCH_YES)
1087 goto no_match;
1088
1089 if (gfc_find_symbol (name, NULL, 1, &sym)
1090 || sym == NULL
1091 || sym->attr.flavor != FL_PARAMETER)
1092 goto no_match;
1093
1094 kind = -1;
1095 c = gfc_next_char ();
1096 }
1097
1098 if (c == ' ')
1099 {
1100 gfc_gobble_whitespace ();
1101 c = gfc_next_char ();
1102 }
1103
1104 if (c != '_')
1105 goto no_match;
1106
1107 gfc_gobble_whitespace ();
1108
1109 c = gfc_next_char ();
1110 if (c != '\'' && c != '"')
1111 goto no_match;
1112
1113 start_locus = gfc_current_locus;
1114
1115 if (kind == -1)
1116 {
1117 if (gfc_extract_int (sym->value, &kind, 1))
1118 return MATCH_ERROR;
1119 gfc_set_sym_referenced (sym);
1120 }
1121
1122 if (gfc_validate_kind (BT_CHARACTER, kind, true) < 0)
1123 {
1124 gfc_error ("Invalid kind %d for CHARACTER constant at %C", kind);
1125 return MATCH_ERROR;
1126 }
1127
1128 got_delim:
1129 /* Scan the string into a block of memory by first figuring out how
1130 long it is, allocating the structure, then re-reading it. This
1131 isn't particularly efficient, but string constants aren't that
1132 common in most code. TODO: Use obstacks? */
1133
1134 delimiter = c;
1135 length = 0;
1136
1137 for (;;)
1138 {
1139 c = next_string_char (delimiter, &ret);
1140 if (ret == -1)
1141 break;
1142 if (ret == -2)
1143 {
1144 gfc_current_locus = start_locus;
1145 gfc_error ("Unterminated character constant beginning at %C");
1146 return MATCH_ERROR;
1147 }
1148
1149 length++;
1150 }
1151
1152 /* Peek at the next character to see if it is a b, o, z, or x for the
1153 postfixed BOZ literal constants. */
1154 peek = gfc_peek_ascii_char ();
1155 if (peek == 'b' || peek == 'o' || peek =='z' || peek == 'x')
1156 goto no_match;
1157
1158 e = gfc_get_character_expr (kind, &start_locus, NULL, length);
1159
1160 gfc_current_locus = start_locus;
1161
1162 /* We disable the warning for the following loop as the warning has already
1163 been printed in the loop above. */
1164 save_warn_ampersand = warn_ampersand;
1165 warn_ampersand = false;
1166
1167 p = e->value.character.string;
1168 for (size_t i = 0; i < length; i++)
1169 {
1170 c = next_string_char (delimiter, &ret);
1171
1172 if (!gfc_check_character_range (c, kind))
1173 {
1174 gfc_free_expr (e);
1175 gfc_error ("Character %qs in string at %C is not representable "
1176 "in character kind %d", gfc_print_wide_char (c), kind);
1177 return MATCH_ERROR;
1178 }
1179
1180 *p++ = c;
1181 }
1182
1183 *p = '\0'; /* TODO: C-style string is for development/debug purposes. */
1184 warn_ampersand = save_warn_ampersand;
1185
1186 next_string_char (delimiter, &ret);
1187 if (ret != -1)
1188 gfc_internal_error ("match_string_constant(): Delimiter not found");
1189
1190 if (match_substring (NULL, 0, &e->ref, false) != MATCH_NO)
1191 e->expr_type = EXPR_SUBSTRING;
1192
1193 *result = e;
1194
1195 return MATCH_YES;
1196
1197 no_match:
1198 gfc_current_locus = old_locus;
1199 return MATCH_NO;
1200 }
1201
1202
1203 /* Match a .true. or .false. Returns 1 if a .true. was found,
1204 0 if a .false. was found, and -1 otherwise. */
1205 static int
1206 match_logical_constant_string (void)
1207 {
1208 locus orig_loc = gfc_current_locus;
1209
1210 gfc_gobble_whitespace ();
1211 if (gfc_next_ascii_char () == '.')
1212 {
1213 char ch = gfc_next_ascii_char ();
1214 if (ch == 'f')
1215 {
1216 if (gfc_next_ascii_char () == 'a'
1217 && gfc_next_ascii_char () == 'l'
1218 && gfc_next_ascii_char () == 's'
1219 && gfc_next_ascii_char () == 'e'
1220 && gfc_next_ascii_char () == '.')
1221 /* Matched ".false.". */
1222 return 0;
1223 }
1224 else if (ch == 't')
1225 {
1226 if (gfc_next_ascii_char () == 'r'
1227 && gfc_next_ascii_char () == 'u'
1228 && gfc_next_ascii_char () == 'e'
1229 && gfc_next_ascii_char () == '.')
1230 /* Matched ".true.". */
1231 return 1;
1232 }
1233 }
1234 gfc_current_locus = orig_loc;
1235 return -1;
1236 }
1237
1238 /* Match a .true. or .false. */
1239
1240 static match
1241 match_logical_constant (gfc_expr **result)
1242 {
1243 gfc_expr *e;
1244 int i, kind, is_iso_c;
1245
1246 i = match_logical_constant_string ();
1247 if (i == -1)
1248 return MATCH_NO;
1249
1250 kind = get_kind (&is_iso_c);
1251 if (kind == -1)
1252 return MATCH_ERROR;
1253 if (kind == -2)
1254 kind = gfc_default_logical_kind;
1255
1256 if (gfc_validate_kind (BT_LOGICAL, kind, true) < 0)
1257 {
1258 gfc_error ("Bad kind for logical constant at %C");
1259 return MATCH_ERROR;
1260 }
1261
1262 e = gfc_get_logical_expr (kind, &gfc_current_locus, i);
1263 e->ts.is_c_interop = is_iso_c;
1264
1265 *result = e;
1266 return MATCH_YES;
1267 }
1268
1269
1270 /* Match a real or imaginary part of a complex constant that is a
1271 symbolic constant. */
1272
1273 static match
1274 match_sym_complex_part (gfc_expr **result)
1275 {
1276 char name[GFC_MAX_SYMBOL_LEN + 1];
1277 gfc_symbol *sym;
1278 gfc_expr *e;
1279 match m;
1280
1281 m = gfc_match_name (name);
1282 if (m != MATCH_YES)
1283 return m;
1284
1285 if (gfc_find_symbol (name, NULL, 1, &sym) || sym == NULL)
1286 return MATCH_NO;
1287
1288 if (sym->attr.flavor != FL_PARAMETER)
1289 {
1290 /* Give the matcher for implied do-loops a chance to run. This yields
1291 a much saner error message for "write(*,*) (i, i=1, 6" where the
1292 right parenthesis is missing. */
1293 char c;
1294 gfc_gobble_whitespace ();
1295 c = gfc_peek_ascii_char ();
1296 if (c == '=' || c == ',')
1297 {
1298 m = MATCH_NO;
1299 }
1300 else
1301 {
1302 gfc_error ("Expected PARAMETER symbol in complex constant at %C");
1303 m = MATCH_ERROR;
1304 }
1305 return m;
1306 }
1307
1308 if (!sym->value)
1309 goto error;
1310
1311 if (!gfc_numeric_ts (&sym->value->ts))
1312 {
1313 gfc_error ("Numeric PARAMETER required in complex constant at %C");
1314 return MATCH_ERROR;
1315 }
1316
1317 if (sym->value->rank != 0)
1318 {
1319 gfc_error ("Scalar PARAMETER required in complex constant at %C");
1320 return MATCH_ERROR;
1321 }
1322
1323 if (!gfc_notify_std (GFC_STD_F2003, "PARAMETER symbol in "
1324 "complex constant at %C"))
1325 return MATCH_ERROR;
1326
1327 switch (sym->value->ts.type)
1328 {
1329 case BT_REAL:
1330 e = gfc_copy_expr (sym->value);
1331 break;
1332
1333 case BT_COMPLEX:
1334 e = gfc_complex2real (sym->value, sym->value->ts.kind);
1335 if (e == NULL)
1336 goto error;
1337 break;
1338
1339 case BT_INTEGER:
1340 e = gfc_int2real (sym->value, gfc_default_real_kind);
1341 if (e == NULL)
1342 goto error;
1343 break;
1344
1345 default:
1346 gfc_internal_error ("gfc_match_sym_complex_part(): Bad type");
1347 }
1348
1349 *result = e; /* e is a scalar, real, constant expression. */
1350 return MATCH_YES;
1351
1352 error:
1353 gfc_error ("Error converting PARAMETER constant in complex constant at %C");
1354 return MATCH_ERROR;
1355 }
1356
1357
1358 /* Match a real or imaginary part of a complex number. */
1359
1360 static match
1361 match_complex_part (gfc_expr **result)
1362 {
1363 match m;
1364
1365 m = match_sym_complex_part (result);
1366 if (m != MATCH_NO)
1367 return m;
1368
1369 m = match_real_constant (result, 1);
1370 if (m != MATCH_NO)
1371 return m;
1372
1373 return match_integer_constant (result, 1);
1374 }
1375
1376
1377 /* Try to match a complex constant. */
1378
1379 static match
1380 match_complex_constant (gfc_expr **result)
1381 {
1382 gfc_expr *e, *real, *imag;
1383 gfc_error_buffer old_error;
1384 gfc_typespec target;
1385 locus old_loc;
1386 int kind;
1387 match m;
1388
1389 old_loc = gfc_current_locus;
1390 real = imag = e = NULL;
1391
1392 m = gfc_match_char ('(');
1393 if (m != MATCH_YES)
1394 return m;
1395
1396 gfc_push_error (&old_error);
1397
1398 m = match_complex_part (&real);
1399 if (m == MATCH_NO)
1400 {
1401 gfc_free_error (&old_error);
1402 goto cleanup;
1403 }
1404
1405 if (gfc_match_char (',') == MATCH_NO)
1406 {
1407 /* It is possible that gfc_int2real issued a warning when
1408 converting an integer to real. Throw this away here. */
1409
1410 gfc_clear_warning ();
1411 gfc_pop_error (&old_error);
1412 m = MATCH_NO;
1413 goto cleanup;
1414 }
1415
1416 /* If m is error, then something was wrong with the real part and we
1417 assume we have a complex constant because we've seen the ','. An
1418 ambiguous case here is the start of an iterator list of some
1419 sort. These sort of lists are matched prior to coming here. */
1420
1421 if (m == MATCH_ERROR)
1422 {
1423 gfc_free_error (&old_error);
1424 goto cleanup;
1425 }
1426 gfc_pop_error (&old_error);
1427
1428 m = match_complex_part (&imag);
1429 if (m == MATCH_NO)
1430 goto syntax;
1431 if (m == MATCH_ERROR)
1432 goto cleanup;
1433
1434 m = gfc_match_char (')');
1435 if (m == MATCH_NO)
1436 {
1437 /* Give the matcher for implied do-loops a chance to run. This
1438 yields a much saner error message for (/ (i, 4=i, 6) /). */
1439 if (gfc_peek_ascii_char () == '=')
1440 {
1441 m = MATCH_ERROR;
1442 goto cleanup;
1443 }
1444 else
1445 goto syntax;
1446 }
1447
1448 if (m == MATCH_ERROR)
1449 goto cleanup;
1450
1451 /* Decide on the kind of this complex number. */
1452 if (real->ts.type == BT_REAL)
1453 {
1454 if (imag->ts.type == BT_REAL)
1455 kind = gfc_kind_max (real, imag);
1456 else
1457 kind = real->ts.kind;
1458 }
1459 else
1460 {
1461 if (imag->ts.type == BT_REAL)
1462 kind = imag->ts.kind;
1463 else
1464 kind = gfc_default_real_kind;
1465 }
1466 gfc_clear_ts (&target);
1467 target.type = BT_REAL;
1468 target.kind = kind;
1469
1470 if (real->ts.type != BT_REAL || kind != real->ts.kind)
1471 gfc_convert_type (real, &target, 2);
1472 if (imag->ts.type != BT_REAL || kind != imag->ts.kind)
1473 gfc_convert_type (imag, &target, 2);
1474
1475 e = convert_complex (real, imag, kind);
1476 e->where = gfc_current_locus;
1477
1478 gfc_free_expr (real);
1479 gfc_free_expr (imag);
1480
1481 *result = e;
1482 return MATCH_YES;
1483
1484 syntax:
1485 gfc_error ("Syntax error in COMPLEX constant at %C");
1486 m = MATCH_ERROR;
1487
1488 cleanup:
1489 gfc_free_expr (e);
1490 gfc_free_expr (real);
1491 gfc_free_expr (imag);
1492 gfc_current_locus = old_loc;
1493
1494 return m;
1495 }
1496
1497
1498 /* Match constants in any of several forms. Returns nonzero for a
1499 match, zero for no match. */
1500
1501 match
1502 gfc_match_literal_constant (gfc_expr **result, int signflag)
1503 {
1504 match m;
1505
1506 m = match_complex_constant (result);
1507 if (m != MATCH_NO)
1508 return m;
1509
1510 m = match_string_constant (result);
1511 if (m != MATCH_NO)
1512 return m;
1513
1514 m = match_boz_constant (result);
1515 if (m != MATCH_NO)
1516 return m;
1517
1518 m = match_real_constant (result, signflag);
1519 if (m != MATCH_NO)
1520 return m;
1521
1522 m = match_hollerith_constant (result);
1523 if (m != MATCH_NO)
1524 return m;
1525
1526 m = match_integer_constant (result, signflag);
1527 if (m != MATCH_NO)
1528 return m;
1529
1530 m = match_logical_constant (result);
1531 if (m != MATCH_NO)
1532 return m;
1533
1534 return MATCH_NO;
1535 }
1536
1537
1538 /* This checks if a symbol is the return value of an encompassing function.
1539 Function nesting can be maximally two levels deep, but we may have
1540 additional local namespaces like BLOCK etc. */
1541
1542 bool
1543 gfc_is_function_return_value (gfc_symbol *sym, gfc_namespace *ns)
1544 {
1545 if (!sym->attr.function || (sym->result != sym))
1546 return false;
1547 while (ns)
1548 {
1549 if (ns->proc_name == sym)
1550 return true;
1551 ns = ns->parent;
1552 }
1553 return false;
1554 }
1555
1556
1557 /* Match a single actual argument value. An actual argument is
1558 usually an expression, but can also be a procedure name. If the
1559 argument is a single name, it is not always possible to tell
1560 whether the name is a dummy procedure or not. We treat these cases
1561 by creating an argument that looks like a dummy procedure and
1562 fixing things later during resolution. */
1563
1564 static match
1565 match_actual_arg (gfc_expr **result)
1566 {
1567 char name[GFC_MAX_SYMBOL_LEN + 1];
1568 gfc_symtree *symtree;
1569 locus where, w;
1570 gfc_expr *e;
1571 char c;
1572
1573 gfc_gobble_whitespace ();
1574 where = gfc_current_locus;
1575
1576 switch (gfc_match_name (name))
1577 {
1578 case MATCH_ERROR:
1579 return MATCH_ERROR;
1580
1581 case MATCH_NO:
1582 break;
1583
1584 case MATCH_YES:
1585 w = gfc_current_locus;
1586 gfc_gobble_whitespace ();
1587 c = gfc_next_ascii_char ();
1588 gfc_current_locus = w;
1589
1590 if (c != ',' && c != ')')
1591 break;
1592
1593 if (gfc_find_sym_tree (name, NULL, 1, &symtree))
1594 break;
1595 /* Handle error elsewhere. */
1596
1597 /* Eliminate a couple of common cases where we know we don't
1598 have a function argument. */
1599 if (symtree == NULL)
1600 {
1601 gfc_get_sym_tree (name, NULL, &symtree, false);
1602 gfc_set_sym_referenced (symtree->n.sym);
1603 }
1604 else
1605 {
1606 gfc_symbol *sym;
1607
1608 sym = symtree->n.sym;
1609 gfc_set_sym_referenced (sym);
1610 if (sym->attr.flavor == FL_NAMELIST)
1611 {
1612 gfc_error ("Namelist %qs cannot be an argument at %L",
1613 sym->name, &where);
1614 break;
1615 }
1616 if (sym->attr.flavor != FL_PROCEDURE
1617 && sym->attr.flavor != FL_UNKNOWN)
1618 break;
1619
1620 if (sym->attr.in_common && !sym->attr.proc_pointer)
1621 {
1622 if (!gfc_add_flavor (&sym->attr, FL_VARIABLE,
1623 sym->name, &sym->declared_at))
1624 return MATCH_ERROR;
1625 break;
1626 }
1627
1628 /* If the symbol is a function with itself as the result and
1629 is being defined, then we have a variable. */
1630 if (sym->attr.function && sym->result == sym)
1631 {
1632 if (gfc_is_function_return_value (sym, gfc_current_ns))
1633 break;
1634
1635 if (sym->attr.entry
1636 && (sym->ns == gfc_current_ns
1637 || sym->ns == gfc_current_ns->parent))
1638 {
1639 gfc_entry_list *el = NULL;
1640
1641 for (el = sym->ns->entries; el; el = el->next)
1642 if (sym == el->sym)
1643 break;
1644
1645 if (el)
1646 break;
1647 }
1648 }
1649 }
1650
1651 e = gfc_get_expr (); /* Leave it unknown for now */
1652 e->symtree = symtree;
1653 e->expr_type = EXPR_VARIABLE;
1654 e->ts.type = BT_PROCEDURE;
1655 e->where = where;
1656
1657 *result = e;
1658 return MATCH_YES;
1659 }
1660
1661 gfc_current_locus = where;
1662 return gfc_match_expr (result);
1663 }
1664
1665
1666 /* Match a keyword argument or type parameter spec list.. */
1667
1668 static match
1669 match_keyword_arg (gfc_actual_arglist *actual, gfc_actual_arglist *base, bool pdt)
1670 {
1671 char name[GFC_MAX_SYMBOL_LEN + 1];
1672 gfc_actual_arglist *a;
1673 locus name_locus;
1674 match m;
1675
1676 name_locus = gfc_current_locus;
1677 m = gfc_match_name (name);
1678
1679 if (m != MATCH_YES)
1680 goto cleanup;
1681 if (gfc_match_char ('=') != MATCH_YES)
1682 {
1683 m = MATCH_NO;
1684 goto cleanup;
1685 }
1686
1687 if (pdt)
1688 {
1689 if (gfc_match_char ('*') == MATCH_YES)
1690 {
1691 actual->spec_type = SPEC_ASSUMED;
1692 goto add_name;
1693 }
1694 else if (gfc_match_char (':') == MATCH_YES)
1695 {
1696 actual->spec_type = SPEC_DEFERRED;
1697 goto add_name;
1698 }
1699 else
1700 actual->spec_type = SPEC_EXPLICIT;
1701 }
1702
1703 m = match_actual_arg (&actual->expr);
1704 if (m != MATCH_YES)
1705 goto cleanup;
1706
1707 /* Make sure this name has not appeared yet. */
1708 add_name:
1709 if (name[0] != '\0')
1710 {
1711 for (a = base; a; a = a->next)
1712 if (a->name != NULL && strcmp (a->name, name) == 0)
1713 {
1714 gfc_error ("Keyword %qs at %C has already appeared in the "
1715 "current argument list", name);
1716 return MATCH_ERROR;
1717 }
1718 }
1719
1720 actual->name = gfc_get_string ("%s", name);
1721 return MATCH_YES;
1722
1723 cleanup:
1724 gfc_current_locus = name_locus;
1725 return m;
1726 }
1727
1728
1729 /* Match an argument list function, such as %VAL. */
1730
1731 static match
1732 match_arg_list_function (gfc_actual_arglist *result)
1733 {
1734 char name[GFC_MAX_SYMBOL_LEN + 1];
1735 locus old_locus;
1736 match m;
1737
1738 old_locus = gfc_current_locus;
1739
1740 if (gfc_match_char ('%') != MATCH_YES)
1741 {
1742 m = MATCH_NO;
1743 goto cleanup;
1744 }
1745
1746 m = gfc_match ("%n (", name);
1747 if (m != MATCH_YES)
1748 goto cleanup;
1749
1750 if (name[0] != '\0')
1751 {
1752 switch (name[0])
1753 {
1754 case 'l':
1755 if (gfc_str_startswith (name, "loc"))
1756 {
1757 result->name = "%LOC";
1758 break;
1759 }
1760 /* FALLTHRU */
1761 case 'r':
1762 if (gfc_str_startswith (name, "ref"))
1763 {
1764 result->name = "%REF";
1765 break;
1766 }
1767 /* FALLTHRU */
1768 case 'v':
1769 if (gfc_str_startswith (name, "val"))
1770 {
1771 result->name = "%VAL";
1772 break;
1773 }
1774 /* FALLTHRU */
1775 default:
1776 m = MATCH_ERROR;
1777 goto cleanup;
1778 }
1779 }
1780
1781 if (!gfc_notify_std (GFC_STD_GNU, "argument list function at %C"))
1782 {
1783 m = MATCH_ERROR;
1784 goto cleanup;
1785 }
1786
1787 m = match_actual_arg (&result->expr);
1788 if (m != MATCH_YES)
1789 goto cleanup;
1790
1791 if (gfc_match_char (')') != MATCH_YES)
1792 {
1793 m = MATCH_NO;
1794 goto cleanup;
1795 }
1796
1797 return MATCH_YES;
1798
1799 cleanup:
1800 gfc_current_locus = old_locus;
1801 return m;
1802 }
1803
1804
1805 /* Matches an actual argument list of a function or subroutine, from
1806 the opening parenthesis to the closing parenthesis. The argument
1807 list is assumed to allow keyword arguments because we don't know if
1808 the symbol associated with the procedure has an implicit interface
1809 or not. We make sure keywords are unique. If sub_flag is set,
1810 we're matching the argument list of a subroutine.
1811
1812 NOTE: An alternative use for this function is to match type parameter
1813 spec lists, which are so similar to actual argument lists that the
1814 machinery can be reused. This use is flagged by the optional argument
1815 'pdt'. */
1816
1817 match
1818 gfc_match_actual_arglist (int sub_flag, gfc_actual_arglist **argp, bool pdt)
1819 {
1820 gfc_actual_arglist *head, *tail;
1821 int seen_keyword;
1822 gfc_st_label *label;
1823 locus old_loc;
1824 match m;
1825
1826 *argp = tail = NULL;
1827 old_loc = gfc_current_locus;
1828
1829 seen_keyword = 0;
1830
1831 if (gfc_match_char ('(') == MATCH_NO)
1832 return (sub_flag) ? MATCH_YES : MATCH_NO;
1833
1834 if (gfc_match_char (')') == MATCH_YES)
1835 return MATCH_YES;
1836
1837 head = NULL;
1838
1839 matching_actual_arglist++;
1840
1841 for (;;)
1842 {
1843 if (head == NULL)
1844 head = tail = gfc_get_actual_arglist ();
1845 else
1846 {
1847 tail->next = gfc_get_actual_arglist ();
1848 tail = tail->next;
1849 }
1850
1851 if (sub_flag && !pdt && gfc_match_char ('*') == MATCH_YES)
1852 {
1853 m = gfc_match_st_label (&label);
1854 if (m == MATCH_NO)
1855 gfc_error ("Expected alternate return label at %C");
1856 if (m != MATCH_YES)
1857 goto cleanup;
1858
1859 if (!gfc_notify_std (GFC_STD_F95_OBS, "Alternate-return argument "
1860 "at %C"))
1861 goto cleanup;
1862
1863 tail->label = label;
1864 goto next;
1865 }
1866
1867 if (pdt && !seen_keyword)
1868 {
1869 if (gfc_match_char (':') == MATCH_YES)
1870 {
1871 tail->spec_type = SPEC_DEFERRED;
1872 goto next;
1873 }
1874 else if (gfc_match_char ('*') == MATCH_YES)
1875 {
1876 tail->spec_type = SPEC_ASSUMED;
1877 goto next;
1878 }
1879 else
1880 tail->spec_type = SPEC_EXPLICIT;
1881
1882 m = match_keyword_arg (tail, head, pdt);
1883 if (m == MATCH_YES)
1884 {
1885 seen_keyword = 1;
1886 goto next;
1887 }
1888 if (m == MATCH_ERROR)
1889 goto cleanup;
1890 }
1891
1892 /* After the first keyword argument is seen, the following
1893 arguments must also have keywords. */
1894 if (seen_keyword)
1895 {
1896 m = match_keyword_arg (tail, head, pdt);
1897
1898 if (m == MATCH_ERROR)
1899 goto cleanup;
1900 if (m == MATCH_NO)
1901 {
1902 gfc_error ("Missing keyword name in actual argument list at %C");
1903 goto cleanup;
1904 }
1905
1906 }
1907 else
1908 {
1909 /* Try an argument list function, like %VAL. */
1910 m = match_arg_list_function (tail);
1911 if (m == MATCH_ERROR)
1912 goto cleanup;
1913
1914 /* See if we have the first keyword argument. */
1915 if (m == MATCH_NO)
1916 {
1917 m = match_keyword_arg (tail, head, false);
1918 if (m == MATCH_YES)
1919 seen_keyword = 1;
1920 if (m == MATCH_ERROR)
1921 goto cleanup;
1922 }
1923
1924 if (m == MATCH_NO)
1925 {
1926 /* Try for a non-keyword argument. */
1927 m = match_actual_arg (&tail->expr);
1928 if (m == MATCH_ERROR)
1929 goto cleanup;
1930 if (m == MATCH_NO)
1931 goto syntax;
1932 }
1933 }
1934
1935
1936 next:
1937 if (gfc_match_char (')') == MATCH_YES)
1938 break;
1939 if (gfc_match_char (',') != MATCH_YES)
1940 goto syntax;
1941 }
1942
1943 *argp = head;
1944 matching_actual_arglist--;
1945 return MATCH_YES;
1946
1947 syntax:
1948 gfc_error ("Syntax error in argument list at %C");
1949
1950 cleanup:
1951 gfc_free_actual_arglist (head);
1952 gfc_current_locus = old_loc;
1953 matching_actual_arglist--;
1954 return MATCH_ERROR;
1955 }
1956
1957
1958 /* Used by gfc_match_varspec() to extend the reference list by one
1959 element. */
1960
1961 static gfc_ref *
1962 extend_ref (gfc_expr *primary, gfc_ref *tail)
1963 {
1964 if (primary->ref == NULL)
1965 primary->ref = tail = gfc_get_ref ();
1966 else
1967 {
1968 if (tail == NULL)
1969 gfc_internal_error ("extend_ref(): Bad tail");
1970 tail->next = gfc_get_ref ();
1971 tail = tail->next;
1972 }
1973
1974 return tail;
1975 }
1976
1977
1978 /* Used by gfc_match_varspec() to match an inquiry reference. */
1979
1980 static bool
1981 is_inquiry_ref (const char *name, gfc_ref **ref)
1982 {
1983 inquiry_type type;
1984
1985 if (name == NULL)
1986 return false;
1987
1988 if (ref) *ref = NULL;
1989
1990 if (strcmp (name, "re") == 0)
1991 type = INQUIRY_RE;
1992 else if (strcmp (name, "im") == 0)
1993 type = INQUIRY_IM;
1994 else if (strcmp (name, "kind") == 0)
1995 type = INQUIRY_KIND;
1996 else if (strcmp (name, "len") == 0)
1997 type = INQUIRY_LEN;
1998 else
1999 return false;
2000
2001 if (ref)
2002 {
2003 *ref = gfc_get_ref ();
2004 (*ref)->type = REF_INQUIRY;
2005 (*ref)->u.i = type;
2006 }
2007
2008 return true;
2009 }
2010
2011
2012 /* Match any additional specifications associated with the current
2013 variable like member references or substrings. If equiv_flag is
2014 set we only match stuff that is allowed inside an EQUIVALENCE
2015 statement. sub_flag tells whether we expect a type-bound procedure found
2016 to be a subroutine as part of CALL or a FUNCTION. For procedure pointer
2017 components, 'ppc_arg' determines whether the PPC may be called (with an
2018 argument list), or whether it may just be referred to as a pointer. */
2019
2020 match
2021 gfc_match_varspec (gfc_expr *primary, int equiv_flag, bool sub_flag,
2022 bool ppc_arg)
2023 {
2024 char name[GFC_MAX_SYMBOL_LEN + 1];
2025 gfc_ref *substring, *tail, *tmp;
2026 gfc_component *component;
2027 gfc_symbol *sym = primary->symtree->n.sym;
2028 gfc_expr *tgt_expr = NULL;
2029 match m;
2030 bool unknown;
2031 bool inquiry;
2032 bool intrinsic;
2033 locus old_loc;
2034 char sep;
2035
2036 tail = NULL;
2037
2038 gfc_gobble_whitespace ();
2039
2040 if (gfc_peek_ascii_char () == '[')
2041 {
2042 if ((sym->ts.type != BT_CLASS && sym->attr.dimension)
2043 || (sym->ts.type == BT_CLASS && CLASS_DATA (sym)
2044 && CLASS_DATA (sym)->attr.dimension))
2045 {
2046 gfc_error ("Array section designator, e.g. '(:)', is required "
2047 "besides the coarray designator '[...]' at %C");
2048 return MATCH_ERROR;
2049 }
2050 if ((sym->ts.type != BT_CLASS && !sym->attr.codimension)
2051 || (sym->ts.type == BT_CLASS && CLASS_DATA (sym)
2052 && !CLASS_DATA (sym)->attr.codimension))
2053 {
2054 gfc_error ("Coarray designator at %C but %qs is not a coarray",
2055 sym->name);
2056 return MATCH_ERROR;
2057 }
2058 }
2059
2060 if (sym->assoc && sym->assoc->target)
2061 tgt_expr = sym->assoc->target;
2062
2063 /* For associate names, we may not yet know whether they are arrays or not.
2064 If the selector expression is unambiguously an array; eg. a full array
2065 or an array section, then the associate name must be an array and we can
2066 fix it now. Otherwise, if parentheses follow and it is not a character
2067 type, we have to assume that it actually is one for now. The final
2068 decision will be made at resolution, of course. */
2069 if (sym->assoc
2070 && gfc_peek_ascii_char () == '('
2071 && sym->ts.type != BT_CLASS
2072 && !sym->attr.dimension)
2073 {
2074 gfc_ref *ref = NULL;
2075
2076 if (!sym->assoc->dangling && tgt_expr)
2077 {
2078 if (tgt_expr->expr_type == EXPR_VARIABLE)
2079 gfc_resolve_expr (tgt_expr);
2080
2081 ref = tgt_expr->ref;
2082 for (; ref; ref = ref->next)
2083 if (ref->type == REF_ARRAY
2084 && (ref->u.ar.type == AR_FULL
2085 || ref->u.ar.type == AR_SECTION))
2086 break;
2087 }
2088
2089 if (ref || (!(sym->assoc->dangling || sym->ts.type == BT_CHARACTER)
2090 && sym->assoc->st
2091 && sym->assoc->st->n.sym
2092 && sym->assoc->st->n.sym->attr.dimension == 0))
2093 {
2094 sym->attr.dimension = 1;
2095 if (sym->as == NULL
2096 && sym->assoc->st
2097 && sym->assoc->st->n.sym
2098 && sym->assoc->st->n.sym->as)
2099 sym->as = gfc_copy_array_spec (sym->assoc->st->n.sym->as);
2100 }
2101 }
2102 else if (sym->ts.type == BT_CLASS
2103 && tgt_expr
2104 && tgt_expr->expr_type == EXPR_VARIABLE
2105 && sym->ts.u.derived != tgt_expr->ts.u.derived)
2106 {
2107 gfc_resolve_expr (tgt_expr);
2108 if (tgt_expr->rank)
2109 sym->ts.u.derived = tgt_expr->ts.u.derived;
2110 }
2111
2112 if ((equiv_flag && gfc_peek_ascii_char () == '(')
2113 || gfc_peek_ascii_char () == '[' || sym->attr.codimension
2114 || (sym->attr.dimension && sym->ts.type != BT_CLASS
2115 && !sym->attr.proc_pointer && !gfc_is_proc_ptr_comp (primary)
2116 && !(gfc_matching_procptr_assignment
2117 && sym->attr.flavor == FL_PROCEDURE))
2118 || (sym->ts.type == BT_CLASS && sym->attr.class_ok
2119 && (CLASS_DATA (sym)->attr.dimension
2120 || CLASS_DATA (sym)->attr.codimension)))
2121 {
2122 gfc_array_spec *as;
2123
2124 tail = extend_ref (primary, tail);
2125 tail->type = REF_ARRAY;
2126
2127 /* In EQUIVALENCE, we don't know yet whether we are seeing
2128 an array, character variable or array of character
2129 variables. We'll leave the decision till resolve time. */
2130
2131 if (equiv_flag)
2132 as = NULL;
2133 else if (sym->ts.type == BT_CLASS && CLASS_DATA (sym))
2134 as = CLASS_DATA (sym)->as;
2135 else
2136 as = sym->as;
2137
2138 m = gfc_match_array_ref (&tail->u.ar, as, equiv_flag,
2139 as ? as->corank : 0);
2140 if (m != MATCH_YES)
2141 return m;
2142
2143 gfc_gobble_whitespace ();
2144 if (equiv_flag && gfc_peek_ascii_char () == '(')
2145 {
2146 tail = extend_ref (primary, tail);
2147 tail->type = REF_ARRAY;
2148
2149 m = gfc_match_array_ref (&tail->u.ar, NULL, equiv_flag, 0);
2150 if (m != MATCH_YES)
2151 return m;
2152 }
2153 }
2154
2155 primary->ts = sym->ts;
2156
2157 if (equiv_flag)
2158 return MATCH_YES;
2159
2160 /* With DEC extensions, member separator may be '.' or '%'. */
2161 sep = gfc_peek_ascii_char ();
2162 m = gfc_match_member_sep (sym);
2163 if (m == MATCH_ERROR)
2164 return MATCH_ERROR;
2165
2166 inquiry = false;
2167 if (m == MATCH_YES && sep == '%'
2168 && primary->ts.type != BT_CLASS
2169 && primary->ts.type != BT_DERIVED)
2170 {
2171 match mm;
2172 old_loc = gfc_current_locus;
2173 mm = gfc_match_name (name);
2174 if (mm == MATCH_YES && is_inquiry_ref (name, &tmp))
2175 inquiry = true;
2176 gfc_current_locus = old_loc;
2177 }
2178
2179 if (sym->ts.type == BT_UNKNOWN && m == MATCH_YES
2180 && gfc_get_default_type (sym->name, sym->ns)->type == BT_DERIVED)
2181 gfc_set_default_type (sym, 0, sym->ns);
2182
2183 /* See if there is a usable typespec in the "no IMPLICIT type" error. */
2184 if (sym->ts.type == BT_UNKNOWN && m == MATCH_YES)
2185 {
2186 bool permissible;
2187
2188 /* These target expressions can be resolved at any time. */
2189 permissible = tgt_expr && tgt_expr->symtree && tgt_expr->symtree->n.sym
2190 && (tgt_expr->symtree->n.sym->attr.use_assoc
2191 || tgt_expr->symtree->n.sym->attr.host_assoc
2192 || tgt_expr->symtree->n.sym->attr.if_source
2193 == IFSRC_DECL);
2194 permissible = permissible
2195 || (tgt_expr && tgt_expr->expr_type == EXPR_OP);
2196
2197 if (permissible)
2198 {
2199 gfc_resolve_expr (tgt_expr);
2200 sym->ts = tgt_expr->ts;
2201 }
2202
2203 if (sym->ts.type == BT_UNKNOWN)
2204 {
2205 gfc_error ("Symbol %qs at %C has no IMPLICIT type", sym->name);
2206 return MATCH_ERROR;
2207 }
2208 }
2209 else if ((sym->ts.type != BT_DERIVED && sym->ts.type != BT_CLASS)
2210 && m == MATCH_YES && !inquiry)
2211 {
2212 gfc_error ("Unexpected %<%c%> for nonderived-type variable %qs at %C",
2213 sep, sym->name);
2214 return MATCH_ERROR;
2215 }
2216
2217 if ((sym->ts.type != BT_DERIVED && sym->ts.type != BT_CLASS && !inquiry)
2218 || m != MATCH_YES)
2219 goto check_substring;
2220
2221 if (!inquiry)
2222 sym = sym->ts.u.derived;
2223 else
2224 sym = NULL;
2225
2226 for (;;)
2227 {
2228 bool t;
2229 gfc_symtree *tbp;
2230
2231 m = gfc_match_name (name);
2232 if (m == MATCH_NO)
2233 gfc_error ("Expected structure component name at %C");
2234 if (m != MATCH_YES)
2235 return MATCH_ERROR;
2236
2237 intrinsic = false;
2238 if (primary->ts.type != BT_CLASS && primary->ts.type != BT_DERIVED)
2239 {
2240 inquiry = is_inquiry_ref (name, &tmp);
2241 if (inquiry)
2242 sym = NULL;
2243
2244 if (sep == '%')
2245 {
2246 if (tmp)
2247 {
2248 switch (tmp->u.i)
2249 {
2250 case INQUIRY_RE:
2251 case INQUIRY_IM:
2252 if (!gfc_notify_std (GFC_STD_F2008,
2253 "RE or IM part_ref at %C"))
2254 return MATCH_ERROR;
2255 break;
2256
2257 case INQUIRY_KIND:
2258 if (!gfc_notify_std (GFC_STD_F2003,
2259 "KIND part_ref at %C"))
2260 return MATCH_ERROR;
2261 break;
2262
2263 case INQUIRY_LEN:
2264 if (!gfc_notify_std (GFC_STD_F2003, "LEN part_ref at %C"))
2265 return MATCH_ERROR;
2266 break;
2267 }
2268
2269 if ((tmp->u.i == INQUIRY_RE || tmp->u.i == INQUIRY_IM)
2270 && primary->ts.type != BT_COMPLEX)
2271 {
2272 gfc_error ("The RE or IM part_ref at %C must be "
2273 "applied to a COMPLEX expression");
2274 return MATCH_ERROR;
2275 }
2276 else if (tmp->u.i == INQUIRY_LEN
2277 && primary->ts.type != BT_CHARACTER)
2278 {
2279 gfc_error ("The LEN part_ref at %C must be applied "
2280 "to a CHARACTER expression");
2281 return MATCH_ERROR;
2282 }
2283 }
2284 if (primary->ts.type != BT_UNKNOWN)
2285 intrinsic = true;
2286 }
2287 }
2288 else
2289 inquiry = false;
2290
2291 if (sym && sym->f2k_derived)
2292 tbp = gfc_find_typebound_proc (sym, &t, name, false, &gfc_current_locus);
2293 else
2294 tbp = NULL;
2295
2296 if (tbp)
2297 {
2298 gfc_symbol* tbp_sym;
2299
2300 if (!t)
2301 return MATCH_ERROR;
2302
2303 gcc_assert (!tail || !tail->next);
2304
2305 if (!(primary->expr_type == EXPR_VARIABLE
2306 || (primary->expr_type == EXPR_STRUCTURE
2307 && primary->symtree && primary->symtree->n.sym
2308 && primary->symtree->n.sym->attr.flavor)))
2309 return MATCH_ERROR;
2310
2311 if (tbp->n.tb->is_generic)
2312 tbp_sym = NULL;
2313 else
2314 tbp_sym = tbp->n.tb->u.specific->n.sym;
2315
2316 primary->expr_type = EXPR_COMPCALL;
2317 primary->value.compcall.tbp = tbp->n.tb;
2318 primary->value.compcall.name = tbp->name;
2319 primary->value.compcall.ignore_pass = 0;
2320 primary->value.compcall.assign = 0;
2321 primary->value.compcall.base_object = NULL;
2322 gcc_assert (primary->symtree->n.sym->attr.referenced);
2323 if (tbp_sym)
2324 primary->ts = tbp_sym->ts;
2325 else
2326 gfc_clear_ts (&primary->ts);
2327
2328 m = gfc_match_actual_arglist (tbp->n.tb->subroutine,
2329 &primary->value.compcall.actual);
2330 if (m == MATCH_ERROR)
2331 return MATCH_ERROR;
2332 if (m == MATCH_NO)
2333 {
2334 if (sub_flag)
2335 primary->value.compcall.actual = NULL;
2336 else
2337 {
2338 gfc_error ("Expected argument list at %C");
2339 return MATCH_ERROR;
2340 }
2341 }
2342
2343 break;
2344 }
2345
2346 if (!inquiry && !intrinsic)
2347 component = gfc_find_component (sym, name, false, false, &tmp);
2348 else
2349 component = NULL;
2350
2351 /* In some cases, returning MATCH_NO gives a better error message. Most
2352 cases return "Unclassifiable statement at..." */
2353 if (intrinsic && !inquiry)
2354 return MATCH_NO;
2355 else if (component == NULL && !inquiry)
2356 return MATCH_ERROR;
2357
2358 /* Extend the reference chain determined by gfc_find_component or
2359 is_inquiry_ref. */
2360 if (primary->ref == NULL)
2361 primary->ref = tmp;
2362 else
2363 {
2364 /* Set by the for loop below for the last component ref. */
2365 gcc_assert (tail != NULL);
2366 tail->next = tmp;
2367 }
2368
2369 /* The reference chain may be longer than one hop for union
2370 subcomponents; find the new tail. */
2371 for (tail = tmp; tail->next; tail = tail->next)
2372 ;
2373
2374 if (tmp && tmp->type == REF_INQUIRY)
2375 {
2376 if (!primary->where.lb || !primary->where.nextc)
2377 primary->where = gfc_current_locus;
2378 gfc_simplify_expr (primary, 0);
2379
2380 if (primary->expr_type == EXPR_CONSTANT)
2381 goto check_done;
2382
2383 switch (tmp->u.i)
2384 {
2385 case INQUIRY_RE:
2386 case INQUIRY_IM:
2387 if (!gfc_notify_std (GFC_STD_F2008, "RE or IM part_ref at %C"))
2388 return MATCH_ERROR;
2389
2390 if (primary->ts.type != BT_COMPLEX)
2391 {
2392 gfc_error ("The RE or IM part_ref at %C must be "
2393 "applied to a COMPLEX expression");
2394 return MATCH_ERROR;
2395 }
2396 primary->ts.type = BT_REAL;
2397 break;
2398
2399 case INQUIRY_LEN:
2400 if (!gfc_notify_std (GFC_STD_F2003, "LEN part_ref at %C"))
2401 return MATCH_ERROR;
2402
2403 if (primary->ts.type != BT_CHARACTER)
2404 {
2405 gfc_error ("The LEN part_ref at %C must be applied "
2406 "to a CHARACTER expression");
2407 return MATCH_ERROR;
2408 }
2409 primary->ts.u.cl = NULL;
2410 primary->ts.type = BT_INTEGER;
2411 primary->ts.kind = gfc_default_integer_kind;
2412 break;
2413
2414 case INQUIRY_KIND:
2415 if (!gfc_notify_std (GFC_STD_F2003, "KIND part_ref at %C"))
2416 return MATCH_ERROR;
2417
2418 if (primary->ts.type == BT_CLASS
2419 || primary->ts.type == BT_DERIVED)
2420 {
2421 gfc_error ("The KIND part_ref at %C must be applied "
2422 "to an expression of intrinsic type");
2423 return MATCH_ERROR;
2424 }
2425 primary->ts.type = BT_INTEGER;
2426 primary->ts.kind = gfc_default_integer_kind;
2427 break;
2428
2429 default:
2430 gcc_unreachable ();
2431 }
2432
2433 goto check_done;
2434 }
2435
2436 primary->ts = component->ts;
2437
2438 if (component->attr.proc_pointer && ppc_arg)
2439 {
2440 /* Procedure pointer component call: Look for argument list. */
2441 m = gfc_match_actual_arglist (sub_flag,
2442 &primary->value.compcall.actual);
2443 if (m == MATCH_ERROR)
2444 return MATCH_ERROR;
2445
2446 if (m == MATCH_NO && !gfc_matching_ptr_assignment
2447 && !gfc_matching_procptr_assignment && !matching_actual_arglist)
2448 {
2449 gfc_error ("Procedure pointer component %qs requires an "
2450 "argument list at %C", component->name);
2451 return MATCH_ERROR;
2452 }
2453
2454 if (m == MATCH_YES)
2455 primary->expr_type = EXPR_PPC;
2456
2457 break;
2458 }
2459
2460 if (component->as != NULL && !component->attr.proc_pointer)
2461 {
2462 tail = extend_ref (primary, tail);
2463 tail->type = REF_ARRAY;
2464
2465 m = gfc_match_array_ref (&tail->u.ar, component->as, equiv_flag,
2466 component->as->corank);
2467 if (m != MATCH_YES)
2468 return m;
2469 }
2470 else if (component->ts.type == BT_CLASS && component->attr.class_ok
2471 && CLASS_DATA (component)->as && !component->attr.proc_pointer)
2472 {
2473 tail = extend_ref (primary, tail);
2474 tail->type = REF_ARRAY;
2475
2476 m = gfc_match_array_ref (&tail->u.ar, CLASS_DATA (component)->as,
2477 equiv_flag,
2478 CLASS_DATA (component)->as->corank);
2479 if (m != MATCH_YES)
2480 return m;
2481 }
2482
2483 check_done:
2484 /* In principle, we could have eg. expr%re%kind so we must allow for
2485 this possibility. */
2486 if (gfc_match_char ('%') == MATCH_YES)
2487 {
2488 if (component && (component->ts.type == BT_DERIVED
2489 || component->ts.type == BT_CLASS))
2490 sym = component->ts.u.derived;
2491 continue;
2492 }
2493 else if (inquiry)
2494 break;
2495
2496 if ((component->ts.type != BT_DERIVED && component->ts.type != BT_CLASS)
2497 || gfc_match_member_sep (component->ts.u.derived) != MATCH_YES)
2498 break;
2499
2500 if (component->ts.type == BT_DERIVED || component->ts.type == BT_CLASS)
2501 sym = component->ts.u.derived;
2502 }
2503
2504 check_substring:
2505 unknown = false;
2506 if (primary->ts.type == BT_UNKNOWN && !gfc_fl_struct (sym->attr.flavor))
2507 {
2508 if (gfc_get_default_type (sym->name, sym->ns)->type == BT_CHARACTER)
2509 {
2510 gfc_set_default_type (sym, 0, sym->ns);
2511 primary->ts = sym->ts;
2512 unknown = true;
2513 }
2514 }
2515
2516 if (primary->ts.type == BT_CHARACTER)
2517 {
2518 bool def = primary->ts.deferred == 1;
2519 switch (match_substring (primary->ts.u.cl, equiv_flag, &substring, def))
2520 {
2521 case MATCH_YES:
2522 if (tail == NULL)
2523 primary->ref = substring;
2524 else
2525 tail->next = substring;
2526
2527 if (primary->expr_type == EXPR_CONSTANT)
2528 primary->expr_type = EXPR_SUBSTRING;
2529
2530 if (substring)
2531 primary->ts.u.cl = NULL;
2532
2533 break;
2534
2535 case MATCH_NO:
2536 if (unknown)
2537 {
2538 gfc_clear_ts (&primary->ts);
2539 gfc_clear_ts (&sym->ts);
2540 }
2541 break;
2542
2543 case MATCH_ERROR:
2544 return MATCH_ERROR;
2545 }
2546 }
2547
2548 /* F08:C611. */
2549 if (primary->ts.type == BT_DERIVED && primary->ref
2550 && primary->ts.u.derived && primary->ts.u.derived->attr.abstract)
2551 {
2552 gfc_error ("Nonpolymorphic reference to abstract type at %C");
2553 return MATCH_ERROR;
2554 }
2555
2556 /* F08:C727. */
2557 if (primary->expr_type == EXPR_PPC && gfc_is_coindexed (primary))
2558 {
2559 gfc_error ("Coindexed procedure-pointer component at %C");
2560 return MATCH_ERROR;
2561 }
2562
2563 return MATCH_YES;
2564 }
2565
2566
2567 /* Given an expression that is a variable, figure out what the
2568 ultimate variable's type and attribute is, traversing the reference
2569 structures if necessary.
2570
2571 This subroutine is trickier than it looks. We start at the base
2572 symbol and store the attribute. Component references load a
2573 completely new attribute.
2574
2575 A couple of rules come into play. Subobjects of targets are always
2576 targets themselves. If we see a component that goes through a
2577 pointer, then the expression must also be a target, since the
2578 pointer is associated with something (if it isn't core will soon be
2579 dumped). If we see a full part or section of an array, the
2580 expression is also an array.
2581
2582 We can have at most one full array reference. */
2583
2584 symbol_attribute
2585 gfc_variable_attr (gfc_expr *expr, gfc_typespec *ts)
2586 {
2587 int dimension, codimension, pointer, allocatable, target;
2588 symbol_attribute attr;
2589 gfc_ref *ref;
2590 gfc_symbol *sym;
2591 gfc_component *comp;
2592 bool has_inquiry_part;
2593
2594 if (expr->expr_type != EXPR_VARIABLE && expr->expr_type != EXPR_FUNCTION)
2595 gfc_internal_error ("gfc_variable_attr(): Expression isn't a variable");
2596
2597 sym = expr->symtree->n.sym;
2598 attr = sym->attr;
2599
2600 if (sym->ts.type == BT_CLASS && sym->attr.class_ok)
2601 {
2602 dimension = CLASS_DATA (sym)->attr.dimension;
2603 codimension = CLASS_DATA (sym)->attr.codimension;
2604 pointer = CLASS_DATA (sym)->attr.class_pointer;
2605 allocatable = CLASS_DATA (sym)->attr.allocatable;
2606 }
2607 else
2608 {
2609 dimension = attr.dimension;
2610 codimension = attr.codimension;
2611 pointer = attr.pointer;
2612 allocatable = attr.allocatable;
2613 }
2614
2615 target = attr.target;
2616 if (pointer || attr.proc_pointer)
2617 target = 1;
2618
2619 if (ts != NULL && expr->ts.type == BT_UNKNOWN)
2620 *ts = sym->ts;
2621
2622 has_inquiry_part = false;
2623 for (ref = expr->ref; ref; ref = ref->next)
2624 if (ref->type == REF_INQUIRY)
2625 {
2626 has_inquiry_part = true;
2627 break;
2628 }
2629
2630 for (ref = expr->ref; ref; ref = ref->next)
2631 switch (ref->type)
2632 {
2633 case REF_ARRAY:
2634
2635 switch (ref->u.ar.type)
2636 {
2637 case AR_FULL:
2638 dimension = 1;
2639 break;
2640
2641 case AR_SECTION:
2642 allocatable = pointer = 0;
2643 dimension = 1;
2644 break;
2645
2646 case AR_ELEMENT:
2647 /* Handle coarrays. */
2648 if (ref->u.ar.dimen > 0)
2649 allocatable = pointer = 0;
2650 break;
2651
2652 case AR_UNKNOWN:
2653 /* For standard conforming code, AR_UNKNOWN should not happen.
2654 For nonconforming code, gfortran can end up here. Treat it
2655 as a no-op. */
2656 break;
2657 }
2658
2659 break;
2660
2661 case REF_COMPONENT:
2662 comp = ref->u.c.component;
2663 attr = comp->attr;
2664 if (ts != NULL && !has_inquiry_part)
2665 {
2666 *ts = comp->ts;
2667 /* Don't set the string length if a substring reference
2668 follows. */
2669 if (ts->type == BT_CHARACTER
2670 && ref->next && ref->next->type == REF_SUBSTRING)
2671 ts->u.cl = NULL;
2672 }
2673
2674 if (comp->ts.type == BT_CLASS)
2675 {
2676 codimension = CLASS_DATA (comp)->attr.codimension;
2677 pointer = CLASS_DATA (comp)->attr.class_pointer;
2678 allocatable = CLASS_DATA (comp)->attr.allocatable;
2679 }
2680 else
2681 {
2682 codimension = comp->attr.codimension;
2683 pointer = comp->attr.pointer;
2684 allocatable = comp->attr.allocatable;
2685 }
2686 if (pointer || attr.proc_pointer)
2687 target = 1;
2688
2689 break;
2690
2691 case REF_INQUIRY:
2692 case REF_SUBSTRING:
2693 allocatable = pointer = 0;
2694 break;
2695 }
2696
2697 attr.dimension = dimension;
2698 attr.codimension = codimension;
2699 attr.pointer = pointer;
2700 attr.allocatable = allocatable;
2701 attr.target = target;
2702 attr.save = sym->attr.save;
2703
2704 return attr;
2705 }
2706
2707
2708 /* Return the attribute from a general expression. */
2709
2710 symbol_attribute
2711 gfc_expr_attr (gfc_expr *e)
2712 {
2713 symbol_attribute attr;
2714
2715 switch (e->expr_type)
2716 {
2717 case EXPR_VARIABLE:
2718 attr = gfc_variable_attr (e, NULL);
2719 break;
2720
2721 case EXPR_FUNCTION:
2722 gfc_clear_attr (&attr);
2723
2724 if (e->value.function.esym && e->value.function.esym->result)
2725 {
2726 gfc_symbol *sym = e->value.function.esym->result;
2727 attr = sym->attr;
2728 if (sym->ts.type == BT_CLASS)
2729 {
2730 attr.dimension = CLASS_DATA (sym)->attr.dimension;
2731 attr.pointer = CLASS_DATA (sym)->attr.class_pointer;
2732 attr.allocatable = CLASS_DATA (sym)->attr.allocatable;
2733 }
2734 }
2735 else if (e->value.function.isym
2736 && e->value.function.isym->transformational
2737 && e->ts.type == BT_CLASS)
2738 attr = CLASS_DATA (e)->attr;
2739 else
2740 attr = gfc_variable_attr (e, NULL);
2741
2742 /* TODO: NULL() returns pointers. May have to take care of this
2743 here. */
2744
2745 break;
2746
2747 default:
2748 gfc_clear_attr (&attr);
2749 break;
2750 }
2751
2752 return attr;
2753 }
2754
2755
2756 /* Given an expression, figure out what the ultimate expression
2757 attribute is. This routine is similar to gfc_variable_attr with
2758 parts of gfc_expr_attr, but focuses more on the needs of
2759 coarrays. For coarrays a codimension attribute is kind of
2760 "infectious" being propagated once set and never cleared.
2761 The coarray_comp is only set, when the expression refs a coarray
2762 component. REFS_COMP is set when present to true only, when this EXPR
2763 refs a (non-_data) component. To check whether EXPR refs an allocatable
2764 component in a derived type coarray *refs_comp needs to be set and
2765 coarray_comp has to false. */
2766
2767 static symbol_attribute
2768 caf_variable_attr (gfc_expr *expr, bool in_allocate, bool *refs_comp)
2769 {
2770 int dimension, codimension, pointer, allocatable, target, coarray_comp;
2771 symbol_attribute attr;
2772 gfc_ref *ref;
2773 gfc_symbol *sym;
2774 gfc_component *comp;
2775
2776 if (expr->expr_type != EXPR_VARIABLE && expr->expr_type != EXPR_FUNCTION)
2777 gfc_internal_error ("gfc_caf_attr(): Expression isn't a variable");
2778
2779 sym = expr->symtree->n.sym;
2780 gfc_clear_attr (&attr);
2781
2782 if (refs_comp)
2783 *refs_comp = false;
2784
2785 if (sym->ts.type == BT_CLASS && sym->attr.class_ok)
2786 {
2787 dimension = CLASS_DATA (sym)->attr.dimension;
2788 codimension = CLASS_DATA (sym)->attr.codimension;
2789 pointer = CLASS_DATA (sym)->attr.class_pointer;
2790 allocatable = CLASS_DATA (sym)->attr.allocatable;
2791 attr.alloc_comp = CLASS_DATA (sym)->ts.u.derived->attr.alloc_comp;
2792 attr.pointer_comp = CLASS_DATA (sym)->ts.u.derived->attr.pointer_comp;
2793 }
2794 else
2795 {
2796 dimension = sym->attr.dimension;
2797 codimension = sym->attr.codimension;
2798 pointer = sym->attr.pointer;
2799 allocatable = sym->attr.allocatable;
2800 attr.alloc_comp = sym->ts.type == BT_DERIVED
2801 ? sym->ts.u.derived->attr.alloc_comp : 0;
2802 attr.pointer_comp = sym->ts.type == BT_DERIVED
2803 ? sym->ts.u.derived->attr.pointer_comp : 0;
2804 }
2805
2806 target = coarray_comp = 0;
2807 if (pointer || attr.proc_pointer)
2808 target = 1;
2809
2810 for (ref = expr->ref; ref; ref = ref->next)
2811 switch (ref->type)
2812 {
2813 case REF_ARRAY:
2814
2815 switch (ref->u.ar.type)
2816 {
2817 case AR_FULL:
2818 case AR_SECTION:
2819 dimension = 1;
2820 break;
2821
2822 case AR_ELEMENT:
2823 /* Handle coarrays. */
2824 if (ref->u.ar.dimen > 0 && !in_allocate)
2825 allocatable = pointer = 0;
2826 break;
2827
2828 case AR_UNKNOWN:
2829 /* If any of start, end or stride is not integer, there will
2830 already have been an error issued. */
2831 int errors;
2832 gfc_get_errors (NULL, &errors);
2833 if (errors == 0)
2834 gfc_internal_error ("gfc_caf_attr(): Bad array reference");
2835 }
2836
2837 break;
2838
2839 case REF_COMPONENT:
2840 comp = ref->u.c.component;
2841
2842 if (comp->ts.type == BT_CLASS)
2843 {
2844 /* Set coarray_comp only, when this component introduces the
2845 coarray. */
2846 coarray_comp = !codimension && CLASS_DATA (comp)->attr.codimension;
2847 codimension |= CLASS_DATA (comp)->attr.codimension;
2848 pointer = CLASS_DATA (comp)->attr.class_pointer;
2849 allocatable = CLASS_DATA (comp)->attr.allocatable;
2850 }
2851 else
2852 {
2853 /* Set coarray_comp only, when this component introduces the
2854 coarray. */
2855 coarray_comp = !codimension && comp->attr.codimension;
2856 codimension |= comp->attr.codimension;
2857 pointer = comp->attr.pointer;
2858 allocatable = comp->attr.allocatable;
2859 }
2860
2861 if (refs_comp && strcmp (comp->name, "_data") != 0
2862 && (ref->next == NULL
2863 || (ref->next->type == REF_ARRAY && ref->next->next == NULL)))
2864 *refs_comp = true;
2865
2866 if (pointer || attr.proc_pointer)
2867 target = 1;
2868
2869 break;
2870
2871 case REF_SUBSTRING:
2872 case REF_INQUIRY:
2873 allocatable = pointer = 0;
2874 break;
2875 }
2876
2877 attr.dimension = dimension;
2878 attr.codimension = codimension;
2879 attr.pointer = pointer;
2880 attr.allocatable = allocatable;
2881 attr.target = target;
2882 attr.save = sym->attr.save;
2883 attr.coarray_comp = coarray_comp;
2884
2885 return attr;
2886 }
2887
2888
2889 symbol_attribute
2890 gfc_caf_attr (gfc_expr *e, bool in_allocate, bool *refs_comp)
2891 {
2892 symbol_attribute attr;
2893
2894 switch (e->expr_type)
2895 {
2896 case EXPR_VARIABLE:
2897 attr = caf_variable_attr (e, in_allocate, refs_comp);
2898 break;
2899
2900 case EXPR_FUNCTION:
2901 gfc_clear_attr (&attr);
2902
2903 if (e->value.function.esym && e->value.function.esym->result)
2904 {
2905 gfc_symbol *sym = e->value.function.esym->result;
2906 attr = sym->attr;
2907 if (sym->ts.type == BT_CLASS)
2908 {
2909 attr.dimension = CLASS_DATA (sym)->attr.dimension;
2910 attr.pointer = CLASS_DATA (sym)->attr.class_pointer;
2911 attr.allocatable = CLASS_DATA (sym)->attr.allocatable;
2912 attr.alloc_comp = CLASS_DATA (sym)->ts.u.derived->attr.alloc_comp;
2913 attr.pointer_comp = CLASS_DATA (sym)->ts.u.derived
2914 ->attr.pointer_comp;
2915 }
2916 }
2917 else if (e->symtree)
2918 attr = caf_variable_attr (e, in_allocate, refs_comp);
2919 else
2920 gfc_clear_attr (&attr);
2921 break;
2922
2923 default:
2924 gfc_clear_attr (&attr);
2925 break;
2926 }
2927
2928 return attr;
2929 }
2930
2931
2932 /* Match a structure constructor. The initial symbol has already been
2933 seen. */
2934
2935 typedef struct gfc_structure_ctor_component
2936 {
2937 char* name;
2938 gfc_expr* val;
2939 locus where;
2940 struct gfc_structure_ctor_component* next;
2941 }
2942 gfc_structure_ctor_component;
2943
2944 #define gfc_get_structure_ctor_component() XCNEW (gfc_structure_ctor_component)
2945
2946 static void
2947 gfc_free_structure_ctor_component (gfc_structure_ctor_component *comp)
2948 {
2949 free (comp->name);
2950 gfc_free_expr (comp->val);
2951 free (comp);
2952 }
2953
2954
2955 /* Translate the component list into the actual constructor by sorting it in
2956 the order required; this also checks along the way that each and every
2957 component actually has an initializer and handles default initializers
2958 for components without explicit value given. */
2959 static bool
2960 build_actual_constructor (gfc_structure_ctor_component **comp_head,
2961 gfc_constructor_base *ctor_head, gfc_symbol *sym)
2962 {
2963 gfc_structure_ctor_component *comp_iter;
2964 gfc_component *comp;
2965
2966 for (comp = sym->components; comp; comp = comp->next)
2967 {
2968 gfc_structure_ctor_component **next_ptr;
2969 gfc_expr *value = NULL;
2970
2971 /* Try to find the initializer for the current component by name. */
2972 next_ptr = comp_head;
2973 for (comp_iter = *comp_head; comp_iter; comp_iter = comp_iter->next)
2974 {
2975 if (!strcmp (comp_iter->name, comp->name))
2976 break;
2977 next_ptr = &comp_iter->next;
2978 }
2979
2980 /* If an extension, try building the parent derived type by building
2981 a value expression for the parent derived type and calling self. */
2982 if (!comp_iter && comp == sym->components && sym->attr.extension)
2983 {
2984 value = gfc_get_structure_constructor_expr (comp->ts.type,
2985 comp->ts.kind,
2986 &gfc_current_locus);
2987 value->ts = comp->ts;
2988
2989 if (!build_actual_constructor (comp_head,
2990 &value->value.constructor,
2991 comp->ts.u.derived))
2992 {
2993 gfc_free_expr (value);
2994 return false;
2995 }
2996
2997 gfc_constructor_append_expr (ctor_head, value, NULL);
2998 continue;
2999 }
3000
3001 /* If it was not found, try the default initializer if there's any;
3002 otherwise, it's an error unless this is a deferred parameter. */
3003 if (!comp_iter)
3004 {
3005 if (comp->initializer)
3006 {
3007 if (!gfc_notify_std (GFC_STD_F2003, "Structure constructor "
3008 "with missing optional arguments at %C"))
3009 return false;
3010 value = gfc_copy_expr (comp->initializer);
3011 }
3012 else if (comp->attr.allocatable
3013 || (comp->ts.type == BT_CLASS
3014 && CLASS_DATA (comp)->attr.allocatable))
3015 {
3016 if (!gfc_notify_std (GFC_STD_F2008, "No initializer for "
3017 "allocatable component %qs given in the "
3018 "structure constructor at %C", comp->name))
3019 return false;
3020 }
3021 else if (!comp->attr.artificial)
3022 {
3023 gfc_error ("No initializer for component %qs given in the"
3024 " structure constructor at %C", comp->name);
3025 return false;
3026 }
3027 }
3028 else
3029 value = comp_iter->val;
3030
3031 /* Add the value to the constructor chain built. */
3032 gfc_constructor_append_expr (ctor_head, value, NULL);
3033
3034 /* Remove the entry from the component list. We don't want the expression
3035 value to be free'd, so set it to NULL. */
3036 if (comp_iter)
3037 {
3038 *next_ptr = comp_iter->next;
3039 comp_iter->val = NULL;
3040 gfc_free_structure_ctor_component (comp_iter);
3041 }
3042 }
3043 return true;
3044 }
3045
3046
3047 bool
3048 gfc_convert_to_structure_constructor (gfc_expr *e, gfc_symbol *sym, gfc_expr **cexpr,
3049 gfc_actual_arglist **arglist,
3050 bool parent)
3051 {
3052 gfc_actual_arglist *actual;
3053 gfc_structure_ctor_component *comp_tail, *comp_head, *comp_iter;
3054 gfc_constructor_base ctor_head = NULL;
3055 gfc_component *comp; /* Is set NULL when named component is first seen */
3056 const char* last_name = NULL;
3057 locus old_locus;
3058 gfc_expr *expr;
3059
3060 expr = parent ? *cexpr : e;
3061 old_locus = gfc_current_locus;
3062 if (parent)
3063 ; /* gfc_current_locus = *arglist->expr ? ->where;*/
3064 else
3065 gfc_current_locus = expr->where;
3066
3067 comp_tail = comp_head = NULL;
3068
3069 if (!parent && sym->attr.abstract)
3070 {
3071 gfc_error ("Cannot construct ABSTRACT type %qs at %L",
3072 sym->name, &expr->where);
3073 goto cleanup;
3074 }
3075
3076 comp = sym->components;
3077 actual = parent ? *arglist : expr->value.function.actual;
3078 for ( ; actual; )
3079 {
3080 gfc_component *this_comp = NULL;
3081
3082 if (!comp_head)
3083 comp_tail = comp_head = gfc_get_structure_ctor_component ();
3084 else
3085 {
3086 comp_tail->next = gfc_get_structure_ctor_component ();
3087 comp_tail = comp_tail->next;
3088 }
3089 if (actual->name)
3090 {
3091 if (!gfc_notify_std (GFC_STD_F2003, "Structure"
3092 " constructor with named arguments at %C"))
3093 goto cleanup;
3094
3095 comp_tail->name = xstrdup (actual->name);
3096 last_name = comp_tail->name;
3097 comp = NULL;
3098 }
3099 else
3100 {
3101 /* Components without name are not allowed after the first named
3102 component initializer! */
3103 if (!comp || comp->attr.artificial)
3104 {
3105 if (last_name)
3106 gfc_error ("Component initializer without name after component"
3107 " named %s at %L", last_name,
3108 actual->expr ? &actual->expr->where
3109 : &gfc_current_locus);
3110 else
3111 gfc_error ("Too many components in structure constructor at "
3112 "%L", actual->expr ? &actual->expr->where
3113 : &gfc_current_locus);
3114 goto cleanup;
3115 }
3116
3117 comp_tail->name = xstrdup (comp->name);
3118 }
3119
3120 /* Find the current component in the structure definition and check
3121 its access is not private. */
3122 if (comp)
3123 this_comp = gfc_find_component (sym, comp->name, false, false, NULL);
3124 else
3125 {
3126 this_comp = gfc_find_component (sym, (const char *)comp_tail->name,
3127 false, false, NULL);
3128 comp = NULL; /* Reset needed! */
3129 }
3130
3131 /* Here we can check if a component name is given which does not
3132 correspond to any component of the defined structure. */
3133 if (!this_comp)
3134 goto cleanup;
3135
3136 /* For a constant string constructor, make sure the length is
3137 correct; truncate of fill with blanks if needed. */
3138 if (this_comp->ts.type == BT_CHARACTER && !this_comp->attr.allocatable
3139 && this_comp->ts.u.cl && this_comp->ts.u.cl->length
3140 && this_comp->ts.u.cl->length->expr_type == EXPR_CONSTANT
3141 && actual->expr->ts.type == BT_CHARACTER
3142 && actual->expr->expr_type == EXPR_CONSTANT)
3143 {
3144 ptrdiff_t c, e1;
3145 c = gfc_mpz_get_hwi (this_comp->ts.u.cl->length->value.integer);
3146 e1 = actual->expr->value.character.length;
3147
3148 if (c != e1)
3149 {
3150 ptrdiff_t i, to;
3151 gfc_char_t *dest;
3152 dest = gfc_get_wide_string (c + 1);
3153
3154 to = e1 < c ? e1 : c;
3155 for (i = 0; i < to; i++)
3156 dest[i] = actual->expr->value.character.string[i];
3157
3158 for (i = e1; i < c; i++)
3159 dest[i] = ' ';
3160
3161 dest[c] = '\0';
3162 free (actual->expr->value.character.string);
3163
3164 actual->expr->value.character.length = c;
3165 actual->expr->value.character.string = dest;
3166
3167 if (warn_line_truncation && c < e1)
3168 gfc_warning_now (OPT_Wcharacter_truncation,
3169 "CHARACTER expression will be truncated "
3170 "in constructor (%ld/%ld) at %L", (long int) c,
3171 (long int) e1, &actual->expr->where);
3172 }
3173 }
3174
3175 comp_tail->val = actual->expr;
3176 if (actual->expr != NULL)
3177 comp_tail->where = actual->expr->where;
3178 actual->expr = NULL;
3179
3180 /* Check if this component is already given a value. */
3181 for (comp_iter = comp_head; comp_iter != comp_tail;
3182 comp_iter = comp_iter->next)
3183 {
3184 gcc_assert (comp_iter);
3185 if (!strcmp (comp_iter->name, comp_tail->name))
3186 {
3187 gfc_error ("Component %qs is initialized twice in the structure"
3188 " constructor at %L", comp_tail->name,
3189 comp_tail->val ? &comp_tail->where
3190 : &gfc_current_locus);
3191 goto cleanup;
3192 }
3193 }
3194
3195 /* F2008, R457/C725, for PURE C1283. */
3196 if (this_comp->attr.pointer && comp_tail->val
3197 && gfc_is_coindexed (comp_tail->val))
3198 {
3199 gfc_error ("Coindexed expression to pointer component %qs in "
3200 "structure constructor at %L", comp_tail->name,
3201 &comp_tail->where);
3202 goto cleanup;
3203 }
3204
3205 /* If not explicitly a parent constructor, gather up the components
3206 and build one. */
3207 if (comp && comp == sym->components
3208 && sym->attr.extension
3209 && comp_tail->val
3210 && (!gfc_bt_struct (comp_tail->val->ts.type)
3211 ||
3212 comp_tail->val->ts.u.derived != this_comp->ts.u.derived))
3213 {
3214 bool m;
3215 gfc_actual_arglist *arg_null = NULL;
3216
3217 actual->expr = comp_tail->val;
3218 comp_tail->val = NULL;
3219
3220 m = gfc_convert_to_structure_constructor (NULL,
3221 comp->ts.u.derived, &comp_tail->val,
3222 comp->ts.u.derived->attr.zero_comp
3223 ? &arg_null : &actual, true);
3224 if (!m)
3225 goto cleanup;
3226
3227 if (comp->ts.u.derived->attr.zero_comp)
3228 {
3229 comp = comp->next;
3230 continue;
3231 }
3232 }
3233
3234 if (comp)
3235 comp = comp->next;
3236 if (parent && !comp)
3237 break;
3238
3239 if (actual)
3240 actual = actual->next;
3241 }
3242
3243 if (!build_actual_constructor (&comp_head, &ctor_head, sym))
3244 goto cleanup;
3245
3246 /* No component should be left, as this should have caused an error in the
3247 loop constructing the component-list (name that does not correspond to any
3248 component in the structure definition). */
3249 if (comp_head && sym->attr.extension)
3250 {
3251 for (comp_iter = comp_head; comp_iter; comp_iter = comp_iter->next)
3252 {
3253 gfc_error ("component %qs at %L has already been set by a "
3254 "parent derived type constructor", comp_iter->name,
3255 &comp_iter->where);
3256 }
3257 goto cleanup;
3258 }
3259 else
3260 gcc_assert (!comp_head);
3261
3262 if (parent)
3263 {
3264 expr = gfc_get_structure_constructor_expr (BT_DERIVED, 0, &gfc_current_locus);
3265 expr->ts.u.derived = sym;
3266 expr->value.constructor = ctor_head;
3267 *cexpr = expr;
3268 }
3269 else
3270 {
3271 expr->ts.u.derived = sym;
3272 expr->ts.kind = 0;
3273 expr->ts.type = BT_DERIVED;
3274 expr->value.constructor = ctor_head;
3275 expr->expr_type = EXPR_STRUCTURE;
3276 }
3277
3278 gfc_current_locus = old_locus;
3279 if (parent)
3280 *arglist = actual;
3281 return true;
3282
3283 cleanup:
3284 gfc_current_locus = old_locus;
3285
3286 for (comp_iter = comp_head; comp_iter; )
3287 {
3288 gfc_structure_ctor_component *next = comp_iter->next;
3289 gfc_free_structure_ctor_component (comp_iter);
3290 comp_iter = next;
3291 }
3292 gfc_constructor_free (ctor_head);
3293
3294 return false;
3295 }
3296
3297
3298 match
3299 gfc_match_structure_constructor (gfc_symbol *sym, gfc_expr **result)
3300 {
3301 match m;
3302 gfc_expr *e;
3303 gfc_symtree *symtree;
3304
3305 gfc_get_ha_sym_tree (sym->name, &symtree);
3306
3307 e = gfc_get_expr ();
3308 e->symtree = symtree;
3309 e->expr_type = EXPR_FUNCTION;
3310 e->where = gfc_current_locus;
3311
3312 gcc_assert (gfc_fl_struct (sym->attr.flavor)
3313 && symtree->n.sym->attr.flavor == FL_PROCEDURE);
3314 e->value.function.esym = sym;
3315 e->symtree->n.sym->attr.generic = 1;
3316
3317 m = gfc_match_actual_arglist (0, &e->value.function.actual);
3318 if (m != MATCH_YES)
3319 {
3320 gfc_free_expr (e);
3321 return m;
3322 }
3323
3324 if (!gfc_convert_to_structure_constructor (e, sym, NULL, NULL, false))
3325 {
3326 gfc_free_expr (e);
3327 return MATCH_ERROR;
3328 }
3329
3330 /* If a structure constructor is in a DATA statement, then each entity
3331 in the structure constructor must be a constant. Try to reduce the
3332 expression here. */
3333 if (gfc_in_match_data ())
3334 gfc_reduce_init_expr (e);
3335
3336 *result = e;
3337 return MATCH_YES;
3338 }
3339
3340
3341 /* If the symbol is an implicit do loop index and implicitly typed,
3342 it should not be host associated. Provide a symtree from the
3343 current namespace. */
3344 static match
3345 check_for_implicit_index (gfc_symtree **st, gfc_symbol **sym)
3346 {
3347 if ((*sym)->attr.flavor == FL_VARIABLE
3348 && (*sym)->ns != gfc_current_ns
3349 && (*sym)->attr.implied_index
3350 && (*sym)->attr.implicit_type
3351 && !(*sym)->attr.use_assoc)
3352 {
3353 int i;
3354 i = gfc_get_sym_tree ((*sym)->name, NULL, st, false);
3355 if (i)
3356 return MATCH_ERROR;
3357 *sym = (*st)->n.sym;
3358 }
3359 return MATCH_YES;
3360 }
3361
3362
3363 /* Procedure pointer as function result: Replace the function symbol by the
3364 auto-generated hidden result variable named "ppr@". */
3365
3366 static bool
3367 replace_hidden_procptr_result (gfc_symbol **sym, gfc_symtree **st)
3368 {
3369 /* Check for procedure pointer result variable. */
3370 if ((*sym)->attr.function && !(*sym)->attr.external
3371 && (*sym)->result && (*sym)->result != *sym
3372 && (*sym)->result->attr.proc_pointer
3373 && (*sym) == gfc_current_ns->proc_name
3374 && (*sym) == (*sym)->result->ns->proc_name
3375 && strcmp ("ppr@", (*sym)->result->name) == 0)
3376 {
3377 /* Automatic replacement with "hidden" result variable. */
3378 (*sym)->result->attr.referenced = (*sym)->attr.referenced;
3379 *sym = (*sym)->result;
3380 *st = gfc_find_symtree ((*sym)->ns->sym_root, (*sym)->name);
3381 return true;
3382 }
3383 return false;
3384 }
3385
3386
3387 /* Matches a variable name followed by anything that might follow it--
3388 array reference, argument list of a function, etc. */
3389
3390 match
3391 gfc_match_rvalue (gfc_expr **result)
3392 {
3393 gfc_actual_arglist *actual_arglist;
3394 char name[GFC_MAX_SYMBOL_LEN + 1], argname[GFC_MAX_SYMBOL_LEN + 1];
3395 gfc_state_data *st;
3396 gfc_symbol *sym;
3397 gfc_symtree *symtree;
3398 locus where, old_loc;
3399 gfc_expr *e;
3400 match m, m2;
3401 int i;
3402 gfc_typespec *ts;
3403 bool implicit_char;
3404 gfc_ref *ref;
3405
3406 m = gfc_match ("%%loc");
3407 if (m == MATCH_YES)
3408 {
3409 if (!gfc_notify_std (GFC_STD_LEGACY, "%%LOC() as an rvalue at %C"))
3410 return MATCH_ERROR;
3411 strncpy (name, "loc", 4);
3412 }
3413
3414 else
3415 {
3416 m = gfc_match_name (name);
3417 if (m != MATCH_YES)
3418 return m;
3419 }
3420
3421 /* Check if the symbol exists. */
3422 if (gfc_find_sym_tree (name, NULL, 1, &symtree))
3423 return MATCH_ERROR;
3424
3425 /* If the symbol doesn't exist, create it unless the name matches a FL_STRUCT
3426 type. For derived types we create a generic symbol which links to the
3427 derived type symbol; STRUCTUREs are simpler and must not conflict with
3428 variables. */
3429 if (!symtree)
3430 if (gfc_find_sym_tree (gfc_dt_upper_string (name), NULL, 1, &symtree))
3431 return MATCH_ERROR;
3432 if (!symtree || symtree->n.sym->attr.flavor != FL_STRUCT)
3433 {
3434 if (gfc_find_state (COMP_INTERFACE)
3435 && !gfc_current_ns->has_import_set)
3436 i = gfc_get_sym_tree (name, NULL, &symtree, false);
3437 else
3438 i = gfc_get_ha_sym_tree (name, &symtree);
3439 if (i)
3440 return MATCH_ERROR;
3441 }
3442
3443
3444 sym = symtree->n.sym;
3445 e = NULL;
3446 where = gfc_current_locus;
3447
3448 replace_hidden_procptr_result (&sym, &symtree);
3449
3450 /* If this is an implicit do loop index and implicitly typed,
3451 it should not be host associated. */
3452 m = check_for_implicit_index (&symtree, &sym);
3453 if (m != MATCH_YES)
3454 return m;
3455
3456 gfc_set_sym_referenced (sym);
3457 sym->attr.implied_index = 0;
3458
3459 if (sym->attr.function && sym->result == sym)
3460 {
3461 /* See if this is a directly recursive function call. */
3462 gfc_gobble_whitespace ();
3463 if (sym->attr.recursive
3464 && gfc_peek_ascii_char () == '('
3465 && gfc_current_ns->proc_name == sym
3466 && !sym->attr.dimension)
3467 {
3468 gfc_error ("%qs at %C is the name of a recursive function "
3469 "and so refers to the result variable. Use an "
3470 "explicit RESULT variable for direct recursion "
3471 "(12.5.2.1)", sym->name);
3472 return MATCH_ERROR;
3473 }
3474
3475 if (gfc_is_function_return_value (sym, gfc_current_ns))
3476 goto variable;
3477
3478 if (sym->attr.entry
3479 && (sym->ns == gfc_current_ns
3480 || sym->ns == gfc_current_ns->parent))
3481 {
3482 gfc_entry_list *el = NULL;
3483
3484 for (el = sym->ns->entries; el; el = el->next)
3485 if (sym == el->sym)
3486 goto variable;
3487 }
3488 }
3489
3490 if (gfc_matching_procptr_assignment)
3491 {
3492 /* It can be a procedure or a derived-type procedure or a not-yet-known
3493 type. */
3494 if (sym->attr.flavor != FL_UNKNOWN
3495 && sym->attr.flavor != FL_PROCEDURE
3496 && sym->attr.flavor != FL_PARAMETER
3497 && sym->attr.flavor != FL_VARIABLE)
3498 {
3499 gfc_error ("Symbol at %C is not appropriate for an expression");
3500 return MATCH_ERROR;
3501 }
3502 goto procptr0;
3503 }
3504
3505 if (sym->attr.function || sym->attr.external || sym->attr.intrinsic)
3506 goto function0;
3507
3508 if (sym->attr.generic)
3509 goto generic_function;
3510
3511 switch (sym->attr.flavor)
3512 {
3513 case FL_VARIABLE:
3514 variable:
3515 e = gfc_get_expr ();
3516
3517 e->expr_type = EXPR_VARIABLE;
3518 e->symtree = symtree;
3519
3520 m = gfc_match_varspec (e, 0, false, true);
3521 break;
3522
3523 case FL_PARAMETER:
3524 /* A statement of the form "REAL, parameter :: a(0:10) = 1" will
3525 end up here. Unfortunately, sym->value->expr_type is set to
3526 EXPR_CONSTANT, and so the if () branch would be followed without
3527 the !sym->as check. */
3528 if (sym->value && sym->value->expr_type != EXPR_ARRAY && !sym->as)
3529 e = gfc_copy_expr (sym->value);
3530 else
3531 {
3532 e = gfc_get_expr ();
3533 e->expr_type = EXPR_VARIABLE;
3534 }
3535
3536 e->symtree = symtree;
3537 m = gfc_match_varspec (e, 0, false, true);
3538
3539 if (sym->ts.is_c_interop || sym->ts.is_iso_c)
3540 break;
3541
3542 /* Variable array references to derived type parameters cause
3543 all sorts of headaches in simplification. Treating such
3544 expressions as variable works just fine for all array
3545 references. */
3546 if (sym->value && sym->ts.type == BT_DERIVED && e->ref)
3547 {
3548 for (ref = e->ref; ref; ref = ref->next)
3549 if (ref->type == REF_ARRAY)
3550 break;
3551
3552 if (ref == NULL || ref->u.ar.type == AR_FULL)
3553 break;
3554
3555 ref = e->ref;
3556 e->ref = NULL;
3557 gfc_free_expr (e);
3558 e = gfc_get_expr ();
3559 e->expr_type = EXPR_VARIABLE;
3560 e->symtree = symtree;
3561 e->ref = ref;
3562 }
3563
3564 break;
3565
3566 case FL_STRUCT:
3567 case FL_DERIVED:
3568 sym = gfc_use_derived (sym);
3569 if (sym == NULL)
3570 m = MATCH_ERROR;
3571 else
3572 goto generic_function;
3573 break;
3574
3575 /* If we're here, then the name is known to be the name of a
3576 procedure, yet it is not sure to be the name of a function. */
3577 case FL_PROCEDURE:
3578
3579 /* Procedure Pointer Assignments. */
3580 procptr0:
3581 if (gfc_matching_procptr_assignment)
3582 {
3583 gfc_gobble_whitespace ();
3584 if (!sym->attr.dimension && gfc_peek_ascii_char () == '(')
3585 /* Parse functions returning a procptr. */
3586 goto function0;
3587
3588 e = gfc_get_expr ();
3589 e->expr_type = EXPR_VARIABLE;
3590 e->symtree = symtree;
3591 m = gfc_match_varspec (e, 0, false, true);
3592 if (!e->ref && sym->attr.flavor == FL_UNKNOWN
3593 && sym->ts.type == BT_UNKNOWN
3594 && !gfc_add_flavor (&sym->attr, FL_PROCEDURE, sym->name, NULL))
3595 {
3596 m = MATCH_ERROR;
3597 break;
3598 }
3599 break;
3600 }
3601
3602 if (sym->attr.subroutine)
3603 {
3604 gfc_error ("Unexpected use of subroutine name %qs at %C",
3605 sym->name);
3606 m = MATCH_ERROR;
3607 break;
3608 }
3609
3610 /* At this point, the name has to be a non-statement function.
3611 If the name is the same as the current function being
3612 compiled, then we have a variable reference (to the function
3613 result) if the name is non-recursive. */
3614
3615 st = gfc_enclosing_unit (NULL);
3616
3617 if (st != NULL
3618 && st->state == COMP_FUNCTION
3619 && st->sym == sym
3620 && !sym->attr.recursive)
3621 {
3622 e = gfc_get_expr ();
3623 e->symtree = symtree;
3624 e->expr_type = EXPR_VARIABLE;
3625
3626 m = gfc_match_varspec (e, 0, false, true);
3627 break;
3628 }
3629
3630 /* Match a function reference. */
3631 function0:
3632 m = gfc_match_actual_arglist (0, &actual_arglist);
3633 if (m == MATCH_NO)
3634 {
3635 if (sym->attr.proc == PROC_ST_FUNCTION)
3636 gfc_error ("Statement function %qs requires argument list at %C",
3637 sym->name);
3638 else
3639 gfc_error ("Function %qs requires an argument list at %C",
3640 sym->name);
3641
3642 m = MATCH_ERROR;
3643 break;
3644 }
3645
3646 if (m != MATCH_YES)
3647 {
3648 m = MATCH_ERROR;
3649 break;
3650 }
3651
3652 gfc_get_ha_sym_tree (name, &symtree); /* Can't fail */
3653 sym = symtree->n.sym;
3654
3655 replace_hidden_procptr_result (&sym, &symtree);
3656
3657 e = gfc_get_expr ();
3658 e->symtree = symtree;
3659 e->expr_type = EXPR_FUNCTION;
3660 e->value.function.actual = actual_arglist;
3661 e->where = gfc_current_locus;
3662
3663 if (sym->ts.type == BT_CLASS && sym->attr.class_ok
3664 && CLASS_DATA (sym)->as)
3665 e->rank = CLASS_DATA (sym)->as->rank;
3666 else if (sym->as != NULL)
3667 e->rank = sym->as->rank;
3668
3669 if (!sym->attr.function
3670 && !gfc_add_function (&sym->attr, sym->name, NULL))
3671 {
3672 m = MATCH_ERROR;
3673 break;
3674 }
3675
3676 /* Check here for the existence of at least one argument for the
3677 iso_c_binding functions C_LOC, C_FUNLOC, and C_ASSOCIATED. The
3678 argument(s) given will be checked in gfc_iso_c_func_interface,
3679 during resolution of the function call. */
3680 if (sym->attr.is_iso_c == 1
3681 && (sym->from_intmod == INTMOD_ISO_C_BINDING
3682 && (sym->intmod_sym_id == ISOCBINDING_LOC
3683 || sym->intmod_sym_id == ISOCBINDING_FUNLOC
3684 || sym->intmod_sym_id == ISOCBINDING_ASSOCIATED)))
3685 {
3686 /* make sure we were given a param */
3687 if (actual_arglist == NULL)
3688 {
3689 gfc_error ("Missing argument to %qs at %C", sym->name);
3690 m = MATCH_ERROR;
3691 break;
3692 }
3693 }
3694
3695 if (sym->result == NULL)
3696 sym->result = sym;
3697
3698 gfc_gobble_whitespace ();
3699 /* F08:C612. */
3700 if (gfc_peek_ascii_char() == '%')
3701 {
3702 gfc_error ("The leftmost part-ref in a data-ref cannot be a "
3703 "function reference at %C");
3704 m = MATCH_ERROR;
3705 break;
3706 }
3707
3708 m = MATCH_YES;
3709 break;
3710
3711 case FL_UNKNOWN:
3712
3713 /* Special case for derived type variables that get their types
3714 via an IMPLICIT statement. This can't wait for the
3715 resolution phase. */
3716
3717 old_loc = gfc_current_locus;
3718 if (gfc_match_member_sep (sym) == MATCH_YES
3719 && sym->ts.type == BT_UNKNOWN
3720 && gfc_get_default_type (sym->name, sym->ns)->type == BT_DERIVED)
3721 gfc_set_default_type (sym, 0, sym->ns);
3722 gfc_current_locus = old_loc;
3723
3724 /* If the symbol has a (co)dimension attribute, the expression is a
3725 variable. */
3726
3727 if (sym->attr.dimension || sym->attr.codimension)
3728 {
3729 if (!gfc_add_flavor (&sym->attr, FL_VARIABLE, sym->name, NULL))
3730 {
3731 m = MATCH_ERROR;
3732 break;
3733 }
3734
3735 e = gfc_get_expr ();
3736 e->symtree = symtree;
3737 e->expr_type = EXPR_VARIABLE;
3738 m = gfc_match_varspec (e, 0, false, true);
3739 break;
3740 }
3741
3742 if (sym->ts.type == BT_CLASS && sym->attr.class_ok
3743 && (CLASS_DATA (sym)->attr.dimension
3744 || CLASS_DATA (sym)->attr.codimension))
3745 {
3746 if (!gfc_add_flavor (&sym->attr, FL_VARIABLE, sym->name, NULL))
3747 {
3748 m = MATCH_ERROR;
3749 break;
3750 }
3751
3752 e = gfc_get_expr ();
3753 e->symtree = symtree;
3754 e->expr_type = EXPR_VARIABLE;
3755 m = gfc_match_varspec (e, 0, false, true);
3756 break;
3757 }
3758
3759 /* Name is not an array, so we peek to see if a '(' implies a
3760 function call or a substring reference. Otherwise the
3761 variable is just a scalar. */
3762
3763 gfc_gobble_whitespace ();
3764 if (gfc_peek_ascii_char () != '(')
3765 {
3766 /* Assume a scalar variable */
3767 e = gfc_get_expr ();
3768 e->symtree = symtree;
3769 e->expr_type = EXPR_VARIABLE;
3770
3771 if (!gfc_add_flavor (&sym->attr, FL_VARIABLE, sym->name, NULL))
3772 {
3773 m = MATCH_ERROR;
3774 break;
3775 }
3776
3777 /*FIXME:??? gfc_match_varspec does set this for us: */
3778 e->ts = sym->ts;
3779 m = gfc_match_varspec (e, 0, false, true);
3780 break;
3781 }
3782
3783 /* See if this is a function reference with a keyword argument
3784 as first argument. We do this because otherwise a spurious
3785 symbol would end up in the symbol table. */
3786
3787 old_loc = gfc_current_locus;
3788 m2 = gfc_match (" ( %n =", argname);
3789 gfc_current_locus = old_loc;
3790
3791 e = gfc_get_expr ();
3792 e->symtree = symtree;
3793
3794 if (m2 != MATCH_YES)
3795 {
3796 /* Try to figure out whether we're dealing with a character type.
3797 We're peeking ahead here, because we don't want to call
3798 match_substring if we're dealing with an implicitly typed
3799 non-character variable. */
3800 implicit_char = false;
3801 if (sym->ts.type == BT_UNKNOWN)
3802 {
3803 ts = gfc_get_default_type (sym->name, NULL);
3804 if (ts->type == BT_CHARACTER)
3805 implicit_char = true;
3806 }
3807
3808 /* See if this could possibly be a substring reference of a name
3809 that we're not sure is a variable yet. */
3810
3811 if ((implicit_char || sym->ts.type == BT_CHARACTER)
3812 && match_substring (sym->ts.u.cl, 0, &e->ref, false) == MATCH_YES)
3813 {
3814
3815 e->expr_type = EXPR_VARIABLE;
3816
3817 if (sym->attr.flavor != FL_VARIABLE
3818 && !gfc_add_flavor (&sym->attr, FL_VARIABLE,
3819 sym->name, NULL))
3820 {
3821 m = MATCH_ERROR;
3822 break;
3823 }
3824
3825 if (sym->ts.type == BT_UNKNOWN
3826 && !gfc_set_default_type (sym, 1, NULL))
3827 {
3828 m = MATCH_ERROR;
3829 break;
3830 }
3831
3832 e->ts = sym->ts;
3833 if (e->ref)
3834 e->ts.u.cl = NULL;
3835 m = MATCH_YES;
3836 break;
3837 }
3838 }
3839
3840 /* Give up, assume we have a function. */
3841
3842 gfc_get_sym_tree (name, NULL, &symtree, false); /* Can't fail */
3843 sym = symtree->n.sym;
3844 e->expr_type = EXPR_FUNCTION;
3845
3846 if (!sym->attr.function
3847 && !gfc_add_function (&sym->attr, sym->name, NULL))
3848 {
3849 m = MATCH_ERROR;
3850 break;
3851 }
3852
3853 sym->result = sym;
3854
3855 m = gfc_match_actual_arglist (0, &e->value.function.actual);
3856 if (m == MATCH_NO)
3857 gfc_error ("Missing argument list in function %qs at %C", sym->name);
3858
3859 if (m != MATCH_YES)
3860 {
3861 m = MATCH_ERROR;
3862 break;
3863 }
3864
3865 /* If our new function returns a character, array or structure
3866 type, it might have subsequent references. */
3867
3868 m = gfc_match_varspec (e, 0, false, true);
3869 if (m == MATCH_NO)
3870 m = MATCH_YES;
3871
3872 break;
3873
3874 generic_function:
3875 /* Look for symbol first; if not found, look for STRUCTURE type symbol
3876 specially. Creates a generic symbol for derived types. */
3877 gfc_find_sym_tree (name, NULL, 1, &symtree);
3878 if (!symtree)
3879 gfc_find_sym_tree (gfc_dt_upper_string (name), NULL, 1, &symtree);
3880 if (!symtree || symtree->n.sym->attr.flavor != FL_STRUCT)
3881 gfc_get_sym_tree (name, NULL, &symtree, false); /* Can't fail */
3882
3883 e = gfc_get_expr ();
3884 e->symtree = symtree;
3885 e->expr_type = EXPR_FUNCTION;
3886
3887 if (gfc_fl_struct (sym->attr.flavor))
3888 {
3889 e->value.function.esym = sym;
3890 e->symtree->n.sym->attr.generic = 1;
3891 }
3892
3893 m = gfc_match_actual_arglist (0, &e->value.function.actual);
3894 break;
3895
3896 case FL_NAMELIST:
3897 m = MATCH_ERROR;
3898 break;
3899
3900 default:
3901 gfc_error ("Symbol at %C is not appropriate for an expression");
3902 return MATCH_ERROR;
3903 }
3904
3905 if (m == MATCH_YES)
3906 {
3907 e->where = where;
3908 *result = e;
3909 }
3910 else
3911 gfc_free_expr (e);
3912
3913 return m;
3914 }
3915
3916
3917 /* Match a variable, i.e. something that can be assigned to. This
3918 starts as a symbol, can be a structure component or an array
3919 reference. It can be a function if the function doesn't have a
3920 separate RESULT variable. If the symbol has not been previously
3921 seen, we assume it is a variable.
3922
3923 This function is called by two interface functions:
3924 gfc_match_variable, which has host_flag = 1, and
3925 gfc_match_equiv_variable, with host_flag = 0, to restrict the
3926 match of the symbol to the local scope. */
3927
3928 static match
3929 match_variable (gfc_expr **result, int equiv_flag, int host_flag)
3930 {
3931 gfc_symbol *sym, *dt_sym;
3932 gfc_symtree *st;
3933 gfc_expr *expr;
3934 locus where, old_loc;
3935 match m;
3936
3937 /* Since nothing has any business being an lvalue in a module
3938 specification block, an interface block or a contains section,
3939 we force the changed_symbols mechanism to work by setting
3940 host_flag to 0. This prevents valid symbols that have the name
3941 of keywords, such as 'end', being turned into variables by
3942 failed matching to assignments for, e.g., END INTERFACE. */
3943 if (gfc_current_state () == COMP_MODULE
3944 || gfc_current_state () == COMP_SUBMODULE
3945 || gfc_current_state () == COMP_INTERFACE
3946 || gfc_current_state () == COMP_CONTAINS)
3947 host_flag = 0;
3948
3949 where = gfc_current_locus;
3950 m = gfc_match_sym_tree (&st, host_flag);
3951 if (m != MATCH_YES)
3952 return m;
3953
3954 sym = st->n.sym;
3955
3956 /* If this is an implicit do loop index and implicitly typed,
3957 it should not be host associated. */
3958 m = check_for_implicit_index (&st, &sym);
3959 if (m != MATCH_YES)
3960 return m;
3961
3962 sym->attr.implied_index = 0;
3963
3964 gfc_set_sym_referenced (sym);
3965
3966 /* STRUCTUREs may share names with variables, but derived types may not. */
3967 if (sym->attr.flavor == FL_PROCEDURE && sym->generic
3968 && (dt_sym = gfc_find_dt_in_generic (sym)))
3969 {
3970 if (dt_sym->attr.flavor == FL_DERIVED)
3971 gfc_error ("Derived type %qs cannot be used as a variable at %C",
3972 sym->name);
3973 return MATCH_ERROR;
3974 }
3975
3976 switch (sym->attr.flavor)
3977 {
3978 case FL_VARIABLE:
3979 /* Everything is alright. */
3980 break;
3981
3982 case FL_UNKNOWN:
3983 {
3984 sym_flavor flavor = FL_UNKNOWN;
3985
3986 gfc_gobble_whitespace ();
3987
3988 if (sym->attr.external || sym->attr.procedure
3989 || sym->attr.function || sym->attr.subroutine)
3990 flavor = FL_PROCEDURE;
3991
3992 /* If it is not a procedure, is not typed and is host associated,
3993 we cannot give it a flavor yet. */
3994 else if (sym->ns == gfc_current_ns->parent
3995 && sym->ts.type == BT_UNKNOWN)
3996 break;
3997
3998 /* These are definitive indicators that this is a variable. */
3999 else if (gfc_peek_ascii_char () != '(' || sym->ts.type != BT_UNKNOWN
4000 || sym->attr.pointer || sym->as != NULL)
4001 flavor = FL_VARIABLE;
4002
4003 if (flavor != FL_UNKNOWN
4004 && !gfc_add_flavor (&sym->attr, flavor, sym->name, NULL))
4005 return MATCH_ERROR;
4006 }
4007 break;
4008
4009 case FL_PARAMETER:
4010 if (equiv_flag)
4011 {
4012 gfc_error ("Named constant at %C in an EQUIVALENCE");
4013 return MATCH_ERROR;
4014 }
4015 /* Otherwise this is checked for and an error given in the
4016 variable definition context checks. */
4017 break;
4018
4019 case FL_PROCEDURE:
4020 /* Check for a nonrecursive function result variable. */
4021 if (sym->attr.function
4022 && !sym->attr.external
4023 && sym->result == sym
4024 && (gfc_is_function_return_value (sym, gfc_current_ns)
4025 || (sym->attr.entry
4026 && sym->ns == gfc_current_ns)
4027 || (sym->attr.entry
4028 && sym->ns == gfc_current_ns->parent)))
4029 {
4030 /* If a function result is a derived type, then the derived
4031 type may still have to be resolved. */
4032
4033 if (sym->ts.type == BT_DERIVED
4034 && gfc_use_derived (sym->ts.u.derived) == NULL)
4035 return MATCH_ERROR;
4036 break;
4037 }
4038
4039 if (sym->attr.proc_pointer
4040 || replace_hidden_procptr_result (&sym, &st))
4041 break;
4042
4043 /* Fall through to error */
4044 gcc_fallthrough ();
4045
4046 default:
4047 gfc_error ("%qs at %C is not a variable", sym->name);
4048 return MATCH_ERROR;
4049 }
4050
4051 /* Special case for derived type variables that get their types
4052 via an IMPLICIT statement. This can't wait for the
4053 resolution phase. */
4054
4055 {
4056 gfc_namespace * implicit_ns;
4057
4058 if (gfc_current_ns->proc_name == sym)
4059 implicit_ns = gfc_current_ns;
4060 else
4061 implicit_ns = sym->ns;
4062
4063 old_loc = gfc_current_locus;
4064 if (gfc_match_member_sep (sym) == MATCH_YES
4065 && sym->ts.type == BT_UNKNOWN
4066 && gfc_get_default_type (sym->name, implicit_ns)->type == BT_DERIVED)
4067 gfc_set_default_type (sym, 0, implicit_ns);
4068 gfc_current_locus = old_loc;
4069 }
4070
4071 expr = gfc_get_expr ();
4072
4073 expr->expr_type = EXPR_VARIABLE;
4074 expr->symtree = st;
4075 expr->ts = sym->ts;
4076 expr->where = where;
4077
4078 /* Now see if we have to do more. */
4079 m = gfc_match_varspec (expr, equiv_flag, false, false);
4080 if (m != MATCH_YES)
4081 {
4082 gfc_free_expr (expr);
4083 return m;
4084 }
4085
4086 *result = expr;
4087 return MATCH_YES;
4088 }
4089
4090
4091 match
4092 gfc_match_variable (gfc_expr **result, int equiv_flag)
4093 {
4094 return match_variable (result, equiv_flag, 1);
4095 }
4096
4097
4098 match
4099 gfc_match_equiv_variable (gfc_expr **result)
4100 {
4101 return match_variable (result, 1, 0);
4102 }
4103