1 /* Copyright (C) 2002, 2003, 2004, 2005, 2007, 2008, 2009
2 Free Software Foundation, Inc.
3 Contributed by Andy Vaught
4 Namelist input contributed by Paul Thomas
5 F2003 I/O support contributed by Jerry DeLisle
7 This file is part of the GNU Fortran 95 runtime library (libgfortran).
9 Libgfortran is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 Libgfortran is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 Under Section 7 of GPL version 3, you are granted additional
20 permissions described in the GCC Runtime Library Exception, version
21 3.1, as published by the Free Software Foundation.
23 You should have received a copy of the GNU General Public License and
24 a copy of the GCC Runtime Library Exception along with this program;
25 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
26 <http://www.gnu.org/licenses/>. */
35 /* List directed input. Several parsing subroutines are practically
36 reimplemented from formatted input, the reason being that there are
37 all kinds of small differences between formatted and list directed
41 /* Subroutines for reading characters from the input. Because a
42 repeat count is ambiguous with an integer, we have to read the
43 whole digit string before seeing if there is a '*' which signals
44 the repeat count. Since we can have a lot of potential leading
45 zeros, we have to be able to back up by arbitrary amount. Because
46 the input might not be seekable, we have to buffer the data
49 #define CASE_DIGITS case '0': case '1': case '2': case '3': case '4': \
50 case '5': case '6': case '7': case '8': case '9'
52 #define CASE_SEPARATORS case ' ': case ',': case '/': case '\n': case '\t': \
55 /* This macro assumes that we're operating on a variable. */
57 #define is_separator(c) (c == '/' || c == ',' || c == '\n' || c == ' ' \
58 || c == '\t' || c == '\r' || c == ';')
60 /* Maximum repeat count. Less than ten times the maximum signed int32. */
62 #define MAX_REPEAT 200000000
66 # define snprintf(str, size, ...) sprintf (str, __VA_ARGS__)
69 /* Save a character to a string buffer, enlarging it as necessary. */
72 push_char (st_parameter_dt
*dtp
, char c
)
76 if (dtp
->u
.p
.saved_string
== NULL
)
78 dtp
->u
.p
.saved_string
= get_mem (SCRATCH_SIZE
);
79 // memset below should be commented out.
80 memset (dtp
->u
.p
.saved_string
, 0, SCRATCH_SIZE
);
81 dtp
->u
.p
.saved_length
= SCRATCH_SIZE
;
82 dtp
->u
.p
.saved_used
= 0;
85 if (dtp
->u
.p
.saved_used
>= dtp
->u
.p
.saved_length
)
87 dtp
->u
.p
.saved_length
= 2 * dtp
->u
.p
.saved_length
;
88 new = realloc (dtp
->u
.p
.saved_string
, dtp
->u
.p
.saved_length
);
90 generate_error (&dtp
->common
, LIBERROR_OS
, NULL
);
91 dtp
->u
.p
.saved_string
= new;
93 // Also this should not be necessary.
94 memset (new + dtp
->u
.p
.saved_used
, 0,
95 dtp
->u
.p
.saved_length
- dtp
->u
.p
.saved_used
);
99 dtp
->u
.p
.saved_string
[dtp
->u
.p
.saved_used
++] = c
;
103 /* Free the input buffer if necessary. */
106 free_saved (st_parameter_dt
*dtp
)
108 if (dtp
->u
.p
.saved_string
== NULL
)
111 free_mem (dtp
->u
.p
.saved_string
);
113 dtp
->u
.p
.saved_string
= NULL
;
114 dtp
->u
.p
.saved_used
= 0;
118 /* Free the line buffer if necessary. */
121 free_line (st_parameter_dt
*dtp
)
123 dtp
->u
.p
.item_count
= 0;
124 dtp
->u
.p
.line_buffer_enabled
= 0;
126 if (dtp
->u
.p
.line_buffer
== NULL
)
129 free_mem (dtp
->u
.p
.line_buffer
);
130 dtp
->u
.p
.line_buffer
= NULL
;
135 next_char (st_parameter_dt
*dtp
)
142 if (dtp
->u
.p
.last_char
!= '\0')
145 c
= dtp
->u
.p
.last_char
;
146 dtp
->u
.p
.last_char
= '\0';
150 /* Read from line_buffer if enabled. */
152 if (dtp
->u
.p
.line_buffer_enabled
)
156 c
= dtp
->u
.p
.line_buffer
[dtp
->u
.p
.item_count
];
157 if (c
!= '\0' && dtp
->u
.p
.item_count
< 64)
159 dtp
->u
.p
.line_buffer
[dtp
->u
.p
.item_count
] = '\0';
160 dtp
->u
.p
.item_count
++;
164 dtp
->u
.p
.item_count
= 0;
165 dtp
->u
.p
.line_buffer_enabled
= 0;
168 /* Handle the end-of-record and end-of-file conditions for
169 internal array unit. */
170 if (is_array_io (dtp
))
173 longjmp (*dtp
->u
.p
.eof_jump
, 1);
175 /* Check for "end-of-record" condition. */
176 if (dtp
->u
.p
.current_unit
->bytes_left
== 0)
181 record
= next_array_record (dtp
, dtp
->u
.p
.current_unit
->ls
,
184 /* Check for "end-of-file" condition. */
191 record
*= dtp
->u
.p
.current_unit
->recl
;
192 if (sseek (dtp
->u
.p
.current_unit
->s
, record
, SEEK_SET
) < 0)
193 longjmp (*dtp
->u
.p
.eof_jump
, 1);
195 dtp
->u
.p
.current_unit
->bytes_left
= dtp
->u
.p
.current_unit
->recl
;
200 /* Get the next character and handle end-of-record conditions. */
202 if (is_internal_unit (dtp
))
204 length
= sread (dtp
->u
.p
.current_unit
->s
, &c
, 1);
207 generate_error (&dtp
->common
, LIBERROR_OS
, NULL
);
211 if (is_array_io (dtp
))
213 /* Check whether we hit EOF. */
216 generate_error (&dtp
->common
, LIBERROR_INTERNAL_UNIT
, NULL
);
219 dtp
->u
.p
.current_unit
->bytes_left
--;
224 longjmp (*dtp
->u
.p
.eof_jump
, 1);
234 cc
= fbuf_getc (dtp
->u
.p
.current_unit
);
238 if (dtp
->u
.p
.current_unit
->endfile
== AT_ENDFILE
)
239 longjmp (*dtp
->u
.p
.eof_jump
, 1);
240 dtp
->u
.p
.current_unit
->endfile
= AT_ENDFILE
;
245 if (is_stream_io (dtp
) && cc
!= EOF
)
246 dtp
->u
.p
.current_unit
->strm_pos
++;
250 dtp
->u
.p
.at_eol
= (c
== '\n' || c
== '\r');
255 /* Push a character back onto the input. */
258 unget_char (st_parameter_dt
*dtp
, char c
)
260 dtp
->u
.p
.last_char
= c
;
264 /* Skip over spaces in the input. Returns the nonspace character that
265 terminated the eating and also places it back on the input. */
268 eat_spaces (st_parameter_dt
*dtp
)
276 while (c
== ' ' || c
== '\t');
283 /* This function reads characters through to the end of the current line and
284 just ignores them. */
287 eat_line (st_parameter_dt
*dtp
)
290 if (!is_internal_unit (dtp
))
297 /* Skip over a separator. Technically, we don't always eat the whole
298 separator. This is because if we've processed the last input item,
299 then a separator is unnecessary. Plus the fact that operating
300 systems usually deliver console input on a line basis.
302 The upshot is that if we see a newline as part of reading a
303 separator, we stop reading. If there are more input items, we
304 continue reading the separator with finish_separator() which takes
305 care of the fact that we may or may not have seen a comma as part
309 eat_separator (st_parameter_dt
*dtp
)
314 dtp
->u
.p
.comma_flag
= 0;
320 if (dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
327 dtp
->u
.p
.comma_flag
= 1;
332 dtp
->u
.p
.input_complete
= 1;
346 if (dtp
->u
.p
.namelist_mode
)
362 while (c
== '\n' || c
== '\r' || c
== ' ' || c
== '\t');
368 if (dtp
->u
.p
.namelist_mode
)
369 { /* Eat a namelist comment. */
377 /* Fall Through... */
386 /* Finish processing a separator that was interrupted by a newline.
387 If we're here, then another data item is present, so we finish what
388 we started on the previous line. */
391 finish_separator (st_parameter_dt
*dtp
)
402 if (dtp
->u
.p
.comma_flag
)
406 c
= eat_spaces (dtp
);
407 if (c
== '\n' || c
== '\r')
414 dtp
->u
.p
.input_complete
= 1;
415 if (!dtp
->u
.p
.namelist_mode
)
424 if (dtp
->u
.p
.namelist_mode
)
440 /* This function is needed to catch bad conversions so that namelist can
441 attempt to see if dtp->u.p.saved_string contains a new object name rather
445 nml_bad_return (st_parameter_dt
*dtp
, char c
)
447 if (dtp
->u
.p
.namelist_mode
)
449 dtp
->u
.p
.nml_read_error
= 1;
456 /* Convert an unsigned string to an integer. The length value is -1
457 if we are working on a repeat count. Returns nonzero if we have a
458 range problem. As a side effect, frees the dtp->u.p.saved_string. */
461 convert_integer (st_parameter_dt
*dtp
, int length
, int negative
)
463 char c
, *buffer
, message
[100];
465 GFC_INTEGER_LARGEST v
, max
, max10
;
467 buffer
= dtp
->u
.p
.saved_string
;
470 max
= (length
== -1) ? MAX_REPEAT
: max_value (length
, 1);
495 set_integer (dtp
->u
.p
.value
, v
, length
);
499 dtp
->u
.p
.repeat_count
= v
;
501 if (dtp
->u
.p
.repeat_count
== 0)
503 sprintf (message
, "Zero repeat count in item %d of list input",
504 dtp
->u
.p
.item_count
);
506 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
516 sprintf (message
, "Repeat count overflow in item %d of list input",
517 dtp
->u
.p
.item_count
);
519 sprintf (message
, "Integer overflow while reading item %d",
520 dtp
->u
.p
.item_count
);
523 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
529 /* Parse a repeat count for logical and complex values which cannot
530 begin with a digit. Returns nonzero if we are done, zero if we
531 should continue on. */
534 parse_repeat (st_parameter_dt
*dtp
)
536 char c
, message
[100];
562 repeat
= 10 * repeat
+ c
- '0';
564 if (repeat
> MAX_REPEAT
)
567 "Repeat count overflow in item %d of list input",
568 dtp
->u
.p
.item_count
);
570 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
580 "Zero repeat count in item %d of list input",
581 dtp
->u
.p
.item_count
);
583 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
595 dtp
->u
.p
.repeat_count
= repeat
;
602 sprintf (message
, "Bad repeat count in item %d of list input",
603 dtp
->u
.p
.item_count
);
604 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
609 /* To read a logical we have to look ahead in the input stream to make sure
610 there is not an equal sign indicating a variable name. To do this we use
611 line_buffer to point to a temporary buffer, pushing characters there for
612 possible later reading. */
615 l_push_char (st_parameter_dt
*dtp
, char c
)
617 if (dtp
->u
.p
.line_buffer
== NULL
)
619 dtp
->u
.p
.line_buffer
= get_mem (SCRATCH_SIZE
);
620 memset (dtp
->u
.p
.line_buffer
, 0, SCRATCH_SIZE
);
623 dtp
->u
.p
.line_buffer
[dtp
->u
.p
.item_count
++] = c
;
627 /* Read a logical character on the input. */
630 read_logical (st_parameter_dt
*dtp
, int length
)
632 char c
, message
[100];
635 if (parse_repeat (dtp
))
638 c
= tolower (next_char (dtp
));
639 l_push_char (dtp
, c
);
645 l_push_char (dtp
, c
);
647 if (!is_separator(c
))
655 l_push_char (dtp
, c
);
657 if (!is_separator(c
))
664 c
= tolower (next_char (dtp
));
682 return; /* Null value. */
685 /* Save the character in case it is the beginning
686 of the next object name. */
691 dtp
->u
.p
.saved_type
= BT_LOGICAL
;
692 dtp
->u
.p
.saved_length
= length
;
694 /* Eat trailing garbage. */
699 while (!is_separator (c
));
703 set_integer ((int *) dtp
->u
.p
.value
, v
, length
);
710 for(i
= 0; i
< 63; i
++)
715 /* All done if this is not a namelist read. */
716 if (!dtp
->u
.p
.namelist_mode
)
729 l_push_char (dtp
, c
);
732 dtp
->u
.p
.nml_read_error
= 1;
733 dtp
->u
.p
.line_buffer_enabled
= 1;
734 dtp
->u
.p
.item_count
= 0;
744 if (nml_bad_return (dtp
, c
))
749 sprintf (message
, "Bad logical value while reading item %d",
750 dtp
->u
.p
.item_count
);
751 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
756 dtp
->u
.p
.saved_type
= BT_LOGICAL
;
757 dtp
->u
.p
.saved_length
= length
;
758 set_integer ((int *) dtp
->u
.p
.value
, v
, length
);
764 /* Reading integers is tricky because we can actually be reading a
765 repeat count. We have to store the characters in a buffer because
766 we could be reading an integer that is larger than the default int
767 used for repeat counts. */
770 read_integer (st_parameter_dt
*dtp
, int length
)
772 char c
, message
[100];
782 /* Fall through... */
788 CASE_SEPARATORS
: /* Single null. */
801 /* Take care of what may be a repeat count. */
813 push_char (dtp
, '\0');
816 CASE_SEPARATORS
: /* Not a repeat count. */
825 if (convert_integer (dtp
, -1, 0))
828 /* Get the real integer. */
843 /* Fall through... */
874 if (nml_bad_return (dtp
, c
))
879 sprintf (message
, "Bad integer for item %d in list input",
880 dtp
->u
.p
.item_count
);
881 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
889 push_char (dtp
, '\0');
890 if (convert_integer (dtp
, length
, negative
))
897 dtp
->u
.p
.saved_type
= BT_INTEGER
;
901 /* Read a character variable. */
904 read_character (st_parameter_dt
*dtp
, int length
__attribute__ ((unused
)))
906 char c
, quote
, message
[100];
908 quote
= ' '; /* Space means no quote character. */
918 unget_char (dtp
, c
); /* NULL value. */
928 if (dtp
->u
.p
.namelist_mode
)
938 /* Deal with a possible repeat count. */
951 goto done
; /* String was only digits! */
954 push_char (dtp
, '\0');
959 goto get_string
; /* Not a repeat count after all. */
964 if (convert_integer (dtp
, -1, 0))
967 /* Now get the real string. */
973 unget_char (dtp
, c
); /* Repeated NULL values. */
1001 /* See if we have a doubled quote character or the end of
1004 c
= next_char (dtp
);
1007 push_char (dtp
, quote
);
1011 unget_char (dtp
, c
);
1017 unget_char (dtp
, c
);
1021 if (c
!= '\n' && c
!= '\r')
1031 /* At this point, we have to have a separator, or else the string is
1034 c
= next_char (dtp
);
1035 if (is_separator (c
) || c
== '!')
1037 unget_char (dtp
, c
);
1038 eat_separator (dtp
);
1039 dtp
->u
.p
.saved_type
= BT_CHARACTER
;
1045 sprintf (message
, "Invalid string input in item %d",
1046 dtp
->u
.p
.item_count
);
1047 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1052 /* Parse a component of a complex constant or a real number that we
1053 are sure is already there. This is a straight real number parser. */
1056 parse_real (st_parameter_dt
*dtp
, void *buffer
, int length
)
1058 char c
, message
[100];
1061 c
= next_char (dtp
);
1062 if (c
== '-' || c
== '+')
1065 c
= next_char (dtp
);
1068 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1071 if (!isdigit (c
) && c
!= '.')
1073 if (c
== 'i' || c
== 'I' || c
== 'n' || c
== 'N')
1081 seen_dp
= (c
== '.') ? 1 : 0;
1085 c
= next_char (dtp
);
1086 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1106 push_char (dtp
, 'e');
1111 push_char (dtp
, 'e');
1113 c
= next_char (dtp
);
1117 unget_char (dtp
, c
);
1126 c
= next_char (dtp
);
1127 if (c
!= '-' && c
!= '+')
1128 push_char (dtp
, '+');
1132 c
= next_char (dtp
);
1143 c
= next_char (dtp
);
1151 unget_char (dtp
, c
);
1160 unget_char (dtp
, c
);
1161 push_char (dtp
, '\0');
1163 m
= convert_real (dtp
, buffer
, dtp
->u
.p
.saved_string
, length
);
1169 /* Match INF and Infinity. */
1170 if ((c
== 'i' || c
== 'I')
1171 && ((c
= next_char (dtp
)) == 'n' || c
== 'N')
1172 && ((c
= next_char (dtp
)) == 'f' || c
== 'F'))
1174 c
= next_char (dtp
);
1175 if ((c
!= 'i' && c
!= 'I')
1176 || ((c
== 'i' || c
== 'I')
1177 && ((c
= next_char (dtp
)) == 'n' || c
== 'N')
1178 && ((c
= next_char (dtp
)) == 'i' || c
== 'I')
1179 && ((c
= next_char (dtp
)) == 't' || c
== 'T')
1180 && ((c
= next_char (dtp
)) == 'y' || c
== 'Y')
1181 && (c
= next_char (dtp
))))
1183 if (is_separator (c
))
1184 unget_char (dtp
, c
);
1185 push_char (dtp
, 'i');
1186 push_char (dtp
, 'n');
1187 push_char (dtp
, 'f');
1191 else if (((c
= next_char (dtp
)) == 'a' || c
== 'A')
1192 && ((c
= next_char (dtp
)) == 'n' || c
== 'N')
1193 && (c
= next_char (dtp
)))
1195 if (is_separator (c
))
1196 unget_char (dtp
, c
);
1197 push_char (dtp
, 'n');
1198 push_char (dtp
, 'a');
1199 push_char (dtp
, 'n');
1205 if (nml_bad_return (dtp
, c
))
1210 sprintf (message
, "Bad floating point number for item %d",
1211 dtp
->u
.p
.item_count
);
1212 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1218 /* Reading a complex number is straightforward because we can tell
1219 what it is right away. */
1222 read_complex (st_parameter_dt
*dtp
, int kind
, size_t size
)
1227 if (parse_repeat (dtp
))
1230 c
= next_char (dtp
);
1237 unget_char (dtp
, c
);
1238 eat_separator (dtp
);
1246 if (parse_real (dtp
, dtp
->u
.p
.value
, kind
))
1251 c
= next_char (dtp
);
1252 if (c
== '\n' || c
== '\r')
1255 unget_char (dtp
, c
);
1258 != (dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_POINT
? ',' : ';'))
1263 c
= next_char (dtp
);
1264 if (c
== '\n' || c
== '\r')
1267 unget_char (dtp
, c
);
1269 if (parse_real (dtp
, dtp
->u
.p
.value
+ size
/ 2, kind
))
1273 if (next_char (dtp
) != ')')
1276 c
= next_char (dtp
);
1277 if (!is_separator (c
))
1280 unget_char (dtp
, c
);
1281 eat_separator (dtp
);
1284 dtp
->u
.p
.saved_type
= BT_COMPLEX
;
1289 if (nml_bad_return (dtp
, c
))
1294 sprintf (message
, "Bad complex value in item %d of list input",
1295 dtp
->u
.p
.item_count
);
1296 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1300 /* Parse a real number with a possible repeat count. */
1303 read_real (st_parameter_dt
*dtp
, int length
)
1305 char c
, message
[100];
1311 c
= next_char (dtp
);
1312 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1330 unget_char (dtp
, c
); /* Single null. */
1331 eat_separator (dtp
);
1344 /* Get the digit string that might be a repeat count. */
1348 c
= next_char (dtp
);
1349 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1373 push_char (dtp
, 'e');
1375 c
= next_char (dtp
);
1379 push_char (dtp
, '\0');
1383 if (c
!= '\n' && c
!= ',' && c
!= '\r' && c
!= ';')
1384 unget_char (dtp
, c
);
1393 if (convert_integer (dtp
, -1, 0))
1396 /* Now get the number itself. */
1398 c
= next_char (dtp
);
1399 if (is_separator (c
))
1400 { /* Repeated null value. */
1401 unget_char (dtp
, c
);
1402 eat_separator (dtp
);
1406 if (c
!= '-' && c
!= '+')
1407 push_char (dtp
, '+');
1412 c
= next_char (dtp
);
1415 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1418 if (!isdigit (c
) && c
!= '.')
1420 if (c
== 'i' || c
== 'I' || c
== 'n' || c
== 'N')
1439 c
= next_char (dtp
);
1440 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1467 push_char (dtp
, 'e');
1469 c
= next_char (dtp
);
1478 push_char (dtp
, 'e');
1480 c
= next_char (dtp
);
1481 if (c
!= '+' && c
!= '-')
1482 push_char (dtp
, '+');
1486 c
= next_char (dtp
);
1496 c
= next_char (dtp
);
1513 unget_char (dtp
, c
);
1514 eat_separator (dtp
);
1515 push_char (dtp
, '\0');
1516 if (convert_real (dtp
, dtp
->u
.p
.value
, dtp
->u
.p
.saved_string
, length
))
1520 dtp
->u
.p
.saved_type
= BT_REAL
;
1524 l_push_char (dtp
, c
);
1527 /* Match INF and Infinity. */
1528 if (c
== 'i' || c
== 'I')
1530 c
= next_char (dtp
);
1531 l_push_char (dtp
, c
);
1532 if (c
!= 'n' && c
!= 'N')
1534 c
= next_char (dtp
);
1535 l_push_char (dtp
, c
);
1536 if (c
!= 'f' && c
!= 'F')
1538 c
= next_char (dtp
);
1539 l_push_char (dtp
, c
);
1540 if (!is_separator (c
))
1542 if (c
!= 'i' && c
!= 'I')
1544 c
= next_char (dtp
);
1545 l_push_char (dtp
, c
);
1546 if (c
!= 'n' && c
!= 'N')
1548 c
= next_char (dtp
);
1549 l_push_char (dtp
, c
);
1550 if (c
!= 'i' && c
!= 'I')
1552 c
= next_char (dtp
);
1553 l_push_char (dtp
, c
);
1554 if (c
!= 't' && c
!= 'T')
1556 c
= next_char (dtp
);
1557 l_push_char (dtp
, c
);
1558 if (c
!= 'y' && c
!= 'Y')
1560 c
= next_char (dtp
);
1561 l_push_char (dtp
, c
);
1567 c
= next_char (dtp
);
1568 l_push_char (dtp
, c
);
1569 if (c
!= 'a' && c
!= 'A')
1571 c
= next_char (dtp
);
1572 l_push_char (dtp
, c
);
1573 if (c
!= 'n' && c
!= 'N')
1575 c
= next_char (dtp
);
1576 l_push_char (dtp
, c
);
1579 if (!is_separator (c
))
1582 if (dtp
->u
.p
.namelist_mode
)
1584 if (c
== ' ' || c
=='\n' || c
== '\r')
1587 c
= next_char (dtp
);
1588 while (c
== ' ' || c
=='\n' || c
== '\r');
1590 l_push_char (dtp
, c
);
1599 push_char (dtp
, 'i');
1600 push_char (dtp
, 'n');
1601 push_char (dtp
, 'f');
1605 push_char (dtp
, 'n');
1606 push_char (dtp
, 'a');
1607 push_char (dtp
, 'n');
1614 if (dtp
->u
.p
.namelist_mode
)
1616 dtp
->u
.p
.nml_read_error
= 1;
1617 dtp
->u
.p
.line_buffer_enabled
= 1;
1618 dtp
->u
.p
.item_count
= 0;
1624 if (nml_bad_return (dtp
, c
))
1629 sprintf (message
, "Bad real number in item %d of list input",
1630 dtp
->u
.p
.item_count
);
1631 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1635 /* Check the current type against the saved type to make sure they are
1636 compatible. Returns nonzero if incompatible. */
1639 check_type (st_parameter_dt
*dtp
, bt type
, int len
)
1643 if (dtp
->u
.p
.saved_type
!= BT_NULL
&& dtp
->u
.p
.saved_type
!= type
)
1645 sprintf (message
, "Read type %s where %s was expected for item %d",
1646 type_name (dtp
->u
.p
.saved_type
), type_name (type
),
1647 dtp
->u
.p
.item_count
);
1649 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1653 if (dtp
->u
.p
.saved_type
== BT_NULL
|| dtp
->u
.p
.saved_type
== BT_CHARACTER
)
1656 if (dtp
->u
.p
.saved_length
!= len
)
1659 "Read kind %d %s where kind %d is required for item %d",
1660 dtp
->u
.p
.saved_length
, type_name (dtp
->u
.p
.saved_type
), len
,
1661 dtp
->u
.p
.item_count
);
1662 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1670 /* Top level data transfer subroutine for list reads. Because we have
1671 to deal with repeat counts, the data item is always saved after
1672 reading, usually in the dtp->u.p.value[] array. If a repeat count is
1673 greater than one, we copy the data item multiple times. */
1676 list_formatted_read_scalar (st_parameter_dt
*dtp
, volatile bt type
, void *p
,
1677 int kind
, size_t size
)
1684 dtp
->u
.p
.namelist_mode
= 0;
1686 dtp
->u
.p
.eof_jump
= &eof_jump
;
1687 if (setjmp (eof_jump
))
1689 generate_error (&dtp
->common
, LIBERROR_END
, NULL
);
1693 if (dtp
->u
.p
.first_item
)
1695 dtp
->u
.p
.first_item
= 0;
1696 dtp
->u
.p
.input_complete
= 0;
1697 dtp
->u
.p
.repeat_count
= 1;
1698 dtp
->u
.p
.at_eol
= 0;
1700 c
= eat_spaces (dtp
);
1701 if (is_separator (c
))
1703 /* Found a null value. */
1704 eat_separator (dtp
);
1705 dtp
->u
.p
.repeat_count
= 0;
1707 /* eat_separator sets this flag if the separator was a comma. */
1708 if (dtp
->u
.p
.comma_flag
)
1711 /* eat_separator sets this flag if the separator was a \n or \r. */
1712 if (dtp
->u
.p
.at_eol
)
1713 finish_separator (dtp
);
1721 if (dtp
->u
.p
.repeat_count
> 0)
1723 if (check_type (dtp
, type
, kind
))
1728 if (dtp
->u
.p
.input_complete
)
1731 if (dtp
->u
.p
.input_complete
)
1734 if (dtp
->u
.p
.at_eol
)
1735 finish_separator (dtp
);
1739 /* Trailing spaces prior to end of line. */
1740 if (dtp
->u
.p
.at_eol
)
1741 finish_separator (dtp
);
1744 dtp
->u
.p
.saved_type
= BT_NULL
;
1745 dtp
->u
.p
.repeat_count
= 1;
1751 read_integer (dtp
, kind
);
1754 read_logical (dtp
, kind
);
1757 read_character (dtp
, kind
);
1760 read_real (dtp
, kind
);
1763 read_complex (dtp
, kind
, size
);
1766 internal_error (&dtp
->common
, "Bad type for list read");
1769 if (dtp
->u
.p
.saved_type
!= BT_CHARACTER
&& dtp
->u
.p
.saved_type
!= BT_NULL
)
1770 dtp
->u
.p
.saved_length
= size
;
1772 if ((dtp
->common
.flags
& IOPARM_LIBRETURN_MASK
) != IOPARM_LIBRETURN_OK
)
1776 switch (dtp
->u
.p
.saved_type
)
1782 memcpy (p
, dtp
->u
.p
.value
, size
);
1786 if (dtp
->u
.p
.saved_string
)
1788 m
= ((int) size
< dtp
->u
.p
.saved_used
)
1789 ? (int) size
: dtp
->u
.p
.saved_used
;
1791 memcpy (p
, dtp
->u
.p
.saved_string
, m
);
1794 q
= (gfc_char4_t
*) p
;
1795 for (i
= 0; i
< m
; i
++)
1796 q
[i
] = (unsigned char) dtp
->u
.p
.saved_string
[i
];
1800 /* Just delimiters encountered, nothing to copy but SPACE. */
1806 memset (((char *) p
) + m
, ' ', size
- m
);
1809 q
= (gfc_char4_t
*) p
;
1810 for (i
= m
; i
< (int) size
; i
++)
1811 q
[i
] = (unsigned char) ' ';
1820 if (--dtp
->u
.p
.repeat_count
<= 0)
1824 dtp
->u
.p
.eof_jump
= NULL
;
1829 list_formatted_read (st_parameter_dt
*dtp
, bt type
, void *p
, int kind
,
1830 size_t size
, size_t nelems
)
1834 size_t stride
= type
== BT_CHARACTER
?
1835 size
* GFC_SIZE_OF_CHAR_KIND(kind
) : size
;
1839 /* Big loop over all the elements. */
1840 for (elem
= 0; elem
< nelems
; elem
++)
1842 dtp
->u
.p
.item_count
++;
1843 list_formatted_read_scalar (dtp
, type
, tmp
+ stride
*elem
, kind
, size
);
1848 /* Finish a list read. */
1851 finish_list_read (st_parameter_dt
*dtp
)
1857 fbuf_flush (dtp
->u
.p
.current_unit
, dtp
->u
.p
.mode
);
1859 if (dtp
->u
.p
.at_eol
)
1861 dtp
->u
.p
.at_eol
= 0;
1867 c
= next_char (dtp
);
1871 if (dtp
->u
.p
.current_unit
->endfile
!= NO_ENDFILE
)
1873 generate_error (&dtp
->common
, LIBERROR_END
, NULL
);
1874 dtp
->u
.p
.current_unit
->endfile
= AFTER_ENDFILE
;
1875 dtp
->u
.p
.current_unit
->current_record
= 0;
1881 void namelist_read (st_parameter_dt *dtp)
1883 static void nml_match_name (char *name, int len)
1884 static int nml_query (st_parameter_dt *dtp)
1885 static int nml_get_obj_data (st_parameter_dt *dtp,
1886 namelist_info **prev_nl, char *, size_t)
1888 static void nml_untouch_nodes (st_parameter_dt *dtp)
1889 static namelist_info * find_nml_node (st_parameter_dt *dtp,
1891 static int nml_parse_qualifier(descriptor_dimension * ad,
1892 array_loop_spec * ls, int rank, char *)
1893 static void nml_touch_nodes (namelist_info * nl)
1894 static int nml_read_obj (namelist_info *nl, index_type offset,
1895 namelist_info **prev_nl, char *, size_t,
1896 index_type clow, index_type chigh)
1900 /* Inputs a rank-dimensional qualifier, which can contain
1901 singlets, doublets, triplets or ':' with the standard meanings. */
1904 nml_parse_qualifier (st_parameter_dt
*dtp
, descriptor_dimension
*ad
,
1905 array_loop_spec
*ls
, int rank
, char *parse_err_msg
,
1912 int is_array_section
, is_char
;
1916 is_array_section
= 0;
1917 dtp
->u
.p
.expanded_read
= 0;
1919 /* See if this is a character substring qualifier we are looking for. */
1926 /* The next character in the stream should be the '('. */
1928 c
= next_char (dtp
);
1930 /* Process the qualifier, by dimension and triplet. */
1932 for (dim
=0; dim
< rank
; dim
++ )
1934 for (indx
=0; indx
<3; indx
++)
1940 /* Process a potential sign. */
1941 c
= next_char (dtp
);
1952 unget_char (dtp
, c
);
1956 /* Process characters up to the next ':' , ',' or ')'. */
1959 c
= next_char (dtp
);
1964 is_array_section
= 1;
1968 if ((c
==',' && dim
== rank
-1)
1969 || (c
==')' && dim
< rank
-1))
1972 sprintf (parse_err_msg
, "Bad substring qualifier");
1974 sprintf (parse_err_msg
, "Bad number of index fields");
1983 case ' ': case '\t':
1985 c
= next_char (dtp
);
1990 sprintf (parse_err_msg
,
1991 "Bad character in substring qualifier");
1993 sprintf (parse_err_msg
, "Bad character in index");
1997 if ((c
== ',' || c
== ')') && indx
== 0
1998 && dtp
->u
.p
.saved_string
== 0)
2001 sprintf (parse_err_msg
, "Null substring qualifier");
2003 sprintf (parse_err_msg
, "Null index field");
2007 if ((c
== ':' && indx
== 1 && dtp
->u
.p
.saved_string
== 0)
2008 || (indx
== 2 && dtp
->u
.p
.saved_string
== 0))
2011 sprintf (parse_err_msg
, "Bad substring qualifier");
2013 sprintf (parse_err_msg
, "Bad index triplet");
2017 if (is_char
&& !is_array_section
)
2019 sprintf (parse_err_msg
,
2020 "Missing colon in substring qualifier");
2024 /* If '( : ? )' or '( ? : )' break and flag read failure. */
2026 if ((c
== ':' && indx
== 0 && dtp
->u
.p
.saved_string
== 0)
2027 || (indx
==1 && dtp
->u
.p
.saved_string
== 0))
2033 /* Now read the index. */
2034 if (convert_integer (dtp
, sizeof(ssize_t
), neg
))
2037 sprintf (parse_err_msg
, "Bad integer substring qualifier");
2039 sprintf (parse_err_msg
, "Bad integer in index");
2045 /* Feed the index values to the triplet arrays. */
2049 memcpy (&ls
[dim
].start
, dtp
->u
.p
.value
, sizeof(ssize_t
));
2051 memcpy (&ls
[dim
].end
, dtp
->u
.p
.value
, sizeof(ssize_t
));
2053 memcpy (&ls
[dim
].step
, dtp
->u
.p
.value
, sizeof(ssize_t
));
2056 /* Singlet or doublet indices. */
2057 if (c
==',' || c
==')')
2061 memcpy (&ls
[dim
].start
, dtp
->u
.p
.value
, sizeof(ssize_t
));
2063 /* If -std=f95/2003 or an array section is specified,
2064 do not allow excess data to be processed. */
2065 if (is_array_section
== 1
2066 || compile_options
.allow_std
< GFC_STD_GNU
)
2067 ls
[dim
].end
= ls
[dim
].start
;
2069 dtp
->u
.p
.expanded_read
= 1;
2072 /* Check for non-zero rank. */
2073 if (is_array_section
== 1 && ls
[dim
].start
!= ls
[dim
].end
)
2080 /* Check the values of the triplet indices. */
2081 if ((ls
[dim
].start
> (ssize_t
)ad
[dim
].ubound
)
2082 || (ls
[dim
].start
< (ssize_t
)ad
[dim
].lbound
)
2083 || (ls
[dim
].end
> (ssize_t
)ad
[dim
].ubound
)
2084 || (ls
[dim
].end
< (ssize_t
)ad
[dim
].lbound
))
2087 sprintf (parse_err_msg
, "Substring out of range");
2089 sprintf (parse_err_msg
, "Index %d out of range", dim
+ 1);
2093 if (((ls
[dim
].end
- ls
[dim
].start
) * ls
[dim
].step
< 0)
2094 || (ls
[dim
].step
== 0))
2096 sprintf (parse_err_msg
, "Bad range in index %d", dim
+ 1);
2100 /* Initialise the loop index counter. */
2101 ls
[dim
].idx
= ls
[dim
].start
;
2111 static namelist_info
*
2112 find_nml_node (st_parameter_dt
*dtp
, char * var_name
)
2114 namelist_info
* t
= dtp
->u
.p
.ionml
;
2117 if (strcmp (var_name
, t
->var_name
) == 0)
2127 /* Visits all the components of a derived type that have
2128 not explicitly been identified in the namelist input.
2129 touched is set and the loop specification initialised
2130 to default values */
2133 nml_touch_nodes (namelist_info
* nl
)
2135 index_type len
= strlen (nl
->var_name
) + 1;
2137 char * ext_name
= (char*)get_mem (len
+ 1);
2138 memcpy (ext_name
, nl
->var_name
, len
-1);
2139 memcpy (ext_name
+ len
- 1, "%", 2);
2140 for (nl
= nl
->next
; nl
; nl
= nl
->next
)
2142 if (strncmp (nl
->var_name
, ext_name
, len
) == 0)
2145 for (dim
=0; dim
< nl
->var_rank
; dim
++)
2147 nl
->ls
[dim
].step
= 1;
2148 nl
->ls
[dim
].end
= nl
->dim
[dim
].ubound
;
2149 nl
->ls
[dim
].start
= nl
->dim
[dim
].lbound
;
2150 nl
->ls
[dim
].idx
= nl
->ls
[dim
].start
;
2156 free_mem (ext_name
);
2160 /* Resets touched for the entire list of nml_nodes, ready for a
2164 nml_untouch_nodes (st_parameter_dt
*dtp
)
2167 for (t
= dtp
->u
.p
.ionml
; t
; t
= t
->next
)
2172 /* Attempts to input name to namelist name. Returns
2173 dtp->u.p.nml_read_error = 1 on no match. */
2176 nml_match_name (st_parameter_dt
*dtp
, const char *name
, index_type len
)
2180 dtp
->u
.p
.nml_read_error
= 0;
2181 for (i
= 0; i
< len
; i
++)
2183 c
= next_char (dtp
);
2184 if (tolower (c
) != tolower (name
[i
]))
2186 dtp
->u
.p
.nml_read_error
= 1;
2192 /* If the namelist read is from stdin, output the current state of the
2193 namelist to stdout. This is used to implement the non-standard query
2194 features, ? and =?. If c == '=' the full namelist is printed. Otherwise
2195 the names alone are printed. */
2198 nml_query (st_parameter_dt
*dtp
, char c
)
2200 gfc_unit
* temp_unit
;
2205 static const index_type endlen
= 3;
2206 static const char endl
[] = "\r\n";
2207 static const char nmlend
[] = "&end\r\n";
2209 static const index_type endlen
= 2;
2210 static const char endl
[] = "\n";
2211 static const char nmlend
[] = "&end\n";
2214 if (dtp
->u
.p
.current_unit
->unit_number
!= options
.stdin_unit
)
2217 /* Store the current unit and transfer to stdout. */
2219 temp_unit
= dtp
->u
.p
.current_unit
;
2220 dtp
->u
.p
.current_unit
= find_unit (options
.stdout_unit
);
2222 if (dtp
->u
.p
.current_unit
)
2224 dtp
->u
.p
.mode
= WRITING
;
2225 next_record (dtp
, 0);
2227 /* Write the namelist in its entirety. */
2230 namelist_write (dtp
);
2232 /* Or write the list of names. */
2236 /* "&namelist_name\n" */
2238 len
= dtp
->namelist_name_len
;
2239 p
= write_block (dtp
, len
+ endlen
);
2243 memcpy ((char*)(p
+ 1), dtp
->namelist_name
, len
);
2244 memcpy ((char*)(p
+ len
+ 1), &endl
, endlen
- 1);
2245 for (nl
= dtp
->u
.p
.ionml
; nl
; nl
= nl
->next
)
2249 len
= strlen (nl
->var_name
);
2250 p
= write_block (dtp
, len
+ endlen
);
2254 memcpy ((char*)(p
+ 1), nl
->var_name
, len
);
2255 memcpy ((char*)(p
+ len
+ 1), &endl
, endlen
- 1);
2260 p
= write_block (dtp
, endlen
+ 3);
2262 memcpy (p
, &nmlend
, endlen
+ 3);
2265 /* Flush the stream to force immediate output. */
2267 fbuf_flush (dtp
->u
.p
.current_unit
, WRITING
);
2268 sflush (dtp
->u
.p
.current_unit
->s
);
2269 unlock_unit (dtp
->u
.p
.current_unit
);
2274 /* Restore the current unit. */
2276 dtp
->u
.p
.current_unit
= temp_unit
;
2277 dtp
->u
.p
.mode
= READING
;
2281 /* Reads and stores the input for the namelist object nl. For an array,
2282 the function loops over the ranges defined by the loop specification.
2283 This default to all the data or to the specification from a qualifier.
2284 nml_read_obj recursively calls itself to read derived types. It visits
2285 all its own components but only reads data for those that were touched
2286 when the name was parsed. If a read error is encountered, an attempt is
2287 made to return to read a new object name because the standard allows too
2288 little data to be available. On the other hand, too much data is an
2292 nml_read_obj (st_parameter_dt
*dtp
, namelist_info
* nl
, index_type offset
,
2293 namelist_info
**pprev_nl
, char *nml_err_msg
,
2294 size_t nml_err_msg_size
, index_type clow
, index_type chigh
)
2296 namelist_info
* cmp
;
2303 size_t obj_name_len
;
2306 /* This object not touched in name parsing. */
2311 dtp
->u
.p
.repeat_count
= 0;
2317 case GFC_DTYPE_INTEGER
:
2318 case GFC_DTYPE_LOGICAL
:
2322 case GFC_DTYPE_REAL
:
2323 dlen
= size_from_real_kind (len
);
2326 case GFC_DTYPE_COMPLEX
:
2327 dlen
= size_from_complex_kind (len
);
2330 case GFC_DTYPE_CHARACTER
:
2331 dlen
= chigh
? (chigh
- clow
+ 1) : nl
->string_length
;
2340 /* Update the pointer to the data, using the current index vector */
2342 pdata
= (void*)(nl
->mem_pos
+ offset
);
2343 for (dim
= 0; dim
< nl
->var_rank
; dim
++)
2344 pdata
= (void*)(pdata
+ (nl
->ls
[dim
].idx
- nl
->dim
[dim
].lbound
) *
2345 nl
->dim
[dim
].stride
* nl
->size
);
2347 /* Reset the error flag and try to read next value, if
2348 dtp->u.p.repeat_count=0 */
2350 dtp
->u
.p
.nml_read_error
= 0;
2352 if (--dtp
->u
.p
.repeat_count
<= 0)
2354 if (dtp
->u
.p
.input_complete
)
2356 if (dtp
->u
.p
.at_eol
)
2357 finish_separator (dtp
);
2358 if (dtp
->u
.p
.input_complete
)
2361 /* GFC_TYPE_UNKNOWN through for nulls and is detected
2362 after the switch block. */
2364 dtp
->u
.p
.saved_type
= GFC_DTYPE_UNKNOWN
;
2369 case GFC_DTYPE_INTEGER
:
2370 read_integer (dtp
, len
);
2373 case GFC_DTYPE_LOGICAL
:
2374 read_logical (dtp
, len
);
2377 case GFC_DTYPE_CHARACTER
:
2378 read_character (dtp
, len
);
2381 case GFC_DTYPE_REAL
:
2382 read_real (dtp
, len
);
2385 case GFC_DTYPE_COMPLEX
:
2386 read_complex (dtp
, len
, dlen
);
2389 case GFC_DTYPE_DERIVED
:
2390 obj_name_len
= strlen (nl
->var_name
) + 1;
2391 obj_name
= get_mem (obj_name_len
+1);
2392 memcpy (obj_name
, nl
->var_name
, obj_name_len
-1);
2393 memcpy (obj_name
+ obj_name_len
- 1, "%", 2);
2395 /* If reading a derived type, disable the expanded read warning
2396 since a single object can have multiple reads. */
2397 dtp
->u
.p
.expanded_read
= 0;
2399 /* Now loop over the components. Update the component pointer
2400 with the return value from nml_write_obj. This loop jumps
2401 past nested derived types by testing if the potential
2402 component name contains '%'. */
2404 for (cmp
= nl
->next
;
2406 !strncmp (cmp
->var_name
, obj_name
, obj_name_len
) &&
2407 !strchr (cmp
->var_name
+ obj_name_len
, '%');
2411 if (nml_read_obj (dtp
, cmp
, (index_type
)(pdata
- nl
->mem_pos
),
2412 pprev_nl
, nml_err_msg
, nml_err_msg_size
,
2413 clow
, chigh
) == FAILURE
)
2415 free_mem (obj_name
);
2419 if (dtp
->u
.p
.input_complete
)
2421 free_mem (obj_name
);
2426 free_mem (obj_name
);
2430 snprintf (nml_err_msg
, nml_err_msg_size
,
2431 "Bad type for namelist object %s", nl
->var_name
);
2432 internal_error (&dtp
->common
, nml_err_msg
);
2437 /* The standard permits array data to stop short of the number of
2438 elements specified in the loop specification. In this case, we
2439 should be here with dtp->u.p.nml_read_error != 0. Control returns to
2440 nml_get_obj_data and an attempt is made to read object name. */
2443 if (dtp
->u
.p
.nml_read_error
)
2445 dtp
->u
.p
.expanded_read
= 0;
2449 if (dtp
->u
.p
.saved_type
== GFC_DTYPE_UNKNOWN
)
2451 dtp
->u
.p
.expanded_read
= 0;
2455 /* Note the switch from GFC_DTYPE_type to BT_type at this point.
2456 This comes about because the read functions return BT_types. */
2458 switch (dtp
->u
.p
.saved_type
)
2465 memcpy (pdata
, dtp
->u
.p
.value
, dlen
);
2469 m
= (dlen
< dtp
->u
.p
.saved_used
) ? dlen
: dtp
->u
.p
.saved_used
;
2470 pdata
= (void*)( pdata
+ clow
- 1 );
2471 memcpy (pdata
, dtp
->u
.p
.saved_string
, m
);
2473 memset ((void*)( pdata
+ m
), ' ', dlen
- m
);
2480 /* Warn if a non-standard expanded read occurs. A single read of a
2481 single object is acceptable. If a second read occurs, issue a warning
2482 and set the flag to zero to prevent further warnings. */
2483 if (dtp
->u
.p
.expanded_read
== 2)
2485 notify_std (&dtp
->common
, GFC_STD_GNU
, "Non-standard expanded namelist read.");
2486 dtp
->u
.p
.expanded_read
= 0;
2489 /* If the expanded read warning flag is set, increment it,
2490 indicating that a single read has occurred. */
2491 if (dtp
->u
.p
.expanded_read
>= 1)
2492 dtp
->u
.p
.expanded_read
++;
2494 /* Break out of loop if scalar. */
2498 /* Now increment the index vector. */
2503 for (dim
= 0; dim
< nl
->var_rank
; dim
++)
2505 nl
->ls
[dim
].idx
+= nml_carry
* nl
->ls
[dim
].step
;
2507 if (((nl
->ls
[dim
].step
> 0) && (nl
->ls
[dim
].idx
> nl
->ls
[dim
].end
))
2509 ((nl
->ls
[dim
].step
< 0) && (nl
->ls
[dim
].idx
< nl
->ls
[dim
].end
)))
2511 nl
->ls
[dim
].idx
= nl
->ls
[dim
].start
;
2515 } while (!nml_carry
);
2517 if (dtp
->u
.p
.repeat_count
> 1)
2519 snprintf (nml_err_msg
, nml_err_msg_size
,
2520 "Repeat count too large for namelist object %s", nl
->var_name
);
2530 /* Parses the object name, including array and substring qualifiers. It
2531 iterates over derived type components, touching those components and
2532 setting their loop specifications, if there is a qualifier. If the
2533 object is itself a derived type, its components and subcomponents are
2534 touched. nml_read_obj is called at the end and this reads the data in
2535 the manner specified by the object name. */
2538 nml_get_obj_data (st_parameter_dt
*dtp
, namelist_info
**pprev_nl
,
2539 char *nml_err_msg
, size_t nml_err_msg_size
)
2543 namelist_info
* first_nl
= NULL
;
2544 namelist_info
* root_nl
= NULL
;
2545 int dim
, parsed_rank
;
2547 index_type clow
, chigh
;
2548 int non_zero_rank_count
;
2550 /* Look for end of input or object name. If '?' or '=?' are encountered
2551 in stdin, print the node names or the namelist to stdout. */
2553 eat_separator (dtp
);
2554 if (dtp
->u
.p
.input_complete
)
2557 if (dtp
->u
.p
.at_eol
)
2558 finish_separator (dtp
);
2559 if (dtp
->u
.p
.input_complete
)
2562 c
= next_char (dtp
);
2566 c
= next_char (dtp
);
2569 sprintf (nml_err_msg
, "namelist read: misplaced = sign");
2572 nml_query (dtp
, '=');
2576 nml_query (dtp
, '?');
2581 nml_match_name (dtp
, "end", 3);
2582 if (dtp
->u
.p
.nml_read_error
)
2584 sprintf (nml_err_msg
, "namelist not terminated with / or &end");
2588 dtp
->u
.p
.input_complete
= 1;
2595 /* Untouch all nodes of the namelist and reset the flag that is set for
2596 derived type components. */
2598 nml_untouch_nodes (dtp
);
2600 non_zero_rank_count
= 0;
2602 /* Get the object name - should '!' and '\n' be permitted separators? */
2610 if (!is_separator (c
))
2611 push_char (dtp
, tolower(c
));
2612 c
= next_char (dtp
);
2613 } while (!( c
=='=' || c
==' ' || c
=='\t' || c
=='(' || c
=='%' ));
2615 unget_char (dtp
, c
);
2617 /* Check that the name is in the namelist and get pointer to object.
2618 Three error conditions exist: (i) An attempt is being made to
2619 identify a non-existent object, following a failed data read or
2620 (ii) The object name does not exist or (iii) Too many data items
2621 are present for an object. (iii) gives the same error message
2624 push_char (dtp
, '\0');
2628 size_t var_len
= strlen (root_nl
->var_name
);
2630 = dtp
->u
.p
.saved_string
? strlen (dtp
->u
.p
.saved_string
) : 0;
2631 char ext_name
[var_len
+ saved_len
+ 1];
2633 memcpy (ext_name
, root_nl
->var_name
, var_len
);
2634 if (dtp
->u
.p
.saved_string
)
2635 memcpy (ext_name
+ var_len
, dtp
->u
.p
.saved_string
, saved_len
);
2636 ext_name
[var_len
+ saved_len
] = '\0';
2637 nl
= find_nml_node (dtp
, ext_name
);
2640 nl
= find_nml_node (dtp
, dtp
->u
.p
.saved_string
);
2644 if (dtp
->u
.p
.nml_read_error
&& *pprev_nl
)
2645 snprintf (nml_err_msg
, nml_err_msg_size
,
2646 "Bad data for namelist object %s", (*pprev_nl
)->var_name
);
2649 snprintf (nml_err_msg
, nml_err_msg_size
,
2650 "Cannot match namelist object name %s",
2651 dtp
->u
.p
.saved_string
);
2656 /* Get the length, data length, base pointer and rank of the variable.
2657 Set the default loop specification first. */
2659 for (dim
=0; dim
< nl
->var_rank
; dim
++)
2661 nl
->ls
[dim
].step
= 1;
2662 nl
->ls
[dim
].end
= nl
->dim
[dim
].ubound
;
2663 nl
->ls
[dim
].start
= nl
->dim
[dim
].lbound
;
2664 nl
->ls
[dim
].idx
= nl
->ls
[dim
].start
;
2667 /* Check to see if there is a qualifier: if so, parse it.*/
2669 if (c
== '(' && nl
->var_rank
)
2672 if (nml_parse_qualifier (dtp
, nl
->dim
, nl
->ls
, nl
->var_rank
,
2673 nml_err_msg
, &parsed_rank
) == FAILURE
)
2675 char *nml_err_msg_end
= strchr (nml_err_msg
, '\0');
2676 snprintf (nml_err_msg_end
,
2677 nml_err_msg_size
- (nml_err_msg_end
- nml_err_msg
),
2678 " for namelist variable %s", nl
->var_name
);
2682 if (parsed_rank
> 0)
2683 non_zero_rank_count
++;
2685 c
= next_char (dtp
);
2686 unget_char (dtp
, c
);
2688 else if (nl
->var_rank
> 0)
2689 non_zero_rank_count
++;
2691 /* Now parse a derived type component. The root namelist_info address
2692 is backed up, as is the previous component level. The component flag
2693 is set and the iteration is made by jumping back to get_name. */
2697 if (nl
->type
!= GFC_DTYPE_DERIVED
)
2699 snprintf (nml_err_msg
, nml_err_msg_size
,
2700 "Attempt to get derived component for %s", nl
->var_name
);
2704 if (!component_flag
)
2709 c
= next_char (dtp
);
2713 /* Parse a character qualifier, if present. chigh = 0 is a default
2714 that signals that the string length = string_length. */
2719 if (c
== '(' && nl
->type
== GFC_DTYPE_CHARACTER
)
2721 descriptor_dimension chd
[1] = { {1, clow
, nl
->string_length
} };
2722 array_loop_spec ind
[1] = { {1, clow
, nl
->string_length
, 1} };
2724 if (nml_parse_qualifier (dtp
, chd
, ind
, -1, nml_err_msg
, &parsed_rank
)
2727 char *nml_err_msg_end
= strchr (nml_err_msg
, '\0');
2728 snprintf (nml_err_msg_end
,
2729 nml_err_msg_size
- (nml_err_msg_end
- nml_err_msg
),
2730 " for namelist variable %s", nl
->var_name
);
2734 clow
= ind
[0].start
;
2737 if (ind
[0].step
!= 1)
2739 snprintf (nml_err_msg
, nml_err_msg_size
,
2740 "Step not allowed in substring qualifier"
2741 " for namelist object %s", nl
->var_name
);
2745 c
= next_char (dtp
);
2746 unget_char (dtp
, c
);
2749 /* If a derived type touch its components and restore the root
2750 namelist_info if we have parsed a qualified derived type
2753 if (nl
->type
== GFC_DTYPE_DERIVED
)
2754 nml_touch_nodes (nl
);
2755 if (component_flag
&& nl
->var_rank
> 0)
2758 /* Make sure no extraneous qualifiers are there. */
2762 snprintf (nml_err_msg
, nml_err_msg_size
,
2763 "Qualifier for a scalar or non-character namelist object %s",
2768 /* Make sure there is no more than one non-zero rank object. */
2769 if (non_zero_rank_count
> 1)
2771 snprintf (nml_err_msg
, nml_err_msg_size
,
2772 "Multiple sub-objects with non-zero rank in namelist object %s",
2774 non_zero_rank_count
= 0;
2778 /* According to the standard, an equal sign MUST follow an object name. The
2779 following is possibly lax - it allows comments, blank lines and so on to
2780 intervene. eat_spaces (dtp); c = next_char (dtp); would be compliant*/
2784 eat_separator (dtp
);
2785 if (dtp
->u
.p
.input_complete
)
2788 if (dtp
->u
.p
.at_eol
)
2789 finish_separator (dtp
);
2790 if (dtp
->u
.p
.input_complete
)
2793 c
= next_char (dtp
);
2797 snprintf (nml_err_msg
, nml_err_msg_size
,
2798 "Equal sign must follow namelist object name %s",
2803 if (first_nl
!= NULL
&& first_nl
->var_rank
> 0)
2806 if (nml_read_obj (dtp
, nl
, 0, pprev_nl
, nml_err_msg
, nml_err_msg_size
,
2807 clow
, chigh
) == FAILURE
)
2817 /* Entry point for namelist input. Goes through input until namelist name
2818 is matched. Then cycles through nml_get_obj_data until the input is
2819 completed or there is an error. */
2822 namelist_read (st_parameter_dt
*dtp
)
2826 char nml_err_msg
[200];
2827 /* Pointer to the previously read object, in case attempt is made to read
2828 new object name. Should this fail, error message can give previous
2830 namelist_info
*prev_nl
= NULL
;
2832 dtp
->u
.p
.namelist_mode
= 1;
2833 dtp
->u
.p
.input_complete
= 0;
2834 dtp
->u
.p
.expanded_read
= 0;
2836 dtp
->u
.p
.eof_jump
= &eof_jump
;
2837 if (setjmp (eof_jump
))
2839 dtp
->u
.p
.eof_jump
= NULL
;
2840 generate_error (&dtp
->common
, LIBERROR_END
, NULL
);
2844 /* Look for &namelist_name . Skip all characters, testing for $nmlname.
2845 Exit on success or EOF. If '?' or '=?' encountered in stdin, print
2846 node names or namelist on stdout. */
2849 switch (c
= next_char (dtp
))
2860 c
= next_char (dtp
);
2862 nml_query (dtp
, '=');
2864 unget_char (dtp
, c
);
2868 nml_query (dtp
, '?');
2874 /* Match the name of the namelist. */
2876 nml_match_name (dtp
, dtp
->namelist_name
, dtp
->namelist_name_len
);
2878 if (dtp
->u
.p
.nml_read_error
)
2881 /* A trailing space is required, we give a little lattitude here, 10.9.1. */
2882 c
= next_char (dtp
);
2883 if (!is_separator(c
) && c
!= '!')
2885 unget_char (dtp
, c
);
2889 unget_char (dtp
, c
);
2890 eat_separator (dtp
);
2892 /* Ready to read namelist objects. If there is an error in input
2893 from stdin, output the error message and continue. */
2895 while (!dtp
->u
.p
.input_complete
)
2897 if (nml_get_obj_data (dtp
, &prev_nl
, nml_err_msg
, sizeof nml_err_msg
)
2902 if (dtp
->u
.p
.current_unit
->unit_number
!= options
.stdin_unit
)
2905 u
= find_unit (options
.stderr_unit
);
2906 st_printf ("%s\n", nml_err_msg
);
2916 dtp
->u
.p
.eof_jump
= NULL
;
2921 /* All namelist error calls return from here */
2925 dtp
->u
.p
.eof_jump
= NULL
;
2928 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, nml_err_msg
);