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
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"
79 /* Structure that describes a position within a module file. */
88 /* Structure for list of symbols of intrinsic modules. */
101 P_UNKNOWN
= 0, P_OTHER
, P_NAMESPACE
, P_COMPONENT
, P_SYMBOL
105 /* The fixup structure lists pointers to pointers that have to
106 be updated when a pointer value becomes known. */
108 typedef struct fixup_t
111 struct fixup_t
*next
;
116 /* Structure for holding extra info needed for pointers being read. */
118 typedef struct pointer_info
120 BBT_HEADER (pointer_info
);
124 /* The first component of each member of the union is the pointer
131 void *pointer
; /* Member for doing pointer searches. */
136 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
138 { UNUSED
, NEEDED
, USED
}
140 int ns
, referenced
, renamed
;
143 gfc_symtree
*symtree
;
144 char binding_label
[GFC_MAX_SYMBOL_LEN
+ 1];
152 { UNREFERENCED
= 0, NEEDS_WRITE
, WRITTEN
}
162 #define gfc_get_pointer_info() XCNEW (pointer_info)
165 /* Lists of rename info for the USE statement. */
167 typedef struct gfc_use_rename
169 char local_name
[GFC_MAX_SYMBOL_LEN
+ 1], use_name
[GFC_MAX_SYMBOL_LEN
+ 1];
170 struct gfc_use_rename
*next
;
177 #define gfc_get_use_rename() XCNEW (gfc_use_rename);
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
;
207 /*****************************************************************/
209 /* Pointer/integer conversion. Pointers between structures are stored
210 as integers in the module file. The next couple of subroutines
211 handle this translation for reading and writing. */
213 /* Recursively free the tree of pointer structures. */
216 free_pi_tree (pointer_info
*p
)
221 if (p
->fixup
!= NULL
)
222 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
224 free_pi_tree (p
->left
);
225 free_pi_tree (p
->right
);
231 /* Compare pointers when searching by pointer. Used when writing a
235 compare_pointers (void *_sn1
, void *_sn2
)
237 pointer_info
*sn1
, *sn2
;
239 sn1
= (pointer_info
*) _sn1
;
240 sn2
= (pointer_info
*) _sn2
;
242 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
244 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
251 /* Compare integers when searching by integer. Used when reading a
255 compare_integers (void *_sn1
, void *_sn2
)
257 pointer_info
*sn1
, *sn2
;
259 sn1
= (pointer_info
*) _sn1
;
260 sn2
= (pointer_info
*) _sn2
;
262 if (sn1
->integer
< sn2
->integer
)
264 if (sn1
->integer
> sn2
->integer
)
271 /* Initialize the pointer_info tree. */
280 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
282 /* Pointer 0 is the NULL pointer. */
283 p
= gfc_get_pointer_info ();
288 gfc_insert_bbt (&pi_root
, p
, compare
);
290 /* Pointer 1 is the current namespace. */
291 p
= gfc_get_pointer_info ();
292 p
->u
.pointer
= gfc_current_ns
;
294 p
->type
= P_NAMESPACE
;
296 gfc_insert_bbt (&pi_root
, p
, compare
);
302 /* During module writing, call here with a pointer to something,
303 returning the pointer_info node. */
305 static pointer_info
*
306 find_pointer (void *gp
)
313 if (p
->u
.pointer
== gp
)
315 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
322 /* Given a pointer while writing, returns the pointer_info tree node,
323 creating it if it doesn't exist. */
325 static pointer_info
*
326 get_pointer (void *gp
)
330 p
= find_pointer (gp
);
334 /* Pointer doesn't have an integer. Give it one. */
335 p
= gfc_get_pointer_info ();
338 p
->integer
= symbol_number
++;
340 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
346 /* Given an integer during reading, find it in the pointer_info tree,
347 creating the node if not found. */
349 static pointer_info
*
350 get_integer (int integer
)
360 c
= compare_integers (&t
, p
);
364 p
= (c
< 0) ? p
->left
: p
->right
;
370 p
= gfc_get_pointer_info ();
371 p
->integer
= integer
;
374 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
380 /* Recursive function to find a pointer within a tree by brute force. */
382 static pointer_info
*
383 fp2 (pointer_info
*p
, const void *target
)
390 if (p
->u
.pointer
== target
)
393 q
= fp2 (p
->left
, target
);
397 return fp2 (p
->right
, target
);
401 /* During reading, find a pointer_info node from the pointer value.
402 This amounts to a brute-force search. */
404 static pointer_info
*
405 find_pointer2 (void *p
)
407 return fp2 (pi_root
, p
);
411 /* Resolve any fixups using a known pointer. */
414 resolve_fixups (fixup_t
*f
, void *gp
)
427 /* Call here during module reading when we know what pointer to
428 associate with an integer. Any fixups that exist are resolved at
432 associate_integer_pointer (pointer_info
*p
, void *gp
)
434 if (p
->u
.pointer
!= NULL
)
435 gfc_internal_error ("associate_integer_pointer(): Already associated");
439 resolve_fixups (p
->fixup
, gp
);
445 /* During module reading, given an integer and a pointer to a pointer,
446 either store the pointer from an already-known value or create a
447 fixup structure in order to store things later. Returns zero if
448 the reference has been actually stored, or nonzero if the reference
449 must be fixed later (i.e., associate_integer_pointer must be called
450 sometime later. Returns the pointer_info structure. */
452 static pointer_info
*
453 add_fixup (int integer
, void *gp
)
459 p
= get_integer (integer
);
461 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
464 *cp
= (char *) p
->u
.pointer
;
473 f
->pointer
= (void **) gp
;
480 /*****************************************************************/
482 /* Parser related subroutines */
484 /* Free the rename list left behind by a USE statement. */
489 gfc_use_rename
*next
;
491 for (; gfc_rename_list
; gfc_rename_list
= next
)
493 next
= gfc_rename_list
->next
;
494 gfc_free (gfc_rename_list
);
499 /* Match a USE statement. */
504 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module_nature
[GFC_MAX_SYMBOL_LEN
+ 1];
505 gfc_use_rename
*tail
= NULL
, *new_use
;
506 interface_type type
, type2
;
510 specified_int
= false;
511 specified_nonint
= false;
513 if (gfc_match (" , ") == MATCH_YES
)
515 if ((m
= gfc_match (" %n ::", module_nature
)) == MATCH_YES
)
517 if (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: module "
518 "nature in USE statement at %C") == FAILURE
)
521 if (strcmp (module_nature
, "intrinsic") == 0)
522 specified_int
= true;
525 if (strcmp (module_nature
, "non_intrinsic") == 0)
526 specified_nonint
= true;
529 gfc_error ("Module nature in USE statement at %C shall "
530 "be either INTRINSIC or NON_INTRINSIC");
537 /* Help output a better error message than "Unclassifiable
539 gfc_match (" %n", module_nature
);
540 if (strcmp (module_nature
, "intrinsic") == 0
541 || strcmp (module_nature
, "non_intrinsic") == 0)
542 gfc_error ("\"::\" was expected after module nature at %C "
543 "but was not found");
549 m
= gfc_match (" ::");
550 if (m
== MATCH_YES
&&
551 gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
552 "\"USE :: module\" at %C") == FAILURE
)
557 m
= gfc_match ("% ");
563 m
= gfc_match_name (module_name
);
570 if (gfc_match_eos () == MATCH_YES
)
572 if (gfc_match_char (',') != MATCH_YES
)
575 if (gfc_match (" only :") == MATCH_YES
)
578 if (gfc_match_eos () == MATCH_YES
)
583 /* Get a new rename struct and add it to the rename list. */
584 new_use
= gfc_get_use_rename ();
585 new_use
->where
= gfc_current_locus
;
588 if (gfc_rename_list
== NULL
)
589 gfc_rename_list
= new_use
;
591 tail
->next
= new_use
;
594 /* See what kind of interface we're dealing with. Assume it is
596 new_use
->op
= INTRINSIC_NONE
;
597 if (gfc_match_generic_spec (&type
, name
, &op
) == MATCH_ERROR
)
602 case INTERFACE_NAMELESS
:
603 gfc_error ("Missing generic specification in USE statement at %C");
606 case INTERFACE_USER_OP
:
607 case INTERFACE_GENERIC
:
608 m
= gfc_match (" =>");
610 if (type
== INTERFACE_USER_OP
&& m
== MATCH_YES
611 && (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: Renaming "
612 "operators in USE statements at %C")
616 if (type
== INTERFACE_USER_OP
)
617 new_use
->op
= INTRINSIC_USER
;
622 strcpy (new_use
->use_name
, name
);
625 strcpy (new_use
->local_name
, name
);
626 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
631 if (m
== MATCH_ERROR
)
639 strcpy (new_use
->local_name
, name
);
641 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
646 if (m
== MATCH_ERROR
)
650 if (strcmp (new_use
->use_name
, module_name
) == 0
651 || strcmp (new_use
->local_name
, module_name
) == 0)
653 gfc_error ("The name '%s' at %C has already been used as "
654 "an external module name.", module_name
);
659 case INTERFACE_INTRINSIC_OP
:
667 if (gfc_match_eos () == MATCH_YES
)
669 if (gfc_match_char (',') != MATCH_YES
)
676 gfc_syntax_error (ST_USE
);
684 /* Given a name and a number, inst, return the inst name
685 under which to load this symbol. Returns NULL if this
686 symbol shouldn't be loaded. If inst is zero, returns
687 the number of instances of this name. If interface is
688 true, a user-defined operator is sought, otherwise only
689 non-operators are sought. */
692 find_use_name_n (const char *name
, int *inst
, bool interface
)
698 for (u
= gfc_rename_list
; u
; u
= u
->next
)
700 if (strcmp (u
->use_name
, name
) != 0
701 || (u
->op
== INTRINSIC_USER
&& !interface
)
702 || (u
->op
!= INTRINSIC_USER
&& interface
))
715 return only_flag
? NULL
: name
;
719 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
723 /* Given a name, return the name under which to load this symbol.
724 Returns NULL if this symbol shouldn't be loaded. */
727 find_use_name (const char *name
, bool interface
)
730 return find_use_name_n (name
, &i
, interface
);
734 /* Given a real name, return the number of use names associated with it. */
737 number_use_names (const char *name
, bool interface
)
741 c
= find_use_name_n (name
, &i
, interface
);
746 /* Try to find the operator in the current list. */
748 static gfc_use_rename
*
749 find_use_operator (gfc_intrinsic_op op
)
753 for (u
= gfc_rename_list
; u
; u
= u
->next
)
761 /*****************************************************************/
763 /* The next couple of subroutines maintain a tree used to avoid a
764 brute-force search for a combination of true name and module name.
765 While symtree names, the name that a particular symbol is known by
766 can changed with USE statements, we still have to keep track of the
767 true names to generate the correct reference, and also avoid
768 loading the same real symbol twice in a program unit.
770 When we start reading, the true name tree is built and maintained
771 as symbols are read. The tree is searched as we load new symbols
772 to see if it already exists someplace in the namespace. */
774 typedef struct true_name
776 BBT_HEADER (true_name
);
781 static true_name
*true_name_root
;
784 /* Compare two true_name structures. */
787 compare_true_names (void *_t1
, void *_t2
)
792 t1
= (true_name
*) _t1
;
793 t2
= (true_name
*) _t2
;
795 c
= ((t1
->sym
->module
> t2
->sym
->module
)
796 - (t1
->sym
->module
< t2
->sym
->module
));
800 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
804 /* Given a true name, search the true name tree to see if it exists
805 within the main namespace. */
808 find_true_name (const char *name
, const char *module
)
814 sym
.name
= gfc_get_string (name
);
816 sym
.module
= gfc_get_string (module
);
824 c
= compare_true_names ((void *) (&t
), (void *) p
);
828 p
= (c
< 0) ? p
->left
: p
->right
;
835 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
838 add_true_name (gfc_symbol
*sym
)
842 t
= XCNEW (true_name
);
845 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
849 /* Recursive function to build the initial true name tree by
850 recursively traversing the current namespace. */
853 build_tnt (gfc_symtree
*st
)
858 build_tnt (st
->left
);
859 build_tnt (st
->right
);
861 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
864 add_true_name (st
->n
.sym
);
868 /* Initialize the true name tree with the current namespace. */
871 init_true_name_tree (void)
873 true_name_root
= NULL
;
874 build_tnt (gfc_current_ns
->sym_root
);
878 /* Recursively free a true name tree node. */
881 free_true_name (true_name
*t
)
885 free_true_name (t
->left
);
886 free_true_name (t
->right
);
892 /*****************************************************************/
894 /* Module reading and writing. */
898 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
902 static atom_type last_atom
;
905 /* The name buffer must be at least as long as a symbol name. Right
906 now it's not clear how we're going to store numeric constants--
907 probably as a hexadecimal string, since this will allow the exact
908 number to be preserved (this can't be done by a decimal
909 representation). Worry about that later. TODO! */
911 #define MAX_ATOM_SIZE 100
914 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
917 /* Report problems with a module. Error reporting is not very
918 elaborate, since this sorts of errors shouldn't really happen.
919 This subroutine never returns. */
921 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
924 bad_module (const char *msgid
)
931 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
932 module_name
, module_line
, module_column
, msgid
);
935 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
936 module_name
, module_line
, module_column
, msgid
);
939 gfc_fatal_error ("Module %s at line %d column %d: %s",
940 module_name
, module_line
, module_column
, msgid
);
946 /* Set the module's input pointer. */
949 set_module_locus (module_locus
*m
)
951 module_column
= m
->column
;
952 module_line
= m
->line
;
953 fsetpos (module_fp
, &m
->pos
);
957 /* Get the module's input pointer so that we can restore it later. */
960 get_module_locus (module_locus
*m
)
962 m
->column
= module_column
;
963 m
->line
= module_line
;
964 fgetpos (module_fp
, &m
->pos
);
968 /* Get the next character in the module, updating our reckoning of
976 c
= getc (module_fp
);
979 bad_module ("Unexpected EOF");
992 /* Parse a string constant. The delimiter is guaranteed to be a
1002 get_module_locus (&start
);
1006 /* See how long the string is. */
1011 bad_module ("Unexpected end of module in string constant");
1029 set_module_locus (&start
);
1031 atom_string
= p
= XCNEWVEC (char, len
+ 1);
1033 for (; len
> 0; len
--)
1037 module_char (); /* Guaranteed to be another \'. */
1041 module_char (); /* Terminating \'. */
1042 *p
= '\0'; /* C-style string for debug purposes. */
1046 /* Parse a small integer. */
1049 parse_integer (int c
)
1057 get_module_locus (&m
);
1063 atom_int
= 10 * atom_int
+ c
- '0';
1064 if (atom_int
> 99999999)
1065 bad_module ("Integer overflow");
1068 set_module_locus (&m
);
1086 get_module_locus (&m
);
1091 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
1095 if (++len
> GFC_MAX_SYMBOL_LEN
)
1096 bad_module ("Name too long");
1101 fseek (module_fp
, -1, SEEK_CUR
);
1102 module_column
= m
.column
+ len
- 1;
1109 /* Read the next atom in the module's input stream. */
1120 while (c
== ' ' || c
== '\r' || c
== '\n');
1145 return ATOM_INTEGER
;
1203 bad_module ("Bad name");
1210 /* Peek at the next atom on the input. */
1218 get_module_locus (&m
);
1221 if (a
== ATOM_STRING
)
1222 gfc_free (atom_string
);
1224 set_module_locus (&m
);
1229 /* Read the next atom from the input, requiring that it be a
1233 require_atom (atom_type type
)
1239 get_module_locus (&m
);
1247 p
= _("Expected name");
1250 p
= _("Expected left parenthesis");
1253 p
= _("Expected right parenthesis");
1256 p
= _("Expected integer");
1259 p
= _("Expected string");
1262 gfc_internal_error ("require_atom(): bad atom type required");
1265 set_module_locus (&m
);
1271 /* Given a pointer to an mstring array, require that the current input
1272 be one of the strings in the array. We return the enum value. */
1275 find_enum (const mstring
*m
)
1279 i
= gfc_string2code (m
, atom_name
);
1283 bad_module ("find_enum(): Enum not found");
1289 /**************** Module output subroutines ***************************/
1291 /* Output a character to a module file. */
1294 write_char (char out
)
1296 if (putc (out
, module_fp
) == EOF
)
1297 gfc_fatal_error ("Error writing modules file: %s", strerror (errno
));
1299 /* Add this to our MD5. */
1300 md5_process_bytes (&out
, sizeof (out
), &ctx
);
1312 /* Write an atom to a module. The line wrapping isn't perfect, but it
1313 should work most of the time. This isn't that big of a deal, since
1314 the file really isn't meant to be read by people anyway. */
1317 write_atom (atom_type atom
, const void *v
)
1327 p
= (const char *) v
;
1339 i
= *((const int *) v
);
1341 gfc_internal_error ("write_atom(): Writing negative integer");
1343 sprintf (buffer
, "%d", i
);
1348 gfc_internal_error ("write_atom(): Trying to write dab atom");
1352 if(p
== NULL
|| *p
== '\0')
1357 if (atom
!= ATOM_RPAREN
)
1359 if (module_column
+ len
> 72)
1364 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1369 if (atom
== ATOM_STRING
)
1372 while (p
!= NULL
&& *p
)
1374 if (atom
== ATOM_STRING
&& *p
== '\'')
1379 if (atom
== ATOM_STRING
)
1387 /***************** Mid-level I/O subroutines *****************/
1389 /* These subroutines let their caller read or write atoms without
1390 caring about which of the two is actually happening. This lets a
1391 subroutine concentrate on the actual format of the data being
1394 static void mio_expr (gfc_expr
**);
1395 pointer_info
*mio_symbol_ref (gfc_symbol
**);
1396 pointer_info
*mio_interface_rest (gfc_interface
**);
1397 static void mio_symtree_ref (gfc_symtree
**);
1399 /* Read or write an enumerated value. On writing, we return the input
1400 value for the convenience of callers. We avoid using an integer
1401 pointer because enums are sometimes inside bitfields. */
1404 mio_name (int t
, const mstring
*m
)
1406 if (iomode
== IO_OUTPUT
)
1407 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1410 require_atom (ATOM_NAME
);
1417 /* Specialization of mio_name. */
1419 #define DECL_MIO_NAME(TYPE) \
1420 static inline TYPE \
1421 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1423 return (TYPE) mio_name ((int) t, m); \
1425 #define MIO_NAME(TYPE) mio_name_##TYPE
1430 if (iomode
== IO_OUTPUT
)
1431 write_atom (ATOM_LPAREN
, NULL
);
1433 require_atom (ATOM_LPAREN
);
1440 if (iomode
== IO_OUTPUT
)
1441 write_atom (ATOM_RPAREN
, NULL
);
1443 require_atom (ATOM_RPAREN
);
1448 mio_integer (int *ip
)
1450 if (iomode
== IO_OUTPUT
)
1451 write_atom (ATOM_INTEGER
, ip
);
1454 require_atom (ATOM_INTEGER
);
1460 /* Read or write a character pointer that points to a string on the heap. */
1463 mio_allocated_string (const char *s
)
1465 if (iomode
== IO_OUTPUT
)
1467 write_atom (ATOM_STRING
, s
);
1472 require_atom (ATOM_STRING
);
1478 /* Functions for quoting and unquoting strings. */
1481 quote_string (const gfc_char_t
*s
, const size_t slength
)
1483 const gfc_char_t
*p
;
1487 /* Calculate the length we'll need: a backslash takes two ("\\"),
1488 non-printable characters take 10 ("\Uxxxxxxxx") and others take 1. */
1489 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1493 else if (!gfc_wide_is_printable (*p
))
1499 q
= res
= XCNEWVEC (char, len
+ 1);
1500 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1503 *q
++ = '\\', *q
++ = '\\';
1504 else if (!gfc_wide_is_printable (*p
))
1506 sprintf (q
, "\\U%08" HOST_WIDE_INT_PRINT
"x",
1507 (unsigned HOST_WIDE_INT
) *p
);
1511 *q
++ = (unsigned char) *p
;
1519 unquote_string (const char *s
)
1525 for (p
= s
, len
= 0; *p
; p
++, len
++)
1532 else if (p
[1] == 'U')
1533 p
+= 9; /* That is a "\U????????". */
1535 gfc_internal_error ("unquote_string(): got bad string");
1538 res
= gfc_get_wide_string (len
+ 1);
1539 for (i
= 0, p
= s
; i
< len
; i
++, p
++)
1544 res
[i
] = (unsigned char) *p
;
1545 else if (p
[1] == '\\')
1547 res
[i
] = (unsigned char) '\\';
1552 /* We read the 8-digits hexadecimal constant that follows. */
1557 gcc_assert (p
[1] == 'U');
1558 for (j
= 0; j
< 8; j
++)
1561 gcc_assert (sscanf (&p
[j
+2], "%01x", &n
) == 1);
1575 /* Read or write a character pointer that points to a wide string on the
1576 heap, performing quoting/unquoting of nonprintable characters using the
1577 form \U???????? (where each ? is a hexadecimal digit).
1578 Length is the length of the string, only known and used in output mode. */
1580 static const gfc_char_t
*
1581 mio_allocated_wide_string (const gfc_char_t
*s
, const size_t length
)
1583 if (iomode
== IO_OUTPUT
)
1585 char *quoted
= quote_string (s
, length
);
1586 write_atom (ATOM_STRING
, quoted
);
1592 gfc_char_t
*unquoted
;
1594 require_atom (ATOM_STRING
);
1595 unquoted
= unquote_string (atom_string
);
1596 gfc_free (atom_string
);
1602 /* Read or write a string that is in static memory. */
1605 mio_pool_string (const char **stringp
)
1607 /* TODO: one could write the string only once, and refer to it via a
1610 /* As a special case we have to deal with a NULL string. This
1611 happens for the 'module' member of 'gfc_symbol's that are not in a
1612 module. We read / write these as the empty string. */
1613 if (iomode
== IO_OUTPUT
)
1615 const char *p
= *stringp
== NULL
? "" : *stringp
;
1616 write_atom (ATOM_STRING
, p
);
1620 require_atom (ATOM_STRING
);
1621 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1622 gfc_free (atom_string
);
1627 /* Read or write a string that is inside of some already-allocated
1631 mio_internal_string (char *string
)
1633 if (iomode
== IO_OUTPUT
)
1634 write_atom (ATOM_STRING
, string
);
1637 require_atom (ATOM_STRING
);
1638 strcpy (string
, atom_string
);
1639 gfc_free (atom_string
);
1645 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1646 AB_POINTER
, AB_TARGET
, AB_DUMMY
, AB_RESULT
, AB_DATA
,
1647 AB_IN_NAMELIST
, AB_IN_COMMON
, AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
,
1648 AB_ELEMENTAL
, AB_PURE
, AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
,
1649 AB_CRAY_POINTER
, AB_CRAY_POINTEE
, AB_THREADPRIVATE
, AB_ALLOC_COMP
,
1650 AB_POINTER_COMP
, AB_PRIVATE_COMP
, AB_VALUE
, AB_VOLATILE
, AB_PROTECTED
,
1651 AB_IS_BIND_C
, AB_IS_C_INTEROP
, AB_IS_ISO_C
, AB_ABSTRACT
, AB_ZERO_COMP
,
1652 AB_EXTENSION
, AB_PROCEDURE
, AB_PROC_POINTER
1656 static const mstring attr_bits
[] =
1658 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1659 minit ("DIMENSION", AB_DIMENSION
),
1660 minit ("EXTERNAL", AB_EXTERNAL
),
1661 minit ("INTRINSIC", AB_INTRINSIC
),
1662 minit ("OPTIONAL", AB_OPTIONAL
),
1663 minit ("POINTER", AB_POINTER
),
1664 minit ("VOLATILE", AB_VOLATILE
),
1665 minit ("TARGET", AB_TARGET
),
1666 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1667 minit ("DUMMY", AB_DUMMY
),
1668 minit ("RESULT", AB_RESULT
),
1669 minit ("DATA", AB_DATA
),
1670 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1671 minit ("IN_COMMON", AB_IN_COMMON
),
1672 minit ("FUNCTION", AB_FUNCTION
),
1673 minit ("SUBROUTINE", AB_SUBROUTINE
),
1674 minit ("SEQUENCE", AB_SEQUENCE
),
1675 minit ("ELEMENTAL", AB_ELEMENTAL
),
1676 minit ("PURE", AB_PURE
),
1677 minit ("RECURSIVE", AB_RECURSIVE
),
1678 minit ("GENERIC", AB_GENERIC
),
1679 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1680 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1681 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1682 minit ("IS_BIND_C", AB_IS_BIND_C
),
1683 minit ("IS_C_INTEROP", AB_IS_C_INTEROP
),
1684 minit ("IS_ISO_C", AB_IS_ISO_C
),
1685 minit ("VALUE", AB_VALUE
),
1686 minit ("ALLOC_COMP", AB_ALLOC_COMP
),
1687 minit ("POINTER_COMP", AB_POINTER_COMP
),
1688 minit ("PRIVATE_COMP", AB_PRIVATE_COMP
),
1689 minit ("ZERO_COMP", AB_ZERO_COMP
),
1690 minit ("PROTECTED", AB_PROTECTED
),
1691 minit ("ABSTRACT", AB_ABSTRACT
),
1692 minit ("EXTENSION", AB_EXTENSION
),
1693 minit ("PROCEDURE", AB_PROCEDURE
),
1694 minit ("PROC_POINTER", AB_PROC_POINTER
),
1698 /* For binding attributes. */
1699 static const mstring binding_passing
[] =
1702 minit ("NOPASS", 1),
1705 static const mstring binding_overriding
[] =
1707 minit ("OVERRIDABLE", 0),
1708 minit ("NON_OVERRIDABLE", 1),
1713 /* Specialization of mio_name. */
1714 DECL_MIO_NAME (ab_attribute
)
1715 DECL_MIO_NAME (ar_type
)
1716 DECL_MIO_NAME (array_type
)
1718 DECL_MIO_NAME (expr_t
)
1719 DECL_MIO_NAME (gfc_access
)
1720 DECL_MIO_NAME (gfc_intrinsic_op
)
1721 DECL_MIO_NAME (ifsrc
)
1722 DECL_MIO_NAME (save_state
)
1723 DECL_MIO_NAME (procedure_type
)
1724 DECL_MIO_NAME (ref_type
)
1725 DECL_MIO_NAME (sym_flavor
)
1726 DECL_MIO_NAME (sym_intent
)
1727 #undef DECL_MIO_NAME
1729 /* Symbol attributes are stored in list with the first three elements
1730 being the enumerated fields, while the remaining elements (if any)
1731 indicate the individual attribute bits. The access field is not
1732 saved-- it controls what symbols are exported when a module is
1736 mio_symbol_attribute (symbol_attribute
*attr
)
1742 attr
->flavor
= MIO_NAME (sym_flavor
) (attr
->flavor
, flavors
);
1743 attr
->intent
= MIO_NAME (sym_intent
) (attr
->intent
, intents
);
1744 attr
->proc
= MIO_NAME (procedure_type
) (attr
->proc
, procedures
);
1745 attr
->if_source
= MIO_NAME (ifsrc
) (attr
->if_source
, ifsrc_types
);
1746 attr
->save
= MIO_NAME (save_state
) (attr
->save
, save_status
);
1748 if (iomode
== IO_OUTPUT
)
1750 if (attr
->allocatable
)
1751 MIO_NAME (ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1752 if (attr
->dimension
)
1753 MIO_NAME (ab_attribute
) (AB_DIMENSION
, attr_bits
);
1755 MIO_NAME (ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1756 if (attr
->intrinsic
)
1757 MIO_NAME (ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1759 MIO_NAME (ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1761 MIO_NAME (ab_attribute
) (AB_POINTER
, attr_bits
);
1762 if (attr
->is_protected
)
1763 MIO_NAME (ab_attribute
) (AB_PROTECTED
, attr_bits
);
1765 MIO_NAME (ab_attribute
) (AB_VALUE
, attr_bits
);
1766 if (attr
->volatile_
)
1767 MIO_NAME (ab_attribute
) (AB_VOLATILE
, attr_bits
);
1769 MIO_NAME (ab_attribute
) (AB_TARGET
, attr_bits
);
1770 if (attr
->threadprivate
)
1771 MIO_NAME (ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1773 MIO_NAME (ab_attribute
) (AB_DUMMY
, attr_bits
);
1775 MIO_NAME (ab_attribute
) (AB_RESULT
, attr_bits
);
1776 /* We deliberately don't preserve the "entry" flag. */
1779 MIO_NAME (ab_attribute
) (AB_DATA
, attr_bits
);
1780 if (attr
->in_namelist
)
1781 MIO_NAME (ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1782 if (attr
->in_common
)
1783 MIO_NAME (ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1786 MIO_NAME (ab_attribute
) (AB_FUNCTION
, attr_bits
);
1787 if (attr
->subroutine
)
1788 MIO_NAME (ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1790 MIO_NAME (ab_attribute
) (AB_GENERIC
, attr_bits
);
1792 MIO_NAME (ab_attribute
) (AB_ABSTRACT
, attr_bits
);
1795 MIO_NAME (ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1796 if (attr
->elemental
)
1797 MIO_NAME (ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1799 MIO_NAME (ab_attribute
) (AB_PURE
, attr_bits
);
1800 if (attr
->recursive
)
1801 MIO_NAME (ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1802 if (attr
->always_explicit
)
1803 MIO_NAME (ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1804 if (attr
->cray_pointer
)
1805 MIO_NAME (ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1806 if (attr
->cray_pointee
)
1807 MIO_NAME (ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1808 if (attr
->is_bind_c
)
1809 MIO_NAME(ab_attribute
) (AB_IS_BIND_C
, attr_bits
);
1810 if (attr
->is_c_interop
)
1811 MIO_NAME(ab_attribute
) (AB_IS_C_INTEROP
, attr_bits
);
1813 MIO_NAME(ab_attribute
) (AB_IS_ISO_C
, attr_bits
);
1814 if (attr
->alloc_comp
)
1815 MIO_NAME (ab_attribute
) (AB_ALLOC_COMP
, attr_bits
);
1816 if (attr
->pointer_comp
)
1817 MIO_NAME (ab_attribute
) (AB_POINTER_COMP
, attr_bits
);
1818 if (attr
->private_comp
)
1819 MIO_NAME (ab_attribute
) (AB_PRIVATE_COMP
, attr_bits
);
1820 if (attr
->zero_comp
)
1821 MIO_NAME (ab_attribute
) (AB_ZERO_COMP
, attr_bits
);
1822 if (attr
->extension
)
1823 MIO_NAME (ab_attribute
) (AB_EXTENSION
, attr_bits
);
1824 if (attr
->procedure
)
1825 MIO_NAME (ab_attribute
) (AB_PROCEDURE
, attr_bits
);
1826 if (attr
->proc_pointer
)
1827 MIO_NAME (ab_attribute
) (AB_PROC_POINTER
, attr_bits
);
1837 if (t
== ATOM_RPAREN
)
1840 bad_module ("Expected attribute bit name");
1842 switch ((ab_attribute
) find_enum (attr_bits
))
1844 case AB_ALLOCATABLE
:
1845 attr
->allocatable
= 1;
1848 attr
->dimension
= 1;
1854 attr
->intrinsic
= 1;
1863 attr
->is_protected
= 1;
1869 attr
->volatile_
= 1;
1874 case AB_THREADPRIVATE
:
1875 attr
->threadprivate
= 1;
1886 case AB_IN_NAMELIST
:
1887 attr
->in_namelist
= 1;
1890 attr
->in_common
= 1;
1896 attr
->subroutine
= 1;
1908 attr
->elemental
= 1;
1914 attr
->recursive
= 1;
1916 case AB_ALWAYS_EXPLICIT
:
1917 attr
->always_explicit
= 1;
1919 case AB_CRAY_POINTER
:
1920 attr
->cray_pointer
= 1;
1922 case AB_CRAY_POINTEE
:
1923 attr
->cray_pointee
= 1;
1926 attr
->is_bind_c
= 1;
1928 case AB_IS_C_INTEROP
:
1929 attr
->is_c_interop
= 1;
1935 attr
->alloc_comp
= 1;
1937 case AB_POINTER_COMP
:
1938 attr
->pointer_comp
= 1;
1940 case AB_PRIVATE_COMP
:
1941 attr
->private_comp
= 1;
1944 attr
->zero_comp
= 1;
1947 attr
->extension
= 1;
1950 attr
->procedure
= 1;
1952 case AB_PROC_POINTER
:
1953 attr
->proc_pointer
= 1;
1961 static const mstring bt_types
[] = {
1962 minit ("INTEGER", BT_INTEGER
),
1963 minit ("REAL", BT_REAL
),
1964 minit ("COMPLEX", BT_COMPLEX
),
1965 minit ("LOGICAL", BT_LOGICAL
),
1966 minit ("CHARACTER", BT_CHARACTER
),
1967 minit ("DERIVED", BT_DERIVED
),
1968 minit ("PROCEDURE", BT_PROCEDURE
),
1969 minit ("UNKNOWN", BT_UNKNOWN
),
1970 minit ("VOID", BT_VOID
),
1976 mio_charlen (gfc_charlen
**clp
)
1982 if (iomode
== IO_OUTPUT
)
1986 mio_expr (&cl
->length
);
1990 if (peek_atom () != ATOM_RPAREN
)
1992 cl
= gfc_get_charlen ();
1993 mio_expr (&cl
->length
);
1997 cl
->next
= gfc_current_ns
->cl_list
;
1998 gfc_current_ns
->cl_list
= cl
;
2006 /* See if a name is a generated name. */
2009 check_unique_name (const char *name
)
2011 return *name
== '@';
2016 mio_typespec (gfc_typespec
*ts
)
2020 ts
->type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2022 if (ts
->type
!= BT_DERIVED
)
2023 mio_integer (&ts
->kind
);
2025 mio_symbol_ref (&ts
->derived
);
2027 /* Add info for C interop and is_iso_c. */
2028 mio_integer (&ts
->is_c_interop
);
2029 mio_integer (&ts
->is_iso_c
);
2031 /* If the typespec is for an identifier either from iso_c_binding, or
2032 a constant that was initialized to an identifier from it, use the
2033 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
2035 ts
->f90_type
= MIO_NAME (bt
) (ts
->f90_type
, bt_types
);
2037 ts
->f90_type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2039 if (ts
->type
!= BT_CHARACTER
)
2041 /* ts->cl is only valid for BT_CHARACTER. */
2046 mio_charlen (&ts
->cl
);
2052 static const mstring array_spec_types
[] = {
2053 minit ("EXPLICIT", AS_EXPLICIT
),
2054 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
2055 minit ("DEFERRED", AS_DEFERRED
),
2056 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
2062 mio_array_spec (gfc_array_spec
**asp
)
2069 if (iomode
== IO_OUTPUT
)
2077 if (peek_atom () == ATOM_RPAREN
)
2083 *asp
= as
= gfc_get_array_spec ();
2086 mio_integer (&as
->rank
);
2087 as
->type
= MIO_NAME (array_type
) (as
->type
, array_spec_types
);
2089 for (i
= 0; i
< as
->rank
; i
++)
2091 mio_expr (&as
->lower
[i
]);
2092 mio_expr (&as
->upper
[i
]);
2100 /* Given a pointer to an array reference structure (which lives in a
2101 gfc_ref structure), find the corresponding array specification
2102 structure. Storing the pointer in the ref structure doesn't quite
2103 work when loading from a module. Generating code for an array
2104 reference also needs more information than just the array spec. */
2106 static const mstring array_ref_types
[] = {
2107 minit ("FULL", AR_FULL
),
2108 minit ("ELEMENT", AR_ELEMENT
),
2109 minit ("SECTION", AR_SECTION
),
2115 mio_array_ref (gfc_array_ref
*ar
)
2120 ar
->type
= MIO_NAME (ar_type
) (ar
->type
, array_ref_types
);
2121 mio_integer (&ar
->dimen
);
2129 for (i
= 0; i
< ar
->dimen
; i
++)
2130 mio_expr (&ar
->start
[i
]);
2135 for (i
= 0; i
< ar
->dimen
; i
++)
2137 mio_expr (&ar
->start
[i
]);
2138 mio_expr (&ar
->end
[i
]);
2139 mio_expr (&ar
->stride
[i
]);
2145 gfc_internal_error ("mio_array_ref(): Unknown array ref");
2148 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
2149 we can't call mio_integer directly. Instead loop over each element
2150 and cast it to/from an integer. */
2151 if (iomode
== IO_OUTPUT
)
2153 for (i
= 0; i
< ar
->dimen
; i
++)
2155 int tmp
= (int)ar
->dimen_type
[i
];
2156 write_atom (ATOM_INTEGER
, &tmp
);
2161 for (i
= 0; i
< ar
->dimen
; i
++)
2163 require_atom (ATOM_INTEGER
);
2164 ar
->dimen_type
[i
] = atom_int
;
2168 if (iomode
== IO_INPUT
)
2170 ar
->where
= gfc_current_locus
;
2172 for (i
= 0; i
< ar
->dimen
; i
++)
2173 ar
->c_where
[i
] = gfc_current_locus
;
2180 /* Saves or restores a pointer. The pointer is converted back and
2181 forth from an integer. We return the pointer_info pointer so that
2182 the caller can take additional action based on the pointer type. */
2184 static pointer_info
*
2185 mio_pointer_ref (void *gp
)
2189 if (iomode
== IO_OUTPUT
)
2191 p
= get_pointer (*((char **) gp
));
2192 write_atom (ATOM_INTEGER
, &p
->integer
);
2196 require_atom (ATOM_INTEGER
);
2197 p
= add_fixup (atom_int
, gp
);
2204 /* Save and load references to components that occur within
2205 expressions. We have to describe these references by a number and
2206 by name. The number is necessary for forward references during
2207 reading, and the name is necessary if the symbol already exists in
2208 the namespace and is not loaded again. */
2211 mio_component_ref (gfc_component
**cp
, gfc_symbol
*sym
)
2213 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2217 p
= mio_pointer_ref (cp
);
2218 if (p
->type
== P_UNKNOWN
)
2219 p
->type
= P_COMPONENT
;
2221 if (iomode
== IO_OUTPUT
)
2222 mio_pool_string (&(*cp
)->name
);
2225 mio_internal_string (name
);
2227 /* It can happen that a component reference can be read before the
2228 associated derived type symbol has been loaded. Return now and
2229 wait for a later iteration of load_needed. */
2233 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
2235 /* Symbol already loaded, so search by name. */
2236 for (q
= sym
->components
; q
; q
= q
->next
)
2237 if (strcmp (q
->name
, name
) == 0)
2241 gfc_internal_error ("mio_component_ref(): Component not found");
2243 associate_integer_pointer (p
, q
);
2246 /* Make sure this symbol will eventually be loaded. */
2247 p
= find_pointer2 (sym
);
2248 if (p
->u
.rsym
.state
== UNUSED
)
2249 p
->u
.rsym
.state
= NEEDED
;
2255 mio_component (gfc_component
*c
)
2262 if (iomode
== IO_OUTPUT
)
2264 p
= get_pointer (c
);
2265 mio_integer (&p
->integer
);
2270 p
= get_integer (n
);
2271 associate_integer_pointer (p
, c
);
2274 if (p
->type
== P_UNKNOWN
)
2275 p
->type
= P_COMPONENT
;
2277 mio_pool_string (&c
->name
);
2278 mio_typespec (&c
->ts
);
2279 mio_array_spec (&c
->as
);
2281 mio_symbol_attribute (&c
->attr
);
2282 c
->attr
.access
= MIO_NAME (gfc_access
) (c
->attr
.access
, access_types
);
2284 mio_expr (&c
->initializer
);
2290 mio_component_list (gfc_component
**cp
)
2292 gfc_component
*c
, *tail
;
2296 if (iomode
== IO_OUTPUT
)
2298 for (c
= *cp
; c
; c
= c
->next
)
2308 if (peek_atom () == ATOM_RPAREN
)
2311 c
= gfc_get_component ();
2328 mio_actual_arg (gfc_actual_arglist
*a
)
2331 mio_pool_string (&a
->name
);
2332 mio_expr (&a
->expr
);
2338 mio_actual_arglist (gfc_actual_arglist
**ap
)
2340 gfc_actual_arglist
*a
, *tail
;
2344 if (iomode
== IO_OUTPUT
)
2346 for (a
= *ap
; a
; a
= a
->next
)
2356 if (peek_atom () != ATOM_LPAREN
)
2359 a
= gfc_get_actual_arglist ();
2375 /* Read and write formal argument lists. */
2378 mio_formal_arglist (gfc_symbol
*sym
)
2380 gfc_formal_arglist
*f
, *tail
;
2384 if (iomode
== IO_OUTPUT
)
2386 for (f
= sym
->formal
; f
; f
= f
->next
)
2387 mio_symbol_ref (&f
->sym
);
2391 sym
->formal
= tail
= NULL
;
2393 while (peek_atom () != ATOM_RPAREN
)
2395 f
= gfc_get_formal_arglist ();
2396 mio_symbol_ref (&f
->sym
);
2398 if (sym
->formal
== NULL
)
2411 /* Save or restore a reference to a symbol node. */
2414 mio_symbol_ref (gfc_symbol
**symp
)
2418 p
= mio_pointer_ref (symp
);
2419 if (p
->type
== P_UNKNOWN
)
2422 if (iomode
== IO_OUTPUT
)
2424 if (p
->u
.wsym
.state
== UNREFERENCED
)
2425 p
->u
.wsym
.state
= NEEDS_WRITE
;
2429 if (p
->u
.rsym
.state
== UNUSED
)
2430 p
->u
.rsym
.state
= NEEDED
;
2436 /* Save or restore a reference to a symtree node. */
2439 mio_symtree_ref (gfc_symtree
**stp
)
2444 if (iomode
== IO_OUTPUT
)
2445 mio_symbol_ref (&(*stp
)->n
.sym
);
2448 require_atom (ATOM_INTEGER
);
2449 p
= get_integer (atom_int
);
2451 /* An unused equivalence member; make a symbol and a symtree
2453 if (in_load_equiv
&& p
->u
.rsym
.symtree
== NULL
)
2455 /* Since this is not used, it must have a unique name. */
2456 p
->u
.rsym
.symtree
= gfc_get_unique_symtree (gfc_current_ns
);
2458 /* Make the symbol. */
2459 if (p
->u
.rsym
.sym
== NULL
)
2461 p
->u
.rsym
.sym
= gfc_new_symbol (p
->u
.rsym
.true_name
,
2463 p
->u
.rsym
.sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
2466 p
->u
.rsym
.symtree
->n
.sym
= p
->u
.rsym
.sym
;
2467 p
->u
.rsym
.symtree
->n
.sym
->refs
++;
2468 p
->u
.rsym
.referenced
= 1;
2470 /* If the symbol is PRIVATE and in COMMON, load_commons will
2471 generate a fixup symbol, which must be associated. */
2473 resolve_fixups (p
->fixup
, p
->u
.rsym
.sym
);
2477 if (p
->type
== P_UNKNOWN
)
2480 if (p
->u
.rsym
.state
== UNUSED
)
2481 p
->u
.rsym
.state
= NEEDED
;
2483 if (p
->u
.rsym
.symtree
!= NULL
)
2485 *stp
= p
->u
.rsym
.symtree
;
2489 f
= XCNEW (fixup_t
);
2491 f
->next
= p
->u
.rsym
.stfixup
;
2492 p
->u
.rsym
.stfixup
= f
;
2494 f
->pointer
= (void **) stp
;
2501 mio_iterator (gfc_iterator
**ip
)
2507 if (iomode
== IO_OUTPUT
)
2514 if (peek_atom () == ATOM_RPAREN
)
2520 *ip
= gfc_get_iterator ();
2525 mio_expr (&iter
->var
);
2526 mio_expr (&iter
->start
);
2527 mio_expr (&iter
->end
);
2528 mio_expr (&iter
->step
);
2536 mio_constructor (gfc_constructor
**cp
)
2538 gfc_constructor
*c
, *tail
;
2542 if (iomode
== IO_OUTPUT
)
2544 for (c
= *cp
; c
; c
= c
->next
)
2547 mio_expr (&c
->expr
);
2548 mio_iterator (&c
->iterator
);
2557 while (peek_atom () != ATOM_RPAREN
)
2559 c
= gfc_get_constructor ();
2569 mio_expr (&c
->expr
);
2570 mio_iterator (&c
->iterator
);
2579 static const mstring ref_types
[] = {
2580 minit ("ARRAY", REF_ARRAY
),
2581 minit ("COMPONENT", REF_COMPONENT
),
2582 minit ("SUBSTRING", REF_SUBSTRING
),
2588 mio_ref (gfc_ref
**rp
)
2595 r
->type
= MIO_NAME (ref_type
) (r
->type
, ref_types
);
2600 mio_array_ref (&r
->u
.ar
);
2604 mio_symbol_ref (&r
->u
.c
.sym
);
2605 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2609 mio_expr (&r
->u
.ss
.start
);
2610 mio_expr (&r
->u
.ss
.end
);
2611 mio_charlen (&r
->u
.ss
.length
);
2620 mio_ref_list (gfc_ref
**rp
)
2622 gfc_ref
*ref
, *head
, *tail
;
2626 if (iomode
== IO_OUTPUT
)
2628 for (ref
= *rp
; ref
; ref
= ref
->next
)
2635 while (peek_atom () != ATOM_RPAREN
)
2638 head
= tail
= gfc_get_ref ();
2641 tail
->next
= gfc_get_ref ();
2655 /* Read and write an integer value. */
2658 mio_gmp_integer (mpz_t
*integer
)
2662 if (iomode
== IO_INPUT
)
2664 if (parse_atom () != ATOM_STRING
)
2665 bad_module ("Expected integer string");
2667 mpz_init (*integer
);
2668 if (mpz_set_str (*integer
, atom_string
, 10))
2669 bad_module ("Error converting integer");
2671 gfc_free (atom_string
);
2675 p
= mpz_get_str (NULL
, 10, *integer
);
2676 write_atom (ATOM_STRING
, p
);
2683 mio_gmp_real (mpfr_t
*real
)
2688 if (iomode
== IO_INPUT
)
2690 if (parse_atom () != ATOM_STRING
)
2691 bad_module ("Expected real string");
2694 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2695 gfc_free (atom_string
);
2699 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2701 if (mpfr_nan_p (*real
) || mpfr_inf_p (*real
))
2703 write_atom (ATOM_STRING
, p
);
2708 atom_string
= XCNEWVEC (char, strlen (p
) + 20);
2710 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2712 /* Fix negative numbers. */
2713 if (atom_string
[2] == '-')
2715 atom_string
[0] = '-';
2716 atom_string
[1] = '0';
2717 atom_string
[2] = '.';
2720 write_atom (ATOM_STRING
, atom_string
);
2722 gfc_free (atom_string
);
2728 /* Save and restore the shape of an array constructor. */
2731 mio_shape (mpz_t
**pshape
, int rank
)
2737 /* A NULL shape is represented by (). */
2740 if (iomode
== IO_OUTPUT
)
2752 if (t
== ATOM_RPAREN
)
2759 shape
= gfc_get_shape (rank
);
2763 for (n
= 0; n
< rank
; n
++)
2764 mio_gmp_integer (&shape
[n
]);
2770 static const mstring expr_types
[] = {
2771 minit ("OP", EXPR_OP
),
2772 minit ("FUNCTION", EXPR_FUNCTION
),
2773 minit ("CONSTANT", EXPR_CONSTANT
),
2774 minit ("VARIABLE", EXPR_VARIABLE
),
2775 minit ("SUBSTRING", EXPR_SUBSTRING
),
2776 minit ("STRUCTURE", EXPR_STRUCTURE
),
2777 minit ("ARRAY", EXPR_ARRAY
),
2778 minit ("NULL", EXPR_NULL
),
2779 minit ("COMPCALL", EXPR_COMPCALL
),
2783 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2784 generic operators, not in expressions. INTRINSIC_USER is also
2785 replaced by the correct function name by the time we see it. */
2787 static const mstring intrinsics
[] =
2789 minit ("UPLUS", INTRINSIC_UPLUS
),
2790 minit ("UMINUS", INTRINSIC_UMINUS
),
2791 minit ("PLUS", INTRINSIC_PLUS
),
2792 minit ("MINUS", INTRINSIC_MINUS
),
2793 minit ("TIMES", INTRINSIC_TIMES
),
2794 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2795 minit ("POWER", INTRINSIC_POWER
),
2796 minit ("CONCAT", INTRINSIC_CONCAT
),
2797 minit ("AND", INTRINSIC_AND
),
2798 minit ("OR", INTRINSIC_OR
),
2799 minit ("EQV", INTRINSIC_EQV
),
2800 minit ("NEQV", INTRINSIC_NEQV
),
2801 minit ("EQ_SIGN", INTRINSIC_EQ
),
2802 minit ("EQ", INTRINSIC_EQ_OS
),
2803 minit ("NE_SIGN", INTRINSIC_NE
),
2804 minit ("NE", INTRINSIC_NE_OS
),
2805 minit ("GT_SIGN", INTRINSIC_GT
),
2806 minit ("GT", INTRINSIC_GT_OS
),
2807 minit ("GE_SIGN", INTRINSIC_GE
),
2808 minit ("GE", INTRINSIC_GE_OS
),
2809 minit ("LT_SIGN", INTRINSIC_LT
),
2810 minit ("LT", INTRINSIC_LT_OS
),
2811 minit ("LE_SIGN", INTRINSIC_LE
),
2812 minit ("LE", INTRINSIC_LE_OS
),
2813 minit ("NOT", INTRINSIC_NOT
),
2814 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2819 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2822 fix_mio_expr (gfc_expr
*e
)
2824 gfc_symtree
*ns_st
= NULL
;
2827 if (iomode
!= IO_OUTPUT
)
2832 /* If this is a symtree for a symbol that came from a contained module
2833 namespace, it has a unique name and we should look in the current
2834 namespace to see if the required, non-contained symbol is available
2835 yet. If so, the latter should be written. */
2836 if (e
->symtree
->n
.sym
&& check_unique_name (e
->symtree
->name
))
2837 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2838 e
->symtree
->n
.sym
->name
);
2840 /* On the other hand, if the existing symbol is the module name or the
2841 new symbol is a dummy argument, do not do the promotion. */
2842 if (ns_st
&& ns_st
->n
.sym
2843 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2844 && !e
->symtree
->n
.sym
->attr
.dummy
)
2847 else if (e
->expr_type
== EXPR_FUNCTION
&& e
->value
.function
.name
)
2849 /* In some circumstances, a function used in an initialization
2850 expression, in one use associated module, can fail to be
2851 coupled to its symtree when used in a specification
2852 expression in another module. */
2853 fname
= e
->value
.function
.esym
? e
->value
.function
.esym
->name
2854 : e
->value
.function
.isym
->name
;
2855 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2860 /* Read and write expressions. The form "()" is allowed to indicate a
2864 mio_expr (gfc_expr
**ep
)
2872 if (iomode
== IO_OUTPUT
)
2881 MIO_NAME (expr_t
) (e
->expr_type
, expr_types
);
2886 if (t
== ATOM_RPAREN
)
2893 bad_module ("Expected expression type");
2895 e
= *ep
= gfc_get_expr ();
2896 e
->where
= gfc_current_locus
;
2897 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2900 mio_typespec (&e
->ts
);
2901 mio_integer (&e
->rank
);
2905 switch (e
->expr_type
)
2909 = MIO_NAME (gfc_intrinsic_op
) (e
->value
.op
.op
, intrinsics
);
2911 switch (e
->value
.op
.op
)
2913 case INTRINSIC_UPLUS
:
2914 case INTRINSIC_UMINUS
:
2916 case INTRINSIC_PARENTHESES
:
2917 mio_expr (&e
->value
.op
.op1
);
2920 case INTRINSIC_PLUS
:
2921 case INTRINSIC_MINUS
:
2922 case INTRINSIC_TIMES
:
2923 case INTRINSIC_DIVIDE
:
2924 case INTRINSIC_POWER
:
2925 case INTRINSIC_CONCAT
:
2929 case INTRINSIC_NEQV
:
2931 case INTRINSIC_EQ_OS
:
2933 case INTRINSIC_NE_OS
:
2935 case INTRINSIC_GT_OS
:
2937 case INTRINSIC_GE_OS
:
2939 case INTRINSIC_LT_OS
:
2941 case INTRINSIC_LE_OS
:
2942 mio_expr (&e
->value
.op
.op1
);
2943 mio_expr (&e
->value
.op
.op2
);
2947 bad_module ("Bad operator");
2953 mio_symtree_ref (&e
->symtree
);
2954 mio_actual_arglist (&e
->value
.function
.actual
);
2956 if (iomode
== IO_OUTPUT
)
2958 e
->value
.function
.name
2959 = mio_allocated_string (e
->value
.function
.name
);
2960 flag
= e
->value
.function
.esym
!= NULL
;
2961 mio_integer (&flag
);
2963 mio_symbol_ref (&e
->value
.function
.esym
);
2965 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
2969 require_atom (ATOM_STRING
);
2970 e
->value
.function
.name
= gfc_get_string (atom_string
);
2971 gfc_free (atom_string
);
2973 mio_integer (&flag
);
2975 mio_symbol_ref (&e
->value
.function
.esym
);
2978 require_atom (ATOM_STRING
);
2979 e
->value
.function
.isym
= gfc_find_function (atom_string
);
2980 gfc_free (atom_string
);
2987 mio_symtree_ref (&e
->symtree
);
2988 mio_ref_list (&e
->ref
);
2991 case EXPR_SUBSTRING
:
2992 e
->value
.character
.string
2993 = CONST_CAST (gfc_char_t
*,
2994 mio_allocated_wide_string (e
->value
.character
.string
,
2995 e
->value
.character
.length
));
2996 mio_ref_list (&e
->ref
);
2999 case EXPR_STRUCTURE
:
3001 mio_constructor (&e
->value
.constructor
);
3002 mio_shape (&e
->shape
, e
->rank
);
3009 mio_gmp_integer (&e
->value
.integer
);
3013 gfc_set_model_kind (e
->ts
.kind
);
3014 mio_gmp_real (&e
->value
.real
);
3018 gfc_set_model_kind (e
->ts
.kind
);
3019 mio_gmp_real (&e
->value
.complex.r
);
3020 mio_gmp_real (&e
->value
.complex.i
);
3024 mio_integer (&e
->value
.logical
);
3028 mio_integer (&e
->value
.character
.length
);
3029 e
->value
.character
.string
3030 = CONST_CAST (gfc_char_t
*,
3031 mio_allocated_wide_string (e
->value
.character
.string
,
3032 e
->value
.character
.length
));
3036 bad_module ("Bad type in constant expression");
3053 /* Read and write namelists. */
3056 mio_namelist (gfc_symbol
*sym
)
3058 gfc_namelist
*n
, *m
;
3059 const char *check_name
;
3063 if (iomode
== IO_OUTPUT
)
3065 for (n
= sym
->namelist
; n
; n
= n
->next
)
3066 mio_symbol_ref (&n
->sym
);
3070 /* This departure from the standard is flagged as an error.
3071 It does, in fact, work correctly. TODO: Allow it
3073 if (sym
->attr
.flavor
== FL_NAMELIST
)
3075 check_name
= find_use_name (sym
->name
, false);
3076 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
3077 gfc_error ("Namelist %s cannot be renamed by USE "
3078 "association to %s", sym
->name
, check_name
);
3082 while (peek_atom () != ATOM_RPAREN
)
3084 n
= gfc_get_namelist ();
3085 mio_symbol_ref (&n
->sym
);
3087 if (sym
->namelist
== NULL
)
3094 sym
->namelist_tail
= m
;
3101 /* Save/restore lists of gfc_interface structures. When loading an
3102 interface, we are really appending to the existing list of
3103 interfaces. Checking for duplicate and ambiguous interfaces has to
3104 be done later when all symbols have been loaded. */
3107 mio_interface_rest (gfc_interface
**ip
)
3109 gfc_interface
*tail
, *p
;
3110 pointer_info
*pi
= NULL
;
3112 if (iomode
== IO_OUTPUT
)
3115 for (p
= *ip
; p
; p
= p
->next
)
3116 mio_symbol_ref (&p
->sym
);
3131 if (peek_atom () == ATOM_RPAREN
)
3134 p
= gfc_get_interface ();
3135 p
->where
= gfc_current_locus
;
3136 pi
= mio_symbol_ref (&p
->sym
);
3152 /* Save/restore a nameless operator interface. */
3155 mio_interface (gfc_interface
**ip
)
3158 mio_interface_rest (ip
);
3162 /* Save/restore a named operator interface. */
3165 mio_symbol_interface (const char **name
, const char **module
,
3169 mio_pool_string (name
);
3170 mio_pool_string (module
);
3171 mio_interface_rest (ip
);
3176 mio_namespace_ref (gfc_namespace
**nsp
)
3181 p
= mio_pointer_ref (nsp
);
3183 if (p
->type
== P_UNKNOWN
)
3184 p
->type
= P_NAMESPACE
;
3186 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
3188 ns
= (gfc_namespace
*) p
->u
.pointer
;
3191 ns
= gfc_get_namespace (NULL
, 0);
3192 associate_integer_pointer (p
, ns
);
3200 /* Save/restore the f2k_derived namespace of a derived-type symbol. */
3203 mio_typebound_proc (gfc_typebound_proc
** proc
)
3207 if (iomode
== IO_INPUT
)
3209 *proc
= gfc_get_typebound_proc ();
3210 (*proc
)->where
= gfc_current_locus
;
3215 mio_symtree_ref (&(*proc
)->target
);
3217 (*proc
)->access
= MIO_NAME (gfc_access
) ((*proc
)->access
, access_types
);
3219 (*proc
)->nopass
= mio_name ((*proc
)->nopass
, binding_passing
);
3220 (*proc
)->non_overridable
= mio_name ((*proc
)->non_overridable
,
3221 binding_overriding
);
3223 if (iomode
== IO_INPUT
)
3224 (*proc
)->pass_arg
= NULL
;
3226 flag
= (int) (*proc
)->pass_arg_num
;
3227 mio_integer (&flag
);
3228 (*proc
)->pass_arg_num
= (unsigned) flag
;
3234 mio_typebound_symtree (gfc_symtree
* st
)
3236 if (iomode
== IO_OUTPUT
&& !st
->typebound
)
3239 if (iomode
== IO_OUTPUT
)
3242 mio_allocated_string (st
->name
);
3244 /* For IO_INPUT, the above is done in mio_f2k_derived. */
3246 mio_typebound_proc (&st
->typebound
);
3251 mio_finalizer (gfc_finalizer
**f
)
3253 if (iomode
== IO_OUTPUT
)
3256 gcc_assert ((*f
)->proc_tree
); /* Should already be resolved. */
3257 mio_symtree_ref (&(*f
)->proc_tree
);
3261 *f
= gfc_get_finalizer ();
3262 (*f
)->where
= gfc_current_locus
; /* Value should not matter. */
3265 mio_symtree_ref (&(*f
)->proc_tree
);
3266 (*f
)->proc_sym
= NULL
;
3271 mio_f2k_derived (gfc_namespace
*f2k
)
3273 /* Handle the list of finalizer procedures. */
3275 if (iomode
== IO_OUTPUT
)
3278 for (f
= f2k
->finalizers
; f
; f
= f
->next
)
3283 f2k
->finalizers
= NULL
;
3284 while (peek_atom () != ATOM_RPAREN
)
3287 mio_finalizer (&cur
);
3288 cur
->next
= f2k
->finalizers
;
3289 f2k
->finalizers
= cur
;
3294 /* Handle type-bound procedures. */
3296 if (iomode
== IO_OUTPUT
)
3297 gfc_traverse_symtree (f2k
->sym_root
, &mio_typebound_symtree
);
3300 while (peek_atom () == ATOM_LPAREN
)
3306 require_atom (ATOM_STRING
);
3307 gfc_get_sym_tree (atom_string
, f2k
, &st
);
3308 gfc_free (atom_string
);
3310 mio_typebound_symtree (st
);
3317 mio_full_f2k_derived (gfc_symbol
*sym
)
3321 if (iomode
== IO_OUTPUT
)
3323 if (sym
->f2k_derived
)
3324 mio_f2k_derived (sym
->f2k_derived
);
3328 if (peek_atom () != ATOM_RPAREN
)
3330 sym
->f2k_derived
= gfc_get_namespace (NULL
, 0);
3331 mio_f2k_derived (sym
->f2k_derived
);
3334 gcc_assert (!sym
->f2k_derived
);
3341 /* Unlike most other routines, the address of the symbol node is already
3342 fixed on input and the name/module has already been filled in. */
3345 mio_symbol (gfc_symbol
*sym
)
3347 int intmod
= INTMOD_NONE
;
3349 gfc_formal_arglist
*formal
;
3353 mio_symbol_attribute (&sym
->attr
);
3354 mio_typespec (&sym
->ts
);
3356 /* Contained procedures don't have formal namespaces. Instead we output the
3357 procedure namespace. The will contain the formal arguments. */
3358 if (iomode
== IO_OUTPUT
)
3360 formal
= sym
->formal
;
3361 while (formal
&& !formal
->sym
)
3362 formal
= formal
->next
;
3365 mio_namespace_ref (&formal
->sym
->ns
);
3367 mio_namespace_ref (&sym
->formal_ns
);
3371 mio_namespace_ref (&sym
->formal_ns
);
3374 sym
->formal_ns
->proc_name
= sym
;
3379 /* Save/restore common block links. */
3380 mio_symbol_ref (&sym
->common_next
);
3382 mio_formal_arglist (sym
);
3384 if (sym
->attr
.flavor
== FL_PARAMETER
)
3385 mio_expr (&sym
->value
);
3387 mio_array_spec (&sym
->as
);
3389 mio_symbol_ref (&sym
->result
);
3391 if (sym
->attr
.cray_pointee
)
3392 mio_symbol_ref (&sym
->cp_pointer
);
3394 /* Note that components are always saved, even if they are supposed
3395 to be private. Component access is checked during searching. */
3397 mio_component_list (&sym
->components
);
3399 if (sym
->components
!= NULL
)
3400 sym
->component_access
3401 = MIO_NAME (gfc_access
) (sym
->component_access
, access_types
);
3403 /* Load/save the f2k_derived namespace of a derived-type symbol. */
3404 mio_full_f2k_derived (sym
);
3408 /* Add the fields that say whether this is from an intrinsic module,
3409 and if so, what symbol it is within the module. */
3410 /* mio_integer (&(sym->from_intmod)); */
3411 if (iomode
== IO_OUTPUT
)
3413 intmod
= sym
->from_intmod
;
3414 mio_integer (&intmod
);
3418 mio_integer (&intmod
);
3419 sym
->from_intmod
= intmod
;
3422 mio_integer (&(sym
->intmod_sym_id
));
3428 /************************* Top level subroutines *************************/
3430 /* Given a root symtree node and a symbol, try to find a symtree that
3431 references the symbol that is not a unique name. */
3433 static gfc_symtree
*
3434 find_symtree_for_symbol (gfc_symtree
*st
, gfc_symbol
*sym
)
3436 gfc_symtree
*s
= NULL
;
3441 s
= find_symtree_for_symbol (st
->right
, sym
);
3444 s
= find_symtree_for_symbol (st
->left
, sym
);
3448 if (st
->n
.sym
== sym
&& !check_unique_name (st
->name
))
3455 /* A recursive function to look for a specific symbol by name and by
3456 module. Whilst several symtrees might point to one symbol, its
3457 is sufficient for the purposes here than one exist. Note that
3458 generic interfaces are distinguished as are symbols that have been
3459 renamed in another module. */
3460 static gfc_symtree
*
3461 find_symbol (gfc_symtree
*st
, const char *name
,
3462 const char *module
, int generic
)
3465 gfc_symtree
*retval
, *s
;
3467 if (st
== NULL
|| st
->n
.sym
== NULL
)
3470 c
= strcmp (name
, st
->n
.sym
->name
);
3471 if (c
== 0 && st
->n
.sym
->module
3472 && strcmp (module
, st
->n
.sym
->module
) == 0
3473 && !check_unique_name (st
->name
))
3475 s
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3477 /* Detect symbols that are renamed by use association in another
3478 module by the absence of a symtree and null attr.use_rename,
3479 since the latter is not transmitted in the module file. */
3480 if (((!generic
&& !st
->n
.sym
->attr
.generic
)
3481 || (generic
&& st
->n
.sym
->attr
.generic
))
3482 && !(s
== NULL
&& !st
->n
.sym
->attr
.use_rename
))
3486 retval
= find_symbol (st
->left
, name
, module
, generic
);
3489 retval
= find_symbol (st
->right
, name
, module
, generic
);
3495 /* Skip a list between balanced left and right parens. */
3505 switch (parse_atom ())
3516 gfc_free (atom_string
);
3528 /* Load operator interfaces from the module. Interfaces are unusual
3529 in that they attach themselves to existing symbols. */
3532 load_operator_interfaces (void)
3535 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3537 pointer_info
*pi
= NULL
;
3542 while (peek_atom () != ATOM_RPAREN
)
3546 mio_internal_string (name
);
3547 mio_internal_string (module
);
3549 n
= number_use_names (name
, true);
3552 for (i
= 1; i
<= n
; i
++)
3554 /* Decide if we need to load this one or not. */
3555 p
= find_use_name_n (name
, &i
, true);
3559 while (parse_atom () != ATOM_RPAREN
);
3565 uop
= gfc_get_uop (p
);
3566 pi
= mio_interface_rest (&uop
->op
);
3570 if (gfc_find_uop (p
, NULL
))
3572 uop
= gfc_get_uop (p
);
3573 uop
->op
= gfc_get_interface ();
3574 uop
->op
->where
= gfc_current_locus
;
3575 add_fixup (pi
->integer
, &uop
->op
->sym
);
3584 /* Load interfaces from the module. Interfaces are unusual in that
3585 they attach themselves to existing symbols. */
3588 load_generic_interfaces (void)
3591 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3593 gfc_interface
*generic
= NULL
;
3598 while (peek_atom () != ATOM_RPAREN
)
3602 mio_internal_string (name
);
3603 mio_internal_string (module
);
3605 n
= number_use_names (name
, false);
3606 renamed
= n
? 1 : 0;
3609 for (i
= 1; i
<= n
; i
++)
3612 /* Decide if we need to load this one or not. */
3613 p
= find_use_name_n (name
, &i
, false);
3615 st
= find_symbol (gfc_current_ns
->sym_root
,
3616 name
, module_name
, 1);
3618 if (!p
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
3620 /* Skip the specific names for these cases. */
3621 while (i
== 1 && parse_atom () != ATOM_RPAREN
);
3626 /* If the symbol exists already and is being USEd without being
3627 in an ONLY clause, do not load a new symtree(11.3.2). */
3628 if (!only_flag
&& st
)
3633 /* Make the symbol inaccessible if it has been added by a USE
3634 statement without an ONLY(11.3.2). */
3636 && !st
->n
.sym
->attr
.use_only
3637 && !st
->n
.sym
->attr
.use_rename
3638 && strcmp (st
->n
.sym
->module
, module_name
) == 0)
3641 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3642 st
= gfc_get_unique_symtree (gfc_current_ns
);
3649 if (strcmp (st
->name
, p
) != 0)
3651 st
= gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3657 /* Since we haven't found a valid generic interface, we had
3661 gfc_get_symbol (p
, NULL
, &sym
);
3662 sym
->name
= gfc_get_string (name
);
3663 sym
->module
= gfc_get_string (module_name
);
3664 sym
->attr
.flavor
= FL_PROCEDURE
;
3665 sym
->attr
.generic
= 1;
3666 sym
->attr
.use_assoc
= 1;
3671 /* Unless sym is a generic interface, this reference
3674 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3678 if (st
&& !sym
->attr
.generic
3680 && strcmp(module
, sym
->module
))
3684 sym
->attr
.use_only
= only_flag
;
3685 sym
->attr
.use_rename
= renamed
;
3689 mio_interface_rest (&sym
->generic
);
3690 generic
= sym
->generic
;
3692 else if (!sym
->generic
)
3694 sym
->generic
= generic
;
3695 sym
->attr
.generic_copy
= 1;
3704 /* Load common blocks. */
3709 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3714 while (peek_atom () != ATOM_RPAREN
)
3718 mio_internal_string (name
);
3720 p
= gfc_get_common (name
, 1);
3722 mio_symbol_ref (&p
->head
);
3723 mio_integer (&flags
);
3727 p
->threadprivate
= 1;
3730 /* Get whether this was a bind(c) common or not. */
3731 mio_integer (&p
->is_bind_c
);
3732 /* Get the binding label. */
3733 mio_internal_string (p
->binding_label
);
3742 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3743 so that unused variables are not loaded and so that the expression can
3749 gfc_equiv
*head
, *tail
, *end
, *eq
;
3753 in_load_equiv
= true;
3755 end
= gfc_current_ns
->equiv
;
3756 while (end
!= NULL
&& end
->next
!= NULL
)
3759 while (peek_atom () != ATOM_RPAREN
) {
3763 while(peek_atom () != ATOM_RPAREN
)
3766 head
= tail
= gfc_get_equiv ();
3769 tail
->eq
= gfc_get_equiv ();
3773 mio_pool_string (&tail
->module
);
3774 mio_expr (&tail
->expr
);
3777 /* Unused equivalence members have a unique name. */
3779 for (eq
= head
; eq
; eq
= eq
->eq
)
3781 if (!check_unique_name (eq
->expr
->symtree
->name
))
3790 for (eq
= head
; eq
; eq
= head
)
3793 gfc_free_expr (eq
->expr
);
3799 gfc_current_ns
->equiv
= head
;
3810 in_load_equiv
= false;
3814 /* Recursive function to traverse the pointer_info tree and load a
3815 needed symbol. We return nonzero if we load a symbol and stop the
3816 traversal, because the act of loading can alter the tree. */
3819 load_needed (pointer_info
*p
)
3830 rv
|= load_needed (p
->left
);
3831 rv
|= load_needed (p
->right
);
3833 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
3836 p
->u
.rsym
.state
= USED
;
3838 set_module_locus (&p
->u
.rsym
.where
);
3840 sym
= p
->u
.rsym
.sym
;
3843 q
= get_integer (p
->u
.rsym
.ns
);
3845 ns
= (gfc_namespace
*) q
->u
.pointer
;
3848 /* Create an interface namespace if necessary. These are
3849 the namespaces that hold the formal parameters of module
3852 ns
= gfc_get_namespace (NULL
, 0);
3853 associate_integer_pointer (q
, ns
);
3856 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
3857 doesn't go pear-shaped if the symbol is used. */
3859 gfc_find_symbol (p
->u
.rsym
.module
, gfc_current_ns
,
3862 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
3863 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
3864 strcpy (sym
->binding_label
, p
->u
.rsym
.binding_label
);
3866 associate_integer_pointer (p
, sym
);
3870 sym
->attr
.use_assoc
= 1;
3872 sym
->attr
.use_only
= 1;
3873 if (p
->u
.rsym
.renamed
)
3874 sym
->attr
.use_rename
= 1;
3880 /* Recursive function for cleaning up things after a module has been read. */
3883 read_cleanup (pointer_info
*p
)
3891 read_cleanup (p
->left
);
3892 read_cleanup (p
->right
);
3894 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
3896 /* Add hidden symbols to the symtree. */
3897 q
= get_integer (p
->u
.rsym
.ns
);
3898 st
= gfc_get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
3900 st
->n
.sym
= p
->u
.rsym
.sym
;
3903 /* Fixup any symtree references. */
3904 p
->u
.rsym
.symtree
= st
;
3905 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
3906 p
->u
.rsym
.stfixup
= NULL
;
3909 /* Free unused symbols. */
3910 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
3911 gfc_free_symbol (p
->u
.rsym
.sym
);
3915 /* Read a module file. */
3920 module_locus operator_interfaces
, user_operators
;
3922 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3924 int ambiguous
, j
, nuse
, symbol
;
3925 pointer_info
*info
, *q
;
3930 get_module_locus (&operator_interfaces
); /* Skip these for now. */
3933 get_module_locus (&user_operators
);
3937 /* Skip commons and equivalences for now. */
3943 /* Create the fixup nodes for all the symbols. */
3945 while (peek_atom () != ATOM_RPAREN
)
3947 require_atom (ATOM_INTEGER
);
3948 info
= get_integer (atom_int
);
3950 info
->type
= P_SYMBOL
;
3951 info
->u
.rsym
.state
= UNUSED
;
3953 mio_internal_string (info
->u
.rsym
.true_name
);
3954 mio_internal_string (info
->u
.rsym
.module
);
3955 mio_internal_string (info
->u
.rsym
.binding_label
);
3958 require_atom (ATOM_INTEGER
);
3959 info
->u
.rsym
.ns
= atom_int
;
3961 get_module_locus (&info
->u
.rsym
.where
);
3964 /* See if the symbol has already been loaded by a previous module.
3965 If so, we reference the existing symbol and prevent it from
3966 being loaded again. This should not happen if the symbol being
3967 read is an index for an assumed shape dummy array (ns != 1). */
3969 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
3972 || (sym
->attr
.flavor
== FL_VARIABLE
&& info
->u
.rsym
.ns
!=1))
3975 info
->u
.rsym
.state
= USED
;
3976 info
->u
.rsym
.sym
= sym
;
3978 /* Some symbols do not have a namespace (eg. formal arguments),
3979 so the automatic "unique symtree" mechanism must be suppressed
3980 by marking them as referenced. */
3981 q
= get_integer (info
->u
.rsym
.ns
);
3982 if (q
->u
.pointer
== NULL
)
3984 info
->u
.rsym
.referenced
= 1;
3988 /* If possible recycle the symtree that references the symbol.
3989 If a symtree is not found and the module does not import one,
3990 a unique-name symtree is found by read_cleanup. */
3991 st
= find_symtree_for_symbol (gfc_current_ns
->sym_root
, sym
);
3994 info
->u
.rsym
.symtree
= st
;
3995 info
->u
.rsym
.referenced
= 1;
4001 /* Parse the symtree lists. This lets us mark which symbols need to
4002 be loaded. Renaming is also done at this point by replacing the
4007 while (peek_atom () != ATOM_RPAREN
)
4009 mio_internal_string (name
);
4010 mio_integer (&ambiguous
);
4011 mio_integer (&symbol
);
4013 info
= get_integer (symbol
);
4015 /* See how many use names there are. If none, go through the start
4016 of the loop at least once. */
4017 nuse
= number_use_names (name
, false);
4018 info
->u
.rsym
.renamed
= nuse
? 1 : 0;
4023 for (j
= 1; j
<= nuse
; j
++)
4025 /* Get the jth local name for this symbol. */
4026 p
= find_use_name_n (name
, &j
, false);
4028 if (p
== NULL
&& strcmp (name
, module_name
) == 0)
4031 /* Skip symtree nodes not in an ONLY clause, unless there
4032 is an existing symtree loaded from another USE statement. */
4035 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4037 info
->u
.rsym
.symtree
= st
;
4041 /* If a symbol of the same name and module exists already,
4042 this symbol, which is not in an ONLY clause, must not be
4043 added to the namespace(11.3.2). Note that find_symbol
4044 only returns the first occurrence that it finds. */
4045 if (!only_flag
&& !info
->u
.rsym
.renamed
4046 && strcmp (name
, module_name
) != 0
4047 && find_symbol (gfc_current_ns
->sym_root
, name
,
4051 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
4055 /* Check for ambiguous symbols. */
4056 if (st
->n
.sym
!= info
->u
.rsym
.sym
)
4058 info
->u
.rsym
.symtree
= st
;
4062 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4064 /* Delete the symtree if the symbol has been added by a USE
4065 statement without an ONLY(11.3.2). Remember that the rsym
4066 will be the same as the symbol found in the symtree, for
4068 if (st
&& (only_flag
|| info
->u
.rsym
.renamed
)
4069 && !st
->n
.sym
->attr
.use_only
4070 && !st
->n
.sym
->attr
.use_rename
4071 && info
->u
.rsym
.sym
== st
->n
.sym
)
4072 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
4074 /* Create a symtree node in the current namespace for this
4076 st
= check_unique_name (p
)
4077 ? gfc_get_unique_symtree (gfc_current_ns
)
4078 : gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
4079 st
->ambiguous
= ambiguous
;
4081 sym
= info
->u
.rsym
.sym
;
4083 /* Create a symbol node if it doesn't already exist. */
4086 info
->u
.rsym
.sym
= gfc_new_symbol (info
->u
.rsym
.true_name
,
4088 sym
= info
->u
.rsym
.sym
;
4089 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
4091 /* TODO: hmm, can we test this? Do we know it will be
4092 initialized to zeros? */
4093 if (info
->u
.rsym
.binding_label
[0] != '\0')
4094 strcpy (sym
->binding_label
, info
->u
.rsym
.binding_label
);
4100 if (strcmp (name
, p
) != 0)
4101 sym
->attr
.use_rename
= 1;
4103 /* Store the symtree pointing to this symbol. */
4104 info
->u
.rsym
.symtree
= st
;
4106 if (info
->u
.rsym
.state
== UNUSED
)
4107 info
->u
.rsym
.state
= NEEDED
;
4108 info
->u
.rsym
.referenced
= 1;
4115 /* Load intrinsic operator interfaces. */
4116 set_module_locus (&operator_interfaces
);
4119 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4121 if (i
== INTRINSIC_USER
)
4126 u
= find_use_operator (i
);
4137 mio_interface (&gfc_current_ns
->op
[i
]);
4142 /* Load generic and user operator interfaces. These must follow the
4143 loading of symtree because otherwise symbols can be marked as
4146 set_module_locus (&user_operators
);
4148 load_operator_interfaces ();
4149 load_generic_interfaces ();
4154 /* At this point, we read those symbols that are needed but haven't
4155 been loaded yet. If one symbol requires another, the other gets
4156 marked as NEEDED if its previous state was UNUSED. */
4158 while (load_needed (pi_root
));
4160 /* Make sure all elements of the rename-list were found in the module. */
4162 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4167 if (u
->op
== INTRINSIC_NONE
)
4169 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
4170 u
->use_name
, &u
->where
, module_name
);
4174 if (u
->op
== INTRINSIC_USER
)
4176 gfc_error ("User operator '%s' referenced at %L not found "
4177 "in module '%s'", u
->use_name
, &u
->where
, module_name
);
4181 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
4182 "in module '%s'", gfc_op2string (u
->op
), &u
->where
,
4186 gfc_check_interfaces (gfc_current_ns
);
4188 /* Clean up symbol nodes that were never loaded, create references
4189 to hidden symbols. */
4191 read_cleanup (pi_root
);
4195 /* Given an access type that is specific to an entity and the default
4196 access, return nonzero if the entity is publicly accessible. If the
4197 element is declared as PUBLIC, then it is public; if declared
4198 PRIVATE, then private, and otherwise it is public unless the default
4199 access in this context has been declared PRIVATE. */
4202 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
4204 if (specific_access
== ACCESS_PUBLIC
)
4206 if (specific_access
== ACCESS_PRIVATE
)
4209 if (gfc_option
.flag_module_private
)
4210 return default_access
== ACCESS_PUBLIC
;
4212 return default_access
!= ACCESS_PRIVATE
;
4216 /* A structure to remember which commons we've already written. */
4218 struct written_common
4220 BBT_HEADER(written_common
);
4221 const char *name
, *label
;
4224 static struct written_common
*written_commons
= NULL
;
4226 /* Comparison function used for balancing the binary tree. */
4229 compare_written_commons (void *a1
, void *b1
)
4231 const char *aname
= ((struct written_common
*) a1
)->name
;
4232 const char *alabel
= ((struct written_common
*) a1
)->label
;
4233 const char *bname
= ((struct written_common
*) b1
)->name
;
4234 const char *blabel
= ((struct written_common
*) b1
)->label
;
4235 int c
= strcmp (aname
, bname
);
4237 return (c
!= 0 ? c
: strcmp (alabel
, blabel
));
4240 /* Free a list of written commons. */
4243 free_written_common (struct written_common
*w
)
4249 free_written_common (w
->left
);
4251 free_written_common (w
->right
);
4256 /* Write a common block to the module -- recursive helper function. */
4259 write_common_0 (gfc_symtree
*st
)
4265 struct written_common
*w
;
4266 bool write_me
= true;
4271 write_common_0 (st
->left
);
4273 /* We will write out the binding label, or the name if no label given. */
4274 name
= st
->n
.common
->name
;
4276 label
= p
->is_bind_c
? p
->binding_label
: p
->name
;
4278 /* Check if we've already output this common. */
4279 w
= written_commons
;
4282 int c
= strcmp (name
, w
->name
);
4283 c
= (c
!= 0 ? c
: strcmp (label
, w
->label
));
4287 w
= (c
< 0) ? w
->left
: w
->right
;
4292 /* Write the common to the module. */
4294 mio_pool_string (&name
);
4296 mio_symbol_ref (&p
->head
);
4297 flags
= p
->saved
? 1 : 0;
4298 if (p
->threadprivate
)
4300 mio_integer (&flags
);
4302 /* Write out whether the common block is bind(c) or not. */
4303 mio_integer (&(p
->is_bind_c
));
4305 mio_pool_string (&label
);
4308 /* Record that we have written this common. */
4309 w
= XCNEW (struct written_common
);
4312 gfc_insert_bbt (&written_commons
, w
, compare_written_commons
);
4315 write_common_0 (st
->right
);
4319 /* Write a common, by initializing the list of written commons, calling
4320 the recursive function write_common_0() and cleaning up afterwards. */
4323 write_common (gfc_symtree
*st
)
4325 written_commons
= NULL
;
4326 write_common_0 (st
);
4327 free_written_common (written_commons
);
4328 written_commons
= NULL
;
4332 /* Write the blank common block to the module. */
4335 write_blank_common (void)
4337 const char * name
= BLANK_COMMON_NAME
;
4339 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4340 this, but it hasn't been checked. Just making it so for now. */
4343 if (gfc_current_ns
->blank_common
.head
== NULL
)
4348 mio_pool_string (&name
);
4350 mio_symbol_ref (&gfc_current_ns
->blank_common
.head
);
4351 saved
= gfc_current_ns
->blank_common
.saved
;
4352 mio_integer (&saved
);
4354 /* Write out whether the common block is bind(c) or not. */
4355 mio_integer (&is_bind_c
);
4357 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4358 it doesn't matter because the label isn't used. */
4359 mio_pool_string (&name
);
4365 /* Write equivalences to the module. */
4374 for (eq
= gfc_current_ns
->equiv
; eq
; eq
= eq
->next
)
4378 for (e
= eq
; e
; e
= e
->eq
)
4380 if (e
->module
== NULL
)
4381 e
->module
= gfc_get_string ("%s.eq.%d", module_name
, num
);
4382 mio_allocated_string (e
->module
);
4383 mio_expr (&e
->expr
);
4392 /* Write a symbol to the module. */
4395 write_symbol (int n
, gfc_symbol
*sym
)
4399 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
4400 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
4403 mio_pool_string (&sym
->name
);
4405 mio_pool_string (&sym
->module
);
4406 if (sym
->attr
.is_bind_c
|| sym
->attr
.is_iso_c
)
4408 label
= sym
->binding_label
;
4409 mio_pool_string (&label
);
4412 mio_pool_string (&sym
->name
);
4414 mio_pointer_ref (&sym
->ns
);
4421 /* Recursive traversal function to write the initial set of symbols to
4422 the module. We check to see if the symbol should be written
4423 according to the access specification. */
4426 write_symbol0 (gfc_symtree
*st
)
4430 bool dont_write
= false;
4435 write_symbol0 (st
->left
);
4438 if (sym
->module
== NULL
)
4439 sym
->module
= gfc_get_string (module_name
);
4441 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4442 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
4445 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4450 p
= get_pointer (sym
);
4451 if (p
->type
== P_UNKNOWN
)
4454 if (p
->u
.wsym
.state
!= WRITTEN
)
4456 write_symbol (p
->integer
, sym
);
4457 p
->u
.wsym
.state
= WRITTEN
;
4461 write_symbol0 (st
->right
);
4465 /* Recursive traversal function to write the secondary set of symbols
4466 to the module file. These are symbols that were not public yet are
4467 needed by the public symbols or another dependent symbol. The act
4468 of writing a symbol can modify the pointer_info tree, so we cease
4469 traversal if we find a symbol to write. We return nonzero if a
4470 symbol was written and pass that information upwards. */
4473 write_symbol1 (pointer_info
*p
)
4480 result
= write_symbol1 (p
->left
);
4482 if (!(p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
))
4484 p
->u
.wsym
.state
= WRITTEN
;
4485 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
4489 result
|= write_symbol1 (p
->right
);
4494 /* Write operator interfaces associated with a symbol. */
4497 write_operator (gfc_user_op
*uop
)
4499 static char nullstring
[] = "";
4500 const char *p
= nullstring
;
4503 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
4506 mio_symbol_interface (&uop
->name
, &p
, &uop
->op
);
4510 /* Write generic interfaces from the namespace sym_root. */
4513 write_generic (gfc_symtree
*st
)
4520 write_generic (st
->left
);
4521 write_generic (st
->right
);
4524 if (!sym
|| check_unique_name (st
->name
))
4527 if (sym
->generic
== NULL
4528 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4531 if (sym
->module
== NULL
)
4532 sym
->module
= gfc_get_string (module_name
);
4534 mio_symbol_interface (&st
->name
, &sym
->module
, &sym
->generic
);
4539 write_symtree (gfc_symtree
*st
)
4545 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
4546 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4547 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
4550 if (check_unique_name (st
->name
))
4553 p
= find_pointer (sym
);
4555 gfc_internal_error ("write_symtree(): Symbol not written");
4557 mio_pool_string (&st
->name
);
4558 mio_integer (&st
->ambiguous
);
4559 mio_integer (&p
->integer
);
4568 /* Write the operator interfaces. */
4571 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4573 if (i
== INTRINSIC_USER
)
4576 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
4577 gfc_current_ns
->default_access
)
4578 ? &gfc_current_ns
->op
[i
] : NULL
);
4586 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
4592 write_generic (gfc_current_ns
->sym_root
);
4598 write_blank_common ();
4599 write_common (gfc_current_ns
->common_root
);
4610 /* Write symbol information. First we traverse all symbols in the
4611 primary namespace, writing those that need to be written.
4612 Sometimes writing one symbol will cause another to need to be
4613 written. A list of these symbols ends up on the write stack, and
4614 we end by popping the bottom of the stack and writing the symbol
4615 until the stack is empty. */
4619 write_symbol0 (gfc_current_ns
->sym_root
);
4620 while (write_symbol1 (pi_root
))
4629 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
4634 /* Read a MD5 sum from the header of a module file. If the file cannot
4635 be opened, or we have any other error, we return -1. */
4638 read_md5_from_module_file (const char * filename
, unsigned char md5
[16])
4644 /* Open the file. */
4645 if ((file
= fopen (filename
, "r")) == NULL
)
4648 /* Read two lines. */
4649 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
4650 || fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
4656 /* Close the file. */
4659 /* If the header is not what we expect, or is too short, bail out. */
4660 if (strncmp (buf
, "MD5:", 4) != 0 || strlen (buf
) < 4 + 16)
4663 /* Now, we have a real MD5, read it into the array. */
4664 for (n
= 0; n
< 16; n
++)
4668 if (sscanf (&(buf
[4+2*n
]), "%02x", &x
) != 1)
4678 /* Given module, dump it to disk. If there was an error while
4679 processing the module, dump_flag will be set to zero and we delete
4680 the module file, even if it was already there. */
4683 gfc_dump_module (const char *name
, int dump_flag
)
4686 char *filename
, *filename_tmp
, *p
;
4689 unsigned char md5_new
[16], md5_old
[16];
4691 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
4692 if (gfc_option
.module_dir
!= NULL
)
4694 n
+= strlen (gfc_option
.module_dir
);
4695 filename
= (char *) alloca (n
);
4696 strcpy (filename
, gfc_option
.module_dir
);
4697 strcat (filename
, name
);
4701 filename
= (char *) alloca (n
);
4702 strcpy (filename
, name
);
4704 strcat (filename
, MODULE_EXTENSION
);
4706 /* Name of the temporary file used to write the module. */
4707 filename_tmp
= (char *) alloca (n
+ 1);
4708 strcpy (filename_tmp
, filename
);
4709 strcat (filename_tmp
, "0");
4711 /* There was an error while processing the module. We delete the
4712 module file, even if it was already there. */
4719 /* Write the module to the temporary file. */
4720 module_fp
= fopen (filename_tmp
, "w");
4721 if (module_fp
== NULL
)
4722 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
4723 filename_tmp
, strerror (errno
));
4725 /* Write the header, including space reserved for the MD5 sum. */
4729 *strchr (p
, '\n') = '\0';
4731 fprintf (module_fp
, "GFORTRAN module created from %s on %s\nMD5:",
4732 gfc_source_file
, p
);
4733 fgetpos (module_fp
, &md5_pos
);
4734 fputs ("00000000000000000000000000000000 -- "
4735 "If you edit this, you'll get what you deserve.\n\n", module_fp
);
4737 /* Initialize the MD5 context that will be used for output. */
4738 md5_init_ctx (&ctx
);
4740 /* Write the module itself. */
4742 strcpy (module_name
, name
);
4748 free_pi_tree (pi_root
);
4753 /* Write the MD5 sum to the header of the module file. */
4754 md5_finish_ctx (&ctx
, md5_new
);
4755 fsetpos (module_fp
, &md5_pos
);
4756 for (n
= 0; n
< 16; n
++)
4757 fprintf (module_fp
, "%02x", md5_new
[n
]);
4759 if (fclose (module_fp
))
4760 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
4761 filename_tmp
, strerror (errno
));
4763 /* Read the MD5 from the header of the old module file and compare. */
4764 if (read_md5_from_module_file (filename
, md5_old
) != 0
4765 || memcmp (md5_old
, md5_new
, sizeof (md5_old
)) != 0)
4767 /* Module file have changed, replace the old one. */
4769 rename (filename_tmp
, filename
);
4772 unlink (filename_tmp
);
4777 sort_iso_c_rename_list (void)
4779 gfc_use_rename
*tmp_list
= NULL
;
4780 gfc_use_rename
*curr
;
4781 gfc_use_rename
*kinds_used
[ISOCBINDING_NUMBER
] = {NULL
};
4785 for (curr
= gfc_rename_list
; curr
; curr
= curr
->next
)
4787 c_kind
= get_c_kind (curr
->use_name
, c_interop_kinds_table
);
4788 if (c_kind
== ISOCBINDING_INVALID
|| c_kind
== ISOCBINDING_LAST
)
4790 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4791 "intrinsic module ISO_C_BINDING.", curr
->use_name
,
4795 /* Put it in the list. */
4796 kinds_used
[c_kind
] = curr
;
4799 /* Make a new (sorted) rename list. */
4801 while (i
< ISOCBINDING_NUMBER
&& kinds_used
[i
] == NULL
)
4804 if (i
< ISOCBINDING_NUMBER
)
4806 tmp_list
= kinds_used
[i
];
4810 for (; i
< ISOCBINDING_NUMBER
; i
++)
4811 if (kinds_used
[i
] != NULL
)
4813 curr
->next
= kinds_used
[i
];
4819 gfc_rename_list
= tmp_list
;
4823 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
4824 the current namespace for all named constants, pointer types, and
4825 procedures in the module unless the only clause was used or a rename
4826 list was provided. */
4829 import_iso_c_binding_module (void)
4831 gfc_symbol
*mod_sym
= NULL
;
4832 gfc_symtree
*mod_symtree
= NULL
;
4833 const char *iso_c_module_name
= "__iso_c_binding";
4838 /* Look only in the current namespace. */
4839 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, iso_c_module_name
);
4841 if (mod_symtree
== NULL
)
4843 /* symtree doesn't already exist in current namespace. */
4844 gfc_get_sym_tree (iso_c_module_name
, gfc_current_ns
, &mod_symtree
);
4846 if (mod_symtree
!= NULL
)
4847 mod_sym
= mod_symtree
->n
.sym
;
4849 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
4850 "create symbol for %s", iso_c_module_name
);
4852 mod_sym
->attr
.flavor
= FL_MODULE
;
4853 mod_sym
->attr
.intrinsic
= 1;
4854 mod_sym
->module
= gfc_get_string (iso_c_module_name
);
4855 mod_sym
->from_intmod
= INTMOD_ISO_C_BINDING
;
4858 /* Generate the symbols for the named constants representing
4859 the kinds for intrinsic data types. */
4862 /* Sort the rename list because there are dependencies between types
4863 and procedures (e.g., c_loc needs c_ptr). */
4864 sort_iso_c_rename_list ();
4866 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4868 i
= get_c_kind (u
->use_name
, c_interop_kinds_table
);
4870 if (i
== ISOCBINDING_INVALID
|| i
== ISOCBINDING_LAST
)
4872 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4873 "intrinsic module ISO_C_BINDING.", u
->use_name
,
4878 generate_isocbinding_symbol (iso_c_module_name
, i
, u
->local_name
);
4883 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
4886 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4888 if (strcmp (c_interop_kinds_table
[i
].name
, u
->use_name
) == 0)
4890 local_name
= u
->local_name
;
4895 generate_isocbinding_symbol (iso_c_module_name
, i
, local_name
);
4898 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4903 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4904 "module ISO_C_BINDING", u
->use_name
, &u
->where
);
4910 /* Add an integer named constant from a given module. */
4913 create_int_parameter (const char *name
, int value
, const char *modname
,
4914 intmod_id module
, int id
)
4916 gfc_symtree
*tmp_symtree
;
4919 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4920 if (tmp_symtree
!= NULL
)
4922 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
4925 gfc_error ("Symbol '%s' already declared", name
);
4928 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
);
4929 sym
= tmp_symtree
->n
.sym
;
4931 sym
->module
= gfc_get_string (modname
);
4932 sym
->attr
.flavor
= FL_PARAMETER
;
4933 sym
->ts
.type
= BT_INTEGER
;
4934 sym
->ts
.kind
= gfc_default_integer_kind
;
4935 sym
->value
= gfc_int_expr (value
);
4936 sym
->attr
.use_assoc
= 1;
4937 sym
->from_intmod
= module
;
4938 sym
->intmod_sym_id
= id
;
4942 /* USE the ISO_FORTRAN_ENV intrinsic module. */
4945 use_iso_fortran_env_module (void)
4947 static char mod
[] = "iso_fortran_env";
4948 const char *local_name
;
4950 gfc_symbol
*mod_sym
;
4951 gfc_symtree
*mod_symtree
;
4954 intmod_sym symbol
[] = {
4955 #define NAMED_INTCST(a,b,c,d) { a, b, 0, d },
4956 #include "iso-fortran-env.def"
4958 { ISOFORTRANENV_INVALID
, NULL
, -1234, 0 } };
4961 #define NAMED_INTCST(a,b,c,d) symbol[i++].value = c;
4962 #include "iso-fortran-env.def"
4965 /* Generate the symbol for the module itself. */
4966 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, mod
);
4967 if (mod_symtree
== NULL
)
4969 gfc_get_sym_tree (mod
, gfc_current_ns
, &mod_symtree
);
4970 gcc_assert (mod_symtree
);
4971 mod_sym
= mod_symtree
->n
.sym
;
4973 mod_sym
->attr
.flavor
= FL_MODULE
;
4974 mod_sym
->attr
.intrinsic
= 1;
4975 mod_sym
->module
= gfc_get_string (mod
);
4976 mod_sym
->from_intmod
= INTMOD_ISO_FORTRAN_ENV
;
4979 if (!mod_symtree
->n
.sym
->attr
.intrinsic
)
4980 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
4981 "non-intrinsic module name used previously", mod
);
4983 /* Generate the symbols for the module integer named constants. */
4985 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4987 for (i
= 0; symbol
[i
].name
; i
++)
4988 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
4991 if (symbol
[i
].name
== NULL
)
4993 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4994 "intrinsic module ISO_FORTRAN_ENV", u
->use_name
,
4999 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5000 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5001 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5002 "from intrinsic module ISO_FORTRAN_ENV at %L is "
5003 "incompatible with option %s", &u
->where
,
5004 gfc_option
.flag_default_integer
5005 ? "-fdefault-integer-8" : "-fdefault-real-8");
5007 create_int_parameter (u
->local_name
[0] ? u
->local_name
5009 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
5014 for (i
= 0; symbol
[i
].name
; i
++)
5017 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5019 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
5021 local_name
= u
->local_name
;
5027 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5028 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5029 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5030 "from intrinsic module ISO_FORTRAN_ENV at %C is "
5031 "incompatible with option %s",
5032 gfc_option
.flag_default_integer
5033 ? "-fdefault-integer-8" : "-fdefault-real-8");
5035 create_int_parameter (local_name
? local_name
: symbol
[i
].name
,
5036 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
5040 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5045 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5046 "module ISO_FORTRAN_ENV", u
->use_name
, &u
->where
);
5052 /* Process a USE directive. */
5055 gfc_use_module (void)
5060 gfc_symtree
*mod_symtree
;
5062 filename
= (char *) alloca (strlen (module_name
) + strlen (MODULE_EXTENSION
)
5064 strcpy (filename
, module_name
);
5065 strcat (filename
, MODULE_EXTENSION
);
5067 /* First, try to find an non-intrinsic module, unless the USE statement
5068 specified that the module is intrinsic. */
5071 module_fp
= gfc_open_included_file (filename
, true, true);
5073 /* Then, see if it's an intrinsic one, unless the USE statement
5074 specified that the module is non-intrinsic. */
5075 if (module_fp
== NULL
&& !specified_nonint
)
5077 if (strcmp (module_name
, "iso_fortran_env") == 0
5078 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: ISO_FORTRAN_ENV "
5079 "intrinsic module at %C") != FAILURE
)
5081 use_iso_fortran_env_module ();
5085 if (strcmp (module_name
, "iso_c_binding") == 0
5086 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
5087 "ISO_C_BINDING module at %C") != FAILURE
)
5089 import_iso_c_binding_module();
5093 module_fp
= gfc_open_intrinsic_module (filename
);
5095 if (module_fp
== NULL
&& specified_int
)
5096 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
5100 if (module_fp
== NULL
)
5101 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
5102 filename
, strerror (errno
));
5104 /* Check that we haven't already USEd an intrinsic module with the
5107 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, module_name
);
5108 if (mod_symtree
&& mod_symtree
->n
.sym
->attr
.intrinsic
)
5109 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
5110 "intrinsic module name used previously", module_name
);
5117 /* Skip the first two lines of the module, after checking that this is
5118 a gfortran module file. */
5124 bad_module ("Unexpected end of module");
5127 if ((start
== 1 && strcmp (atom_name
, "GFORTRAN") != 0)
5128 || (start
== 2 && strcmp (atom_name
, " module") != 0))
5129 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
5136 /* Make sure we're not reading the same module that we may be building. */
5137 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
5138 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
5139 gfc_fatal_error ("Can't USE the same module we're building!");
5142 init_true_name_tree ();
5146 free_true_name (true_name_root
);
5147 true_name_root
= NULL
;
5149 free_pi_tree (pi_root
);
5157 gfc_module_init_2 (void)
5159 last_atom
= ATOM_LPAREN
;
5164 gfc_module_done_2 (void)