1 /* Handle modules, which amounts to loading and saving symbols and
2 their attendant structures.
3 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008,
5 Free Software Foundation, Inc.
6 Contributed by Andy Vaught
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
24 /* The syntax of gfortran modules resembles that of lisp lists, i.e. a
25 sequence of atoms, which can be left or right parenthesis, names,
26 integers or strings. Parenthesis are always matched which allows
27 us to skip over sections at high speed without having to know
28 anything about the internal structure of the lists. A "name" is
29 usually a fortran 95 identifier, but can also start with '@' in
30 order to reference a hidden symbol.
32 The first line of a module is an informational message about what
33 created the module, the file it came from and when it was created.
34 The second line is a warning for people not to edit the module.
35 The rest of the module looks like:
37 ( ( <Interface info for UPLUS> )
38 ( <Interface info for UMINUS> )
41 ( ( <name of operator interface> <module of op interface> <i/f1> ... )
44 ( ( <name of generic interface> <module of generic interface> <i/f1> ... )
47 ( ( <common name> <symbol> <saved flag>)
53 ( <Symbol Number (in no particular order)>
55 <Module name of symbol>
56 ( <symbol information> )
65 In general, symbols refer to other symbols by their symbol number,
66 which are zero based. Symbols are written to the module in no
74 #include "parse.h" /* FIXME */
76 #include "constructor.h"
79 #define MODULE_EXTENSION ".mod"
81 /* Don't put any single quote (') in MOD_VERSION,
82 if yout want it to be recognized. */
83 #define MOD_VERSION "6"
86 /* Structure that describes a position within a module file. */
95 /* Structure for list of symbols of intrinsic modules. */
108 P_UNKNOWN
= 0, P_OTHER
, P_NAMESPACE
, P_COMPONENT
, P_SYMBOL
112 /* The fixup structure lists pointers to pointers that have to
113 be updated when a pointer value becomes known. */
115 typedef struct fixup_t
118 struct fixup_t
*next
;
123 /* Structure for holding extra info needed for pointers being read. */
139 typedef struct pointer_info
141 BBT_HEADER (pointer_info
);
145 /* The first component of each member of the union is the pointer
152 void *pointer
; /* Member for doing pointer searches. */
157 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
158 enum gfc_rsym_state state
;
159 int ns
, referenced
, renamed
;
162 gfc_symtree
*symtree
;
163 char binding_label
[GFC_MAX_SYMBOL_LEN
+ 1];
170 enum gfc_wsym_state state
;
179 #define gfc_get_pointer_info() XCNEW (pointer_info)
182 /* Local variables */
184 /* The FILE for the module we're reading or writing. */
185 static FILE *module_fp
;
187 /* MD5 context structure. */
188 static struct md5_ctx ctx
;
190 /* The name of the module we're reading (USE'ing) or writing. */
191 static char module_name
[GFC_MAX_SYMBOL_LEN
+ 1];
193 /* The way the module we're reading was specified. */
194 static bool specified_nonint
, specified_int
;
196 static int module_line
, module_column
, only_flag
;
198 { IO_INPUT
, IO_OUTPUT
}
201 static gfc_use_rename
*gfc_rename_list
;
202 static pointer_info
*pi_root
;
203 static int symbol_number
; /* Counter for assigning symbol numbers */
205 /* Tells mio_expr_ref to make symbols for unused equivalence members. */
206 static bool in_load_equiv
;
208 static locus use_locus
;
212 /*****************************************************************/
214 /* Pointer/integer conversion. Pointers between structures are stored
215 as integers in the module file. The next couple of subroutines
216 handle this translation for reading and writing. */
218 /* Recursively free the tree of pointer structures. */
221 free_pi_tree (pointer_info
*p
)
226 if (p
->fixup
!= NULL
)
227 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
229 free_pi_tree (p
->left
);
230 free_pi_tree (p
->right
);
236 /* Compare pointers when searching by pointer. Used when writing a
240 compare_pointers (void *_sn1
, void *_sn2
)
242 pointer_info
*sn1
, *sn2
;
244 sn1
= (pointer_info
*) _sn1
;
245 sn2
= (pointer_info
*) _sn2
;
247 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
249 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
256 /* Compare integers when searching by integer. Used when reading a
260 compare_integers (void *_sn1
, void *_sn2
)
262 pointer_info
*sn1
, *sn2
;
264 sn1
= (pointer_info
*) _sn1
;
265 sn2
= (pointer_info
*) _sn2
;
267 if (sn1
->integer
< sn2
->integer
)
269 if (sn1
->integer
> sn2
->integer
)
276 /* Initialize the pointer_info tree. */
285 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
287 /* Pointer 0 is the NULL pointer. */
288 p
= gfc_get_pointer_info ();
293 gfc_insert_bbt (&pi_root
, p
, compare
);
295 /* Pointer 1 is the current namespace. */
296 p
= gfc_get_pointer_info ();
297 p
->u
.pointer
= gfc_current_ns
;
299 p
->type
= P_NAMESPACE
;
301 gfc_insert_bbt (&pi_root
, p
, compare
);
307 /* During module writing, call here with a pointer to something,
308 returning the pointer_info node. */
310 static pointer_info
*
311 find_pointer (void *gp
)
318 if (p
->u
.pointer
== gp
)
320 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
327 /* Given a pointer while writing, returns the pointer_info tree node,
328 creating it if it doesn't exist. */
330 static pointer_info
*
331 get_pointer (void *gp
)
335 p
= find_pointer (gp
);
339 /* Pointer doesn't have an integer. Give it one. */
340 p
= gfc_get_pointer_info ();
343 p
->integer
= symbol_number
++;
345 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
351 /* Given an integer during reading, find it in the pointer_info tree,
352 creating the node if not found. */
354 static pointer_info
*
355 get_integer (int integer
)
365 c
= compare_integers (&t
, p
);
369 p
= (c
< 0) ? p
->left
: p
->right
;
375 p
= gfc_get_pointer_info ();
376 p
->integer
= integer
;
379 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
385 /* Recursive function to find a pointer within a tree by brute force. */
387 static pointer_info
*
388 fp2 (pointer_info
*p
, const void *target
)
395 if (p
->u
.pointer
== target
)
398 q
= fp2 (p
->left
, target
);
402 return fp2 (p
->right
, target
);
406 /* During reading, find a pointer_info node from the pointer value.
407 This amounts to a brute-force search. */
409 static pointer_info
*
410 find_pointer2 (void *p
)
412 return fp2 (pi_root
, p
);
416 /* Resolve any fixups using a known pointer. */
419 resolve_fixups (fixup_t
*f
, void *gp
)
432 /* Call here during module reading when we know what pointer to
433 associate with an integer. Any fixups that exist are resolved at
437 associate_integer_pointer (pointer_info
*p
, void *gp
)
439 if (p
->u
.pointer
!= NULL
)
440 gfc_internal_error ("associate_integer_pointer(): Already associated");
444 resolve_fixups (p
->fixup
, gp
);
450 /* During module reading, given an integer and a pointer to a pointer,
451 either store the pointer from an already-known value or create a
452 fixup structure in order to store things later. Returns zero if
453 the reference has been actually stored, or nonzero if the reference
454 must be fixed later (i.e., associate_integer_pointer must be called
455 sometime later. Returns the pointer_info structure. */
457 static pointer_info
*
458 add_fixup (int integer
, void *gp
)
464 p
= get_integer (integer
);
466 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
469 *cp
= (char *) p
->u
.pointer
;
478 f
->pointer
= (void **) gp
;
485 /*****************************************************************/
487 /* Parser related subroutines */
489 /* Free the rename list left behind by a USE statement. */
494 gfc_use_rename
*next
;
496 for (; gfc_rename_list
; gfc_rename_list
= next
)
498 next
= gfc_rename_list
->next
;
499 gfc_free (gfc_rename_list
);
504 /* Match a USE statement. */
509 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module_nature
[GFC_MAX_SYMBOL_LEN
+ 1];
510 gfc_use_rename
*tail
= NULL
, *new_use
;
511 interface_type type
, type2
;
515 specified_int
= false;
516 specified_nonint
= false;
518 if (gfc_match (" , ") == MATCH_YES
)
520 if ((m
= gfc_match (" %n ::", module_nature
)) == MATCH_YES
)
522 if (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: module "
523 "nature in USE statement at %C") == FAILURE
)
526 if (strcmp (module_nature
, "intrinsic") == 0)
527 specified_int
= true;
530 if (strcmp (module_nature
, "non_intrinsic") == 0)
531 specified_nonint
= true;
534 gfc_error ("Module nature in USE statement at %C shall "
535 "be either INTRINSIC or NON_INTRINSIC");
542 /* Help output a better error message than "Unclassifiable
544 gfc_match (" %n", module_nature
);
545 if (strcmp (module_nature
, "intrinsic") == 0
546 || strcmp (module_nature
, "non_intrinsic") == 0)
547 gfc_error ("\"::\" was expected after module nature at %C "
548 "but was not found");
554 m
= gfc_match (" ::");
555 if (m
== MATCH_YES
&&
556 gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
557 "\"USE :: module\" at %C") == FAILURE
)
562 m
= gfc_match ("% ");
568 use_locus
= gfc_current_locus
;
570 m
= gfc_match_name (module_name
);
577 if (gfc_match_eos () == MATCH_YES
)
579 if (gfc_match_char (',') != MATCH_YES
)
582 if (gfc_match (" only :") == MATCH_YES
)
585 if (gfc_match_eos () == MATCH_YES
)
590 /* Get a new rename struct and add it to the rename list. */
591 new_use
= gfc_get_use_rename ();
592 new_use
->where
= gfc_current_locus
;
595 if (gfc_rename_list
== NULL
)
596 gfc_rename_list
= new_use
;
598 tail
->next
= new_use
;
601 /* See what kind of interface we're dealing with. Assume it is
603 new_use
->op
= INTRINSIC_NONE
;
604 if (gfc_match_generic_spec (&type
, name
, &op
) == MATCH_ERROR
)
609 case INTERFACE_NAMELESS
:
610 gfc_error ("Missing generic specification in USE statement at %C");
613 case INTERFACE_USER_OP
:
614 case INTERFACE_GENERIC
:
615 m
= gfc_match (" =>");
617 if (type
== INTERFACE_USER_OP
&& m
== MATCH_YES
618 && (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: Renaming "
619 "operators in USE statements at %C")
623 if (type
== INTERFACE_USER_OP
)
624 new_use
->op
= INTRINSIC_USER
;
629 strcpy (new_use
->use_name
, name
);
632 strcpy (new_use
->local_name
, name
);
633 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
638 if (m
== MATCH_ERROR
)
646 strcpy (new_use
->local_name
, name
);
648 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
653 if (m
== MATCH_ERROR
)
657 if (strcmp (new_use
->use_name
, module_name
) == 0
658 || strcmp (new_use
->local_name
, module_name
) == 0)
660 gfc_error ("The name '%s' at %C has already been used as "
661 "an external module name.", module_name
);
666 case INTERFACE_INTRINSIC_OP
:
674 if (gfc_match_eos () == MATCH_YES
)
676 if (gfc_match_char (',') != MATCH_YES
)
683 gfc_syntax_error (ST_USE
);
691 /* Given a name and a number, inst, return the inst name
692 under which to load this symbol. Returns NULL if this
693 symbol shouldn't be loaded. If inst is zero, returns
694 the number of instances of this name. If interface is
695 true, a user-defined operator is sought, otherwise only
696 non-operators are sought. */
699 find_use_name_n (const char *name
, int *inst
, bool interface
)
705 for (u
= gfc_rename_list
; u
; u
= u
->next
)
707 if (strcmp (u
->use_name
, name
) != 0
708 || (u
->op
== INTRINSIC_USER
&& !interface
)
709 || (u
->op
!= INTRINSIC_USER
&& interface
))
722 return only_flag
? NULL
: name
;
726 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
730 /* Given a name, return the name under which to load this symbol.
731 Returns NULL if this symbol shouldn't be loaded. */
734 find_use_name (const char *name
, bool interface
)
737 return find_use_name_n (name
, &i
, interface
);
741 /* Given a real name, return the number of use names associated with it. */
744 number_use_names (const char *name
, bool interface
)
747 find_use_name_n (name
, &i
, interface
);
752 /* Try to find the operator in the current list. */
754 static gfc_use_rename
*
755 find_use_operator (gfc_intrinsic_op op
)
759 for (u
= gfc_rename_list
; u
; u
= u
->next
)
767 /*****************************************************************/
769 /* The next couple of subroutines maintain a tree used to avoid a
770 brute-force search for a combination of true name and module name.
771 While symtree names, the name that a particular symbol is known by
772 can changed with USE statements, we still have to keep track of the
773 true names to generate the correct reference, and also avoid
774 loading the same real symbol twice in a program unit.
776 When we start reading, the true name tree is built and maintained
777 as symbols are read. The tree is searched as we load new symbols
778 to see if it already exists someplace in the namespace. */
780 typedef struct true_name
782 BBT_HEADER (true_name
);
787 static true_name
*true_name_root
;
790 /* Compare two true_name structures. */
793 compare_true_names (void *_t1
, void *_t2
)
798 t1
= (true_name
*) _t1
;
799 t2
= (true_name
*) _t2
;
801 c
= ((t1
->sym
->module
> t2
->sym
->module
)
802 - (t1
->sym
->module
< t2
->sym
->module
));
806 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
810 /* Given a true name, search the true name tree to see if it exists
811 within the main namespace. */
814 find_true_name (const char *name
, const char *module
)
820 sym
.name
= gfc_get_string (name
);
822 sym
.module
= gfc_get_string (module
);
830 c
= compare_true_names ((void *) (&t
), (void *) p
);
834 p
= (c
< 0) ? p
->left
: p
->right
;
841 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
844 add_true_name (gfc_symbol
*sym
)
848 t
= XCNEW (true_name
);
851 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
855 /* Recursive function to build the initial true name tree by
856 recursively traversing the current namespace. */
859 build_tnt (gfc_symtree
*st
)
864 build_tnt (st
->left
);
865 build_tnt (st
->right
);
867 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
870 add_true_name (st
->n
.sym
);
874 /* Initialize the true name tree with the current namespace. */
877 init_true_name_tree (void)
879 true_name_root
= NULL
;
880 build_tnt (gfc_current_ns
->sym_root
);
884 /* Recursively free a true name tree node. */
887 free_true_name (true_name
*t
)
891 free_true_name (t
->left
);
892 free_true_name (t
->right
);
898 /*****************************************************************/
900 /* Module reading and writing. */
904 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
908 static atom_type last_atom
;
911 /* The name buffer must be at least as long as a symbol name. Right
912 now it's not clear how we're going to store numeric constants--
913 probably as a hexadecimal string, since this will allow the exact
914 number to be preserved (this can't be done by a decimal
915 representation). Worry about that later. TODO! */
917 #define MAX_ATOM_SIZE 100
920 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
923 /* Report problems with a module. Error reporting is not very
924 elaborate, since this sorts of errors shouldn't really happen.
925 This subroutine never returns. */
927 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
930 bad_module (const char *msgid
)
937 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
938 module_name
, module_line
, module_column
, msgid
);
941 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
942 module_name
, module_line
, module_column
, msgid
);
945 gfc_fatal_error ("Module %s at line %d column %d: %s",
946 module_name
, module_line
, module_column
, msgid
);
952 /* Set the module's input pointer. */
955 set_module_locus (module_locus
*m
)
957 module_column
= m
->column
;
958 module_line
= m
->line
;
959 fsetpos (module_fp
, &m
->pos
);
963 /* Get the module's input pointer so that we can restore it later. */
966 get_module_locus (module_locus
*m
)
968 m
->column
= module_column
;
969 m
->line
= module_line
;
970 fgetpos (module_fp
, &m
->pos
);
974 /* Get the next character in the module, updating our reckoning of
982 c
= getc (module_fp
);
985 bad_module ("Unexpected EOF");
998 /* Parse a string constant. The delimiter is guaranteed to be a
1008 get_module_locus (&start
);
1012 /* See how long the string is. */
1017 bad_module ("Unexpected end of module in string constant");
1035 set_module_locus (&start
);
1037 atom_string
= p
= XCNEWVEC (char, len
+ 1);
1039 for (; len
> 0; len
--)
1043 module_char (); /* Guaranteed to be another \'. */
1047 module_char (); /* Terminating \'. */
1048 *p
= '\0'; /* C-style string for debug purposes. */
1052 /* Parse a small integer. */
1055 parse_integer (int c
)
1063 get_module_locus (&m
);
1069 atom_int
= 10 * atom_int
+ c
- '0';
1070 if (atom_int
> 99999999)
1071 bad_module ("Integer overflow");
1074 set_module_locus (&m
);
1092 get_module_locus (&m
);
1097 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
1101 if (++len
> GFC_MAX_SYMBOL_LEN
)
1102 bad_module ("Name too long");
1107 fseek (module_fp
, -1, SEEK_CUR
);
1108 module_column
= m
.column
+ len
- 1;
1115 /* Read the next atom in the module's input stream. */
1126 while (c
== ' ' || c
== '\r' || c
== '\n');
1151 return ATOM_INTEGER
;
1209 bad_module ("Bad name");
1216 /* Peek at the next atom on the input. */
1224 get_module_locus (&m
);
1227 if (a
== ATOM_STRING
)
1228 gfc_free (atom_string
);
1230 set_module_locus (&m
);
1235 /* Read the next atom from the input, requiring that it be a
1239 require_atom (atom_type type
)
1245 get_module_locus (&m
);
1253 p
= _("Expected name");
1256 p
= _("Expected left parenthesis");
1259 p
= _("Expected right parenthesis");
1262 p
= _("Expected integer");
1265 p
= _("Expected string");
1268 gfc_internal_error ("require_atom(): bad atom type required");
1271 set_module_locus (&m
);
1277 /* Given a pointer to an mstring array, require that the current input
1278 be one of the strings in the array. We return the enum value. */
1281 find_enum (const mstring
*m
)
1285 i
= gfc_string2code (m
, atom_name
);
1289 bad_module ("find_enum(): Enum not found");
1295 /**************** Module output subroutines ***************************/
1297 /* Output a character to a module file. */
1300 write_char (char out
)
1302 if (putc (out
, module_fp
) == EOF
)
1303 gfc_fatal_error ("Error writing modules file: %s", xstrerror (errno
));
1305 /* Add this to our MD5. */
1306 md5_process_bytes (&out
, sizeof (out
), &ctx
);
1318 /* Write an atom to a module. The line wrapping isn't perfect, but it
1319 should work most of the time. This isn't that big of a deal, since
1320 the file really isn't meant to be read by people anyway. */
1323 write_atom (atom_type atom
, const void *v
)
1333 p
= (const char *) v
;
1345 i
= *((const int *) v
);
1347 gfc_internal_error ("write_atom(): Writing negative integer");
1349 sprintf (buffer
, "%d", i
);
1354 gfc_internal_error ("write_atom(): Trying to write dab atom");
1358 if(p
== NULL
|| *p
== '\0')
1363 if (atom
!= ATOM_RPAREN
)
1365 if (module_column
+ len
> 72)
1370 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1375 if (atom
== ATOM_STRING
)
1378 while (p
!= NULL
&& *p
)
1380 if (atom
== ATOM_STRING
&& *p
== '\'')
1385 if (atom
== ATOM_STRING
)
1393 /***************** Mid-level I/O subroutines *****************/
1395 /* These subroutines let their caller read or write atoms without
1396 caring about which of the two is actually happening. This lets a
1397 subroutine concentrate on the actual format of the data being
1400 static void mio_expr (gfc_expr
**);
1401 pointer_info
*mio_symbol_ref (gfc_symbol
**);
1402 pointer_info
*mio_interface_rest (gfc_interface
**);
1403 static void mio_symtree_ref (gfc_symtree
**);
1405 /* Read or write an enumerated value. On writing, we return the input
1406 value for the convenience of callers. We avoid using an integer
1407 pointer because enums are sometimes inside bitfields. */
1410 mio_name (int t
, const mstring
*m
)
1412 if (iomode
== IO_OUTPUT
)
1413 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1416 require_atom (ATOM_NAME
);
1423 /* Specialization of mio_name. */
1425 #define DECL_MIO_NAME(TYPE) \
1426 static inline TYPE \
1427 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1429 return (TYPE) mio_name ((int) t, m); \
1431 #define MIO_NAME(TYPE) mio_name_##TYPE
1436 if (iomode
== IO_OUTPUT
)
1437 write_atom (ATOM_LPAREN
, NULL
);
1439 require_atom (ATOM_LPAREN
);
1446 if (iomode
== IO_OUTPUT
)
1447 write_atom (ATOM_RPAREN
, NULL
);
1449 require_atom (ATOM_RPAREN
);
1454 mio_integer (int *ip
)
1456 if (iomode
== IO_OUTPUT
)
1457 write_atom (ATOM_INTEGER
, ip
);
1460 require_atom (ATOM_INTEGER
);
1466 /* Read or write a gfc_intrinsic_op value. */
1469 mio_intrinsic_op (gfc_intrinsic_op
* op
)
1471 /* FIXME: Would be nicer to do this via the operators symbolic name. */
1472 if (iomode
== IO_OUTPUT
)
1474 int converted
= (int) *op
;
1475 write_atom (ATOM_INTEGER
, &converted
);
1479 require_atom (ATOM_INTEGER
);
1480 *op
= (gfc_intrinsic_op
) atom_int
;
1485 /* Read or write a character pointer that points to a string on the heap. */
1488 mio_allocated_string (const char *s
)
1490 if (iomode
== IO_OUTPUT
)
1492 write_atom (ATOM_STRING
, s
);
1497 require_atom (ATOM_STRING
);
1503 /* Functions for quoting and unquoting strings. */
1506 quote_string (const gfc_char_t
*s
, const size_t slength
)
1508 const gfc_char_t
*p
;
1512 /* Calculate the length we'll need: a backslash takes two ("\\"),
1513 non-printable characters take 10 ("\Uxxxxxxxx") and others take 1. */
1514 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1518 else if (!gfc_wide_is_printable (*p
))
1524 q
= res
= XCNEWVEC (char, len
+ 1);
1525 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1528 *q
++ = '\\', *q
++ = '\\';
1529 else if (!gfc_wide_is_printable (*p
))
1531 sprintf (q
, "\\U%08" HOST_WIDE_INT_PRINT
"x",
1532 (unsigned HOST_WIDE_INT
) *p
);
1536 *q
++ = (unsigned char) *p
;
1544 unquote_string (const char *s
)
1550 for (p
= s
, len
= 0; *p
; p
++, len
++)
1557 else if (p
[1] == 'U')
1558 p
+= 9; /* That is a "\U????????". */
1560 gfc_internal_error ("unquote_string(): got bad string");
1563 res
= gfc_get_wide_string (len
+ 1);
1564 for (i
= 0, p
= s
; i
< len
; i
++, p
++)
1569 res
[i
] = (unsigned char) *p
;
1570 else if (p
[1] == '\\')
1572 res
[i
] = (unsigned char) '\\';
1577 /* We read the 8-digits hexadecimal constant that follows. */
1582 gcc_assert (p
[1] == 'U');
1583 for (j
= 0; j
< 8; j
++)
1586 gcc_assert (sscanf (&p
[j
+2], "%01x", &n
) == 1);
1600 /* Read or write a character pointer that points to a wide string on the
1601 heap, performing quoting/unquoting of nonprintable characters using the
1602 form \U???????? (where each ? is a hexadecimal digit).
1603 Length is the length of the string, only known and used in output mode. */
1605 static const gfc_char_t
*
1606 mio_allocated_wide_string (const gfc_char_t
*s
, const size_t length
)
1608 if (iomode
== IO_OUTPUT
)
1610 char *quoted
= quote_string (s
, length
);
1611 write_atom (ATOM_STRING
, quoted
);
1617 gfc_char_t
*unquoted
;
1619 require_atom (ATOM_STRING
);
1620 unquoted
= unquote_string (atom_string
);
1621 gfc_free (atom_string
);
1627 /* Read or write a string that is in static memory. */
1630 mio_pool_string (const char **stringp
)
1632 /* TODO: one could write the string only once, and refer to it via a
1635 /* As a special case we have to deal with a NULL string. This
1636 happens for the 'module' member of 'gfc_symbol's that are not in a
1637 module. We read / write these as the empty string. */
1638 if (iomode
== IO_OUTPUT
)
1640 const char *p
= *stringp
== NULL
? "" : *stringp
;
1641 write_atom (ATOM_STRING
, p
);
1645 require_atom (ATOM_STRING
);
1646 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1647 gfc_free (atom_string
);
1652 /* Read or write a string that is inside of some already-allocated
1656 mio_internal_string (char *string
)
1658 if (iomode
== IO_OUTPUT
)
1659 write_atom (ATOM_STRING
, string
);
1662 require_atom (ATOM_STRING
);
1663 strcpy (string
, atom_string
);
1664 gfc_free (atom_string
);
1670 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1671 AB_POINTER
, AB_TARGET
, AB_DUMMY
, AB_RESULT
, AB_DATA
,
1672 AB_IN_NAMELIST
, AB_IN_COMMON
, AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
,
1673 AB_ELEMENTAL
, AB_PURE
, AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
,
1674 AB_CRAY_POINTER
, AB_CRAY_POINTEE
, AB_THREADPRIVATE
, AB_ALLOC_COMP
,
1675 AB_POINTER_COMP
, AB_PRIVATE_COMP
, AB_VALUE
, AB_VOLATILE
, AB_PROTECTED
,
1676 AB_IS_BIND_C
, AB_IS_C_INTEROP
, AB_IS_ISO_C
, AB_ABSTRACT
, AB_ZERO_COMP
,
1677 AB_IS_CLASS
, AB_PROCEDURE
, AB_PROC_POINTER
, AB_ASYNCHRONOUS
, AB_CODIMENSION
,
1678 AB_COARRAY_COMP
, AB_VTYPE
, AB_VTAB
, AB_CONTIGUOUS
, AB_CLASS_POINTER
1682 static const mstring attr_bits
[] =
1684 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1685 minit ("ASYNCHRONOUS", AB_ASYNCHRONOUS
),
1686 minit ("DIMENSION", AB_DIMENSION
),
1687 minit ("CODIMENSION", AB_CODIMENSION
),
1688 minit ("CONTIGUOUS", AB_CONTIGUOUS
),
1689 minit ("EXTERNAL", AB_EXTERNAL
),
1690 minit ("INTRINSIC", AB_INTRINSIC
),
1691 minit ("OPTIONAL", AB_OPTIONAL
),
1692 minit ("POINTER", AB_POINTER
),
1693 minit ("VOLATILE", AB_VOLATILE
),
1694 minit ("TARGET", AB_TARGET
),
1695 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1696 minit ("DUMMY", AB_DUMMY
),
1697 minit ("RESULT", AB_RESULT
),
1698 minit ("DATA", AB_DATA
),
1699 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1700 minit ("IN_COMMON", AB_IN_COMMON
),
1701 minit ("FUNCTION", AB_FUNCTION
),
1702 minit ("SUBROUTINE", AB_SUBROUTINE
),
1703 minit ("SEQUENCE", AB_SEQUENCE
),
1704 minit ("ELEMENTAL", AB_ELEMENTAL
),
1705 minit ("PURE", AB_PURE
),
1706 minit ("RECURSIVE", AB_RECURSIVE
),
1707 minit ("GENERIC", AB_GENERIC
),
1708 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1709 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1710 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1711 minit ("IS_BIND_C", AB_IS_BIND_C
),
1712 minit ("IS_C_INTEROP", AB_IS_C_INTEROP
),
1713 minit ("IS_ISO_C", AB_IS_ISO_C
),
1714 minit ("VALUE", AB_VALUE
),
1715 minit ("ALLOC_COMP", AB_ALLOC_COMP
),
1716 minit ("COARRAY_COMP", AB_COARRAY_COMP
),
1717 minit ("POINTER_COMP", AB_POINTER_COMP
),
1718 minit ("PRIVATE_COMP", AB_PRIVATE_COMP
),
1719 minit ("ZERO_COMP", AB_ZERO_COMP
),
1720 minit ("PROTECTED", AB_PROTECTED
),
1721 minit ("ABSTRACT", AB_ABSTRACT
),
1722 minit ("IS_CLASS", AB_IS_CLASS
),
1723 minit ("PROCEDURE", AB_PROCEDURE
),
1724 minit ("PROC_POINTER", AB_PROC_POINTER
),
1725 minit ("VTYPE", AB_VTYPE
),
1726 minit ("VTAB", AB_VTAB
),
1727 minit ("CLASS_POINTER", AB_CLASS_POINTER
),
1731 /* For binding attributes. */
1732 static const mstring binding_passing
[] =
1735 minit ("NOPASS", 1),
1738 static const mstring binding_overriding
[] =
1740 minit ("OVERRIDABLE", 0),
1741 minit ("NON_OVERRIDABLE", 1),
1742 minit ("DEFERRED", 2),
1745 static const mstring binding_generic
[] =
1747 minit ("SPECIFIC", 0),
1748 minit ("GENERIC", 1),
1751 static const mstring binding_ppc
[] =
1753 minit ("NO_PPC", 0),
1758 /* Specialization of mio_name. */
1759 DECL_MIO_NAME (ab_attribute
)
1760 DECL_MIO_NAME (ar_type
)
1761 DECL_MIO_NAME (array_type
)
1763 DECL_MIO_NAME (expr_t
)
1764 DECL_MIO_NAME (gfc_access
)
1765 DECL_MIO_NAME (gfc_intrinsic_op
)
1766 DECL_MIO_NAME (ifsrc
)
1767 DECL_MIO_NAME (save_state
)
1768 DECL_MIO_NAME (procedure_type
)
1769 DECL_MIO_NAME (ref_type
)
1770 DECL_MIO_NAME (sym_flavor
)
1771 DECL_MIO_NAME (sym_intent
)
1772 #undef DECL_MIO_NAME
1774 /* Symbol attributes are stored in list with the first three elements
1775 being the enumerated fields, while the remaining elements (if any)
1776 indicate the individual attribute bits. The access field is not
1777 saved-- it controls what symbols are exported when a module is
1781 mio_symbol_attribute (symbol_attribute
*attr
)
1784 unsigned ext_attr
,extension_level
;
1788 attr
->flavor
= MIO_NAME (sym_flavor
) (attr
->flavor
, flavors
);
1789 attr
->intent
= MIO_NAME (sym_intent
) (attr
->intent
, intents
);
1790 attr
->proc
= MIO_NAME (procedure_type
) (attr
->proc
, procedures
);
1791 attr
->if_source
= MIO_NAME (ifsrc
) (attr
->if_source
, ifsrc_types
);
1792 attr
->save
= MIO_NAME (save_state
) (attr
->save
, save_status
);
1794 ext_attr
= attr
->ext_attr
;
1795 mio_integer ((int *) &ext_attr
);
1796 attr
->ext_attr
= ext_attr
;
1798 extension_level
= attr
->extension
;
1799 mio_integer ((int *) &extension_level
);
1800 attr
->extension
= extension_level
;
1802 if (iomode
== IO_OUTPUT
)
1804 if (attr
->allocatable
)
1805 MIO_NAME (ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1806 if (attr
->asynchronous
)
1807 MIO_NAME (ab_attribute
) (AB_ASYNCHRONOUS
, attr_bits
);
1808 if (attr
->dimension
)
1809 MIO_NAME (ab_attribute
) (AB_DIMENSION
, attr_bits
);
1810 if (attr
->codimension
)
1811 MIO_NAME (ab_attribute
) (AB_CODIMENSION
, attr_bits
);
1812 if (attr
->contiguous
)
1813 MIO_NAME (ab_attribute
) (AB_CONTIGUOUS
, attr_bits
);
1815 MIO_NAME (ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1816 if (attr
->intrinsic
)
1817 MIO_NAME (ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1819 MIO_NAME (ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1821 MIO_NAME (ab_attribute
) (AB_POINTER
, attr_bits
);
1822 if (attr
->class_pointer
)
1823 MIO_NAME (ab_attribute
) (AB_CLASS_POINTER
, attr_bits
);
1824 if (attr
->is_protected
)
1825 MIO_NAME (ab_attribute
) (AB_PROTECTED
, attr_bits
);
1827 MIO_NAME (ab_attribute
) (AB_VALUE
, attr_bits
);
1828 if (attr
->volatile_
)
1829 MIO_NAME (ab_attribute
) (AB_VOLATILE
, attr_bits
);
1831 MIO_NAME (ab_attribute
) (AB_TARGET
, attr_bits
);
1832 if (attr
->threadprivate
)
1833 MIO_NAME (ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1835 MIO_NAME (ab_attribute
) (AB_DUMMY
, attr_bits
);
1837 MIO_NAME (ab_attribute
) (AB_RESULT
, attr_bits
);
1838 /* We deliberately don't preserve the "entry" flag. */
1841 MIO_NAME (ab_attribute
) (AB_DATA
, attr_bits
);
1842 if (attr
->in_namelist
)
1843 MIO_NAME (ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1844 if (attr
->in_common
)
1845 MIO_NAME (ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1848 MIO_NAME (ab_attribute
) (AB_FUNCTION
, attr_bits
);
1849 if (attr
->subroutine
)
1850 MIO_NAME (ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1852 MIO_NAME (ab_attribute
) (AB_GENERIC
, attr_bits
);
1854 MIO_NAME (ab_attribute
) (AB_ABSTRACT
, attr_bits
);
1857 MIO_NAME (ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1858 if (attr
->elemental
)
1859 MIO_NAME (ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1861 MIO_NAME (ab_attribute
) (AB_PURE
, attr_bits
);
1862 if (attr
->recursive
)
1863 MIO_NAME (ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1864 if (attr
->always_explicit
)
1865 MIO_NAME (ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1866 if (attr
->cray_pointer
)
1867 MIO_NAME (ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1868 if (attr
->cray_pointee
)
1869 MIO_NAME (ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1870 if (attr
->is_bind_c
)
1871 MIO_NAME(ab_attribute
) (AB_IS_BIND_C
, attr_bits
);
1872 if (attr
->is_c_interop
)
1873 MIO_NAME(ab_attribute
) (AB_IS_C_INTEROP
, attr_bits
);
1875 MIO_NAME(ab_attribute
) (AB_IS_ISO_C
, attr_bits
);
1876 if (attr
->alloc_comp
)
1877 MIO_NAME (ab_attribute
) (AB_ALLOC_COMP
, attr_bits
);
1878 if (attr
->pointer_comp
)
1879 MIO_NAME (ab_attribute
) (AB_POINTER_COMP
, attr_bits
);
1880 if (attr
->private_comp
)
1881 MIO_NAME (ab_attribute
) (AB_PRIVATE_COMP
, attr_bits
);
1882 if (attr
->coarray_comp
)
1883 MIO_NAME (ab_attribute
) (AB_COARRAY_COMP
, attr_bits
);
1884 if (attr
->zero_comp
)
1885 MIO_NAME (ab_attribute
) (AB_ZERO_COMP
, attr_bits
);
1887 MIO_NAME (ab_attribute
) (AB_IS_CLASS
, attr_bits
);
1888 if (attr
->procedure
)
1889 MIO_NAME (ab_attribute
) (AB_PROCEDURE
, attr_bits
);
1890 if (attr
->proc_pointer
)
1891 MIO_NAME (ab_attribute
) (AB_PROC_POINTER
, attr_bits
);
1893 MIO_NAME (ab_attribute
) (AB_VTYPE
, attr_bits
);
1895 MIO_NAME (ab_attribute
) (AB_VTAB
, attr_bits
);
1905 if (t
== ATOM_RPAREN
)
1908 bad_module ("Expected attribute bit name");
1910 switch ((ab_attribute
) find_enum (attr_bits
))
1912 case AB_ALLOCATABLE
:
1913 attr
->allocatable
= 1;
1915 case AB_ASYNCHRONOUS
:
1916 attr
->asynchronous
= 1;
1919 attr
->dimension
= 1;
1921 case AB_CODIMENSION
:
1922 attr
->codimension
= 1;
1925 attr
->contiguous
= 1;
1931 attr
->intrinsic
= 1;
1939 case AB_CLASS_POINTER
:
1940 attr
->class_pointer
= 1;
1943 attr
->is_protected
= 1;
1949 attr
->volatile_
= 1;
1954 case AB_THREADPRIVATE
:
1955 attr
->threadprivate
= 1;
1966 case AB_IN_NAMELIST
:
1967 attr
->in_namelist
= 1;
1970 attr
->in_common
= 1;
1976 attr
->subroutine
= 1;
1988 attr
->elemental
= 1;
1994 attr
->recursive
= 1;
1996 case AB_ALWAYS_EXPLICIT
:
1997 attr
->always_explicit
= 1;
1999 case AB_CRAY_POINTER
:
2000 attr
->cray_pointer
= 1;
2002 case AB_CRAY_POINTEE
:
2003 attr
->cray_pointee
= 1;
2006 attr
->is_bind_c
= 1;
2008 case AB_IS_C_INTEROP
:
2009 attr
->is_c_interop
= 1;
2015 attr
->alloc_comp
= 1;
2017 case AB_COARRAY_COMP
:
2018 attr
->coarray_comp
= 1;
2020 case AB_POINTER_COMP
:
2021 attr
->pointer_comp
= 1;
2023 case AB_PRIVATE_COMP
:
2024 attr
->private_comp
= 1;
2027 attr
->zero_comp
= 1;
2033 attr
->procedure
= 1;
2035 case AB_PROC_POINTER
:
2036 attr
->proc_pointer
= 1;
2050 static const mstring bt_types
[] = {
2051 minit ("INTEGER", BT_INTEGER
),
2052 minit ("REAL", BT_REAL
),
2053 minit ("COMPLEX", BT_COMPLEX
),
2054 minit ("LOGICAL", BT_LOGICAL
),
2055 minit ("CHARACTER", BT_CHARACTER
),
2056 minit ("DERIVED", BT_DERIVED
),
2057 minit ("CLASS", BT_CLASS
),
2058 minit ("PROCEDURE", BT_PROCEDURE
),
2059 minit ("UNKNOWN", BT_UNKNOWN
),
2060 minit ("VOID", BT_VOID
),
2066 mio_charlen (gfc_charlen
**clp
)
2072 if (iomode
== IO_OUTPUT
)
2076 mio_expr (&cl
->length
);
2080 if (peek_atom () != ATOM_RPAREN
)
2082 cl
= gfc_new_charlen (gfc_current_ns
, NULL
);
2083 mio_expr (&cl
->length
);
2092 /* See if a name is a generated name. */
2095 check_unique_name (const char *name
)
2097 return *name
== '@';
2102 mio_typespec (gfc_typespec
*ts
)
2106 ts
->type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2108 if (ts
->type
!= BT_DERIVED
&& ts
->type
!= BT_CLASS
)
2109 mio_integer (&ts
->kind
);
2111 mio_symbol_ref (&ts
->u
.derived
);
2113 /* Add info for C interop and is_iso_c. */
2114 mio_integer (&ts
->is_c_interop
);
2115 mio_integer (&ts
->is_iso_c
);
2117 /* If the typespec is for an identifier either from iso_c_binding, or
2118 a constant that was initialized to an identifier from it, use the
2119 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
2121 ts
->f90_type
= MIO_NAME (bt
) (ts
->f90_type
, bt_types
);
2123 ts
->f90_type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2125 if (ts
->type
!= BT_CHARACTER
)
2127 /* ts->u.cl is only valid for BT_CHARACTER. */
2132 mio_charlen (&ts
->u
.cl
);
2138 static const mstring array_spec_types
[] = {
2139 minit ("EXPLICIT", AS_EXPLICIT
),
2140 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
2141 minit ("DEFERRED", AS_DEFERRED
),
2142 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
2148 mio_array_spec (gfc_array_spec
**asp
)
2155 if (iomode
== IO_OUTPUT
)
2163 if (peek_atom () == ATOM_RPAREN
)
2169 *asp
= as
= gfc_get_array_spec ();
2172 mio_integer (&as
->rank
);
2173 mio_integer (&as
->corank
);
2174 as
->type
= MIO_NAME (array_type
) (as
->type
, array_spec_types
);
2176 for (i
= 0; i
< as
->rank
+ as
->corank
; i
++)
2178 mio_expr (&as
->lower
[i
]);
2179 mio_expr (&as
->upper
[i
]);
2187 /* Given a pointer to an array reference structure (which lives in a
2188 gfc_ref structure), find the corresponding array specification
2189 structure. Storing the pointer in the ref structure doesn't quite
2190 work when loading from a module. Generating code for an array
2191 reference also needs more information than just the array spec. */
2193 static const mstring array_ref_types
[] = {
2194 minit ("FULL", AR_FULL
),
2195 minit ("ELEMENT", AR_ELEMENT
),
2196 minit ("SECTION", AR_SECTION
),
2202 mio_array_ref (gfc_array_ref
*ar
)
2207 ar
->type
= MIO_NAME (ar_type
) (ar
->type
, array_ref_types
);
2208 mio_integer (&ar
->dimen
);
2216 for (i
= 0; i
< ar
->dimen
; i
++)
2217 mio_expr (&ar
->start
[i
]);
2222 for (i
= 0; i
< ar
->dimen
; i
++)
2224 mio_expr (&ar
->start
[i
]);
2225 mio_expr (&ar
->end
[i
]);
2226 mio_expr (&ar
->stride
[i
]);
2232 gfc_internal_error ("mio_array_ref(): Unknown array ref");
2235 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
2236 we can't call mio_integer directly. Instead loop over each element
2237 and cast it to/from an integer. */
2238 if (iomode
== IO_OUTPUT
)
2240 for (i
= 0; i
< ar
->dimen
; i
++)
2242 int tmp
= (int)ar
->dimen_type
[i
];
2243 write_atom (ATOM_INTEGER
, &tmp
);
2248 for (i
= 0; i
< ar
->dimen
; i
++)
2250 require_atom (ATOM_INTEGER
);
2251 ar
->dimen_type
[i
] = (enum gfc_array_ref_dimen_type
) atom_int
;
2255 if (iomode
== IO_INPUT
)
2257 ar
->where
= gfc_current_locus
;
2259 for (i
= 0; i
< ar
->dimen
; i
++)
2260 ar
->c_where
[i
] = gfc_current_locus
;
2267 /* Saves or restores a pointer. The pointer is converted back and
2268 forth from an integer. We return the pointer_info pointer so that
2269 the caller can take additional action based on the pointer type. */
2271 static pointer_info
*
2272 mio_pointer_ref (void *gp
)
2276 if (iomode
== IO_OUTPUT
)
2278 p
= get_pointer (*((char **) gp
));
2279 write_atom (ATOM_INTEGER
, &p
->integer
);
2283 require_atom (ATOM_INTEGER
);
2284 p
= add_fixup (atom_int
, gp
);
2291 /* Save and load references to components that occur within
2292 expressions. We have to describe these references by a number and
2293 by name. The number is necessary for forward references during
2294 reading, and the name is necessary if the symbol already exists in
2295 the namespace and is not loaded again. */
2298 mio_component_ref (gfc_component
**cp
, gfc_symbol
*sym
)
2300 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2304 p
= mio_pointer_ref (cp
);
2305 if (p
->type
== P_UNKNOWN
)
2306 p
->type
= P_COMPONENT
;
2308 if (iomode
== IO_OUTPUT
)
2309 mio_pool_string (&(*cp
)->name
);
2312 mio_internal_string (name
);
2314 /* It can happen that a component reference can be read before the
2315 associated derived type symbol has been loaded. Return now and
2316 wait for a later iteration of load_needed. */
2320 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
2322 /* Symbol already loaded, so search by name. */
2323 for (q
= sym
->components
; q
; q
= q
->next
)
2324 if (strcmp (q
->name
, name
) == 0)
2328 gfc_internal_error ("mio_component_ref(): Component not found");
2330 associate_integer_pointer (p
, q
);
2333 /* Make sure this symbol will eventually be loaded. */
2334 p
= find_pointer2 (sym
);
2335 if (p
->u
.rsym
.state
== UNUSED
)
2336 p
->u
.rsym
.state
= NEEDED
;
2341 static void mio_namespace_ref (gfc_namespace
**nsp
);
2342 static void mio_formal_arglist (gfc_formal_arglist
**formal
);
2343 static void mio_typebound_proc (gfc_typebound_proc
** proc
);
2346 mio_component (gfc_component
*c
, int vtype
)
2350 gfc_formal_arglist
*formal
;
2354 if (iomode
== IO_OUTPUT
)
2356 p
= get_pointer (c
);
2357 mio_integer (&p
->integer
);
2362 p
= get_integer (n
);
2363 associate_integer_pointer (p
, c
);
2366 if (p
->type
== P_UNKNOWN
)
2367 p
->type
= P_COMPONENT
;
2369 mio_pool_string (&c
->name
);
2370 mio_typespec (&c
->ts
);
2371 mio_array_spec (&c
->as
);
2373 mio_symbol_attribute (&c
->attr
);
2374 c
->attr
.access
= MIO_NAME (gfc_access
) (c
->attr
.access
, access_types
);
2377 mio_expr (&c
->initializer
);
2379 if (c
->attr
.proc_pointer
)
2381 if (iomode
== IO_OUTPUT
)
2384 while (formal
&& !formal
->sym
)
2385 formal
= formal
->next
;
2388 mio_namespace_ref (&formal
->sym
->ns
);
2390 mio_namespace_ref (&c
->formal_ns
);
2394 mio_namespace_ref (&c
->formal_ns
);
2395 /* TODO: if (c->formal_ns)
2397 c->formal_ns->proc_name = c;
2402 mio_formal_arglist (&c
->formal
);
2404 mio_typebound_proc (&c
->tb
);
2412 mio_component_list (gfc_component
**cp
, int vtype
)
2414 gfc_component
*c
, *tail
;
2418 if (iomode
== IO_OUTPUT
)
2420 for (c
= *cp
; c
; c
= c
->next
)
2421 mio_component (c
, vtype
);
2430 if (peek_atom () == ATOM_RPAREN
)
2433 c
= gfc_get_component ();
2434 mio_component (c
, vtype
);
2450 mio_actual_arg (gfc_actual_arglist
*a
)
2453 mio_pool_string (&a
->name
);
2454 mio_expr (&a
->expr
);
2460 mio_actual_arglist (gfc_actual_arglist
**ap
)
2462 gfc_actual_arglist
*a
, *tail
;
2466 if (iomode
== IO_OUTPUT
)
2468 for (a
= *ap
; a
; a
= a
->next
)
2478 if (peek_atom () != ATOM_LPAREN
)
2481 a
= gfc_get_actual_arglist ();
2497 /* Read and write formal argument lists. */
2500 mio_formal_arglist (gfc_formal_arglist
**formal
)
2502 gfc_formal_arglist
*f
, *tail
;
2506 if (iomode
== IO_OUTPUT
)
2508 for (f
= *formal
; f
; f
= f
->next
)
2509 mio_symbol_ref (&f
->sym
);
2513 *formal
= tail
= NULL
;
2515 while (peek_atom () != ATOM_RPAREN
)
2517 f
= gfc_get_formal_arglist ();
2518 mio_symbol_ref (&f
->sym
);
2520 if (*formal
== NULL
)
2533 /* Save or restore a reference to a symbol node. */
2536 mio_symbol_ref (gfc_symbol
**symp
)
2540 p
= mio_pointer_ref (symp
);
2541 if (p
->type
== P_UNKNOWN
)
2544 if (iomode
== IO_OUTPUT
)
2546 if (p
->u
.wsym
.state
== UNREFERENCED
)
2547 p
->u
.wsym
.state
= NEEDS_WRITE
;
2551 if (p
->u
.rsym
.state
== UNUSED
)
2552 p
->u
.rsym
.state
= NEEDED
;
2558 /* Save or restore a reference to a symtree node. */
2561 mio_symtree_ref (gfc_symtree
**stp
)
2566 if (iomode
== IO_OUTPUT
)
2567 mio_symbol_ref (&(*stp
)->n
.sym
);
2570 require_atom (ATOM_INTEGER
);
2571 p
= get_integer (atom_int
);
2573 /* An unused equivalence member; make a symbol and a symtree
2575 if (in_load_equiv
&& p
->u
.rsym
.symtree
== NULL
)
2577 /* Since this is not used, it must have a unique name. */
2578 p
->u
.rsym
.symtree
= gfc_get_unique_symtree (gfc_current_ns
);
2580 /* Make the symbol. */
2581 if (p
->u
.rsym
.sym
== NULL
)
2583 p
->u
.rsym
.sym
= gfc_new_symbol (p
->u
.rsym
.true_name
,
2585 p
->u
.rsym
.sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
2588 p
->u
.rsym
.symtree
->n
.sym
= p
->u
.rsym
.sym
;
2589 p
->u
.rsym
.symtree
->n
.sym
->refs
++;
2590 p
->u
.rsym
.referenced
= 1;
2592 /* If the symbol is PRIVATE and in COMMON, load_commons will
2593 generate a fixup symbol, which must be associated. */
2595 resolve_fixups (p
->fixup
, p
->u
.rsym
.sym
);
2599 if (p
->type
== P_UNKNOWN
)
2602 if (p
->u
.rsym
.state
== UNUSED
)
2603 p
->u
.rsym
.state
= NEEDED
;
2605 if (p
->u
.rsym
.symtree
!= NULL
)
2607 *stp
= p
->u
.rsym
.symtree
;
2611 f
= XCNEW (fixup_t
);
2613 f
->next
= p
->u
.rsym
.stfixup
;
2614 p
->u
.rsym
.stfixup
= f
;
2616 f
->pointer
= (void **) stp
;
2623 mio_iterator (gfc_iterator
**ip
)
2629 if (iomode
== IO_OUTPUT
)
2636 if (peek_atom () == ATOM_RPAREN
)
2642 *ip
= gfc_get_iterator ();
2647 mio_expr (&iter
->var
);
2648 mio_expr (&iter
->start
);
2649 mio_expr (&iter
->end
);
2650 mio_expr (&iter
->step
);
2658 mio_constructor (gfc_constructor_base
*cp
)
2664 if (iomode
== IO_OUTPUT
)
2666 for (c
= gfc_constructor_first (*cp
); c
; c
= gfc_constructor_next (c
))
2669 mio_expr (&c
->expr
);
2670 mio_iterator (&c
->iterator
);
2676 while (peek_atom () != ATOM_RPAREN
)
2678 c
= gfc_constructor_append_expr (cp
, NULL
, NULL
);
2681 mio_expr (&c
->expr
);
2682 mio_iterator (&c
->iterator
);
2691 static const mstring ref_types
[] = {
2692 minit ("ARRAY", REF_ARRAY
),
2693 minit ("COMPONENT", REF_COMPONENT
),
2694 minit ("SUBSTRING", REF_SUBSTRING
),
2700 mio_ref (gfc_ref
**rp
)
2707 r
->type
= MIO_NAME (ref_type
) (r
->type
, ref_types
);
2712 mio_array_ref (&r
->u
.ar
);
2716 mio_symbol_ref (&r
->u
.c
.sym
);
2717 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2721 mio_expr (&r
->u
.ss
.start
);
2722 mio_expr (&r
->u
.ss
.end
);
2723 mio_charlen (&r
->u
.ss
.length
);
2732 mio_ref_list (gfc_ref
**rp
)
2734 gfc_ref
*ref
, *head
, *tail
;
2738 if (iomode
== IO_OUTPUT
)
2740 for (ref
= *rp
; ref
; ref
= ref
->next
)
2747 while (peek_atom () != ATOM_RPAREN
)
2750 head
= tail
= gfc_get_ref ();
2753 tail
->next
= gfc_get_ref ();
2767 /* Read and write an integer value. */
2770 mio_gmp_integer (mpz_t
*integer
)
2774 if (iomode
== IO_INPUT
)
2776 if (parse_atom () != ATOM_STRING
)
2777 bad_module ("Expected integer string");
2779 mpz_init (*integer
);
2780 if (mpz_set_str (*integer
, atom_string
, 10))
2781 bad_module ("Error converting integer");
2783 gfc_free (atom_string
);
2787 p
= mpz_get_str (NULL
, 10, *integer
);
2788 write_atom (ATOM_STRING
, p
);
2795 mio_gmp_real (mpfr_t
*real
)
2800 if (iomode
== IO_INPUT
)
2802 if (parse_atom () != ATOM_STRING
)
2803 bad_module ("Expected real string");
2806 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2807 gfc_free (atom_string
);
2811 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2813 if (mpfr_nan_p (*real
) || mpfr_inf_p (*real
))
2815 write_atom (ATOM_STRING
, p
);
2820 atom_string
= XCNEWVEC (char, strlen (p
) + 20);
2822 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2824 /* Fix negative numbers. */
2825 if (atom_string
[2] == '-')
2827 atom_string
[0] = '-';
2828 atom_string
[1] = '0';
2829 atom_string
[2] = '.';
2832 write_atom (ATOM_STRING
, atom_string
);
2834 gfc_free (atom_string
);
2840 /* Save and restore the shape of an array constructor. */
2843 mio_shape (mpz_t
**pshape
, int rank
)
2849 /* A NULL shape is represented by (). */
2852 if (iomode
== IO_OUTPUT
)
2864 if (t
== ATOM_RPAREN
)
2871 shape
= gfc_get_shape (rank
);
2875 for (n
= 0; n
< rank
; n
++)
2876 mio_gmp_integer (&shape
[n
]);
2882 static const mstring expr_types
[] = {
2883 minit ("OP", EXPR_OP
),
2884 minit ("FUNCTION", EXPR_FUNCTION
),
2885 minit ("CONSTANT", EXPR_CONSTANT
),
2886 minit ("VARIABLE", EXPR_VARIABLE
),
2887 minit ("SUBSTRING", EXPR_SUBSTRING
),
2888 minit ("STRUCTURE", EXPR_STRUCTURE
),
2889 minit ("ARRAY", EXPR_ARRAY
),
2890 minit ("NULL", EXPR_NULL
),
2891 minit ("COMPCALL", EXPR_COMPCALL
),
2895 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2896 generic operators, not in expressions. INTRINSIC_USER is also
2897 replaced by the correct function name by the time we see it. */
2899 static const mstring intrinsics
[] =
2901 minit ("UPLUS", INTRINSIC_UPLUS
),
2902 minit ("UMINUS", INTRINSIC_UMINUS
),
2903 minit ("PLUS", INTRINSIC_PLUS
),
2904 minit ("MINUS", INTRINSIC_MINUS
),
2905 minit ("TIMES", INTRINSIC_TIMES
),
2906 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2907 minit ("POWER", INTRINSIC_POWER
),
2908 minit ("CONCAT", INTRINSIC_CONCAT
),
2909 minit ("AND", INTRINSIC_AND
),
2910 minit ("OR", INTRINSIC_OR
),
2911 minit ("EQV", INTRINSIC_EQV
),
2912 minit ("NEQV", INTRINSIC_NEQV
),
2913 minit ("EQ_SIGN", INTRINSIC_EQ
),
2914 minit ("EQ", INTRINSIC_EQ_OS
),
2915 minit ("NE_SIGN", INTRINSIC_NE
),
2916 minit ("NE", INTRINSIC_NE_OS
),
2917 minit ("GT_SIGN", INTRINSIC_GT
),
2918 minit ("GT", INTRINSIC_GT_OS
),
2919 minit ("GE_SIGN", INTRINSIC_GE
),
2920 minit ("GE", INTRINSIC_GE_OS
),
2921 minit ("LT_SIGN", INTRINSIC_LT
),
2922 minit ("LT", INTRINSIC_LT_OS
),
2923 minit ("LE_SIGN", INTRINSIC_LE
),
2924 minit ("LE", INTRINSIC_LE_OS
),
2925 minit ("NOT", INTRINSIC_NOT
),
2926 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2931 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2934 fix_mio_expr (gfc_expr
*e
)
2936 gfc_symtree
*ns_st
= NULL
;
2939 if (iomode
!= IO_OUTPUT
)
2944 /* If this is a symtree for a symbol that came from a contained module
2945 namespace, it has a unique name and we should look in the current
2946 namespace to see if the required, non-contained symbol is available
2947 yet. If so, the latter should be written. */
2948 if (e
->symtree
->n
.sym
&& check_unique_name (e
->symtree
->name
))
2949 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2950 e
->symtree
->n
.sym
->name
);
2952 /* On the other hand, if the existing symbol is the module name or the
2953 new symbol is a dummy argument, do not do the promotion. */
2954 if (ns_st
&& ns_st
->n
.sym
2955 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2956 && !e
->symtree
->n
.sym
->attr
.dummy
)
2959 else if (e
->expr_type
== EXPR_FUNCTION
&& e
->value
.function
.name
)
2963 /* In some circumstances, a function used in an initialization
2964 expression, in one use associated module, can fail to be
2965 coupled to its symtree when used in a specification
2966 expression in another module. */
2967 fname
= e
->value
.function
.esym
? e
->value
.function
.esym
->name
2968 : e
->value
.function
.isym
->name
;
2969 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2974 /* This is probably a reference to a private procedure from another
2975 module. To prevent a segfault, make a generic with no specific
2976 instances. If this module is used, without the required
2977 specific coming from somewhere, the appropriate error message
2979 gfc_get_symbol (fname
, gfc_current_ns
, &sym
);
2980 sym
->attr
.flavor
= FL_PROCEDURE
;
2981 sym
->attr
.generic
= 1;
2982 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2987 /* Read and write expressions. The form "()" is allowed to indicate a
2991 mio_expr (gfc_expr
**ep
)
2999 if (iomode
== IO_OUTPUT
)
3008 MIO_NAME (expr_t
) (e
->expr_type
, expr_types
);
3013 if (t
== ATOM_RPAREN
)
3020 bad_module ("Expected expression type");
3022 e
= *ep
= gfc_get_expr ();
3023 e
->where
= gfc_current_locus
;
3024 e
->expr_type
= (expr_t
) find_enum (expr_types
);
3027 mio_typespec (&e
->ts
);
3028 mio_integer (&e
->rank
);
3032 switch (e
->expr_type
)
3036 = MIO_NAME (gfc_intrinsic_op
) (e
->value
.op
.op
, intrinsics
);
3038 switch (e
->value
.op
.op
)
3040 case INTRINSIC_UPLUS
:
3041 case INTRINSIC_UMINUS
:
3043 case INTRINSIC_PARENTHESES
:
3044 mio_expr (&e
->value
.op
.op1
);
3047 case INTRINSIC_PLUS
:
3048 case INTRINSIC_MINUS
:
3049 case INTRINSIC_TIMES
:
3050 case INTRINSIC_DIVIDE
:
3051 case INTRINSIC_POWER
:
3052 case INTRINSIC_CONCAT
:
3056 case INTRINSIC_NEQV
:
3058 case INTRINSIC_EQ_OS
:
3060 case INTRINSIC_NE_OS
:
3062 case INTRINSIC_GT_OS
:
3064 case INTRINSIC_GE_OS
:
3066 case INTRINSIC_LT_OS
:
3068 case INTRINSIC_LE_OS
:
3069 mio_expr (&e
->value
.op
.op1
);
3070 mio_expr (&e
->value
.op
.op2
);
3074 bad_module ("Bad operator");
3080 mio_symtree_ref (&e
->symtree
);
3081 mio_actual_arglist (&e
->value
.function
.actual
);
3083 if (iomode
== IO_OUTPUT
)
3085 e
->value
.function
.name
3086 = mio_allocated_string (e
->value
.function
.name
);
3087 flag
= e
->value
.function
.esym
!= NULL
;
3088 mio_integer (&flag
);
3090 mio_symbol_ref (&e
->value
.function
.esym
);
3092 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
3096 require_atom (ATOM_STRING
);
3097 e
->value
.function
.name
= gfc_get_string (atom_string
);
3098 gfc_free (atom_string
);
3100 mio_integer (&flag
);
3102 mio_symbol_ref (&e
->value
.function
.esym
);
3105 require_atom (ATOM_STRING
);
3106 e
->value
.function
.isym
= gfc_find_function (atom_string
);
3107 gfc_free (atom_string
);
3114 mio_symtree_ref (&e
->symtree
);
3115 mio_ref_list (&e
->ref
);
3118 case EXPR_SUBSTRING
:
3119 e
->value
.character
.string
3120 = CONST_CAST (gfc_char_t
*,
3121 mio_allocated_wide_string (e
->value
.character
.string
,
3122 e
->value
.character
.length
));
3123 mio_ref_list (&e
->ref
);
3126 case EXPR_STRUCTURE
:
3128 mio_constructor (&e
->value
.constructor
);
3129 mio_shape (&e
->shape
, e
->rank
);
3136 mio_gmp_integer (&e
->value
.integer
);
3140 gfc_set_model_kind (e
->ts
.kind
);
3141 mio_gmp_real (&e
->value
.real
);
3145 gfc_set_model_kind (e
->ts
.kind
);
3146 mio_gmp_real (&mpc_realref (e
->value
.complex));
3147 mio_gmp_real (&mpc_imagref (e
->value
.complex));
3151 mio_integer (&e
->value
.logical
);
3155 mio_integer (&e
->value
.character
.length
);
3156 e
->value
.character
.string
3157 = CONST_CAST (gfc_char_t
*,
3158 mio_allocated_wide_string (e
->value
.character
.string
,
3159 e
->value
.character
.length
));
3163 bad_module ("Bad type in constant expression");
3181 /* Read and write namelists. */
3184 mio_namelist (gfc_symbol
*sym
)
3186 gfc_namelist
*n
, *m
;
3187 const char *check_name
;
3191 if (iomode
== IO_OUTPUT
)
3193 for (n
= sym
->namelist
; n
; n
= n
->next
)
3194 mio_symbol_ref (&n
->sym
);
3198 /* This departure from the standard is flagged as an error.
3199 It does, in fact, work correctly. TODO: Allow it
3201 if (sym
->attr
.flavor
== FL_NAMELIST
)
3203 check_name
= find_use_name (sym
->name
, false);
3204 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
3205 gfc_error ("Namelist %s cannot be renamed by USE "
3206 "association to %s", sym
->name
, check_name
);
3210 while (peek_atom () != ATOM_RPAREN
)
3212 n
= gfc_get_namelist ();
3213 mio_symbol_ref (&n
->sym
);
3215 if (sym
->namelist
== NULL
)
3222 sym
->namelist_tail
= m
;
3229 /* Save/restore lists of gfc_interface structures. When loading an
3230 interface, we are really appending to the existing list of
3231 interfaces. Checking for duplicate and ambiguous interfaces has to
3232 be done later when all symbols have been loaded. */
3235 mio_interface_rest (gfc_interface
**ip
)
3237 gfc_interface
*tail
, *p
;
3238 pointer_info
*pi
= NULL
;
3240 if (iomode
== IO_OUTPUT
)
3243 for (p
= *ip
; p
; p
= p
->next
)
3244 mio_symbol_ref (&p
->sym
);
3259 if (peek_atom () == ATOM_RPAREN
)
3262 p
= gfc_get_interface ();
3263 p
->where
= gfc_current_locus
;
3264 pi
= mio_symbol_ref (&p
->sym
);
3280 /* Save/restore a nameless operator interface. */
3283 mio_interface (gfc_interface
**ip
)
3286 mio_interface_rest (ip
);
3290 /* Save/restore a named operator interface. */
3293 mio_symbol_interface (const char **name
, const char **module
,
3297 mio_pool_string (name
);
3298 mio_pool_string (module
);
3299 mio_interface_rest (ip
);
3304 mio_namespace_ref (gfc_namespace
**nsp
)
3309 p
= mio_pointer_ref (nsp
);
3311 if (p
->type
== P_UNKNOWN
)
3312 p
->type
= P_NAMESPACE
;
3314 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
3316 ns
= (gfc_namespace
*) p
->u
.pointer
;
3319 ns
= gfc_get_namespace (NULL
, 0);
3320 associate_integer_pointer (p
, ns
);
3328 /* Save/restore the f2k_derived namespace of a derived-type symbol. */
3330 static gfc_namespace
* current_f2k_derived
;
3333 mio_typebound_proc (gfc_typebound_proc
** proc
)
3336 int overriding_flag
;
3338 if (iomode
== IO_INPUT
)
3340 *proc
= gfc_get_typebound_proc (NULL
);
3341 (*proc
)->where
= gfc_current_locus
;
3347 (*proc
)->access
= MIO_NAME (gfc_access
) ((*proc
)->access
, access_types
);
3349 /* IO the NON_OVERRIDABLE/DEFERRED combination. */
3350 gcc_assert (!((*proc
)->deferred
&& (*proc
)->non_overridable
));
3351 overriding_flag
= ((*proc
)->deferred
<< 1) | (*proc
)->non_overridable
;
3352 overriding_flag
= mio_name (overriding_flag
, binding_overriding
);
3353 (*proc
)->deferred
= ((overriding_flag
& 2) != 0);
3354 (*proc
)->non_overridable
= ((overriding_flag
& 1) != 0);
3355 gcc_assert (!((*proc
)->deferred
&& (*proc
)->non_overridable
));
3357 (*proc
)->nopass
= mio_name ((*proc
)->nopass
, binding_passing
);
3358 (*proc
)->is_generic
= mio_name ((*proc
)->is_generic
, binding_generic
);
3359 (*proc
)->ppc
= mio_name((*proc
)->ppc
, binding_ppc
);
3361 mio_pool_string (&((*proc
)->pass_arg
));
3363 flag
= (int) (*proc
)->pass_arg_num
;
3364 mio_integer (&flag
);
3365 (*proc
)->pass_arg_num
= (unsigned) flag
;
3367 if ((*proc
)->is_generic
)
3373 if (iomode
== IO_OUTPUT
)
3374 for (g
= (*proc
)->u
.generic
; g
; g
= g
->next
)
3375 mio_allocated_string (g
->specific_st
->name
);
3378 (*proc
)->u
.generic
= NULL
;
3379 while (peek_atom () != ATOM_RPAREN
)
3381 gfc_symtree
** sym_root
;
3383 g
= gfc_get_tbp_generic ();
3386 require_atom (ATOM_STRING
);
3387 sym_root
= ¤t_f2k_derived
->tb_sym_root
;
3388 g
->specific_st
= gfc_get_tbp_symtree (sym_root
, atom_string
);
3389 gfc_free (atom_string
);
3391 g
->next
= (*proc
)->u
.generic
;
3392 (*proc
)->u
.generic
= g
;
3398 else if (!(*proc
)->ppc
)
3399 mio_symtree_ref (&(*proc
)->u
.specific
);
3404 /* Walker-callback function for this purpose. */
3406 mio_typebound_symtree (gfc_symtree
* st
)
3408 if (iomode
== IO_OUTPUT
&& !st
->n
.tb
)
3411 if (iomode
== IO_OUTPUT
)
3414 mio_allocated_string (st
->name
);
3416 /* For IO_INPUT, the above is done in mio_f2k_derived. */
3418 mio_typebound_proc (&st
->n
.tb
);
3422 /* IO a full symtree (in all depth). */
3424 mio_full_typebound_tree (gfc_symtree
** root
)
3428 if (iomode
== IO_OUTPUT
)
3429 gfc_traverse_symtree (*root
, &mio_typebound_symtree
);
3432 while (peek_atom () == ATOM_LPAREN
)
3438 require_atom (ATOM_STRING
);
3439 st
= gfc_get_tbp_symtree (root
, atom_string
);
3440 gfc_free (atom_string
);
3442 mio_typebound_symtree (st
);
3450 mio_finalizer (gfc_finalizer
**f
)
3452 if (iomode
== IO_OUTPUT
)
3455 gcc_assert ((*f
)->proc_tree
); /* Should already be resolved. */
3456 mio_symtree_ref (&(*f
)->proc_tree
);
3460 *f
= gfc_get_finalizer ();
3461 (*f
)->where
= gfc_current_locus
; /* Value should not matter. */
3464 mio_symtree_ref (&(*f
)->proc_tree
);
3465 (*f
)->proc_sym
= NULL
;
3470 mio_f2k_derived (gfc_namespace
*f2k
)
3472 current_f2k_derived
= f2k
;
3474 /* Handle the list of finalizer procedures. */
3476 if (iomode
== IO_OUTPUT
)
3479 for (f
= f2k
->finalizers
; f
; f
= f
->next
)
3484 f2k
->finalizers
= NULL
;
3485 while (peek_atom () != ATOM_RPAREN
)
3487 gfc_finalizer
*cur
= NULL
;
3488 mio_finalizer (&cur
);
3489 cur
->next
= f2k
->finalizers
;
3490 f2k
->finalizers
= cur
;
3495 /* Handle type-bound procedures. */
3496 mio_full_typebound_tree (&f2k
->tb_sym_root
);
3498 /* Type-bound user operators. */
3499 mio_full_typebound_tree (&f2k
->tb_uop_root
);
3501 /* Type-bound intrinsic operators. */
3503 if (iomode
== IO_OUTPUT
)
3506 for (op
= GFC_INTRINSIC_BEGIN
; op
!= GFC_INTRINSIC_END
; ++op
)
3508 gfc_intrinsic_op realop
;
3510 if (op
== INTRINSIC_USER
|| !f2k
->tb_op
[op
])
3514 realop
= (gfc_intrinsic_op
) op
;
3515 mio_intrinsic_op (&realop
);
3516 mio_typebound_proc (&f2k
->tb_op
[op
]);
3521 while (peek_atom () != ATOM_RPAREN
)
3523 gfc_intrinsic_op op
= GFC_INTRINSIC_BEGIN
; /* Silence GCC. */
3526 mio_intrinsic_op (&op
);
3527 mio_typebound_proc (&f2k
->tb_op
[op
]);
3534 mio_full_f2k_derived (gfc_symbol
*sym
)
3538 if (iomode
== IO_OUTPUT
)
3540 if (sym
->f2k_derived
)
3541 mio_f2k_derived (sym
->f2k_derived
);
3545 if (peek_atom () != ATOM_RPAREN
)
3547 sym
->f2k_derived
= gfc_get_namespace (NULL
, 0);
3548 mio_f2k_derived (sym
->f2k_derived
);
3551 gcc_assert (!sym
->f2k_derived
);
3558 /* Unlike most other routines, the address of the symbol node is already
3559 fixed on input and the name/module has already been filled in. */
3562 mio_symbol (gfc_symbol
*sym
)
3564 int intmod
= INTMOD_NONE
;
3568 mio_symbol_attribute (&sym
->attr
);
3569 mio_typespec (&sym
->ts
);
3571 if (iomode
== IO_OUTPUT
)
3572 mio_namespace_ref (&sym
->formal_ns
);
3575 mio_namespace_ref (&sym
->formal_ns
);
3578 sym
->formal_ns
->proc_name
= sym
;
3583 /* Save/restore common block links. */
3584 mio_symbol_ref (&sym
->common_next
);
3586 mio_formal_arglist (&sym
->formal
);
3588 if (sym
->attr
.flavor
== FL_PARAMETER
)
3589 mio_expr (&sym
->value
);
3591 mio_array_spec (&sym
->as
);
3593 mio_symbol_ref (&sym
->result
);
3595 if (sym
->attr
.cray_pointee
)
3596 mio_symbol_ref (&sym
->cp_pointer
);
3598 /* Note that components are always saved, even if they are supposed
3599 to be private. Component access is checked during searching. */
3601 mio_component_list (&sym
->components
, sym
->attr
.vtype
);
3603 if (sym
->components
!= NULL
)
3604 sym
->component_access
3605 = MIO_NAME (gfc_access
) (sym
->component_access
, access_types
);
3607 /* Load/save the f2k_derived namespace of a derived-type symbol. */
3608 mio_full_f2k_derived (sym
);
3612 /* Add the fields that say whether this is from an intrinsic module,
3613 and if so, what symbol it is within the module. */
3614 /* mio_integer (&(sym->from_intmod)); */
3615 if (iomode
== IO_OUTPUT
)
3617 intmod
= sym
->from_intmod
;
3618 mio_integer (&intmod
);
3622 mio_integer (&intmod
);
3623 sym
->from_intmod
= (intmod_id
) intmod
;
3626 mio_integer (&(sym
->intmod_sym_id
));
3628 if (sym
->attr
.flavor
== FL_DERIVED
)
3629 mio_integer (&(sym
->hash_value
));
3635 /************************* Top level subroutines *************************/
3637 /* Given a root symtree node and a symbol, try to find a symtree that
3638 references the symbol that is not a unique name. */
3640 static gfc_symtree
*
3641 find_symtree_for_symbol (gfc_symtree
*st
, gfc_symbol
*sym
)
3643 gfc_symtree
*s
= NULL
;
3648 s
= find_symtree_for_symbol (st
->right
, sym
);
3651 s
= find_symtree_for_symbol (st
->left
, sym
);
3655 if (st
->n
.sym
== sym
&& !check_unique_name (st
->name
))
3662 /* A recursive function to look for a specific symbol by name and by
3663 module. Whilst several symtrees might point to one symbol, its
3664 is sufficient for the purposes here than one exist. Note that
3665 generic interfaces are distinguished as are symbols that have been
3666 renamed in another module. */
3667 static gfc_symtree
*
3668 find_symbol (gfc_symtree
*st
, const char *name
,
3669 const char *module
, int generic
)
3672 gfc_symtree
*retval
, *s
;
3674 if (st
== NULL
|| st
->n
.sym
== NULL
)
3677 c
= strcmp (name
, st
->n
.sym
->name
);
3678 if (c
== 0 && st
->n
.sym
->module
3679 && strcmp (module
, st
->n
.sym
->module
) == 0
3680 && !check_unique_name (st
->name
))
3682 s
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3684 /* Detect symbols that are renamed by use association in another
3685 module by the absence of a symtree and null attr.use_rename,
3686 since the latter is not transmitted in the module file. */
3687 if (((!generic
&& !st
->n
.sym
->attr
.generic
)
3688 || (generic
&& st
->n
.sym
->attr
.generic
))
3689 && !(s
== NULL
&& !st
->n
.sym
->attr
.use_rename
))
3693 retval
= find_symbol (st
->left
, name
, module
, generic
);
3696 retval
= find_symbol (st
->right
, name
, module
, generic
);
3702 /* Skip a list between balanced left and right parens. */
3712 switch (parse_atom ())
3723 gfc_free (atom_string
);
3735 /* Load operator interfaces from the module. Interfaces are unusual
3736 in that they attach themselves to existing symbols. */
3739 load_operator_interfaces (void)
3742 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3744 pointer_info
*pi
= NULL
;
3749 while (peek_atom () != ATOM_RPAREN
)
3753 mio_internal_string (name
);
3754 mio_internal_string (module
);
3756 n
= number_use_names (name
, true);
3759 for (i
= 1; i
<= n
; i
++)
3761 /* Decide if we need to load this one or not. */
3762 p
= find_use_name_n (name
, &i
, true);
3766 while (parse_atom () != ATOM_RPAREN
);
3772 uop
= gfc_get_uop (p
);
3773 pi
= mio_interface_rest (&uop
->op
);
3777 if (gfc_find_uop (p
, NULL
))
3779 uop
= gfc_get_uop (p
);
3780 uop
->op
= gfc_get_interface ();
3781 uop
->op
->where
= gfc_current_locus
;
3782 add_fixup (pi
->integer
, &uop
->op
->sym
);
3791 /* Load interfaces from the module. Interfaces are unusual in that
3792 they attach themselves to existing symbols. */
3795 load_generic_interfaces (void)
3798 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3800 gfc_interface
*generic
= NULL
, *gen
= NULL
;
3802 bool ambiguous_set
= false;
3806 while (peek_atom () != ATOM_RPAREN
)
3810 mio_internal_string (name
);
3811 mio_internal_string (module
);
3813 n
= number_use_names (name
, false);
3814 renamed
= n
? 1 : 0;
3817 for (i
= 1; i
<= n
; i
++)
3820 /* Decide if we need to load this one or not. */
3821 p
= find_use_name_n (name
, &i
, false);
3823 st
= find_symbol (gfc_current_ns
->sym_root
,
3824 name
, module_name
, 1);
3826 if (!p
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
3828 /* Skip the specific names for these cases. */
3829 while (i
== 1 && parse_atom () != ATOM_RPAREN
);
3834 /* If the symbol exists already and is being USEd without being
3835 in an ONLY clause, do not load a new symtree(11.3.2). */
3836 if (!only_flag
&& st
)
3841 /* Make the symbol inaccessible if it has been added by a USE
3842 statement without an ONLY(11.3.2). */
3844 && !st
->n
.sym
->attr
.use_only
3845 && !st
->n
.sym
->attr
.use_rename
3846 && strcmp (st
->n
.sym
->module
, module_name
) == 0)
3849 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3850 st
= gfc_get_unique_symtree (gfc_current_ns
);
3857 if (strcmp (st
->name
, p
) != 0)
3859 st
= gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3865 /* Since we haven't found a valid generic interface, we had
3869 gfc_get_symbol (p
, NULL
, &sym
);
3870 sym
->name
= gfc_get_string (name
);
3871 sym
->module
= gfc_get_string (module_name
);
3872 sym
->attr
.flavor
= FL_PROCEDURE
;
3873 sym
->attr
.generic
= 1;
3874 sym
->attr
.use_assoc
= 1;
3879 /* Unless sym is a generic interface, this reference
3882 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3886 if (st
&& !sym
->attr
.generic
3889 && strcmp(module
, sym
->module
))
3891 ambiguous_set
= true;
3896 sym
->attr
.use_only
= only_flag
;
3897 sym
->attr
.use_rename
= renamed
;
3901 mio_interface_rest (&sym
->generic
);
3902 generic
= sym
->generic
;
3904 else if (!sym
->generic
)
3906 sym
->generic
= generic
;
3907 sym
->attr
.generic_copy
= 1;
3910 /* If a procedure that is not generic has generic interfaces
3911 that include itself, it is generic! We need to take care
3912 to retain symbols ambiguous that were already so. */
3913 if (sym
->attr
.use_assoc
3914 && !sym
->attr
.generic
3915 && sym
->attr
.flavor
== FL_PROCEDURE
)
3917 for (gen
= generic
; gen
; gen
= gen
->next
)
3919 if (gen
->sym
== sym
)
3921 sym
->attr
.generic
= 1;
3936 /* Load common blocks. */
3941 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3946 while (peek_atom () != ATOM_RPAREN
)
3950 mio_internal_string (name
);
3952 p
= gfc_get_common (name
, 1);
3954 mio_symbol_ref (&p
->head
);
3955 mio_integer (&flags
);
3959 p
->threadprivate
= 1;
3962 /* Get whether this was a bind(c) common or not. */
3963 mio_integer (&p
->is_bind_c
);
3964 /* Get the binding label. */
3965 mio_internal_string (p
->binding_label
);
3974 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3975 so that unused variables are not loaded and so that the expression can
3981 gfc_equiv
*head
, *tail
, *end
, *eq
;
3985 in_load_equiv
= true;
3987 end
= gfc_current_ns
->equiv
;
3988 while (end
!= NULL
&& end
->next
!= NULL
)
3991 while (peek_atom () != ATOM_RPAREN
) {
3995 while(peek_atom () != ATOM_RPAREN
)
3998 head
= tail
= gfc_get_equiv ();
4001 tail
->eq
= gfc_get_equiv ();
4005 mio_pool_string (&tail
->module
);
4006 mio_expr (&tail
->expr
);
4009 /* Unused equivalence members have a unique name. In addition, it
4010 must be checked that the symbols are from the same module. */
4012 for (eq
= head
; eq
; eq
= eq
->eq
)
4014 if (eq
->expr
->symtree
->n
.sym
->module
4015 && head
->expr
->symtree
->n
.sym
->module
4016 && strcmp (head
->expr
->symtree
->n
.sym
->module
,
4017 eq
->expr
->symtree
->n
.sym
->module
) == 0
4018 && !check_unique_name (eq
->expr
->symtree
->name
))
4027 for (eq
= head
; eq
; eq
= head
)
4030 gfc_free_expr (eq
->expr
);
4036 gfc_current_ns
->equiv
= head
;
4047 in_load_equiv
= false;
4051 /* This function loads the sym_root of f2k_derived with the extensions to
4052 the derived type. */
4054 load_derived_extensions (void)
4057 gfc_symbol
*derived
;
4061 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
4062 char module
[GFC_MAX_SYMBOL_LEN
+ 1];
4066 while (peek_atom () != ATOM_RPAREN
)
4069 mio_integer (&symbol
);
4070 info
= get_integer (symbol
);
4071 derived
= info
->u
.rsym
.sym
;
4073 /* This one is not being loaded. */
4074 if (!info
|| !derived
)
4076 while (peek_atom () != ATOM_RPAREN
)
4081 gcc_assert (derived
->attr
.flavor
== FL_DERIVED
);
4082 if (derived
->f2k_derived
== NULL
)
4083 derived
->f2k_derived
= gfc_get_namespace (NULL
, 0);
4085 while (peek_atom () != ATOM_RPAREN
)
4088 mio_internal_string (name
);
4089 mio_internal_string (module
);
4091 /* Only use one use name to find the symbol. */
4093 p
= find_use_name_n (name
, &j
, false);
4096 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
4098 st
= gfc_find_symtree (derived
->f2k_derived
->sym_root
, name
);
4101 /* Only use the real name in f2k_derived to ensure a single
4103 st
= gfc_new_symtree (&derived
->f2k_derived
->sym_root
, name
);
4116 /* Recursive function to traverse the pointer_info tree and load a
4117 needed symbol. We return nonzero if we load a symbol and stop the
4118 traversal, because the act of loading can alter the tree. */
4121 load_needed (pointer_info
*p
)
4132 rv
|= load_needed (p
->left
);
4133 rv
|= load_needed (p
->right
);
4135 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
4138 p
->u
.rsym
.state
= USED
;
4140 set_module_locus (&p
->u
.rsym
.where
);
4142 sym
= p
->u
.rsym
.sym
;
4145 q
= get_integer (p
->u
.rsym
.ns
);
4147 ns
= (gfc_namespace
*) q
->u
.pointer
;
4150 /* Create an interface namespace if necessary. These are
4151 the namespaces that hold the formal parameters of module
4154 ns
= gfc_get_namespace (NULL
, 0);
4155 associate_integer_pointer (q
, ns
);
4158 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
4159 doesn't go pear-shaped if the symbol is used. */
4161 gfc_find_symbol (p
->u
.rsym
.module
, gfc_current_ns
,
4164 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
4165 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
4166 strcpy (sym
->binding_label
, p
->u
.rsym
.binding_label
);
4168 associate_integer_pointer (p
, sym
);
4172 sym
->attr
.use_assoc
= 1;
4174 sym
->attr
.use_only
= 1;
4175 if (p
->u
.rsym
.renamed
)
4176 sym
->attr
.use_rename
= 1;
4182 /* Recursive function for cleaning up things after a module has been read. */
4185 read_cleanup (pointer_info
*p
)
4193 read_cleanup (p
->left
);
4194 read_cleanup (p
->right
);
4196 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
4198 /* Add hidden symbols to the symtree. */
4199 q
= get_integer (p
->u
.rsym
.ns
);
4200 st
= gfc_get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
4202 st
->n
.sym
= p
->u
.rsym
.sym
;
4205 /* Fixup any symtree references. */
4206 p
->u
.rsym
.symtree
= st
;
4207 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
4208 p
->u
.rsym
.stfixup
= NULL
;
4211 /* Free unused symbols. */
4212 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
4213 gfc_free_symbol (p
->u
.rsym
.sym
);
4217 /* It is not quite enough to check for ambiguity in the symbols by
4218 the loaded symbol and the new symbol not being identical. */
4220 check_for_ambiguous (gfc_symbol
*st_sym
, pointer_info
*info
)
4224 symbol_attribute attr
;
4226 rsym
= info
->u
.rsym
.sym
;
4230 if (st_sym
->attr
.vtab
|| st_sym
->attr
.vtype
)
4233 /* If the existing symbol is generic from a different module and
4234 the new symbol is generic there can be no ambiguity. */
4235 if (st_sym
->attr
.generic
4237 && strcmp (st_sym
->module
, module_name
))
4239 /* The new symbol's attributes have not yet been read. Since
4240 we need attr.generic, read it directly. */
4241 get_module_locus (&locus
);
4242 set_module_locus (&info
->u
.rsym
.where
);
4245 mio_symbol_attribute (&attr
);
4246 set_module_locus (&locus
);
4255 /* Read a module file. */
4260 module_locus operator_interfaces
, user_operators
, extensions
;
4262 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
4264 int ambiguous
, j
, nuse
, symbol
;
4265 pointer_info
*info
, *q
;
4270 get_module_locus (&operator_interfaces
); /* Skip these for now. */
4273 get_module_locus (&user_operators
);
4277 /* Skip commons, equivalences and derived type extensions for now. */
4281 get_module_locus (&extensions
);
4286 /* Create the fixup nodes for all the symbols. */
4288 while (peek_atom () != ATOM_RPAREN
)
4290 require_atom (ATOM_INTEGER
);
4291 info
= get_integer (atom_int
);
4293 info
->type
= P_SYMBOL
;
4294 info
->u
.rsym
.state
= UNUSED
;
4296 mio_internal_string (info
->u
.rsym
.true_name
);
4297 mio_internal_string (info
->u
.rsym
.module
);
4298 mio_internal_string (info
->u
.rsym
.binding_label
);
4301 require_atom (ATOM_INTEGER
);
4302 info
->u
.rsym
.ns
= atom_int
;
4304 get_module_locus (&info
->u
.rsym
.where
);
4307 /* See if the symbol has already been loaded by a previous module.
4308 If so, we reference the existing symbol and prevent it from
4309 being loaded again. This should not happen if the symbol being
4310 read is an index for an assumed shape dummy array (ns != 1). */
4312 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
4315 || (sym
->attr
.flavor
== FL_VARIABLE
&& info
->u
.rsym
.ns
!=1))
4318 info
->u
.rsym
.state
= USED
;
4319 info
->u
.rsym
.sym
= sym
;
4321 /* Some symbols do not have a namespace (eg. formal arguments),
4322 so the automatic "unique symtree" mechanism must be suppressed
4323 by marking them as referenced. */
4324 q
= get_integer (info
->u
.rsym
.ns
);
4325 if (q
->u
.pointer
== NULL
)
4327 info
->u
.rsym
.referenced
= 1;
4331 /* If possible recycle the symtree that references the symbol.
4332 If a symtree is not found and the module does not import one,
4333 a unique-name symtree is found by read_cleanup. */
4334 st
= find_symtree_for_symbol (gfc_current_ns
->sym_root
, sym
);
4337 info
->u
.rsym
.symtree
= st
;
4338 info
->u
.rsym
.referenced
= 1;
4344 /* Parse the symtree lists. This lets us mark which symbols need to
4345 be loaded. Renaming is also done at this point by replacing the
4350 while (peek_atom () != ATOM_RPAREN
)
4352 mio_internal_string (name
);
4353 mio_integer (&ambiguous
);
4354 mio_integer (&symbol
);
4356 info
= get_integer (symbol
);
4358 /* See how many use names there are. If none, go through the start
4359 of the loop at least once. */
4360 nuse
= number_use_names (name
, false);
4361 info
->u
.rsym
.renamed
= nuse
? 1 : 0;
4366 for (j
= 1; j
<= nuse
; j
++)
4368 /* Get the jth local name for this symbol. */
4369 p
= find_use_name_n (name
, &j
, false);
4371 if (p
== NULL
&& strcmp (name
, module_name
) == 0)
4374 /* Exception: Always import vtabs & vtypes. */
4375 if (p
== NULL
&& (strncmp (name
, "__vtab_", 5) == 0
4376 || strncmp (name
, "__vtype_", 6) == 0))
4379 /* Skip symtree nodes not in an ONLY clause, unless there
4380 is an existing symtree loaded from another USE statement. */
4383 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4385 info
->u
.rsym
.symtree
= st
;
4389 /* If a symbol of the same name and module exists already,
4390 this symbol, which is not in an ONLY clause, must not be
4391 added to the namespace(11.3.2). Note that find_symbol
4392 only returns the first occurrence that it finds. */
4393 if (!only_flag
&& !info
->u
.rsym
.renamed
4394 && strcmp (name
, module_name
) != 0
4395 && find_symbol (gfc_current_ns
->sym_root
, name
,
4399 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
4403 /* Check for ambiguous symbols. */
4404 if (check_for_ambiguous (st
->n
.sym
, info
))
4406 info
->u
.rsym
.symtree
= st
;
4410 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4412 /* Delete the symtree if the symbol has been added by a USE
4413 statement without an ONLY(11.3.2). Remember that the rsym
4414 will be the same as the symbol found in the symtree, for
4416 if (st
&& (only_flag
|| info
->u
.rsym
.renamed
)
4417 && !st
->n
.sym
->attr
.use_only
4418 && !st
->n
.sym
->attr
.use_rename
4419 && info
->u
.rsym
.sym
== st
->n
.sym
)
4420 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
4422 /* Create a symtree node in the current namespace for this
4424 st
= check_unique_name (p
)
4425 ? gfc_get_unique_symtree (gfc_current_ns
)
4426 : gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
4427 st
->ambiguous
= ambiguous
;
4429 sym
= info
->u
.rsym
.sym
;
4431 /* Create a symbol node if it doesn't already exist. */
4434 info
->u
.rsym
.sym
= gfc_new_symbol (info
->u
.rsym
.true_name
,
4436 sym
= info
->u
.rsym
.sym
;
4437 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
4439 /* TODO: hmm, can we test this? Do we know it will be
4440 initialized to zeros? */
4441 if (info
->u
.rsym
.binding_label
[0] != '\0')
4442 strcpy (sym
->binding_label
, info
->u
.rsym
.binding_label
);
4448 if (strcmp (name
, p
) != 0)
4449 sym
->attr
.use_rename
= 1;
4451 /* We need to set the only_flag here so that symbols from the
4452 same USE...ONLY but earlier are not deleted from the tree in
4453 the gfc_delete_symtree above. */
4454 sym
->attr
.use_only
= only_flag
;
4456 /* Store the symtree pointing to this symbol. */
4457 info
->u
.rsym
.symtree
= st
;
4459 if (info
->u
.rsym
.state
== UNUSED
)
4460 info
->u
.rsym
.state
= NEEDED
;
4461 info
->u
.rsym
.referenced
= 1;
4468 /* Load intrinsic operator interfaces. */
4469 set_module_locus (&operator_interfaces
);
4472 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4474 if (i
== INTRINSIC_USER
)
4479 u
= find_use_operator ((gfc_intrinsic_op
) i
);
4490 mio_interface (&gfc_current_ns
->op
[i
]);
4495 /* Load generic and user operator interfaces. These must follow the
4496 loading of symtree because otherwise symbols can be marked as
4499 set_module_locus (&user_operators
);
4501 load_operator_interfaces ();
4502 load_generic_interfaces ();
4507 /* At this point, we read those symbols that are needed but haven't
4508 been loaded yet. If one symbol requires another, the other gets
4509 marked as NEEDED if its previous state was UNUSED. */
4511 while (load_needed (pi_root
));
4513 /* Make sure all elements of the rename-list were found in the module. */
4515 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4520 if (u
->op
== INTRINSIC_NONE
)
4522 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
4523 u
->use_name
, &u
->where
, module_name
);
4527 if (u
->op
== INTRINSIC_USER
)
4529 gfc_error ("User operator '%s' referenced at %L not found "
4530 "in module '%s'", u
->use_name
, &u
->where
, module_name
);
4534 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
4535 "in module '%s'", gfc_op2string (u
->op
), &u
->where
,
4539 /* Now we should be in a position to fill f2k_derived with derived type
4540 extensions, since everything has been loaded. */
4541 set_module_locus (&extensions
);
4542 load_derived_extensions ();
4544 /* Clean up symbol nodes that were never loaded, create references
4545 to hidden symbols. */
4547 read_cleanup (pi_root
);
4551 /* Given an access type that is specific to an entity and the default
4552 access, return nonzero if the entity is publicly accessible. If the
4553 element is declared as PUBLIC, then it is public; if declared
4554 PRIVATE, then private, and otherwise it is public unless the default
4555 access in this context has been declared PRIVATE. */
4558 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
4560 if (specific_access
== ACCESS_PUBLIC
)
4562 if (specific_access
== ACCESS_PRIVATE
)
4565 if (gfc_option
.flag_module_private
)
4566 return default_access
== ACCESS_PUBLIC
;
4568 return default_access
!= ACCESS_PRIVATE
;
4572 /* A structure to remember which commons we've already written. */
4574 struct written_common
4576 BBT_HEADER(written_common
);
4577 const char *name
, *label
;
4580 static struct written_common
*written_commons
= NULL
;
4582 /* Comparison function used for balancing the binary tree. */
4585 compare_written_commons (void *a1
, void *b1
)
4587 const char *aname
= ((struct written_common
*) a1
)->name
;
4588 const char *alabel
= ((struct written_common
*) a1
)->label
;
4589 const char *bname
= ((struct written_common
*) b1
)->name
;
4590 const char *blabel
= ((struct written_common
*) b1
)->label
;
4591 int c
= strcmp (aname
, bname
);
4593 return (c
!= 0 ? c
: strcmp (alabel
, blabel
));
4596 /* Free a list of written commons. */
4599 free_written_common (struct written_common
*w
)
4605 free_written_common (w
->left
);
4607 free_written_common (w
->right
);
4612 /* Write a common block to the module -- recursive helper function. */
4615 write_common_0 (gfc_symtree
*st
, bool this_module
)
4621 struct written_common
*w
;
4622 bool write_me
= true;
4627 write_common_0 (st
->left
, this_module
);
4629 /* We will write out the binding label, or the name if no label given. */
4630 name
= st
->n
.common
->name
;
4632 label
= p
->is_bind_c
? p
->binding_label
: p
->name
;
4634 /* Check if we've already output this common. */
4635 w
= written_commons
;
4638 int c
= strcmp (name
, w
->name
);
4639 c
= (c
!= 0 ? c
: strcmp (label
, w
->label
));
4643 w
= (c
< 0) ? w
->left
: w
->right
;
4646 if (this_module
&& p
->use_assoc
)
4651 /* Write the common to the module. */
4653 mio_pool_string (&name
);
4655 mio_symbol_ref (&p
->head
);
4656 flags
= p
->saved
? 1 : 0;
4657 if (p
->threadprivate
)
4659 mio_integer (&flags
);
4661 /* Write out whether the common block is bind(c) or not. */
4662 mio_integer (&(p
->is_bind_c
));
4664 mio_pool_string (&label
);
4667 /* Record that we have written this common. */
4668 w
= XCNEW (struct written_common
);
4671 gfc_insert_bbt (&written_commons
, w
, compare_written_commons
);
4674 write_common_0 (st
->right
, this_module
);
4678 /* Write a common, by initializing the list of written commons, calling
4679 the recursive function write_common_0() and cleaning up afterwards. */
4682 write_common (gfc_symtree
*st
)
4684 written_commons
= NULL
;
4685 write_common_0 (st
, true);
4686 write_common_0 (st
, false);
4687 free_written_common (written_commons
);
4688 written_commons
= NULL
;
4692 /* Write the blank common block to the module. */
4695 write_blank_common (void)
4697 const char * name
= BLANK_COMMON_NAME
;
4699 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4700 this, but it hasn't been checked. Just making it so for now. */
4703 if (gfc_current_ns
->blank_common
.head
== NULL
)
4708 mio_pool_string (&name
);
4710 mio_symbol_ref (&gfc_current_ns
->blank_common
.head
);
4711 saved
= gfc_current_ns
->blank_common
.saved
;
4712 mio_integer (&saved
);
4714 /* Write out whether the common block is bind(c) or not. */
4715 mio_integer (&is_bind_c
);
4717 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4718 it doesn't matter because the label isn't used. */
4719 mio_pool_string (&name
);
4725 /* Write equivalences to the module. */
4734 for (eq
= gfc_current_ns
->equiv
; eq
; eq
= eq
->next
)
4738 for (e
= eq
; e
; e
= e
->eq
)
4740 if (e
->module
== NULL
)
4741 e
->module
= gfc_get_string ("%s.eq.%d", module_name
, num
);
4742 mio_allocated_string (e
->module
);
4743 mio_expr (&e
->expr
);
4752 /* Write derived type extensions to the module. */
4755 write_dt_extensions (gfc_symtree
*st
)
4757 if (!gfc_check_access (st
->n
.sym
->attr
.access
,
4758 st
->n
.sym
->ns
->default_access
))
4762 mio_pool_string (&st
->n
.sym
->name
);
4763 if (st
->n
.sym
->module
!= NULL
)
4764 mio_pool_string (&st
->n
.sym
->module
);
4766 mio_internal_string (module_name
);
4771 write_derived_extensions (gfc_symtree
*st
)
4773 if (!((st
->n
.sym
->attr
.flavor
== FL_DERIVED
)
4774 && (st
->n
.sym
->f2k_derived
!= NULL
)
4775 && (st
->n
.sym
->f2k_derived
->sym_root
!= NULL
)))
4779 mio_symbol_ref (&(st
->n
.sym
));
4780 gfc_traverse_symtree (st
->n
.sym
->f2k_derived
->sym_root
,
4781 write_dt_extensions
);
4786 /* Write a symbol to the module. */
4789 write_symbol (int n
, gfc_symbol
*sym
)
4793 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
4794 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
4797 mio_pool_string (&sym
->name
);
4799 mio_pool_string (&sym
->module
);
4800 if (sym
->attr
.is_bind_c
|| sym
->attr
.is_iso_c
)
4802 label
= sym
->binding_label
;
4803 mio_pool_string (&label
);
4806 mio_pool_string (&sym
->name
);
4808 mio_pointer_ref (&sym
->ns
);
4815 /* Recursive traversal function to write the initial set of symbols to
4816 the module. We check to see if the symbol should be written
4817 according to the access specification. */
4820 write_symbol0 (gfc_symtree
*st
)
4824 bool dont_write
= false;
4829 write_symbol0 (st
->left
);
4832 if (sym
->module
== NULL
)
4833 sym
->module
= gfc_get_string (module_name
);
4835 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4836 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
4839 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4844 p
= get_pointer (sym
);
4845 if (p
->type
== P_UNKNOWN
)
4848 if (p
->u
.wsym
.state
!= WRITTEN
)
4850 write_symbol (p
->integer
, sym
);
4851 p
->u
.wsym
.state
= WRITTEN
;
4855 write_symbol0 (st
->right
);
4859 /* Recursive traversal function to write the secondary set of symbols
4860 to the module file. These are symbols that were not public yet are
4861 needed by the public symbols or another dependent symbol. The act
4862 of writing a symbol can modify the pointer_info tree, so we cease
4863 traversal if we find a symbol to write. We return nonzero if a
4864 symbol was written and pass that information upwards. */
4867 write_symbol1 (pointer_info
*p
)
4874 result
= write_symbol1 (p
->left
);
4876 if (!(p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
))
4878 p
->u
.wsym
.state
= WRITTEN
;
4879 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
4883 result
|= write_symbol1 (p
->right
);
4888 /* Write operator interfaces associated with a symbol. */
4891 write_operator (gfc_user_op
*uop
)
4893 static char nullstring
[] = "";
4894 const char *p
= nullstring
;
4897 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
4900 mio_symbol_interface (&uop
->name
, &p
, &uop
->op
);
4904 /* Write generic interfaces from the namespace sym_root. */
4907 write_generic (gfc_symtree
*st
)
4914 write_generic (st
->left
);
4915 write_generic (st
->right
);
4918 if (!sym
|| check_unique_name (st
->name
))
4921 if (sym
->generic
== NULL
4922 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4925 if (sym
->module
== NULL
)
4926 sym
->module
= gfc_get_string (module_name
);
4928 mio_symbol_interface (&st
->name
, &sym
->module
, &sym
->generic
);
4933 write_symtree (gfc_symtree
*st
)
4940 /* A symbol in an interface body must not be visible in the
4942 if (sym
->ns
!= gfc_current_ns
4943 && sym
->ns
->proc_name
4944 && sym
->ns
->proc_name
->attr
.if_source
== IFSRC_IFBODY
)
4947 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
4948 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4949 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
4952 if (check_unique_name (st
->name
))
4955 p
= find_pointer (sym
);
4957 gfc_internal_error ("write_symtree(): Symbol not written");
4959 mio_pool_string (&st
->name
);
4960 mio_integer (&st
->ambiguous
);
4961 mio_integer (&p
->integer
);
4970 /* Write the operator interfaces. */
4973 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4975 if (i
== INTRINSIC_USER
)
4978 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
4979 gfc_current_ns
->default_access
)
4980 ? &gfc_current_ns
->op
[i
] : NULL
);
4988 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
4994 write_generic (gfc_current_ns
->sym_root
);
5000 write_blank_common ();
5001 write_common (gfc_current_ns
->common_root
);
5013 gfc_traverse_symtree (gfc_current_ns
->sym_root
,
5014 write_derived_extensions
);
5019 /* Write symbol information. First we traverse all symbols in the
5020 primary namespace, writing those that need to be written.
5021 Sometimes writing one symbol will cause another to need to be
5022 written. A list of these symbols ends up on the write stack, and
5023 we end by popping the bottom of the stack and writing the symbol
5024 until the stack is empty. */
5028 write_symbol0 (gfc_current_ns
->sym_root
);
5029 while (write_symbol1 (pi_root
))
5038 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
5043 /* Read a MD5 sum from the header of a module file. If the file cannot
5044 be opened, or we have any other error, we return -1. */
5047 read_md5_from_module_file (const char * filename
, unsigned char md5
[16])
5053 /* Open the file. */
5054 if ((file
= fopen (filename
, "r")) == NULL
)
5057 /* Read the first line. */
5058 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
5064 /* The file also needs to be overwritten if the version number changed. */
5065 n
= strlen ("GFORTRAN module version '" MOD_VERSION
"' created");
5066 if (strncmp (buf
, "GFORTRAN module version '" MOD_VERSION
"' created", n
) != 0)
5072 /* Read a second line. */
5073 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
5079 /* Close the file. */
5082 /* If the header is not what we expect, or is too short, bail out. */
5083 if (strncmp (buf
, "MD5:", 4) != 0 || strlen (buf
) < 4 + 16)
5086 /* Now, we have a real MD5, read it into the array. */
5087 for (n
= 0; n
< 16; n
++)
5091 if (sscanf (&(buf
[4+2*n
]), "%02x", &x
) != 1)
5101 /* Given module, dump it to disk. If there was an error while
5102 processing the module, dump_flag will be set to zero and we delete
5103 the module file, even if it was already there. */
5106 gfc_dump_module (const char *name
, int dump_flag
)
5109 char *filename
, *filename_tmp
, *p
;
5112 unsigned char md5_new
[16], md5_old
[16];
5114 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
5115 if (gfc_option
.module_dir
!= NULL
)
5117 n
+= strlen (gfc_option
.module_dir
);
5118 filename
= (char *) alloca (n
);
5119 strcpy (filename
, gfc_option
.module_dir
);
5120 strcat (filename
, name
);
5124 filename
= (char *) alloca (n
);
5125 strcpy (filename
, name
);
5127 strcat (filename
, MODULE_EXTENSION
);
5129 /* Name of the temporary file used to write the module. */
5130 filename_tmp
= (char *) alloca (n
+ 1);
5131 strcpy (filename_tmp
, filename
);
5132 strcat (filename_tmp
, "0");
5134 /* There was an error while processing the module. We delete the
5135 module file, even if it was already there. */
5142 if (gfc_cpp_makedep ())
5143 gfc_cpp_add_target (filename
);
5145 /* Write the module to the temporary file. */
5146 module_fp
= fopen (filename_tmp
, "w");
5147 if (module_fp
== NULL
)
5148 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
5149 filename_tmp
, xstrerror (errno
));
5151 /* Write the header, including space reserved for the MD5 sum. */
5155 *strchr (p
, '\n') = '\0';
5157 fprintf (module_fp
, "GFORTRAN module version '%s' created from %s on %s\n"
5158 "MD5:", MOD_VERSION
, gfc_source_file
, p
);
5159 fgetpos (module_fp
, &md5_pos
);
5160 fputs ("00000000000000000000000000000000 -- "
5161 "If you edit this, you'll get what you deserve.\n\n", module_fp
);
5163 /* Initialize the MD5 context that will be used for output. */
5164 md5_init_ctx (&ctx
);
5166 /* Write the module itself. */
5168 strcpy (module_name
, name
);
5174 free_pi_tree (pi_root
);
5179 /* Write the MD5 sum to the header of the module file. */
5180 md5_finish_ctx (&ctx
, md5_new
);
5181 fsetpos (module_fp
, &md5_pos
);
5182 for (n
= 0; n
< 16; n
++)
5183 fprintf (module_fp
, "%02x", md5_new
[n
]);
5185 if (fclose (module_fp
))
5186 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
5187 filename_tmp
, xstrerror (errno
));
5189 /* Read the MD5 from the header of the old module file and compare. */
5190 if (read_md5_from_module_file (filename
, md5_old
) != 0
5191 || memcmp (md5_old
, md5_new
, sizeof (md5_old
)) != 0)
5193 /* Module file have changed, replace the old one. */
5194 if (unlink (filename
) && errno
!= ENOENT
)
5195 gfc_fatal_error ("Can't delete module file '%s': %s", filename
,
5197 if (rename (filename_tmp
, filename
))
5198 gfc_fatal_error ("Can't rename module file '%s' to '%s': %s",
5199 filename_tmp
, filename
, xstrerror (errno
));
5203 if (unlink (filename_tmp
))
5204 gfc_fatal_error ("Can't delete temporary module file '%s': %s",
5205 filename_tmp
, xstrerror (errno
));
5211 create_intrinsic_function (const char *name
, gfc_isym_id id
,
5212 const char *modname
, intmod_id module
)
5214 gfc_intrinsic_sym
*isym
;
5215 gfc_symtree
*tmp_symtree
;
5218 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
5221 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
5223 gfc_error ("Symbol '%s' already declared", name
);
5226 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
, false);
5227 sym
= tmp_symtree
->n
.sym
;
5229 isym
= gfc_intrinsic_function_by_id (id
);
5232 sym
->attr
.flavor
= FL_PROCEDURE
;
5233 sym
->attr
.intrinsic
= 1;
5235 sym
->module
= gfc_get_string (modname
);
5236 sym
->attr
.use_assoc
= 1;
5237 sym
->from_intmod
= module
;
5238 sym
->intmod_sym_id
= id
;
5242 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
5243 the current namespace for all named constants, pointer types, and
5244 procedures in the module unless the only clause was used or a rename
5245 list was provided. */
5248 import_iso_c_binding_module (void)
5250 gfc_symbol
*mod_sym
= NULL
;
5251 gfc_symtree
*mod_symtree
= NULL
;
5252 const char *iso_c_module_name
= "__iso_c_binding";
5256 /* Look only in the current namespace. */
5257 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, iso_c_module_name
);
5259 if (mod_symtree
== NULL
)
5261 /* symtree doesn't already exist in current namespace. */
5262 gfc_get_sym_tree (iso_c_module_name
, gfc_current_ns
, &mod_symtree
,
5265 if (mod_symtree
!= NULL
)
5266 mod_sym
= mod_symtree
->n
.sym
;
5268 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
5269 "create symbol for %s", iso_c_module_name
);
5271 mod_sym
->attr
.flavor
= FL_MODULE
;
5272 mod_sym
->attr
.intrinsic
= 1;
5273 mod_sym
->module
= gfc_get_string (iso_c_module_name
);
5274 mod_sym
->from_intmod
= INTMOD_ISO_C_BINDING
;
5277 /* Generate the symbols for the named constants representing
5278 the kinds for intrinsic data types. */
5279 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
5282 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5283 if (strcmp (c_interop_kinds_table
[i
].name
, u
->use_name
) == 0)
5289 #define NAMED_FUNCTION(a,b,c,d) \
5291 create_intrinsic_function (u->local_name[0] ? u->local_name \
5294 iso_c_module_name, \
5295 INTMOD_ISO_C_BINDING); \
5297 #include "iso-c-binding.def"
5298 #undef NAMED_FUNCTION
5301 generate_isocbinding_symbol (iso_c_module_name
,
5302 (iso_c_binding_symbol
) i
,
5303 u
->local_name
[0] ? u
->local_name
5308 if (!found
&& !only_flag
)
5311 #define NAMED_FUNCTION(a,b,c,d) \
5313 if ((gfc_option.allow_std & d) == 0) \
5315 create_intrinsic_function (b, (gfc_isym_id) c, \
5316 iso_c_module_name, \
5317 INTMOD_ISO_C_BINDING); \
5319 #include "iso-c-binding.def"
5320 #undef NAMED_FUNCTION
5323 generate_isocbinding_symbol (iso_c_module_name
,
5324 (iso_c_binding_symbol
) i
, NULL
);
5328 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5333 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5334 "module ISO_C_BINDING", u
->use_name
, &u
->where
);
5339 /* Add an integer named constant from a given module. */
5342 create_int_parameter (const char *name
, int value
, const char *modname
,
5343 intmod_id module
, int id
)
5345 gfc_symtree
*tmp_symtree
;
5348 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
5349 if (tmp_symtree
!= NULL
)
5351 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
5354 gfc_error ("Symbol '%s' already declared", name
);
5357 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
, false);
5358 sym
= tmp_symtree
->n
.sym
;
5360 sym
->module
= gfc_get_string (modname
);
5361 sym
->attr
.flavor
= FL_PARAMETER
;
5362 sym
->ts
.type
= BT_INTEGER
;
5363 sym
->ts
.kind
= gfc_default_integer_kind
;
5364 sym
->value
= gfc_get_int_expr (gfc_default_integer_kind
, NULL
, value
);
5365 sym
->attr
.use_assoc
= 1;
5366 sym
->from_intmod
= module
;
5367 sym
->intmod_sym_id
= id
;
5371 /* Value is already contained by the array constructor, but not
5375 create_int_parameter_array (const char *name
, int size
, gfc_expr
*value
,
5376 const char *modname
, intmod_id module
, int id
)
5378 gfc_symtree
*tmp_symtree
;
5381 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
5382 if (tmp_symtree
!= NULL
)
5384 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
5387 gfc_error ("Symbol '%s' already declared", name
);
5390 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
, false);
5391 sym
= tmp_symtree
->n
.sym
;
5393 sym
->module
= gfc_get_string (modname
);
5394 sym
->attr
.flavor
= FL_PARAMETER
;
5395 sym
->ts
.type
= BT_INTEGER
;
5396 sym
->ts
.kind
= gfc_default_integer_kind
;
5397 sym
->attr
.use_assoc
= 1;
5398 sym
->from_intmod
= module
;
5399 sym
->intmod_sym_id
= id
;
5400 sym
->attr
.dimension
= 1;
5401 sym
->as
= gfc_get_array_spec ();
5403 sym
->as
->type
= AS_EXPLICIT
;
5404 sym
->as
->lower
[0] = gfc_get_int_expr (gfc_default_integer_kind
, NULL
, 1);
5405 sym
->as
->upper
[0] = gfc_get_int_expr (gfc_default_integer_kind
, NULL
, size
);
5408 sym
->value
->shape
= gfc_get_shape (1);
5409 mpz_init_set_ui (sym
->value
->shape
[0], size
);
5414 /* USE the ISO_FORTRAN_ENV intrinsic module. */
5417 use_iso_fortran_env_module (void)
5419 static char mod
[] = "iso_fortran_env";
5421 gfc_symbol
*mod_sym
;
5422 gfc_symtree
*mod_symtree
;
5426 intmod_sym symbol
[] = {
5427 #define NAMED_INTCST(a,b,c,d) { a, b, 0, d },
5428 #include "iso-fortran-env.def"
5430 #define NAMED_KINDARRAY(a,b,c,d) { a, b, 0, d },
5431 #include "iso-fortran-env.def"
5432 #undef NAMED_KINDARRAY
5433 #define NAMED_FUNCTION(a,b,c,d) { a, b, c, d },
5434 #include "iso-fortran-env.def"
5435 #undef NAMED_FUNCTION
5436 { ISOFORTRANENV_INVALID
, NULL
, -1234, 0 } };
5439 #define NAMED_INTCST(a,b,c,d) symbol[i++].value = c;
5440 #include "iso-fortran-env.def"
5443 /* Generate the symbol for the module itself. */
5444 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, mod
);
5445 if (mod_symtree
== NULL
)
5447 gfc_get_sym_tree (mod
, gfc_current_ns
, &mod_symtree
, false);
5448 gcc_assert (mod_symtree
);
5449 mod_sym
= mod_symtree
->n
.sym
;
5451 mod_sym
->attr
.flavor
= FL_MODULE
;
5452 mod_sym
->attr
.intrinsic
= 1;
5453 mod_sym
->module
= gfc_get_string (mod
);
5454 mod_sym
->from_intmod
= INTMOD_ISO_FORTRAN_ENV
;
5457 if (!mod_symtree
->n
.sym
->attr
.intrinsic
)
5458 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
5459 "non-intrinsic module name used previously", mod
);
5461 /* Generate the symbols for the module integer named constants. */
5463 for (i
= 0; symbol
[i
].name
; i
++)
5466 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5468 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
5473 if (gfc_notify_std (symbol
[i
].standard
, "The symbol '%s', "
5474 "referrenced at %C, is not in the selected "
5475 "standard", symbol
[i
].name
) == FAILURE
)
5478 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5479 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5480 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named "
5481 "constant from intrinsic module "
5482 "ISO_FORTRAN_ENV at %C is incompatible with "
5484 gfc_option
.flag_default_integer
5485 ? "-fdefault-integer-8"
5486 : "-fdefault-real-8");
5487 switch (symbol
[i
].id
)
5489 #define NAMED_INTCST(a,b,c,d) \
5491 #include "iso-fortran-env.def"
5493 create_int_parameter (u
->local_name
[0] ? u
->local_name
5495 symbol
[i
].value
, mod
,
5496 INTMOD_ISO_FORTRAN_ENV
, symbol
[i
].id
);
5499 #define NAMED_KINDARRAY(a,b,KINDS,d) \
5501 expr = gfc_get_array_expr (BT_INTEGER, \
5502 gfc_default_integer_kind,\
5504 for (j = 0; KINDS[j].kind != 0; j++) \
5505 gfc_constructor_append_expr (&expr->value.constructor, \
5506 gfc_get_int_expr (gfc_default_integer_kind, NULL, \
5507 KINDS[j].kind), NULL); \
5508 create_int_parameter_array (u->local_name[0] ? u->local_name \
5511 INTMOD_ISO_FORTRAN_ENV, \
5514 #include "iso-fortran-env.def"
5515 #undef NAMED_KINDARRAY
5517 #define NAMED_FUNCTION(a,b,c,d) \
5519 #include "iso-fortran-env.def"
5520 #undef NAMED_FUNCTION
5521 create_intrinsic_function (u
->local_name
[0] ? u
->local_name
5523 (gfc_isym_id
) symbol
[i
].value
, mod
,
5524 INTMOD_ISO_FORTRAN_ENV
);
5533 if (!found
&& !only_flag
)
5535 if ((gfc_option
.allow_std
& symbol
[i
].standard
) == 0)
5538 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5539 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5540 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5541 "from intrinsic module ISO_FORTRAN_ENV at %C is "
5542 "incompatible with option %s",
5543 gfc_option
.flag_default_integer
5544 ? "-fdefault-integer-8" : "-fdefault-real-8");
5546 switch (symbol
[i
].id
)
5548 #define NAMED_INTCST(a,b,c,d) \
5550 #include "iso-fortran-env.def"
5552 create_int_parameter (symbol
[i
].name
, symbol
[i
].value
, mod
,
5553 INTMOD_ISO_FORTRAN_ENV
, symbol
[i
].id
);
5556 #define NAMED_KINDARRAY(a,b,KINDS,d) \
5558 expr = gfc_get_array_expr (BT_INTEGER, gfc_default_integer_kind, \
5560 for (j = 0; KINDS[j].kind != 0; j++) \
5561 gfc_constructor_append_expr (&expr->value.constructor, \
5562 gfc_get_int_expr (gfc_default_integer_kind, NULL, \
5563 KINDS[j].kind), NULL); \
5564 create_int_parameter_array (symbol[i].name, j, expr, mod, \
5565 INTMOD_ISO_FORTRAN_ENV, symbol[i].id);\
5567 #include "iso-fortran-env.def"
5568 #undef NAMED_KINDARRAY
5570 #define NAMED_FUNCTION(a,b,c,d) \
5572 #include "iso-fortran-env.def"
5573 #undef NAMED_FUNCTION
5574 create_intrinsic_function (symbol
[i
].name
,
5575 (gfc_isym_id
) symbol
[i
].value
, mod
,
5576 INTMOD_ISO_FORTRAN_ENV
);
5585 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5590 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5591 "module ISO_FORTRAN_ENV", u
->use_name
, &u
->where
);
5596 /* Process a USE directive. */
5599 gfc_use_module (void)
5604 gfc_symtree
*mod_symtree
;
5605 gfc_use_list
*use_stmt
;
5607 filename
= (char *) alloca (strlen (module_name
) + strlen (MODULE_EXTENSION
)
5609 strcpy (filename
, module_name
);
5610 strcat (filename
, MODULE_EXTENSION
);
5612 /* First, try to find an non-intrinsic module, unless the USE statement
5613 specified that the module is intrinsic. */
5616 module_fp
= gfc_open_included_file (filename
, true, true);
5618 /* Then, see if it's an intrinsic one, unless the USE statement
5619 specified that the module is non-intrinsic. */
5620 if (module_fp
== NULL
&& !specified_nonint
)
5622 if (strcmp (module_name
, "iso_fortran_env") == 0
5623 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: ISO_FORTRAN_ENV "
5624 "intrinsic module at %C") != FAILURE
)
5626 use_iso_fortran_env_module ();
5630 if (strcmp (module_name
, "iso_c_binding") == 0
5631 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
5632 "ISO_C_BINDING module at %C") != FAILURE
)
5634 import_iso_c_binding_module();
5638 module_fp
= gfc_open_intrinsic_module (filename
);
5640 if (module_fp
== NULL
&& specified_int
)
5641 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
5645 if (module_fp
== NULL
)
5646 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
5647 filename
, xstrerror (errno
));
5649 /* Check that we haven't already USEd an intrinsic module with the
5652 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, module_name
);
5653 if (mod_symtree
&& mod_symtree
->n
.sym
->attr
.intrinsic
)
5654 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
5655 "intrinsic module name used previously", module_name
);
5662 /* Skip the first two lines of the module, after checking that this is
5663 a gfortran module file. */
5669 bad_module ("Unexpected end of module");
5672 if ((start
== 1 && strcmp (atom_name
, "GFORTRAN") != 0)
5673 || (start
== 2 && strcmp (atom_name
, " module") != 0))
5674 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
5678 if (strcmp (atom_name
, " version") != 0
5679 || module_char () != ' '
5680 || parse_atom () != ATOM_STRING
)
5681 gfc_fatal_error ("Parse error when checking module version"
5682 " for file '%s' opened at %C", filename
);
5684 if (strcmp (atom_string
, MOD_VERSION
))
5686 gfc_fatal_error ("Wrong module version '%s' (expected '%s') "
5687 "for file '%s' opened at %C", atom_string
,
5688 MOD_VERSION
, filename
);
5691 gfc_free (atom_string
);
5698 /* Make sure we're not reading the same module that we may be building. */
5699 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
5700 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
5701 gfc_fatal_error ("Can't USE the same module we're building!");
5704 init_true_name_tree ();
5708 free_true_name (true_name_root
);
5709 true_name_root
= NULL
;
5711 free_pi_tree (pi_root
);
5716 use_stmt
= gfc_get_use_list ();
5717 use_stmt
->module_name
= gfc_get_string (module_name
);
5718 use_stmt
->only_flag
= only_flag
;
5719 use_stmt
->rename
= gfc_rename_list
;
5720 use_stmt
->where
= use_locus
;
5721 gfc_rename_list
= NULL
;
5722 use_stmt
->next
= gfc_current_ns
->use_stmts
;
5723 gfc_current_ns
->use_stmts
= use_stmt
;
5728 gfc_free_use_stmts (gfc_use_list
*use_stmts
)
5731 for (; use_stmts
; use_stmts
= next
)
5733 gfc_use_rename
*next_rename
;
5735 for (; use_stmts
->rename
; use_stmts
->rename
= next_rename
)
5737 next_rename
= use_stmts
->rename
->next
;
5738 gfc_free (use_stmts
->rename
);
5740 next
= use_stmts
->next
;
5741 gfc_free (use_stmts
);
5747 gfc_module_init_2 (void)
5749 last_atom
= ATOM_LPAREN
;
5754 gfc_module_done_2 (void)