1 /* Copyright (C) 2002-2016 Free Software Foundation, Inc.
2 Contributed by Andy Vaught
3 Namelist input contributed by Paul Thomas
4 F2003 I/O support contributed by Jerry DeLisle
6 This file is part of the GNU Fortran runtime library (libgfortran).
8 Libgfortran is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 Libgfortran is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 Under Section 7 of GPL version 3, you are granted additional
19 permissions described in the GCC Runtime Library Exception, version
20 3.1, as published by the Free Software Foundation.
22 You should have received a copy of the GNU General Public License and
23 a copy of the GCC Runtime Library Exception along with this program;
24 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
25 <http://www.gnu.org/licenses/>. */
35 typedef unsigned char uchar
;
38 /* List directed input. Several parsing subroutines are practically
39 reimplemented from formatted input, the reason being that there are
40 all kinds of small differences between formatted and list directed
44 /* Subroutines for reading characters from the input. Because a
45 repeat count is ambiguous with an integer, we have to read the
46 whole digit string before seeing if there is a '*' which signals
47 the repeat count. Since we can have a lot of potential leading
48 zeros, we have to be able to back up by arbitrary amount. Because
49 the input might not be seekable, we have to buffer the data
52 #define CASE_DIGITS case '0': case '1': case '2': case '3': case '4': \
53 case '5': case '6': case '7': case '8': case '9'
55 #define CASE_SEPARATORS case ' ': case ',': case '/': case '\n': \
56 case '\t': case '\r': case ';'
58 /* This macro assumes that we're operating on a variable. */
60 #define is_separator(c) (c == '/' || c == ',' || c == '\n' || c == ' ' \
61 || c == '\t' || c == '\r' || c == ';' || \
62 (dtp->u.p.namelist_mode && c == '!'))
64 /* Maximum repeat count. Less than ten times the maximum signed int32. */
66 #define MAX_REPEAT 200000000
72 /* Wrappers for calling the current worker functions. */
74 #define next_char(dtp) ((dtp)->u.p.current_unit->next_char_fn_ptr (dtp))
75 #define push_char(dtp, c) ((dtp)->u.p.current_unit->push_char_fn_ptr (dtp, c))
77 /* Worker function to save a default KIND=1 character to a string
78 buffer, enlarging it as necessary. */
81 push_char_default (st_parameter_dt
*dtp
, int c
)
85 if (dtp
->u
.p
.saved_string
== NULL
)
87 // Plain malloc should suffice here, zeroing not needed?
88 dtp
->u
.p
.saved_string
= xcalloc (SCRATCH_SIZE
, 1);
89 dtp
->u
.p
.saved_length
= SCRATCH_SIZE
;
90 dtp
->u
.p
.saved_used
= 0;
93 if (dtp
->u
.p
.saved_used
>= dtp
->u
.p
.saved_length
)
95 dtp
->u
.p
.saved_length
= 2 * dtp
->u
.p
.saved_length
;
96 dtp
->u
.p
.saved_string
=
97 xrealloc (dtp
->u
.p
.saved_string
, dtp
->u
.p
.saved_length
);
100 dtp
->u
.p
.saved_string
[dtp
->u
.p
.saved_used
++] = (char) c
;
104 /* Worker function to save a KIND=4 character to a string buffer,
105 enlarging the buffer as necessary. */
107 push_char4 (st_parameter_dt
*dtp
, int c
)
109 gfc_char4_t
*p
= (gfc_char4_t
*) dtp
->u
.p
.saved_string
;
113 dtp
->u
.p
.saved_string
= xcalloc (SCRATCH_SIZE
, sizeof (gfc_char4_t
));
114 dtp
->u
.p
.saved_length
= SCRATCH_SIZE
;
115 dtp
->u
.p
.saved_used
= 0;
116 p
= (gfc_char4_t
*) dtp
->u
.p
.saved_string
;
119 if (dtp
->u
.p
.saved_used
>= dtp
->u
.p
.saved_length
)
121 dtp
->u
.p
.saved_length
= 2 * dtp
->u
.p
.saved_length
;
122 dtp
->u
.p
.saved_string
=
123 xrealloc (dtp
->u
.p
.saved_string
,
124 dtp
->u
.p
.saved_length
* sizeof (gfc_char4_t
));
125 p
= (gfc_char4_t
*) dtp
->u
.p
.saved_string
;
128 p
[dtp
->u
.p
.saved_used
++] = c
;
132 /* Free the input buffer if necessary. */
135 free_saved (st_parameter_dt
*dtp
)
137 if (dtp
->u
.p
.saved_string
== NULL
)
140 free (dtp
->u
.p
.saved_string
);
142 dtp
->u
.p
.saved_string
= NULL
;
143 dtp
->u
.p
.saved_used
= 0;
147 /* Free the line buffer if necessary. */
150 free_line (st_parameter_dt
*dtp
)
152 dtp
->u
.p
.line_buffer_pos
= 0;
153 dtp
->u
.p
.line_buffer_enabled
= 0;
155 if (dtp
->u
.p
.line_buffer
== NULL
)
158 free (dtp
->u
.p
.line_buffer
);
159 dtp
->u
.p
.line_buffer
= NULL
;
163 /* Unget saves the last character so when reading the next character,
164 we need to check to see if there is a character waiting. Similar,
165 if the line buffer is being used to read_logical, check it too. */
168 check_buffers (st_parameter_dt
*dtp
)
173 if (dtp
->u
.p
.last_char
!= EOF
- 1)
176 c
= dtp
->u
.p
.last_char
;
177 dtp
->u
.p
.last_char
= EOF
- 1;
181 /* Read from line_buffer if enabled. */
183 if (dtp
->u
.p
.line_buffer_enabled
)
187 c
= dtp
->u
.p
.line_buffer
[dtp
->u
.p
.line_buffer_pos
];
188 if (c
!= '\0' && dtp
->u
.p
.line_buffer_pos
< 64)
190 dtp
->u
.p
.line_buffer
[dtp
->u
.p
.line_buffer_pos
] = '\0';
191 dtp
->u
.p
.line_buffer_pos
++;
195 dtp
->u
.p
.line_buffer_pos
= 0;
196 dtp
->u
.p
.line_buffer_enabled
= 0;
200 dtp
->u
.p
.at_eol
= (c
== '\n' || c
== '\r' || c
== EOF
);
205 /* Worker function for default character encoded file. */
207 next_char_default (st_parameter_dt
*dtp
)
211 /* Always check the unget and line buffer first. */
212 if ((c
= check_buffers (dtp
)))
215 c
= fbuf_getc (dtp
->u
.p
.current_unit
);
216 if (c
!= EOF
&& is_stream_io (dtp
))
217 dtp
->u
.p
.current_unit
->strm_pos
++;
219 dtp
->u
.p
.at_eol
= (c
== '\n' || c
== EOF
);
224 /* Worker function for internal and array I/O units. */
226 next_char_internal (st_parameter_dt
*dtp
)
232 /* Always check the unget and line buffer first. */
233 if ((c
= check_buffers (dtp
)))
236 /* Handle the end-of-record and end-of-file conditions for
237 internal array unit. */
238 if (is_array_io (dtp
))
243 /* Check for "end-of-record" condition. */
244 if (dtp
->u
.p
.current_unit
->bytes_left
== 0)
249 record
= next_array_record (dtp
, dtp
->u
.p
.current_unit
->ls
,
252 /* Check for "end-of-file" condition. */
259 record
*= dtp
->u
.p
.current_unit
->recl
;
260 if (sseek (dtp
->u
.p
.current_unit
->s
, record
, SEEK_SET
) < 0)
263 dtp
->u
.p
.current_unit
->bytes_left
= dtp
->u
.p
.current_unit
->recl
;
268 /* Get the next character and handle end-of-record conditions. */
270 if (dtp
->common
.unit
) /* Check for kind=4 internal unit. */
271 length
= sread (dtp
->u
.p
.current_unit
->s
, &c
, 1);
275 length
= sread (dtp
->u
.p
.current_unit
->s
, &cc
, 1);
279 if (unlikely (length
< 0))
281 generate_error (&dtp
->common
, LIBERROR_OS
, NULL
);
285 if (is_array_io (dtp
))
287 /* Check whether we hit EOF. */
288 if (unlikely (length
== 0))
290 generate_error (&dtp
->common
, LIBERROR_INTERNAL_UNIT
, NULL
);
293 dtp
->u
.p
.current_unit
->bytes_left
--;
307 dtp
->u
.p
.at_eol
= (c
== '\n' || c
== EOF
);
312 /* Worker function for UTF encoded files. */
314 next_char_utf8 (st_parameter_dt
*dtp
)
316 static const uchar masks
[6] = { 0x7F, 0x1F, 0x0F, 0x07, 0x02, 0x01 };
317 static const uchar patns
[6] = { 0x00, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC };
321 /* Always check the unget and line buffer first. */
322 if (!(c
= check_buffers (dtp
)))
323 c
= fbuf_getc (dtp
->u
.p
.current_unit
);
328 /* The number of leading 1-bits in the first byte indicates how many
330 for (nb
= 2; nb
< 7; nb
++)
331 if ((c
& ~masks
[nb
-1]) == patns
[nb
-1])
336 c
= (c
& masks
[nb
-1]);
338 /* Decode the bytes read. */
339 for (i
= 1; i
< nb
; i
++)
341 gfc_char4_t n
= fbuf_getc (dtp
->u
.p
.current_unit
);
342 if ((n
& 0xC0) != 0x80)
344 c
= ((c
<< 6) + (n
& 0x3F));
347 /* Make sure the shortest possible encoding was used. */
348 if (c
<= 0x7F && nb
> 1) goto invalid
;
349 if (c
<= 0x7FF && nb
> 2) goto invalid
;
350 if (c
<= 0xFFFF && nb
> 3) goto invalid
;
351 if (c
<= 0x1FFFFF && nb
> 4) goto invalid
;
352 if (c
<= 0x3FFFFFF && nb
> 5) goto invalid
;
354 /* Make sure the character is valid. */
355 if (c
> 0x7FFFFFFF || (c
>= 0xD800 && c
<= 0xDFFF))
359 dtp
->u
.p
.at_eol
= (c
== '\n' || c
== (gfc_char4_t
) EOF
);
363 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, "Invalid UTF-8 encoding");
364 return (gfc_char4_t
) '?';
367 /* Push a character back onto the input. */
370 unget_char (st_parameter_dt
*dtp
, int c
)
372 dtp
->u
.p
.last_char
= c
;
376 /* Skip over spaces in the input. Returns the nonspace character that
377 terminated the eating and also places it back on the input. */
380 eat_spaces (st_parameter_dt
*dtp
)
384 /* If internal character array IO, peak ahead and seek past spaces.
385 This is an optimization unique to character arrays with large
386 character lengths (PR38199). This code eliminates numerous calls
387 to next_character. */
388 if (is_array_io (dtp
) && (dtp
->u
.p
.last_char
== EOF
- 1))
390 gfc_offset offset
= stell (dtp
->u
.p
.current_unit
->s
);
393 if (dtp
->common
.unit
) /* kind=4 */
395 for (i
= 0; i
< dtp
->u
.p
.current_unit
->bytes_left
; i
++)
397 if (dtp
->internal_unit
[(offset
+ i
) * sizeof (gfc_char4_t
)]
404 for (i
= 0; i
< dtp
->u
.p
.current_unit
->bytes_left
; i
++)
406 if (dtp
->internal_unit
[offset
+ i
] != ' ')
413 sseek (dtp
->u
.p
.current_unit
->s
, offset
+ i
, SEEK_SET
);
414 dtp
->u
.p
.current_unit
->bytes_left
-= i
;
418 /* Now skip spaces, EOF and EOL are handled in next_char. */
421 while (c
!= EOF
&& (c
== ' ' || c
== '\r' || c
== '\t'));
428 /* This function reads characters through to the end of the current
429 line and just ignores them. Returns 0 for success and LIBERROR_END
433 eat_line (st_parameter_dt
*dtp
)
439 while (c
!= EOF
&& c
!= '\n');
446 /* Skip over a separator. Technically, we don't always eat the whole
447 separator. This is because if we've processed the last input item,
448 then a separator is unnecessary. Plus the fact that operating
449 systems usually deliver console input on a line basis.
451 The upshot is that if we see a newline as part of reading a
452 separator, we stop reading. If there are more input items, we
453 continue reading the separator with finish_separator() which takes
454 care of the fact that we may or may not have seen a comma as part
457 Returns 0 for success, and non-zero error code otherwise. */
460 eat_separator (st_parameter_dt
*dtp
)
466 dtp
->u
.p
.comma_flag
= 0;
468 if ((c
= next_char (dtp
)) == EOF
)
473 if (dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
480 dtp
->u
.p
.comma_flag
= 1;
485 dtp
->u
.p
.input_complete
= 1;
489 if ((n
= next_char(dtp
)) == EOF
)
499 if (dtp
->u
.p
.namelist_mode
)
503 if ((c
= next_char (dtp
)) == EOF
)
507 err
= eat_line (dtp
);
513 while (c
== '\n' || c
== '\r' || c
== ' ' || c
== '\t');
519 /* Eat a namelist comment. */
520 if (dtp
->u
.p
.namelist_mode
)
522 err
= eat_line (dtp
);
529 /* Fall Through... */
539 /* Finish processing a separator that was interrupted by a newline.
540 If we're here, then another data item is present, so we finish what
541 we started on the previous line. Return 0 on success, error code
545 finish_separator (st_parameter_dt
*dtp
)
548 int err
= LIBERROR_OK
;
553 if ((c
= next_char (dtp
)) == EOF
)
558 if (dtp
->u
.p
.comma_flag
)
562 if ((c
= eat_spaces (dtp
)) == EOF
)
564 if (c
== '\n' || c
== '\r')
571 dtp
->u
.p
.input_complete
= 1;
572 if (!dtp
->u
.p
.namelist_mode
)
581 if (dtp
->u
.p
.namelist_mode
)
583 err
= eat_line (dtp
);
597 /* This function is needed to catch bad conversions so that namelist can
598 attempt to see if dtp->u.p.saved_string contains a new object name rather
602 nml_bad_return (st_parameter_dt
*dtp
, char c
)
604 if (dtp
->u
.p
.namelist_mode
)
606 dtp
->u
.p
.nml_read_error
= 1;
613 /* Convert an unsigned string to an integer. The length value is -1
614 if we are working on a repeat count. Returns nonzero if we have a
615 range problem. As a side effect, frees the dtp->u.p.saved_string. */
618 convert_integer (st_parameter_dt
*dtp
, int length
, int negative
)
620 char c
, *buffer
, message
[MSGLEN
];
622 GFC_UINTEGER_LARGEST v
, max
, max10
;
623 GFC_INTEGER_LARGEST value
;
625 buffer
= dtp
->u
.p
.saved_string
;
632 max
= si_max (length
);
662 set_integer (dtp
->u
.p
.value
, value
, length
);
666 dtp
->u
.p
.repeat_count
= v
;
668 if (dtp
->u
.p
.repeat_count
== 0)
670 snprintf (message
, MSGLEN
, "Zero repeat count in item %d of list input",
671 dtp
->u
.p
.item_count
);
673 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
683 snprintf (message
, MSGLEN
, "Repeat count overflow in item %d of list input",
684 dtp
->u
.p
.item_count
);
686 snprintf (message
, MSGLEN
, "Integer overflow while reading item %d",
687 dtp
->u
.p
.item_count
);
690 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
696 /* Parse a repeat count for logical and complex values which cannot
697 begin with a digit. Returns nonzero if we are done, zero if we
698 should continue on. */
701 parse_repeat (st_parameter_dt
*dtp
)
703 char message
[MSGLEN
];
706 if ((c
= next_char (dtp
)) == EOF
)
730 repeat
= 10 * repeat
+ c
- '0';
732 if (repeat
> MAX_REPEAT
)
734 snprintf (message
, MSGLEN
,
735 "Repeat count overflow in item %d of list input",
736 dtp
->u
.p
.item_count
);
738 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
747 snprintf (message
, MSGLEN
,
748 "Zero repeat count in item %d of list input",
749 dtp
->u
.p
.item_count
);
751 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
763 dtp
->u
.p
.repeat_count
= repeat
;
777 snprintf (message
, MSGLEN
, "Bad repeat count in item %d of list input",
778 dtp
->u
.p
.item_count
);
779 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
784 /* To read a logical we have to look ahead in the input stream to make sure
785 there is not an equal sign indicating a variable name. To do this we use
786 line_buffer to point to a temporary buffer, pushing characters there for
787 possible later reading. */
790 l_push_char (st_parameter_dt
*dtp
, char c
)
792 if (dtp
->u
.p
.line_buffer
== NULL
)
793 dtp
->u
.p
.line_buffer
= xcalloc (SCRATCH_SIZE
, 1);
795 dtp
->u
.p
.line_buffer
[dtp
->u
.p
.line_buffer_pos
++] = c
;
799 /* Read a logical character on the input. */
802 read_logical (st_parameter_dt
*dtp
, int length
)
804 char message
[MSGLEN
];
807 if (parse_repeat (dtp
))
810 c
= tolower (next_char (dtp
));
811 l_push_char (dtp
, c
);
817 l_push_char (dtp
, c
);
819 if (!is_separator(c
) && c
!= EOF
)
827 l_push_char (dtp
, c
);
829 if (!is_separator(c
) && c
!= EOF
)
836 c
= tolower (next_char (dtp
));
852 if (!dtp
->u
.p
.namelist_mode
)
859 return; /* Null value. */
862 /* Save the character in case it is the beginning
863 of the next object name. */
868 dtp
->u
.p
.saved_type
= BT_LOGICAL
;
869 dtp
->u
.p
.saved_length
= length
;
871 /* Eat trailing garbage. */
874 while (c
!= EOF
&& !is_separator (c
));
878 set_integer ((int *) dtp
->u
.p
.value
, v
, length
);
885 for(i
= 0; i
< 63; i
++)
890 /* All done if this is not a namelist read. */
891 if (!dtp
->u
.p
.namelist_mode
)
904 l_push_char (dtp
, c
);
907 dtp
->u
.p
.nml_read_error
= 1;
908 dtp
->u
.p
.line_buffer_enabled
= 1;
909 dtp
->u
.p
.line_buffer_pos
= 0;
917 if (nml_bad_return (dtp
, c
))
933 snprintf (message
, MSGLEN
, "Bad logical value while reading item %d",
934 dtp
->u
.p
.item_count
);
936 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
941 dtp
->u
.p
.saved_type
= BT_LOGICAL
;
942 dtp
->u
.p
.saved_length
= length
;
943 set_integer ((int *) dtp
->u
.p
.value
, v
, length
);
949 /* Reading integers is tricky because we can actually be reading a
950 repeat count. We have to store the characters in a buffer because
951 we could be reading an integer that is larger than the default int
952 used for repeat counts. */
955 read_integer (st_parameter_dt
*dtp
, int length
)
957 char message
[MSGLEN
];
967 /* Fall through... */
970 if ((c
= next_char (dtp
)) == EOF
)
975 if (!dtp
->u
.p
.namelist_mode
)
978 CASE_SEPARATORS
: /* Single null. */
991 /* Take care of what may be a repeat count. */
1003 push_char (dtp
, '\0');
1007 if (!dtp
->u
.p
.namelist_mode
)
1010 CASE_SEPARATORS
: /* Not a repeat count. */
1020 if (convert_integer (dtp
, -1, 0))
1023 /* Get the real integer. */
1025 if ((c
= next_char (dtp
)) == EOF
)
1033 if (!dtp
->u
.p
.namelist_mode
)
1037 unget_char (dtp
, c
);
1038 eat_separator (dtp
);
1043 /* Fall through... */
1046 c
= next_char (dtp
);
1057 c
= next_char (dtp
);
1065 if (!dtp
->u
.p
.namelist_mode
)
1079 if (nml_bad_return (dtp
, c
))
1092 snprintf (message
, MSGLEN
, "Bad integer for item %d in list input",
1093 dtp
->u
.p
.item_count
);
1095 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1100 unget_char (dtp
, c
);
1101 eat_separator (dtp
);
1103 push_char (dtp
, '\0');
1104 if (convert_integer (dtp
, length
, negative
))
1111 dtp
->u
.p
.saved_type
= BT_INTEGER
;
1115 /* Read a character variable. */
1118 read_character (st_parameter_dt
*dtp
, int length
__attribute__ ((unused
)))
1120 char quote
, message
[MSGLEN
];
1123 quote
= ' '; /* Space means no quote character. */
1125 if ((c
= next_char (dtp
)) == EOF
)
1135 unget_char (dtp
, c
); /* NULL value. */
1136 eat_separator (dtp
);
1145 if (dtp
->u
.p
.namelist_mode
)
1147 unget_char (dtp
, c
);
1154 /* Deal with a possible repeat count. */
1158 c
= next_char (dtp
);
1167 unget_char (dtp
, c
);
1168 goto done
; /* String was only digits! */
1171 push_char (dtp
, '\0');
1176 goto get_string
; /* Not a repeat count after all. */
1181 if (convert_integer (dtp
, -1, 0))
1184 /* Now get the real string. */
1186 if ((c
= next_char (dtp
)) == EOF
)
1191 unget_char (dtp
, c
); /* Repeated NULL values. */
1192 eat_separator (dtp
);
1209 if ((c
= next_char (dtp
)) == EOF
)
1221 /* See if we have a doubled quote character or the end of
1224 if ((c
= next_char (dtp
)) == EOF
)
1228 push_char (dtp
, quote
);
1232 unget_char (dtp
, c
);
1238 unget_char (dtp
, c
);
1242 if (c
!= '\n' && c
!= '\r')
1252 /* At this point, we have to have a separator, or else the string is
1255 c
= next_char (dtp
);
1257 if (is_separator (c
) || c
== EOF
)
1259 unget_char (dtp
, c
);
1260 eat_separator (dtp
);
1261 dtp
->u
.p
.saved_type
= BT_CHARACTER
;
1266 snprintf (message
, MSGLEN
, "Invalid string input in item %d",
1267 dtp
->u
.p
.item_count
);
1268 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1280 /* Parse a component of a complex constant or a real number that we
1281 are sure is already there. This is a straight real number parser. */
1284 parse_real (st_parameter_dt
*dtp
, void *buffer
, int length
)
1286 char message
[MSGLEN
];
1289 if ((c
= next_char (dtp
)) == EOF
)
1292 if (c
== '-' || c
== '+')
1295 if ((c
= next_char (dtp
)) == EOF
)
1299 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1302 if (!isdigit (c
) && c
!= '.')
1304 if (c
== 'i' || c
== 'I' || c
== 'n' || c
== 'N')
1312 seen_dp
= (c
== '.') ? 1 : 0;
1316 if ((c
= next_char (dtp
)) == EOF
)
1318 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1340 push_char (dtp
, 'e');
1345 push_char (dtp
, 'e');
1347 if ((c
= next_char (dtp
)) == EOF
)
1352 if (!dtp
->u
.p
.namelist_mode
)
1365 if ((c
= next_char (dtp
)) == EOF
)
1367 if (c
!= '-' && c
!= '+')
1368 push_char (dtp
, '+');
1372 c
= next_char (dtp
);
1383 if ((c
= next_char (dtp
)) == EOF
)
1392 if (!dtp
->u
.p
.namelist_mode
)
1397 unget_char (dtp
, c
);
1406 unget_char (dtp
, c
);
1407 push_char (dtp
, '\0');
1409 m
= convert_real (dtp
, buffer
, dtp
->u
.p
.saved_string
, length
);
1415 unget_char (dtp
, c
);
1416 push_char (dtp
, '\0');
1418 m
= convert_infnan (dtp
, buffer
, dtp
->u
.p
.saved_string
, length
);
1424 /* Match INF and Infinity. */
1425 if ((c
== 'i' || c
== 'I')
1426 && ((c
= next_char (dtp
)) == 'n' || c
== 'N')
1427 && ((c
= next_char (dtp
)) == 'f' || c
== 'F'))
1429 c
= next_char (dtp
);
1430 if ((c
!= 'i' && c
!= 'I')
1431 || ((c
== 'i' || c
== 'I')
1432 && ((c
= next_char (dtp
)) == 'n' || c
== 'N')
1433 && ((c
= next_char (dtp
)) == 'i' || c
== 'I')
1434 && ((c
= next_char (dtp
)) == 't' || c
== 'T')
1435 && ((c
= next_char (dtp
)) == 'y' || c
== 'Y')
1436 && (c
= next_char (dtp
))))
1438 if (is_separator (c
) || (c
== EOF
))
1439 unget_char (dtp
, c
);
1440 push_char (dtp
, 'i');
1441 push_char (dtp
, 'n');
1442 push_char (dtp
, 'f');
1446 else if (((c
= next_char (dtp
)) == 'a' || c
== 'A')
1447 && ((c
= next_char (dtp
)) == 'n' || c
== 'N')
1448 && (c
= next_char (dtp
)))
1450 if (is_separator (c
) || (c
== EOF
))
1451 unget_char (dtp
, c
);
1452 push_char (dtp
, 'n');
1453 push_char (dtp
, 'a');
1454 push_char (dtp
, 'n');
1456 /* Match "NAN(alphanum)". */
1459 for ( ; c
!= ')'; c
= next_char (dtp
))
1460 if (is_separator (c
))
1463 c
= next_char (dtp
);
1464 if (is_separator (c
) || (c
== EOF
))
1465 unget_char (dtp
, c
);
1472 if (nml_bad_return (dtp
, c
))
1487 snprintf (message
, MSGLEN
, "Bad complex floating point "
1488 "number for item %d", dtp
->u
.p
.item_count
);
1490 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1496 /* Reading a complex number is straightforward because we can tell
1497 what it is right away. */
1500 read_complex (st_parameter_dt
*dtp
, void * dest
, int kind
, size_t size
)
1502 char message
[MSGLEN
];
1505 if (parse_repeat (dtp
))
1508 c
= next_char (dtp
);
1515 if (!dtp
->u
.p
.namelist_mode
)
1520 unget_char (dtp
, c
);
1521 eat_separator (dtp
);
1530 c
= next_char (dtp
);
1531 if (c
== '\n' || c
== '\r')
1534 unget_char (dtp
, c
);
1536 if (parse_real (dtp
, dest
, kind
))
1541 c
= next_char (dtp
);
1542 if (c
== '\n' || c
== '\r')
1545 unget_char (dtp
, c
);
1548 != (dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_POINT
? ',' : ';'))
1553 c
= next_char (dtp
);
1554 if (c
== '\n' || c
== '\r')
1557 unget_char (dtp
, c
);
1559 if (parse_real (dtp
, dest
+ size
/ 2, kind
))
1564 c
= next_char (dtp
);
1565 if (c
== '\n' || c
== '\r')
1568 unget_char (dtp
, c
);
1570 if (next_char (dtp
) != ')')
1573 c
= next_char (dtp
);
1574 if (!is_separator (c
) && (c
!= EOF
))
1577 unget_char (dtp
, c
);
1578 eat_separator (dtp
);
1581 dtp
->u
.p
.saved_type
= BT_COMPLEX
;
1586 if (nml_bad_return (dtp
, c
))
1599 snprintf (message
, MSGLEN
, "Bad complex value in item %d of list input",
1600 dtp
->u
.p
.item_count
);
1602 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
1606 /* Parse a real number with a possible repeat count. */
1609 read_real (st_parameter_dt
*dtp
, void * dest
, int length
)
1611 char message
[MSGLEN
];
1618 c
= next_char (dtp
);
1619 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1637 if (!dtp
->u
.p
.namelist_mode
)
1641 unget_char (dtp
, c
); /* Single null. */
1642 eat_separator (dtp
);
1655 /* Get the digit string that might be a repeat count. */
1659 c
= next_char (dtp
);
1660 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1686 push_char (dtp
, 'e');
1688 c
= next_char (dtp
);
1692 push_char (dtp
, '\0');
1696 if (!dtp
->u
.p
.namelist_mode
)
1701 if (c
!= '\n' && c
!= ',' && c
!= '\r' && c
!= ';')
1702 unget_char (dtp
, c
);
1711 if (convert_integer (dtp
, -1, 0))
1714 /* Now get the number itself. */
1716 if ((c
= next_char (dtp
)) == EOF
)
1718 if (is_separator (c
))
1719 { /* Repeated null value. */
1720 unget_char (dtp
, c
);
1721 eat_separator (dtp
);
1725 if (c
!= '-' && c
!= '+')
1726 push_char (dtp
, '+');
1731 if ((c
= next_char (dtp
)) == EOF
)
1735 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1738 if (!isdigit (c
) && c
!= '.')
1740 if (c
== 'i' || c
== 'I' || c
== 'n' || c
== 'N')
1759 c
= next_char (dtp
);
1760 if (c
== ',' && dtp
->u
.p
.current_unit
->decimal_status
== DECIMAL_COMMA
)
1769 if (!dtp
->u
.p
.namelist_mode
)
1794 push_char (dtp
, 'e');
1796 c
= next_char (dtp
);
1805 push_char (dtp
, 'e');
1807 if ((c
= next_char (dtp
)) == EOF
)
1809 if (c
!= '+' && c
!= '-')
1810 push_char (dtp
, '+');
1814 c
= next_char (dtp
);
1825 c
= next_char (dtp
);
1834 if (!dtp
->u
.p
.namelist_mode
)
1847 unget_char (dtp
, c
);
1848 eat_separator (dtp
);
1849 push_char (dtp
, '\0');
1850 if (convert_real (dtp
, dest
, dtp
->u
.p
.saved_string
, length
))
1857 dtp
->u
.p
.saved_type
= BT_REAL
;
1861 l_push_char (dtp
, c
);
1864 /* Match INF and Infinity. */
1865 if (c
== 'i' || c
== 'I')
1867 c
= next_char (dtp
);
1868 l_push_char (dtp
, c
);
1869 if (c
!= 'n' && c
!= 'N')
1871 c
= next_char (dtp
);
1872 l_push_char (dtp
, c
);
1873 if (c
!= 'f' && c
!= 'F')
1875 c
= next_char (dtp
);
1876 l_push_char (dtp
, c
);
1877 if (!is_separator (c
) && (c
!= EOF
))
1879 if (c
!= 'i' && c
!= 'I')
1881 c
= next_char (dtp
);
1882 l_push_char (dtp
, c
);
1883 if (c
!= 'n' && c
!= 'N')
1885 c
= next_char (dtp
);
1886 l_push_char (dtp
, c
);
1887 if (c
!= 'i' && c
!= 'I')
1889 c
= next_char (dtp
);
1890 l_push_char (dtp
, c
);
1891 if (c
!= 't' && c
!= 'T')
1893 c
= next_char (dtp
);
1894 l_push_char (dtp
, c
);
1895 if (c
!= 'y' && c
!= 'Y')
1897 c
= next_char (dtp
);
1898 l_push_char (dtp
, c
);
1904 c
= next_char (dtp
);
1905 l_push_char (dtp
, c
);
1906 if (c
!= 'a' && c
!= 'A')
1908 c
= next_char (dtp
);
1909 l_push_char (dtp
, c
);
1910 if (c
!= 'n' && c
!= 'N')
1912 c
= next_char (dtp
);
1913 l_push_char (dtp
, c
);
1915 /* Match NAN(alphanum). */
1918 for (c
= next_char (dtp
); c
!= ')'; c
= next_char (dtp
))
1919 if (is_separator (c
))
1922 l_push_char (dtp
, c
);
1924 l_push_char (dtp
, ')');
1925 c
= next_char (dtp
);
1926 l_push_char (dtp
, c
);
1930 if (!is_separator (c
) && (c
!= EOF
))
1933 if (dtp
->u
.p
.namelist_mode
)
1935 if (c
== ' ' || c
=='\n' || c
== '\r')
1939 if ((c
= next_char (dtp
)) == EOF
)
1942 while (c
== ' ' || c
=='\n' || c
== '\r');
1944 l_push_char (dtp
, c
);
1953 push_char (dtp
, 'i');
1954 push_char (dtp
, 'n');
1955 push_char (dtp
, 'f');
1959 push_char (dtp
, 'n');
1960 push_char (dtp
, 'a');
1961 push_char (dtp
, 'n');
1965 unget_char (dtp
, c
);
1966 eat_separator (dtp
);
1967 push_char (dtp
, '\0');
1968 if (convert_infnan (dtp
, dest
, dtp
->u
.p
.saved_string
, length
))
1972 dtp
->u
.p
.saved_type
= BT_REAL
;
1976 if (dtp
->u
.p
.namelist_mode
)
1978 dtp
->u
.p
.nml_read_error
= 1;
1979 dtp
->u
.p
.line_buffer_enabled
= 1;
1980 dtp
->u
.p
.line_buffer_pos
= 0;
1986 if (nml_bad_return (dtp
, c
))
2001 snprintf (message
, MSGLEN
, "Bad real number in item %d of list input",
2002 dtp
->u
.p
.item_count
);
2004 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
2008 /* Check the current type against the saved type to make sure they are
2009 compatible. Returns nonzero if incompatible. */
2012 check_type (st_parameter_dt
*dtp
, bt type
, int kind
)
2014 char message
[MSGLEN
];
2016 if (dtp
->u
.p
.saved_type
!= BT_UNKNOWN
&& dtp
->u
.p
.saved_type
!= type
)
2018 snprintf (message
, MSGLEN
, "Read type %s where %s was expected for item %d",
2019 type_name (dtp
->u
.p
.saved_type
), type_name (type
),
2020 dtp
->u
.p
.item_count
);
2022 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
2026 if (dtp
->u
.p
.saved_type
== BT_UNKNOWN
|| dtp
->u
.p
.saved_type
== BT_CHARACTER
)
2029 if ((type
!= BT_COMPLEX
&& dtp
->u
.p
.saved_length
!= kind
)
2030 || (type
== BT_COMPLEX
&& dtp
->u
.p
.saved_length
!= kind
*2))
2032 snprintf (message
, MSGLEN
,
2033 "Read kind %d %s where kind %d is required for item %d",
2034 type
== BT_COMPLEX
? dtp
->u
.p
.saved_length
/ 2
2035 : dtp
->u
.p
.saved_length
,
2036 type_name (dtp
->u
.p
.saved_type
), kind
,
2037 dtp
->u
.p
.item_count
);
2039 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, message
);
2047 /* Initialize the function pointers to select the correct versions of
2048 next_char and push_char depending on what we are doing. */
2051 set_workers (st_parameter_dt
*dtp
)
2053 if (dtp
->u
.p
.current_unit
->flags
.encoding
== ENCODING_UTF8
)
2055 dtp
->u
.p
.current_unit
->next_char_fn_ptr
= &next_char_utf8
;
2056 dtp
->u
.p
.current_unit
->push_char_fn_ptr
= &push_char4
;
2058 else if (is_internal_unit (dtp
))
2060 dtp
->u
.p
.current_unit
->next_char_fn_ptr
= &next_char_internal
;
2061 dtp
->u
.p
.current_unit
->push_char_fn_ptr
= &push_char_default
;
2065 dtp
->u
.p
.current_unit
->next_char_fn_ptr
= &next_char_default
;
2066 dtp
->u
.p
.current_unit
->push_char_fn_ptr
= &push_char_default
;
2071 /* Top level data transfer subroutine for list reads. Because we have
2072 to deal with repeat counts, the data item is always saved after
2073 reading, usually in the dtp->u.p.value[] array. If a repeat count is
2074 greater than one, we copy the data item multiple times. */
2077 list_formatted_read_scalar (st_parameter_dt
*dtp
, bt type
, void *p
,
2078 int kind
, size_t size
)
2084 dtp
->u
.p
.namelist_mode
= 0;
2086 /* Set the next_char and push_char worker functions. */
2089 if (dtp
->u
.p
.first_item
)
2091 dtp
->u
.p
.first_item
= 0;
2092 dtp
->u
.p
.input_complete
= 0;
2093 dtp
->u
.p
.repeat_count
= 1;
2094 dtp
->u
.p
.at_eol
= 0;
2096 if ((c
= eat_spaces (dtp
)) == EOF
)
2101 if (is_separator (c
))
2103 /* Found a null value. */
2104 dtp
->u
.p
.repeat_count
= 0;
2105 eat_separator (dtp
);
2107 /* Set end-of-line flag. */
2108 if (c
== '\n' || c
== '\r')
2110 dtp
->u
.p
.at_eol
= 1;
2111 if (finish_separator (dtp
) == LIBERROR_END
)
2123 if (dtp
->u
.p
.repeat_count
> 0)
2125 if (check_type (dtp
, type
, kind
))
2130 if (dtp
->u
.p
.input_complete
)
2133 if (dtp
->u
.p
.at_eol
)
2134 finish_separator (dtp
);
2138 /* Trailing spaces prior to end of line. */
2139 if (dtp
->u
.p
.at_eol
)
2140 finish_separator (dtp
);
2143 dtp
->u
.p
.saved_type
= BT_UNKNOWN
;
2144 dtp
->u
.p
.repeat_count
= 1;
2150 read_integer (dtp
, kind
);
2153 read_logical (dtp
, kind
);
2156 read_character (dtp
, kind
);
2159 read_real (dtp
, p
, kind
);
2160 /* Copy value back to temporary if needed. */
2161 if (dtp
->u
.p
.repeat_count
> 0)
2162 memcpy (dtp
->u
.p
.value
, p
, size
);
2165 read_complex (dtp
, p
, kind
, size
);
2166 /* Copy value back to temporary if needed. */
2167 if (dtp
->u
.p
.repeat_count
> 0)
2168 memcpy (dtp
->u
.p
.value
, p
, size
);
2171 internal_error (&dtp
->common
, "Bad type for list read");
2174 if (dtp
->u
.p
.saved_type
!= BT_CHARACTER
&& dtp
->u
.p
.saved_type
!= BT_UNKNOWN
)
2175 dtp
->u
.p
.saved_length
= size
;
2177 if ((dtp
->common
.flags
& IOPARM_LIBRETURN_MASK
) != IOPARM_LIBRETURN_OK
)
2181 switch (dtp
->u
.p
.saved_type
)
2185 if (dtp
->u
.p
.repeat_count
> 0)
2186 memcpy (p
, dtp
->u
.p
.value
, size
);
2191 memcpy (p
, dtp
->u
.p
.value
, size
);
2195 if (dtp
->u
.p
.saved_string
)
2197 m
= ((int) size
< dtp
->u
.p
.saved_used
)
2198 ? (int) size
: dtp
->u
.p
.saved_used
;
2200 q
= (gfc_char4_t
*) p
;
2201 r
= (gfc_char4_t
*) dtp
->u
.p
.saved_string
;
2202 if (dtp
->u
.p
.current_unit
->flags
.encoding
== ENCODING_UTF8
)
2203 for (i
= 0; i
< m
; i
++)
2208 memcpy (p
, dtp
->u
.p
.saved_string
, m
);
2210 for (i
= 0; i
< m
; i
++)
2215 /* Just delimiters encountered, nothing to copy but SPACE. */
2221 memset (((char *) p
) + m
, ' ', size
- m
);
2224 q
= (gfc_char4_t
*) p
;
2225 for (i
= m
; i
< (int) size
; i
++)
2226 q
[i
] = (unsigned char) ' ';
2235 internal_error (&dtp
->common
, "Bad type for list read");
2238 if (--dtp
->u
.p
.repeat_count
<= 0)
2242 if (err
== LIBERROR_END
)
2247 fbuf_flush_list (dtp
->u
.p
.current_unit
, LIST_READING
);
2253 list_formatted_read (st_parameter_dt
*dtp
, bt type
, void *p
, int kind
,
2254 size_t size
, size_t nelems
)
2258 size_t stride
= type
== BT_CHARACTER
?
2259 size
* GFC_SIZE_OF_CHAR_KIND(kind
) : size
;
2264 /* Big loop over all the elements. */
2265 for (elem
= 0; elem
< nelems
; elem
++)
2267 dtp
->u
.p
.item_count
++;
2268 err
= list_formatted_read_scalar (dtp
, type
, tmp
+ stride
*elem
,
2276 /* Finish a list read. */
2279 finish_list_read (st_parameter_dt
*dtp
)
2283 fbuf_flush (dtp
->u
.p
.current_unit
, dtp
->u
.p
.mode
);
2285 if (dtp
->u
.p
.at_eol
)
2287 dtp
->u
.p
.at_eol
= 0;
2291 if (!is_internal_unit (dtp
))
2295 /* Set the next_char and push_char worker functions. */
2298 c
= next_char (dtp
);
2315 void namelist_read (st_parameter_dt *dtp)
2317 static void nml_match_name (char *name, int len)
2318 static int nml_query (st_parameter_dt *dtp)
2319 static int nml_get_obj_data (st_parameter_dt *dtp,
2320 namelist_info **prev_nl, char *, size_t)
2322 static void nml_untouch_nodes (st_parameter_dt *dtp)
2323 static namelist_info * find_nml_node (st_parameter_dt *dtp,
2325 static int nml_parse_qualifier(descriptor_dimension * ad,
2326 array_loop_spec * ls, int rank, char *)
2327 static void nml_touch_nodes (namelist_info * nl)
2328 static int nml_read_obj (namelist_info *nl, index_type offset,
2329 namelist_info **prev_nl, char *, size_t,
2330 index_type clow, index_type chigh)
2334 /* Inputs a rank-dimensional qualifier, which can contain
2335 singlets, doublets, triplets or ':' with the standard meanings. */
2338 nml_parse_qualifier (st_parameter_dt
*dtp
, descriptor_dimension
*ad
,
2339 array_loop_spec
*ls
, int rank
, bt nml_elem_type
,
2340 char *parse_err_msg
, size_t parse_err_msg_size
,
2347 int is_array_section
, is_char
;
2351 is_array_section
= 0;
2352 dtp
->u
.p
.expanded_read
= 0;
2354 /* See if this is a character substring qualifier we are looking for. */
2361 /* The next character in the stream should be the '('. */
2363 if ((c
= next_char (dtp
)) == EOF
)
2366 /* Process the qualifier, by dimension and triplet. */
2368 for (dim
=0; dim
< rank
; dim
++ )
2370 for (indx
=0; indx
<3; indx
++)
2376 /* Process a potential sign. */
2377 if ((c
= next_char (dtp
)) == EOF
)
2389 unget_char (dtp
, c
);
2393 /* Process characters up to the next ':' , ',' or ')'. */
2396 c
= next_char (dtp
);
2403 is_array_section
= 1;
2407 if ((c
==',' && dim
== rank
-1)
2408 || (c
==')' && dim
< rank
-1))
2411 snprintf (parse_err_msg
, parse_err_msg_size
,
2412 "Bad substring qualifier");
2414 snprintf (parse_err_msg
, parse_err_msg_size
,
2415 "Bad number of index fields");
2424 case ' ': case '\t': case '\r': case '\n':
2430 snprintf (parse_err_msg
, parse_err_msg_size
,
2431 "Bad character in substring qualifier");
2433 snprintf (parse_err_msg
, parse_err_msg_size
,
2434 "Bad character in index");
2438 if ((c
== ',' || c
== ')') && indx
== 0
2439 && dtp
->u
.p
.saved_string
== 0)
2442 snprintf (parse_err_msg
, parse_err_msg_size
,
2443 "Null substring qualifier");
2445 snprintf (parse_err_msg
, parse_err_msg_size
,
2446 "Null index field");
2450 if ((c
== ':' && indx
== 1 && dtp
->u
.p
.saved_string
== 0)
2451 || (indx
== 2 && dtp
->u
.p
.saved_string
== 0))
2454 snprintf (parse_err_msg
, parse_err_msg_size
,
2455 "Bad substring qualifier");
2457 snprintf (parse_err_msg
, parse_err_msg_size
,
2458 "Bad index triplet");
2462 if (is_char
&& !is_array_section
)
2464 snprintf (parse_err_msg
, parse_err_msg_size
,
2465 "Missing colon in substring qualifier");
2469 /* If '( : ? )' or '( ? : )' break and flag read failure. */
2471 if ((c
== ':' && indx
== 0 && dtp
->u
.p
.saved_string
== 0)
2472 || (indx
==1 && dtp
->u
.p
.saved_string
== 0))
2478 /* Now read the index. */
2479 if (convert_integer (dtp
, sizeof(index_type
), neg
))
2482 snprintf (parse_err_msg
, parse_err_msg_size
,
2483 "Bad integer substring qualifier");
2485 snprintf (parse_err_msg
, parse_err_msg_size
,
2486 "Bad integer in index");
2492 /* Feed the index values to the triplet arrays. */
2496 memcpy (&ls
[dim
].start
, dtp
->u
.p
.value
, sizeof(index_type
));
2498 memcpy (&ls
[dim
].end
, dtp
->u
.p
.value
, sizeof(index_type
));
2500 memcpy (&ls
[dim
].step
, dtp
->u
.p
.value
, sizeof(index_type
));
2503 /* Singlet or doublet indices. */
2504 if (c
==',' || c
==')')
2508 memcpy (&ls
[dim
].start
, dtp
->u
.p
.value
, sizeof(index_type
));
2510 /* If -std=f95/2003 or an array section is specified,
2511 do not allow excess data to be processed. */
2512 if (is_array_section
== 1
2513 || !(compile_options
.allow_std
& GFC_STD_GNU
)
2514 || nml_elem_type
== BT_DERIVED
)
2515 ls
[dim
].end
= ls
[dim
].start
;
2517 dtp
->u
.p
.expanded_read
= 1;
2520 /* Check for non-zero rank. */
2521 if (is_array_section
== 1 && ls
[dim
].start
!= ls
[dim
].end
)
2528 if (is_array_section
== 1 && dtp
->u
.p
.expanded_read
== 1)
2531 dtp
->u
.p
.expanded_read
= 0;
2532 for (i
= 0; i
< dim
; i
++)
2533 ls
[i
].end
= ls
[i
].start
;
2536 /* Check the values of the triplet indices. */
2537 if ((ls
[dim
].start
> GFC_DIMENSION_UBOUND(ad
[dim
]))
2538 || (ls
[dim
].start
< GFC_DIMENSION_LBOUND(ad
[dim
]))
2539 || (ls
[dim
].end
> GFC_DIMENSION_UBOUND(ad
[dim
]))
2540 || (ls
[dim
].end
< GFC_DIMENSION_LBOUND(ad
[dim
])))
2543 snprintf (parse_err_msg
, parse_err_msg_size
,
2544 "Substring out of range");
2546 snprintf (parse_err_msg
, parse_err_msg_size
,
2547 "Index %d out of range", dim
+ 1);
2551 if (((ls
[dim
].end
- ls
[dim
].start
) * ls
[dim
].step
< 0)
2552 || (ls
[dim
].step
== 0))
2554 snprintf (parse_err_msg
, parse_err_msg_size
,
2555 "Bad range in index %d", dim
+ 1);
2559 /* Initialise the loop index counter. */
2560 ls
[dim
].idx
= ls
[dim
].start
;
2567 /* The EOF error message is issued by hit_eof. Return true so that the
2568 caller does not use parse_err_msg and parse_err_msg_size to generate
2569 an unrelated error message. */
2573 dtp
->u
.p
.input_complete
= 1;
2581 extended_look_ahead (char *p
, char *q
)
2585 /* Scan ahead to find a '%' in the p string. */
2586 for(r
= p
, s
= q
; *r
&& *s
; s
++)
2587 if ((*s
== '%' || *s
== '+') && strcmp (r
+ 1, s
+ 1) == 0)
2594 strcmp_extended_type (char *p
, char *q
)
2598 for (r
= p
, s
= q
; *r
&& *s
; r
++, s
++)
2602 if (*r
== '%' && *s
== '+' && extended_look_ahead (r
, s
))
2611 static namelist_info
*
2612 find_nml_node (st_parameter_dt
*dtp
, char * var_name
)
2614 namelist_info
* t
= dtp
->u
.p
.ionml
;
2617 if (strcmp (var_name
, t
->var_name
) == 0)
2622 if (strcmp_extended_type (var_name
, t
->var_name
))
2632 /* Visits all the components of a derived type that have
2633 not explicitly been identified in the namelist input.
2634 touched is set and the loop specification initialised
2635 to default values */
2638 nml_touch_nodes (namelist_info
* nl
)
2640 index_type len
= strlen (nl
->var_name
) + 1;
2642 char * ext_name
= xmalloc (len
+ 1);
2643 memcpy (ext_name
, nl
->var_name
, len
-1);
2644 memcpy (ext_name
+ len
- 1, "%", 2);
2645 for (nl
= nl
->next
; nl
; nl
= nl
->next
)
2647 if (strncmp (nl
->var_name
, ext_name
, len
) == 0)
2650 for (dim
=0; dim
< nl
->var_rank
; dim
++)
2652 nl
->ls
[dim
].step
= 1;
2653 nl
->ls
[dim
].end
= GFC_DESCRIPTOR_UBOUND(nl
,dim
);
2654 nl
->ls
[dim
].start
= GFC_DESCRIPTOR_LBOUND(nl
,dim
);
2655 nl
->ls
[dim
].idx
= nl
->ls
[dim
].start
;
2665 /* Resets touched for the entire list of nml_nodes, ready for a
2669 nml_untouch_nodes (st_parameter_dt
*dtp
)
2672 for (t
= dtp
->u
.p
.ionml
; t
; t
= t
->next
)
2677 /* Attempts to input name to namelist name. Returns
2678 dtp->u.p.nml_read_error = 1 on no match. */
2681 nml_match_name (st_parameter_dt
*dtp
, const char *name
, index_type len
)
2686 dtp
->u
.p
.nml_read_error
= 0;
2687 for (i
= 0; i
< len
; i
++)
2689 c
= next_char (dtp
);
2690 if (c
== EOF
|| (tolower (c
) != tolower (name
[i
])))
2692 dtp
->u
.p
.nml_read_error
= 1;
2698 /* If the namelist read is from stdin, output the current state of the
2699 namelist to stdout. This is used to implement the non-standard query
2700 features, ? and =?. If c == '=' the full namelist is printed. Otherwise
2701 the names alone are printed. */
2704 nml_query (st_parameter_dt
*dtp
, char c
)
2706 gfc_unit
* temp_unit
;
2711 static const index_type endlen
= 2;
2712 static const char endl
[] = "\r\n";
2713 static const char nmlend
[] = "&end\r\n";
2715 static const index_type endlen
= 1;
2716 static const char endl
[] = "\n";
2717 static const char nmlend
[] = "&end\n";
2720 if (dtp
->u
.p
.current_unit
->unit_number
!= options
.stdin_unit
)
2723 /* Store the current unit and transfer to stdout. */
2725 temp_unit
= dtp
->u
.p
.current_unit
;
2726 dtp
->u
.p
.current_unit
= find_unit (options
.stdout_unit
);
2728 if (dtp
->u
.p
.current_unit
)
2730 dtp
->u
.p
.mode
= WRITING
;
2731 next_record (dtp
, 0);
2733 /* Write the namelist in its entirety. */
2736 namelist_write (dtp
);
2738 /* Or write the list of names. */
2742 /* "&namelist_name\n" */
2744 len
= dtp
->namelist_name_len
;
2745 p
= write_block (dtp
, len
- 1 + endlen
);
2749 memcpy ((char*)(p
+ 1), dtp
->namelist_name
, len
);
2750 memcpy ((char*)(p
+ len
+ 1), &endl
, endlen
);
2751 for (nl
= dtp
->u
.p
.ionml
; nl
; nl
= nl
->next
)
2755 len
= strlen (nl
->var_name
);
2756 p
= write_block (dtp
, len
+ endlen
);
2760 memcpy ((char*)(p
+ 1), nl
->var_name
, len
);
2761 memcpy ((char*)(p
+ len
+ 1), &endl
, endlen
);
2766 p
= write_block (dtp
, endlen
+ 4);
2769 memcpy (p
, &nmlend
, endlen
+ 4);
2772 /* Flush the stream to force immediate output. */
2774 fbuf_flush (dtp
->u
.p
.current_unit
, WRITING
);
2775 sflush (dtp
->u
.p
.current_unit
->s
);
2776 unlock_unit (dtp
->u
.p
.current_unit
);
2781 /* Restore the current unit. */
2783 dtp
->u
.p
.current_unit
= temp_unit
;
2784 dtp
->u
.p
.mode
= READING
;
2788 /* Reads and stores the input for the namelist object nl. For an array,
2789 the function loops over the ranges defined by the loop specification.
2790 This default to all the data or to the specification from a qualifier.
2791 nml_read_obj recursively calls itself to read derived types. It visits
2792 all its own components but only reads data for those that were touched
2793 when the name was parsed. If a read error is encountered, an attempt is
2794 made to return to read a new object name because the standard allows too
2795 little data to be available. On the other hand, too much data is an
2799 nml_read_obj (st_parameter_dt
*dtp
, namelist_info
* nl
, index_type offset
,
2800 namelist_info
**pprev_nl
, char *nml_err_msg
,
2801 size_t nml_err_msg_size
, index_type clow
, index_type chigh
)
2803 namelist_info
* cmp
;
2810 size_t obj_name_len
;
2813 /* If we have encountered a previous read error or this object has not been
2814 touched in name parsing, just return. */
2815 if (dtp
->u
.p
.nml_read_error
|| !nl
->touched
)
2818 dtp
->u
.p
.item_count
++; /* Used in error messages. */
2819 dtp
->u
.p
.repeat_count
= 0;
2831 dlen
= size_from_real_kind (len
);
2835 dlen
= size_from_complex_kind (len
);
2839 dlen
= chigh
? (chigh
- clow
+ 1) : nl
->string_length
;
2848 /* Update the pointer to the data, using the current index vector */
2850 pdata
= (void*)(nl
->mem_pos
+ offset
);
2851 for (dim
= 0; dim
< nl
->var_rank
; dim
++)
2852 pdata
= (void*)(pdata
+ (nl
->ls
[dim
].idx
2853 - GFC_DESCRIPTOR_LBOUND(nl
,dim
))
2854 * GFC_DESCRIPTOR_STRIDE(nl
,dim
) * nl
->size
);
2856 /* If we are finished with the repeat count, try to read next value. */
2859 if (--dtp
->u
.p
.repeat_count
<= 0)
2861 if (dtp
->u
.p
.input_complete
)
2863 if (dtp
->u
.p
.at_eol
)
2864 finish_separator (dtp
);
2865 if (dtp
->u
.p
.input_complete
)
2868 dtp
->u
.p
.saved_type
= BT_UNKNOWN
;
2874 read_integer (dtp
, len
);
2878 read_logical (dtp
, len
);
2882 read_character (dtp
, len
);
2886 /* Need to copy data back from the real location to the temp in
2887 order to handle nml reads into arrays. */
2888 read_real (dtp
, pdata
, len
);
2889 memcpy (dtp
->u
.p
.value
, pdata
, dlen
);
2893 /* Same as for REAL, copy back to temp. */
2894 read_complex (dtp
, pdata
, len
, dlen
);
2895 memcpy (dtp
->u
.p
.value
, pdata
, dlen
);
2899 obj_name_len
= strlen (nl
->var_name
) + 1;
2900 obj_name
= xmalloc (obj_name_len
+1);
2901 memcpy (obj_name
, nl
->var_name
, obj_name_len
-1);
2902 memcpy (obj_name
+ obj_name_len
- 1, "%", 2);
2904 /* If reading a derived type, disable the expanded read warning
2905 since a single object can have multiple reads. */
2906 dtp
->u
.p
.expanded_read
= 0;
2908 /* Now loop over the components. */
2910 for (cmp
= nl
->next
;
2912 !strncmp (cmp
->var_name
, obj_name
, obj_name_len
);
2915 /* Jump over nested derived type by testing if the potential
2916 component name contains '%'. */
2917 if (strchr (cmp
->var_name
+ obj_name_len
, '%'))
2920 if (!nml_read_obj (dtp
, cmp
, (index_type
)(pdata
- nl
->mem_pos
),
2921 pprev_nl
, nml_err_msg
, nml_err_msg_size
,
2928 if (dtp
->u
.p
.input_complete
)
2939 snprintf (nml_err_msg
, nml_err_msg_size
,
2940 "Bad type for namelist object %s", nl
->var_name
);
2941 internal_error (&dtp
->common
, nml_err_msg
);
2946 /* The standard permits array data to stop short of the number of
2947 elements specified in the loop specification. In this case, we
2948 should be here with dtp->u.p.nml_read_error != 0. Control returns to
2949 nml_get_obj_data and an attempt is made to read object name. */
2952 if (dtp
->u
.p
.nml_read_error
)
2954 dtp
->u
.p
.expanded_read
= 0;
2958 if (dtp
->u
.p
.saved_type
== BT_UNKNOWN
)
2960 dtp
->u
.p
.expanded_read
= 0;
2964 switch (dtp
->u
.p
.saved_type
)
2971 memcpy (pdata
, dtp
->u
.p
.value
, dlen
);
2975 if (dlen
< dtp
->u
.p
.saved_used
)
2977 if (compile_options
.bounds_check
)
2979 snprintf (nml_err_msg
, nml_err_msg_size
,
2980 "Namelist object '%s' truncated on read.",
2982 generate_warning (&dtp
->common
, nml_err_msg
);
2987 m
= dtp
->u
.p
.saved_used
;
2989 if (dtp
->u
.p
.current_unit
->flags
.encoding
== ENCODING_UTF8
)
2991 gfc_char4_t
*q4
, *p4
= pdata
;
2994 q4
= (gfc_char4_t
*) dtp
->u
.p
.saved_string
;
2996 for (i
= 0; i
< m
; i
++)
2999 for (i
= 0; i
< dlen
- m
; i
++)
3000 *p4
++ = (gfc_char4_t
) ' ';
3004 pdata
= (void*)( pdata
+ clow
- 1 );
3005 memcpy (pdata
, dtp
->u
.p
.saved_string
, m
);
3007 memset ((void*)( pdata
+ m
), ' ', dlen
- m
);
3015 /* Warn if a non-standard expanded read occurs. A single read of a
3016 single object is acceptable. If a second read occurs, issue a warning
3017 and set the flag to zero to prevent further warnings. */
3018 if (dtp
->u
.p
.expanded_read
== 2)
3020 notify_std (&dtp
->common
, GFC_STD_GNU
, "Non-standard expanded namelist read.");
3021 dtp
->u
.p
.expanded_read
= 0;
3024 /* If the expanded read warning flag is set, increment it,
3025 indicating that a single read has occurred. */
3026 if (dtp
->u
.p
.expanded_read
>= 1)
3027 dtp
->u
.p
.expanded_read
++;
3029 /* Break out of loop if scalar. */
3033 /* Now increment the index vector. */
3038 for (dim
= 0; dim
< nl
->var_rank
; dim
++)
3040 nl
->ls
[dim
].idx
+= nml_carry
* nl
->ls
[dim
].step
;
3042 if (((nl
->ls
[dim
].step
> 0) && (nl
->ls
[dim
].idx
> nl
->ls
[dim
].end
))
3044 ((nl
->ls
[dim
].step
< 0) && (nl
->ls
[dim
].idx
< nl
->ls
[dim
].end
)))
3046 nl
->ls
[dim
].idx
= nl
->ls
[dim
].start
;
3050 } while (!nml_carry
);
3052 if (dtp
->u
.p
.repeat_count
> 1)
3054 snprintf (nml_err_msg
, nml_err_msg_size
,
3055 "Repeat count too large for namelist object %s", nl
->var_name
);
3065 /* Parses the object name, including array and substring qualifiers. It
3066 iterates over derived type components, touching those components and
3067 setting their loop specifications, if there is a qualifier. If the
3068 object is itself a derived type, its components and subcomponents are
3069 touched. nml_read_obj is called at the end and this reads the data in
3070 the manner specified by the object name. */
3073 nml_get_obj_data (st_parameter_dt
*dtp
, namelist_info
**pprev_nl
,
3074 char *nml_err_msg
, size_t nml_err_msg_size
)
3078 namelist_info
* first_nl
= NULL
;
3079 namelist_info
* root_nl
= NULL
;
3080 int dim
, parsed_rank
;
3081 int component_flag
, qualifier_flag
;
3082 index_type clow
, chigh
;
3083 int non_zero_rank_count
;
3085 /* Look for end of input or object name. If '?' or '=?' are encountered
3086 in stdin, print the node names or the namelist to stdout. */
3088 eat_separator (dtp
);
3089 if (dtp
->u
.p
.input_complete
)
3092 if (dtp
->u
.p
.at_eol
)
3093 finish_separator (dtp
);
3094 if (dtp
->u
.p
.input_complete
)
3097 if ((c
= next_char (dtp
)) == EOF
)
3102 if ((c
= next_char (dtp
)) == EOF
)
3106 snprintf (nml_err_msg
, nml_err_msg_size
,
3107 "namelist read: misplaced = sign");
3110 nml_query (dtp
, '=');
3114 nml_query (dtp
, '?');
3119 nml_match_name (dtp
, "end", 3);
3120 if (dtp
->u
.p
.nml_read_error
)
3122 snprintf (nml_err_msg
, nml_err_msg_size
,
3123 "namelist not terminated with / or &end");
3128 dtp
->u
.p
.input_complete
= 1;
3135 /* Untouch all nodes of the namelist and reset the flags that are set for
3136 derived type components. */
3138 nml_untouch_nodes (dtp
);
3141 non_zero_rank_count
= 0;
3143 /* Get the object name - should '!' and '\n' be permitted separators? */
3151 if (!is_separator (c
))
3152 push_char_default (dtp
, tolower(c
));
3153 if ((c
= next_char (dtp
)) == EOF
)
3156 while (!( c
=='=' || c
==' ' || c
=='\t' || c
=='(' || c
=='%' ));
3158 unget_char (dtp
, c
);
3160 /* Check that the name is in the namelist and get pointer to object.
3161 Three error conditions exist: (i) An attempt is being made to
3162 identify a non-existent object, following a failed data read or
3163 (ii) The object name does not exist or (iii) Too many data items
3164 are present for an object. (iii) gives the same error message
3167 push_char_default (dtp
, '\0');
3171 #define EXT_STACK_SZ 100
3172 char ext_stack
[EXT_STACK_SZ
];
3174 size_t var_len
= strlen (root_nl
->var_name
);
3176 = dtp
->u
.p
.saved_string
? strlen (dtp
->u
.p
.saved_string
) : 0;
3177 size_t ext_size
= var_len
+ saved_len
+ 1;
3179 if (ext_size
> EXT_STACK_SZ
)
3180 ext_name
= xmalloc (ext_size
);
3182 ext_name
= ext_stack
;
3184 memcpy (ext_name
, root_nl
->var_name
, var_len
);
3185 if (dtp
->u
.p
.saved_string
)
3186 memcpy (ext_name
+ var_len
, dtp
->u
.p
.saved_string
, saved_len
);
3187 ext_name
[var_len
+ saved_len
] = '\0';
3188 nl
= find_nml_node (dtp
, ext_name
);
3190 if (ext_size
> EXT_STACK_SZ
)
3194 nl
= find_nml_node (dtp
, dtp
->u
.p
.saved_string
);
3198 if (dtp
->u
.p
.nml_read_error
&& *pprev_nl
)
3199 snprintf (nml_err_msg
, nml_err_msg_size
,
3200 "Bad data for namelist object %s", (*pprev_nl
)->var_name
);
3203 snprintf (nml_err_msg
, nml_err_msg_size
,
3204 "Cannot match namelist object name %s",
3205 dtp
->u
.p
.saved_string
);
3210 /* Get the length, data length, base pointer and rank of the variable.
3211 Set the default loop specification first. */
3213 for (dim
=0; dim
< nl
->var_rank
; dim
++)
3215 nl
->ls
[dim
].step
= 1;
3216 nl
->ls
[dim
].end
= GFC_DESCRIPTOR_UBOUND(nl
,dim
);
3217 nl
->ls
[dim
].start
= GFC_DESCRIPTOR_LBOUND(nl
,dim
);
3218 nl
->ls
[dim
].idx
= nl
->ls
[dim
].start
;
3221 /* Check to see if there is a qualifier: if so, parse it.*/
3223 if (c
== '(' && nl
->var_rank
)
3226 if (!nml_parse_qualifier (dtp
, nl
->dim
, nl
->ls
, nl
->var_rank
,
3227 nl
->type
, nml_err_msg
, nml_err_msg_size
,
3230 char *nml_err_msg_end
= strchr (nml_err_msg
, '\0');
3231 snprintf (nml_err_msg_end
,
3232 nml_err_msg_size
- (nml_err_msg_end
- nml_err_msg
),
3233 " for namelist variable %s", nl
->var_name
);
3236 if (parsed_rank
> 0)
3237 non_zero_rank_count
++;
3241 if ((c
= next_char (dtp
)) == EOF
)
3243 unget_char (dtp
, c
);
3245 else if (nl
->var_rank
> 0)
3246 non_zero_rank_count
++;
3248 /* Now parse a derived type component. The root namelist_info address
3249 is backed up, as is the previous component level. The component flag
3250 is set and the iteration is made by jumping back to get_name. */
3254 if (nl
->type
!= BT_DERIVED
)
3256 snprintf (nml_err_msg
, nml_err_msg_size
,
3257 "Attempt to get derived component for %s", nl
->var_name
);
3261 /* Don't move first_nl further in the list if a qualifier was found. */
3262 if ((*pprev_nl
== NULL
&& !qualifier_flag
) || !component_flag
)
3268 if ((c
= next_char (dtp
)) == EOF
)
3273 /* Parse a character qualifier, if present. chigh = 0 is a default
3274 that signals that the string length = string_length. */
3279 if (c
== '(' && nl
->type
== BT_CHARACTER
)
3281 descriptor_dimension chd
[1] = { {1, clow
, nl
->string_length
} };
3282 array_loop_spec ind
[1] = { {1, clow
, nl
->string_length
, 1} };
3284 if (!nml_parse_qualifier (dtp
, chd
, ind
, -1, nl
->type
,
3285 nml_err_msg
, nml_err_msg_size
, &parsed_rank
))
3287 char *nml_err_msg_end
= strchr (nml_err_msg
, '\0');
3288 snprintf (nml_err_msg_end
,
3289 nml_err_msg_size
- (nml_err_msg_end
- nml_err_msg
),
3290 " for namelist variable %s", nl
->var_name
);
3294 clow
= ind
[0].start
;
3297 if (ind
[0].step
!= 1)
3299 snprintf (nml_err_msg
, nml_err_msg_size
,
3300 "Step not allowed in substring qualifier"
3301 " for namelist object %s", nl
->var_name
);
3305 if ((c
= next_char (dtp
)) == EOF
)
3307 unget_char (dtp
, c
);
3310 /* Make sure no extraneous qualifiers are there. */
3314 snprintf (nml_err_msg
, nml_err_msg_size
,
3315 "Qualifier for a scalar or non-character namelist object %s",
3320 /* Make sure there is no more than one non-zero rank object. */
3321 if (non_zero_rank_count
> 1)
3323 snprintf (nml_err_msg
, nml_err_msg_size
,
3324 "Multiple sub-objects with non-zero rank in namelist object %s",
3326 non_zero_rank_count
= 0;
3330 /* According to the standard, an equal sign MUST follow an object name. The
3331 following is possibly lax - it allows comments, blank lines and so on to
3332 intervene. eat_spaces (dtp); c = next_char (dtp); would be compliant*/
3336 eat_separator (dtp
);
3337 if (dtp
->u
.p
.input_complete
)
3340 if (dtp
->u
.p
.at_eol
)
3341 finish_separator (dtp
);
3342 if (dtp
->u
.p
.input_complete
)
3345 if ((c
= next_char (dtp
)) == EOF
)
3350 snprintf (nml_err_msg
, nml_err_msg_size
,
3351 "Equal sign must follow namelist object name %s",
3355 /* If a derived type, touch its components and restore the root
3356 namelist_info if we have parsed a qualified derived type
3359 if (nl
->type
== BT_DERIVED
)
3360 nml_touch_nodes (nl
);
3364 if (first_nl
->var_rank
== 0)
3366 if (component_flag
&& qualifier_flag
)
3373 dtp
->u
.p
.nml_read_error
= 0;
3374 if (!nml_read_obj (dtp
, nl
, 0, pprev_nl
, nml_err_msg
, nml_err_msg_size
,
3382 /* The EOF error message is issued by hit_eof. Return true so that the
3383 caller does not use nml_err_msg and nml_err_msg_size to generate
3384 an unrelated error message. */
3387 dtp
->u
.p
.input_complete
= 1;
3388 unget_char (dtp
, c
);
3395 /* Entry point for namelist input. Goes through input until namelist name
3396 is matched. Then cycles through nml_get_obj_data until the input is
3397 completed or there is an error. */
3400 namelist_read (st_parameter_dt
*dtp
)
3403 char nml_err_msg
[200];
3405 /* Initialize the error string buffer just in case we get an unexpected fail
3406 somewhere and end up at nml_err_ret. */
3407 strcpy (nml_err_msg
, "Internal namelist read error");
3409 /* Pointer to the previously read object, in case attempt is made to read
3410 new object name. Should this fail, error message can give previous
3412 namelist_info
*prev_nl
= NULL
;
3414 dtp
->u
.p
.namelist_mode
= 1;
3415 dtp
->u
.p
.input_complete
= 0;
3416 dtp
->u
.p
.expanded_read
= 0;
3418 /* Set the next_char and push_char worker functions. */
3421 /* Look for &namelist_name . Skip all characters, testing for $nmlname.
3422 Exit on success or EOF. If '?' or '=?' encountered in stdin, print
3423 node names or namelist on stdout. */
3426 c
= next_char (dtp
);
3438 c
= next_char (dtp
);
3440 nml_query (dtp
, '=');
3442 unget_char (dtp
, c
);
3446 nml_query (dtp
, '?');
3456 /* Match the name of the namelist. */
3458 nml_match_name (dtp
, dtp
->namelist_name
, dtp
->namelist_name_len
);
3460 if (dtp
->u
.p
.nml_read_error
)
3463 /* A trailing space is required, we give a little latitude here, 10.9.1. */
3464 c
= next_char (dtp
);
3465 if (!is_separator(c
) && c
!= '!')
3467 unget_char (dtp
, c
);
3471 unget_char (dtp
, c
);
3472 eat_separator (dtp
);
3474 /* Ready to read namelist objects. If there is an error in input
3475 from stdin, output the error message and continue. */
3477 while (!dtp
->u
.p
.input_complete
)
3479 if (!nml_get_obj_data (dtp
, &prev_nl
, nml_err_msg
, sizeof nml_err_msg
))
3481 if (dtp
->u
.p
.current_unit
->unit_number
!= options
.stdin_unit
)
3483 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, nml_err_msg
);
3486 /* Reset the previous namelist pointer if we know we are not going
3487 to be doing multiple reads within a single namelist object. */
3488 if (prev_nl
&& prev_nl
->var_rank
== 0)
3499 /* All namelist error calls return from here */
3502 generate_error (&dtp
->common
, LIBERROR_READ_VALUE
, nml_err_msg
);