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, 2009
4 Free Software Foundation, Inc.
5 Contributed by Andy Vaught
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* The syntax of gfortran modules resembles that of lisp lists, i.e. a
24 sequence of atoms, which can be left or right parenthesis, names,
25 integers or strings. Parenthesis are always matched which allows
26 us to skip over sections at high speed without having to know
27 anything about the internal structure of the lists. A "name" is
28 usually a fortran 95 identifier, but can also start with '@' in
29 order to reference a hidden symbol.
31 The first line of a module is an informational message about what
32 created the module, the file it came from and when it was created.
33 The second line is a warning for people not to edit the module.
34 The rest of the module looks like:
36 ( ( <Interface info for UPLUS> )
37 ( <Interface info for UMINUS> )
40 ( ( <name of operator interface> <module of op interface> <i/f1> ... )
43 ( ( <name of generic interface> <module of generic interface> <i/f1> ... )
46 ( ( <common name> <symbol> <saved flag>)
52 ( <Symbol Number (in no particular order)>
54 <Module name of symbol>
55 ( <symbol information> )
64 In general, symbols refer to other symbols by their symbol number,
65 which are zero based. Symbols are written to the module in no
73 #include "parse.h" /* FIXME */
76 #define MODULE_EXTENSION ".mod"
78 /* Don't put any single quote (') in MOD_VERSION,
79 if yout want it to be recognized. */
80 #define MOD_VERSION "4"
83 /* Structure that describes a position within a module file. */
92 /* Structure for list of symbols of intrinsic modules. */
105 P_UNKNOWN
= 0, P_OTHER
, P_NAMESPACE
, P_COMPONENT
, P_SYMBOL
109 /* The fixup structure lists pointers to pointers that have to
110 be updated when a pointer value becomes known. */
112 typedef struct fixup_t
115 struct fixup_t
*next
;
120 /* Structure for holding extra info needed for pointers being read. */
136 typedef struct pointer_info
138 BBT_HEADER (pointer_info
);
142 /* The first component of each member of the union is the pointer
149 void *pointer
; /* Member for doing pointer searches. */
154 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
155 enum gfc_rsym_state state
;
156 int ns
, referenced
, renamed
;
159 gfc_symtree
*symtree
;
160 char binding_label
[GFC_MAX_SYMBOL_LEN
+ 1];
167 enum gfc_wsym_state state
;
176 #define gfc_get_pointer_info() XCNEW (pointer_info)
179 /* Local variables */
181 /* The FILE for the module we're reading or writing. */
182 static FILE *module_fp
;
184 /* MD5 context structure. */
185 static struct md5_ctx ctx
;
187 /* The name of the module we're reading (USE'ing) or writing. */
188 static char module_name
[GFC_MAX_SYMBOL_LEN
+ 1];
190 /* The way the module we're reading was specified. */
191 static bool specified_nonint
, specified_int
;
193 static int module_line
, module_column
, only_flag
;
195 { IO_INPUT
, IO_OUTPUT
}
198 static gfc_use_rename
*gfc_rename_list
;
199 static pointer_info
*pi_root
;
200 static int symbol_number
; /* Counter for assigning symbol numbers */
202 /* Tells mio_expr_ref to make symbols for unused equivalence members. */
203 static bool in_load_equiv
;
205 static locus use_locus
;
209 /*****************************************************************/
211 /* Pointer/integer conversion. Pointers between structures are stored
212 as integers in the module file. The next couple of subroutines
213 handle this translation for reading and writing. */
215 /* Recursively free the tree of pointer structures. */
218 free_pi_tree (pointer_info
*p
)
223 if (p
->fixup
!= NULL
)
224 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
226 free_pi_tree (p
->left
);
227 free_pi_tree (p
->right
);
233 /* Compare pointers when searching by pointer. Used when writing a
237 compare_pointers (void *_sn1
, void *_sn2
)
239 pointer_info
*sn1
, *sn2
;
241 sn1
= (pointer_info
*) _sn1
;
242 sn2
= (pointer_info
*) _sn2
;
244 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
246 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
253 /* Compare integers when searching by integer. Used when reading a
257 compare_integers (void *_sn1
, void *_sn2
)
259 pointer_info
*sn1
, *sn2
;
261 sn1
= (pointer_info
*) _sn1
;
262 sn2
= (pointer_info
*) _sn2
;
264 if (sn1
->integer
< sn2
->integer
)
266 if (sn1
->integer
> sn2
->integer
)
273 /* Initialize the pointer_info tree. */
282 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
284 /* Pointer 0 is the NULL pointer. */
285 p
= gfc_get_pointer_info ();
290 gfc_insert_bbt (&pi_root
, p
, compare
);
292 /* Pointer 1 is the current namespace. */
293 p
= gfc_get_pointer_info ();
294 p
->u
.pointer
= gfc_current_ns
;
296 p
->type
= P_NAMESPACE
;
298 gfc_insert_bbt (&pi_root
, p
, compare
);
304 /* During module writing, call here with a pointer to something,
305 returning the pointer_info node. */
307 static pointer_info
*
308 find_pointer (void *gp
)
315 if (p
->u
.pointer
== gp
)
317 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
324 /* Given a pointer while writing, returns the pointer_info tree node,
325 creating it if it doesn't exist. */
327 static pointer_info
*
328 get_pointer (void *gp
)
332 p
= find_pointer (gp
);
336 /* Pointer doesn't have an integer. Give it one. */
337 p
= gfc_get_pointer_info ();
340 p
->integer
= symbol_number
++;
342 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
348 /* Given an integer during reading, find it in the pointer_info tree,
349 creating the node if not found. */
351 static pointer_info
*
352 get_integer (int integer
)
362 c
= compare_integers (&t
, p
);
366 p
= (c
< 0) ? p
->left
: p
->right
;
372 p
= gfc_get_pointer_info ();
373 p
->integer
= integer
;
376 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
382 /* Recursive function to find a pointer within a tree by brute force. */
384 static pointer_info
*
385 fp2 (pointer_info
*p
, const void *target
)
392 if (p
->u
.pointer
== target
)
395 q
= fp2 (p
->left
, target
);
399 return fp2 (p
->right
, target
);
403 /* During reading, find a pointer_info node from the pointer value.
404 This amounts to a brute-force search. */
406 static pointer_info
*
407 find_pointer2 (void *p
)
409 return fp2 (pi_root
, p
);
413 /* Resolve any fixups using a known pointer. */
416 resolve_fixups (fixup_t
*f
, void *gp
)
429 /* Call here during module reading when we know what pointer to
430 associate with an integer. Any fixups that exist are resolved at
434 associate_integer_pointer (pointer_info
*p
, void *gp
)
436 if (p
->u
.pointer
!= NULL
)
437 gfc_internal_error ("associate_integer_pointer(): Already associated");
441 resolve_fixups (p
->fixup
, gp
);
447 /* During module reading, given an integer and a pointer to a pointer,
448 either store the pointer from an already-known value or create a
449 fixup structure in order to store things later. Returns zero if
450 the reference has been actually stored, or nonzero if the reference
451 must be fixed later (i.e., associate_integer_pointer must be called
452 sometime later. Returns the pointer_info structure. */
454 static pointer_info
*
455 add_fixup (int integer
, void *gp
)
461 p
= get_integer (integer
);
463 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
466 *cp
= (char *) p
->u
.pointer
;
475 f
->pointer
= (void **) gp
;
482 /*****************************************************************/
484 /* Parser related subroutines */
486 /* Free the rename list left behind by a USE statement. */
491 gfc_use_rename
*next
;
493 for (; gfc_rename_list
; gfc_rename_list
= next
)
495 next
= gfc_rename_list
->next
;
496 gfc_free (gfc_rename_list
);
501 /* Match a USE statement. */
506 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module_nature
[GFC_MAX_SYMBOL_LEN
+ 1];
507 gfc_use_rename
*tail
= NULL
, *new_use
;
508 interface_type type
, type2
;
512 specified_int
= false;
513 specified_nonint
= false;
515 if (gfc_match (" , ") == MATCH_YES
)
517 if ((m
= gfc_match (" %n ::", module_nature
)) == MATCH_YES
)
519 if (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: module "
520 "nature in USE statement at %C") == FAILURE
)
523 if (strcmp (module_nature
, "intrinsic") == 0)
524 specified_int
= true;
527 if (strcmp (module_nature
, "non_intrinsic") == 0)
528 specified_nonint
= true;
531 gfc_error ("Module nature in USE statement at %C shall "
532 "be either INTRINSIC or NON_INTRINSIC");
539 /* Help output a better error message than "Unclassifiable
541 gfc_match (" %n", module_nature
);
542 if (strcmp (module_nature
, "intrinsic") == 0
543 || strcmp (module_nature
, "non_intrinsic") == 0)
544 gfc_error ("\"::\" was expected after module nature at %C "
545 "but was not found");
551 m
= gfc_match (" ::");
552 if (m
== MATCH_YES
&&
553 gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
554 "\"USE :: module\" at %C") == FAILURE
)
559 m
= gfc_match ("% ");
565 use_locus
= gfc_current_locus
;
567 m
= gfc_match_name (module_name
);
574 if (gfc_match_eos () == MATCH_YES
)
576 if (gfc_match_char (',') != MATCH_YES
)
579 if (gfc_match (" only :") == MATCH_YES
)
582 if (gfc_match_eos () == MATCH_YES
)
587 /* Get a new rename struct and add it to the rename list. */
588 new_use
= gfc_get_use_rename ();
589 new_use
->where
= gfc_current_locus
;
592 if (gfc_rename_list
== NULL
)
593 gfc_rename_list
= new_use
;
595 tail
->next
= new_use
;
598 /* See what kind of interface we're dealing with. Assume it is
600 new_use
->op
= INTRINSIC_NONE
;
601 if (gfc_match_generic_spec (&type
, name
, &op
) == MATCH_ERROR
)
606 case INTERFACE_NAMELESS
:
607 gfc_error ("Missing generic specification in USE statement at %C");
610 case INTERFACE_USER_OP
:
611 case INTERFACE_GENERIC
:
612 m
= gfc_match (" =>");
614 if (type
== INTERFACE_USER_OP
&& m
== MATCH_YES
615 && (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: Renaming "
616 "operators in USE statements at %C")
620 if (type
== INTERFACE_USER_OP
)
621 new_use
->op
= INTRINSIC_USER
;
626 strcpy (new_use
->use_name
, name
);
629 strcpy (new_use
->local_name
, name
);
630 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
635 if (m
== MATCH_ERROR
)
643 strcpy (new_use
->local_name
, name
);
645 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
650 if (m
== MATCH_ERROR
)
654 if (strcmp (new_use
->use_name
, module_name
) == 0
655 || strcmp (new_use
->local_name
, module_name
) == 0)
657 gfc_error ("The name '%s' at %C has already been used as "
658 "an external module name.", module_name
);
663 case INTERFACE_INTRINSIC_OP
:
671 if (gfc_match_eos () == MATCH_YES
)
673 if (gfc_match_char (',') != MATCH_YES
)
680 gfc_syntax_error (ST_USE
);
688 /* Given a name and a number, inst, return the inst name
689 under which to load this symbol. Returns NULL if this
690 symbol shouldn't be loaded. If inst is zero, returns
691 the number of instances of this name. If interface is
692 true, a user-defined operator is sought, otherwise only
693 non-operators are sought. */
696 find_use_name_n (const char *name
, int *inst
, bool interface
)
702 for (u
= gfc_rename_list
; u
; u
= u
->next
)
704 if (strcmp (u
->use_name
, name
) != 0
705 || (u
->op
== INTRINSIC_USER
&& !interface
)
706 || (u
->op
!= INTRINSIC_USER
&& interface
))
719 return only_flag
? NULL
: name
;
723 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
727 /* Given a name, return the name under which to load this symbol.
728 Returns NULL if this symbol shouldn't be loaded. */
731 find_use_name (const char *name
, bool interface
)
734 return find_use_name_n (name
, &i
, interface
);
738 /* Given a real name, return the number of use names associated with it. */
741 number_use_names (const char *name
, bool interface
)
744 find_use_name_n (name
, &i
, interface
);
749 /* Try to find the operator in the current list. */
751 static gfc_use_rename
*
752 find_use_operator (gfc_intrinsic_op op
)
756 for (u
= gfc_rename_list
; u
; u
= u
->next
)
764 /*****************************************************************/
766 /* The next couple of subroutines maintain a tree used to avoid a
767 brute-force search for a combination of true name and module name.
768 While symtree names, the name that a particular symbol is known by
769 can changed with USE statements, we still have to keep track of the
770 true names to generate the correct reference, and also avoid
771 loading the same real symbol twice in a program unit.
773 When we start reading, the true name tree is built and maintained
774 as symbols are read. The tree is searched as we load new symbols
775 to see if it already exists someplace in the namespace. */
777 typedef struct true_name
779 BBT_HEADER (true_name
);
784 static true_name
*true_name_root
;
787 /* Compare two true_name structures. */
790 compare_true_names (void *_t1
, void *_t2
)
795 t1
= (true_name
*) _t1
;
796 t2
= (true_name
*) _t2
;
798 c
= ((t1
->sym
->module
> t2
->sym
->module
)
799 - (t1
->sym
->module
< t2
->sym
->module
));
803 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
807 /* Given a true name, search the true name tree to see if it exists
808 within the main namespace. */
811 find_true_name (const char *name
, const char *module
)
817 sym
.name
= gfc_get_string (name
);
819 sym
.module
= gfc_get_string (module
);
827 c
= compare_true_names ((void *) (&t
), (void *) p
);
831 p
= (c
< 0) ? p
->left
: p
->right
;
838 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
841 add_true_name (gfc_symbol
*sym
)
845 t
= XCNEW (true_name
);
848 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
852 /* Recursive function to build the initial true name tree by
853 recursively traversing the current namespace. */
856 build_tnt (gfc_symtree
*st
)
861 build_tnt (st
->left
);
862 build_tnt (st
->right
);
864 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
867 add_true_name (st
->n
.sym
);
871 /* Initialize the true name tree with the current namespace. */
874 init_true_name_tree (void)
876 true_name_root
= NULL
;
877 build_tnt (gfc_current_ns
->sym_root
);
881 /* Recursively free a true name tree node. */
884 free_true_name (true_name
*t
)
888 free_true_name (t
->left
);
889 free_true_name (t
->right
);
895 /*****************************************************************/
897 /* Module reading and writing. */
901 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
905 static atom_type last_atom
;
908 /* The name buffer must be at least as long as a symbol name. Right
909 now it's not clear how we're going to store numeric constants--
910 probably as a hexadecimal string, since this will allow the exact
911 number to be preserved (this can't be done by a decimal
912 representation). Worry about that later. TODO! */
914 #define MAX_ATOM_SIZE 100
917 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
920 /* Report problems with a module. Error reporting is not very
921 elaborate, since this sorts of errors shouldn't really happen.
922 This subroutine never returns. */
924 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
927 bad_module (const char *msgid
)
934 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
935 module_name
, module_line
, module_column
, msgid
);
938 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
939 module_name
, module_line
, module_column
, msgid
);
942 gfc_fatal_error ("Module %s at line %d column %d: %s",
943 module_name
, module_line
, module_column
, msgid
);
949 /* Set the module's input pointer. */
952 set_module_locus (module_locus
*m
)
954 module_column
= m
->column
;
955 module_line
= m
->line
;
956 fsetpos (module_fp
, &m
->pos
);
960 /* Get the module's input pointer so that we can restore it later. */
963 get_module_locus (module_locus
*m
)
965 m
->column
= module_column
;
966 m
->line
= module_line
;
967 fgetpos (module_fp
, &m
->pos
);
971 /* Get the next character in the module, updating our reckoning of
979 c
= getc (module_fp
);
982 bad_module ("Unexpected EOF");
995 /* Parse a string constant. The delimiter is guaranteed to be a
1005 get_module_locus (&start
);
1009 /* See how long the string is. */
1014 bad_module ("Unexpected end of module in string constant");
1032 set_module_locus (&start
);
1034 atom_string
= p
= XCNEWVEC (char, len
+ 1);
1036 for (; len
> 0; len
--)
1040 module_char (); /* Guaranteed to be another \'. */
1044 module_char (); /* Terminating \'. */
1045 *p
= '\0'; /* C-style string for debug purposes. */
1049 /* Parse a small integer. */
1052 parse_integer (int c
)
1060 get_module_locus (&m
);
1066 atom_int
= 10 * atom_int
+ c
- '0';
1067 if (atom_int
> 99999999)
1068 bad_module ("Integer overflow");
1071 set_module_locus (&m
);
1089 get_module_locus (&m
);
1094 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
1098 if (++len
> GFC_MAX_SYMBOL_LEN
)
1099 bad_module ("Name too long");
1104 fseek (module_fp
, -1, SEEK_CUR
);
1105 module_column
= m
.column
+ len
- 1;
1112 /* Read the next atom in the module's input stream. */
1123 while (c
== ' ' || c
== '\r' || c
== '\n');
1148 return ATOM_INTEGER
;
1206 bad_module ("Bad name");
1213 /* Peek at the next atom on the input. */
1221 get_module_locus (&m
);
1224 if (a
== ATOM_STRING
)
1225 gfc_free (atom_string
);
1227 set_module_locus (&m
);
1232 /* Read the next atom from the input, requiring that it be a
1236 require_atom (atom_type type
)
1242 get_module_locus (&m
);
1250 p
= _("Expected name");
1253 p
= _("Expected left parenthesis");
1256 p
= _("Expected right parenthesis");
1259 p
= _("Expected integer");
1262 p
= _("Expected string");
1265 gfc_internal_error ("require_atom(): bad atom type required");
1268 set_module_locus (&m
);
1274 /* Given a pointer to an mstring array, require that the current input
1275 be one of the strings in the array. We return the enum value. */
1278 find_enum (const mstring
*m
)
1282 i
= gfc_string2code (m
, atom_name
);
1286 bad_module ("find_enum(): Enum not found");
1292 /**************** Module output subroutines ***************************/
1294 /* Output a character to a module file. */
1297 write_char (char out
)
1299 if (putc (out
, module_fp
) == EOF
)
1300 gfc_fatal_error ("Error writing modules file: %s", strerror (errno
));
1302 /* Add this to our MD5. */
1303 md5_process_bytes (&out
, sizeof (out
), &ctx
);
1315 /* Write an atom to a module. The line wrapping isn't perfect, but it
1316 should work most of the time. This isn't that big of a deal, since
1317 the file really isn't meant to be read by people anyway. */
1320 write_atom (atom_type atom
, const void *v
)
1330 p
= (const char *) v
;
1342 i
= *((const int *) v
);
1344 gfc_internal_error ("write_atom(): Writing negative integer");
1346 sprintf (buffer
, "%d", i
);
1351 gfc_internal_error ("write_atom(): Trying to write dab atom");
1355 if(p
== NULL
|| *p
== '\0')
1360 if (atom
!= ATOM_RPAREN
)
1362 if (module_column
+ len
> 72)
1367 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1372 if (atom
== ATOM_STRING
)
1375 while (p
!= NULL
&& *p
)
1377 if (atom
== ATOM_STRING
&& *p
== '\'')
1382 if (atom
== ATOM_STRING
)
1390 /***************** Mid-level I/O subroutines *****************/
1392 /* These subroutines let their caller read or write atoms without
1393 caring about which of the two is actually happening. This lets a
1394 subroutine concentrate on the actual format of the data being
1397 static void mio_expr (gfc_expr
**);
1398 pointer_info
*mio_symbol_ref (gfc_symbol
**);
1399 pointer_info
*mio_interface_rest (gfc_interface
**);
1400 static void mio_symtree_ref (gfc_symtree
**);
1402 /* Read or write an enumerated value. On writing, we return the input
1403 value for the convenience of callers. We avoid using an integer
1404 pointer because enums are sometimes inside bitfields. */
1407 mio_name (int t
, const mstring
*m
)
1409 if (iomode
== IO_OUTPUT
)
1410 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1413 require_atom (ATOM_NAME
);
1420 /* Specialization of mio_name. */
1422 #define DECL_MIO_NAME(TYPE) \
1423 static inline TYPE \
1424 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1426 return (TYPE) mio_name ((int) t, m); \
1428 #define MIO_NAME(TYPE) mio_name_##TYPE
1433 if (iomode
== IO_OUTPUT
)
1434 write_atom (ATOM_LPAREN
, NULL
);
1436 require_atom (ATOM_LPAREN
);
1443 if (iomode
== IO_OUTPUT
)
1444 write_atom (ATOM_RPAREN
, NULL
);
1446 require_atom (ATOM_RPAREN
);
1451 mio_integer (int *ip
)
1453 if (iomode
== IO_OUTPUT
)
1454 write_atom (ATOM_INTEGER
, ip
);
1457 require_atom (ATOM_INTEGER
);
1463 /* Read or write a gfc_intrinsic_op value. */
1466 mio_intrinsic_op (gfc_intrinsic_op
* op
)
1468 /* FIXME: Would be nicer to do this via the operators symbolic name. */
1469 if (iomode
== IO_OUTPUT
)
1471 int converted
= (int) *op
;
1472 write_atom (ATOM_INTEGER
, &converted
);
1476 require_atom (ATOM_INTEGER
);
1477 *op
= (gfc_intrinsic_op
) atom_int
;
1482 /* Read or write a character pointer that points to a string on the heap. */
1485 mio_allocated_string (const char *s
)
1487 if (iomode
== IO_OUTPUT
)
1489 write_atom (ATOM_STRING
, s
);
1494 require_atom (ATOM_STRING
);
1500 /* Functions for quoting and unquoting strings. */
1503 quote_string (const gfc_char_t
*s
, const size_t slength
)
1505 const gfc_char_t
*p
;
1509 /* Calculate the length we'll need: a backslash takes two ("\\"),
1510 non-printable characters take 10 ("\Uxxxxxxxx") and others take 1. */
1511 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1515 else if (!gfc_wide_is_printable (*p
))
1521 q
= res
= XCNEWVEC (char, len
+ 1);
1522 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1525 *q
++ = '\\', *q
++ = '\\';
1526 else if (!gfc_wide_is_printable (*p
))
1528 sprintf (q
, "\\U%08" HOST_WIDE_INT_PRINT
"x",
1529 (unsigned HOST_WIDE_INT
) *p
);
1533 *q
++ = (unsigned char) *p
;
1541 unquote_string (const char *s
)
1547 for (p
= s
, len
= 0; *p
; p
++, len
++)
1554 else if (p
[1] == 'U')
1555 p
+= 9; /* That is a "\U????????". */
1557 gfc_internal_error ("unquote_string(): got bad string");
1560 res
= gfc_get_wide_string (len
+ 1);
1561 for (i
= 0, p
= s
; i
< len
; i
++, p
++)
1566 res
[i
] = (unsigned char) *p
;
1567 else if (p
[1] == '\\')
1569 res
[i
] = (unsigned char) '\\';
1574 /* We read the 8-digits hexadecimal constant that follows. */
1579 gcc_assert (p
[1] == 'U');
1580 for (j
= 0; j
< 8; j
++)
1583 gcc_assert (sscanf (&p
[j
+2], "%01x", &n
) == 1);
1597 /* Read or write a character pointer that points to a wide string on the
1598 heap, performing quoting/unquoting of nonprintable characters using the
1599 form \U???????? (where each ? is a hexadecimal digit).
1600 Length is the length of the string, only known and used in output mode. */
1602 static const gfc_char_t
*
1603 mio_allocated_wide_string (const gfc_char_t
*s
, const size_t length
)
1605 if (iomode
== IO_OUTPUT
)
1607 char *quoted
= quote_string (s
, length
);
1608 write_atom (ATOM_STRING
, quoted
);
1614 gfc_char_t
*unquoted
;
1616 require_atom (ATOM_STRING
);
1617 unquoted
= unquote_string (atom_string
);
1618 gfc_free (atom_string
);
1624 /* Read or write a string that is in static memory. */
1627 mio_pool_string (const char **stringp
)
1629 /* TODO: one could write the string only once, and refer to it via a
1632 /* As a special case we have to deal with a NULL string. This
1633 happens for the 'module' member of 'gfc_symbol's that are not in a
1634 module. We read / write these as the empty string. */
1635 if (iomode
== IO_OUTPUT
)
1637 const char *p
= *stringp
== NULL
? "" : *stringp
;
1638 write_atom (ATOM_STRING
, p
);
1642 require_atom (ATOM_STRING
);
1643 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1644 gfc_free (atom_string
);
1649 /* Read or write a string that is inside of some already-allocated
1653 mio_internal_string (char *string
)
1655 if (iomode
== IO_OUTPUT
)
1656 write_atom (ATOM_STRING
, string
);
1659 require_atom (ATOM_STRING
);
1660 strcpy (string
, atom_string
);
1661 gfc_free (atom_string
);
1667 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1668 AB_POINTER
, AB_TARGET
, AB_DUMMY
, AB_RESULT
, AB_DATA
,
1669 AB_IN_NAMELIST
, AB_IN_COMMON
, AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
,
1670 AB_ELEMENTAL
, AB_PURE
, AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
,
1671 AB_CRAY_POINTER
, AB_CRAY_POINTEE
, AB_THREADPRIVATE
, AB_ALLOC_COMP
,
1672 AB_POINTER_COMP
, AB_PRIVATE_COMP
, AB_VALUE
, AB_VOLATILE
, AB_PROTECTED
,
1673 AB_IS_BIND_C
, AB_IS_C_INTEROP
, AB_IS_ISO_C
, AB_ABSTRACT
, AB_ZERO_COMP
,
1674 AB_IS_CLASS
, AB_PROCEDURE
, AB_PROC_POINTER
, AB_ASYNCHRONOUS
1678 static const mstring attr_bits
[] =
1680 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1681 minit ("ASYNCHRONOUS", AB_ASYNCHRONOUS
),
1682 minit ("DIMENSION", AB_DIMENSION
),
1683 minit ("EXTERNAL", AB_EXTERNAL
),
1684 minit ("INTRINSIC", AB_INTRINSIC
),
1685 minit ("OPTIONAL", AB_OPTIONAL
),
1686 minit ("POINTER", AB_POINTER
),
1687 minit ("VOLATILE", AB_VOLATILE
),
1688 minit ("TARGET", AB_TARGET
),
1689 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1690 minit ("DUMMY", AB_DUMMY
),
1691 minit ("RESULT", AB_RESULT
),
1692 minit ("DATA", AB_DATA
),
1693 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1694 minit ("IN_COMMON", AB_IN_COMMON
),
1695 minit ("FUNCTION", AB_FUNCTION
),
1696 minit ("SUBROUTINE", AB_SUBROUTINE
),
1697 minit ("SEQUENCE", AB_SEQUENCE
),
1698 minit ("ELEMENTAL", AB_ELEMENTAL
),
1699 minit ("PURE", AB_PURE
),
1700 minit ("RECURSIVE", AB_RECURSIVE
),
1701 minit ("GENERIC", AB_GENERIC
),
1702 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1703 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1704 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1705 minit ("IS_BIND_C", AB_IS_BIND_C
),
1706 minit ("IS_C_INTEROP", AB_IS_C_INTEROP
),
1707 minit ("IS_ISO_C", AB_IS_ISO_C
),
1708 minit ("VALUE", AB_VALUE
),
1709 minit ("ALLOC_COMP", AB_ALLOC_COMP
),
1710 minit ("POINTER_COMP", AB_POINTER_COMP
),
1711 minit ("PRIVATE_COMP", AB_PRIVATE_COMP
),
1712 minit ("ZERO_COMP", AB_ZERO_COMP
),
1713 minit ("PROTECTED", AB_PROTECTED
),
1714 minit ("ABSTRACT", AB_ABSTRACT
),
1715 minit ("IS_CLASS", AB_IS_CLASS
),
1716 minit ("PROCEDURE", AB_PROCEDURE
),
1717 minit ("PROC_POINTER", AB_PROC_POINTER
),
1721 /* For binding attributes. */
1722 static const mstring binding_passing
[] =
1725 minit ("NOPASS", 1),
1728 static const mstring binding_overriding
[] =
1730 minit ("OVERRIDABLE", 0),
1731 minit ("NON_OVERRIDABLE", 1),
1732 minit ("DEFERRED", 2),
1735 static const mstring binding_generic
[] =
1737 minit ("SPECIFIC", 0),
1738 minit ("GENERIC", 1),
1741 static const mstring binding_ppc
[] =
1743 minit ("NO_PPC", 0),
1748 /* Specialization of mio_name. */
1749 DECL_MIO_NAME (ab_attribute
)
1750 DECL_MIO_NAME (ar_type
)
1751 DECL_MIO_NAME (array_type
)
1753 DECL_MIO_NAME (expr_t
)
1754 DECL_MIO_NAME (gfc_access
)
1755 DECL_MIO_NAME (gfc_intrinsic_op
)
1756 DECL_MIO_NAME (ifsrc
)
1757 DECL_MIO_NAME (save_state
)
1758 DECL_MIO_NAME (procedure_type
)
1759 DECL_MIO_NAME (ref_type
)
1760 DECL_MIO_NAME (sym_flavor
)
1761 DECL_MIO_NAME (sym_intent
)
1762 #undef DECL_MIO_NAME
1764 /* Symbol attributes are stored in list with the first three elements
1765 being the enumerated fields, while the remaining elements (if any)
1766 indicate the individual attribute bits. The access field is not
1767 saved-- it controls what symbols are exported when a module is
1771 mio_symbol_attribute (symbol_attribute
*attr
)
1774 unsigned ext_attr
,extension_level
;
1778 attr
->flavor
= MIO_NAME (sym_flavor
) (attr
->flavor
, flavors
);
1779 attr
->intent
= MIO_NAME (sym_intent
) (attr
->intent
, intents
);
1780 attr
->proc
= MIO_NAME (procedure_type
) (attr
->proc
, procedures
);
1781 attr
->if_source
= MIO_NAME (ifsrc
) (attr
->if_source
, ifsrc_types
);
1782 attr
->save
= MIO_NAME (save_state
) (attr
->save
, save_status
);
1784 ext_attr
= attr
->ext_attr
;
1785 mio_integer ((int *) &ext_attr
);
1786 attr
->ext_attr
= ext_attr
;
1788 extension_level
= attr
->extension
;
1789 mio_integer ((int *) &extension_level
);
1790 attr
->extension
= extension_level
;
1792 if (iomode
== IO_OUTPUT
)
1794 if (attr
->allocatable
)
1795 MIO_NAME (ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1796 if (attr
->asynchronous
)
1797 MIO_NAME (ab_attribute
) (AB_ASYNCHRONOUS
, attr_bits
);
1798 if (attr
->dimension
)
1799 MIO_NAME (ab_attribute
) (AB_DIMENSION
, attr_bits
);
1801 MIO_NAME (ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1802 if (attr
->intrinsic
)
1803 MIO_NAME (ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1805 MIO_NAME (ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1807 MIO_NAME (ab_attribute
) (AB_POINTER
, attr_bits
);
1808 if (attr
->is_protected
)
1809 MIO_NAME (ab_attribute
) (AB_PROTECTED
, attr_bits
);
1811 MIO_NAME (ab_attribute
) (AB_VALUE
, attr_bits
);
1812 if (attr
->volatile_
)
1813 MIO_NAME (ab_attribute
) (AB_VOLATILE
, attr_bits
);
1815 MIO_NAME (ab_attribute
) (AB_TARGET
, attr_bits
);
1816 if (attr
->threadprivate
)
1817 MIO_NAME (ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1819 MIO_NAME (ab_attribute
) (AB_DUMMY
, attr_bits
);
1821 MIO_NAME (ab_attribute
) (AB_RESULT
, attr_bits
);
1822 /* We deliberately don't preserve the "entry" flag. */
1825 MIO_NAME (ab_attribute
) (AB_DATA
, attr_bits
);
1826 if (attr
->in_namelist
)
1827 MIO_NAME (ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1828 if (attr
->in_common
)
1829 MIO_NAME (ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1832 MIO_NAME (ab_attribute
) (AB_FUNCTION
, attr_bits
);
1833 if (attr
->subroutine
)
1834 MIO_NAME (ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1836 MIO_NAME (ab_attribute
) (AB_GENERIC
, attr_bits
);
1838 MIO_NAME (ab_attribute
) (AB_ABSTRACT
, attr_bits
);
1841 MIO_NAME (ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1842 if (attr
->elemental
)
1843 MIO_NAME (ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1845 MIO_NAME (ab_attribute
) (AB_PURE
, attr_bits
);
1846 if (attr
->recursive
)
1847 MIO_NAME (ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1848 if (attr
->always_explicit
)
1849 MIO_NAME (ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1850 if (attr
->cray_pointer
)
1851 MIO_NAME (ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1852 if (attr
->cray_pointee
)
1853 MIO_NAME (ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1854 if (attr
->is_bind_c
)
1855 MIO_NAME(ab_attribute
) (AB_IS_BIND_C
, attr_bits
);
1856 if (attr
->is_c_interop
)
1857 MIO_NAME(ab_attribute
) (AB_IS_C_INTEROP
, attr_bits
);
1859 MIO_NAME(ab_attribute
) (AB_IS_ISO_C
, attr_bits
);
1860 if (attr
->alloc_comp
)
1861 MIO_NAME (ab_attribute
) (AB_ALLOC_COMP
, attr_bits
);
1862 if (attr
->pointer_comp
)
1863 MIO_NAME (ab_attribute
) (AB_POINTER_COMP
, attr_bits
);
1864 if (attr
->private_comp
)
1865 MIO_NAME (ab_attribute
) (AB_PRIVATE_COMP
, attr_bits
);
1866 if (attr
->zero_comp
)
1867 MIO_NAME (ab_attribute
) (AB_ZERO_COMP
, attr_bits
);
1869 MIO_NAME (ab_attribute
) (AB_IS_CLASS
, attr_bits
);
1870 if (attr
->procedure
)
1871 MIO_NAME (ab_attribute
) (AB_PROCEDURE
, attr_bits
);
1872 if (attr
->proc_pointer
)
1873 MIO_NAME (ab_attribute
) (AB_PROC_POINTER
, attr_bits
);
1883 if (t
== ATOM_RPAREN
)
1886 bad_module ("Expected attribute bit name");
1888 switch ((ab_attribute
) find_enum (attr_bits
))
1890 case AB_ALLOCATABLE
:
1891 attr
->allocatable
= 1;
1893 case AB_ASYNCHRONOUS
:
1894 attr
->asynchronous
= 1;
1897 attr
->dimension
= 1;
1903 attr
->intrinsic
= 1;
1912 attr
->is_protected
= 1;
1918 attr
->volatile_
= 1;
1923 case AB_THREADPRIVATE
:
1924 attr
->threadprivate
= 1;
1935 case AB_IN_NAMELIST
:
1936 attr
->in_namelist
= 1;
1939 attr
->in_common
= 1;
1945 attr
->subroutine
= 1;
1957 attr
->elemental
= 1;
1963 attr
->recursive
= 1;
1965 case AB_ALWAYS_EXPLICIT
:
1966 attr
->always_explicit
= 1;
1968 case AB_CRAY_POINTER
:
1969 attr
->cray_pointer
= 1;
1971 case AB_CRAY_POINTEE
:
1972 attr
->cray_pointee
= 1;
1975 attr
->is_bind_c
= 1;
1977 case AB_IS_C_INTEROP
:
1978 attr
->is_c_interop
= 1;
1984 attr
->alloc_comp
= 1;
1986 case AB_POINTER_COMP
:
1987 attr
->pointer_comp
= 1;
1989 case AB_PRIVATE_COMP
:
1990 attr
->private_comp
= 1;
1993 attr
->zero_comp
= 1;
1999 attr
->procedure
= 1;
2001 case AB_PROC_POINTER
:
2002 attr
->proc_pointer
= 1;
2010 static const mstring bt_types
[] = {
2011 minit ("INTEGER", BT_INTEGER
),
2012 minit ("REAL", BT_REAL
),
2013 minit ("COMPLEX", BT_COMPLEX
),
2014 minit ("LOGICAL", BT_LOGICAL
),
2015 minit ("CHARACTER", BT_CHARACTER
),
2016 minit ("DERIVED", BT_DERIVED
),
2017 minit ("CLASS", BT_CLASS
),
2018 minit ("PROCEDURE", BT_PROCEDURE
),
2019 minit ("UNKNOWN", BT_UNKNOWN
),
2020 minit ("VOID", BT_VOID
),
2026 mio_charlen (gfc_charlen
**clp
)
2032 if (iomode
== IO_OUTPUT
)
2036 mio_expr (&cl
->length
);
2040 if (peek_atom () != ATOM_RPAREN
)
2042 cl
= gfc_new_charlen (gfc_current_ns
, NULL
);
2043 mio_expr (&cl
->length
);
2052 /* See if a name is a generated name. */
2055 check_unique_name (const char *name
)
2057 return *name
== '@';
2062 mio_typespec (gfc_typespec
*ts
)
2066 ts
->type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2068 if (ts
->type
!= BT_DERIVED
&& ts
->type
!= BT_CLASS
)
2069 mio_integer (&ts
->kind
);
2071 mio_symbol_ref (&ts
->u
.derived
);
2073 /* Add info for C interop and is_iso_c. */
2074 mio_integer (&ts
->is_c_interop
);
2075 mio_integer (&ts
->is_iso_c
);
2077 /* If the typespec is for an identifier either from iso_c_binding, or
2078 a constant that was initialized to an identifier from it, use the
2079 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
2081 ts
->f90_type
= MIO_NAME (bt
) (ts
->f90_type
, bt_types
);
2083 ts
->f90_type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2085 if (ts
->type
!= BT_CHARACTER
)
2087 /* ts->u.cl is only valid for BT_CHARACTER. */
2092 mio_charlen (&ts
->u
.cl
);
2098 static const mstring array_spec_types
[] = {
2099 minit ("EXPLICIT", AS_EXPLICIT
),
2100 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
2101 minit ("DEFERRED", AS_DEFERRED
),
2102 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
2108 mio_array_spec (gfc_array_spec
**asp
)
2115 if (iomode
== IO_OUTPUT
)
2123 if (peek_atom () == ATOM_RPAREN
)
2129 *asp
= as
= gfc_get_array_spec ();
2132 mio_integer (&as
->rank
);
2133 as
->type
= MIO_NAME (array_type
) (as
->type
, array_spec_types
);
2135 for (i
= 0; i
< as
->rank
; i
++)
2137 mio_expr (&as
->lower
[i
]);
2138 mio_expr (&as
->upper
[i
]);
2146 /* Given a pointer to an array reference structure (which lives in a
2147 gfc_ref structure), find the corresponding array specification
2148 structure. Storing the pointer in the ref structure doesn't quite
2149 work when loading from a module. Generating code for an array
2150 reference also needs more information than just the array spec. */
2152 static const mstring array_ref_types
[] = {
2153 minit ("FULL", AR_FULL
),
2154 minit ("ELEMENT", AR_ELEMENT
),
2155 minit ("SECTION", AR_SECTION
),
2161 mio_array_ref (gfc_array_ref
*ar
)
2166 ar
->type
= MIO_NAME (ar_type
) (ar
->type
, array_ref_types
);
2167 mio_integer (&ar
->dimen
);
2175 for (i
= 0; i
< ar
->dimen
; i
++)
2176 mio_expr (&ar
->start
[i
]);
2181 for (i
= 0; i
< ar
->dimen
; i
++)
2183 mio_expr (&ar
->start
[i
]);
2184 mio_expr (&ar
->end
[i
]);
2185 mio_expr (&ar
->stride
[i
]);
2191 gfc_internal_error ("mio_array_ref(): Unknown array ref");
2194 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
2195 we can't call mio_integer directly. Instead loop over each element
2196 and cast it to/from an integer. */
2197 if (iomode
== IO_OUTPUT
)
2199 for (i
= 0; i
< ar
->dimen
; i
++)
2201 int tmp
= (int)ar
->dimen_type
[i
];
2202 write_atom (ATOM_INTEGER
, &tmp
);
2207 for (i
= 0; i
< ar
->dimen
; i
++)
2209 require_atom (ATOM_INTEGER
);
2210 ar
->dimen_type
[i
] = (enum gfc_array_ref_dimen_type
) atom_int
;
2214 if (iomode
== IO_INPUT
)
2216 ar
->where
= gfc_current_locus
;
2218 for (i
= 0; i
< ar
->dimen
; i
++)
2219 ar
->c_where
[i
] = gfc_current_locus
;
2226 /* Saves or restores a pointer. The pointer is converted back and
2227 forth from an integer. We return the pointer_info pointer so that
2228 the caller can take additional action based on the pointer type. */
2230 static pointer_info
*
2231 mio_pointer_ref (void *gp
)
2235 if (iomode
== IO_OUTPUT
)
2237 p
= get_pointer (*((char **) gp
));
2238 write_atom (ATOM_INTEGER
, &p
->integer
);
2242 require_atom (ATOM_INTEGER
);
2243 p
= add_fixup (atom_int
, gp
);
2250 /* Save and load references to components that occur within
2251 expressions. We have to describe these references by a number and
2252 by name. The number is necessary for forward references during
2253 reading, and the name is necessary if the symbol already exists in
2254 the namespace and is not loaded again. */
2257 mio_component_ref (gfc_component
**cp
, gfc_symbol
*sym
)
2259 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2263 p
= mio_pointer_ref (cp
);
2264 if (p
->type
== P_UNKNOWN
)
2265 p
->type
= P_COMPONENT
;
2267 if (iomode
== IO_OUTPUT
)
2268 mio_pool_string (&(*cp
)->name
);
2271 mio_internal_string (name
);
2273 /* It can happen that a component reference can be read before the
2274 associated derived type symbol has been loaded. Return now and
2275 wait for a later iteration of load_needed. */
2279 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
2281 /* Symbol already loaded, so search by name. */
2282 for (q
= sym
->components
; q
; q
= q
->next
)
2283 if (strcmp (q
->name
, name
) == 0)
2287 gfc_internal_error ("mio_component_ref(): Component not found");
2289 associate_integer_pointer (p
, q
);
2292 /* Make sure this symbol will eventually be loaded. */
2293 p
= find_pointer2 (sym
);
2294 if (p
->u
.rsym
.state
== UNUSED
)
2295 p
->u
.rsym
.state
= NEEDED
;
2300 static void mio_namespace_ref (gfc_namespace
**nsp
);
2301 static void mio_formal_arglist (gfc_formal_arglist
**formal
);
2302 static void mio_typebound_proc (gfc_typebound_proc
** proc
);
2305 mio_component (gfc_component
*c
)
2309 gfc_formal_arglist
*formal
;
2313 if (iomode
== IO_OUTPUT
)
2315 p
= get_pointer (c
);
2316 mio_integer (&p
->integer
);
2321 p
= get_integer (n
);
2322 associate_integer_pointer (p
, c
);
2325 if (p
->type
== P_UNKNOWN
)
2326 p
->type
= P_COMPONENT
;
2328 mio_pool_string (&c
->name
);
2329 mio_typespec (&c
->ts
);
2330 mio_array_spec (&c
->as
);
2332 mio_symbol_attribute (&c
->attr
);
2333 c
->attr
.access
= MIO_NAME (gfc_access
) (c
->attr
.access
, access_types
);
2335 mio_expr (&c
->initializer
);
2337 if (c
->attr
.proc_pointer
)
2339 if (iomode
== IO_OUTPUT
)
2342 while (formal
&& !formal
->sym
)
2343 formal
= formal
->next
;
2346 mio_namespace_ref (&formal
->sym
->ns
);
2348 mio_namespace_ref (&c
->formal_ns
);
2352 mio_namespace_ref (&c
->formal_ns
);
2353 /* TODO: if (c->formal_ns)
2355 c->formal_ns->proc_name = c;
2360 mio_formal_arglist (&c
->formal
);
2362 mio_typebound_proc (&c
->tb
);
2370 mio_component_list (gfc_component
**cp
)
2372 gfc_component
*c
, *tail
;
2376 if (iomode
== IO_OUTPUT
)
2378 for (c
= *cp
; c
; c
= c
->next
)
2388 if (peek_atom () == ATOM_RPAREN
)
2391 c
= gfc_get_component ();
2408 mio_actual_arg (gfc_actual_arglist
*a
)
2411 mio_pool_string (&a
->name
);
2412 mio_expr (&a
->expr
);
2418 mio_actual_arglist (gfc_actual_arglist
**ap
)
2420 gfc_actual_arglist
*a
, *tail
;
2424 if (iomode
== IO_OUTPUT
)
2426 for (a
= *ap
; a
; a
= a
->next
)
2436 if (peek_atom () != ATOM_LPAREN
)
2439 a
= gfc_get_actual_arglist ();
2455 /* Read and write formal argument lists. */
2458 mio_formal_arglist (gfc_formal_arglist
**formal
)
2460 gfc_formal_arglist
*f
, *tail
;
2464 if (iomode
== IO_OUTPUT
)
2466 for (f
= *formal
; f
; f
= f
->next
)
2467 mio_symbol_ref (&f
->sym
);
2471 *formal
= tail
= NULL
;
2473 while (peek_atom () != ATOM_RPAREN
)
2475 f
= gfc_get_formal_arglist ();
2476 mio_symbol_ref (&f
->sym
);
2478 if (*formal
== NULL
)
2491 /* Save or restore a reference to a symbol node. */
2494 mio_symbol_ref (gfc_symbol
**symp
)
2498 p
= mio_pointer_ref (symp
);
2499 if (p
->type
== P_UNKNOWN
)
2502 if (iomode
== IO_OUTPUT
)
2504 if (p
->u
.wsym
.state
== UNREFERENCED
)
2505 p
->u
.wsym
.state
= NEEDS_WRITE
;
2509 if (p
->u
.rsym
.state
== UNUSED
)
2510 p
->u
.rsym
.state
= NEEDED
;
2516 /* Save or restore a reference to a symtree node. */
2519 mio_symtree_ref (gfc_symtree
**stp
)
2524 if (iomode
== IO_OUTPUT
)
2525 mio_symbol_ref (&(*stp
)->n
.sym
);
2528 require_atom (ATOM_INTEGER
);
2529 p
= get_integer (atom_int
);
2531 /* An unused equivalence member; make a symbol and a symtree
2533 if (in_load_equiv
&& p
->u
.rsym
.symtree
== NULL
)
2535 /* Since this is not used, it must have a unique name. */
2536 p
->u
.rsym
.symtree
= gfc_get_unique_symtree (gfc_current_ns
);
2538 /* Make the symbol. */
2539 if (p
->u
.rsym
.sym
== NULL
)
2541 p
->u
.rsym
.sym
= gfc_new_symbol (p
->u
.rsym
.true_name
,
2543 p
->u
.rsym
.sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
2546 p
->u
.rsym
.symtree
->n
.sym
= p
->u
.rsym
.sym
;
2547 p
->u
.rsym
.symtree
->n
.sym
->refs
++;
2548 p
->u
.rsym
.referenced
= 1;
2550 /* If the symbol is PRIVATE and in COMMON, load_commons will
2551 generate a fixup symbol, which must be associated. */
2553 resolve_fixups (p
->fixup
, p
->u
.rsym
.sym
);
2557 if (p
->type
== P_UNKNOWN
)
2560 if (p
->u
.rsym
.state
== UNUSED
)
2561 p
->u
.rsym
.state
= NEEDED
;
2563 if (p
->u
.rsym
.symtree
!= NULL
)
2565 *stp
= p
->u
.rsym
.symtree
;
2569 f
= XCNEW (fixup_t
);
2571 f
->next
= p
->u
.rsym
.stfixup
;
2572 p
->u
.rsym
.stfixup
= f
;
2574 f
->pointer
= (void **) stp
;
2581 mio_iterator (gfc_iterator
**ip
)
2587 if (iomode
== IO_OUTPUT
)
2594 if (peek_atom () == ATOM_RPAREN
)
2600 *ip
= gfc_get_iterator ();
2605 mio_expr (&iter
->var
);
2606 mio_expr (&iter
->start
);
2607 mio_expr (&iter
->end
);
2608 mio_expr (&iter
->step
);
2616 mio_constructor (gfc_constructor
**cp
)
2618 gfc_constructor
*c
, *tail
;
2622 if (iomode
== IO_OUTPUT
)
2624 for (c
= *cp
; c
; c
= c
->next
)
2627 mio_expr (&c
->expr
);
2628 mio_iterator (&c
->iterator
);
2637 while (peek_atom () != ATOM_RPAREN
)
2639 c
= gfc_get_constructor ();
2649 mio_expr (&c
->expr
);
2650 mio_iterator (&c
->iterator
);
2659 static const mstring ref_types
[] = {
2660 minit ("ARRAY", REF_ARRAY
),
2661 minit ("COMPONENT", REF_COMPONENT
),
2662 minit ("SUBSTRING", REF_SUBSTRING
),
2668 mio_ref (gfc_ref
**rp
)
2675 r
->type
= MIO_NAME (ref_type
) (r
->type
, ref_types
);
2680 mio_array_ref (&r
->u
.ar
);
2684 mio_symbol_ref (&r
->u
.c
.sym
);
2685 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2689 mio_expr (&r
->u
.ss
.start
);
2690 mio_expr (&r
->u
.ss
.end
);
2691 mio_charlen (&r
->u
.ss
.length
);
2700 mio_ref_list (gfc_ref
**rp
)
2702 gfc_ref
*ref
, *head
, *tail
;
2706 if (iomode
== IO_OUTPUT
)
2708 for (ref
= *rp
; ref
; ref
= ref
->next
)
2715 while (peek_atom () != ATOM_RPAREN
)
2718 head
= tail
= gfc_get_ref ();
2721 tail
->next
= gfc_get_ref ();
2735 /* Read and write an integer value. */
2738 mio_gmp_integer (mpz_t
*integer
)
2742 if (iomode
== IO_INPUT
)
2744 if (parse_atom () != ATOM_STRING
)
2745 bad_module ("Expected integer string");
2747 mpz_init (*integer
);
2748 if (mpz_set_str (*integer
, atom_string
, 10))
2749 bad_module ("Error converting integer");
2751 gfc_free (atom_string
);
2755 p
= mpz_get_str (NULL
, 10, *integer
);
2756 write_atom (ATOM_STRING
, p
);
2763 mio_gmp_real (mpfr_t
*real
)
2768 if (iomode
== IO_INPUT
)
2770 if (parse_atom () != ATOM_STRING
)
2771 bad_module ("Expected real string");
2774 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2775 gfc_free (atom_string
);
2779 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2781 if (mpfr_nan_p (*real
) || mpfr_inf_p (*real
))
2783 write_atom (ATOM_STRING
, p
);
2788 atom_string
= XCNEWVEC (char, strlen (p
) + 20);
2790 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2792 /* Fix negative numbers. */
2793 if (atom_string
[2] == '-')
2795 atom_string
[0] = '-';
2796 atom_string
[1] = '0';
2797 atom_string
[2] = '.';
2800 write_atom (ATOM_STRING
, atom_string
);
2802 gfc_free (atom_string
);
2808 /* Save and restore the shape of an array constructor. */
2811 mio_shape (mpz_t
**pshape
, int rank
)
2817 /* A NULL shape is represented by (). */
2820 if (iomode
== IO_OUTPUT
)
2832 if (t
== ATOM_RPAREN
)
2839 shape
= gfc_get_shape (rank
);
2843 for (n
= 0; n
< rank
; n
++)
2844 mio_gmp_integer (&shape
[n
]);
2850 static const mstring expr_types
[] = {
2851 minit ("OP", EXPR_OP
),
2852 minit ("FUNCTION", EXPR_FUNCTION
),
2853 minit ("CONSTANT", EXPR_CONSTANT
),
2854 minit ("VARIABLE", EXPR_VARIABLE
),
2855 minit ("SUBSTRING", EXPR_SUBSTRING
),
2856 minit ("STRUCTURE", EXPR_STRUCTURE
),
2857 minit ("ARRAY", EXPR_ARRAY
),
2858 minit ("NULL", EXPR_NULL
),
2859 minit ("COMPCALL", EXPR_COMPCALL
),
2863 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2864 generic operators, not in expressions. INTRINSIC_USER is also
2865 replaced by the correct function name by the time we see it. */
2867 static const mstring intrinsics
[] =
2869 minit ("UPLUS", INTRINSIC_UPLUS
),
2870 minit ("UMINUS", INTRINSIC_UMINUS
),
2871 minit ("PLUS", INTRINSIC_PLUS
),
2872 minit ("MINUS", INTRINSIC_MINUS
),
2873 minit ("TIMES", INTRINSIC_TIMES
),
2874 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2875 minit ("POWER", INTRINSIC_POWER
),
2876 minit ("CONCAT", INTRINSIC_CONCAT
),
2877 minit ("AND", INTRINSIC_AND
),
2878 minit ("OR", INTRINSIC_OR
),
2879 minit ("EQV", INTRINSIC_EQV
),
2880 minit ("NEQV", INTRINSIC_NEQV
),
2881 minit ("EQ_SIGN", INTRINSIC_EQ
),
2882 minit ("EQ", INTRINSIC_EQ_OS
),
2883 minit ("NE_SIGN", INTRINSIC_NE
),
2884 minit ("NE", INTRINSIC_NE_OS
),
2885 minit ("GT_SIGN", INTRINSIC_GT
),
2886 minit ("GT", INTRINSIC_GT_OS
),
2887 minit ("GE_SIGN", INTRINSIC_GE
),
2888 minit ("GE", INTRINSIC_GE_OS
),
2889 minit ("LT_SIGN", INTRINSIC_LT
),
2890 minit ("LT", INTRINSIC_LT_OS
),
2891 minit ("LE_SIGN", INTRINSIC_LE
),
2892 minit ("LE", INTRINSIC_LE_OS
),
2893 minit ("NOT", INTRINSIC_NOT
),
2894 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2899 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2902 fix_mio_expr (gfc_expr
*e
)
2904 gfc_symtree
*ns_st
= NULL
;
2907 if (iomode
!= IO_OUTPUT
)
2912 /* If this is a symtree for a symbol that came from a contained module
2913 namespace, it has a unique name and we should look in the current
2914 namespace to see if the required, non-contained symbol is available
2915 yet. If so, the latter should be written. */
2916 if (e
->symtree
->n
.sym
&& check_unique_name (e
->symtree
->name
))
2917 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2918 e
->symtree
->n
.sym
->name
);
2920 /* On the other hand, if the existing symbol is the module name or the
2921 new symbol is a dummy argument, do not do the promotion. */
2922 if (ns_st
&& ns_st
->n
.sym
2923 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2924 && !e
->symtree
->n
.sym
->attr
.dummy
)
2927 else if (e
->expr_type
== EXPR_FUNCTION
&& e
->value
.function
.name
)
2929 /* In some circumstances, a function used in an initialization
2930 expression, in one use associated module, can fail to be
2931 coupled to its symtree when used in a specification
2932 expression in another module. */
2933 fname
= e
->value
.function
.esym
? e
->value
.function
.esym
->name
2934 : e
->value
.function
.isym
->name
;
2935 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2940 /* Read and write expressions. The form "()" is allowed to indicate a
2944 mio_expr (gfc_expr
**ep
)
2952 if (iomode
== IO_OUTPUT
)
2961 MIO_NAME (expr_t
) (e
->expr_type
, expr_types
);
2966 if (t
== ATOM_RPAREN
)
2973 bad_module ("Expected expression type");
2975 e
= *ep
= gfc_get_expr ();
2976 e
->where
= gfc_current_locus
;
2977 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2980 mio_typespec (&e
->ts
);
2981 mio_integer (&e
->rank
);
2985 switch (e
->expr_type
)
2989 = MIO_NAME (gfc_intrinsic_op
) (e
->value
.op
.op
, intrinsics
);
2991 switch (e
->value
.op
.op
)
2993 case INTRINSIC_UPLUS
:
2994 case INTRINSIC_UMINUS
:
2996 case INTRINSIC_PARENTHESES
:
2997 mio_expr (&e
->value
.op
.op1
);
3000 case INTRINSIC_PLUS
:
3001 case INTRINSIC_MINUS
:
3002 case INTRINSIC_TIMES
:
3003 case INTRINSIC_DIVIDE
:
3004 case INTRINSIC_POWER
:
3005 case INTRINSIC_CONCAT
:
3009 case INTRINSIC_NEQV
:
3011 case INTRINSIC_EQ_OS
:
3013 case INTRINSIC_NE_OS
:
3015 case INTRINSIC_GT_OS
:
3017 case INTRINSIC_GE_OS
:
3019 case INTRINSIC_LT_OS
:
3021 case INTRINSIC_LE_OS
:
3022 mio_expr (&e
->value
.op
.op1
);
3023 mio_expr (&e
->value
.op
.op2
);
3027 bad_module ("Bad operator");
3033 mio_symtree_ref (&e
->symtree
);
3034 mio_actual_arglist (&e
->value
.function
.actual
);
3036 if (iomode
== IO_OUTPUT
)
3038 e
->value
.function
.name
3039 = mio_allocated_string (e
->value
.function
.name
);
3040 flag
= e
->value
.function
.esym
!= NULL
;
3041 mio_integer (&flag
);
3043 mio_symbol_ref (&e
->value
.function
.esym
);
3045 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
3049 require_atom (ATOM_STRING
);
3050 e
->value
.function
.name
= gfc_get_string (atom_string
);
3051 gfc_free (atom_string
);
3053 mio_integer (&flag
);
3055 mio_symbol_ref (&e
->value
.function
.esym
);
3058 require_atom (ATOM_STRING
);
3059 e
->value
.function
.isym
= gfc_find_function (atom_string
);
3060 gfc_free (atom_string
);
3067 mio_symtree_ref (&e
->symtree
);
3068 mio_ref_list (&e
->ref
);
3071 case EXPR_SUBSTRING
:
3072 e
->value
.character
.string
3073 = CONST_CAST (gfc_char_t
*,
3074 mio_allocated_wide_string (e
->value
.character
.string
,
3075 e
->value
.character
.length
));
3076 mio_ref_list (&e
->ref
);
3079 case EXPR_STRUCTURE
:
3081 mio_constructor (&e
->value
.constructor
);
3082 mio_shape (&e
->shape
, e
->rank
);
3089 mio_gmp_integer (&e
->value
.integer
);
3093 gfc_set_model_kind (e
->ts
.kind
);
3094 mio_gmp_real (&e
->value
.real
);
3098 gfc_set_model_kind (e
->ts
.kind
);
3099 mio_gmp_real (&mpc_realref (e
->value
.complex));
3100 mio_gmp_real (&mpc_imagref (e
->value
.complex));
3104 mio_integer (&e
->value
.logical
);
3108 mio_integer (&e
->value
.character
.length
);
3109 e
->value
.character
.string
3110 = CONST_CAST (gfc_char_t
*,
3111 mio_allocated_wide_string (e
->value
.character
.string
,
3112 e
->value
.character
.length
));
3116 bad_module ("Bad type in constant expression");
3134 /* Read and write namelists. */
3137 mio_namelist (gfc_symbol
*sym
)
3139 gfc_namelist
*n
, *m
;
3140 const char *check_name
;
3144 if (iomode
== IO_OUTPUT
)
3146 for (n
= sym
->namelist
; n
; n
= n
->next
)
3147 mio_symbol_ref (&n
->sym
);
3151 /* This departure from the standard is flagged as an error.
3152 It does, in fact, work correctly. TODO: Allow it
3154 if (sym
->attr
.flavor
== FL_NAMELIST
)
3156 check_name
= find_use_name (sym
->name
, false);
3157 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
3158 gfc_error ("Namelist %s cannot be renamed by USE "
3159 "association to %s", sym
->name
, check_name
);
3163 while (peek_atom () != ATOM_RPAREN
)
3165 n
= gfc_get_namelist ();
3166 mio_symbol_ref (&n
->sym
);
3168 if (sym
->namelist
== NULL
)
3175 sym
->namelist_tail
= m
;
3182 /* Save/restore lists of gfc_interface structures. When loading an
3183 interface, we are really appending to the existing list of
3184 interfaces. Checking for duplicate and ambiguous interfaces has to
3185 be done later when all symbols have been loaded. */
3188 mio_interface_rest (gfc_interface
**ip
)
3190 gfc_interface
*tail
, *p
;
3191 pointer_info
*pi
= NULL
;
3193 if (iomode
== IO_OUTPUT
)
3196 for (p
= *ip
; p
; p
= p
->next
)
3197 mio_symbol_ref (&p
->sym
);
3212 if (peek_atom () == ATOM_RPAREN
)
3215 p
= gfc_get_interface ();
3216 p
->where
= gfc_current_locus
;
3217 pi
= mio_symbol_ref (&p
->sym
);
3233 /* Save/restore a nameless operator interface. */
3236 mio_interface (gfc_interface
**ip
)
3239 mio_interface_rest (ip
);
3243 /* Save/restore a named operator interface. */
3246 mio_symbol_interface (const char **name
, const char **module
,
3250 mio_pool_string (name
);
3251 mio_pool_string (module
);
3252 mio_interface_rest (ip
);
3257 mio_namespace_ref (gfc_namespace
**nsp
)
3262 p
= mio_pointer_ref (nsp
);
3264 if (p
->type
== P_UNKNOWN
)
3265 p
->type
= P_NAMESPACE
;
3267 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
3269 ns
= (gfc_namespace
*) p
->u
.pointer
;
3272 ns
= gfc_get_namespace (NULL
, 0);
3273 associate_integer_pointer (p
, ns
);
3281 /* Save/restore the f2k_derived namespace of a derived-type symbol. */
3283 static gfc_namespace
* current_f2k_derived
;
3286 mio_typebound_proc (gfc_typebound_proc
** proc
)
3289 int overriding_flag
;
3291 if (iomode
== IO_INPUT
)
3293 *proc
= gfc_get_typebound_proc ();
3294 (*proc
)->where
= gfc_current_locus
;
3300 (*proc
)->access
= MIO_NAME (gfc_access
) ((*proc
)->access
, access_types
);
3302 /* IO the NON_OVERRIDABLE/DEFERRED combination. */
3303 gcc_assert (!((*proc
)->deferred
&& (*proc
)->non_overridable
));
3304 overriding_flag
= ((*proc
)->deferred
<< 1) | (*proc
)->non_overridable
;
3305 overriding_flag
= mio_name (overriding_flag
, binding_overriding
);
3306 (*proc
)->deferred
= ((overriding_flag
& 2) != 0);
3307 (*proc
)->non_overridable
= ((overriding_flag
& 1) != 0);
3308 gcc_assert (!((*proc
)->deferred
&& (*proc
)->non_overridable
));
3310 (*proc
)->nopass
= mio_name ((*proc
)->nopass
, binding_passing
);
3311 (*proc
)->is_generic
= mio_name ((*proc
)->is_generic
, binding_generic
);
3312 (*proc
)->ppc
= mio_name((*proc
)->ppc
, binding_ppc
);
3314 mio_pool_string (&((*proc
)->pass_arg
));
3316 flag
= (int) (*proc
)->pass_arg_num
;
3317 mio_integer (&flag
);
3318 (*proc
)->pass_arg_num
= (unsigned) flag
;
3320 if ((*proc
)->is_generic
)
3326 if (iomode
== IO_OUTPUT
)
3327 for (g
= (*proc
)->u
.generic
; g
; g
= g
->next
)
3328 mio_allocated_string (g
->specific_st
->name
);
3331 (*proc
)->u
.generic
= NULL
;
3332 while (peek_atom () != ATOM_RPAREN
)
3334 gfc_symtree
** sym_root
;
3336 g
= gfc_get_tbp_generic ();
3339 require_atom (ATOM_STRING
);
3340 sym_root
= ¤t_f2k_derived
->tb_sym_root
;
3341 g
->specific_st
= gfc_get_tbp_symtree (sym_root
, atom_string
);
3342 gfc_free (atom_string
);
3344 g
->next
= (*proc
)->u
.generic
;
3345 (*proc
)->u
.generic
= g
;
3351 else if (!(*proc
)->ppc
)
3352 mio_symtree_ref (&(*proc
)->u
.specific
);
3357 /* Walker-callback function for this purpose. */
3359 mio_typebound_symtree (gfc_symtree
* st
)
3361 if (iomode
== IO_OUTPUT
&& !st
->n
.tb
)
3364 if (iomode
== IO_OUTPUT
)
3367 mio_allocated_string (st
->name
);
3369 /* For IO_INPUT, the above is done in mio_f2k_derived. */
3371 mio_typebound_proc (&st
->n
.tb
);
3375 /* IO a full symtree (in all depth). */
3377 mio_full_typebound_tree (gfc_symtree
** root
)
3381 if (iomode
== IO_OUTPUT
)
3382 gfc_traverse_symtree (*root
, &mio_typebound_symtree
);
3385 while (peek_atom () == ATOM_LPAREN
)
3391 require_atom (ATOM_STRING
);
3392 st
= gfc_get_tbp_symtree (root
, atom_string
);
3393 gfc_free (atom_string
);
3395 mio_typebound_symtree (st
);
3403 mio_finalizer (gfc_finalizer
**f
)
3405 if (iomode
== IO_OUTPUT
)
3408 gcc_assert ((*f
)->proc_tree
); /* Should already be resolved. */
3409 mio_symtree_ref (&(*f
)->proc_tree
);
3413 *f
= gfc_get_finalizer ();
3414 (*f
)->where
= gfc_current_locus
; /* Value should not matter. */
3417 mio_symtree_ref (&(*f
)->proc_tree
);
3418 (*f
)->proc_sym
= NULL
;
3423 mio_f2k_derived (gfc_namespace
*f2k
)
3425 current_f2k_derived
= f2k
;
3427 /* Handle the list of finalizer procedures. */
3429 if (iomode
== IO_OUTPUT
)
3432 for (f
= f2k
->finalizers
; f
; f
= f
->next
)
3437 f2k
->finalizers
= NULL
;
3438 while (peek_atom () != ATOM_RPAREN
)
3440 gfc_finalizer
*cur
= NULL
;
3441 mio_finalizer (&cur
);
3442 cur
->next
= f2k
->finalizers
;
3443 f2k
->finalizers
= cur
;
3448 /* Handle type-bound procedures. */
3449 mio_full_typebound_tree (&f2k
->tb_sym_root
);
3451 /* Type-bound user operators. */
3452 mio_full_typebound_tree (&f2k
->tb_uop_root
);
3454 /* Type-bound intrinsic operators. */
3456 if (iomode
== IO_OUTPUT
)
3459 for (op
= GFC_INTRINSIC_BEGIN
; op
!= GFC_INTRINSIC_END
; ++op
)
3461 gfc_intrinsic_op realop
;
3463 if (op
== INTRINSIC_USER
|| !f2k
->tb_op
[op
])
3467 realop
= (gfc_intrinsic_op
) op
;
3468 mio_intrinsic_op (&realop
);
3469 mio_typebound_proc (&f2k
->tb_op
[op
]);
3474 while (peek_atom () != ATOM_RPAREN
)
3476 gfc_intrinsic_op op
= 0; /* Silence GCC. */
3479 mio_intrinsic_op (&op
);
3480 mio_typebound_proc (&f2k
->tb_op
[op
]);
3487 mio_full_f2k_derived (gfc_symbol
*sym
)
3491 if (iomode
== IO_OUTPUT
)
3493 if (sym
->f2k_derived
)
3494 mio_f2k_derived (sym
->f2k_derived
);
3498 if (peek_atom () != ATOM_RPAREN
)
3500 sym
->f2k_derived
= gfc_get_namespace (NULL
, 0);
3501 mio_f2k_derived (sym
->f2k_derived
);
3504 gcc_assert (!sym
->f2k_derived
);
3511 /* Unlike most other routines, the address of the symbol node is already
3512 fixed on input and the name/module has already been filled in. */
3515 mio_symbol (gfc_symbol
*sym
)
3517 int intmod
= INTMOD_NONE
;
3521 mio_symbol_attribute (&sym
->attr
);
3522 mio_typespec (&sym
->ts
);
3524 if (iomode
== IO_OUTPUT
)
3525 mio_namespace_ref (&sym
->formal_ns
);
3528 mio_namespace_ref (&sym
->formal_ns
);
3531 sym
->formal_ns
->proc_name
= sym
;
3536 /* Save/restore common block links. */
3537 mio_symbol_ref (&sym
->common_next
);
3539 mio_formal_arglist (&sym
->formal
);
3541 if (sym
->attr
.flavor
== FL_PARAMETER
)
3542 mio_expr (&sym
->value
);
3544 mio_array_spec (&sym
->as
);
3546 mio_symbol_ref (&sym
->result
);
3548 if (sym
->attr
.cray_pointee
)
3549 mio_symbol_ref (&sym
->cp_pointer
);
3551 /* Note that components are always saved, even if they are supposed
3552 to be private. Component access is checked during searching. */
3554 mio_component_list (&sym
->components
);
3556 if (sym
->components
!= NULL
)
3557 sym
->component_access
3558 = MIO_NAME (gfc_access
) (sym
->component_access
, access_types
);
3560 /* Load/save the f2k_derived namespace of a derived-type symbol. */
3561 mio_full_f2k_derived (sym
);
3565 /* Add the fields that say whether this is from an intrinsic module,
3566 and if so, what symbol it is within the module. */
3567 /* mio_integer (&(sym->from_intmod)); */
3568 if (iomode
== IO_OUTPUT
)
3570 intmod
= sym
->from_intmod
;
3571 mio_integer (&intmod
);
3575 mio_integer (&intmod
);
3576 sym
->from_intmod
= (intmod_id
) intmod
;
3579 mio_integer (&(sym
->intmod_sym_id
));
3581 if (sym
->attr
.flavor
== FL_DERIVED
)
3582 mio_integer (&(sym
->hash_value
));
3588 /************************* Top level subroutines *************************/
3590 /* Given a root symtree node and a symbol, try to find a symtree that
3591 references the symbol that is not a unique name. */
3593 static gfc_symtree
*
3594 find_symtree_for_symbol (gfc_symtree
*st
, gfc_symbol
*sym
)
3596 gfc_symtree
*s
= NULL
;
3601 s
= find_symtree_for_symbol (st
->right
, sym
);
3604 s
= find_symtree_for_symbol (st
->left
, sym
);
3608 if (st
->n
.sym
== sym
&& !check_unique_name (st
->name
))
3615 /* A recursive function to look for a specific symbol by name and by
3616 module. Whilst several symtrees might point to one symbol, its
3617 is sufficient for the purposes here than one exist. Note that
3618 generic interfaces are distinguished as are symbols that have been
3619 renamed in another module. */
3620 static gfc_symtree
*
3621 find_symbol (gfc_symtree
*st
, const char *name
,
3622 const char *module
, int generic
)
3625 gfc_symtree
*retval
, *s
;
3627 if (st
== NULL
|| st
->n
.sym
== NULL
)
3630 c
= strcmp (name
, st
->n
.sym
->name
);
3631 if (c
== 0 && st
->n
.sym
->module
3632 && strcmp (module
, st
->n
.sym
->module
) == 0
3633 && !check_unique_name (st
->name
))
3635 s
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3637 /* Detect symbols that are renamed by use association in another
3638 module by the absence of a symtree and null attr.use_rename,
3639 since the latter is not transmitted in the module file. */
3640 if (((!generic
&& !st
->n
.sym
->attr
.generic
)
3641 || (generic
&& st
->n
.sym
->attr
.generic
))
3642 && !(s
== NULL
&& !st
->n
.sym
->attr
.use_rename
))
3646 retval
= find_symbol (st
->left
, name
, module
, generic
);
3649 retval
= find_symbol (st
->right
, name
, module
, generic
);
3655 /* Skip a list between balanced left and right parens. */
3665 switch (parse_atom ())
3676 gfc_free (atom_string
);
3688 /* Load operator interfaces from the module. Interfaces are unusual
3689 in that they attach themselves to existing symbols. */
3692 load_operator_interfaces (void)
3695 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3697 pointer_info
*pi
= NULL
;
3702 while (peek_atom () != ATOM_RPAREN
)
3706 mio_internal_string (name
);
3707 mio_internal_string (module
);
3709 n
= number_use_names (name
, true);
3712 for (i
= 1; i
<= n
; i
++)
3714 /* Decide if we need to load this one or not. */
3715 p
= find_use_name_n (name
, &i
, true);
3719 while (parse_atom () != ATOM_RPAREN
);
3725 uop
= gfc_get_uop (p
);
3726 pi
= mio_interface_rest (&uop
->op
);
3730 if (gfc_find_uop (p
, NULL
))
3732 uop
= gfc_get_uop (p
);
3733 uop
->op
= gfc_get_interface ();
3734 uop
->op
->where
= gfc_current_locus
;
3735 add_fixup (pi
->integer
, &uop
->op
->sym
);
3744 /* Load interfaces from the module. Interfaces are unusual in that
3745 they attach themselves to existing symbols. */
3748 load_generic_interfaces (void)
3751 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3753 gfc_interface
*generic
= NULL
;
3758 while (peek_atom () != ATOM_RPAREN
)
3762 mio_internal_string (name
);
3763 mio_internal_string (module
);
3765 n
= number_use_names (name
, false);
3766 renamed
= n
? 1 : 0;
3769 for (i
= 1; i
<= n
; i
++)
3772 /* Decide if we need to load this one or not. */
3773 p
= find_use_name_n (name
, &i
, false);
3775 st
= find_symbol (gfc_current_ns
->sym_root
,
3776 name
, module_name
, 1);
3778 if (!p
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
3780 /* Skip the specific names for these cases. */
3781 while (i
== 1 && parse_atom () != ATOM_RPAREN
);
3786 /* If the symbol exists already and is being USEd without being
3787 in an ONLY clause, do not load a new symtree(11.3.2). */
3788 if (!only_flag
&& st
)
3793 /* Make the symbol inaccessible if it has been added by a USE
3794 statement without an ONLY(11.3.2). */
3796 && !st
->n
.sym
->attr
.use_only
3797 && !st
->n
.sym
->attr
.use_rename
3798 && strcmp (st
->n
.sym
->module
, module_name
) == 0)
3801 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3802 st
= gfc_get_unique_symtree (gfc_current_ns
);
3809 if (strcmp (st
->name
, p
) != 0)
3811 st
= gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3817 /* Since we haven't found a valid generic interface, we had
3821 gfc_get_symbol (p
, NULL
, &sym
);
3822 sym
->name
= gfc_get_string (name
);
3823 sym
->module
= gfc_get_string (module_name
);
3824 sym
->attr
.flavor
= FL_PROCEDURE
;
3825 sym
->attr
.generic
= 1;
3826 sym
->attr
.use_assoc
= 1;
3831 /* Unless sym is a generic interface, this reference
3834 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3838 if (st
&& !sym
->attr
.generic
3840 && strcmp(module
, sym
->module
))
3844 sym
->attr
.use_only
= only_flag
;
3845 sym
->attr
.use_rename
= renamed
;
3849 mio_interface_rest (&sym
->generic
);
3850 generic
= sym
->generic
;
3852 else if (!sym
->generic
)
3854 sym
->generic
= generic
;
3855 sym
->attr
.generic_copy
= 1;
3864 /* Load common blocks. */
3869 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3874 while (peek_atom () != ATOM_RPAREN
)
3878 mio_internal_string (name
);
3880 p
= gfc_get_common (name
, 1);
3882 mio_symbol_ref (&p
->head
);
3883 mio_integer (&flags
);
3887 p
->threadprivate
= 1;
3890 /* Get whether this was a bind(c) common or not. */
3891 mio_integer (&p
->is_bind_c
);
3892 /* Get the binding label. */
3893 mio_internal_string (p
->binding_label
);
3902 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3903 so that unused variables are not loaded and so that the expression can
3909 gfc_equiv
*head
, *tail
, *end
, *eq
;
3913 in_load_equiv
= true;
3915 end
= gfc_current_ns
->equiv
;
3916 while (end
!= NULL
&& end
->next
!= NULL
)
3919 while (peek_atom () != ATOM_RPAREN
) {
3923 while(peek_atom () != ATOM_RPAREN
)
3926 head
= tail
= gfc_get_equiv ();
3929 tail
->eq
= gfc_get_equiv ();
3933 mio_pool_string (&tail
->module
);
3934 mio_expr (&tail
->expr
);
3937 /* Unused equivalence members have a unique name. In addition, it
3938 must be checked that the symbols are from the same module. */
3940 for (eq
= head
; eq
; eq
= eq
->eq
)
3942 if (eq
->expr
->symtree
->n
.sym
->module
3943 && head
->expr
->symtree
->n
.sym
->module
3944 && strcmp (head
->expr
->symtree
->n
.sym
->module
,
3945 eq
->expr
->symtree
->n
.sym
->module
) == 0
3946 && !check_unique_name (eq
->expr
->symtree
->name
))
3955 for (eq
= head
; eq
; eq
= head
)
3958 gfc_free_expr (eq
->expr
);
3964 gfc_current_ns
->equiv
= head
;
3975 in_load_equiv
= false;
3979 /* This function loads the sym_root of f2k_derived with the extensions to
3980 the derived type. */
3982 load_derived_extensions (void)
3985 gfc_symbol
*derived
;
3989 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3990 char module
[GFC_MAX_SYMBOL_LEN
+ 1];
3994 while (peek_atom () != ATOM_RPAREN
)
3997 mio_integer (&symbol
);
3998 info
= get_integer (symbol
);
3999 derived
= info
->u
.rsym
.sym
;
4001 /* This one is not being loaded. */
4002 if (!info
|| !derived
)
4004 while (peek_atom () != ATOM_RPAREN
)
4009 gcc_assert (derived
->attr
.flavor
== FL_DERIVED
);
4010 if (derived
->f2k_derived
== NULL
)
4011 derived
->f2k_derived
= gfc_get_namespace (NULL
, 0);
4013 while (peek_atom () != ATOM_RPAREN
)
4016 mio_internal_string (name
);
4017 mio_internal_string (module
);
4019 /* Only use one use name to find the symbol. */
4021 p
= find_use_name_n (name
, &j
, false);
4024 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
4026 st
= gfc_find_symtree (derived
->f2k_derived
->sym_root
, name
);
4029 /* Only use the real name in f2k_derived to ensure a single
4031 st
= gfc_new_symtree (&derived
->f2k_derived
->sym_root
, name
);
4044 /* Recursive function to traverse the pointer_info tree and load a
4045 needed symbol. We return nonzero if we load a symbol and stop the
4046 traversal, because the act of loading can alter the tree. */
4049 load_needed (pointer_info
*p
)
4060 rv
|= load_needed (p
->left
);
4061 rv
|= load_needed (p
->right
);
4063 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
4066 p
->u
.rsym
.state
= USED
;
4068 set_module_locus (&p
->u
.rsym
.where
);
4070 sym
= p
->u
.rsym
.sym
;
4073 q
= get_integer (p
->u
.rsym
.ns
);
4075 ns
= (gfc_namespace
*) q
->u
.pointer
;
4078 /* Create an interface namespace if necessary. These are
4079 the namespaces that hold the formal parameters of module
4082 ns
= gfc_get_namespace (NULL
, 0);
4083 associate_integer_pointer (q
, ns
);
4086 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
4087 doesn't go pear-shaped if the symbol is used. */
4089 gfc_find_symbol (p
->u
.rsym
.module
, gfc_current_ns
,
4092 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
4093 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
4094 strcpy (sym
->binding_label
, p
->u
.rsym
.binding_label
);
4096 associate_integer_pointer (p
, sym
);
4100 sym
->attr
.use_assoc
= 1;
4102 sym
->attr
.use_only
= 1;
4103 if (p
->u
.rsym
.renamed
)
4104 sym
->attr
.use_rename
= 1;
4110 /* Recursive function for cleaning up things after a module has been read. */
4113 read_cleanup (pointer_info
*p
)
4121 read_cleanup (p
->left
);
4122 read_cleanup (p
->right
);
4124 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
4126 /* Add hidden symbols to the symtree. */
4127 q
= get_integer (p
->u
.rsym
.ns
);
4128 st
= gfc_get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
4130 st
->n
.sym
= p
->u
.rsym
.sym
;
4133 /* Fixup any symtree references. */
4134 p
->u
.rsym
.symtree
= st
;
4135 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
4136 p
->u
.rsym
.stfixup
= NULL
;
4139 /* Free unused symbols. */
4140 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
4141 gfc_free_symbol (p
->u
.rsym
.sym
);
4145 /* It is not quite enough to check for ambiguity in the symbols by
4146 the loaded symbol and the new symbol not being identical. */
4148 check_for_ambiguous (gfc_symbol
*st_sym
, pointer_info
*info
)
4152 symbol_attribute attr
;
4154 rsym
= info
->u
.rsym
.sym
;
4158 /* If the existing symbol is generic from a different module and
4159 the new symbol is generic there can be no ambiguity. */
4160 if (st_sym
->attr
.generic
4162 && strcmp (st_sym
->module
, module_name
))
4164 /* The new symbol's attributes have not yet been read. Since
4165 we need attr.generic, read it directly. */
4166 get_module_locus (&locus
);
4167 set_module_locus (&info
->u
.rsym
.where
);
4170 mio_symbol_attribute (&attr
);
4171 set_module_locus (&locus
);
4180 /* Read a module file. */
4185 module_locus operator_interfaces
, user_operators
, extensions
;
4187 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
4189 int ambiguous
, j
, nuse
, symbol
;
4190 pointer_info
*info
, *q
;
4195 get_module_locus (&operator_interfaces
); /* Skip these for now. */
4198 get_module_locus (&user_operators
);
4202 /* Skip commons, equivalences and derived type extensions for now. */
4206 get_module_locus (&extensions
);
4211 /* Create the fixup nodes for all the symbols. */
4213 while (peek_atom () != ATOM_RPAREN
)
4215 require_atom (ATOM_INTEGER
);
4216 info
= get_integer (atom_int
);
4218 info
->type
= P_SYMBOL
;
4219 info
->u
.rsym
.state
= UNUSED
;
4221 mio_internal_string (info
->u
.rsym
.true_name
);
4222 mio_internal_string (info
->u
.rsym
.module
);
4223 mio_internal_string (info
->u
.rsym
.binding_label
);
4226 require_atom (ATOM_INTEGER
);
4227 info
->u
.rsym
.ns
= atom_int
;
4229 get_module_locus (&info
->u
.rsym
.where
);
4232 /* See if the symbol has already been loaded by a previous module.
4233 If so, we reference the existing symbol and prevent it from
4234 being loaded again. This should not happen if the symbol being
4235 read is an index for an assumed shape dummy array (ns != 1). */
4237 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
4240 || (sym
->attr
.flavor
== FL_VARIABLE
&& info
->u
.rsym
.ns
!=1))
4243 info
->u
.rsym
.state
= USED
;
4244 info
->u
.rsym
.sym
= sym
;
4246 /* Some symbols do not have a namespace (eg. formal arguments),
4247 so the automatic "unique symtree" mechanism must be suppressed
4248 by marking them as referenced. */
4249 q
= get_integer (info
->u
.rsym
.ns
);
4250 if (q
->u
.pointer
== NULL
)
4252 info
->u
.rsym
.referenced
= 1;
4256 /* If possible recycle the symtree that references the symbol.
4257 If a symtree is not found and the module does not import one,
4258 a unique-name symtree is found by read_cleanup. */
4259 st
= find_symtree_for_symbol (gfc_current_ns
->sym_root
, sym
);
4262 info
->u
.rsym
.symtree
= st
;
4263 info
->u
.rsym
.referenced
= 1;
4269 /* Parse the symtree lists. This lets us mark which symbols need to
4270 be loaded. Renaming is also done at this point by replacing the
4275 while (peek_atom () != ATOM_RPAREN
)
4277 mio_internal_string (name
);
4278 mio_integer (&ambiguous
);
4279 mio_integer (&symbol
);
4281 info
= get_integer (symbol
);
4283 /* See how many use names there are. If none, go through the start
4284 of the loop at least once. */
4285 nuse
= number_use_names (name
, false);
4286 info
->u
.rsym
.renamed
= nuse
? 1 : 0;
4291 for (j
= 1; j
<= nuse
; j
++)
4293 /* Get the jth local name for this symbol. */
4294 p
= find_use_name_n (name
, &j
, false);
4296 if (p
== NULL
&& strcmp (name
, module_name
) == 0)
4299 /* Skip symtree nodes not in an ONLY clause, unless there
4300 is an existing symtree loaded from another USE statement. */
4303 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4305 info
->u
.rsym
.symtree
= st
;
4309 /* If a symbol of the same name and module exists already,
4310 this symbol, which is not in an ONLY clause, must not be
4311 added to the namespace(11.3.2). Note that find_symbol
4312 only returns the first occurrence that it finds. */
4313 if (!only_flag
&& !info
->u
.rsym
.renamed
4314 && strcmp (name
, module_name
) != 0
4315 && find_symbol (gfc_current_ns
->sym_root
, name
,
4319 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
4323 /* Check for ambiguous symbols. */
4324 if (check_for_ambiguous (st
->n
.sym
, info
))
4326 info
->u
.rsym
.symtree
= st
;
4330 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4332 /* Delete the symtree if the symbol has been added by a USE
4333 statement without an ONLY(11.3.2). Remember that the rsym
4334 will be the same as the symbol found in the symtree, for
4336 if (st
&& (only_flag
|| info
->u
.rsym
.renamed
)
4337 && !st
->n
.sym
->attr
.use_only
4338 && !st
->n
.sym
->attr
.use_rename
4339 && info
->u
.rsym
.sym
== st
->n
.sym
)
4340 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
4342 /* Create a symtree node in the current namespace for this
4344 st
= check_unique_name (p
)
4345 ? gfc_get_unique_symtree (gfc_current_ns
)
4346 : gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
4347 st
->ambiguous
= ambiguous
;
4349 sym
= info
->u
.rsym
.sym
;
4351 /* Create a symbol node if it doesn't already exist. */
4354 info
->u
.rsym
.sym
= gfc_new_symbol (info
->u
.rsym
.true_name
,
4356 sym
= info
->u
.rsym
.sym
;
4357 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
4359 /* TODO: hmm, can we test this? Do we know it will be
4360 initialized to zeros? */
4361 if (info
->u
.rsym
.binding_label
[0] != '\0')
4362 strcpy (sym
->binding_label
, info
->u
.rsym
.binding_label
);
4368 if (strcmp (name
, p
) != 0)
4369 sym
->attr
.use_rename
= 1;
4371 /* We need to set the only_flag here so that symbols from the
4372 same USE...ONLY but earlier are not deleted from the tree in
4373 the gfc_delete_symtree above. */
4374 sym
->attr
.use_only
= only_flag
;
4376 /* Store the symtree pointing to this symbol. */
4377 info
->u
.rsym
.symtree
= st
;
4379 if (info
->u
.rsym
.state
== UNUSED
)
4380 info
->u
.rsym
.state
= NEEDED
;
4381 info
->u
.rsym
.referenced
= 1;
4388 /* Load intrinsic operator interfaces. */
4389 set_module_locus (&operator_interfaces
);
4392 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4394 if (i
== INTRINSIC_USER
)
4399 u
= find_use_operator ((gfc_intrinsic_op
) i
);
4410 mio_interface (&gfc_current_ns
->op
[i
]);
4415 /* Load generic and user operator interfaces. These must follow the
4416 loading of symtree because otherwise symbols can be marked as
4419 set_module_locus (&user_operators
);
4421 load_operator_interfaces ();
4422 load_generic_interfaces ();
4427 /* At this point, we read those symbols that are needed but haven't
4428 been loaded yet. If one symbol requires another, the other gets
4429 marked as NEEDED if its previous state was UNUSED. */
4431 while (load_needed (pi_root
));
4433 /* Make sure all elements of the rename-list were found in the module. */
4435 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4440 if (u
->op
== INTRINSIC_NONE
)
4442 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
4443 u
->use_name
, &u
->where
, module_name
);
4447 if (u
->op
== INTRINSIC_USER
)
4449 gfc_error ("User operator '%s' referenced at %L not found "
4450 "in module '%s'", u
->use_name
, &u
->where
, module_name
);
4454 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
4455 "in module '%s'", gfc_op2string (u
->op
), &u
->where
,
4459 gfc_check_interfaces (gfc_current_ns
);
4461 /* Now we should be in a position to fill f2k_derived with derived type
4462 extensions, since everything has been loaded. */
4463 set_module_locus (&extensions
);
4464 load_derived_extensions ();
4466 /* Clean up symbol nodes that were never loaded, create references
4467 to hidden symbols. */
4469 read_cleanup (pi_root
);
4473 /* Given an access type that is specific to an entity and the default
4474 access, return nonzero if the entity is publicly accessible. If the
4475 element is declared as PUBLIC, then it is public; if declared
4476 PRIVATE, then private, and otherwise it is public unless the default
4477 access in this context has been declared PRIVATE. */
4480 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
4482 if (specific_access
== ACCESS_PUBLIC
)
4484 if (specific_access
== ACCESS_PRIVATE
)
4487 if (gfc_option
.flag_module_private
)
4488 return default_access
== ACCESS_PUBLIC
;
4490 return default_access
!= ACCESS_PRIVATE
;
4494 /* A structure to remember which commons we've already written. */
4496 struct written_common
4498 BBT_HEADER(written_common
);
4499 const char *name
, *label
;
4502 static struct written_common
*written_commons
= NULL
;
4504 /* Comparison function used for balancing the binary tree. */
4507 compare_written_commons (void *a1
, void *b1
)
4509 const char *aname
= ((struct written_common
*) a1
)->name
;
4510 const char *alabel
= ((struct written_common
*) a1
)->label
;
4511 const char *bname
= ((struct written_common
*) b1
)->name
;
4512 const char *blabel
= ((struct written_common
*) b1
)->label
;
4513 int c
= strcmp (aname
, bname
);
4515 return (c
!= 0 ? c
: strcmp (alabel
, blabel
));
4518 /* Free a list of written commons. */
4521 free_written_common (struct written_common
*w
)
4527 free_written_common (w
->left
);
4529 free_written_common (w
->right
);
4534 /* Write a common block to the module -- recursive helper function. */
4537 write_common_0 (gfc_symtree
*st
, bool this_module
)
4543 struct written_common
*w
;
4544 bool write_me
= true;
4549 write_common_0 (st
->left
, this_module
);
4551 /* We will write out the binding label, or the name if no label given. */
4552 name
= st
->n
.common
->name
;
4554 label
= p
->is_bind_c
? p
->binding_label
: p
->name
;
4556 /* Check if we've already output this common. */
4557 w
= written_commons
;
4560 int c
= strcmp (name
, w
->name
);
4561 c
= (c
!= 0 ? c
: strcmp (label
, w
->label
));
4565 w
= (c
< 0) ? w
->left
: w
->right
;
4568 if (this_module
&& p
->use_assoc
)
4573 /* Write the common to the module. */
4575 mio_pool_string (&name
);
4577 mio_symbol_ref (&p
->head
);
4578 flags
= p
->saved
? 1 : 0;
4579 if (p
->threadprivate
)
4581 mio_integer (&flags
);
4583 /* Write out whether the common block is bind(c) or not. */
4584 mio_integer (&(p
->is_bind_c
));
4586 mio_pool_string (&label
);
4589 /* Record that we have written this common. */
4590 w
= XCNEW (struct written_common
);
4593 gfc_insert_bbt (&written_commons
, w
, compare_written_commons
);
4596 write_common_0 (st
->right
, this_module
);
4600 /* Write a common, by initializing the list of written commons, calling
4601 the recursive function write_common_0() and cleaning up afterwards. */
4604 write_common (gfc_symtree
*st
)
4606 written_commons
= NULL
;
4607 write_common_0 (st
, true);
4608 write_common_0 (st
, false);
4609 free_written_common (written_commons
);
4610 written_commons
= NULL
;
4614 /* Write the blank common block to the module. */
4617 write_blank_common (void)
4619 const char * name
= BLANK_COMMON_NAME
;
4621 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4622 this, but it hasn't been checked. Just making it so for now. */
4625 if (gfc_current_ns
->blank_common
.head
== NULL
)
4630 mio_pool_string (&name
);
4632 mio_symbol_ref (&gfc_current_ns
->blank_common
.head
);
4633 saved
= gfc_current_ns
->blank_common
.saved
;
4634 mio_integer (&saved
);
4636 /* Write out whether the common block is bind(c) or not. */
4637 mio_integer (&is_bind_c
);
4639 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4640 it doesn't matter because the label isn't used. */
4641 mio_pool_string (&name
);
4647 /* Write equivalences to the module. */
4656 for (eq
= gfc_current_ns
->equiv
; eq
; eq
= eq
->next
)
4660 for (e
= eq
; e
; e
= e
->eq
)
4662 if (e
->module
== NULL
)
4663 e
->module
= gfc_get_string ("%s.eq.%d", module_name
, num
);
4664 mio_allocated_string (e
->module
);
4665 mio_expr (&e
->expr
);
4674 /* Write derived type extensions to the module. */
4677 write_dt_extensions (gfc_symtree
*st
)
4679 if (!gfc_check_access (st
->n
.sym
->attr
.access
,
4680 st
->n
.sym
->ns
->default_access
))
4684 mio_pool_string (&st
->n
.sym
->name
);
4685 if (st
->n
.sym
->module
!= NULL
)
4686 mio_pool_string (&st
->n
.sym
->module
);
4688 mio_internal_string (module_name
);
4693 write_derived_extensions (gfc_symtree
*st
)
4695 if (!((st
->n
.sym
->attr
.flavor
== FL_DERIVED
)
4696 && (st
->n
.sym
->f2k_derived
!= NULL
)
4697 && (st
->n
.sym
->f2k_derived
->sym_root
!= NULL
)))
4701 mio_symbol_ref (&(st
->n
.sym
));
4702 gfc_traverse_symtree (st
->n
.sym
->f2k_derived
->sym_root
,
4703 write_dt_extensions
);
4708 /* Write a symbol to the module. */
4711 write_symbol (int n
, gfc_symbol
*sym
)
4715 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
4716 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
4719 mio_pool_string (&sym
->name
);
4721 mio_pool_string (&sym
->module
);
4722 if (sym
->attr
.is_bind_c
|| sym
->attr
.is_iso_c
)
4724 label
= sym
->binding_label
;
4725 mio_pool_string (&label
);
4728 mio_pool_string (&sym
->name
);
4730 mio_pointer_ref (&sym
->ns
);
4737 /* Recursive traversal function to write the initial set of symbols to
4738 the module. We check to see if the symbol should be written
4739 according to the access specification. */
4742 write_symbol0 (gfc_symtree
*st
)
4746 bool dont_write
= false;
4751 write_symbol0 (st
->left
);
4754 if (sym
->module
== NULL
)
4755 sym
->module
= gfc_get_string (module_name
);
4757 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4758 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
4761 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4766 p
= get_pointer (sym
);
4767 if (p
->type
== P_UNKNOWN
)
4770 if (p
->u
.wsym
.state
!= WRITTEN
)
4772 write_symbol (p
->integer
, sym
);
4773 p
->u
.wsym
.state
= WRITTEN
;
4777 write_symbol0 (st
->right
);
4781 /* Recursive traversal function to write the secondary set of symbols
4782 to the module file. These are symbols that were not public yet are
4783 needed by the public symbols or another dependent symbol. The act
4784 of writing a symbol can modify the pointer_info tree, so we cease
4785 traversal if we find a symbol to write. We return nonzero if a
4786 symbol was written and pass that information upwards. */
4789 write_symbol1 (pointer_info
*p
)
4796 result
= write_symbol1 (p
->left
);
4798 if (!(p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
))
4800 p
->u
.wsym
.state
= WRITTEN
;
4801 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
4805 result
|= write_symbol1 (p
->right
);
4810 /* Write operator interfaces associated with a symbol. */
4813 write_operator (gfc_user_op
*uop
)
4815 static char nullstring
[] = "";
4816 const char *p
= nullstring
;
4819 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
4822 mio_symbol_interface (&uop
->name
, &p
, &uop
->op
);
4826 /* Write generic interfaces from the namespace sym_root. */
4829 write_generic (gfc_symtree
*st
)
4836 write_generic (st
->left
);
4837 write_generic (st
->right
);
4840 if (!sym
|| check_unique_name (st
->name
))
4843 if (sym
->generic
== NULL
4844 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4847 if (sym
->module
== NULL
)
4848 sym
->module
= gfc_get_string (module_name
);
4850 mio_symbol_interface (&st
->name
, &sym
->module
, &sym
->generic
);
4855 write_symtree (gfc_symtree
*st
)
4862 /* A symbol in an interface body must not be visible in the
4864 if (sym
->ns
!= gfc_current_ns
4865 && sym
->ns
->proc_name
4866 && sym
->ns
->proc_name
->attr
.if_source
== IFSRC_IFBODY
)
4869 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
4870 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4871 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
4874 if (check_unique_name (st
->name
))
4877 p
= find_pointer (sym
);
4879 gfc_internal_error ("write_symtree(): Symbol not written");
4881 mio_pool_string (&st
->name
);
4882 mio_integer (&st
->ambiguous
);
4883 mio_integer (&p
->integer
);
4892 /* Write the operator interfaces. */
4895 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4897 if (i
== INTRINSIC_USER
)
4900 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
4901 gfc_current_ns
->default_access
)
4902 ? &gfc_current_ns
->op
[i
] : NULL
);
4910 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
4916 write_generic (gfc_current_ns
->sym_root
);
4922 write_blank_common ();
4923 write_common (gfc_current_ns
->common_root
);
4935 gfc_traverse_symtree (gfc_current_ns
->sym_root
,
4936 write_derived_extensions
);
4941 /* Write symbol information. First we traverse all symbols in the
4942 primary namespace, writing those that need to be written.
4943 Sometimes writing one symbol will cause another to need to be
4944 written. A list of these symbols ends up on the write stack, and
4945 we end by popping the bottom of the stack and writing the symbol
4946 until the stack is empty. */
4950 write_symbol0 (gfc_current_ns
->sym_root
);
4951 while (write_symbol1 (pi_root
))
4960 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
4965 /* Read a MD5 sum from the header of a module file. If the file cannot
4966 be opened, or we have any other error, we return -1. */
4969 read_md5_from_module_file (const char * filename
, unsigned char md5
[16])
4975 /* Open the file. */
4976 if ((file
= fopen (filename
, "r")) == NULL
)
4979 /* Read the first line. */
4980 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
4986 /* The file also needs to be overwritten if the version number changed. */
4987 n
= strlen ("GFORTRAN module version '" MOD_VERSION
"' created");
4988 if (strncmp (buf
, "GFORTRAN module version '" MOD_VERSION
"' created", n
) != 0)
4994 /* Read a second line. */
4995 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
5001 /* Close the file. */
5004 /* If the header is not what we expect, or is too short, bail out. */
5005 if (strncmp (buf
, "MD5:", 4) != 0 || strlen (buf
) < 4 + 16)
5008 /* Now, we have a real MD5, read it into the array. */
5009 for (n
= 0; n
< 16; n
++)
5013 if (sscanf (&(buf
[4+2*n
]), "%02x", &x
) != 1)
5023 /* Given module, dump it to disk. If there was an error while
5024 processing the module, dump_flag will be set to zero and we delete
5025 the module file, even if it was already there. */
5028 gfc_dump_module (const char *name
, int dump_flag
)
5031 char *filename
, *filename_tmp
, *p
;
5034 unsigned char md5_new
[16], md5_old
[16];
5036 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
5037 if (gfc_option
.module_dir
!= NULL
)
5039 n
+= strlen (gfc_option
.module_dir
);
5040 filename
= (char *) alloca (n
);
5041 strcpy (filename
, gfc_option
.module_dir
);
5042 strcat (filename
, name
);
5046 filename
= (char *) alloca (n
);
5047 strcpy (filename
, name
);
5049 strcat (filename
, MODULE_EXTENSION
);
5051 /* Name of the temporary file used to write the module. */
5052 filename_tmp
= (char *) alloca (n
+ 1);
5053 strcpy (filename_tmp
, filename
);
5054 strcat (filename_tmp
, "0");
5056 /* There was an error while processing the module. We delete the
5057 module file, even if it was already there. */
5064 /* Write the module to the temporary file. */
5065 module_fp
= fopen (filename_tmp
, "w");
5066 if (module_fp
== NULL
)
5067 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
5068 filename_tmp
, strerror (errno
));
5070 /* Write the header, including space reserved for the MD5 sum. */
5074 *strchr (p
, '\n') = '\0';
5076 fprintf (module_fp
, "GFORTRAN module version '%s' created from %s on %s\n"
5077 "MD5:", MOD_VERSION
, gfc_source_file
, p
);
5078 fgetpos (module_fp
, &md5_pos
);
5079 fputs ("00000000000000000000000000000000 -- "
5080 "If you edit this, you'll get what you deserve.\n\n", module_fp
);
5082 /* Initialize the MD5 context that will be used for output. */
5083 md5_init_ctx (&ctx
);
5085 /* Write the module itself. */
5087 strcpy (module_name
, name
);
5093 free_pi_tree (pi_root
);
5098 /* Write the MD5 sum to the header of the module file. */
5099 md5_finish_ctx (&ctx
, md5_new
);
5100 fsetpos (module_fp
, &md5_pos
);
5101 for (n
= 0; n
< 16; n
++)
5102 fprintf (module_fp
, "%02x", md5_new
[n
]);
5104 if (fclose (module_fp
))
5105 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
5106 filename_tmp
, strerror (errno
));
5108 /* Read the MD5 from the header of the old module file and compare. */
5109 if (read_md5_from_module_file (filename
, md5_old
) != 0
5110 || memcmp (md5_old
, md5_new
, sizeof (md5_old
)) != 0)
5112 /* Module file have changed, replace the old one. */
5113 if (unlink (filename
) && errno
!= ENOENT
)
5114 gfc_fatal_error ("Can't delete module file '%s': %s", filename
,
5116 if (rename (filename_tmp
, filename
))
5117 gfc_fatal_error ("Can't rename module file '%s' to '%s': %s",
5118 filename_tmp
, filename
, strerror (errno
));
5122 if (unlink (filename_tmp
))
5123 gfc_fatal_error ("Can't delete temporary module file '%s': %s",
5124 filename_tmp
, strerror (errno
));
5130 sort_iso_c_rename_list (void)
5132 gfc_use_rename
*tmp_list
= NULL
;
5133 gfc_use_rename
*curr
;
5134 gfc_use_rename
*kinds_used
[ISOCBINDING_NUMBER
] = {NULL
};
5138 for (curr
= gfc_rename_list
; curr
; curr
= curr
->next
)
5140 c_kind
= get_c_kind (curr
->use_name
, c_interop_kinds_table
);
5141 if (c_kind
== ISOCBINDING_INVALID
|| c_kind
== ISOCBINDING_LAST
)
5143 gfc_error ("Symbol '%s' referenced at %L does not exist in "
5144 "intrinsic module ISO_C_BINDING.", curr
->use_name
,
5148 /* Put it in the list. */
5149 kinds_used
[c_kind
] = curr
;
5152 /* Make a new (sorted) rename list. */
5154 while (i
< ISOCBINDING_NUMBER
&& kinds_used
[i
] == NULL
)
5157 if (i
< ISOCBINDING_NUMBER
)
5159 tmp_list
= kinds_used
[i
];
5163 for (; i
< ISOCBINDING_NUMBER
; i
++)
5164 if (kinds_used
[i
] != NULL
)
5166 curr
->next
= kinds_used
[i
];
5172 gfc_rename_list
= tmp_list
;
5176 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
5177 the current namespace for all named constants, pointer types, and
5178 procedures in the module unless the only clause was used or a rename
5179 list was provided. */
5182 import_iso_c_binding_module (void)
5184 gfc_symbol
*mod_sym
= NULL
;
5185 gfc_symtree
*mod_symtree
= NULL
;
5186 const char *iso_c_module_name
= "__iso_c_binding";
5191 /* Look only in the current namespace. */
5192 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, iso_c_module_name
);
5194 if (mod_symtree
== NULL
)
5196 /* symtree doesn't already exist in current namespace. */
5197 gfc_get_sym_tree (iso_c_module_name
, gfc_current_ns
, &mod_symtree
,
5200 if (mod_symtree
!= NULL
)
5201 mod_sym
= mod_symtree
->n
.sym
;
5203 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
5204 "create symbol for %s", iso_c_module_name
);
5206 mod_sym
->attr
.flavor
= FL_MODULE
;
5207 mod_sym
->attr
.intrinsic
= 1;
5208 mod_sym
->module
= gfc_get_string (iso_c_module_name
);
5209 mod_sym
->from_intmod
= INTMOD_ISO_C_BINDING
;
5212 /* Generate the symbols for the named constants representing
5213 the kinds for intrinsic data types. */
5216 /* Sort the rename list because there are dependencies between types
5217 and procedures (e.g., c_loc needs c_ptr). */
5218 sort_iso_c_rename_list ();
5220 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5222 i
= get_c_kind (u
->use_name
, c_interop_kinds_table
);
5224 if (i
== ISOCBINDING_INVALID
|| i
== ISOCBINDING_LAST
)
5226 gfc_error ("Symbol '%s' referenced at %L does not exist in "
5227 "intrinsic module ISO_C_BINDING.", u
->use_name
,
5232 generate_isocbinding_symbol (iso_c_module_name
,
5233 (iso_c_binding_symbol
) i
,
5239 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
5242 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5244 if (strcmp (c_interop_kinds_table
[i
].name
, u
->use_name
) == 0)
5246 local_name
= u
->local_name
;
5251 generate_isocbinding_symbol (iso_c_module_name
,
5252 (iso_c_binding_symbol
) i
,
5256 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5261 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5262 "module ISO_C_BINDING", u
->use_name
, &u
->where
);
5268 /* Add an integer named constant from a given module. */
5271 create_int_parameter (const char *name
, int value
, const char *modname
,
5272 intmod_id module
, int id
)
5274 gfc_symtree
*tmp_symtree
;
5277 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
5278 if (tmp_symtree
!= NULL
)
5280 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
5283 gfc_error ("Symbol '%s' already declared", name
);
5286 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
, false);
5287 sym
= tmp_symtree
->n
.sym
;
5289 sym
->module
= gfc_get_string (modname
);
5290 sym
->attr
.flavor
= FL_PARAMETER
;
5291 sym
->ts
.type
= BT_INTEGER
;
5292 sym
->ts
.kind
= gfc_default_integer_kind
;
5293 sym
->value
= gfc_int_expr (value
);
5294 sym
->attr
.use_assoc
= 1;
5295 sym
->from_intmod
= module
;
5296 sym
->intmod_sym_id
= id
;
5300 /* USE the ISO_FORTRAN_ENV intrinsic module. */
5303 use_iso_fortran_env_module (void)
5305 static char mod
[] = "iso_fortran_env";
5306 const char *local_name
;
5308 gfc_symbol
*mod_sym
;
5309 gfc_symtree
*mod_symtree
;
5312 intmod_sym symbol
[] = {
5313 #define NAMED_INTCST(a,b,c,d) { a, b, 0, d },
5314 #include "iso-fortran-env.def"
5316 { ISOFORTRANENV_INVALID
, NULL
, -1234, 0 } };
5319 #define NAMED_INTCST(a,b,c,d) symbol[i++].value = c;
5320 #include "iso-fortran-env.def"
5323 /* Generate the symbol for the module itself. */
5324 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, mod
);
5325 if (mod_symtree
== NULL
)
5327 gfc_get_sym_tree (mod
, gfc_current_ns
, &mod_symtree
, false);
5328 gcc_assert (mod_symtree
);
5329 mod_sym
= mod_symtree
->n
.sym
;
5331 mod_sym
->attr
.flavor
= FL_MODULE
;
5332 mod_sym
->attr
.intrinsic
= 1;
5333 mod_sym
->module
= gfc_get_string (mod
);
5334 mod_sym
->from_intmod
= INTMOD_ISO_FORTRAN_ENV
;
5337 if (!mod_symtree
->n
.sym
->attr
.intrinsic
)
5338 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
5339 "non-intrinsic module name used previously", mod
);
5341 /* Generate the symbols for the module integer named constants. */
5343 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5345 for (i
= 0; symbol
[i
].name
; i
++)
5346 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
5349 if (symbol
[i
].name
== NULL
)
5351 gfc_error ("Symbol '%s' referenced at %L does not exist in "
5352 "intrinsic module ISO_FORTRAN_ENV", u
->use_name
,
5357 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5358 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5359 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5360 "from intrinsic module ISO_FORTRAN_ENV at %L is "
5361 "incompatible with option %s", &u
->where
,
5362 gfc_option
.flag_default_integer
5363 ? "-fdefault-integer-8" : "-fdefault-real-8");
5365 create_int_parameter (u
->local_name
[0] ? u
->local_name
5367 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
5372 for (i
= 0; symbol
[i
].name
; i
++)
5375 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5377 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
5379 local_name
= u
->local_name
;
5385 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5386 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5387 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5388 "from intrinsic module ISO_FORTRAN_ENV at %C is "
5389 "incompatible with option %s",
5390 gfc_option
.flag_default_integer
5391 ? "-fdefault-integer-8" : "-fdefault-real-8");
5393 create_int_parameter (local_name
? local_name
: symbol
[i
].name
,
5394 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
5398 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5403 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5404 "module ISO_FORTRAN_ENV", u
->use_name
, &u
->where
);
5410 /* Process a USE directive. */
5413 gfc_use_module (void)
5418 gfc_symtree
*mod_symtree
;
5419 gfc_use_list
*use_stmt
;
5421 filename
= (char *) alloca (strlen (module_name
) + strlen (MODULE_EXTENSION
)
5423 strcpy (filename
, module_name
);
5424 strcat (filename
, MODULE_EXTENSION
);
5426 /* First, try to find an non-intrinsic module, unless the USE statement
5427 specified that the module is intrinsic. */
5430 module_fp
= gfc_open_included_file (filename
, true, true);
5432 /* Then, see if it's an intrinsic one, unless the USE statement
5433 specified that the module is non-intrinsic. */
5434 if (module_fp
== NULL
&& !specified_nonint
)
5436 if (strcmp (module_name
, "iso_fortran_env") == 0
5437 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: ISO_FORTRAN_ENV "
5438 "intrinsic module at %C") != FAILURE
)
5440 use_iso_fortran_env_module ();
5444 if (strcmp (module_name
, "iso_c_binding") == 0
5445 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
5446 "ISO_C_BINDING module at %C") != FAILURE
)
5448 import_iso_c_binding_module();
5452 module_fp
= gfc_open_intrinsic_module (filename
);
5454 if (module_fp
== NULL
&& specified_int
)
5455 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
5459 if (module_fp
== NULL
)
5460 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
5461 filename
, strerror (errno
));
5463 /* Check that we haven't already USEd an intrinsic module with the
5466 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, module_name
);
5467 if (mod_symtree
&& mod_symtree
->n
.sym
->attr
.intrinsic
)
5468 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
5469 "intrinsic module name used previously", module_name
);
5476 /* Skip the first two lines of the module, after checking that this is
5477 a gfortran module file. */
5483 bad_module ("Unexpected end of module");
5486 if ((start
== 1 && strcmp (atom_name
, "GFORTRAN") != 0)
5487 || (start
== 2 && strcmp (atom_name
, " module") != 0))
5488 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
5492 if (strcmp (atom_name
, " version") != 0
5493 || module_char () != ' '
5494 || parse_atom () != ATOM_STRING
)
5495 gfc_fatal_error ("Parse error when checking module version"
5496 " for file '%s' opened at %C", filename
);
5498 if (strcmp (atom_string
, MOD_VERSION
))
5500 gfc_fatal_error ("Wrong module version '%s' (expected '%s') "
5501 "for file '%s' opened at %C", atom_string
,
5502 MOD_VERSION
, filename
);
5510 /* Make sure we're not reading the same module that we may be building. */
5511 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
5512 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
5513 gfc_fatal_error ("Can't USE the same module we're building!");
5516 init_true_name_tree ();
5520 free_true_name (true_name_root
);
5521 true_name_root
= NULL
;
5523 free_pi_tree (pi_root
);
5528 use_stmt
= gfc_get_use_list ();
5529 use_stmt
->module_name
= gfc_get_string (module_name
);
5530 use_stmt
->only_flag
= only_flag
;
5531 use_stmt
->rename
= gfc_rename_list
;
5532 use_stmt
->where
= use_locus
;
5533 gfc_rename_list
= NULL
;
5534 use_stmt
->next
= gfc_current_ns
->use_stmts
;
5535 gfc_current_ns
->use_stmts
= use_stmt
;
5540 gfc_free_use_stmts (gfc_use_list
*use_stmts
)
5543 for (; use_stmts
; use_stmts
= next
)
5545 gfc_use_rename
*next_rename
;
5547 for (; use_stmts
->rename
; use_stmts
->rename
= next_rename
)
5549 next_rename
= use_stmts
->rename
->next
;
5550 gfc_free (use_stmts
->rename
);
5552 next
= use_stmts
->next
;
5553 gfc_free (use_stmts
);
5559 gfc_module_init_2 (void)
5561 last_atom
= ATOM_LPAREN
;
5566 gfc_module_done_2 (void)