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/>. */
37 /* List directed input. Several parsing subroutines are practically
38 reimplemented from formatted input, the reason being that there are
39 all kinds of small differences between formatted and list directed
43 /* Subroutines for reading characters from the input. Because a
44 repeat count is ambiguous with an integer, we have to read the
45 whole digit string before seeing if there is a '*' which signals
46 the repeat count. Since we can have a lot of potential leading
47 zeros, we have to be able to back up by arbitrary amount. Because
48 the input might not be seekable, we have to buffer the data
51 #define CASE_DIGITS case '0': case '1': case '2': case '3': case '4': \
52 case '5': case '6': case '7': case '8': case '9'
54 #define CASE_SEPARATORS case ' ': case ',': case '/': case '\n': case '\t': \
57 /* This macro assumes that we're operating on a variable. */
59 #define is_separator(c) (c == '/' || c == ',' || c == '\n' || c == ' ' \
60 || c == '\t' || c == '\r' || c == ';')
62 /* Maximum repeat count. Less than ten times the maximum signed int32. */
64 #define MAX_REPEAT 200000000
68 # define snprintf(str, size, ...) sprintf (str, __VA_ARGS__)
71 /* Save a character to a string buffer, enlarging it as necessary. */
74 push_char (st_parameter_dt
*dtp
, char c
)
78 if (dtp
->u
.p
.saved_string
== NULL
)
80 dtp
->u
.p
.saved_string
= get_mem (SCRATCH_SIZE
);
81 // memset below should be commented out.
82 memset (dtp
->u
.p
.saved_string
, 0, SCRATCH_SIZE
);
83 dtp
->u
.p
.saved_length
= SCRATCH_SIZE
;
84 dtp
->u
.p
.saved_used
= 0;
87 if (dtp
->u
.p
.saved_used
>= dtp
->u
.p
.saved_length
)
89 dtp
->u
.p
.saved_length
= 2 * dtp
->u
.p
.saved_length
;
90 new = realloc (dtp
->u
.p
.saved_string
, dtp
->u
.p
.saved_length
);
92 generate_error (&dtp
->common
, LIBERROR_OS
, NULL
);
93 dtp
->u
.p
.saved_string
= new;
95 // Also this should not be necessary.
96 memset (new + dtp
->u
.p
.saved_used
, 0,
97 dtp
->u
.p
.saved_length
- dtp
->u
.p
.saved_used
);
101 dtp
->u
.p
.saved_string
[dtp
->u
.p
.saved_used
++] = c
;
105 /* Free the input buffer if necessary. */
108 free_saved (st_parameter_dt
*dtp
)
110 if (dtp
->u
.p
.saved_string
== NULL
)
113 free_mem (dtp
->u
.p
.saved_string
);
115 dtp
->u
.p
.saved_string
= NULL
;
116 dtp
->u
.p
.saved_used
= 0;
120 /* Free the line buffer if necessary. */
123 free_line (st_parameter_dt
*dtp
)
125 dtp
->u
.p
.item_count
= 0;
126 dtp
->u
.p
.line_buffer_enabled
= 0;
128 if (dtp
->u
.p
.line_buffer
== NULL
)
131 free_mem (dtp
->u
.p
.line_buffer
);
132 dtp
->u
.p
.line_buffer
= NULL
;
137 next_char (st_parameter_dt
*dtp
)
144 if (dtp
->u
.p
.last_char
!= '\0')
147 c
= dtp
->u
.p
.last_char
;
148 dtp
->u
.p
.last_char
= '\0';
152 /* Read from line_buffer if enabled. */
154 if (dtp
->u
.p
.line_buffer_enabled
)
158 c
= dtp
->u
.p
.line_buffer
[dtp
->u
.p
.item_count
];
159 if (c
!= '\0' && dtp
->u
.p
.item_count
< 64)
161 dtp
->u
.p
.line_buffer
[dtp
->u
.p
.item_count
] = '\0';
162 dtp
->u
.p
.item_count
++;
166 dtp
->u
.p
.item_count
= 0;
167 dtp
->u
.p
.line_buffer_enabled
= 0;
170 /* Handle the end-of-record and end-of-file conditions for
171 internal array unit. */
172 if (is_array_io (dtp
))
175 longjmp (*dtp
->u
.p
.eof_jump
, 1);
177 /* Check for "end-of-record" condition. */
178 if (dtp
->u
.p
.current_unit
->bytes_left
== 0)
183 record
= next_array_record (dtp
, dtp
->u
.p
.current_unit
->ls
,
186 /* Check for "end-of-file" condition. */
193 record
*= dtp
->u
.p
.current_unit
->recl
;
194 if (sseek (dtp
->u
.p
.current_unit
->s
, record
, SEEK_SET
) < 0)
195 longjmp (*dtp
->u
.p
.eof_jump
, 1);
197 dtp
->u
.p
.current_unit
->bytes_left
= dtp
->u
.p
.current_unit
->recl
;
202 /* Get the next character and handle end-of-record conditions. */
204 if (is_internal_unit (dtp
))
206 length
= sread (dtp
->u
.p
.current_unit
->s
, &c
, 1);
209 generate_error (&dtp
->common
, LIBERROR_OS
, NULL
);
213 if (is_array_io (dtp
))
215 /* Check whether we hit EOF. */
218 generate_error (&dtp
->common
, LIBERROR_INTERNAL_UNIT
, NULL
);
221 dtp
->u
.p
.current_unit
->bytes_left
--;
226 longjmp (*dtp
->u
.p
.eof_jump
, 1);
236 cc
= fbuf_getc (dtp
->u
.p
.current_unit
);
240 if (dtp
->u
.p
.current_unit
->endfile
== AT_ENDFILE
)
241 longjmp (*dtp
->u
.p
.eof_jump
, 1);
242 dtp
->u
.p
.current_unit
->endfile
= AT_ENDFILE
;
247 if (is_stream_io (dtp
) && cc
!= EOF
)
248 dtp
->u
.p
.current_unit
->strm_pos
++;
252 dtp
->u
.p
.at_eol
= (c
== '\n' || c
== '\r');
257 /* Push a character back onto the input. */
260 unget_char (st_parameter_dt
*dtp
, char c
)
262 dtp
->u
.p
.last_char
= c
;
266 /* Skip over spaces in the input. Returns the nonspace character that
267 terminated the eating and also places it back on the input. */
270 eat_spaces (st_parameter_dt
*dtp
)
278 while (c
== ' ' || c
== '\t');
285 /* This function reads characters through to the end of the current line and
286 just ignores them. */
289 eat_line (st_parameter_dt
*dtp
)
299 /* Skip over a separator. Technically, we don't always eat the whole
300 separator. This is because if we've processed the last input item,
301 then a separator is unnecessary. Plus the fact that operating
302 systems usually deliver console input on a line basis.
304 The upshot is that if we see a newline as part of reading a
305 separator, we stop reading. If there are more input items, we
306 continue reading the separator with finish_separator() which takes
307 care of the fact that we may or may not have seen a comma as part
311 eat_separator (st_parameter_dt
*dtp
)
316 dtp
->u
.p
.comma_flag
= 0;
322 if (dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
329 dtp
->u
.p
.comma_flag
= 1;
334 dtp
->u
.p
.input_complete
= 1;
348 if (dtp
->u
.p
.namelist_mode
)
364 while (c
== '\n' || c
== '\r' || c
== ' ' || c
== '\t');
370 if (dtp
->u
.p
.namelist_mode
)
371 { /* Eat a namelist comment. */
379 /* Fall Through... */
388 /* Finish processing a separator that was interrupted by a newline.
389 If we're here, then another data item is present, so we finish what
390 we started on the previous line. */
393 finish_separator (st_parameter_dt
*dtp
)
404 if (dtp
->u
.p
.comma_flag
)
408 c
= eat_spaces (dtp
);
409 if (c
== '\n' || c
== '\r')
416 dtp
->u
.p
.input_complete
= 1;
417 if (!dtp
->u
.p
.namelist_mode
)
426 if (dtp
->u
.p
.namelist_mode
)
442 /* This function is needed to catch bad conversions so that namelist can
443 attempt to see if dtp->u.p.saved_string contains a new object name rather
447 nml_bad_return (st_parameter_dt
*dtp
, char c
)
449 if (dtp
->u
.p
.namelist_mode
)
451 dtp
->u
.p
.nml_read_error
= 1;
458 /* Convert an unsigned string to an integer. The length value is -1
459 if we are working on a repeat count. Returns nonzero if we have a
460 range problem. As a side effect, frees the dtp->u.p.saved_string. */
463 convert_integer (st_parameter_dt
*dtp
, int length
, int negative
)
465 char c
, *buffer
, message
[100];
467 GFC_INTEGER_LARGEST v
, max
, max10
;
469 buffer
= dtp
->u
.p
.saved_string
;
472 max
= (length
== -1) ? MAX_REPEAT
: max_value (length
, 1);
497 set_integer (dtp
->u
.p
.value
, v
, length
);
501 dtp
->u
.p
.repeat_count
= v
;
503 if (dtp
->u
.p
.repeat_count
== 0)
505 sprintf (message
, "Zero repeat count in item %d of list input",
506 dtp
->u
.p
.item_count
);
508 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
518 sprintf (message
, "Repeat count overflow in item %d of list input",
519 dtp
->u
.p
.item_count
);
521 sprintf (message
, "Integer overflow while reading item %d",
522 dtp
->u
.p
.item_count
);
525 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
531 /* Parse a repeat count for logical and complex values which cannot
532 begin with a digit. Returns nonzero if we are done, zero if we
533 should continue on. */
536 parse_repeat (st_parameter_dt
*dtp
)
538 char c
, message
[100];
564 repeat
= 10 * repeat
+ c
- '0';
566 if (repeat
> MAX_REPEAT
)
569 "Repeat count overflow in item %d of list input",
570 dtp
->u
.p
.item_count
);
572 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
582 "Zero repeat count in item %d of list input",
583 dtp
->u
.p
.item_count
);
585 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
597 dtp
->u
.p
.repeat_count
= repeat
;
604 sprintf (message
, "Bad repeat count in item %d of list input",
605 dtp
->u
.p
.item_count
);
606 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
611 /* To read a logical we have to look ahead in the input stream to make sure
612 there is not an equal sign indicating a variable name. To do this we use
613 line_buffer to point to a temporary buffer, pushing characters there for
614 possible later reading. */
617 l_push_char (st_parameter_dt
*dtp
, char c
)
619 if (dtp
->u
.p
.line_buffer
== NULL
)
621 dtp
->u
.p
.line_buffer
= get_mem (SCRATCH_SIZE
);
622 memset (dtp
->u
.p
.line_buffer
, 0, SCRATCH_SIZE
);
625 dtp
->u
.p
.line_buffer
[dtp
->u
.p
.item_count
++] = c
;
629 /* Read a logical character on the input. */
632 read_logical (st_parameter_dt
*dtp
, int length
)
634 char c
, message
[100];
637 if (parse_repeat (dtp
))
640 c
= tolower (next_char (dtp
));
641 l_push_char (dtp
, c
);
647 l_push_char (dtp
, c
);
649 if (!is_separator(c
))
657 l_push_char (dtp
, c
);
659 if (!is_separator(c
))
666 c
= tolower (next_char (dtp
));
684 return; /* Null value. */
687 /* Save the character in case it is the beginning
688 of the next object name. */
693 dtp
->u
.p
.saved_type
= BT_LOGICAL
;
694 dtp
->u
.p
.saved_length
= length
;
696 /* Eat trailing garbage. */
701 while (!is_separator (c
));
705 set_integer ((int *) dtp
->u
.p
.value
, v
, length
);
712 for(i
= 0; i
< 63; i
++)
717 /* All done if this is not a namelist read. */
718 if (!dtp
->u
.p
.namelist_mode
)
731 l_push_char (dtp
, c
);
734 dtp
->u
.p
.nml_read_error
= 1;
735 dtp
->u
.p
.line_buffer_enabled
= 1;
736 dtp
->u
.p
.item_count
= 0;
746 if (nml_bad_return (dtp
, c
))
751 sprintf (message
, "Bad logical value while reading item %d",
752 dtp
->u
.p
.item_count
);
753 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
758 dtp
->u
.p
.saved_type
= BT_LOGICAL
;
759 dtp
->u
.p
.saved_length
= length
;
760 set_integer ((int *) dtp
->u
.p
.value
, v
, length
);
766 /* Reading integers is tricky because we can actually be reading a
767 repeat count. We have to store the characters in a buffer because
768 we could be reading an integer that is larger than the default int
769 used for repeat counts. */
772 read_integer (st_parameter_dt
*dtp
, int length
)
774 char c
, message
[100];
784 /* Fall through... */
790 CASE_SEPARATORS
: /* Single null. */
803 /* Take care of what may be a repeat count. */
815 push_char (dtp
, '\0');
818 CASE_SEPARATORS
: /* Not a repeat count. */
827 if (convert_integer (dtp
, -1, 0))
830 /* Get the real integer. */
845 /* Fall through... */
876 if (nml_bad_return (dtp
, c
))
881 sprintf (message
, "Bad integer for item %d in list input",
882 dtp
->u
.p
.item_count
);
883 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
891 push_char (dtp
, '\0');
892 if (convert_integer (dtp
, length
, negative
))
899 dtp
->u
.p
.saved_type
= BT_INTEGER
;
903 /* Read a character variable. */
906 read_character (st_parameter_dt
*dtp
, int length
__attribute__ ((unused
)))
908 char c
, quote
, message
[100];
910 quote
= ' '; /* Space means no quote character. */
920 unget_char (dtp
, c
); /* NULL value. */
930 if (dtp
->u
.p
.namelist_mode
)
940 /* Deal with a possible repeat count. */
953 goto done
; /* String was only digits! */
956 push_char (dtp
, '\0');
961 goto get_string
; /* Not a repeat count after all. */
966 if (convert_integer (dtp
, -1, 0))
969 /* Now get the real string. */
975 unget_char (dtp
, c
); /* Repeated NULL values. */
1003 /* See if we have a doubled quote character or the end of
1006 c
= next_char (dtp
);
1009 push_char (dtp
, quote
);
1013 unget_char (dtp
, c
);
1019 unget_char (dtp
, c
);
1023 if (c
!= '\n' && c
!= '\r')
1033 /* At this point, we have to have a separator, or else the string is
1036 c
= next_char (dtp
);
1037 if (is_separator (c
) || c
== '!')
1039 unget_char (dtp
, c
);
1040 eat_separator (dtp
);
1041 dtp
->u
.p
.saved_type
= BT_CHARACTER
;
1047 sprintf (message
, "Invalid string input in item %d",
1048 dtp
->u
.p
.item_count
);
1049 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1054 /* Parse a component of a complex constant or a real number that we
1055 are sure is already there. This is a straight real number parser. */
1058 parse_real (st_parameter_dt
*dtp
, void *buffer
, int length
)
1060 char c
, message
[100];
1063 c
= next_char (dtp
);
1064 if (c
== '-' || c
== '+')
1067 c
= next_char (dtp
);
1070 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1073 if (!isdigit (c
) && c
!= '.')
1075 if (c
== 'i' || c
== 'I' || c
== 'n' || c
== 'N')
1083 seen_dp
= (c
== '.') ? 1 : 0;
1087 c
= next_char (dtp
);
1088 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1108 push_char (dtp
, 'e');
1113 push_char (dtp
, 'e');
1115 c
= next_char (dtp
);
1119 unget_char (dtp
, c
);
1128 c
= next_char (dtp
);
1129 if (c
!= '-' && c
!= '+')
1130 push_char (dtp
, '+');
1134 c
= next_char (dtp
);
1145 c
= next_char (dtp
);
1153 unget_char (dtp
, c
);
1162 unget_char (dtp
, c
);
1163 push_char (dtp
, '\0');
1165 m
= convert_real (dtp
, buffer
, dtp
->u
.p
.saved_string
, length
);
1171 /* Match INF and Infinity. */
1172 if ((c
== 'i' || c
== 'I')
1173 && ((c
= next_char (dtp
)) == 'n' || c
== 'N')
1174 && ((c
= next_char (dtp
)) == 'f' || c
== 'F'))
1176 c
= next_char (dtp
);
1177 if ((c
!= 'i' && c
!= 'I')
1178 || ((c
== 'i' || c
== 'I')
1179 && ((c
= next_char (dtp
)) == 'n' || c
== 'N')
1180 && ((c
= next_char (dtp
)) == 'i' || c
== 'I')
1181 && ((c
= next_char (dtp
)) == 't' || c
== 'T')
1182 && ((c
= next_char (dtp
)) == 'y' || c
== 'Y')
1183 && (c
= next_char (dtp
))))
1185 if (is_separator (c
))
1186 unget_char (dtp
, c
);
1187 push_char (dtp
, 'i');
1188 push_char (dtp
, 'n');
1189 push_char (dtp
, 'f');
1193 else if (((c
= next_char (dtp
)) == 'a' || c
== 'A')
1194 && ((c
= next_char (dtp
)) == 'n' || c
== 'N')
1195 && (c
= next_char (dtp
)))
1197 if (is_separator (c
))
1198 unget_char (dtp
, c
);
1199 push_char (dtp
, 'n');
1200 push_char (dtp
, 'a');
1201 push_char (dtp
, 'n');
1207 if (nml_bad_return (dtp
, c
))
1212 sprintf (message
, "Bad floating point number for item %d",
1213 dtp
->u
.p
.item_count
);
1214 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1220 /* Reading a complex number is straightforward because we can tell
1221 what it is right away. */
1224 read_complex (st_parameter_dt
*dtp
, void * dest
, int kind
, size_t size
)
1229 if (parse_repeat (dtp
))
1232 c
= next_char (dtp
);
1239 unget_char (dtp
, c
);
1240 eat_separator (dtp
);
1248 if (parse_real (dtp
, dest
, kind
))
1253 c
= next_char (dtp
);
1254 if (c
== '\n' || c
== '\r')
1257 unget_char (dtp
, c
);
1260 != (dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_POINT
? ',' : ';'))
1265 c
= next_char (dtp
);
1266 if (c
== '\n' || c
== '\r')
1269 unget_char (dtp
, c
);
1271 if (parse_real (dtp
, dest
+ size
/ 2, kind
))
1275 if (next_char (dtp
) != ')')
1278 c
= next_char (dtp
);
1279 if (!is_separator (c
))
1282 unget_char (dtp
, c
);
1283 eat_separator (dtp
);
1286 dtp
->u
.p
.saved_type
= BT_COMPLEX
;
1291 if (nml_bad_return (dtp
, c
))
1296 sprintf (message
, "Bad complex value in item %d of list input",
1297 dtp
->u
.p
.item_count
);
1298 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1302 /* Parse a real number with a possible repeat count. */
1305 read_real (st_parameter_dt
*dtp
, void * dest
, int length
)
1307 char c
, message
[100];
1313 c
= next_char (dtp
);
1314 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1332 unget_char (dtp
, c
); /* Single null. */
1333 eat_separator (dtp
);
1346 /* Get the digit string that might be a repeat count. */
1350 c
= next_char (dtp
);
1351 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1375 push_char (dtp
, 'e');
1377 c
= next_char (dtp
);
1381 push_char (dtp
, '\0');
1385 if (c
!= '\n' && c
!= ',' && c
!= '\r' && c
!= ';')
1386 unget_char (dtp
, c
);
1395 if (convert_integer (dtp
, -1, 0))
1398 /* Now get the number itself. */
1400 c
= next_char (dtp
);
1401 if (is_separator (c
))
1402 { /* Repeated null value. */
1403 unget_char (dtp
, c
);
1404 eat_separator (dtp
);
1408 if (c
!= '-' && c
!= '+')
1409 push_char (dtp
, '+');
1414 c
= next_char (dtp
);
1417 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1420 if (!isdigit (c
) && c
!= '.')
1422 if (c
== 'i' || c
== 'I' || c
== 'n' || c
== 'N')
1441 c
= next_char (dtp
);
1442 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1469 push_char (dtp
, 'e');
1471 c
= next_char (dtp
);
1480 push_char (dtp
, 'e');
1482 c
= next_char (dtp
);
1483 if (c
!= '+' && c
!= '-')
1484 push_char (dtp
, '+');
1488 c
= next_char (dtp
);
1498 c
= next_char (dtp
);
1515 unget_char (dtp
, c
);
1516 eat_separator (dtp
);
1517 push_char (dtp
, '\0');
1518 if (convert_real (dtp
, dest
, dtp
->u
.p
.saved_string
, length
))
1522 dtp
->u
.p
.saved_type
= BT_REAL
;
1526 l_push_char (dtp
, c
);
1529 /* Match INF and Infinity. */
1530 if (c
== 'i' || c
== 'I')
1532 c
= next_char (dtp
);
1533 l_push_char (dtp
, c
);
1534 if (c
!= 'n' && c
!= 'N')
1536 c
= next_char (dtp
);
1537 l_push_char (dtp
, c
);
1538 if (c
!= 'f' && c
!= 'F')
1540 c
= next_char (dtp
);
1541 l_push_char (dtp
, c
);
1542 if (!is_separator (c
))
1544 if (c
!= 'i' && c
!= 'I')
1546 c
= next_char (dtp
);
1547 l_push_char (dtp
, c
);
1548 if (c
!= 'n' && c
!= 'N')
1550 c
= next_char (dtp
);
1551 l_push_char (dtp
, c
);
1552 if (c
!= 'i' && c
!= 'I')
1554 c
= next_char (dtp
);
1555 l_push_char (dtp
, c
);
1556 if (c
!= 't' && c
!= 'T')
1558 c
= next_char (dtp
);
1559 l_push_char (dtp
, c
);
1560 if (c
!= 'y' && c
!= 'Y')
1562 c
= next_char (dtp
);
1563 l_push_char (dtp
, c
);
1569 c
= next_char (dtp
);
1570 l_push_char (dtp
, c
);
1571 if (c
!= 'a' && c
!= 'A')
1573 c
= next_char (dtp
);
1574 l_push_char (dtp
, c
);
1575 if (c
!= 'n' && c
!= 'N')
1577 c
= next_char (dtp
);
1578 l_push_char (dtp
, c
);
1581 if (!is_separator (c
))
1584 if (dtp
->u
.p
.namelist_mode
)
1586 if (c
== ' ' || c
=='\n' || c
== '\r')
1589 c
= next_char (dtp
);
1590 while (c
== ' ' || c
=='\n' || c
== '\r');
1592 l_push_char (dtp
, c
);
1601 push_char (dtp
, 'i');
1602 push_char (dtp
, 'n');
1603 push_char (dtp
, 'f');
1607 push_char (dtp
, 'n');
1608 push_char (dtp
, 'a');
1609 push_char (dtp
, 'n');
1616 if (dtp
->u
.p
.namelist_mode
)
1618 dtp
->u
.p
.nml_read_error
= 1;
1619 dtp
->u
.p
.line_buffer_enabled
= 1;
1620 dtp
->u
.p
.item_count
= 0;
1626 if (nml_bad_return (dtp
, c
))
1631 sprintf (message
, "Bad real number in item %d of list input",
1632 dtp
->u
.p
.item_count
);
1633 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1637 /* Check the current type against the saved type to make sure they are
1638 compatible. Returns nonzero if incompatible. */
1641 check_type (st_parameter_dt
*dtp
, bt type
, int len
)
1645 if (dtp
->u
.p
.saved_type
!= BT_NULL
&& dtp
->u
.p
.saved_type
!= type
)
1647 sprintf (message
, "Read type %s where %s was expected for item %d",
1648 type_name (dtp
->u
.p
.saved_type
), type_name (type
),
1649 dtp
->u
.p
.item_count
);
1651 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1655 if (dtp
->u
.p
.saved_type
== BT_NULL
|| dtp
->u
.p
.saved_type
== BT_CHARACTER
)
1658 if (dtp
->u
.p
.saved_length
!= len
)
1661 "Read kind %d %s where kind %d is required for item %d",
1662 dtp
->u
.p
.saved_length
, type_name (dtp
->u
.p
.saved_type
), len
,
1663 dtp
->u
.p
.item_count
);
1664 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1672 /* Top level data transfer subroutine for list reads. Because we have
1673 to deal with repeat counts, the data item is always saved after
1674 reading, usually in the dtp->u.p.value[] array. If a repeat count is
1675 greater than one, we copy the data item multiple times. */
1678 list_formatted_read_scalar (st_parameter_dt
*dtp
, volatile bt type
, void *p
,
1679 int kind
, size_t size
)
1686 dtp
->u
.p
.namelist_mode
= 0;
1688 dtp
->u
.p
.eof_jump
= &eof_jump
;
1689 if (setjmp (eof_jump
))
1691 generate_error (&dtp
->common
, LIBERROR_END
, NULL
);
1692 if (!is_internal_unit (dtp
))
1694 dtp
->u
.p
.current_unit
->endfile
= AFTER_ENDFILE
;
1695 dtp
->u
.p
.current_unit
->current_record
= 0;
1700 if (dtp
->u
.p
.first_item
)
1702 dtp
->u
.p
.first_item
= 0;
1703 dtp
->u
.p
.input_complete
= 0;
1704 dtp
->u
.p
.repeat_count
= 1;
1705 dtp
->u
.p
.at_eol
= 0;
1707 c
= eat_spaces (dtp
);
1708 if (is_separator (c
))
1710 /* Found a null value. */
1711 eat_separator (dtp
);
1712 dtp
->u
.p
.repeat_count
= 0;
1714 /* eat_separator sets this flag if the separator was a comma. */
1715 if (dtp
->u
.p
.comma_flag
)
1718 /* eat_separator sets this flag if the separator was a \n or \r. */
1719 if (dtp
->u
.p
.at_eol
)
1720 finish_separator (dtp
);
1728 if (dtp
->u
.p
.repeat_count
> 0)
1730 if (check_type (dtp
, type
, kind
))
1735 if (dtp
->u
.p
.input_complete
)
1738 if (dtp
->u
.p
.input_complete
)
1741 if (dtp
->u
.p
.at_eol
)
1742 finish_separator (dtp
);
1746 /* Trailing spaces prior to end of line. */
1747 if (dtp
->u
.p
.at_eol
)
1748 finish_separator (dtp
);
1751 dtp
->u
.p
.saved_type
= BT_NULL
;
1752 dtp
->u
.p
.repeat_count
= 1;
1758 read_integer (dtp
, kind
);
1761 read_logical (dtp
, kind
);
1764 read_character (dtp
, kind
);
1767 read_real (dtp
, p
, kind
);
1768 /* Copy value back to temporary if needed. */
1769 if (dtp
->u
.p
.repeat_count
> 0)
1770 memcpy (dtp
->u
.p
.value
, p
, kind
);
1773 read_complex (dtp
, p
, kind
, size
);
1774 /* Copy value back to temporary if needed. */
1775 if (dtp
->u
.p
.repeat_count
> 0)
1776 memcpy (dtp
->u
.p
.value
, p
, size
);
1779 internal_error (&dtp
->common
, "Bad type for list read");
1782 if (dtp
->u
.p
.saved_type
!= BT_CHARACTER
&& dtp
->u
.p
.saved_type
!= BT_NULL
)
1783 dtp
->u
.p
.saved_length
= size
;
1785 if ((dtp
->common
.flags
& IOPARM_LIBRETURN_MASK
) != IOPARM_LIBRETURN_OK
)
1789 switch (dtp
->u
.p
.saved_type
)
1793 if (dtp
->u
.p
.repeat_count
> 0)
1794 memcpy (p
, dtp
->u
.p
.value
, size
);
1799 memcpy (p
, dtp
->u
.p
.value
, size
);
1803 if (dtp
->u
.p
.saved_string
)
1805 m
= ((int) size
< dtp
->u
.p
.saved_used
)
1806 ? (int) size
: dtp
->u
.p
.saved_used
;
1808 memcpy (p
, dtp
->u
.p
.saved_string
, m
);
1811 q
= (gfc_char4_t
*) p
;
1812 for (i
= 0; i
< m
; i
++)
1813 q
[i
] = (unsigned char) dtp
->u
.p
.saved_string
[i
];
1817 /* Just delimiters encountered, nothing to copy but SPACE. */
1823 memset (((char *) p
) + m
, ' ', size
- m
);
1826 q
= (gfc_char4_t
*) p
;
1827 for (i
= m
; i
< (int) size
; i
++)
1828 q
[i
] = (unsigned char) ' ';
1837 if (--dtp
->u
.p
.repeat_count
<= 0)
1841 dtp
->u
.p
.eof_jump
= NULL
;
1846 list_formatted_read (st_parameter_dt
*dtp
, bt type
, void *p
, int kind
,
1847 size_t size
, size_t nelems
)
1851 size_t stride
= type
== BT_CHARACTER
?
1852 size
* GFC_SIZE_OF_CHAR_KIND(kind
) : size
;
1856 /* Big loop over all the elements. */
1857 for (elem
= 0; elem
< nelems
; elem
++)
1859 dtp
->u
.p
.item_count
++;
1860 list_formatted_read_scalar (dtp
, type
, tmp
+ stride
*elem
, kind
, size
);
1865 /* Finish a list read. */
1868 finish_list_read (st_parameter_dt
*dtp
)
1874 fbuf_flush (dtp
->u
.p
.current_unit
, dtp
->u
.p
.mode
);
1876 if (dtp
->u
.p
.at_eol
)
1878 dtp
->u
.p
.at_eol
= 0;
1884 c
= next_char (dtp
);
1888 if (dtp
->u
.p
.current_unit
->endfile
!= NO_ENDFILE
)
1890 generate_error (&dtp
->common
, LIBERROR_END
, NULL
);
1891 dtp
->u
.p
.current_unit
->endfile
= AFTER_ENDFILE
;
1892 dtp
->u
.p
.current_unit
->current_record
= 0;
1898 void namelist_read (st_parameter_dt *dtp)
1900 static void nml_match_name (char *name, int len)
1901 static int nml_query (st_parameter_dt *dtp)
1902 static int nml_get_obj_data (st_parameter_dt *dtp,
1903 namelist_info **prev_nl, char *, size_t)
1905 static void nml_untouch_nodes (st_parameter_dt *dtp)
1906 static namelist_info * find_nml_node (st_parameter_dt *dtp,
1908 static int nml_parse_qualifier(descriptor_dimension * ad,
1909 array_loop_spec * ls, int rank, char *)
1910 static void nml_touch_nodes (namelist_info * nl)
1911 static int nml_read_obj (namelist_info *nl, index_type offset,
1912 namelist_info **prev_nl, char *, size_t,
1913 index_type clow, index_type chigh)
1917 /* Inputs a rank-dimensional qualifier, which can contain
1918 singlets, doublets, triplets or ':' with the standard meanings. */
1921 nml_parse_qualifier (st_parameter_dt
*dtp
, descriptor_dimension
*ad
,
1922 array_loop_spec
*ls
, int rank
, char *parse_err_msg
,
1929 int is_array_section
, is_char
;
1933 is_array_section
= 0;
1934 dtp
->u
.p
.expanded_read
= 0;
1936 /* See if this is a character substring qualifier we are looking for. */
1943 /* The next character in the stream should be the '('. */
1945 c
= next_char (dtp
);
1947 /* Process the qualifier, by dimension and triplet. */
1949 for (dim
=0; dim
< rank
; dim
++ )
1951 for (indx
=0; indx
<3; indx
++)
1957 /* Process a potential sign. */
1958 c
= next_char (dtp
);
1969 unget_char (dtp
, c
);
1973 /* Process characters up to the next ':' , ',' or ')'. */
1976 c
= next_char (dtp
);
1981 is_array_section
= 1;
1985 if ((c
==',' && dim
== rank
-1)
1986 || (c
==')' && dim
< rank
-1))
1989 sprintf (parse_err_msg
, "Bad substring qualifier");
1991 sprintf (parse_err_msg
, "Bad number of index fields");
2000 case ' ': case '\t':
2002 c
= next_char (dtp
);
2007 sprintf (parse_err_msg
,
2008 "Bad character in substring qualifier");
2010 sprintf (parse_err_msg
, "Bad character in index");
2014 if ((c
== ',' || c
== ')') && indx
== 0
2015 && dtp
->u
.p
.saved_string
== 0)
2018 sprintf (parse_err_msg
, "Null substring qualifier");
2020 sprintf (parse_err_msg
, "Null index field");
2024 if ((c
== ':' && indx
== 1 && dtp
->u
.p
.saved_string
== 0)
2025 || (indx
== 2 && dtp
->u
.p
.saved_string
== 0))
2028 sprintf (parse_err_msg
, "Bad substring qualifier");
2030 sprintf (parse_err_msg
, "Bad index triplet");
2034 if (is_char
&& !is_array_section
)
2036 sprintf (parse_err_msg
,
2037 "Missing colon in substring qualifier");
2041 /* If '( : ? )' or '( ? : )' break and flag read failure. */
2043 if ((c
== ':' && indx
== 0 && dtp
->u
.p
.saved_string
== 0)
2044 || (indx
==1 && dtp
->u
.p
.saved_string
== 0))
2050 /* Now read the index. */
2051 if (convert_integer (dtp
, sizeof(ssize_t
), neg
))
2054 sprintf (parse_err_msg
, "Bad integer substring qualifier");
2056 sprintf (parse_err_msg
, "Bad integer in index");
2062 /* Feed the index values to the triplet arrays. */
2066 memcpy (&ls
[dim
].start
, dtp
->u
.p
.value
, sizeof(ssize_t
));
2068 memcpy (&ls
[dim
].end
, dtp
->u
.p
.value
, sizeof(ssize_t
));
2070 memcpy (&ls
[dim
].step
, dtp
->u
.p
.value
, sizeof(ssize_t
));
2073 /* Singlet or doublet indices. */
2074 if (c
==',' || c
==')')
2078 memcpy (&ls
[dim
].start
, dtp
->u
.p
.value
, sizeof(ssize_t
));
2080 /* If -std=f95/2003 or an array section is specified,
2081 do not allow excess data to be processed. */
2082 if (is_array_section
== 1
2083 || compile_options
.allow_std
< GFC_STD_GNU
)
2084 ls
[dim
].end
= ls
[dim
].start
;
2086 dtp
->u
.p
.expanded_read
= 1;
2089 /* Check for non-zero rank. */
2090 if (is_array_section
== 1 && ls
[dim
].start
!= ls
[dim
].end
)
2097 /* Check the values of the triplet indices. */
2098 if ((ls
[dim
].start
> (ssize_t
) GFC_DIMENSION_UBOUND(ad
[dim
]))
2099 || (ls
[dim
].start
< (ssize_t
) GFC_DIMENSION_LBOUND(ad
[dim
]))
2100 || (ls
[dim
].end
> (ssize_t
) GFC_DIMENSION_UBOUND(ad
[dim
]))
2101 || (ls
[dim
].end
< (ssize_t
) GFC_DIMENSION_LBOUND(ad
[dim
])))
2104 sprintf (parse_err_msg
, "Substring out of range");
2106 sprintf (parse_err_msg
, "Index %d out of range", dim
+ 1);
2110 if (((ls
[dim
].end
- ls
[dim
].start
) * ls
[dim
].step
< 0)
2111 || (ls
[dim
].step
== 0))
2113 sprintf (parse_err_msg
, "Bad range in index %d", dim
+ 1);
2117 /* Initialise the loop index counter. */
2118 ls
[dim
].idx
= ls
[dim
].start
;
2128 static namelist_info
*
2129 find_nml_node (st_parameter_dt
*dtp
, char * var_name
)
2131 namelist_info
* t
= dtp
->u
.p
.ionml
;
2134 if (strcmp (var_name
, t
->var_name
) == 0)
2144 /* Visits all the components of a derived type that have
2145 not explicitly been identified in the namelist input.
2146 touched is set and the loop specification initialised
2147 to default values */
2150 nml_touch_nodes (namelist_info
* nl
)
2152 index_type len
= strlen (nl
->var_name
) + 1;
2154 char * ext_name
= (char*)get_mem (len
+ 1);
2155 memcpy (ext_name
, nl
->var_name
, len
-1);
2156 memcpy (ext_name
+ len
- 1, "%", 2);
2157 for (nl
= nl
->next
; nl
; nl
= nl
->next
)
2159 if (strncmp (nl
->var_name
, ext_name
, len
) == 0)
2162 for (dim
=0; dim
< nl
->var_rank
; dim
++)
2164 nl
->ls
[dim
].step
= 1;
2165 nl
->ls
[dim
].end
= GFC_DESCRIPTOR_UBOUND(nl
,dim
);
2166 nl
->ls
[dim
].start
= GFC_DESCRIPTOR_LBOUND(nl
,dim
);
2167 nl
->ls
[dim
].idx
= nl
->ls
[dim
].start
;
2173 free_mem (ext_name
);
2177 /* Resets touched for the entire list of nml_nodes, ready for a
2181 nml_untouch_nodes (st_parameter_dt
*dtp
)
2184 for (t
= dtp
->u
.p
.ionml
; t
; t
= t
->next
)
2189 /* Attempts to input name to namelist name. Returns
2190 dtp->u.p.nml_read_error = 1 on no match. */
2193 nml_match_name (st_parameter_dt
*dtp
, const char *name
, index_type len
)
2197 dtp
->u
.p
.nml_read_error
= 0;
2198 for (i
= 0; i
< len
; i
++)
2200 c
= next_char (dtp
);
2201 if (tolower (c
) != tolower (name
[i
]))
2203 dtp
->u
.p
.nml_read_error
= 1;
2209 /* If the namelist read is from stdin, output the current state of the
2210 namelist to stdout. This is used to implement the non-standard query
2211 features, ? and =?. If c == '=' the full namelist is printed. Otherwise
2212 the names alone are printed. */
2215 nml_query (st_parameter_dt
*dtp
, char c
)
2217 gfc_unit
* temp_unit
;
2222 static const index_type endlen
= 3;
2223 static const char endl
[] = "\r\n";
2224 static const char nmlend
[] = "&end\r\n";
2226 static const index_type endlen
= 2;
2227 static const char endl
[] = "\n";
2228 static const char nmlend
[] = "&end\n";
2231 if (dtp
->u
.p
.current_unit
->unit_number
!= options
.stdin_unit
)
2234 /* Store the current unit and transfer to stdout. */
2236 temp_unit
= dtp
->u
.p
.current_unit
;
2237 dtp
->u
.p
.current_unit
= find_unit (options
.stdout_unit
);
2239 if (dtp
->u
.p
.current_unit
)
2241 dtp
->u
.p
.mode
= WRITING
;
2242 next_record (dtp
, 0);
2244 /* Write the namelist in its entirety. */
2247 namelist_write (dtp
);
2249 /* Or write the list of names. */
2253 /* "&namelist_name\n" */
2255 len
= dtp
->namelist_name_len
;
2256 p
= write_block (dtp
, len
+ endlen
);
2260 memcpy ((char*)(p
+ 1), dtp
->namelist_name
, len
);
2261 memcpy ((char*)(p
+ len
+ 1), &endl
, endlen
- 1);
2262 for (nl
= dtp
->u
.p
.ionml
; nl
; nl
= nl
->next
)
2266 len
= strlen (nl
->var_name
);
2267 p
= write_block (dtp
, len
+ endlen
);
2271 memcpy ((char*)(p
+ 1), nl
->var_name
, len
);
2272 memcpy ((char*)(p
+ len
+ 1), &endl
, endlen
- 1);
2277 p
= write_block (dtp
, endlen
+ 3);
2279 memcpy (p
, &nmlend
, endlen
+ 3);
2282 /* Flush the stream to force immediate output. */
2284 fbuf_flush (dtp
->u
.p
.current_unit
, WRITING
);
2285 sflush (dtp
->u
.p
.current_unit
->s
);
2286 unlock_unit (dtp
->u
.p
.current_unit
);
2291 /* Restore the current unit. */
2293 dtp
->u
.p
.current_unit
= temp_unit
;
2294 dtp
->u
.p
.mode
= READING
;
2298 /* Reads and stores the input for the namelist object nl. For an array,
2299 the function loops over the ranges defined by the loop specification.
2300 This default to all the data or to the specification from a qualifier.
2301 nml_read_obj recursively calls itself to read derived types. It visits
2302 all its own components but only reads data for those that were touched
2303 when the name was parsed. If a read error is encountered, an attempt is
2304 made to return to read a new object name because the standard allows too
2305 little data to be available. On the other hand, too much data is an
2309 nml_read_obj (st_parameter_dt
*dtp
, namelist_info
* nl
, index_type offset
,
2310 namelist_info
**pprev_nl
, char *nml_err_msg
,
2311 size_t nml_err_msg_size
, index_type clow
, index_type chigh
)
2313 namelist_info
* cmp
;
2320 size_t obj_name_len
;
2323 /* This object not touched in name parsing. */
2328 dtp
->u
.p
.repeat_count
= 0;
2334 case GFC_DTYPE_INTEGER
:
2335 case GFC_DTYPE_LOGICAL
:
2339 case GFC_DTYPE_REAL
:
2340 dlen
= size_from_real_kind (len
);
2343 case GFC_DTYPE_COMPLEX
:
2344 dlen
= size_from_complex_kind (len
);
2347 case GFC_DTYPE_CHARACTER
:
2348 dlen
= chigh
? (chigh
- clow
+ 1) : nl
->string_length
;
2357 /* Update the pointer to the data, using the current index vector */
2359 pdata
= (void*)(nl
->mem_pos
+ offset
);
2360 for (dim
= 0; dim
< nl
->var_rank
; dim
++)
2361 pdata
= (void*)(pdata
+ (nl
->ls
[dim
].idx
2362 - GFC_DESCRIPTOR_LBOUND(nl
,dim
))
2363 * GFC_DESCRIPTOR_STRIDE(nl
,dim
) * nl
->size
);
2365 /* Reset the error flag and try to read next value, if
2366 dtp->u.p.repeat_count=0 */
2368 dtp
->u
.p
.nml_read_error
= 0;
2370 if (--dtp
->u
.p
.repeat_count
<= 0)
2372 if (dtp
->u
.p
.input_complete
)
2374 if (dtp
->u
.p
.at_eol
)
2375 finish_separator (dtp
);
2376 if (dtp
->u
.p
.input_complete
)
2379 /* BT_NULL (equivalent to GFC_DTYPE_UNKNOWN) falls through
2380 for nulls and is detected at default: of switch block. */
2382 dtp
->u
.p
.saved_type
= BT_NULL
;
2387 case GFC_DTYPE_INTEGER
:
2388 read_integer (dtp
, len
);
2391 case GFC_DTYPE_LOGICAL
:
2392 read_logical (dtp
, len
);
2395 case GFC_DTYPE_CHARACTER
:
2396 read_character (dtp
, len
);
2399 case GFC_DTYPE_REAL
:
2400 /* Need to copy data back from the real location to the temp in order
2401 to handle nml reads into arrays. */
2402 read_real (dtp
, pdata
, len
);
2403 memcpy (dtp
->u
.p
.value
, pdata
, dlen
);
2406 case GFC_DTYPE_COMPLEX
:
2407 /* Same as for REAL, copy back to temp. */
2408 read_complex (dtp
, pdata
, len
, dlen
);
2409 memcpy (dtp
->u
.p
.value
, pdata
, dlen
);
2412 case GFC_DTYPE_DERIVED
:
2413 obj_name_len
= strlen (nl
->var_name
) + 1;
2414 obj_name
= get_mem (obj_name_len
+1);
2415 memcpy (obj_name
, nl
->var_name
, obj_name_len
-1);
2416 memcpy (obj_name
+ obj_name_len
- 1, "%", 2);
2418 /* If reading a derived type, disable the expanded read warning
2419 since a single object can have multiple reads. */
2420 dtp
->u
.p
.expanded_read
= 0;
2422 /* Now loop over the components. Update the component pointer
2423 with the return value from nml_write_obj. This loop jumps
2424 past nested derived types by testing if the potential
2425 component name contains '%'. */
2427 for (cmp
= nl
->next
;
2429 !strncmp (cmp
->var_name
, obj_name
, obj_name_len
) &&
2430 !strchr (cmp
->var_name
+ obj_name_len
, '%');
2434 if (nml_read_obj (dtp
, cmp
, (index_type
)(pdata
- nl
->mem_pos
),
2435 pprev_nl
, nml_err_msg
, nml_err_msg_size
,
2436 clow
, chigh
) == FAILURE
)
2438 free_mem (obj_name
);
2442 if (dtp
->u
.p
.input_complete
)
2444 free_mem (obj_name
);
2449 free_mem (obj_name
);
2453 snprintf (nml_err_msg
, nml_err_msg_size
,
2454 "Bad type for namelist object %s", nl
->var_name
);
2455 internal_error (&dtp
->common
, nml_err_msg
);
2460 /* The standard permits array data to stop short of the number of
2461 elements specified in the loop specification. In this case, we
2462 should be here with dtp->u.p.nml_read_error != 0. Control returns to
2463 nml_get_obj_data and an attempt is made to read object name. */
2466 if (dtp
->u
.p
.nml_read_error
)
2468 dtp
->u
.p
.expanded_read
= 0;
2472 if (dtp
->u
.p
.saved_type
== BT_NULL
)
2474 dtp
->u
.p
.expanded_read
= 0;
2478 /* Note the switch from GFC_DTYPE_type to BT_type at this point.
2479 This comes about because the read functions return BT_types. */
2481 switch (dtp
->u
.p
.saved_type
)
2488 memcpy (pdata
, dtp
->u
.p
.value
, dlen
);
2492 m
= (dlen
< dtp
->u
.p
.saved_used
) ? dlen
: dtp
->u
.p
.saved_used
;
2493 pdata
= (void*)( pdata
+ clow
- 1 );
2494 memcpy (pdata
, dtp
->u
.p
.saved_string
, m
);
2496 memset ((void*)( pdata
+ m
), ' ', dlen
- m
);
2503 /* Warn if a non-standard expanded read occurs. A single read of a
2504 single object is acceptable. If a second read occurs, issue a warning
2505 and set the flag to zero to prevent further warnings. */
2506 if (dtp
->u
.p
.expanded_read
== 2)
2508 notify_std (&dtp
->common
, GFC_STD_GNU
, "Non-standard expanded namelist read.");
2509 dtp
->u
.p
.expanded_read
= 0;
2512 /* If the expanded read warning flag is set, increment it,
2513 indicating that a single read has occurred. */
2514 if (dtp
->u
.p
.expanded_read
>= 1)
2515 dtp
->u
.p
.expanded_read
++;
2517 /* Break out of loop if scalar. */
2521 /* Now increment the index vector. */
2526 for (dim
= 0; dim
< nl
->var_rank
; dim
++)
2528 nl
->ls
[dim
].idx
+= nml_carry
* nl
->ls
[dim
].step
;
2530 if (((nl
->ls
[dim
].step
> 0) && (nl
->ls
[dim
].idx
> nl
->ls
[dim
].end
))
2532 ((nl
->ls
[dim
].step
< 0) && (nl
->ls
[dim
].idx
< nl
->ls
[dim
].end
)))
2534 nl
->ls
[dim
].idx
= nl
->ls
[dim
].start
;
2538 } while (!nml_carry
);
2540 if (dtp
->u
.p
.repeat_count
> 1)
2542 snprintf (nml_err_msg
, nml_err_msg_size
,
2543 "Repeat count too large for namelist object %s", nl
->var_name
);
2553 /* Parses the object name, including array and substring qualifiers. It
2554 iterates over derived type components, touching those components and
2555 setting their loop specifications, if there is a qualifier. If the
2556 object is itself a derived type, its components and subcomponents are
2557 touched. nml_read_obj is called at the end and this reads the data in
2558 the manner specified by the object name. */
2561 nml_get_obj_data (st_parameter_dt
*dtp
, namelist_info
**pprev_nl
,
2562 char *nml_err_msg
, size_t nml_err_msg_size
)
2566 namelist_info
* first_nl
= NULL
;
2567 namelist_info
* root_nl
= NULL
;
2568 int dim
, parsed_rank
;
2569 int component_flag
, qualifier_flag
;
2570 index_type clow
, chigh
;
2571 int non_zero_rank_count
;
2573 /* Look for end of input or object name. If '?' or '=?' are encountered
2574 in stdin, print the node names or the namelist to stdout. */
2576 eat_separator (dtp
);
2577 if (dtp
->u
.p
.input_complete
)
2580 if (dtp
->u
.p
.at_eol
)
2581 finish_separator (dtp
);
2582 if (dtp
->u
.p
.input_complete
)
2585 c
= next_char (dtp
);
2589 c
= next_char (dtp
);
2592 sprintf (nml_err_msg
, "namelist read: misplaced = sign");
2595 nml_query (dtp
, '=');
2599 nml_query (dtp
, '?');
2604 nml_match_name (dtp
, "end", 3);
2605 if (dtp
->u
.p
.nml_read_error
)
2607 sprintf (nml_err_msg
, "namelist not terminated with / or &end");
2611 dtp
->u
.p
.input_complete
= 1;
2618 /* Untouch all nodes of the namelist and reset the flags that are set for
2619 derived type components. */
2621 nml_untouch_nodes (dtp
);
2624 non_zero_rank_count
= 0;
2626 /* Get the object name - should '!' and '\n' be permitted separators? */
2634 if (!is_separator (c
))
2635 push_char (dtp
, tolower(c
));
2636 c
= next_char (dtp
);
2637 } while (!( c
=='=' || c
==' ' || c
=='\t' || c
=='(' || c
=='%' ));
2639 unget_char (dtp
, c
);
2641 /* Check that the name is in the namelist and get pointer to object.
2642 Three error conditions exist: (i) An attempt is being made to
2643 identify a non-existent object, following a failed data read or
2644 (ii) The object name does not exist or (iii) Too many data items
2645 are present for an object. (iii) gives the same error message
2648 push_char (dtp
, '\0');
2652 size_t var_len
= strlen (root_nl
->var_name
);
2654 = dtp
->u
.p
.saved_string
? strlen (dtp
->u
.p
.saved_string
) : 0;
2655 char ext_name
[var_len
+ saved_len
+ 1];
2657 memcpy (ext_name
, root_nl
->var_name
, var_len
);
2658 if (dtp
->u
.p
.saved_string
)
2659 memcpy (ext_name
+ var_len
, dtp
->u
.p
.saved_string
, saved_len
);
2660 ext_name
[var_len
+ saved_len
] = '\0';
2661 nl
= find_nml_node (dtp
, ext_name
);
2664 nl
= find_nml_node (dtp
, dtp
->u
.p
.saved_string
);
2668 if (dtp
->u
.p
.nml_read_error
&& *pprev_nl
)
2669 snprintf (nml_err_msg
, nml_err_msg_size
,
2670 "Bad data for namelist object %s", (*pprev_nl
)->var_name
);
2673 snprintf (nml_err_msg
, nml_err_msg_size
,
2674 "Cannot match namelist object name %s",
2675 dtp
->u
.p
.saved_string
);
2680 /* Get the length, data length, base pointer and rank of the variable.
2681 Set the default loop specification first. */
2683 for (dim
=0; dim
< nl
->var_rank
; dim
++)
2685 nl
->ls
[dim
].step
= 1;
2686 nl
->ls
[dim
].end
= GFC_DESCRIPTOR_UBOUND(nl
,dim
);
2687 nl
->ls
[dim
].start
= GFC_DESCRIPTOR_LBOUND(nl
,dim
);
2688 nl
->ls
[dim
].idx
= nl
->ls
[dim
].start
;
2691 /* Check to see if there is a qualifier: if so, parse it.*/
2693 if (c
== '(' && nl
->var_rank
)
2696 if (nml_parse_qualifier (dtp
, nl
->dim
, nl
->ls
, nl
->var_rank
,
2697 nml_err_msg
, &parsed_rank
) == FAILURE
)
2699 char *nml_err_msg_end
= strchr (nml_err_msg
, '\0');
2700 snprintf (nml_err_msg_end
,
2701 nml_err_msg_size
- (nml_err_msg_end
- nml_err_msg
),
2702 " for namelist variable %s", nl
->var_name
);
2705 if (parsed_rank
> 0)
2706 non_zero_rank_count
++;
2710 c
= next_char (dtp
);
2711 unget_char (dtp
, c
);
2713 else if (nl
->var_rank
> 0)
2714 non_zero_rank_count
++;
2716 /* Now parse a derived type component. The root namelist_info address
2717 is backed up, as is the previous component level. The component flag
2718 is set and the iteration is made by jumping back to get_name. */
2722 if (nl
->type
!= GFC_DTYPE_DERIVED
)
2724 snprintf (nml_err_msg
, nml_err_msg_size
,
2725 "Attempt to get derived component for %s", nl
->var_name
);
2729 if (!component_flag
)
2735 c
= next_char (dtp
);
2739 /* Parse a character qualifier, if present. chigh = 0 is a default
2740 that signals that the string length = string_length. */
2745 if (c
== '(' && nl
->type
== GFC_DTYPE_CHARACTER
)
2747 descriptor_dimension chd
[1] = { {1, clow
, nl
->string_length
} };
2748 array_loop_spec ind
[1] = { {1, clow
, nl
->string_length
, 1} };
2750 if (nml_parse_qualifier (dtp
, chd
, ind
, -1, nml_err_msg
, &parsed_rank
)
2753 char *nml_err_msg_end
= strchr (nml_err_msg
, '\0');
2754 snprintf (nml_err_msg_end
,
2755 nml_err_msg_size
- (nml_err_msg_end
- nml_err_msg
),
2756 " for namelist variable %s", nl
->var_name
);
2760 clow
= ind
[0].start
;
2763 if (ind
[0].step
!= 1)
2765 snprintf (nml_err_msg
, nml_err_msg_size
,
2766 "Step not allowed in substring qualifier"
2767 " for namelist object %s", nl
->var_name
);
2771 c
= next_char (dtp
);
2772 unget_char (dtp
, c
);
2775 /* Make sure no extraneous qualifiers are there. */
2779 snprintf (nml_err_msg
, nml_err_msg_size
,
2780 "Qualifier for a scalar or non-character namelist object %s",
2785 /* Make sure there is no more than one non-zero rank object. */
2786 if (non_zero_rank_count
> 1)
2788 snprintf (nml_err_msg
, nml_err_msg_size
,
2789 "Multiple sub-objects with non-zero rank in namelist object %s",
2791 non_zero_rank_count
= 0;
2795 /* According to the standard, an equal sign MUST follow an object name. The
2796 following is possibly lax - it allows comments, blank lines and so on to
2797 intervene. eat_spaces (dtp); c = next_char (dtp); would be compliant*/
2801 eat_separator (dtp
);
2802 if (dtp
->u
.p
.input_complete
)
2805 if (dtp
->u
.p
.at_eol
)
2806 finish_separator (dtp
);
2807 if (dtp
->u
.p
.input_complete
)
2810 c
= next_char (dtp
);
2814 snprintf (nml_err_msg
, nml_err_msg_size
,
2815 "Equal sign must follow namelist object name %s",
2819 /* If a derived type, touch its components and restore the root
2820 namelist_info if we have parsed a qualified derived type
2823 if (nl
->type
== GFC_DTYPE_DERIVED
)
2824 nml_touch_nodes (nl
);
2828 if (first_nl
->var_rank
== 0)
2830 if (component_flag
&& qualifier_flag
)
2837 if (nml_read_obj (dtp
, nl
, 0, pprev_nl
, nml_err_msg
, nml_err_msg_size
,
2838 clow
, chigh
) == FAILURE
)
2848 /* Entry point for namelist input. Goes through input until namelist name
2849 is matched. Then cycles through nml_get_obj_data until the input is
2850 completed or there is an error. */
2853 namelist_read (st_parameter_dt
*dtp
)
2857 char nml_err_msg
[200];
2858 /* Pointer to the previously read object, in case attempt is made to read
2859 new object name. Should this fail, error message can give previous
2861 namelist_info
*prev_nl
= NULL
;
2863 dtp
->u
.p
.namelist_mode
= 1;
2864 dtp
->u
.p
.input_complete
= 0;
2865 dtp
->u
.p
.expanded_read
= 0;
2867 dtp
->u
.p
.eof_jump
= &eof_jump
;
2868 if (setjmp (eof_jump
))
2870 dtp
->u
.p
.eof_jump
= NULL
;
2871 generate_error (&dtp
->common
, LIBERROR_END
, NULL
);
2875 /* Look for &namelist_name . Skip all characters, testing for $nmlname.
2876 Exit on success or EOF. If '?' or '=?' encountered in stdin, print
2877 node names or namelist on stdout. */
2880 switch (c
= next_char (dtp
))
2891 c
= next_char (dtp
);
2893 nml_query (dtp
, '=');
2895 unget_char (dtp
, c
);
2899 nml_query (dtp
, '?');
2905 /* Match the name of the namelist. */
2907 nml_match_name (dtp
, dtp
->namelist_name
, dtp
->namelist_name_len
);
2909 if (dtp
->u
.p
.nml_read_error
)
2912 /* A trailing space is required, we give a little lattitude here, 10.9.1. */
2913 c
= next_char (dtp
);
2914 if (!is_separator(c
) && c
!= '!')
2916 unget_char (dtp
, c
);
2920 unget_char (dtp
, c
);
2921 eat_separator (dtp
);
2923 /* Ready to read namelist objects. If there is an error in input
2924 from stdin, output the error message and continue. */
2926 while (!dtp
->u
.p
.input_complete
)
2928 if (nml_get_obj_data (dtp
, &prev_nl
, nml_err_msg
, sizeof nml_err_msg
)
2933 if (dtp
->u
.p
.current_unit
->unit_number
!= options
.stdin_unit
)
2936 u
= find_unit (options
.stderr_unit
);
2937 st_printf ("%s\n", nml_err_msg
);
2947 dtp
->u
.p
.eof_jump
= NULL
;
2952 /* All namelist error calls return from here */
2956 dtp
->u
.p
.eof_jump
= NULL
;
2959 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, nml_err_msg
);