1 /* Copyright (C) 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010
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 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 (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 (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');
1203 /* Match "NAN(alphanum)". */
1206 for ( ; c != ')'; c = next_char (dtp))
1207 if (is_separator (c))
1212 push_char (dtp, ')');
1213 c = next_char (dtp);
1214 if (is_separator (c))
1215 unget_char (dtp, c);
1222 if (nml_bad_return (dtp, c))
1227 sprintf (message, "Bad floating point number for item %d",
1228 dtp->u.p.item_count);
1229 generate_error (&dtp->common, LIBERROR_READ_VALUE, message);
1235 /* Reading a complex number is straightforward because we can tell
1236 what it is right away. */
1239 read_complex (st_parameter_dt *dtp, void * dest, int kind, size_t size)
1244 if (parse_repeat (dtp))
1247 c = next_char (dtp);
1254 unget_char (dtp, c);
1255 eat_separator (dtp);
1263 if (parse_real (dtp, dest, kind))
1268 c = next_char (dtp);
1269 if (c == '\n' || c== '\r')
1272 unget_char (dtp, c);
1275 != (dtp->u.p.current_unit->decimal_status == DECIMAL_POINT ? ',' : ';'))
1280 c = next_char (dtp);
1281 if (c == '\n' || c== '\r')
1284 unget_char (dtp, c);
1286 if (parse_real (dtp, dest + size / 2, kind))
1290 if (next_char (dtp) != ')')
1293 c = next_char (dtp);
1294 if (!is_separator (c))
1297 unget_char (dtp, c);
1298 eat_separator (dtp);
1301 dtp->u.p.saved_type = BT_COMPLEX;
1306 if (nml_bad_return (dtp, c))
1311 sprintf (message, "Bad complex value in item %d of list input",
1312 dtp->u.p.item_count);
1313 generate_error (&dtp->common, LIBERROR_READ_VALUE, message);
1317 /* Parse a real number with a possible repeat count. */
1320 read_real (st_parameter_dt *dtp, void * dest, int length)
1322 char c, message[100];
1328 c = next_char (dtp);
1329 if (c == ',' && dtp->u.p.current_unit->decimal_status == DECIMAL_COMMA)
1347 unget_char (dtp, c); /* Single null. */
1348 eat_separator (dtp);
1361 /* Get the digit string that might be a repeat count. */
1365 c = next_char (dtp);
1366 if (c == ',' && dtp->u.p.current_unit->decimal_status == DECIMAL_COMMA)
1390 push_char (dtp, 'e');
1392 c = next_char (dtp);
1396 push_char (dtp, '\0');
1400 if (c != '\n' && c != ',' && c != '\r' && c != ';')
1401 unget_char (dtp, c);
1410 if (convert_integer (dtp, -1, 0))
1413 /* Now get the number itself. */
1415 c = next_char (dtp);
1416 if (is_separator (c))
1417 { /* Repeated null value. */
1418 unget_char (dtp, c);
1419 eat_separator (dtp);
1423 if (c != '-' && c != '+')
1424 push_char (dtp, '+');
1429 c = next_char (dtp);
1432 if (c == ',' && dtp->u.p.current_unit->decimal_status == DECIMAL_COMMA)
1435 if (!isdigit (c) && c != '.')
1437 if (c == 'i' || c == 'I' || c == 'n' || c == 'N')
1456 c = next_char (dtp);
1457 if (c == ',' && dtp->u.p.current_unit->decimal_status == DECIMAL_COMMA)
1484 push_char (dtp, 'e');
1486 c = next_char (dtp);
1495 push_char (dtp, 'e');
1497 c = next_char (dtp);
1498 if (c != '+' && c != '-')
1499 push_char (dtp, '+');
1503 c = next_char (dtp);
1513 c = next_char (dtp);
1530 unget_char (dtp, c);
1531 eat_separator (dtp);
1532 push_char (dtp, '\0');
1533 if (convert_real (dtp, dest, dtp->u.p.saved_string, length))
1537 dtp->u.p.saved_type = BT_REAL;
1541 l_push_char (dtp, c);
1544 /* Match INF and Infinity. */
1545 if (c == 'i' || c == 'I')
1547 c = next_char (dtp);
1548 l_push_char (dtp, c);
1549 if (c != 'n' && c != 'N')
1551 c = next_char (dtp);
1552 l_push_char (dtp, c);
1553 if (c != 'f' && c != 'F')
1555 c = next_char (dtp);
1556 l_push_char (dtp, c);
1557 if (!is_separator (c))
1559 if (c != 'i' && c != 'I')
1561 c = next_char (dtp);
1562 l_push_char (dtp, c);
1563 if (c != 'n' && c != 'N')
1565 c = next_char (dtp);
1566 l_push_char (dtp, c);
1567 if (c != 'i' && c != 'I')
1569 c = next_char (dtp);
1570 l_push_char (dtp, c);
1571 if (c != 't' && c != 'T')
1573 c = next_char (dtp);
1574 l_push_char (dtp, c);
1575 if (c != 'y' && c != 'Y')
1577 c = next_char (dtp);
1578 l_push_char (dtp, c);
1584 c = next_char (dtp);
1585 l_push_char (dtp, c);
1586 if (c != 'a' && c != 'A')
1588 c = next_char (dtp);
1589 l_push_char (dtp, c);
1590 if (c != 'n' && c != 'N')
1592 c = next_char (dtp);
1593 l_push_char (dtp, c);
1595 /* Match NAN(alphanum). */
1598 for (c = next_char (dtp); c != ')'; c = next_char (dtp))
1599 if (is_separator (c))
1602 l_push_char (dtp, c);
1604 l_push_char (dtp, ')');
1605 c = next_char (dtp);
1606 l_push_char (dtp, c);
1610 if (!is_separator (c))
1613 if (dtp->u.p.namelist_mode)
1615 if (c == ' ' || c =='\n' || c == '\r')
1618 c = next_char (dtp);
1619 while (c == ' ' || c =='\n' || c == '\r');
1621 l_push_char (dtp, c);
1630 push_char (dtp, 'i');
1631 push_char (dtp, 'n');
1632 push_char (dtp, 'f');
1636 push_char (dtp, 'n');
1637 push_char (dtp, 'a');
1638 push_char (dtp, 'n');
1645 if (dtp->u.p.namelist_mode)
1647 dtp->u.p.nml_read_error = 1;
1648 dtp->u.p.line_buffer_enabled = 1;
1649 dtp->u.p.item_count = 0;
1655 if (nml_bad_return (dtp, c))
1660 sprintf (message, "Bad real number in item %d of list input",
1661 dtp->u.p.item_count);
1662 generate_error (&dtp->common, LIBERROR_READ_VALUE, message);
1666 /* Check the current type against the saved type to make sure they are
1667 compatible. Returns nonzero if incompatible. */
1670 check_type (st_parameter_dt *dtp, bt type, int len)
1674 if (dtp->u.p.saved_type != BT_NULL && dtp->u.p.saved_type != type)
1676 sprintf (message, "Read type %s where %s was expected for item %d",
1677 type_name (dtp->u.p.saved_type), type_name (type),
1678 dtp->u.p.item_count);
1680 generate_error (&dtp->common, LIBERROR_READ_VALUE, message);
1684 if (dtp->u.p.saved_type == BT_NULL || dtp->u.p.saved_type == BT_CHARACTER)
1687 if (dtp->u.p.saved_length != len)
1690 "Read kind %d %s where kind %d is required for item %d",
1691 dtp->u.p.saved_length, type_name (dtp->u.p.saved_type), len,
1692 dtp->u.p.item_count);
1693 generate_error (&dtp->common, LIBERROR_READ_VALUE, message);
1701 /* Top level data transfer subroutine for list reads. Because we have
1702 to deal with repeat counts, the data item is always saved after
1703 reading, usually in the dtp->u.p.value[] array. If a repeat count is
1704 greater than one, we copy the data item multiple times. */
1707 list_formatted_read_scalar (st_parameter_dt *dtp, volatile bt type, void *p,
1708 int kind, size_t size)
1715 dtp->u.p.namelist_mode = 0;
1717 dtp->u.p.eof_jump = &eof_jump;
1718 if (setjmp (eof_jump))
1720 generate_error (&dtp->common, LIBERROR_END, NULL);
1721 if (!is_internal_unit (dtp))
1723 dtp->u.p.current_unit->endfile = AFTER_ENDFILE;
1724 dtp->u.p.current_unit->current_record = 0;
1729 if (dtp->u.p.first_item)
1731 dtp->u.p.first_item = 0;
1732 dtp->u.p.input_complete = 0;
1733 dtp->u.p.repeat_count = 1;
1734 dtp->u.p.at_eol = 0;
1736 c = eat_spaces (dtp);
1737 if (is_separator (c))
1739 /* Found a null value. */
1740 eat_separator (dtp);
1741 dtp->u.p.repeat_count = 0;
1743 /* eat_separator sets this flag if the separator was a comma. */
1744 if (dtp->u.p.comma_flag)
1747 /* eat_separator sets this flag if the separator was a \n or \r. */
1748 if (dtp->u.p.at_eol)
1749 finish_separator (dtp);
1757 if (dtp->u.p.repeat_count > 0)
1759 if (check_type (dtp, type, kind))
1764 if (dtp->u.p.input_complete)
1767 if (dtp->u.p.at_eol)
1768 finish_separator (dtp);
1772 /* Trailing spaces prior to end of line. */
1773 if (dtp->u.p.at_eol)
1774 finish_separator (dtp);
1777 dtp->u.p.saved_type = BT_NULL;
1778 dtp->u.p.repeat_count = 1;
1784 read_integer (dtp, kind);
1787 read_logical (dtp, kind);
1790 read_character (dtp, kind);
1793 read_real (dtp, p, kind);
1794 /* Copy value back to temporary if needed. */
1795 if (dtp->u.p.repeat_count > 0)
1796 memcpy (dtp->u.p.value, p, kind);
1799 read_complex (dtp, p, kind, size);
1800 /* Copy value back to temporary if needed. */
1801 if (dtp->u.p.repeat_count > 0)
1802 memcpy (dtp->u.p.value, p, size);
1805 internal_error (&dtp->common, "Bad type for list read");
1808 if (dtp->u.p.saved_type != BT_CHARACTER && dtp->u.p.saved_type != BT_NULL)
1809 dtp->u.p.saved_length = size;
1811 if ((dtp->common.flags & IOPARM_LIBRETURN_MASK) != IOPARM_LIBRETURN_OK)
1815 switch (dtp->u.p.saved_type)
1819 if (dtp->u.p.repeat_count > 0)
1820 memcpy (p, dtp->u.p.value, size);
1825 memcpy (p, dtp->u.p.value, size);
1829 if (dtp->u.p.saved_string)
1831 m = ((int) size < dtp->u.p.saved_used)
1832 ? (int) size : dtp->u.p.saved_used;
1834 memcpy (p, dtp->u.p.saved_string, m);
1837 q = (gfc_char4_t *) p;
1838 for (i = 0; i < m; i++)
1839 q[i] = (unsigned char) dtp->u.p.saved_string[i];
1843 /* Just delimiters encountered, nothing to copy but SPACE. */
1849 memset (((char *) p) + m, ' ', size - m);
1852 q = (gfc_char4_t *) p;
1853 for (i = m; i < (int) size; i++)
1854 q[i] = (unsigned char) ' ';
1863 if (--dtp->u.p.repeat_count <= 0)
1867 dtp->u.p.eof_jump = NULL;
1872 list_formatted_read (st_parameter_dt *dtp, bt type, void *p, int kind,
1873 size_t size, size_t nelems)
1877 size_t stride = type == BT_CHARACTER ?
1878 size * GFC_SIZE_OF_CHAR_KIND(kind) : size;
1882 /* Big loop over all the elements. */
1883 for (elem = 0; elem < nelems; elem++)
1885 dtp->u.p.item_count++;
1886 list_formatted_read_scalar (dtp, type, tmp + stride*elem, kind, size);
1891 /* Finish a list read. */
1894 finish_list_read (st_parameter_dt *dtp)
1900 fbuf_flush (dtp->u.p.current_unit, dtp->u.p.mode);
1902 if (dtp->u.p.at_eol)
1904 dtp->u.p.at_eol = 0;
1910 c = next_char (dtp);
1914 if (dtp->u.p.current_unit->endfile != NO_ENDFILE)
1916 generate_error (&dtp->common, LIBERROR_END, NULL);
1917 dtp->u.p.current_unit->endfile = AFTER_ENDFILE;
1918 dtp->u.p.current_unit->current_record = 0;
1924 void namelist_read (st_parameter_dt *dtp)
1926 static void nml_match_name (char *name, int len)
1927 static int nml_query (st_parameter_dt *dtp)
1928 static int nml_get_obj_data (st_parameter_dt *dtp,
1929 namelist_info **prev_nl, char *, size_t)
1931 static void nml_untouch_nodes (st_parameter_dt *dtp)
1932 static namelist_info * find_nml_node (st_parameter_dt *dtp,
1934 static int nml_parse_qualifier(descriptor_dimension * ad,
1935 array_loop_spec * ls, int rank, char *)
1936 static void nml_touch_nodes (namelist_info * nl)
1937 static int nml_read_obj (namelist_info *nl, index_type offset,
1938 namelist_info **prev_nl, char *, size_t,
1939 index_type clow, index_type chigh)
1943 /* Inputs a rank-dimensional qualifier, which can contain
1944 singlets, doublets, triplets or ':' with the standard meanings. */
1947 nml_parse_qualifier (st_parameter_dt *dtp, descriptor_dimension *ad,
1948 array_loop_spec *ls, int rank, char *parse_err_msg,
1955 int is_array_section, is_char;
1959 is_array_section = 0;
1960 dtp->u.p.expanded_read = 0;
1962 /* See if this is a character substring qualifier we are looking for. */
1969 /* The next character in the stream should be the '('. */
1971 c = next_char (dtp);
1973 /* Process the qualifier, by dimension and triplet. */
1975 for (dim=0; dim < rank; dim++ )
1977 for (indx=0; indx<3; indx++)
1983 /* Process a potential sign. */
1984 c = next_char (dtp);
1995 unget_char (dtp, c);
1999 /* Process characters up to the next ':' , ',' or ')'. */
2002 c = next_char (dtp);
2007 is_array_section = 1;
2011 if ((c==',' && dim == rank -1)
2012 || (c==')' && dim < rank -1))
2015 sprintf (parse_err_msg, "Bad substring qualifier");
2017 sprintf (parse_err_msg, "Bad number of index fields");
2026 case ' ': case '\t':
2028 c = next_char (dtp);
2033 sprintf (parse_err_msg,
2034 "Bad character in substring qualifier");
2036 sprintf (parse_err_msg, "Bad character in index");
2040 if ((c == ',' || c == ')') && indx == 0
2041 && dtp->u.p.saved_string == 0)
2044 sprintf (parse_err_msg, "Null substring qualifier");
2046 sprintf (parse_err_msg, "Null index field");
2050 if ((c == ':' && indx == 1 && dtp->u.p.saved_string == 0)
2051 || (indx == 2 && dtp->u.p.saved_string == 0))
2054 sprintf (parse_err_msg, "Bad substring qualifier");
2056 sprintf (parse_err_msg, "Bad index triplet");
2060 if (is_char && !is_array_section)
2062 sprintf (parse_err_msg,
2063 "Missing colon in substring qualifier");
2067 /* If '( : ? )' or '( ? : )' break and flag read failure. */
2069 if ((c == ':' && indx == 0 && dtp->u.p.saved_string == 0)
2070 || (indx==1 && dtp->u.p.saved_string == 0))
2076 /* Now read the index. */
2077 if (convert_integer (dtp, sizeof(ssize_t), neg))
2080 sprintf (parse_err_msg, "Bad integer substring qualifier");
2082 sprintf (parse_err_msg, "Bad integer in index");
2088 /* Feed the index values to the triplet arrays. */
2092 memcpy (&ls[dim].start, dtp->u.p.value, sizeof(ssize_t));
2094 memcpy (&ls[dim].end, dtp->u.p.value, sizeof(ssize_t));
2096 memcpy (&ls[dim].step, dtp->u.p.value, sizeof(ssize_t));
2099 /* Singlet or doublet indices. */
2100 if (c==',' || c==')')
2104 memcpy (&ls[dim].start, dtp->u.p.value, sizeof(ssize_t));
2106 /* If -std=f95/2003 or an array section is specified,
2107 do not allow excess data to be processed. */
2108 if (is_array_section == 1
2109 || !(compile_options.allow_std & GFC_STD_GNU))
2110 ls[dim].end = ls[dim].start;
2112 dtp->u.p.expanded_read = 1;
2115 /* Check for non-zero rank. */
2116 if (is_array_section == 1 && ls[dim].start != ls[dim].end)
2123 if (is_array_section == 1 && dtp->u.p.expanded_read == 1)
2126 dtp->u.p.expanded_read = 0;
2127 for (i = 0; i < dim; i++)
2128 ls[i].end = ls[i].start;
2131 /* Check the values of the triplet indices. */
2132 if ((ls[dim].start > (ssize_t) GFC_DIMENSION_UBOUND(ad[dim]))
2133 || (ls[dim].start < (ssize_t) GFC_DIMENSION_LBOUND(ad[dim]))
2134 || (ls[dim].end > (ssize_t) GFC_DIMENSION_UBOUND(ad[dim]))
2135 || (ls[dim].end < (ssize_t) GFC_DIMENSION_LBOUND(ad[dim])))
2138 sprintf (parse_err_msg, "Substring out of range");
2140 sprintf (parse_err_msg, "Index %d out of range", dim + 1);
2144 if (((ls[dim].end - ls[dim].start ) * ls[dim].step < 0)
2145 || (ls[dim].step == 0))
2147 sprintf (parse_err_msg, "Bad range in index %d", dim + 1);
2151 /* Initialise the loop index counter. */
2152 ls[dim].idx = ls[dim].start;
2162 static namelist_info *
2163 find_nml_node (st_parameter_dt *dtp, char * var_name)
2165 namelist_info * t = dtp->u.p.ionml;
2168 if (strcmp (var_name, t->var_name) == 0)
2178 /* Visits all the components of a derived type that have
2179 not explicitly been identified in the namelist input.
2180 touched is set and the loop specification initialised
2181 to default values */
2184 nml_touch_nodes (namelist_info * nl)
2186 index_type len = strlen (nl->var_name) + 1;
2188 char * ext_name = (char*)get_mem (len + 1);
2189 memcpy (ext_name, nl->var_name, len-1);
2190 memcpy (ext_name + len - 1, "%", 2);
2191 for (nl = nl->next; nl; nl = nl->next)
2193 if (strncmp (nl->var_name, ext_name, len) == 0)
2196 for (dim=0; dim < nl->var_rank; dim++)
2198 nl->ls[dim].step = 1;
2199 nl->ls[dim].end = GFC_DESCRIPTOR_UBOUND(nl,dim);
2200 nl->ls[dim].start = GFC_DESCRIPTOR_LBOUND(nl,dim);
2201 nl->ls[dim].idx = nl->ls[dim].start;
2211 /* Resets touched for the entire list of nml_nodes, ready for a
2215 nml_untouch_nodes (st_parameter_dt *dtp)
2218 for (t = dtp->u.p.ionml; t; t = t->next)
2223 /* Attempts to input name to namelist name. Returns
2224 dtp->u.p.nml_read_error = 1 on no match. */
2227 nml_match_name (st_parameter_dt *dtp, const char *name, index_type len)
2231 dtp->u.p.nml_read_error = 0;
2232 for (i = 0; i < len; i++)
2234 c = next_char (dtp);
2235 if (tolower (c) != tolower (name[i]))
2237 dtp->u.p.nml_read_error = 1;
2243 /* If the namelist read is from stdin, output the current state of the
2244 namelist to stdout. This is used to implement the non-standard query
2245 features, ? and =?. If c == '=' the full namelist is printed. Otherwise
2246 the names alone are printed. */
2249 nml_query (st_parameter_dt *dtp, char c)
2251 gfc_unit * temp_unit;
2256 static const index_type endlen = 3;
2257 static const char endl[] = "\r\n";
2258 static const char nmlend[] = "&end\r\n";
2260 static const index_type endlen = 2;
2261 static const char endl[] = "\n";
2262 static const char nmlend[] = "&end\n";
2265 if (dtp->u.p.current_unit->unit_number != options.stdin_unit)
2268 /* Store the current unit and transfer to stdout. */
2270 temp_unit = dtp->u.p.current_unit;
2271 dtp->u.p.current_unit = find_unit (options.stdout_unit);
2273 if (dtp->u.p.current_unit)
2275 dtp->u.p.mode = WRITING;
2276 next_record (dtp, 0);
2278 /* Write the namelist in its entirety. */
2281 namelist_write (dtp);
2283 /* Or write the list of names. */
2287 /* "&namelist_name\n" */
2289 len = dtp->namelist_name_len;
2290 p = write_block (dtp, len + endlen);
2294 memcpy ((char*)(p + 1), dtp->namelist_name, len);
2295 memcpy ((char*)(p + len + 1), &endl, endlen - 1);
2296 for (nl = dtp->u.p.ionml; nl; nl = nl->next)
2300 len = strlen (nl->var_name);
2301 p = write_block (dtp, len + endlen);
2305 memcpy ((char*)(p + 1), nl->var_name, len);
2306 memcpy ((char*)(p + len + 1), &endl, endlen - 1);
2311 p = write_block (dtp, endlen + 3);
2313 memcpy (p, &nmlend, endlen + 3);
2316 /* Flush the stream to force immediate output. */
2318 fbuf_flush (dtp->u.p.current_unit, WRITING);
2319 sflush (dtp->u.p.current_unit->s);
2320 unlock_unit (dtp->u.p.current_unit);
2325 /* Restore the current unit. */
2327 dtp->u.p.current_unit = temp_unit;
2328 dtp->u.p.mode = READING;
2332 /* Reads and stores the input for the namelist object nl. For an array,
2333 the function loops over the ranges defined by the loop specification.
2334 This default to all the data or to the specification from a qualifier.
2335 nml_read_obj recursively calls itself to read derived types. It visits
2336 all its own components but only reads data for those that were touched
2337 when the name was parsed. If a read error is encountered, an attempt is
2338 made to return to read a new object name because the standard allows too
2339 little data to be available. On the other hand, too much data is an
2343 nml_read_obj (st_parameter_dt *dtp, namelist_info * nl, index_type offset,
2344 namelist_info **pprev_nl, char *nml_err_msg,
2345 size_t nml_err_msg_size, index_type clow, index_type chigh)
2347 namelist_info * cmp;
2354 size_t obj_name_len;
2357 /* This object not touched in name parsing. */
2362 dtp->u.p.repeat_count = 0;
2368 case GFC_DTYPE_INTEGER:
2369 case GFC_DTYPE_LOGICAL:
2373 case GFC_DTYPE_REAL:
2374 dlen = size_from_real_kind (len);
2377 case GFC_DTYPE_COMPLEX:
2378 dlen = size_from_complex_kind (len);
2381 case GFC_DTYPE_CHARACTER:
2382 dlen = chigh ? (chigh - clow + 1) : nl->string_length;
2391 /* Update the pointer to the data, using the current index vector */
2393 pdata = (void*)(nl->mem_pos + offset);
2394 for (dim = 0; dim < nl->var_rank; dim++)
2395 pdata = (void*)(pdata + (nl->ls[dim].idx
2396 - GFC_DESCRIPTOR_LBOUND(nl,dim))
2397 * GFC_DESCRIPTOR_STRIDE(nl,dim) * nl->size);
2399 /* Reset the error flag and try to read next value, if
2400 dtp->u.p.repeat_count=0 */
2402 dtp->u.p.nml_read_error = 0;
2404 if (--dtp->u.p.repeat_count <= 0)
2406 if (dtp->u.p.input_complete)
2408 if (dtp->u.p.at_eol)
2409 finish_separator (dtp);
2410 if (dtp->u.p.input_complete)
2413 /* BT_NULL (equivalent to GFC_DTYPE_UNKNOWN) falls through
2414 for nulls and is detected at default: of switch block. */
2416 dtp->u.p.saved_type = BT_NULL;
2421 case GFC_DTYPE_INTEGER:
2422 read_integer (dtp, len);
2425 case GFC_DTYPE_LOGICAL:
2426 read_logical (dtp, len);
2429 case GFC_DTYPE_CHARACTER:
2430 read_character (dtp, len);
2433 case GFC_DTYPE_REAL:
2434 /* Need to copy data back from the real location to the temp in order
2435 to handle nml reads into arrays. */
2436 read_real (dtp, pdata, len);
2437 memcpy (dtp->u.p.value, pdata, dlen);
2440 case GFC_DTYPE_COMPLEX:
2441 /* Same as for REAL, copy back to temp. */
2442 read_complex (dtp, pdata, len, dlen);
2443 memcpy (dtp->u.p.value, pdata, dlen);
2446 case GFC_DTYPE_DERIVED:
2447 obj_name_len = strlen (nl->var_name) + 1;
2448 obj_name = get_mem (obj_name_len+1);
2449 memcpy (obj_name, nl->var_name, obj_name_len-1);
2450 memcpy (obj_name + obj_name_len - 1, "%", 2);
2452 /* If reading a derived type, disable the expanded read warning
2453 since a single object can have multiple reads. */
2454 dtp->u.p.expanded_read = 0;
2456 /* Now loop over the components. Update the component pointer
2457 with the return value from nml_write_obj. This loop jumps
2458 past nested derived types by testing if the potential
2459 component name contains '%'. */
2461 for (cmp = nl->next;
2463 !strncmp (cmp->var_name, obj_name, obj_name_len) &&
2464 !strchr (cmp->var_name + obj_name_len, '%');
2468 if (nml_read_obj (dtp, cmp, (index_type)(pdata - nl->mem_pos),
2469 pprev_nl, nml_err_msg, nml_err_msg_size,
2470 clow, chigh) == FAILURE)
2476 if (dtp->u.p.input_complete)
2487 snprintf (nml_err_msg, nml_err_msg_size,
2488 "Bad type for namelist object %s", nl->var_name);
2489 internal_error (&dtp->common, nml_err_msg);
2494 /* The standard permits array data to stop short of the number of
2495 elements specified in the loop specification. In this case, we
2496 should be here with dtp->u.p.nml_read_error != 0. Control returns to
2497 nml_get_obj_data and an attempt is made to read object name. */
2500 if (dtp->u.p.nml_read_error)
2502 dtp->u.p.expanded_read = 0;
2506 if (dtp->u.p.saved_type == BT_NULL)
2508 dtp->u.p.expanded_read = 0;
2512 /* Note the switch from GFC_DTYPE_type to BT_type at this point.
2513 This comes about because the read functions return BT_types. */
2515 switch (dtp->u.p.saved_type)
2522 memcpy (pdata, dtp->u.p.value, dlen);
2526 m = (dlen < dtp->u.p.saved_used) ? dlen : dtp->u.p.saved_used;
2527 pdata = (void*)( pdata + clow - 1 );
2528 memcpy (pdata, dtp->u.p.saved_string, m);
2530 memset ((void*)( pdata + m ), ' ', dlen - m);
2537 /* Warn if a non-standard expanded read occurs. A single read of a
2538 single object is acceptable. If a second read occurs, issue a warning
2539 and set the flag to zero to prevent further warnings. */
2540 if (dtp->u.p.expanded_read == 2)
2542 notify_std (&dtp->common, GFC_STD_GNU, "Non-standard expanded namelist read.");
2543 dtp->u.p.expanded_read = 0;
2546 /* If the expanded read warning flag is set, increment it,
2547 indicating that a single read has occurred. */
2548 if (dtp->u.p.expanded_read >= 1)
2549 dtp->u.p.expanded_read++;
2551 /* Break out of loop if scalar. */
2555 /* Now increment the index vector. */
2560 for (dim = 0; dim < nl->var_rank; dim++)
2562 nl->ls[dim].idx += nml_carry * nl->ls[dim].step;
2564 if (((nl->ls[dim].step > 0) && (nl->ls[dim].idx > nl->ls[dim].end))
2566 ((nl->ls[dim].step < 0) && (nl->ls[dim].idx < nl->ls[dim].end)))
2568 nl->ls[dim].idx = nl->ls[dim].start;
2572 } while (!nml_carry);
2574 if (dtp->u.p.repeat_count > 1)
2576 snprintf (nml_err_msg, nml_err_msg_size,
2577 "Repeat count too large for namelist object %s", nl->var_name);
2587 /* Parses the object name, including array and substring qualifiers. It
2588 iterates over derived type components, touching those components and
2589 setting their loop specifications, if there is a qualifier. If the
2590 object is itself a derived type, its components and subcomponents are
2591 touched. nml_read_obj is called at the end and this reads the data in
2592 the manner specified by the object name. */
2595 nml_get_obj_data (st_parameter_dt *dtp, namelist_info **pprev_nl,
2596 char *nml_err_msg, size_t nml_err_msg_size)
2600 namelist_info * first_nl = NULL;
2601 namelist_info * root_nl = NULL;
2602 int dim, parsed_rank;
2603 int component_flag, qualifier_flag;
2604 index_type clow, chigh;
2605 int non_zero_rank_count;
2607 /* Look for end of input or object name. If '?' or '=?' are encountered
2608 in stdin, print the node names or the namelist to stdout. */
2610 eat_separator (dtp);
2611 if (dtp->u.p.input_complete)
2614 if (dtp->u.p.at_eol)
2615 finish_separator (dtp);
2616 if (dtp->u.p.input_complete)
2619 c = next_char (dtp);
2623 c = next_char (dtp);
2626 sprintf (nml_err_msg, "namelist read: misplaced = sign");
2629 nml_query (dtp, '=');
2633 nml_query (dtp, '?');
2638 nml_match_name (dtp, "end", 3);
2639 if (dtp->u.p.nml_read_error)
2641 sprintf (nml_err_msg, "namelist not terminated with / or &end");
2645 dtp->u.p.input_complete = 1;
2652 /* Untouch all nodes of the namelist and reset the flags that are set for
2653 derived type components. */
2655 nml_untouch_nodes (dtp);
2658 non_zero_rank_count = 0;
2660 /* Get the object name - should '!' and '\n' be permitted separators? */
2668 if (!is_separator (c))
2669 push_char (dtp, tolower(c));
2670 c = next_char (dtp);
2671 } while (!( c=='=' || c==' ' || c=='\t' || c =='(' || c =='%' ));
2673 unget_char (dtp, c);
2675 /* Check that the name is in the namelist and get pointer to object.
2676 Three error conditions exist: (i) An attempt is being made to
2677 identify a non-existent object, following a failed data read or
2678 (ii) The object name does not exist or (iii) Too many data items
2679 are present for an object. (iii) gives the same error message
2682 push_char (dtp, '\0');
2686 size_t var_len = strlen (root_nl->var_name);
2688 = dtp->u.p.saved_string ? strlen (dtp->u.p.saved_string) : 0;
2689 char ext_name[var_len + saved_len + 1];
2691 memcpy (ext_name, root_nl->var_name, var_len);
2692 if (dtp->u.p.saved_string)
2693 memcpy (ext_name + var_len, dtp->u.p.saved_string, saved_len);
2694 ext_name[var_len + saved_len] = '\0';
2695 nl = find_nml_node (dtp, ext_name);
2698 nl = find_nml_node (dtp, dtp->u.p.saved_string);
2702 if (dtp->u.p.nml_read_error && *pprev_nl)
2703 snprintf (nml_err_msg, nml_err_msg_size,
2704 "Bad data for namelist object %s", (*pprev_nl)->var_name);
2707 snprintf (nml_err_msg, nml_err_msg_size,
2708 "Cannot match namelist object name %s",
2709 dtp->u.p.saved_string);
2714 /* Get the length, data length, base pointer and rank of the variable.
2715 Set the default loop specification first. */
2717 for (dim=0; dim < nl->var_rank; dim++)
2719 nl->ls[dim].step = 1;
2720 nl->ls[dim].end = GFC_DESCRIPTOR_UBOUND(nl,dim);
2721 nl->ls[dim].start = GFC_DESCRIPTOR_LBOUND(nl,dim);
2722 nl->ls[dim].idx = nl->ls[dim].start;
2725 /* Check to see if there is a qualifier: if so, parse it.*/
2727 if (c == '(' && nl->var_rank)
2730 if (nml_parse_qualifier (dtp, nl->dim, nl->ls, nl->var_rank,
2731 nml_err_msg, &parsed_rank) == FAILURE)
2733 char *nml_err_msg_end = strchr (nml_err_msg, '\0');
2734 snprintf (nml_err_msg_end,
2735 nml_err_msg_size - (nml_err_msg_end - nml_err_msg),
2736 " for namelist variable %s", nl->var_name);
2739 if (parsed_rank > 0)
2740 non_zero_rank_count++;
2744 c = next_char (dtp);
2745 unget_char (dtp, c);
2747 else if (nl->var_rank > 0)
2748 non_zero_rank_count++;
2750 /* Now parse a derived type component. The root namelist_info address
2751 is backed up, as is the previous component level. The component flag
2752 is set and the iteration is made by jumping back to get_name. */
2756 if (nl->type != GFC_DTYPE_DERIVED)
2758 snprintf (nml_err_msg, nml_err_msg_size,
2759 "Attempt to get derived component for %s", nl->var_name);
2763 if (!component_flag)
2769 c = next_char (dtp);
2773 /* Parse a character qualifier, if present. chigh = 0 is a default
2774 that signals that the string length = string_length. */
2779 if (c == '(' && nl->type == GFC_DTYPE_CHARACTER)
2781 descriptor_dimension chd[1] = { {1, clow, nl->string_length} };
2782 array_loop_spec ind[1] = { {1, clow, nl->string_length, 1} };
2784 if (nml_parse_qualifier (dtp, chd, ind, -1, nml_err_msg, &parsed_rank)
2787 char *nml_err_msg_end = strchr (nml_err_msg, '\0');
2788 snprintf (nml_err_msg_end,
2789 nml_err_msg_size - (nml_err_msg_end - nml_err_msg),
2790 " for namelist variable %s", nl->var_name);
2794 clow = ind[0].start;
2797 if (ind[0].step != 1)
2799 snprintf (nml_err_msg, nml_err_msg_size,
2800 "Step not allowed in substring qualifier"
2801 " for namelist object %s", nl->var_name);
2805 c = next_char (dtp);
2806 unget_char (dtp, c);
2809 /* Make sure no extraneous qualifiers are there. */
2813 snprintf (nml_err_msg, nml_err_msg_size,
2814 "Qualifier for a scalar or non-character namelist object %s",
2819 /* Make sure there is no more than one non-zero rank object. */
2820 if (non_zero_rank_count > 1)
2822 snprintf (nml_err_msg, nml_err_msg_size,
2823 "Multiple sub-objects with non-zero rank in namelist object %s",
2825 non_zero_rank_count = 0;
2829 /* According to the standard, an equal sign MUST follow an object name. The
2830 following is possibly lax - it allows comments, blank lines and so on to
2831 intervene. eat_spaces (dtp); c = next_char (dtp); would be compliant*/
2835 eat_separator (dtp);
2836 if (dtp->u.p.input_complete)
2839 if (dtp->u.p.at_eol)
2840 finish_separator (dtp);
2841 if (dtp->u.p.input_complete)
2844 c = next_char (dtp);
2848 snprintf (nml_err_msg, nml_err_msg_size,
2849 "Equal sign must follow namelist object name %s",
2853 /* If a derived type, touch its components and restore the root
2854 namelist_info if we have parsed a qualified derived type
2857 if (nl->type == GFC_DTYPE_DERIVED)
2858 nml_touch_nodes (nl);
2862 if (first_nl->var_rank == 0)
2864 if (component_flag && qualifier_flag)
2871 if (nml_read_obj (dtp, nl, 0, pprev_nl, nml_err_msg, nml_err_msg_size,
2872 clow, chigh) == FAILURE)
2882 /* Entry point for namelist input. Goes through input until namelist name
2883 is matched. Then cycles through nml_get_obj_data until the input is
2884 completed or there is an error. */
2887 namelist_read (st_parameter_dt *dtp)
2891 char nml_err_msg[200];
2892 /* Pointer to the previously read object, in case attempt is made to read
2893 new object name. Should this fail, error message can give previous
2895 namelist_info *prev_nl = NULL;
2897 dtp->u.p.namelist_mode = 1;
2898 dtp->u.p.input_complete = 0;
2899 dtp->u.p.expanded_read = 0;
2901 dtp->u.p.eof_jump = &eof_jump;
2902 if (setjmp (eof_jump))
2904 dtp->u.p.eof_jump = NULL;
2905 generate_error (&dtp->common, LIBERROR_END, NULL);
2909 /* Look for &namelist_name . Skip all characters, testing for $nmlname.
2910 Exit on success or EOF. If '?' or '=?' encountered in stdin, print
2911 node names or namelist on stdout. */
2914 switch (c = next_char (dtp))
2925 c = next_char (dtp);
2927 nml_query (dtp, '=');
2929 unget_char (dtp, c);
2933 nml_query (dtp, '?');
2939 /* Match the name of the namelist. */
2941 nml_match_name (dtp, dtp->namelist_name, dtp->namelist_name_len);
2943 if (dtp->u.p.nml_read_error)
2946 /* A trailing space is required, we give a little lattitude here, 10.9.1. */
2947 c = next_char (dtp);
2948 if (!is_separator(c) && c != '!')
2950 unget_char (dtp, c);
2954 unget_char (dtp, c);
2955 eat_separator (dtp);
2957 /* Ready to read namelist objects. If there is an error in input
2958 from stdin, output the error message and continue. */
2960 while (!dtp->u.p.input_complete)
2962 if (nml_get_obj_data (dtp, &prev_nl, nml_err_msg, sizeof nml_err_msg)
2967 if (dtp->u.p.current_unit->unit_number != options.stdin_unit)
2970 u = find_unit (options.stderr_unit);
2971 st_printf ("%s\n", nml_err_msg);
2981 dtp->u.p.eof_jump = NULL;
2986 /* All namelist error calls return from here */
2990 dtp->u.p.eof_jump = NULL;
2993 generate_error (&dtp->common, LIBERROR_READ_VALUE, nml_err_msg);