re PR fortran/41940 (Improve error message for allocating scalar with shape)
[gcc.git] / gcc / fortran / match.c
1 /* Matching subroutines in all sizes, shapes and colors.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
4 Contributed by Andy Vaught
5
6 This file is part of GCC.
7
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
12
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
17
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
21
22 #include "config.h"
23 #include "system.h"
24 #include "flags.h"
25 #include "gfortran.h"
26 #include "match.h"
27 #include "parse.h"
28
29 int gfc_matching_procptr_assignment = 0;
30 bool gfc_matching_prefix = false;
31
32 /* Stack of SELECT TYPE statements. */
33 gfc_select_type_stack *select_type_stack = NULL;
34
35 /* For debugging and diagnostic purposes. Return the textual representation
36 of the intrinsic operator OP. */
37 const char *
38 gfc_op2string (gfc_intrinsic_op op)
39 {
40 switch (op)
41 {
42 case INTRINSIC_UPLUS:
43 case INTRINSIC_PLUS:
44 return "+";
45
46 case INTRINSIC_UMINUS:
47 case INTRINSIC_MINUS:
48 return "-";
49
50 case INTRINSIC_POWER:
51 return "**";
52 case INTRINSIC_CONCAT:
53 return "//";
54 case INTRINSIC_TIMES:
55 return "*";
56 case INTRINSIC_DIVIDE:
57 return "/";
58
59 case INTRINSIC_AND:
60 return ".and.";
61 case INTRINSIC_OR:
62 return ".or.";
63 case INTRINSIC_EQV:
64 return ".eqv.";
65 case INTRINSIC_NEQV:
66 return ".neqv.";
67
68 case INTRINSIC_EQ_OS:
69 return ".eq.";
70 case INTRINSIC_EQ:
71 return "==";
72 case INTRINSIC_NE_OS:
73 return ".ne.";
74 case INTRINSIC_NE:
75 return "/=";
76 case INTRINSIC_GE_OS:
77 return ".ge.";
78 case INTRINSIC_GE:
79 return ">=";
80 case INTRINSIC_LE_OS:
81 return ".le.";
82 case INTRINSIC_LE:
83 return "<=";
84 case INTRINSIC_LT_OS:
85 return ".lt.";
86 case INTRINSIC_LT:
87 return "<";
88 case INTRINSIC_GT_OS:
89 return ".gt.";
90 case INTRINSIC_GT:
91 return ">";
92 case INTRINSIC_NOT:
93 return ".not.";
94
95 case INTRINSIC_ASSIGN:
96 return "=";
97
98 case INTRINSIC_PARENTHESES:
99 return "parens";
100
101 default:
102 break;
103 }
104
105 gfc_internal_error ("gfc_op2string(): Bad code");
106 /* Not reached. */
107 }
108
109
110 /******************** Generic matching subroutines ************************/
111
112 /* This function scans the current statement counting the opened and closed
113 parenthesis to make sure they are balanced. */
114
115 match
116 gfc_match_parens (void)
117 {
118 locus old_loc, where;
119 int count, instring;
120 gfc_char_t c, quote;
121
122 old_loc = gfc_current_locus;
123 count = 0;
124 instring = 0;
125 quote = ' ';
126
127 for (;;)
128 {
129 c = gfc_next_char_literal (instring);
130 if (c == '\n')
131 break;
132 if (quote == ' ' && ((c == '\'') || (c == '"')))
133 {
134 quote = c;
135 instring = 1;
136 continue;
137 }
138 if (quote != ' ' && c == quote)
139 {
140 quote = ' ';
141 instring = 0;
142 continue;
143 }
144
145 if (c == '(' && quote == ' ')
146 {
147 count++;
148 where = gfc_current_locus;
149 }
150 if (c == ')' && quote == ' ')
151 {
152 count--;
153 where = gfc_current_locus;
154 }
155 }
156
157 gfc_current_locus = old_loc;
158
159 if (count > 0)
160 {
161 gfc_error ("Missing ')' in statement at or before %L", &where);
162 return MATCH_ERROR;
163 }
164 if (count < 0)
165 {
166 gfc_error ("Missing '(' in statement at or before %L", &where);
167 return MATCH_ERROR;
168 }
169
170 return MATCH_YES;
171 }
172
173
174 /* See if the next character is a special character that has
175 escaped by a \ via the -fbackslash option. */
176
177 match
178 gfc_match_special_char (gfc_char_t *res)
179 {
180 int len, i;
181 gfc_char_t c, n;
182 match m;
183
184 m = MATCH_YES;
185
186 switch ((c = gfc_next_char_literal (1)))
187 {
188 case 'a':
189 *res = '\a';
190 break;
191 case 'b':
192 *res = '\b';
193 break;
194 case 't':
195 *res = '\t';
196 break;
197 case 'f':
198 *res = '\f';
199 break;
200 case 'n':
201 *res = '\n';
202 break;
203 case 'r':
204 *res = '\r';
205 break;
206 case 'v':
207 *res = '\v';
208 break;
209 case '\\':
210 *res = '\\';
211 break;
212 case '0':
213 *res = '\0';
214 break;
215
216 case 'x':
217 case 'u':
218 case 'U':
219 /* Hexadecimal form of wide characters. */
220 len = (c == 'x' ? 2 : (c == 'u' ? 4 : 8));
221 n = 0;
222 for (i = 0; i < len; i++)
223 {
224 char buf[2] = { '\0', '\0' };
225
226 c = gfc_next_char_literal (1);
227 if (!gfc_wide_fits_in_byte (c)
228 || !gfc_check_digit ((unsigned char) c, 16))
229 return MATCH_NO;
230
231 buf[0] = (unsigned char) c;
232 n = n << 4;
233 n += strtol (buf, NULL, 16);
234 }
235 *res = n;
236 break;
237
238 default:
239 /* Unknown backslash codes are simply not expanded. */
240 m = MATCH_NO;
241 break;
242 }
243
244 return m;
245 }
246
247
248 /* In free form, match at least one space. Always matches in fixed
249 form. */
250
251 match
252 gfc_match_space (void)
253 {
254 locus old_loc;
255 char c;
256
257 if (gfc_current_form == FORM_FIXED)
258 return MATCH_YES;
259
260 old_loc = gfc_current_locus;
261
262 c = gfc_next_ascii_char ();
263 if (!gfc_is_whitespace (c))
264 {
265 gfc_current_locus = old_loc;
266 return MATCH_NO;
267 }
268
269 gfc_gobble_whitespace ();
270
271 return MATCH_YES;
272 }
273
274
275 /* Match an end of statement. End of statement is optional
276 whitespace, followed by a ';' or '\n' or comment '!'. If a
277 semicolon is found, we continue to eat whitespace and semicolons. */
278
279 match
280 gfc_match_eos (void)
281 {
282 locus old_loc;
283 int flag;
284 char c;
285
286 flag = 0;
287
288 for (;;)
289 {
290 old_loc = gfc_current_locus;
291 gfc_gobble_whitespace ();
292
293 c = gfc_next_ascii_char ();
294 switch (c)
295 {
296 case '!':
297 do
298 {
299 c = gfc_next_ascii_char ();
300 }
301 while (c != '\n');
302
303 /* Fall through. */
304
305 case '\n':
306 return MATCH_YES;
307
308 case ';':
309 flag = 1;
310 continue;
311 }
312
313 break;
314 }
315
316 gfc_current_locus = old_loc;
317 return (flag) ? MATCH_YES : MATCH_NO;
318 }
319
320
321 /* Match a literal integer on the input, setting the value on
322 MATCH_YES. Literal ints occur in kind-parameters as well as
323 old-style character length specifications. If cnt is non-NULL it
324 will be set to the number of digits. */
325
326 match
327 gfc_match_small_literal_int (int *value, int *cnt)
328 {
329 locus old_loc;
330 char c;
331 int i, j;
332
333 old_loc = gfc_current_locus;
334
335 *value = -1;
336 gfc_gobble_whitespace ();
337 c = gfc_next_ascii_char ();
338 if (cnt)
339 *cnt = 0;
340
341 if (!ISDIGIT (c))
342 {
343 gfc_current_locus = old_loc;
344 return MATCH_NO;
345 }
346
347 i = c - '0';
348 j = 1;
349
350 for (;;)
351 {
352 old_loc = gfc_current_locus;
353 c = gfc_next_ascii_char ();
354
355 if (!ISDIGIT (c))
356 break;
357
358 i = 10 * i + c - '0';
359 j++;
360
361 if (i > 99999999)
362 {
363 gfc_error ("Integer too large at %C");
364 return MATCH_ERROR;
365 }
366 }
367
368 gfc_current_locus = old_loc;
369
370 *value = i;
371 if (cnt)
372 *cnt = j;
373 return MATCH_YES;
374 }
375
376
377 /* Match a small, constant integer expression, like in a kind
378 statement. On MATCH_YES, 'value' is set. */
379
380 match
381 gfc_match_small_int (int *value)
382 {
383 gfc_expr *expr;
384 const char *p;
385 match m;
386 int i;
387
388 m = gfc_match_expr (&expr);
389 if (m != MATCH_YES)
390 return m;
391
392 p = gfc_extract_int (expr, &i);
393 gfc_free_expr (expr);
394
395 if (p != NULL)
396 {
397 gfc_error (p);
398 m = MATCH_ERROR;
399 }
400
401 *value = i;
402 return m;
403 }
404
405
406 /* This function is the same as the gfc_match_small_int, except that
407 we're keeping the pointer to the expr. This function could just be
408 removed and the previously mentioned one modified, though all calls
409 to it would have to be modified then (and there were a number of
410 them). Return MATCH_ERROR if fail to extract the int; otherwise,
411 return the result of gfc_match_expr(). The expr (if any) that was
412 matched is returned in the parameter expr. */
413
414 match
415 gfc_match_small_int_expr (int *value, gfc_expr **expr)
416 {
417 const char *p;
418 match m;
419 int i;
420
421 m = gfc_match_expr (expr);
422 if (m != MATCH_YES)
423 return m;
424
425 p = gfc_extract_int (*expr, &i);
426
427 if (p != NULL)
428 {
429 gfc_error (p);
430 m = MATCH_ERROR;
431 }
432
433 *value = i;
434 return m;
435 }
436
437
438 /* Matches a statement label. Uses gfc_match_small_literal_int() to
439 do most of the work. */
440
441 match
442 gfc_match_st_label (gfc_st_label **label)
443 {
444 locus old_loc;
445 match m;
446 int i, cnt;
447
448 old_loc = gfc_current_locus;
449
450 m = gfc_match_small_literal_int (&i, &cnt);
451 if (m != MATCH_YES)
452 return m;
453
454 if (cnt > 5)
455 {
456 gfc_error ("Too many digits in statement label at %C");
457 goto cleanup;
458 }
459
460 if (i == 0)
461 {
462 gfc_error ("Statement label at %C is zero");
463 goto cleanup;
464 }
465
466 *label = gfc_get_st_label (i);
467 return MATCH_YES;
468
469 cleanup:
470
471 gfc_current_locus = old_loc;
472 return MATCH_ERROR;
473 }
474
475
476 /* Match and validate a label associated with a named IF, DO or SELECT
477 statement. If the symbol does not have the label attribute, we add
478 it. We also make sure the symbol does not refer to another
479 (active) block. A matched label is pointed to by gfc_new_block. */
480
481 match
482 gfc_match_label (void)
483 {
484 char name[GFC_MAX_SYMBOL_LEN + 1];
485 match m;
486
487 gfc_new_block = NULL;
488
489 m = gfc_match (" %n :", name);
490 if (m != MATCH_YES)
491 return m;
492
493 if (gfc_get_symbol (name, NULL, &gfc_new_block))
494 {
495 gfc_error ("Label name '%s' at %C is ambiguous", name);
496 return MATCH_ERROR;
497 }
498
499 if (gfc_new_block->attr.flavor == FL_LABEL)
500 {
501 gfc_error ("Duplicate construct label '%s' at %C", name);
502 return MATCH_ERROR;
503 }
504
505 if (gfc_add_flavor (&gfc_new_block->attr, FL_LABEL,
506 gfc_new_block->name, NULL) == FAILURE)
507 return MATCH_ERROR;
508
509 return MATCH_YES;
510 }
511
512
513 /* See if the current input looks like a name of some sort. Modifies
514 the passed buffer which must be GFC_MAX_SYMBOL_LEN+1 bytes long.
515 Note that options.c restricts max_identifier_length to not more
516 than GFC_MAX_SYMBOL_LEN. */
517
518 match
519 gfc_match_name (char *buffer)
520 {
521 locus old_loc;
522 int i;
523 char c;
524
525 old_loc = gfc_current_locus;
526 gfc_gobble_whitespace ();
527
528 c = gfc_next_ascii_char ();
529 if (!(ISALPHA (c) || (c == '_' && gfc_option.flag_allow_leading_underscore)))
530 {
531 if (gfc_error_flag_test() == 0 && c != '(')
532 gfc_error ("Invalid character in name at %C");
533 gfc_current_locus = old_loc;
534 return MATCH_NO;
535 }
536
537 i = 0;
538
539 do
540 {
541 buffer[i++] = c;
542
543 if (i > gfc_option.max_identifier_length)
544 {
545 gfc_error ("Name at %C is too long");
546 return MATCH_ERROR;
547 }
548
549 old_loc = gfc_current_locus;
550 c = gfc_next_ascii_char ();
551 }
552 while (ISALNUM (c) || c == '_' || (gfc_option.flag_dollar_ok && c == '$'));
553
554 if (c == '$' && !gfc_option.flag_dollar_ok)
555 {
556 gfc_error ("Invalid character '$' at %C. Use -fdollar-ok to allow it "
557 "as an extension");
558 return MATCH_ERROR;
559 }
560
561 buffer[i] = '\0';
562 gfc_current_locus = old_loc;
563
564 return MATCH_YES;
565 }
566
567
568 /* Match a valid name for C, which is almost the same as for Fortran,
569 except that you can start with an underscore, etc.. It could have
570 been done by modifying the gfc_match_name, but this way other
571 things C allows can be added, such as no limits on the length.
572 Right now, the length is limited to the same thing as Fortran..
573 Also, by rewriting it, we use the gfc_next_char_C() to prevent the
574 input characters from being automatically lower cased, since C is
575 case sensitive. The parameter, buffer, is used to return the name
576 that is matched. Return MATCH_ERROR if the name is too long
577 (though this is a self-imposed limit), MATCH_NO if what we're
578 seeing isn't a name, and MATCH_YES if we successfully match a C
579 name. */
580
581 match
582 gfc_match_name_C (char *buffer)
583 {
584 locus old_loc;
585 int i = 0;
586 gfc_char_t c;
587
588 old_loc = gfc_current_locus;
589 gfc_gobble_whitespace ();
590
591 /* Get the next char (first possible char of name) and see if
592 it's valid for C (either a letter or an underscore). */
593 c = gfc_next_char_literal (1);
594
595 /* If the user put nothing expect spaces between the quotes, it is valid
596 and simply means there is no name= specifier and the name is the fortran
597 symbol name, all lowercase. */
598 if (c == '"' || c == '\'')
599 {
600 buffer[0] = '\0';
601 gfc_current_locus = old_loc;
602 return MATCH_YES;
603 }
604
605 if (!ISALPHA (c) && c != '_')
606 {
607 gfc_error ("Invalid C name in NAME= specifier at %C");
608 return MATCH_ERROR;
609 }
610
611 /* Continue to read valid variable name characters. */
612 do
613 {
614 gcc_assert (gfc_wide_fits_in_byte (c));
615
616 buffer[i++] = (unsigned char) c;
617
618 /* C does not define a maximum length of variable names, to my
619 knowledge, but the compiler typically places a limit on them.
620 For now, i'll use the same as the fortran limit for simplicity,
621 but this may need to be changed to a dynamic buffer that can
622 be realloc'ed here if necessary, or more likely, a larger
623 upper-bound set. */
624 if (i > gfc_option.max_identifier_length)
625 {
626 gfc_error ("Name at %C is too long");
627 return MATCH_ERROR;
628 }
629
630 old_loc = gfc_current_locus;
631
632 /* Get next char; param means we're in a string. */
633 c = gfc_next_char_literal (1);
634 } while (ISALNUM (c) || c == '_');
635
636 buffer[i] = '\0';
637 gfc_current_locus = old_loc;
638
639 /* See if we stopped because of whitespace. */
640 if (c == ' ')
641 {
642 gfc_gobble_whitespace ();
643 c = gfc_peek_ascii_char ();
644 if (c != '"' && c != '\'')
645 {
646 gfc_error ("Embedded space in NAME= specifier at %C");
647 return MATCH_ERROR;
648 }
649 }
650
651 /* If we stopped because we had an invalid character for a C name, report
652 that to the user by returning MATCH_NO. */
653 if (c != '"' && c != '\'')
654 {
655 gfc_error ("Invalid C name in NAME= specifier at %C");
656 return MATCH_ERROR;
657 }
658
659 return MATCH_YES;
660 }
661
662
663 /* Match a symbol on the input. Modifies the pointer to the symbol
664 pointer if successful. */
665
666 match
667 gfc_match_sym_tree (gfc_symtree **matched_symbol, int host_assoc)
668 {
669 char buffer[GFC_MAX_SYMBOL_LEN + 1];
670 match m;
671
672 m = gfc_match_name (buffer);
673 if (m != MATCH_YES)
674 return m;
675
676 if (host_assoc)
677 return (gfc_get_ha_sym_tree (buffer, matched_symbol))
678 ? MATCH_ERROR : MATCH_YES;
679
680 if (gfc_get_sym_tree (buffer, NULL, matched_symbol, false))
681 return MATCH_ERROR;
682
683 return MATCH_YES;
684 }
685
686
687 match
688 gfc_match_symbol (gfc_symbol **matched_symbol, int host_assoc)
689 {
690 gfc_symtree *st;
691 match m;
692
693 m = gfc_match_sym_tree (&st, host_assoc);
694
695 if (m == MATCH_YES)
696 {
697 if (st)
698 *matched_symbol = st->n.sym;
699 else
700 *matched_symbol = NULL;
701 }
702 else
703 *matched_symbol = NULL;
704 return m;
705 }
706
707
708 /* Match an intrinsic operator. Returns an INTRINSIC enum. While matching,
709 we always find INTRINSIC_PLUS before INTRINSIC_UPLUS. We work around this
710 in matchexp.c. */
711
712 match
713 gfc_match_intrinsic_op (gfc_intrinsic_op *result)
714 {
715 locus orig_loc = gfc_current_locus;
716 char ch;
717
718 gfc_gobble_whitespace ();
719 ch = gfc_next_ascii_char ();
720 switch (ch)
721 {
722 case '+':
723 /* Matched "+". */
724 *result = INTRINSIC_PLUS;
725 return MATCH_YES;
726
727 case '-':
728 /* Matched "-". */
729 *result = INTRINSIC_MINUS;
730 return MATCH_YES;
731
732 case '=':
733 if (gfc_next_ascii_char () == '=')
734 {
735 /* Matched "==". */
736 *result = INTRINSIC_EQ;
737 return MATCH_YES;
738 }
739 break;
740
741 case '<':
742 if (gfc_peek_ascii_char () == '=')
743 {
744 /* Matched "<=". */
745 gfc_next_ascii_char ();
746 *result = INTRINSIC_LE;
747 return MATCH_YES;
748 }
749 /* Matched "<". */
750 *result = INTRINSIC_LT;
751 return MATCH_YES;
752
753 case '>':
754 if (gfc_peek_ascii_char () == '=')
755 {
756 /* Matched ">=". */
757 gfc_next_ascii_char ();
758 *result = INTRINSIC_GE;
759 return MATCH_YES;
760 }
761 /* Matched ">". */
762 *result = INTRINSIC_GT;
763 return MATCH_YES;
764
765 case '*':
766 if (gfc_peek_ascii_char () == '*')
767 {
768 /* Matched "**". */
769 gfc_next_ascii_char ();
770 *result = INTRINSIC_POWER;
771 return MATCH_YES;
772 }
773 /* Matched "*". */
774 *result = INTRINSIC_TIMES;
775 return MATCH_YES;
776
777 case '/':
778 ch = gfc_peek_ascii_char ();
779 if (ch == '=')
780 {
781 /* Matched "/=". */
782 gfc_next_ascii_char ();
783 *result = INTRINSIC_NE;
784 return MATCH_YES;
785 }
786 else if (ch == '/')
787 {
788 /* Matched "//". */
789 gfc_next_ascii_char ();
790 *result = INTRINSIC_CONCAT;
791 return MATCH_YES;
792 }
793 /* Matched "/". */
794 *result = INTRINSIC_DIVIDE;
795 return MATCH_YES;
796
797 case '.':
798 ch = gfc_next_ascii_char ();
799 switch (ch)
800 {
801 case 'a':
802 if (gfc_next_ascii_char () == 'n'
803 && gfc_next_ascii_char () == 'd'
804 && gfc_next_ascii_char () == '.')
805 {
806 /* Matched ".and.". */
807 *result = INTRINSIC_AND;
808 return MATCH_YES;
809 }
810 break;
811
812 case 'e':
813 if (gfc_next_ascii_char () == 'q')
814 {
815 ch = gfc_next_ascii_char ();
816 if (ch == '.')
817 {
818 /* Matched ".eq.". */
819 *result = INTRINSIC_EQ_OS;
820 return MATCH_YES;
821 }
822 else if (ch == 'v')
823 {
824 if (gfc_next_ascii_char () == '.')
825 {
826 /* Matched ".eqv.". */
827 *result = INTRINSIC_EQV;
828 return MATCH_YES;
829 }
830 }
831 }
832 break;
833
834 case 'g':
835 ch = gfc_next_ascii_char ();
836 if (ch == 'e')
837 {
838 if (gfc_next_ascii_char () == '.')
839 {
840 /* Matched ".ge.". */
841 *result = INTRINSIC_GE_OS;
842 return MATCH_YES;
843 }
844 }
845 else if (ch == 't')
846 {
847 if (gfc_next_ascii_char () == '.')
848 {
849 /* Matched ".gt.". */
850 *result = INTRINSIC_GT_OS;
851 return MATCH_YES;
852 }
853 }
854 break;
855
856 case 'l':
857 ch = gfc_next_ascii_char ();
858 if (ch == 'e')
859 {
860 if (gfc_next_ascii_char () == '.')
861 {
862 /* Matched ".le.". */
863 *result = INTRINSIC_LE_OS;
864 return MATCH_YES;
865 }
866 }
867 else if (ch == 't')
868 {
869 if (gfc_next_ascii_char () == '.')
870 {
871 /* Matched ".lt.". */
872 *result = INTRINSIC_LT_OS;
873 return MATCH_YES;
874 }
875 }
876 break;
877
878 case 'n':
879 ch = gfc_next_ascii_char ();
880 if (ch == 'e')
881 {
882 ch = gfc_next_ascii_char ();
883 if (ch == '.')
884 {
885 /* Matched ".ne.". */
886 *result = INTRINSIC_NE_OS;
887 return MATCH_YES;
888 }
889 else if (ch == 'q')
890 {
891 if (gfc_next_ascii_char () == 'v'
892 && gfc_next_ascii_char () == '.')
893 {
894 /* Matched ".neqv.". */
895 *result = INTRINSIC_NEQV;
896 return MATCH_YES;
897 }
898 }
899 }
900 else if (ch == 'o')
901 {
902 if (gfc_next_ascii_char () == 't'
903 && gfc_next_ascii_char () == '.')
904 {
905 /* Matched ".not.". */
906 *result = INTRINSIC_NOT;
907 return MATCH_YES;
908 }
909 }
910 break;
911
912 case 'o':
913 if (gfc_next_ascii_char () == 'r'
914 && gfc_next_ascii_char () == '.')
915 {
916 /* Matched ".or.". */
917 *result = INTRINSIC_OR;
918 return MATCH_YES;
919 }
920 break;
921
922 default:
923 break;
924 }
925 break;
926
927 default:
928 break;
929 }
930
931 gfc_current_locus = orig_loc;
932 return MATCH_NO;
933 }
934
935
936 /* Match a loop control phrase:
937
938 <LVALUE> = <EXPR>, <EXPR> [, <EXPR> ]
939
940 If the final integer expression is not present, a constant unity
941 expression is returned. We don't return MATCH_ERROR until after
942 the equals sign is seen. */
943
944 match
945 gfc_match_iterator (gfc_iterator *iter, int init_flag)
946 {
947 char name[GFC_MAX_SYMBOL_LEN + 1];
948 gfc_expr *var, *e1, *e2, *e3;
949 locus start;
950 match m;
951
952 /* Match the start of an iterator without affecting the symbol table. */
953
954 start = gfc_current_locus;
955 m = gfc_match (" %n =", name);
956 gfc_current_locus = start;
957
958 if (m != MATCH_YES)
959 return MATCH_NO;
960
961 m = gfc_match_variable (&var, 0);
962 if (m != MATCH_YES)
963 return MATCH_NO;
964
965 gfc_match_char ('=');
966
967 e1 = e2 = e3 = NULL;
968
969 if (var->ref != NULL)
970 {
971 gfc_error ("Loop variable at %C cannot be a sub-component");
972 goto cleanup;
973 }
974
975 if (var->symtree->n.sym->attr.intent == INTENT_IN)
976 {
977 gfc_error ("Loop variable '%s' at %C cannot be INTENT(IN)",
978 var->symtree->n.sym->name);
979 goto cleanup;
980 }
981
982 var->symtree->n.sym->attr.implied_index = 1;
983
984 m = init_flag ? gfc_match_init_expr (&e1) : gfc_match_expr (&e1);
985 if (m == MATCH_NO)
986 goto syntax;
987 if (m == MATCH_ERROR)
988 goto cleanup;
989
990 if (gfc_match_char (',') != MATCH_YES)
991 goto syntax;
992
993 m = init_flag ? gfc_match_init_expr (&e2) : gfc_match_expr (&e2);
994 if (m == MATCH_NO)
995 goto syntax;
996 if (m == MATCH_ERROR)
997 goto cleanup;
998
999 if (gfc_match_char (',') != MATCH_YES)
1000 {
1001 e3 = gfc_int_expr (1);
1002 goto done;
1003 }
1004
1005 m = init_flag ? gfc_match_init_expr (&e3) : gfc_match_expr (&e3);
1006 if (m == MATCH_ERROR)
1007 goto cleanup;
1008 if (m == MATCH_NO)
1009 {
1010 gfc_error ("Expected a step value in iterator at %C");
1011 goto cleanup;
1012 }
1013
1014 done:
1015 iter->var = var;
1016 iter->start = e1;
1017 iter->end = e2;
1018 iter->step = e3;
1019 return MATCH_YES;
1020
1021 syntax:
1022 gfc_error ("Syntax error in iterator at %C");
1023
1024 cleanup:
1025 gfc_free_expr (e1);
1026 gfc_free_expr (e2);
1027 gfc_free_expr (e3);
1028
1029 return MATCH_ERROR;
1030 }
1031
1032
1033 /* Tries to match the next non-whitespace character on the input.
1034 This subroutine does not return MATCH_ERROR. */
1035
1036 match
1037 gfc_match_char (char c)
1038 {
1039 locus where;
1040
1041 where = gfc_current_locus;
1042 gfc_gobble_whitespace ();
1043
1044 if (gfc_next_ascii_char () == c)
1045 return MATCH_YES;
1046
1047 gfc_current_locus = where;
1048 return MATCH_NO;
1049 }
1050
1051
1052 /* General purpose matching subroutine. The target string is a
1053 scanf-like format string in which spaces correspond to arbitrary
1054 whitespace (including no whitespace), characters correspond to
1055 themselves. The %-codes are:
1056
1057 %% Literal percent sign
1058 %e Expression, pointer to a pointer is set
1059 %s Symbol, pointer to the symbol is set
1060 %n Name, character buffer is set to name
1061 %t Matches end of statement.
1062 %o Matches an intrinsic operator, returned as an INTRINSIC enum.
1063 %l Matches a statement label
1064 %v Matches a variable expression (an lvalue)
1065 % Matches a required space (in free form) and optional spaces. */
1066
1067 match
1068 gfc_match (const char *target, ...)
1069 {
1070 gfc_st_label **label;
1071 int matches, *ip;
1072 locus old_loc;
1073 va_list argp;
1074 char c, *np;
1075 match m, n;
1076 void **vp;
1077 const char *p;
1078
1079 old_loc = gfc_current_locus;
1080 va_start (argp, target);
1081 m = MATCH_NO;
1082 matches = 0;
1083 p = target;
1084
1085 loop:
1086 c = *p++;
1087 switch (c)
1088 {
1089 case ' ':
1090 gfc_gobble_whitespace ();
1091 goto loop;
1092 case '\0':
1093 m = MATCH_YES;
1094 break;
1095
1096 case '%':
1097 c = *p++;
1098 switch (c)
1099 {
1100 case 'e':
1101 vp = va_arg (argp, void **);
1102 n = gfc_match_expr ((gfc_expr **) vp);
1103 if (n != MATCH_YES)
1104 {
1105 m = n;
1106 goto not_yes;
1107 }
1108
1109 matches++;
1110 goto loop;
1111
1112 case 'v':
1113 vp = va_arg (argp, void **);
1114 n = gfc_match_variable ((gfc_expr **) vp, 0);
1115 if (n != MATCH_YES)
1116 {
1117 m = n;
1118 goto not_yes;
1119 }
1120
1121 matches++;
1122 goto loop;
1123
1124 case 's':
1125 vp = va_arg (argp, void **);
1126 n = gfc_match_symbol ((gfc_symbol **) vp, 0);
1127 if (n != MATCH_YES)
1128 {
1129 m = n;
1130 goto not_yes;
1131 }
1132
1133 matches++;
1134 goto loop;
1135
1136 case 'n':
1137 np = va_arg (argp, char *);
1138 n = gfc_match_name (np);
1139 if (n != MATCH_YES)
1140 {
1141 m = n;
1142 goto not_yes;
1143 }
1144
1145 matches++;
1146 goto loop;
1147
1148 case 'l':
1149 label = va_arg (argp, gfc_st_label **);
1150 n = gfc_match_st_label (label);
1151 if (n != MATCH_YES)
1152 {
1153 m = n;
1154 goto not_yes;
1155 }
1156
1157 matches++;
1158 goto loop;
1159
1160 case 'o':
1161 ip = va_arg (argp, int *);
1162 n = gfc_match_intrinsic_op ((gfc_intrinsic_op *) ip);
1163 if (n != MATCH_YES)
1164 {
1165 m = n;
1166 goto not_yes;
1167 }
1168
1169 matches++;
1170 goto loop;
1171
1172 case 't':
1173 if (gfc_match_eos () != MATCH_YES)
1174 {
1175 m = MATCH_NO;
1176 goto not_yes;
1177 }
1178 goto loop;
1179
1180 case ' ':
1181 if (gfc_match_space () == MATCH_YES)
1182 goto loop;
1183 m = MATCH_NO;
1184 goto not_yes;
1185
1186 case '%':
1187 break; /* Fall through to character matcher. */
1188
1189 default:
1190 gfc_internal_error ("gfc_match(): Bad match code %c", c);
1191 }
1192
1193 default:
1194
1195 /* gfc_next_ascii_char converts characters to lower-case, so we shouldn't
1196 expect an upper case character here! */
1197 gcc_assert (TOLOWER (c) == c);
1198
1199 if (c == gfc_next_ascii_char ())
1200 goto loop;
1201 break;
1202 }
1203
1204 not_yes:
1205 va_end (argp);
1206
1207 if (m != MATCH_YES)
1208 {
1209 /* Clean up after a failed match. */
1210 gfc_current_locus = old_loc;
1211 va_start (argp, target);
1212
1213 p = target;
1214 for (; matches > 0; matches--)
1215 {
1216 while (*p++ != '%');
1217
1218 switch (*p++)
1219 {
1220 case '%':
1221 matches++;
1222 break; /* Skip. */
1223
1224 /* Matches that don't have to be undone */
1225 case 'o':
1226 case 'l':
1227 case 'n':
1228 case 's':
1229 (void) va_arg (argp, void **);
1230 break;
1231
1232 case 'e':
1233 case 'v':
1234 vp = va_arg (argp, void **);
1235 gfc_free_expr ((struct gfc_expr *)*vp);
1236 *vp = NULL;
1237 break;
1238 }
1239 }
1240
1241 va_end (argp);
1242 }
1243
1244 return m;
1245 }
1246
1247
1248 /*********************** Statement level matching **********************/
1249
1250 /* Matches the start of a program unit, which is the program keyword
1251 followed by an obligatory symbol. */
1252
1253 match
1254 gfc_match_program (void)
1255 {
1256 gfc_symbol *sym;
1257 match m;
1258
1259 m = gfc_match ("% %s%t", &sym);
1260
1261 if (m == MATCH_NO)
1262 {
1263 gfc_error ("Invalid form of PROGRAM statement at %C");
1264 m = MATCH_ERROR;
1265 }
1266
1267 if (m == MATCH_ERROR)
1268 return m;
1269
1270 if (gfc_add_flavor (&sym->attr, FL_PROGRAM, sym->name, NULL) == FAILURE)
1271 return MATCH_ERROR;
1272
1273 gfc_new_block = sym;
1274
1275 return MATCH_YES;
1276 }
1277
1278
1279 /* Match a simple assignment statement. */
1280
1281 match
1282 gfc_match_assignment (void)
1283 {
1284 gfc_expr *lvalue, *rvalue;
1285 locus old_loc;
1286 match m;
1287
1288 old_loc = gfc_current_locus;
1289
1290 lvalue = NULL;
1291 m = gfc_match (" %v =", &lvalue);
1292 if (m != MATCH_YES)
1293 {
1294 gfc_current_locus = old_loc;
1295 gfc_free_expr (lvalue);
1296 return MATCH_NO;
1297 }
1298
1299 rvalue = NULL;
1300 m = gfc_match (" %e%t", &rvalue);
1301 if (m != MATCH_YES)
1302 {
1303 gfc_current_locus = old_loc;
1304 gfc_free_expr (lvalue);
1305 gfc_free_expr (rvalue);
1306 return m;
1307 }
1308
1309 gfc_set_sym_referenced (lvalue->symtree->n.sym);
1310
1311 new_st.op = EXEC_ASSIGN;
1312 new_st.expr1 = lvalue;
1313 new_st.expr2 = rvalue;
1314
1315 gfc_check_do_variable (lvalue->symtree);
1316
1317 return MATCH_YES;
1318 }
1319
1320
1321 /* Match a pointer assignment statement. */
1322
1323 match
1324 gfc_match_pointer_assignment (void)
1325 {
1326 gfc_expr *lvalue, *rvalue;
1327 locus old_loc;
1328 match m;
1329
1330 old_loc = gfc_current_locus;
1331
1332 lvalue = rvalue = NULL;
1333 gfc_matching_procptr_assignment = 0;
1334
1335 m = gfc_match (" %v =>", &lvalue);
1336 if (m != MATCH_YES)
1337 {
1338 m = MATCH_NO;
1339 goto cleanup;
1340 }
1341
1342 if (lvalue->symtree->n.sym->attr.proc_pointer
1343 || gfc_is_proc_ptr_comp (lvalue, NULL))
1344 gfc_matching_procptr_assignment = 1;
1345
1346 m = gfc_match (" %e%t", &rvalue);
1347 gfc_matching_procptr_assignment = 0;
1348 if (m != MATCH_YES)
1349 goto cleanup;
1350
1351 new_st.op = EXEC_POINTER_ASSIGN;
1352 new_st.expr1 = lvalue;
1353 new_st.expr2 = rvalue;
1354
1355 return MATCH_YES;
1356
1357 cleanup:
1358 gfc_current_locus = old_loc;
1359 gfc_free_expr (lvalue);
1360 gfc_free_expr (rvalue);
1361 return m;
1362 }
1363
1364
1365 /* We try to match an easy arithmetic IF statement. This only happens
1366 when just after having encountered a simple IF statement. This code
1367 is really duplicate with parts of the gfc_match_if code, but this is
1368 *much* easier. */
1369
1370 static match
1371 match_arithmetic_if (void)
1372 {
1373 gfc_st_label *l1, *l2, *l3;
1374 gfc_expr *expr;
1375 match m;
1376
1377 m = gfc_match (" ( %e ) %l , %l , %l%t", &expr, &l1, &l2, &l3);
1378 if (m != MATCH_YES)
1379 return m;
1380
1381 if (gfc_reference_st_label (l1, ST_LABEL_TARGET) == FAILURE
1382 || gfc_reference_st_label (l2, ST_LABEL_TARGET) == FAILURE
1383 || gfc_reference_st_label (l3, ST_LABEL_TARGET) == FAILURE)
1384 {
1385 gfc_free_expr (expr);
1386 return MATCH_ERROR;
1387 }
1388
1389 if (gfc_notify_std (GFC_STD_F95_OBS, "Obsolescent feature: Arithmetic IF "
1390 "statement at %C") == FAILURE)
1391 return MATCH_ERROR;
1392
1393 new_st.op = EXEC_ARITHMETIC_IF;
1394 new_st.expr1 = expr;
1395 new_st.label1 = l1;
1396 new_st.label2 = l2;
1397 new_st.label3 = l3;
1398
1399 return MATCH_YES;
1400 }
1401
1402
1403 /* The IF statement is a bit of a pain. First of all, there are three
1404 forms of it, the simple IF, the IF that starts a block and the
1405 arithmetic IF.
1406
1407 There is a problem with the simple IF and that is the fact that we
1408 only have a single level of undo information on symbols. What this
1409 means is for a simple IF, we must re-match the whole IF statement
1410 multiple times in order to guarantee that the symbol table ends up
1411 in the proper state. */
1412
1413 static match match_simple_forall (void);
1414 static match match_simple_where (void);
1415
1416 match
1417 gfc_match_if (gfc_statement *if_type)
1418 {
1419 gfc_expr *expr;
1420 gfc_st_label *l1, *l2, *l3;
1421 locus old_loc, old_loc2;
1422 gfc_code *p;
1423 match m, n;
1424
1425 n = gfc_match_label ();
1426 if (n == MATCH_ERROR)
1427 return n;
1428
1429 old_loc = gfc_current_locus;
1430
1431 m = gfc_match (" if ( %e", &expr);
1432 if (m != MATCH_YES)
1433 return m;
1434
1435 old_loc2 = gfc_current_locus;
1436 gfc_current_locus = old_loc;
1437
1438 if (gfc_match_parens () == MATCH_ERROR)
1439 return MATCH_ERROR;
1440
1441 gfc_current_locus = old_loc2;
1442
1443 if (gfc_match_char (')') != MATCH_YES)
1444 {
1445 gfc_error ("Syntax error in IF-expression at %C");
1446 gfc_free_expr (expr);
1447 return MATCH_ERROR;
1448 }
1449
1450 m = gfc_match (" %l , %l , %l%t", &l1, &l2, &l3);
1451
1452 if (m == MATCH_YES)
1453 {
1454 if (n == MATCH_YES)
1455 {
1456 gfc_error ("Block label not appropriate for arithmetic IF "
1457 "statement at %C");
1458 gfc_free_expr (expr);
1459 return MATCH_ERROR;
1460 }
1461
1462 if (gfc_reference_st_label (l1, ST_LABEL_TARGET) == FAILURE
1463 || gfc_reference_st_label (l2, ST_LABEL_TARGET) == FAILURE
1464 || gfc_reference_st_label (l3, ST_LABEL_TARGET) == FAILURE)
1465 {
1466 gfc_free_expr (expr);
1467 return MATCH_ERROR;
1468 }
1469
1470 if (gfc_notify_std (GFC_STD_F95_OBS, "Obsolescent feature: Arithmetic IF "
1471 "statement at %C") == FAILURE)
1472 return MATCH_ERROR;
1473
1474 new_st.op = EXEC_ARITHMETIC_IF;
1475 new_st.expr1 = expr;
1476 new_st.label1 = l1;
1477 new_st.label2 = l2;
1478 new_st.label3 = l3;
1479
1480 *if_type = ST_ARITHMETIC_IF;
1481 return MATCH_YES;
1482 }
1483
1484 if (gfc_match (" then%t") == MATCH_YES)
1485 {
1486 new_st.op = EXEC_IF;
1487 new_st.expr1 = expr;
1488 *if_type = ST_IF_BLOCK;
1489 return MATCH_YES;
1490 }
1491
1492 if (n == MATCH_YES)
1493 {
1494 gfc_error ("Block label is not appropriate for IF statement at %C");
1495 gfc_free_expr (expr);
1496 return MATCH_ERROR;
1497 }
1498
1499 /* At this point the only thing left is a simple IF statement. At
1500 this point, n has to be MATCH_NO, so we don't have to worry about
1501 re-matching a block label. From what we've got so far, try
1502 matching an assignment. */
1503
1504 *if_type = ST_SIMPLE_IF;
1505
1506 m = gfc_match_assignment ();
1507 if (m == MATCH_YES)
1508 goto got_match;
1509
1510 gfc_free_expr (expr);
1511 gfc_undo_symbols ();
1512 gfc_current_locus = old_loc;
1513
1514 /* m can be MATCH_NO or MATCH_ERROR, here. For MATCH_ERROR, a mangled
1515 assignment was found. For MATCH_NO, continue to call the various
1516 matchers. */
1517 if (m == MATCH_ERROR)
1518 return MATCH_ERROR;
1519
1520 gfc_match (" if ( %e ) ", &expr); /* Guaranteed to match. */
1521
1522 m = gfc_match_pointer_assignment ();
1523 if (m == MATCH_YES)
1524 goto got_match;
1525
1526 gfc_free_expr (expr);
1527 gfc_undo_symbols ();
1528 gfc_current_locus = old_loc;
1529
1530 gfc_match (" if ( %e ) ", &expr); /* Guaranteed to match. */
1531
1532 /* Look at the next keyword to see which matcher to call. Matching
1533 the keyword doesn't affect the symbol table, so we don't have to
1534 restore between tries. */
1535
1536 #define match(string, subr, statement) \
1537 if (gfc_match(string) == MATCH_YES) { m = subr(); goto got_match; }
1538
1539 gfc_clear_error ();
1540
1541 match ("allocate", gfc_match_allocate, ST_ALLOCATE)
1542 match ("assign", gfc_match_assign, ST_LABEL_ASSIGNMENT)
1543 match ("backspace", gfc_match_backspace, ST_BACKSPACE)
1544 match ("call", gfc_match_call, ST_CALL)
1545 match ("close", gfc_match_close, ST_CLOSE)
1546 match ("continue", gfc_match_continue, ST_CONTINUE)
1547 match ("cycle", gfc_match_cycle, ST_CYCLE)
1548 match ("deallocate", gfc_match_deallocate, ST_DEALLOCATE)
1549 match ("end file", gfc_match_endfile, ST_END_FILE)
1550 match ("exit", gfc_match_exit, ST_EXIT)
1551 match ("flush", gfc_match_flush, ST_FLUSH)
1552 match ("forall", match_simple_forall, ST_FORALL)
1553 match ("go to", gfc_match_goto, ST_GOTO)
1554 match ("if", match_arithmetic_if, ST_ARITHMETIC_IF)
1555 match ("inquire", gfc_match_inquire, ST_INQUIRE)
1556 match ("nullify", gfc_match_nullify, ST_NULLIFY)
1557 match ("open", gfc_match_open, ST_OPEN)
1558 match ("pause", gfc_match_pause, ST_NONE)
1559 match ("print", gfc_match_print, ST_WRITE)
1560 match ("read", gfc_match_read, ST_READ)
1561 match ("return", gfc_match_return, ST_RETURN)
1562 match ("rewind", gfc_match_rewind, ST_REWIND)
1563 match ("stop", gfc_match_stop, ST_STOP)
1564 match ("wait", gfc_match_wait, ST_WAIT)
1565 match ("where", match_simple_where, ST_WHERE)
1566 match ("write", gfc_match_write, ST_WRITE)
1567
1568 /* The gfc_match_assignment() above may have returned a MATCH_NO
1569 where the assignment was to a named constant. Check that
1570 special case here. */
1571 m = gfc_match_assignment ();
1572 if (m == MATCH_NO)
1573 {
1574 gfc_error ("Cannot assign to a named constant at %C");
1575 gfc_free_expr (expr);
1576 gfc_undo_symbols ();
1577 gfc_current_locus = old_loc;
1578 return MATCH_ERROR;
1579 }
1580
1581 /* All else has failed, so give up. See if any of the matchers has
1582 stored an error message of some sort. */
1583 if (gfc_error_check () == 0)
1584 gfc_error ("Unclassifiable statement in IF-clause at %C");
1585
1586 gfc_free_expr (expr);
1587 return MATCH_ERROR;
1588
1589 got_match:
1590 if (m == MATCH_NO)
1591 gfc_error ("Syntax error in IF-clause at %C");
1592 if (m != MATCH_YES)
1593 {
1594 gfc_free_expr (expr);
1595 return MATCH_ERROR;
1596 }
1597
1598 /* At this point, we've matched the single IF and the action clause
1599 is in new_st. Rearrange things so that the IF statement appears
1600 in new_st. */
1601
1602 p = gfc_get_code ();
1603 p->next = gfc_get_code ();
1604 *p->next = new_st;
1605 p->next->loc = gfc_current_locus;
1606
1607 p->expr1 = expr;
1608 p->op = EXEC_IF;
1609
1610 gfc_clear_new_st ();
1611
1612 new_st.op = EXEC_IF;
1613 new_st.block = p;
1614
1615 return MATCH_YES;
1616 }
1617
1618 #undef match
1619
1620
1621 /* Match an ELSE statement. */
1622
1623 match
1624 gfc_match_else (void)
1625 {
1626 char name[GFC_MAX_SYMBOL_LEN + 1];
1627
1628 if (gfc_match_eos () == MATCH_YES)
1629 return MATCH_YES;
1630
1631 if (gfc_match_name (name) != MATCH_YES
1632 || gfc_current_block () == NULL
1633 || gfc_match_eos () != MATCH_YES)
1634 {
1635 gfc_error ("Unexpected junk after ELSE statement at %C");
1636 return MATCH_ERROR;
1637 }
1638
1639 if (strcmp (name, gfc_current_block ()->name) != 0)
1640 {
1641 gfc_error ("Label '%s' at %C doesn't match IF label '%s'",
1642 name, gfc_current_block ()->name);
1643 return MATCH_ERROR;
1644 }
1645
1646 return MATCH_YES;
1647 }
1648
1649
1650 /* Match an ELSE IF statement. */
1651
1652 match
1653 gfc_match_elseif (void)
1654 {
1655 char name[GFC_MAX_SYMBOL_LEN + 1];
1656 gfc_expr *expr;
1657 match m;
1658
1659 m = gfc_match (" ( %e ) then", &expr);
1660 if (m != MATCH_YES)
1661 return m;
1662
1663 if (gfc_match_eos () == MATCH_YES)
1664 goto done;
1665
1666 if (gfc_match_name (name) != MATCH_YES
1667 || gfc_current_block () == NULL
1668 || gfc_match_eos () != MATCH_YES)
1669 {
1670 gfc_error ("Unexpected junk after ELSE IF statement at %C");
1671 goto cleanup;
1672 }
1673
1674 if (strcmp (name, gfc_current_block ()->name) != 0)
1675 {
1676 gfc_error ("Label '%s' at %C doesn't match IF label '%s'",
1677 name, gfc_current_block ()->name);
1678 goto cleanup;
1679 }
1680
1681 done:
1682 new_st.op = EXEC_IF;
1683 new_st.expr1 = expr;
1684 return MATCH_YES;
1685
1686 cleanup:
1687 gfc_free_expr (expr);
1688 return MATCH_ERROR;
1689 }
1690
1691
1692 /* Free a gfc_iterator structure. */
1693
1694 void
1695 gfc_free_iterator (gfc_iterator *iter, int flag)
1696 {
1697
1698 if (iter == NULL)
1699 return;
1700
1701 gfc_free_expr (iter->var);
1702 gfc_free_expr (iter->start);
1703 gfc_free_expr (iter->end);
1704 gfc_free_expr (iter->step);
1705
1706 if (flag)
1707 gfc_free (iter);
1708 }
1709
1710
1711 /* Match a BLOCK statement. */
1712
1713 match
1714 gfc_match_block (void)
1715 {
1716 match m;
1717
1718 if (gfc_match_label () == MATCH_ERROR)
1719 return MATCH_ERROR;
1720
1721 if (gfc_match (" block") != MATCH_YES)
1722 return MATCH_NO;
1723
1724 /* For this to be a correct BLOCK statement, the line must end now. */
1725 m = gfc_match_eos ();
1726 if (m == MATCH_ERROR)
1727 return MATCH_ERROR;
1728 if (m == MATCH_NO)
1729 return MATCH_NO;
1730
1731 return MATCH_YES;
1732 }
1733
1734
1735 /* Match a DO statement. */
1736
1737 match
1738 gfc_match_do (void)
1739 {
1740 gfc_iterator iter, *ip;
1741 locus old_loc;
1742 gfc_st_label *label;
1743 match m;
1744
1745 old_loc = gfc_current_locus;
1746
1747 label = NULL;
1748 iter.var = iter.start = iter.end = iter.step = NULL;
1749
1750 m = gfc_match_label ();
1751 if (m == MATCH_ERROR)
1752 return m;
1753
1754 if (gfc_match (" do") != MATCH_YES)
1755 return MATCH_NO;
1756
1757 m = gfc_match_st_label (&label);
1758 if (m == MATCH_ERROR)
1759 goto cleanup;
1760
1761 /* Match an infinite DO, make it like a DO WHILE(.TRUE.). */
1762
1763 if (gfc_match_eos () == MATCH_YES)
1764 {
1765 iter.end = gfc_logical_expr (1, NULL);
1766 new_st.op = EXEC_DO_WHILE;
1767 goto done;
1768 }
1769
1770 /* Match an optional comma, if no comma is found, a space is obligatory. */
1771 if (gfc_match_char (',') != MATCH_YES && gfc_match ("% ") != MATCH_YES)
1772 return MATCH_NO;
1773
1774 /* Check for balanced parens. */
1775
1776 if (gfc_match_parens () == MATCH_ERROR)
1777 return MATCH_ERROR;
1778
1779 /* See if we have a DO WHILE. */
1780 if (gfc_match (" while ( %e )%t", &iter.end) == MATCH_YES)
1781 {
1782 new_st.op = EXEC_DO_WHILE;
1783 goto done;
1784 }
1785
1786 /* The abortive DO WHILE may have done something to the symbol
1787 table, so we start over. */
1788 gfc_undo_symbols ();
1789 gfc_current_locus = old_loc;
1790
1791 gfc_match_label (); /* This won't error. */
1792 gfc_match (" do "); /* This will work. */
1793
1794 gfc_match_st_label (&label); /* Can't error out. */
1795 gfc_match_char (','); /* Optional comma. */
1796
1797 m = gfc_match_iterator (&iter, 0);
1798 if (m == MATCH_NO)
1799 return MATCH_NO;
1800 if (m == MATCH_ERROR)
1801 goto cleanup;
1802
1803 iter.var->symtree->n.sym->attr.implied_index = 0;
1804 gfc_check_do_variable (iter.var->symtree);
1805
1806 if (gfc_match_eos () != MATCH_YES)
1807 {
1808 gfc_syntax_error (ST_DO);
1809 goto cleanup;
1810 }
1811
1812 new_st.op = EXEC_DO;
1813
1814 done:
1815 if (label != NULL
1816 && gfc_reference_st_label (label, ST_LABEL_TARGET) == FAILURE)
1817 goto cleanup;
1818
1819 new_st.label1 = label;
1820
1821 if (new_st.op == EXEC_DO_WHILE)
1822 new_st.expr1 = iter.end;
1823 else
1824 {
1825 new_st.ext.iterator = ip = gfc_get_iterator ();
1826 *ip = iter;
1827 }
1828
1829 return MATCH_YES;
1830
1831 cleanup:
1832 gfc_free_iterator (&iter, 0);
1833
1834 return MATCH_ERROR;
1835 }
1836
1837
1838 /* Match an EXIT or CYCLE statement. */
1839
1840 static match
1841 match_exit_cycle (gfc_statement st, gfc_exec_op op)
1842 {
1843 gfc_state_data *p, *o;
1844 gfc_symbol *sym;
1845 match m;
1846
1847 if (gfc_match_eos () == MATCH_YES)
1848 sym = NULL;
1849 else
1850 {
1851 m = gfc_match ("% %s%t", &sym);
1852 if (m == MATCH_ERROR)
1853 return MATCH_ERROR;
1854 if (m == MATCH_NO)
1855 {
1856 gfc_syntax_error (st);
1857 return MATCH_ERROR;
1858 }
1859
1860 if (sym->attr.flavor != FL_LABEL)
1861 {
1862 gfc_error ("Name '%s' in %s statement at %C is not a loop name",
1863 sym->name, gfc_ascii_statement (st));
1864 return MATCH_ERROR;
1865 }
1866 }
1867
1868 /* Find the loop mentioned specified by the label (or lack of a label). */
1869 for (o = NULL, p = gfc_state_stack; p; p = p->previous)
1870 if (p->state == COMP_DO && (sym == NULL || sym == p->sym))
1871 break;
1872 else if (o == NULL && p->state == COMP_OMP_STRUCTURED_BLOCK)
1873 o = p;
1874
1875 if (p == NULL)
1876 {
1877 if (sym == NULL)
1878 gfc_error ("%s statement at %C is not within a loop",
1879 gfc_ascii_statement (st));
1880 else
1881 gfc_error ("%s statement at %C is not within loop '%s'",
1882 gfc_ascii_statement (st), sym->name);
1883
1884 return MATCH_ERROR;
1885 }
1886
1887 if (o != NULL)
1888 {
1889 gfc_error ("%s statement at %C leaving OpenMP structured block",
1890 gfc_ascii_statement (st));
1891 return MATCH_ERROR;
1892 }
1893 else if (st == ST_EXIT
1894 && p->previous != NULL
1895 && p->previous->state == COMP_OMP_STRUCTURED_BLOCK
1896 && (p->previous->head->op == EXEC_OMP_DO
1897 || p->previous->head->op == EXEC_OMP_PARALLEL_DO))
1898 {
1899 gcc_assert (p->previous->head->next != NULL);
1900 gcc_assert (p->previous->head->next->op == EXEC_DO
1901 || p->previous->head->next->op == EXEC_DO_WHILE);
1902 gfc_error ("EXIT statement at %C terminating !$OMP DO loop");
1903 return MATCH_ERROR;
1904 }
1905
1906 /* Save the first statement in the loop - needed by the backend. */
1907 new_st.ext.whichloop = p->head;
1908
1909 new_st.op = op;
1910
1911 return MATCH_YES;
1912 }
1913
1914
1915 /* Match the EXIT statement. */
1916
1917 match
1918 gfc_match_exit (void)
1919 {
1920 return match_exit_cycle (ST_EXIT, EXEC_EXIT);
1921 }
1922
1923
1924 /* Match the CYCLE statement. */
1925
1926 match
1927 gfc_match_cycle (void)
1928 {
1929 return match_exit_cycle (ST_CYCLE, EXEC_CYCLE);
1930 }
1931
1932
1933 /* Match a number or character constant after a STOP or PAUSE statement. */
1934
1935 static match
1936 gfc_match_stopcode (gfc_statement st)
1937 {
1938 int stop_code;
1939 gfc_expr *e;
1940 match m;
1941 int cnt;
1942
1943 stop_code = -1;
1944 e = NULL;
1945
1946 if (gfc_match_eos () != MATCH_YES)
1947 {
1948 m = gfc_match_small_literal_int (&stop_code, &cnt);
1949 if (m == MATCH_ERROR)
1950 goto cleanup;
1951
1952 if (m == MATCH_YES && cnt > 5)
1953 {
1954 gfc_error ("Too many digits in STOP code at %C");
1955 goto cleanup;
1956 }
1957
1958 if (m == MATCH_NO)
1959 {
1960 /* Try a character constant. */
1961 m = gfc_match_expr (&e);
1962 if (m == MATCH_ERROR)
1963 goto cleanup;
1964 if (m == MATCH_NO)
1965 goto syntax;
1966 if (e->ts.type != BT_CHARACTER || e->expr_type != EXPR_CONSTANT)
1967 goto syntax;
1968 }
1969
1970 if (gfc_match_eos () != MATCH_YES)
1971 goto syntax;
1972 }
1973
1974 if (gfc_pure (NULL))
1975 {
1976 gfc_error ("%s statement not allowed in PURE procedure at %C",
1977 gfc_ascii_statement (st));
1978 goto cleanup;
1979 }
1980
1981 new_st.op = st == ST_STOP ? EXEC_STOP : EXEC_PAUSE;
1982 new_st.expr1 = e;
1983 new_st.ext.stop_code = stop_code;
1984
1985 return MATCH_YES;
1986
1987 syntax:
1988 gfc_syntax_error (st);
1989
1990 cleanup:
1991
1992 gfc_free_expr (e);
1993 return MATCH_ERROR;
1994 }
1995
1996
1997 /* Match the (deprecated) PAUSE statement. */
1998
1999 match
2000 gfc_match_pause (void)
2001 {
2002 match m;
2003
2004 m = gfc_match_stopcode (ST_PAUSE);
2005 if (m == MATCH_YES)
2006 {
2007 if (gfc_notify_std (GFC_STD_F95_DEL, "Deleted feature: PAUSE statement"
2008 " at %C")
2009 == FAILURE)
2010 m = MATCH_ERROR;
2011 }
2012 return m;
2013 }
2014
2015
2016 /* Match the STOP statement. */
2017
2018 match
2019 gfc_match_stop (void)
2020 {
2021 return gfc_match_stopcode (ST_STOP);
2022 }
2023
2024
2025 /* Match a CONTINUE statement. */
2026
2027 match
2028 gfc_match_continue (void)
2029 {
2030 if (gfc_match_eos () != MATCH_YES)
2031 {
2032 gfc_syntax_error (ST_CONTINUE);
2033 return MATCH_ERROR;
2034 }
2035
2036 new_st.op = EXEC_CONTINUE;
2037 return MATCH_YES;
2038 }
2039
2040
2041 /* Match the (deprecated) ASSIGN statement. */
2042
2043 match
2044 gfc_match_assign (void)
2045 {
2046 gfc_expr *expr;
2047 gfc_st_label *label;
2048
2049 if (gfc_match (" %l", &label) == MATCH_YES)
2050 {
2051 if (gfc_reference_st_label (label, ST_LABEL_UNKNOWN) == FAILURE)
2052 return MATCH_ERROR;
2053 if (gfc_match (" to %v%t", &expr) == MATCH_YES)
2054 {
2055 if (gfc_notify_std (GFC_STD_F95_DEL, "Deleted feature: ASSIGN "
2056 "statement at %C")
2057 == FAILURE)
2058 return MATCH_ERROR;
2059
2060 expr->symtree->n.sym->attr.assign = 1;
2061
2062 new_st.op = EXEC_LABEL_ASSIGN;
2063 new_st.label1 = label;
2064 new_st.expr1 = expr;
2065 return MATCH_YES;
2066 }
2067 }
2068 return MATCH_NO;
2069 }
2070
2071
2072 /* Match the GO TO statement. As a computed GOTO statement is
2073 matched, it is transformed into an equivalent SELECT block. No
2074 tree is necessary, and the resulting jumps-to-jumps are
2075 specifically optimized away by the back end. */
2076
2077 match
2078 gfc_match_goto (void)
2079 {
2080 gfc_code *head, *tail;
2081 gfc_expr *expr;
2082 gfc_case *cp;
2083 gfc_st_label *label;
2084 int i;
2085 match m;
2086
2087 if (gfc_match (" %l%t", &label) == MATCH_YES)
2088 {
2089 if (gfc_reference_st_label (label, ST_LABEL_TARGET) == FAILURE)
2090 return MATCH_ERROR;
2091
2092 new_st.op = EXEC_GOTO;
2093 new_st.label1 = label;
2094 return MATCH_YES;
2095 }
2096
2097 /* The assigned GO TO statement. */
2098
2099 if (gfc_match_variable (&expr, 0) == MATCH_YES)
2100 {
2101 if (gfc_notify_std (GFC_STD_F95_DEL, "Deleted feature: Assigned GOTO "
2102 "statement at %C")
2103 == FAILURE)
2104 return MATCH_ERROR;
2105
2106 new_st.op = EXEC_GOTO;
2107 new_st.expr1 = expr;
2108
2109 if (gfc_match_eos () == MATCH_YES)
2110 return MATCH_YES;
2111
2112 /* Match label list. */
2113 gfc_match_char (',');
2114 if (gfc_match_char ('(') != MATCH_YES)
2115 {
2116 gfc_syntax_error (ST_GOTO);
2117 return MATCH_ERROR;
2118 }
2119 head = tail = NULL;
2120
2121 do
2122 {
2123 m = gfc_match_st_label (&label);
2124 if (m != MATCH_YES)
2125 goto syntax;
2126
2127 if (gfc_reference_st_label (label, ST_LABEL_TARGET) == FAILURE)
2128 goto cleanup;
2129
2130 if (head == NULL)
2131 head = tail = gfc_get_code ();
2132 else
2133 {
2134 tail->block = gfc_get_code ();
2135 tail = tail->block;
2136 }
2137
2138 tail->label1 = label;
2139 tail->op = EXEC_GOTO;
2140 }
2141 while (gfc_match_char (',') == MATCH_YES);
2142
2143 if (gfc_match (")%t") != MATCH_YES)
2144 goto syntax;
2145
2146 if (head == NULL)
2147 {
2148 gfc_error ("Statement label list in GOTO at %C cannot be empty");
2149 goto syntax;
2150 }
2151 new_st.block = head;
2152
2153 return MATCH_YES;
2154 }
2155
2156 /* Last chance is a computed GO TO statement. */
2157 if (gfc_match_char ('(') != MATCH_YES)
2158 {
2159 gfc_syntax_error (ST_GOTO);
2160 return MATCH_ERROR;
2161 }
2162
2163 head = tail = NULL;
2164 i = 1;
2165
2166 do
2167 {
2168 m = gfc_match_st_label (&label);
2169 if (m != MATCH_YES)
2170 goto syntax;
2171
2172 if (gfc_reference_st_label (label, ST_LABEL_TARGET) == FAILURE)
2173 goto cleanup;
2174
2175 if (head == NULL)
2176 head = tail = gfc_get_code ();
2177 else
2178 {
2179 tail->block = gfc_get_code ();
2180 tail = tail->block;
2181 }
2182
2183 cp = gfc_get_case ();
2184 cp->low = cp->high = gfc_int_expr (i++);
2185
2186 tail->op = EXEC_SELECT;
2187 tail->ext.case_list = cp;
2188
2189 tail->next = gfc_get_code ();
2190 tail->next->op = EXEC_GOTO;
2191 tail->next->label1 = label;
2192 }
2193 while (gfc_match_char (',') == MATCH_YES);
2194
2195 if (gfc_match_char (')') != MATCH_YES)
2196 goto syntax;
2197
2198 if (head == NULL)
2199 {
2200 gfc_error ("Statement label list in GOTO at %C cannot be empty");
2201 goto syntax;
2202 }
2203
2204 /* Get the rest of the statement. */
2205 gfc_match_char (',');
2206
2207 if (gfc_match (" %e%t", &expr) != MATCH_YES)
2208 goto syntax;
2209
2210 if (gfc_notify_std (GFC_STD_F95_OBS, "Obsolescent feature: Computed GOTO "
2211 "at %C") == FAILURE)
2212 return MATCH_ERROR;
2213
2214 /* At this point, a computed GOTO has been fully matched and an
2215 equivalent SELECT statement constructed. */
2216
2217 new_st.op = EXEC_SELECT;
2218 new_st.expr1 = NULL;
2219
2220 /* Hack: For a "real" SELECT, the expression is in expr. We put
2221 it in expr2 so we can distinguish then and produce the correct
2222 diagnostics. */
2223 new_st.expr2 = expr;
2224 new_st.block = head;
2225 return MATCH_YES;
2226
2227 syntax:
2228 gfc_syntax_error (ST_GOTO);
2229 cleanup:
2230 gfc_free_statements (head);
2231 return MATCH_ERROR;
2232 }
2233
2234
2235 /* Frees a list of gfc_alloc structures. */
2236
2237 void
2238 gfc_free_alloc_list (gfc_alloc *p)
2239 {
2240 gfc_alloc *q;
2241
2242 for (; p; p = q)
2243 {
2244 q = p->next;
2245 gfc_free_expr (p->expr);
2246 gfc_free (p);
2247 }
2248 }
2249
2250
2251 /* Match a Fortran 2003 derived-type-spec (F03:R455), which is just the name of
2252 an accessible derived type. */
2253
2254 static match
2255 match_derived_type_spec (gfc_typespec *ts)
2256 {
2257 locus old_locus;
2258 gfc_symbol *derived;
2259
2260 old_locus = gfc_current_locus;
2261
2262 if (gfc_match_symbol (&derived, 1) == MATCH_YES)
2263 {
2264 if (derived->attr.flavor == FL_DERIVED)
2265 {
2266 ts->type = BT_DERIVED;
2267 ts->u.derived = derived;
2268 return MATCH_YES;
2269 }
2270 else
2271 {
2272 /* Enforce F03:C476. */
2273 gfc_error ("'%s' at %L is not an accessible derived type",
2274 derived->name, &gfc_current_locus);
2275 return MATCH_ERROR;
2276 }
2277 }
2278
2279 gfc_current_locus = old_locus;
2280 return MATCH_NO;
2281 }
2282
2283
2284 /* Match a Fortran 2003 type-spec (F03:R401). This is similar to
2285 gfc_match_decl_type_spec() from decl.c, with the following exceptions:
2286 It only includes the intrinsic types from the Fortran 2003 standard
2287 (thus, neither BYTE nor forms like REAL*4 are allowed). Additionally,
2288 the implicit_flag is not needed, so it was removed. Derived types are
2289 identified by their name alone. */
2290
2291 static match
2292 match_type_spec (gfc_typespec *ts)
2293 {
2294 match m;
2295 locus old_locus;
2296
2297 gfc_clear_ts (ts);
2298 old_locus = gfc_current_locus;
2299
2300 if (gfc_match ("integer") == MATCH_YES)
2301 {
2302 ts->type = BT_INTEGER;
2303 ts->kind = gfc_default_integer_kind;
2304 goto kind_selector;
2305 }
2306
2307 if (gfc_match ("real") == MATCH_YES)
2308 {
2309 ts->type = BT_REAL;
2310 ts->kind = gfc_default_real_kind;
2311 goto kind_selector;
2312 }
2313
2314 if (gfc_match ("double precision") == MATCH_YES)
2315 {
2316 ts->type = BT_REAL;
2317 ts->kind = gfc_default_double_kind;
2318 return MATCH_YES;
2319 }
2320
2321 if (gfc_match ("complex") == MATCH_YES)
2322 {
2323 ts->type = BT_COMPLEX;
2324 ts->kind = gfc_default_complex_kind;
2325 goto kind_selector;
2326 }
2327
2328 if (gfc_match ("character") == MATCH_YES)
2329 {
2330 ts->type = BT_CHARACTER;
2331 goto char_selector;
2332 }
2333
2334 if (gfc_match ("logical") == MATCH_YES)
2335 {
2336 ts->type = BT_LOGICAL;
2337 ts->kind = gfc_default_logical_kind;
2338 goto kind_selector;
2339 }
2340
2341 m = match_derived_type_spec (ts);
2342 if (m == MATCH_YES)
2343 {
2344 old_locus = gfc_current_locus;
2345 if (gfc_match (" :: ") != MATCH_YES)
2346 return MATCH_ERROR;
2347 gfc_current_locus = old_locus;
2348 /* Enfore F03:C401. */
2349 if (ts->u.derived->attr.abstract)
2350 {
2351 gfc_error ("Derived type '%s' at %L may not be ABSTRACT",
2352 ts->u.derived->name, &old_locus);
2353 return MATCH_ERROR;
2354 }
2355 return MATCH_YES;
2356 }
2357 else if (m == MATCH_ERROR && gfc_match (" :: ") == MATCH_YES)
2358 return MATCH_ERROR;
2359
2360 /* If a type is not matched, simply return MATCH_NO. */
2361 gfc_current_locus = old_locus;
2362 return MATCH_NO;
2363
2364 kind_selector:
2365
2366 gfc_gobble_whitespace ();
2367 if (gfc_peek_ascii_char () == '*')
2368 {
2369 gfc_error ("Invalid type-spec at %C");
2370 return MATCH_ERROR;
2371 }
2372
2373 m = gfc_match_kind_spec (ts, false);
2374
2375 if (m == MATCH_NO)
2376 m = MATCH_YES; /* No kind specifier found. */
2377
2378 return m;
2379
2380 char_selector:
2381
2382 m = gfc_match_char_spec (ts);
2383
2384 if (m == MATCH_NO)
2385 m = MATCH_YES; /* No kind specifier found. */
2386
2387 return m;
2388 }
2389
2390
2391 /* Match an ALLOCATE statement. */
2392
2393 match
2394 gfc_match_allocate (void)
2395 {
2396 gfc_alloc *head, *tail;
2397 gfc_expr *stat, *errmsg, *tmp, *source;
2398 gfc_typespec ts;
2399 gfc_symbol *sym;
2400 match m;
2401 locus old_locus;
2402 bool saw_stat, saw_errmsg, saw_source, b1, b2, b3;
2403
2404 head = tail = NULL;
2405 stat = errmsg = source = tmp = NULL;
2406 saw_stat = saw_errmsg = saw_source = false;
2407
2408 if (gfc_match_char ('(') != MATCH_YES)
2409 goto syntax;
2410
2411 /* Match an optional type-spec. */
2412 old_locus = gfc_current_locus;
2413 m = match_type_spec (&ts);
2414 if (m == MATCH_ERROR)
2415 goto cleanup;
2416 else if (m == MATCH_NO)
2417 ts.type = BT_UNKNOWN;
2418 else
2419 {
2420 if (gfc_match (" :: ") == MATCH_YES)
2421 {
2422 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: typespec in "
2423 "ALLOCATE at %L", &old_locus) == FAILURE)
2424 goto cleanup;
2425 }
2426 else
2427 {
2428 ts.type = BT_UNKNOWN;
2429 gfc_current_locus = old_locus;
2430 }
2431 }
2432
2433 for (;;)
2434 {
2435 if (head == NULL)
2436 head = tail = gfc_get_alloc ();
2437 else
2438 {
2439 tail->next = gfc_get_alloc ();
2440 tail = tail->next;
2441 }
2442
2443 m = gfc_match_variable (&tail->expr, 0);
2444 if (m == MATCH_NO)
2445 goto syntax;
2446 if (m == MATCH_ERROR)
2447 goto cleanup;
2448
2449 if (gfc_check_do_variable (tail->expr->symtree))
2450 goto cleanup;
2451
2452 if (gfc_pure (NULL) && gfc_impure_variable (tail->expr->symtree->n.sym))
2453 {
2454 gfc_error ("Bad allocate-object at %C for a PURE procedure");
2455 goto cleanup;
2456 }
2457
2458 /* The ALLOCATE statement had an optional typespec. Check the
2459 constraints. */
2460 if (ts.type != BT_UNKNOWN)
2461 {
2462 /* Enforce F03:C624. */
2463 if (!gfc_type_compatible (&tail->expr->ts, &ts))
2464 {
2465 gfc_error ("Type of entity at %L is type incompatible with "
2466 "typespec", &tail->expr->where);
2467 goto cleanup;
2468 }
2469
2470 /* Enforce F03:C627. */
2471 if (ts.kind != tail->expr->ts.kind)
2472 {
2473 gfc_error ("Kind type parameter for entity at %L differs from "
2474 "the kind type parameter of the typespec",
2475 &tail->expr->where);
2476 goto cleanup;
2477 }
2478 }
2479
2480 if (tail->expr->ts.type == BT_DERIVED)
2481 tail->expr->ts.u.derived = gfc_use_derived (tail->expr->ts.u.derived);
2482
2483 /* FIXME: disable the checking on derived types and arrays. */
2484 sym = tail->expr->symtree->n.sym;
2485 b1 = !(tail->expr->ref
2486 && (tail->expr->ref->type == REF_COMPONENT
2487 || tail->expr->ref->type == REF_ARRAY));
2488 if (sym && sym->ts.type == BT_CLASS)
2489 b2 = !(sym->ts.u.derived->components->attr.allocatable
2490 || sym->ts.u.derived->components->attr.pointer);
2491 else
2492 b2 = sym && !(sym->attr.allocatable || sym->attr.pointer
2493 || sym->attr.proc_pointer);
2494 b3 = sym && sym->ns && sym->ns->proc_name
2495 && (sym->ns->proc_name->attr.allocatable
2496 || sym->ns->proc_name->attr.pointer
2497 || sym->ns->proc_name->attr.proc_pointer);
2498 if (b1 && b2 && !b3)
2499 {
2500 gfc_error ("Allocate-object at %C is not a nonprocedure pointer "
2501 "or an allocatable variable");
2502 goto cleanup;
2503 }
2504
2505 if (gfc_peek_ascii_char () == '(' && !sym->attr.dimension)
2506 {
2507 gfc_error ("Shape specification for allocatable scalar at %C");
2508 goto cleanup;
2509 }
2510
2511 if (gfc_match_char (',') != MATCH_YES)
2512 break;
2513
2514 alloc_opt_list:
2515
2516 m = gfc_match (" stat = %v", &tmp);
2517 if (m == MATCH_ERROR)
2518 goto cleanup;
2519 if (m == MATCH_YES)
2520 {
2521 /* Enforce C630. */
2522 if (saw_stat)
2523 {
2524 gfc_error ("Redundant STAT tag found at %L ", &tmp->where);
2525 goto cleanup;
2526 }
2527
2528 stat = tmp;
2529 saw_stat = true;
2530
2531 if (gfc_check_do_variable (stat->symtree))
2532 goto cleanup;
2533
2534 if (gfc_match_char (',') == MATCH_YES)
2535 goto alloc_opt_list;
2536 }
2537
2538 m = gfc_match (" errmsg = %v", &tmp);
2539 if (m == MATCH_ERROR)
2540 goto cleanup;
2541 if (m == MATCH_YES)
2542 {
2543 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: ERRMSG tag at %L",
2544 &tmp->where) == FAILURE)
2545 goto cleanup;
2546
2547 /* Enforce C630. */
2548 if (saw_errmsg)
2549 {
2550 gfc_error ("Redundant ERRMSG tag found at %L ", &tmp->where);
2551 goto cleanup;
2552 }
2553
2554 errmsg = tmp;
2555 saw_errmsg = true;
2556
2557 if (gfc_match_char (',') == MATCH_YES)
2558 goto alloc_opt_list;
2559 }
2560
2561 m = gfc_match (" source = %e", &tmp);
2562 if (m == MATCH_ERROR)
2563 goto cleanup;
2564 if (m == MATCH_YES)
2565 {
2566 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: SOURCE tag at %L",
2567 &tmp->where) == FAILURE)
2568 goto cleanup;
2569
2570 /* Enforce C630. */
2571 if (saw_source)
2572 {
2573 gfc_error ("Redundant SOURCE tag found at %L ", &tmp->where);
2574 goto cleanup;
2575 }
2576
2577 /* The next 2 conditionals check C631. */
2578 if (ts.type != BT_UNKNOWN)
2579 {
2580 gfc_error ("SOURCE tag at %L conflicts with the typespec at %L",
2581 &tmp->where, &old_locus);
2582 goto cleanup;
2583 }
2584
2585 if (head->next)
2586 {
2587 gfc_error ("SOURCE tag at %L requires only a single entity in "
2588 "the allocation-list", &tmp->where);
2589 goto cleanup;
2590 }
2591
2592 source = tmp;
2593 saw_source = true;
2594
2595 if (gfc_match_char (',') == MATCH_YES)
2596 goto alloc_opt_list;
2597 }
2598
2599 gfc_gobble_whitespace ();
2600
2601 if (gfc_peek_char () == ')')
2602 break;
2603 }
2604
2605
2606 if (gfc_match (" )%t") != MATCH_YES)
2607 goto syntax;
2608
2609 new_st.op = EXEC_ALLOCATE;
2610 new_st.expr1 = stat;
2611 new_st.expr2 = errmsg;
2612 new_st.expr3 = source;
2613 new_st.ext.alloc.list = head;
2614 new_st.ext.alloc.ts = ts;
2615
2616 return MATCH_YES;
2617
2618 syntax:
2619 gfc_syntax_error (ST_ALLOCATE);
2620
2621 cleanup:
2622 gfc_free_expr (errmsg);
2623 gfc_free_expr (source);
2624 gfc_free_expr (stat);
2625 gfc_free_expr (tmp);
2626 gfc_free_alloc_list (head);
2627 return MATCH_ERROR;
2628 }
2629
2630
2631 /* Match a NULLIFY statement. A NULLIFY statement is transformed into
2632 a set of pointer assignments to intrinsic NULL(). */
2633
2634 match
2635 gfc_match_nullify (void)
2636 {
2637 gfc_code *tail;
2638 gfc_expr *e, *p;
2639 match m;
2640
2641 tail = NULL;
2642
2643 if (gfc_match_char ('(') != MATCH_YES)
2644 goto syntax;
2645
2646 for (;;)
2647 {
2648 m = gfc_match_variable (&p, 0);
2649 if (m == MATCH_ERROR)
2650 goto cleanup;
2651 if (m == MATCH_NO)
2652 goto syntax;
2653
2654 if (gfc_check_do_variable (p->symtree))
2655 goto cleanup;
2656
2657 if (gfc_pure (NULL) && gfc_impure_variable (p->symtree->n.sym))
2658 {
2659 gfc_error ("Illegal variable in NULLIFY at %C for a PURE procedure");
2660 goto cleanup;
2661 }
2662
2663 /* build ' => NULL() '. */
2664 e = gfc_get_expr ();
2665 e->where = gfc_current_locus;
2666 e->expr_type = EXPR_NULL;
2667 e->ts.type = BT_UNKNOWN;
2668
2669 /* Chain to list. */
2670 if (tail == NULL)
2671 tail = &new_st;
2672 else
2673 {
2674 tail->next = gfc_get_code ();
2675 tail = tail->next;
2676 }
2677
2678 tail->op = EXEC_POINTER_ASSIGN;
2679 tail->expr1 = p;
2680 tail->expr2 = e;
2681
2682 if (gfc_match (" )%t") == MATCH_YES)
2683 break;
2684 if (gfc_match_char (',') != MATCH_YES)
2685 goto syntax;
2686 }
2687
2688 return MATCH_YES;
2689
2690 syntax:
2691 gfc_syntax_error (ST_NULLIFY);
2692
2693 cleanup:
2694 gfc_free_statements (new_st.next);
2695 new_st.next = NULL;
2696 gfc_free_expr (new_st.expr1);
2697 new_st.expr1 = NULL;
2698 gfc_free_expr (new_st.expr2);
2699 new_st.expr2 = NULL;
2700 return MATCH_ERROR;
2701 }
2702
2703
2704 /* Match a DEALLOCATE statement. */
2705
2706 match
2707 gfc_match_deallocate (void)
2708 {
2709 gfc_alloc *head, *tail;
2710 gfc_expr *stat, *errmsg, *tmp;
2711 gfc_symbol *sym;
2712 match m;
2713 bool saw_stat, saw_errmsg, b1, b2;
2714
2715 head = tail = NULL;
2716 stat = errmsg = tmp = NULL;
2717 saw_stat = saw_errmsg = false;
2718
2719 if (gfc_match_char ('(') != MATCH_YES)
2720 goto syntax;
2721
2722 for (;;)
2723 {
2724 if (head == NULL)
2725 head = tail = gfc_get_alloc ();
2726 else
2727 {
2728 tail->next = gfc_get_alloc ();
2729 tail = tail->next;
2730 }
2731
2732 m = gfc_match_variable (&tail->expr, 0);
2733 if (m == MATCH_ERROR)
2734 goto cleanup;
2735 if (m == MATCH_NO)
2736 goto syntax;
2737
2738 if (gfc_check_do_variable (tail->expr->symtree))
2739 goto cleanup;
2740
2741 sym = tail->expr->symtree->n.sym;
2742
2743 if (gfc_pure (NULL) && gfc_impure_variable (sym))
2744 {
2745 gfc_error ("Illegal allocate-object at %C for a PURE procedure");
2746 goto cleanup;
2747 }
2748
2749 /* FIXME: disable the checking on derived types. */
2750 b1 = !(tail->expr->ref
2751 && (tail->expr->ref->type == REF_COMPONENT
2752 || tail->expr->ref->type == REF_ARRAY));
2753 if (sym && sym->ts.type == BT_CLASS)
2754 b2 = !(sym->ts.u.derived->components->attr.allocatable
2755 || sym->ts.u.derived->components->attr.pointer);
2756 else
2757 b2 = sym && !(sym->attr.allocatable || sym->attr.pointer
2758 || sym->attr.proc_pointer);
2759 if (b1 && b2)
2760 {
2761 gfc_error ("Allocate-object at %C is not a nonprocedure pointer "
2762 "or an allocatable variable");
2763 goto cleanup;
2764 }
2765
2766 if (gfc_match_char (',') != MATCH_YES)
2767 break;
2768
2769 dealloc_opt_list:
2770
2771 m = gfc_match (" stat = %v", &tmp);
2772 if (m == MATCH_ERROR)
2773 goto cleanup;
2774 if (m == MATCH_YES)
2775 {
2776 if (saw_stat)
2777 {
2778 gfc_error ("Redundant STAT tag found at %L ", &tmp->where);
2779 gfc_free_expr (tmp);
2780 goto cleanup;
2781 }
2782
2783 stat = tmp;
2784 saw_stat = true;
2785
2786 if (gfc_check_do_variable (stat->symtree))
2787 goto cleanup;
2788
2789 if (gfc_match_char (',') == MATCH_YES)
2790 goto dealloc_opt_list;
2791 }
2792
2793 m = gfc_match (" errmsg = %v", &tmp);
2794 if (m == MATCH_ERROR)
2795 goto cleanup;
2796 if (m == MATCH_YES)
2797 {
2798 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: ERRMSG at %L",
2799 &tmp->where) == FAILURE)
2800 goto cleanup;
2801
2802 if (saw_errmsg)
2803 {
2804 gfc_error ("Redundant ERRMSG tag found at %L ", &tmp->where);
2805 gfc_free_expr (tmp);
2806 goto cleanup;
2807 }
2808
2809 errmsg = tmp;
2810 saw_errmsg = true;
2811
2812 if (gfc_match_char (',') == MATCH_YES)
2813 goto dealloc_opt_list;
2814 }
2815
2816 gfc_gobble_whitespace ();
2817
2818 if (gfc_peek_char () == ')')
2819 break;
2820 }
2821
2822 if (gfc_match (" )%t") != MATCH_YES)
2823 goto syntax;
2824
2825 new_st.op = EXEC_DEALLOCATE;
2826 new_st.expr1 = stat;
2827 new_st.expr2 = errmsg;
2828 new_st.ext.alloc.list = head;
2829
2830 return MATCH_YES;
2831
2832 syntax:
2833 gfc_syntax_error (ST_DEALLOCATE);
2834
2835 cleanup:
2836 gfc_free_expr (errmsg);
2837 gfc_free_expr (stat);
2838 gfc_free_alloc_list (head);
2839 return MATCH_ERROR;
2840 }
2841
2842
2843 /* Match a RETURN statement. */
2844
2845 match
2846 gfc_match_return (void)
2847 {
2848 gfc_expr *e;
2849 match m;
2850 gfc_compile_state s;
2851
2852 e = NULL;
2853 if (gfc_match_eos () == MATCH_YES)
2854 goto done;
2855
2856 if (gfc_find_state (COMP_SUBROUTINE) == FAILURE)
2857 {
2858 gfc_error ("Alternate RETURN statement at %C is only allowed within "
2859 "a SUBROUTINE");
2860 goto cleanup;
2861 }
2862
2863 if (gfc_notify_std (GFC_STD_F95_OBS, "Obsolescent feature: Alternate RETURN "
2864 "at %C") == FAILURE)
2865 return MATCH_ERROR;
2866
2867 if (gfc_current_form == FORM_FREE)
2868 {
2869 /* The following are valid, so we can't require a blank after the
2870 RETURN keyword:
2871 return+1
2872 return(1) */
2873 char c = gfc_peek_ascii_char ();
2874 if (ISALPHA (c) || ISDIGIT (c))
2875 return MATCH_NO;
2876 }
2877
2878 m = gfc_match (" %e%t", &e);
2879 if (m == MATCH_YES)
2880 goto done;
2881 if (m == MATCH_ERROR)
2882 goto cleanup;
2883
2884 gfc_syntax_error (ST_RETURN);
2885
2886 cleanup:
2887 gfc_free_expr (e);
2888 return MATCH_ERROR;
2889
2890 done:
2891 gfc_enclosing_unit (&s);
2892 if (s == COMP_PROGRAM
2893 && gfc_notify_std (GFC_STD_GNU, "Extension: RETURN statement in "
2894 "main program at %C") == FAILURE)
2895 return MATCH_ERROR;
2896
2897 new_st.op = EXEC_RETURN;
2898 new_st.expr1 = e;
2899
2900 return MATCH_YES;
2901 }
2902
2903
2904 /* Match the call of a type-bound procedure, if CALL%var has already been
2905 matched and var found to be a derived-type variable. */
2906
2907 static match
2908 match_typebound_call (gfc_symtree* varst)
2909 {
2910 gfc_expr* base;
2911 match m;
2912
2913 base = gfc_get_expr ();
2914 base->expr_type = EXPR_VARIABLE;
2915 base->symtree = varst;
2916 base->where = gfc_current_locus;
2917 gfc_set_sym_referenced (varst->n.sym);
2918
2919 m = gfc_match_varspec (base, 0, true, true);
2920 if (m == MATCH_NO)
2921 gfc_error ("Expected component reference at %C");
2922 if (m != MATCH_YES)
2923 return MATCH_ERROR;
2924
2925 if (gfc_match_eos () != MATCH_YES)
2926 {
2927 gfc_error ("Junk after CALL at %C");
2928 return MATCH_ERROR;
2929 }
2930
2931 if (base->expr_type == EXPR_COMPCALL)
2932 new_st.op = EXEC_COMPCALL;
2933 else if (base->expr_type == EXPR_PPC)
2934 new_st.op = EXEC_CALL_PPC;
2935 else
2936 {
2937 gfc_error ("Expected type-bound procedure or procedure pointer component "
2938 "at %C");
2939 return MATCH_ERROR;
2940 }
2941 new_st.expr1 = base;
2942
2943 return MATCH_YES;
2944 }
2945
2946
2947 /* Match a CALL statement. The tricky part here are possible
2948 alternate return specifiers. We handle these by having all
2949 "subroutines" actually return an integer via a register that gives
2950 the return number. If the call specifies alternate returns, we
2951 generate code for a SELECT statement whose case clauses contain
2952 GOTOs to the various labels. */
2953
2954 match
2955 gfc_match_call (void)
2956 {
2957 char name[GFC_MAX_SYMBOL_LEN + 1];
2958 gfc_actual_arglist *a, *arglist;
2959 gfc_case *new_case;
2960 gfc_symbol *sym;
2961 gfc_symtree *st;
2962 gfc_code *c;
2963 match m;
2964 int i;
2965
2966 arglist = NULL;
2967
2968 m = gfc_match ("% %n", name);
2969 if (m == MATCH_NO)
2970 goto syntax;
2971 if (m != MATCH_YES)
2972 return m;
2973
2974 if (gfc_get_ha_sym_tree (name, &st))
2975 return MATCH_ERROR;
2976
2977 sym = st->n.sym;
2978
2979 /* If this is a variable of derived-type, it probably starts a type-bound
2980 procedure call. */
2981 if ((sym->attr.flavor != FL_PROCEDURE
2982 || gfc_is_function_return_value (sym, gfc_current_ns))
2983 && (sym->ts.type == BT_DERIVED || sym->ts.type == BT_CLASS))
2984 return match_typebound_call (st);
2985
2986 /* If it does not seem to be callable (include functions so that the
2987 right association is made. They are thrown out in resolution.)
2988 ... */
2989 if (!sym->attr.generic
2990 && !sym->attr.subroutine
2991 && !sym->attr.function)
2992 {
2993 if (!(sym->attr.external && !sym->attr.referenced))
2994 {
2995 /* ...create a symbol in this scope... */
2996 if (sym->ns != gfc_current_ns
2997 && gfc_get_sym_tree (name, NULL, &st, false) == 1)
2998 return MATCH_ERROR;
2999
3000 if (sym != st->n.sym)
3001 sym = st->n.sym;
3002 }
3003
3004 /* ...and then to try to make the symbol into a subroutine. */
3005 if (gfc_add_subroutine (&sym->attr, sym->name, NULL) == FAILURE)
3006 return MATCH_ERROR;
3007 }
3008
3009 gfc_set_sym_referenced (sym);
3010
3011 if (gfc_match_eos () != MATCH_YES)
3012 {
3013 m = gfc_match_actual_arglist (1, &arglist);
3014 if (m == MATCH_NO)
3015 goto syntax;
3016 if (m == MATCH_ERROR)
3017 goto cleanup;
3018
3019 if (gfc_match_eos () != MATCH_YES)
3020 goto syntax;
3021 }
3022
3023 /* If any alternate return labels were found, construct a SELECT
3024 statement that will jump to the right place. */
3025
3026 i = 0;
3027 for (a = arglist; a; a = a->next)
3028 if (a->expr == NULL)
3029 i = 1;
3030
3031 if (i)
3032 {
3033 gfc_symtree *select_st;
3034 gfc_symbol *select_sym;
3035 char name[GFC_MAX_SYMBOL_LEN + 1];
3036
3037 new_st.next = c = gfc_get_code ();
3038 c->op = EXEC_SELECT;
3039 sprintf (name, "_result_%s", sym->name);
3040 gfc_get_ha_sym_tree (name, &select_st); /* Can't fail. */
3041
3042 select_sym = select_st->n.sym;
3043 select_sym->ts.type = BT_INTEGER;
3044 select_sym->ts.kind = gfc_default_integer_kind;
3045 gfc_set_sym_referenced (select_sym);
3046 c->expr1 = gfc_get_expr ();
3047 c->expr1->expr_type = EXPR_VARIABLE;
3048 c->expr1->symtree = select_st;
3049 c->expr1->ts = select_sym->ts;
3050 c->expr1->where = gfc_current_locus;
3051
3052 i = 0;
3053 for (a = arglist; a; a = a->next)
3054 {
3055 if (a->expr != NULL)
3056 continue;
3057
3058 if (gfc_reference_st_label (a->label, ST_LABEL_TARGET) == FAILURE)
3059 continue;
3060
3061 i++;
3062
3063 c->block = gfc_get_code ();
3064 c = c->block;
3065 c->op = EXEC_SELECT;
3066
3067 new_case = gfc_get_case ();
3068 new_case->high = new_case->low = gfc_int_expr (i);
3069 c->ext.case_list = new_case;
3070
3071 c->next = gfc_get_code ();
3072 c->next->op = EXEC_GOTO;
3073 c->next->label1 = a->label;
3074 }
3075 }
3076
3077 new_st.op = EXEC_CALL;
3078 new_st.symtree = st;
3079 new_st.ext.actual = arglist;
3080
3081 return MATCH_YES;
3082
3083 syntax:
3084 gfc_syntax_error (ST_CALL);
3085
3086 cleanup:
3087 gfc_free_actual_arglist (arglist);
3088 return MATCH_ERROR;
3089 }
3090
3091
3092 /* Given a name, return a pointer to the common head structure,
3093 creating it if it does not exist. If FROM_MODULE is nonzero, we
3094 mangle the name so that it doesn't interfere with commons defined
3095 in the using namespace.
3096 TODO: Add to global symbol tree. */
3097
3098 gfc_common_head *
3099 gfc_get_common (const char *name, int from_module)
3100 {
3101 gfc_symtree *st;
3102 static int serial = 0;
3103 char mangled_name[GFC_MAX_SYMBOL_LEN + 1];
3104
3105 if (from_module)
3106 {
3107 /* A use associated common block is only needed to correctly layout
3108 the variables it contains. */
3109 snprintf (mangled_name, GFC_MAX_SYMBOL_LEN, "_%d_%s", serial++, name);
3110 st = gfc_new_symtree (&gfc_current_ns->common_root, mangled_name);
3111 }
3112 else
3113 {
3114 st = gfc_find_symtree (gfc_current_ns->common_root, name);
3115
3116 if (st == NULL)
3117 st = gfc_new_symtree (&gfc_current_ns->common_root, name);
3118 }
3119
3120 if (st->n.common == NULL)
3121 {
3122 st->n.common = gfc_get_common_head ();
3123 st->n.common->where = gfc_current_locus;
3124 strcpy (st->n.common->name, name);
3125 }
3126
3127 return st->n.common;
3128 }
3129
3130
3131 /* Match a common block name. */
3132
3133 match match_common_name (char *name)
3134 {
3135 match m;
3136
3137 if (gfc_match_char ('/') == MATCH_NO)
3138 {
3139 name[0] = '\0';
3140 return MATCH_YES;
3141 }
3142
3143 if (gfc_match_char ('/') == MATCH_YES)
3144 {
3145 name[0] = '\0';
3146 return MATCH_YES;
3147 }
3148
3149 m = gfc_match_name (name);
3150
3151 if (m == MATCH_ERROR)
3152 return MATCH_ERROR;
3153 if (m == MATCH_YES && gfc_match_char ('/') == MATCH_YES)
3154 return MATCH_YES;
3155
3156 gfc_error ("Syntax error in common block name at %C");
3157 return MATCH_ERROR;
3158 }
3159
3160
3161 /* Match a COMMON statement. */
3162
3163 match
3164 gfc_match_common (void)
3165 {
3166 gfc_symbol *sym, **head, *tail, *other, *old_blank_common;
3167 char name[GFC_MAX_SYMBOL_LEN + 1];
3168 gfc_common_head *t;
3169 gfc_array_spec *as;
3170 gfc_equiv *e1, *e2;
3171 match m;
3172 gfc_gsymbol *gsym;
3173
3174 old_blank_common = gfc_current_ns->blank_common.head;
3175 if (old_blank_common)
3176 {
3177 while (old_blank_common->common_next)
3178 old_blank_common = old_blank_common->common_next;
3179 }
3180
3181 as = NULL;
3182
3183 for (;;)
3184 {
3185 m = match_common_name (name);
3186 if (m == MATCH_ERROR)
3187 goto cleanup;
3188
3189 gsym = gfc_get_gsymbol (name);
3190 if (gsym->type != GSYM_UNKNOWN && gsym->type != GSYM_COMMON)
3191 {
3192 gfc_error ("Symbol '%s' at %C is already an external symbol that "
3193 "is not COMMON", name);
3194 goto cleanup;
3195 }
3196
3197 if (gsym->type == GSYM_UNKNOWN)
3198 {
3199 gsym->type = GSYM_COMMON;
3200 gsym->where = gfc_current_locus;
3201 gsym->defined = 1;
3202 }
3203
3204 gsym->used = 1;
3205
3206 if (name[0] == '\0')
3207 {
3208 t = &gfc_current_ns->blank_common;
3209 if (t->head == NULL)
3210 t->where = gfc_current_locus;
3211 }
3212 else
3213 {
3214 t = gfc_get_common (name, 0);
3215 }
3216 head = &t->head;
3217
3218 if (*head == NULL)
3219 tail = NULL;
3220 else
3221 {
3222 tail = *head;
3223 while (tail->common_next)
3224 tail = tail->common_next;
3225 }
3226
3227 /* Grab the list of symbols. */
3228 for (;;)
3229 {
3230 m = gfc_match_symbol (&sym, 0);
3231 if (m == MATCH_ERROR)
3232 goto cleanup;
3233 if (m == MATCH_NO)
3234 goto syntax;
3235
3236 /* Store a ref to the common block for error checking. */
3237 sym->common_block = t;
3238
3239 /* See if we know the current common block is bind(c), and if
3240 so, then see if we can check if the symbol is (which it'll
3241 need to be). This can happen if the bind(c) attr stmt was
3242 applied to the common block, and the variable(s) already
3243 defined, before declaring the common block. */
3244 if (t->is_bind_c == 1)
3245 {
3246 if (sym->ts.type != BT_UNKNOWN && sym->ts.is_c_interop != 1)
3247 {
3248 /* If we find an error, just print it and continue,
3249 cause it's just semantic, and we can see if there
3250 are more errors. */
3251 gfc_error_now ("Variable '%s' at %L in common block '%s' "
3252 "at %C must be declared with a C "
3253 "interoperable kind since common block "
3254 "'%s' is bind(c)",
3255 sym->name, &(sym->declared_at), t->name,
3256 t->name);
3257 }
3258
3259 if (sym->attr.is_bind_c == 1)
3260 gfc_error_now ("Variable '%s' in common block "
3261 "'%s' at %C can not be bind(c) since "
3262 "it is not global", sym->name, t->name);
3263 }
3264
3265 if (sym->attr.in_common)
3266 {
3267 gfc_error ("Symbol '%s' at %C is already in a COMMON block",
3268 sym->name);
3269 goto cleanup;
3270 }
3271
3272 if (((sym->value != NULL && sym->value->expr_type != EXPR_NULL)
3273 || sym->attr.data) && gfc_current_state () != COMP_BLOCK_DATA)
3274 {
3275 if (gfc_notify_std (GFC_STD_GNU, "Initialized symbol '%s' at %C "
3276 "can only be COMMON in "
3277 "BLOCK DATA", sym->name)
3278 == FAILURE)
3279 goto cleanup;
3280 }
3281
3282 if (gfc_add_in_common (&sym->attr, sym->name, NULL) == FAILURE)
3283 goto cleanup;
3284
3285 if (tail != NULL)
3286 tail->common_next = sym;
3287 else
3288 *head = sym;
3289
3290 tail = sym;
3291
3292 /* Deal with an optional array specification after the
3293 symbol name. */
3294 m = gfc_match_array_spec (&as);
3295 if (m == MATCH_ERROR)
3296 goto cleanup;
3297
3298 if (m == MATCH_YES)
3299 {
3300 if (as->type != AS_EXPLICIT)
3301 {
3302 gfc_error ("Array specification for symbol '%s' in COMMON "
3303 "at %C must be explicit", sym->name);
3304 goto cleanup;
3305 }
3306
3307 if (gfc_add_dimension (&sym->attr, sym->name, NULL) == FAILURE)
3308 goto cleanup;
3309
3310 if (sym->attr.pointer)
3311 {
3312 gfc_error ("Symbol '%s' in COMMON at %C cannot be a "
3313 "POINTER array", sym->name);
3314 goto cleanup;
3315 }
3316
3317 sym->as = as;
3318 as = NULL;
3319
3320 }
3321
3322 sym->common_head = t;
3323
3324 /* Check to see if the symbol is already in an equivalence group.
3325 If it is, set the other members as being in common. */
3326 if (sym->attr.in_equivalence)
3327 {
3328 for (e1 = gfc_current_ns->equiv; e1; e1 = e1->next)
3329 {
3330 for (e2 = e1; e2; e2 = e2->eq)
3331 if (e2->expr->symtree->n.sym == sym)
3332 goto equiv_found;
3333
3334 continue;
3335
3336 equiv_found:
3337
3338 for (e2 = e1; e2; e2 = e2->eq)
3339 {
3340 other = e2->expr->symtree->n.sym;
3341 if (other->common_head
3342 && other->common_head != sym->common_head)
3343 {
3344 gfc_error ("Symbol '%s', in COMMON block '%s' at "
3345 "%C is being indirectly equivalenced to "
3346 "another COMMON block '%s'",
3347 sym->name, sym->common_head->name,
3348 other->common_head->name);
3349 goto cleanup;
3350 }
3351 other->attr.in_common = 1;
3352 other->common_head = t;
3353 }
3354 }
3355 }
3356
3357
3358 gfc_gobble_whitespace ();
3359 if (gfc_match_eos () == MATCH_YES)
3360 goto done;
3361 if (gfc_peek_ascii_char () == '/')
3362 break;
3363 if (gfc_match_char (',') != MATCH_YES)
3364 goto syntax;
3365 gfc_gobble_whitespace ();
3366 if (gfc_peek_ascii_char () == '/')
3367 break;
3368 }
3369 }
3370
3371 done:
3372 return MATCH_YES;
3373
3374 syntax:
3375 gfc_syntax_error (ST_COMMON);
3376
3377 cleanup:
3378 if (old_blank_common)
3379 old_blank_common->common_next = NULL;
3380 else
3381 gfc_current_ns->blank_common.head = NULL;
3382 gfc_free_array_spec (as);
3383 return MATCH_ERROR;
3384 }
3385
3386
3387 /* Match a BLOCK DATA program unit. */
3388
3389 match
3390 gfc_match_block_data (void)
3391 {
3392 char name[GFC_MAX_SYMBOL_LEN + 1];
3393 gfc_symbol *sym;
3394 match m;
3395
3396 if (gfc_match_eos () == MATCH_YES)
3397 {
3398 gfc_new_block = NULL;
3399 return MATCH_YES;
3400 }
3401
3402 m = gfc_match ("% %n%t", name);
3403 if (m != MATCH_YES)
3404 return MATCH_ERROR;
3405
3406 if (gfc_get_symbol (name, NULL, &sym))
3407 return MATCH_ERROR;
3408
3409 if (gfc_add_flavor (&sym->attr, FL_BLOCK_DATA, sym->name, NULL) == FAILURE)
3410 return MATCH_ERROR;
3411
3412 gfc_new_block = sym;
3413
3414 return MATCH_YES;
3415 }
3416
3417
3418 /* Free a namelist structure. */
3419
3420 void
3421 gfc_free_namelist (gfc_namelist *name)
3422 {
3423 gfc_namelist *n;
3424
3425 for (; name; name = n)
3426 {
3427 n = name->next;
3428 gfc_free (name);
3429 }
3430 }
3431
3432
3433 /* Match a NAMELIST statement. */
3434
3435 match
3436 gfc_match_namelist (void)
3437 {
3438 gfc_symbol *group_name, *sym;
3439 gfc_namelist *nl;
3440 match m, m2;
3441
3442 m = gfc_match (" / %s /", &group_name);
3443 if (m == MATCH_NO)
3444 goto syntax;
3445 if (m == MATCH_ERROR)
3446 goto error;
3447
3448 for (;;)
3449 {
3450 if (group_name->ts.type != BT_UNKNOWN)
3451 {
3452 gfc_error ("Namelist group name '%s' at %C already has a basic "
3453 "type of %s", group_name->name,
3454 gfc_typename (&group_name->ts));
3455 return MATCH_ERROR;
3456 }
3457
3458 if (group_name->attr.flavor == FL_NAMELIST
3459 && group_name->attr.use_assoc
3460 && gfc_notify_std (GFC_STD_GNU, "Namelist group name '%s' "
3461 "at %C already is USE associated and can"
3462 "not be respecified.", group_name->name)
3463 == FAILURE)
3464 return MATCH_ERROR;
3465
3466 if (group_name->attr.flavor != FL_NAMELIST
3467 && gfc_add_flavor (&group_name->attr, FL_NAMELIST,
3468 group_name->name, NULL) == FAILURE)
3469 return MATCH_ERROR;
3470
3471 for (;;)
3472 {
3473 m = gfc_match_symbol (&sym, 1);
3474 if (m == MATCH_NO)
3475 goto syntax;
3476 if (m == MATCH_ERROR)
3477 goto error;
3478
3479 if (sym->attr.in_namelist == 0
3480 && gfc_add_in_namelist (&sym->attr, sym->name, NULL) == FAILURE)
3481 goto error;
3482
3483 /* Use gfc_error_check here, rather than goto error, so that
3484 these are the only errors for the next two lines. */
3485 if (sym->as && sym->as->type == AS_ASSUMED_SIZE)
3486 {
3487 gfc_error ("Assumed size array '%s' in namelist '%s' at "
3488 "%C is not allowed", sym->name, group_name->name);
3489 gfc_error_check ();
3490 }
3491
3492 if (sym->ts.type == BT_CHARACTER && sym->ts.u.cl->length == NULL)
3493 {
3494 gfc_error ("Assumed character length '%s' in namelist '%s' at "
3495 "%C is not allowed", sym->name, group_name->name);
3496 gfc_error_check ();
3497 }
3498
3499 nl = gfc_get_namelist ();
3500 nl->sym = sym;
3501 sym->refs++;
3502
3503 if (group_name->namelist == NULL)
3504 group_name->namelist = group_name->namelist_tail = nl;
3505 else
3506 {
3507 group_name->namelist_tail->next = nl;
3508 group_name->namelist_tail = nl;
3509 }
3510
3511 if (gfc_match_eos () == MATCH_YES)
3512 goto done;
3513
3514 m = gfc_match_char (',');
3515
3516 if (gfc_match_char ('/') == MATCH_YES)
3517 {
3518 m2 = gfc_match (" %s /", &group_name);
3519 if (m2 == MATCH_YES)
3520 break;
3521 if (m2 == MATCH_ERROR)
3522 goto error;
3523 goto syntax;
3524 }
3525
3526 if (m != MATCH_YES)
3527 goto syntax;
3528 }
3529 }
3530
3531 done:
3532 return MATCH_YES;
3533
3534 syntax:
3535 gfc_syntax_error (ST_NAMELIST);
3536
3537 error:
3538 return MATCH_ERROR;
3539 }
3540
3541
3542 /* Match a MODULE statement. */
3543
3544 match
3545 gfc_match_module (void)
3546 {
3547 match m;
3548
3549 m = gfc_match (" %s%t", &gfc_new_block);
3550 if (m != MATCH_YES)
3551 return m;
3552
3553 if (gfc_add_flavor (&gfc_new_block->attr, FL_MODULE,
3554 gfc_new_block->name, NULL) == FAILURE)
3555 return MATCH_ERROR;
3556
3557 return MATCH_YES;
3558 }
3559
3560
3561 /* Free equivalence sets and lists. Recursively is the easiest way to
3562 do this. */
3563
3564 void
3565 gfc_free_equiv (gfc_equiv *eq)
3566 {
3567 if (eq == NULL)
3568 return;
3569
3570 gfc_free_equiv (eq->eq);
3571 gfc_free_equiv (eq->next);
3572 gfc_free_expr (eq->expr);
3573 gfc_free (eq);
3574 }
3575
3576
3577 /* Match an EQUIVALENCE statement. */
3578
3579 match
3580 gfc_match_equivalence (void)
3581 {
3582 gfc_equiv *eq, *set, *tail;
3583 gfc_ref *ref;
3584 gfc_symbol *sym;
3585 match m;
3586 gfc_common_head *common_head = NULL;
3587 bool common_flag;
3588 int cnt;
3589
3590 tail = NULL;
3591
3592 for (;;)
3593 {
3594 eq = gfc_get_equiv ();
3595 if (tail == NULL)
3596 tail = eq;
3597
3598 eq->next = gfc_current_ns->equiv;
3599 gfc_current_ns->equiv = eq;
3600
3601 if (gfc_match_char ('(') != MATCH_YES)
3602 goto syntax;
3603
3604 set = eq;
3605 common_flag = FALSE;
3606 cnt = 0;
3607
3608 for (;;)
3609 {
3610 m = gfc_match_equiv_variable (&set->expr);
3611 if (m == MATCH_ERROR)
3612 goto cleanup;
3613 if (m == MATCH_NO)
3614 goto syntax;
3615
3616 /* count the number of objects. */
3617 cnt++;
3618
3619 if (gfc_match_char ('%') == MATCH_YES)
3620 {
3621 gfc_error ("Derived type component %C is not a "
3622 "permitted EQUIVALENCE member");
3623 goto cleanup;
3624 }
3625
3626 for (ref = set->expr->ref; ref; ref = ref->next)
3627 if (ref->type == REF_ARRAY && ref->u.ar.type == AR_SECTION)
3628 {
3629 gfc_error ("Array reference in EQUIVALENCE at %C cannot "
3630 "be an array section");
3631 goto cleanup;
3632 }
3633
3634 sym = set->expr->symtree->n.sym;
3635
3636 if (gfc_add_in_equivalence (&sym->attr, sym->name, NULL) == FAILURE)
3637 goto cleanup;
3638
3639 if (sym->attr.in_common)
3640 {
3641 common_flag = TRUE;
3642 common_head = sym->common_head;
3643 }
3644
3645 if (gfc_match_char (')') == MATCH_YES)
3646 break;
3647
3648 if (gfc_match_char (',') != MATCH_YES)
3649 goto syntax;
3650
3651 set->eq = gfc_get_equiv ();
3652 set = set->eq;
3653 }
3654
3655 if (cnt < 2)
3656 {
3657 gfc_error ("EQUIVALENCE at %C requires two or more objects");
3658 goto cleanup;
3659 }
3660
3661 /* If one of the members of an equivalence is in common, then
3662 mark them all as being in common. Before doing this, check
3663 that members of the equivalence group are not in different
3664 common blocks. */
3665 if (common_flag)
3666 for (set = eq; set; set = set->eq)
3667 {
3668 sym = set->expr->symtree->n.sym;
3669 if (sym->common_head && sym->common_head != common_head)
3670 {
3671 gfc_error ("Attempt to indirectly overlap COMMON "
3672 "blocks %s and %s by EQUIVALENCE at %C",
3673 sym->common_head->name, common_head->name);
3674 goto cleanup;
3675 }
3676 sym->attr.in_common = 1;
3677 sym->common_head = common_head;
3678 }
3679
3680 if (gfc_match_eos () == MATCH_YES)
3681 break;
3682 if (gfc_match_char (',') != MATCH_YES)
3683 {
3684 gfc_error ("Expecting a comma in EQUIVALENCE at %C");
3685 goto cleanup;
3686 }
3687 }
3688
3689 return MATCH_YES;
3690
3691 syntax:
3692 gfc_syntax_error (ST_EQUIVALENCE);
3693
3694 cleanup:
3695 eq = tail->next;
3696 tail->next = NULL;
3697
3698 gfc_free_equiv (gfc_current_ns->equiv);
3699 gfc_current_ns->equiv = eq;
3700
3701 return MATCH_ERROR;
3702 }
3703
3704
3705 /* Check that a statement function is not recursive. This is done by looking
3706 for the statement function symbol(sym) by looking recursively through its
3707 expression(e). If a reference to sym is found, true is returned.
3708 12.5.4 requires that any variable of function that is implicitly typed
3709 shall have that type confirmed by any subsequent type declaration. The
3710 implicit typing is conveniently done here. */
3711 static bool
3712 recursive_stmt_fcn (gfc_expr *, gfc_symbol *);
3713
3714 static bool
3715 check_stmt_fcn (gfc_expr *e, gfc_symbol *sym, int *f ATTRIBUTE_UNUSED)
3716 {
3717
3718 if (e == NULL)
3719 return false;
3720
3721 switch (e->expr_type)
3722 {
3723 case EXPR_FUNCTION:
3724 if (e->symtree == NULL)
3725 return false;
3726
3727 /* Check the name before testing for nested recursion! */
3728 if (sym->name == e->symtree->n.sym->name)
3729 return true;
3730
3731 /* Catch recursion via other statement functions. */
3732 if (e->symtree->n.sym->attr.proc == PROC_ST_FUNCTION
3733 && e->symtree->n.sym->value
3734 && recursive_stmt_fcn (e->symtree->n.sym->value, sym))
3735 return true;
3736
3737 if (e->symtree->n.sym->ts.type == BT_UNKNOWN)
3738 gfc_set_default_type (e->symtree->n.sym, 0, NULL);
3739
3740 break;
3741
3742 case EXPR_VARIABLE:
3743 if (e->symtree && sym->name == e->symtree->n.sym->name)
3744 return true;
3745
3746 if (e->symtree->n.sym->ts.type == BT_UNKNOWN)
3747 gfc_set_default_type (e->symtree->n.sym, 0, NULL);
3748 break;
3749
3750 default:
3751 break;
3752 }
3753
3754 return false;
3755 }
3756
3757
3758 static bool
3759 recursive_stmt_fcn (gfc_expr *e, gfc_symbol *sym)
3760 {
3761 return gfc_traverse_expr (e, sym, check_stmt_fcn, 0);
3762 }
3763
3764
3765 /* Match a statement function declaration. It is so easy to match
3766 non-statement function statements with a MATCH_ERROR as opposed to
3767 MATCH_NO that we suppress error message in most cases. */
3768
3769 match
3770 gfc_match_st_function (void)
3771 {
3772 gfc_error_buf old_error;
3773 gfc_symbol *sym;
3774 gfc_expr *expr;
3775 match m;
3776
3777 m = gfc_match_symbol (&sym, 0);
3778 if (m != MATCH_YES)
3779 return m;
3780
3781 gfc_push_error (&old_error);
3782
3783 if (gfc_add_procedure (&sym->attr, PROC_ST_FUNCTION,
3784 sym->name, NULL) == FAILURE)
3785 goto undo_error;
3786
3787 if (gfc_match_formal_arglist (sym, 1, 0) != MATCH_YES)
3788 goto undo_error;
3789
3790 m = gfc_match (" = %e%t", &expr);
3791 if (m == MATCH_NO)
3792 goto undo_error;
3793
3794 gfc_free_error (&old_error);
3795 if (m == MATCH_ERROR)
3796 return m;
3797
3798 if (recursive_stmt_fcn (expr, sym))
3799 {
3800 gfc_error ("Statement function at %L is recursive", &expr->where);
3801 return MATCH_ERROR;
3802 }
3803
3804 sym->value = expr;
3805
3806 if (gfc_notify_std (GFC_STD_F95_OBS, "Obsolescent feature: "
3807 "Statement function at %C") == FAILURE)
3808 return MATCH_ERROR;
3809
3810 return MATCH_YES;
3811
3812 undo_error:
3813 gfc_pop_error (&old_error);
3814 return MATCH_NO;
3815 }
3816
3817
3818 /***************** SELECT CASE subroutines ******************/
3819
3820 /* Free a single case structure. */
3821
3822 static void
3823 free_case (gfc_case *p)
3824 {
3825 if (p->low == p->high)
3826 p->high = NULL;
3827 gfc_free_expr (p->low);
3828 gfc_free_expr (p->high);
3829 gfc_free (p);
3830 }
3831
3832
3833 /* Free a list of case structures. */
3834
3835 void
3836 gfc_free_case_list (gfc_case *p)
3837 {
3838 gfc_case *q;
3839
3840 for (; p; p = q)
3841 {
3842 q = p->next;
3843 free_case (p);
3844 }
3845 }
3846
3847
3848 /* Match a single case selector. */
3849
3850 static match
3851 match_case_selector (gfc_case **cp)
3852 {
3853 gfc_case *c;
3854 match m;
3855
3856 c = gfc_get_case ();
3857 c->where = gfc_current_locus;
3858
3859 if (gfc_match_char (':') == MATCH_YES)
3860 {
3861 m = gfc_match_init_expr (&c->high);
3862 if (m == MATCH_NO)
3863 goto need_expr;
3864 if (m == MATCH_ERROR)
3865 goto cleanup;
3866 }
3867 else
3868 {
3869 m = gfc_match_init_expr (&c->low);
3870 if (m == MATCH_ERROR)
3871 goto cleanup;
3872 if (m == MATCH_NO)
3873 goto need_expr;
3874
3875 /* If we're not looking at a ':' now, make a range out of a single
3876 target. Else get the upper bound for the case range. */
3877 if (gfc_match_char (':') != MATCH_YES)
3878 c->high = c->low;
3879 else
3880 {
3881 m = gfc_match_init_expr (&c->high);
3882 if (m == MATCH_ERROR)
3883 goto cleanup;
3884 /* MATCH_NO is fine. It's OK if nothing is there! */
3885 }
3886 }
3887
3888 *cp = c;
3889 return MATCH_YES;
3890
3891 need_expr:
3892 gfc_error ("Expected initialization expression in CASE at %C");
3893
3894 cleanup:
3895 free_case (c);
3896 return MATCH_ERROR;
3897 }
3898
3899
3900 /* Match the end of a case statement. */
3901
3902 static match
3903 match_case_eos (void)
3904 {
3905 char name[GFC_MAX_SYMBOL_LEN + 1];
3906 match m;
3907
3908 if (gfc_match_eos () == MATCH_YES)
3909 return MATCH_YES;
3910
3911 /* If the case construct doesn't have a case-construct-name, we
3912 should have matched the EOS. */
3913 if (!gfc_current_block ())
3914 return MATCH_NO;
3915
3916 gfc_gobble_whitespace ();
3917
3918 m = gfc_match_name (name);
3919 if (m != MATCH_YES)
3920 return m;
3921
3922 if (strcmp (name, gfc_current_block ()->name) != 0)
3923 {
3924 gfc_error ("Expected block name '%s' of SELECT construct at %C",
3925 gfc_current_block ()->name);
3926 return MATCH_ERROR;
3927 }
3928
3929 return gfc_match_eos ();
3930 }
3931
3932
3933 /* Match a SELECT statement. */
3934
3935 match
3936 gfc_match_select (void)
3937 {
3938 gfc_expr *expr;
3939 match m;
3940
3941 m = gfc_match_label ();
3942 if (m == MATCH_ERROR)
3943 return m;
3944
3945 m = gfc_match (" select case ( %e )%t", &expr);
3946 if (m != MATCH_YES)
3947 return m;
3948
3949 new_st.op = EXEC_SELECT;
3950 new_st.expr1 = expr;
3951
3952 return MATCH_YES;
3953 }
3954
3955
3956 /* Push the current selector onto the SELECT TYPE stack. */
3957
3958 static void
3959 select_type_push (gfc_symbol *sel)
3960 {
3961 gfc_select_type_stack *top = gfc_get_select_type_stack ();
3962 top->selector = sel;
3963 top->tmp = NULL;
3964 top->prev = select_type_stack;
3965
3966 select_type_stack = top;
3967 }
3968
3969
3970 /* Set the temporary for the current SELECT TYPE selector. */
3971
3972 static void
3973 select_type_set_tmp (gfc_typespec *ts)
3974 {
3975 char name[GFC_MAX_SYMBOL_LEN];
3976 gfc_symtree *tmp;
3977
3978 if (!gfc_type_is_extensible (ts->u.derived))
3979 return;
3980
3981 if (ts->type == BT_CLASS)
3982 sprintf (name, "tmp$class$%s", ts->u.derived->name);
3983 else
3984 sprintf (name, "tmp$type$%s", ts->u.derived->name);
3985 gfc_get_sym_tree (name, gfc_current_ns, &tmp, false);
3986 gfc_add_type (tmp->n.sym, ts, NULL);
3987 gfc_set_sym_referenced (tmp->n.sym);
3988 gfc_add_pointer (&tmp->n.sym->attr, NULL);
3989 gfc_add_flavor (&tmp->n.sym->attr, FL_VARIABLE, name, NULL);
3990 if (ts->type == BT_CLASS)
3991 {
3992 gfc_build_class_symbol (&tmp->n.sym->ts, &tmp->n.sym->attr,
3993 &tmp->n.sym->as);
3994 tmp->n.sym->attr.class_ok = 1;
3995 }
3996
3997 select_type_stack->tmp = tmp;
3998 }
3999
4000
4001 /* Match a SELECT TYPE statement. */
4002
4003 match
4004 gfc_match_select_type (void)
4005 {
4006 gfc_expr *expr1, *expr2 = NULL;
4007 match m;
4008 char name[GFC_MAX_SYMBOL_LEN];
4009
4010 m = gfc_match_label ();
4011 if (m == MATCH_ERROR)
4012 return m;
4013
4014 m = gfc_match (" select type ( ");
4015 if (m != MATCH_YES)
4016 return m;
4017
4018 gfc_current_ns = gfc_build_block_ns (gfc_current_ns);
4019
4020 m = gfc_match (" %n => %e", name, &expr2);
4021 if (m == MATCH_YES)
4022 {
4023 expr1 = gfc_get_expr();
4024 expr1->expr_type = EXPR_VARIABLE;
4025 if (gfc_get_sym_tree (name, NULL, &expr1->symtree, false))
4026 return MATCH_ERROR;
4027 expr1->symtree->n.sym->ts = expr2->ts;
4028 expr1->symtree->n.sym->attr.referenced = 1;
4029 expr1->symtree->n.sym->attr.class_ok = 1;
4030 }
4031 else
4032 {
4033 m = gfc_match (" %e ", &expr1);
4034 if (m != MATCH_YES)
4035 return m;
4036 }
4037
4038 m = gfc_match (" )%t");
4039 if (m != MATCH_YES)
4040 return m;
4041
4042 /* Check for F03:C811. */
4043 if (!expr2 && (expr1->expr_type != EXPR_VARIABLE || expr1->ref != NULL))
4044 {
4045 gfc_error ("Selector in SELECT TYPE at %C is not a named variable; "
4046 "use associate-name=>");
4047 return MATCH_ERROR;
4048 }
4049
4050 /* Check for F03:C813. */
4051 if (expr1->ts.type != BT_CLASS && !(expr2 && expr2->ts.type == BT_CLASS))
4052 {
4053 gfc_error ("Selector shall be polymorphic in SELECT TYPE statement "
4054 "at %C");
4055 return MATCH_ERROR;
4056 }
4057
4058 new_st.op = EXEC_SELECT_TYPE;
4059 new_st.expr1 = expr1;
4060 new_st.expr2 = expr2;
4061 new_st.ext.ns = gfc_current_ns;
4062
4063 select_type_push (expr1->symtree->n.sym);
4064
4065 return MATCH_YES;
4066 }
4067
4068
4069 /* Match a CASE statement. */
4070
4071 match
4072 gfc_match_case (void)
4073 {
4074 gfc_case *c, *head, *tail;
4075 match m;
4076
4077 head = tail = NULL;
4078
4079 if (gfc_current_state () != COMP_SELECT)
4080 {
4081 gfc_error ("Unexpected CASE statement at %C");
4082 return MATCH_ERROR;
4083 }
4084
4085 if (gfc_match ("% default") == MATCH_YES)
4086 {
4087 m = match_case_eos ();
4088 if (m == MATCH_NO)
4089 goto syntax;
4090 if (m == MATCH_ERROR)
4091 goto cleanup;
4092
4093 new_st.op = EXEC_SELECT;
4094 c = gfc_get_case ();
4095 c->where = gfc_current_locus;
4096 new_st.ext.case_list = c;
4097 return MATCH_YES;
4098 }
4099
4100 if (gfc_match_char ('(') != MATCH_YES)
4101 goto syntax;
4102
4103 for (;;)
4104 {
4105 if (match_case_selector (&c) == MATCH_ERROR)
4106 goto cleanup;
4107
4108 if (head == NULL)
4109 head = c;
4110 else
4111 tail->next = c;
4112
4113 tail = c;
4114
4115 if (gfc_match_char (')') == MATCH_YES)
4116 break;
4117 if (gfc_match_char (',') != MATCH_YES)
4118 goto syntax;
4119 }
4120
4121 m = match_case_eos ();
4122 if (m == MATCH_NO)
4123 goto syntax;
4124 if (m == MATCH_ERROR)
4125 goto cleanup;
4126
4127 new_st.op = EXEC_SELECT;
4128 new_st.ext.case_list = head;
4129
4130 return MATCH_YES;
4131
4132 syntax:
4133 gfc_error ("Syntax error in CASE specification at %C");
4134
4135 cleanup:
4136 gfc_free_case_list (head); /* new_st is cleaned up in parse.c. */
4137 return MATCH_ERROR;
4138 }
4139
4140
4141 /* Match a TYPE IS statement. */
4142
4143 match
4144 gfc_match_type_is (void)
4145 {
4146 gfc_case *c = NULL;
4147 match m;
4148
4149 if (gfc_current_state () != COMP_SELECT_TYPE)
4150 {
4151 gfc_error ("Unexpected TYPE IS statement at %C");
4152 return MATCH_ERROR;
4153 }
4154
4155 if (gfc_match_char ('(') != MATCH_YES)
4156 goto syntax;
4157
4158 c = gfc_get_case ();
4159 c->where = gfc_current_locus;
4160
4161 /* TODO: Once unlimited polymorphism is implemented, we will need to call
4162 match_type_spec here. */
4163 if (match_derived_type_spec (&c->ts) == MATCH_ERROR)
4164 goto cleanup;
4165
4166 if (gfc_match_char (')') != MATCH_YES)
4167 goto syntax;
4168
4169 m = match_case_eos ();
4170 if (m == MATCH_NO)
4171 goto syntax;
4172 if (m == MATCH_ERROR)
4173 goto cleanup;
4174
4175 new_st.op = EXEC_SELECT_TYPE;
4176 new_st.ext.case_list = c;
4177
4178 /* Create temporary variable. */
4179 select_type_set_tmp (&c->ts);
4180
4181 return MATCH_YES;
4182
4183 syntax:
4184 gfc_error ("Syntax error in TYPE IS specification at %C");
4185
4186 cleanup:
4187 if (c != NULL)
4188 gfc_free_case_list (c); /* new_st is cleaned up in parse.c. */
4189 return MATCH_ERROR;
4190 }
4191
4192
4193 /* Match a CLASS IS or CLASS DEFAULT statement. */
4194
4195 match
4196 gfc_match_class_is (void)
4197 {
4198 gfc_case *c = NULL;
4199 match m;
4200
4201 if (gfc_current_state () != COMP_SELECT_TYPE)
4202 return MATCH_NO;
4203
4204 if (gfc_match ("% default") == MATCH_YES)
4205 {
4206 m = match_case_eos ();
4207 if (m == MATCH_NO)
4208 goto syntax;
4209 if (m == MATCH_ERROR)
4210 goto cleanup;
4211
4212 new_st.op = EXEC_SELECT_TYPE;
4213 c = gfc_get_case ();
4214 c->where = gfc_current_locus;
4215 c->ts.type = BT_UNKNOWN;
4216 new_st.ext.case_list = c;
4217 return MATCH_YES;
4218 }
4219
4220 m = gfc_match ("% is");
4221 if (m == MATCH_NO)
4222 goto syntax;
4223 if (m == MATCH_ERROR)
4224 goto cleanup;
4225
4226 if (gfc_match_char ('(') != MATCH_YES)
4227 goto syntax;
4228
4229 c = gfc_get_case ();
4230 c->where = gfc_current_locus;
4231
4232 if (match_derived_type_spec (&c->ts) == MATCH_ERROR)
4233 goto cleanup;
4234
4235 if (c->ts.type == BT_DERIVED)
4236 c->ts.type = BT_CLASS;
4237
4238 if (gfc_match_char (')') != MATCH_YES)
4239 goto syntax;
4240
4241 m = match_case_eos ();
4242 if (m == MATCH_NO)
4243 goto syntax;
4244 if (m == MATCH_ERROR)
4245 goto cleanup;
4246
4247 new_st.op = EXEC_SELECT_TYPE;
4248 new_st.ext.case_list = c;
4249
4250 /* Create temporary variable. */
4251 select_type_set_tmp (&c->ts);
4252
4253 return MATCH_YES;
4254
4255 syntax:
4256 gfc_error ("Syntax error in CLASS IS specification at %C");
4257
4258 cleanup:
4259 if (c != NULL)
4260 gfc_free_case_list (c); /* new_st is cleaned up in parse.c. */
4261 return MATCH_ERROR;
4262 }
4263
4264
4265 /********************* WHERE subroutines ********************/
4266
4267 /* Match the rest of a simple WHERE statement that follows an IF statement.
4268 */
4269
4270 static match
4271 match_simple_where (void)
4272 {
4273 gfc_expr *expr;
4274 gfc_code *c;
4275 match m;
4276
4277 m = gfc_match (" ( %e )", &expr);
4278 if (m != MATCH_YES)
4279 return m;
4280
4281 m = gfc_match_assignment ();
4282 if (m == MATCH_NO)
4283 goto syntax;
4284 if (m == MATCH_ERROR)
4285 goto cleanup;
4286
4287 if (gfc_match_eos () != MATCH_YES)
4288 goto syntax;
4289
4290 c = gfc_get_code ();
4291
4292 c->op = EXEC_WHERE;
4293 c->expr1 = expr;
4294 c->next = gfc_get_code ();
4295
4296 *c->next = new_st;
4297 gfc_clear_new_st ();
4298
4299 new_st.op = EXEC_WHERE;
4300 new_st.block = c;
4301
4302 return MATCH_YES;
4303
4304 syntax:
4305 gfc_syntax_error (ST_WHERE);
4306
4307 cleanup:
4308 gfc_free_expr (expr);
4309 return MATCH_ERROR;
4310 }
4311
4312
4313 /* Match a WHERE statement. */
4314
4315 match
4316 gfc_match_where (gfc_statement *st)
4317 {
4318 gfc_expr *expr;
4319 match m0, m;
4320 gfc_code *c;
4321
4322 m0 = gfc_match_label ();
4323 if (m0 == MATCH_ERROR)
4324 return m0;
4325
4326 m = gfc_match (" where ( %e )", &expr);
4327 if (m != MATCH_YES)
4328 return m;
4329
4330 if (gfc_match_eos () == MATCH_YES)
4331 {
4332 *st = ST_WHERE_BLOCK;
4333 new_st.op = EXEC_WHERE;
4334 new_st.expr1 = expr;
4335 return MATCH_YES;
4336 }
4337
4338 m = gfc_match_assignment ();
4339 if (m == MATCH_NO)
4340 gfc_syntax_error (ST_WHERE);
4341
4342 if (m != MATCH_YES)
4343 {
4344 gfc_free_expr (expr);
4345 return MATCH_ERROR;
4346 }
4347
4348 /* We've got a simple WHERE statement. */
4349 *st = ST_WHERE;
4350 c = gfc_get_code ();
4351
4352 c->op = EXEC_WHERE;
4353 c->expr1 = expr;
4354 c->next = gfc_get_code ();
4355
4356 *c->next = new_st;
4357 gfc_clear_new_st ();
4358
4359 new_st.op = EXEC_WHERE;
4360 new_st.block = c;
4361
4362 return MATCH_YES;
4363 }
4364
4365
4366 /* Match an ELSEWHERE statement. We leave behind a WHERE node in
4367 new_st if successful. */
4368
4369 match
4370 gfc_match_elsewhere (void)
4371 {
4372 char name[GFC_MAX_SYMBOL_LEN + 1];
4373 gfc_expr *expr;
4374 match m;
4375
4376 if (gfc_current_state () != COMP_WHERE)
4377 {
4378 gfc_error ("ELSEWHERE statement at %C not enclosed in WHERE block");
4379 return MATCH_ERROR;
4380 }
4381
4382 expr = NULL;
4383
4384 if (gfc_match_char ('(') == MATCH_YES)
4385 {
4386 m = gfc_match_expr (&expr);
4387 if (m == MATCH_NO)
4388 goto syntax;
4389 if (m == MATCH_ERROR)
4390 return MATCH_ERROR;
4391
4392 if (gfc_match_char (')') != MATCH_YES)
4393 goto syntax;
4394 }
4395
4396 if (gfc_match_eos () != MATCH_YES)
4397 {
4398 /* Only makes sense if we have a where-construct-name. */
4399 if (!gfc_current_block ())
4400 {
4401 m = MATCH_ERROR;
4402 goto cleanup;
4403 }
4404 /* Better be a name at this point. */
4405 m = gfc_match_name (name);
4406 if (m == MATCH_NO)
4407 goto syntax;
4408 if (m == MATCH_ERROR)
4409 goto cleanup;
4410
4411 if (gfc_match_eos () != MATCH_YES)
4412 goto syntax;
4413
4414 if (strcmp (name, gfc_current_block ()->name) != 0)
4415 {
4416 gfc_error ("Label '%s' at %C doesn't match WHERE label '%s'",
4417 name, gfc_current_block ()->name);
4418 goto cleanup;
4419 }
4420 }
4421
4422 new_st.op = EXEC_WHERE;
4423 new_st.expr1 = expr;
4424 return MATCH_YES;
4425
4426 syntax:
4427 gfc_syntax_error (ST_ELSEWHERE);
4428
4429 cleanup:
4430 gfc_free_expr (expr);
4431 return MATCH_ERROR;
4432 }
4433
4434
4435 /******************** FORALL subroutines ********************/
4436
4437 /* Free a list of FORALL iterators. */
4438
4439 void
4440 gfc_free_forall_iterator (gfc_forall_iterator *iter)
4441 {
4442 gfc_forall_iterator *next;
4443
4444 while (iter)
4445 {
4446 next = iter->next;
4447 gfc_free_expr (iter->var);
4448 gfc_free_expr (iter->start);
4449 gfc_free_expr (iter->end);
4450 gfc_free_expr (iter->stride);
4451 gfc_free (iter);
4452 iter = next;
4453 }
4454 }
4455
4456
4457 /* Match an iterator as part of a FORALL statement. The format is:
4458
4459 <var> = <start>:<end>[:<stride>]
4460
4461 On MATCH_NO, the caller tests for the possibility that there is a
4462 scalar mask expression. */
4463
4464 static match
4465 match_forall_iterator (gfc_forall_iterator **result)
4466 {
4467 gfc_forall_iterator *iter;
4468 locus where;
4469 match m;
4470
4471 where = gfc_current_locus;
4472 iter = XCNEW (gfc_forall_iterator);
4473
4474 m = gfc_match_expr (&iter->var);
4475 if (m != MATCH_YES)
4476 goto cleanup;
4477
4478 if (gfc_match_char ('=') != MATCH_YES
4479 || iter->var->expr_type != EXPR_VARIABLE)
4480 {
4481 m = MATCH_NO;
4482 goto cleanup;
4483 }
4484
4485 m = gfc_match_expr (&iter->start);
4486 if (m != MATCH_YES)
4487 goto cleanup;
4488
4489 if (gfc_match_char (':') != MATCH_YES)
4490 goto syntax;
4491
4492 m = gfc_match_expr (&iter->end);
4493 if (m == MATCH_NO)
4494 goto syntax;
4495 if (m == MATCH_ERROR)
4496 goto cleanup;
4497
4498 if (gfc_match_char (':') == MATCH_NO)
4499 iter->stride = gfc_int_expr (1);
4500 else
4501 {
4502 m = gfc_match_expr (&iter->stride);
4503 if (m == MATCH_NO)
4504 goto syntax;
4505 if (m == MATCH_ERROR)
4506 goto cleanup;
4507 }
4508
4509 /* Mark the iteration variable's symbol as used as a FORALL index. */
4510 iter->var->symtree->n.sym->forall_index = true;
4511
4512 *result = iter;
4513 return MATCH_YES;
4514
4515 syntax:
4516 gfc_error ("Syntax error in FORALL iterator at %C");
4517 m = MATCH_ERROR;
4518
4519 cleanup:
4520
4521 gfc_current_locus = where;
4522 gfc_free_forall_iterator (iter);
4523 return m;
4524 }
4525
4526
4527 /* Match the header of a FORALL statement. */
4528
4529 static match
4530 match_forall_header (gfc_forall_iterator **phead, gfc_expr **mask)
4531 {
4532 gfc_forall_iterator *head, *tail, *new_iter;
4533 gfc_expr *msk;
4534 match m;
4535
4536 gfc_gobble_whitespace ();
4537
4538 head = tail = NULL;
4539 msk = NULL;
4540
4541 if (gfc_match_char ('(') != MATCH_YES)
4542 return MATCH_NO;
4543
4544 m = match_forall_iterator (&new_iter);
4545 if (m == MATCH_ERROR)
4546 goto cleanup;
4547 if (m == MATCH_NO)
4548 goto syntax;
4549
4550 head = tail = new_iter;
4551
4552 for (;;)
4553 {
4554 if (gfc_match_char (',') != MATCH_YES)
4555 break;
4556
4557 m = match_forall_iterator (&new_iter);
4558 if (m == MATCH_ERROR)
4559 goto cleanup;
4560
4561 if (m == MATCH_YES)
4562 {
4563 tail->next = new_iter;
4564 tail = new_iter;
4565 continue;
4566 }
4567
4568 /* Have to have a mask expression. */
4569
4570 m = gfc_match_expr (&msk);
4571 if (m == MATCH_NO)
4572 goto syntax;
4573 if (m == MATCH_ERROR)
4574 goto cleanup;
4575
4576 break;
4577 }
4578
4579 if (gfc_match_char (')') == MATCH_NO)
4580 goto syntax;
4581
4582 *phead = head;
4583 *mask = msk;
4584 return MATCH_YES;
4585
4586 syntax:
4587 gfc_syntax_error (ST_FORALL);
4588
4589 cleanup:
4590 gfc_free_expr (msk);
4591 gfc_free_forall_iterator (head);
4592
4593 return MATCH_ERROR;
4594 }
4595
4596 /* Match the rest of a simple FORALL statement that follows an
4597 IF statement. */
4598
4599 static match
4600 match_simple_forall (void)
4601 {
4602 gfc_forall_iterator *head;
4603 gfc_expr *mask;
4604 gfc_code *c;
4605 match m;
4606
4607 mask = NULL;
4608 head = NULL;
4609 c = NULL;
4610
4611 m = match_forall_header (&head, &mask);
4612
4613 if (m == MATCH_NO)
4614 goto syntax;
4615 if (m != MATCH_YES)
4616 goto cleanup;
4617
4618 m = gfc_match_assignment ();
4619
4620 if (m == MATCH_ERROR)
4621 goto cleanup;
4622 if (m == MATCH_NO)
4623 {
4624 m = gfc_match_pointer_assignment ();
4625 if (m == MATCH_ERROR)
4626 goto cleanup;
4627 if (m == MATCH_NO)
4628 goto syntax;
4629 }
4630
4631 c = gfc_get_code ();
4632 *c = new_st;
4633 c->loc = gfc_current_locus;
4634
4635 if (gfc_match_eos () != MATCH_YES)
4636 goto syntax;
4637
4638 gfc_clear_new_st ();
4639 new_st.op = EXEC_FORALL;
4640 new_st.expr1 = mask;
4641 new_st.ext.forall_iterator = head;
4642 new_st.block = gfc_get_code ();
4643
4644 new_st.block->op = EXEC_FORALL;
4645 new_st.block->next = c;
4646
4647 return MATCH_YES;
4648
4649 syntax:
4650 gfc_syntax_error (ST_FORALL);
4651
4652 cleanup:
4653 gfc_free_forall_iterator (head);
4654 gfc_free_expr (mask);
4655
4656 return MATCH_ERROR;
4657 }
4658
4659
4660 /* Match a FORALL statement. */
4661
4662 match
4663 gfc_match_forall (gfc_statement *st)
4664 {
4665 gfc_forall_iterator *head;
4666 gfc_expr *mask;
4667 gfc_code *c;
4668 match m0, m;
4669
4670 head = NULL;
4671 mask = NULL;
4672 c = NULL;
4673
4674 m0 = gfc_match_label ();
4675 if (m0 == MATCH_ERROR)
4676 return MATCH_ERROR;
4677
4678 m = gfc_match (" forall");
4679 if (m != MATCH_YES)
4680 return m;
4681
4682 m = match_forall_header (&head, &mask);
4683 if (m == MATCH_ERROR)
4684 goto cleanup;
4685 if (m == MATCH_NO)
4686 goto syntax;
4687
4688 if (gfc_match_eos () == MATCH_YES)
4689 {
4690 *st = ST_FORALL_BLOCK;
4691 new_st.op = EXEC_FORALL;
4692 new_st.expr1 = mask;
4693 new_st.ext.forall_iterator = head;
4694 return MATCH_YES;
4695 }
4696
4697 m = gfc_match_assignment ();
4698 if (m == MATCH_ERROR)
4699 goto cleanup;
4700 if (m == MATCH_NO)
4701 {
4702 m = gfc_match_pointer_assignment ();
4703 if (m == MATCH_ERROR)
4704 goto cleanup;
4705 if (m == MATCH_NO)
4706 goto syntax;
4707 }
4708
4709 c = gfc_get_code ();
4710 *c = new_st;
4711 c->loc = gfc_current_locus;
4712
4713 gfc_clear_new_st ();
4714 new_st.op = EXEC_FORALL;
4715 new_st.expr1 = mask;
4716 new_st.ext.forall_iterator = head;
4717 new_st.block = gfc_get_code ();
4718 new_st.block->op = EXEC_FORALL;
4719 new_st.block->next = c;
4720
4721 *st = ST_FORALL;
4722 return MATCH_YES;
4723
4724 syntax:
4725 gfc_syntax_error (ST_FORALL);
4726
4727 cleanup:
4728 gfc_free_forall_iterator (head);
4729 gfc_free_expr (mask);
4730 gfc_free_statements (c);
4731 return MATCH_NO;
4732 }