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 "0"
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. */
122 typedef struct pointer_info
124 BBT_HEADER (pointer_info
);
128 /* The first component of each member of the union is the pointer
135 void *pointer
; /* Member for doing pointer searches. */
140 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
142 { UNUSED
, NEEDED
, USED
}
144 int ns
, referenced
, renamed
;
147 gfc_symtree
*symtree
;
148 char binding_label
[GFC_MAX_SYMBOL_LEN
+ 1];
156 { UNREFERENCED
= 0, NEEDS_WRITE
, WRITTEN
}
166 #define gfc_get_pointer_info() XCNEW (pointer_info)
169 /* Local variables */
171 /* The FILE for the module we're reading or writing. */
172 static FILE *module_fp
;
174 /* MD5 context structure. */
175 static struct md5_ctx ctx
;
177 /* The name of the module we're reading (USE'ing) or writing. */
178 static char module_name
[GFC_MAX_SYMBOL_LEN
+ 1];
180 /* The way the module we're reading was specified. */
181 static bool specified_nonint
, specified_int
;
183 static int module_line
, module_column
, only_flag
;
185 { IO_INPUT
, IO_OUTPUT
}
188 static gfc_use_rename
*gfc_rename_list
;
189 static pointer_info
*pi_root
;
190 static int symbol_number
; /* Counter for assigning symbol numbers */
192 /* Tells mio_expr_ref to make symbols for unused equivalence members. */
193 static bool in_load_equiv
;
195 static locus use_locus
;
199 /*****************************************************************/
201 /* Pointer/integer conversion. Pointers between structures are stored
202 as integers in the module file. The next couple of subroutines
203 handle this translation for reading and writing. */
205 /* Recursively free the tree of pointer structures. */
208 free_pi_tree (pointer_info
*p
)
213 if (p
->fixup
!= NULL
)
214 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
216 free_pi_tree (p
->left
);
217 free_pi_tree (p
->right
);
223 /* Compare pointers when searching by pointer. Used when writing a
227 compare_pointers (void *_sn1
, void *_sn2
)
229 pointer_info
*sn1
, *sn2
;
231 sn1
= (pointer_info
*) _sn1
;
232 sn2
= (pointer_info
*) _sn2
;
234 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
236 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
243 /* Compare integers when searching by integer. Used when reading a
247 compare_integers (void *_sn1
, void *_sn2
)
249 pointer_info
*sn1
, *sn2
;
251 sn1
= (pointer_info
*) _sn1
;
252 sn2
= (pointer_info
*) _sn2
;
254 if (sn1
->integer
< sn2
->integer
)
256 if (sn1
->integer
> sn2
->integer
)
263 /* Initialize the pointer_info tree. */
272 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
274 /* Pointer 0 is the NULL pointer. */
275 p
= gfc_get_pointer_info ();
280 gfc_insert_bbt (&pi_root
, p
, compare
);
282 /* Pointer 1 is the current namespace. */
283 p
= gfc_get_pointer_info ();
284 p
->u
.pointer
= gfc_current_ns
;
286 p
->type
= P_NAMESPACE
;
288 gfc_insert_bbt (&pi_root
, p
, compare
);
294 /* During module writing, call here with a pointer to something,
295 returning the pointer_info node. */
297 static pointer_info
*
298 find_pointer (void *gp
)
305 if (p
->u
.pointer
== gp
)
307 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
314 /* Given a pointer while writing, returns the pointer_info tree node,
315 creating it if it doesn't exist. */
317 static pointer_info
*
318 get_pointer (void *gp
)
322 p
= find_pointer (gp
);
326 /* Pointer doesn't have an integer. Give it one. */
327 p
= gfc_get_pointer_info ();
330 p
->integer
= symbol_number
++;
332 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
338 /* Given an integer during reading, find it in the pointer_info tree,
339 creating the node if not found. */
341 static pointer_info
*
342 get_integer (int integer
)
352 c
= compare_integers (&t
, p
);
356 p
= (c
< 0) ? p
->left
: p
->right
;
362 p
= gfc_get_pointer_info ();
363 p
->integer
= integer
;
366 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
372 /* Recursive function to find a pointer within a tree by brute force. */
374 static pointer_info
*
375 fp2 (pointer_info
*p
, const void *target
)
382 if (p
->u
.pointer
== target
)
385 q
= fp2 (p
->left
, target
);
389 return fp2 (p
->right
, target
);
393 /* During reading, find a pointer_info node from the pointer value.
394 This amounts to a brute-force search. */
396 static pointer_info
*
397 find_pointer2 (void *p
)
399 return fp2 (pi_root
, p
);
403 /* Resolve any fixups using a known pointer. */
406 resolve_fixups (fixup_t
*f
, void *gp
)
419 /* Call here during module reading when we know what pointer to
420 associate with an integer. Any fixups that exist are resolved at
424 associate_integer_pointer (pointer_info
*p
, void *gp
)
426 if (p
->u
.pointer
!= NULL
)
427 gfc_internal_error ("associate_integer_pointer(): Already associated");
431 resolve_fixups (p
->fixup
, gp
);
437 /* During module reading, given an integer and a pointer to a pointer,
438 either store the pointer from an already-known value or create a
439 fixup structure in order to store things later. Returns zero if
440 the reference has been actually stored, or nonzero if the reference
441 must be fixed later (i.e., associate_integer_pointer must be called
442 sometime later. Returns the pointer_info structure. */
444 static pointer_info
*
445 add_fixup (int integer
, void *gp
)
451 p
= get_integer (integer
);
453 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
456 *cp
= (char *) p
->u
.pointer
;
465 f
->pointer
= (void **) gp
;
472 /*****************************************************************/
474 /* Parser related subroutines */
476 /* Free the rename list left behind by a USE statement. */
481 gfc_use_rename
*next
;
483 for (; gfc_rename_list
; gfc_rename_list
= next
)
485 next
= gfc_rename_list
->next
;
486 gfc_free (gfc_rename_list
);
491 /* Match a USE statement. */
496 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module_nature
[GFC_MAX_SYMBOL_LEN
+ 1];
497 gfc_use_rename
*tail
= NULL
, *new_use
;
498 interface_type type
, type2
;
502 specified_int
= false;
503 specified_nonint
= false;
505 if (gfc_match (" , ") == MATCH_YES
)
507 if ((m
= gfc_match (" %n ::", module_nature
)) == MATCH_YES
)
509 if (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: module "
510 "nature in USE statement at %C") == FAILURE
)
513 if (strcmp (module_nature
, "intrinsic") == 0)
514 specified_int
= true;
517 if (strcmp (module_nature
, "non_intrinsic") == 0)
518 specified_nonint
= true;
521 gfc_error ("Module nature in USE statement at %C shall "
522 "be either INTRINSIC or NON_INTRINSIC");
529 /* Help output a better error message than "Unclassifiable
531 gfc_match (" %n", module_nature
);
532 if (strcmp (module_nature
, "intrinsic") == 0
533 || strcmp (module_nature
, "non_intrinsic") == 0)
534 gfc_error ("\"::\" was expected after module nature at %C "
535 "but was not found");
541 m
= gfc_match (" ::");
542 if (m
== MATCH_YES
&&
543 gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
544 "\"USE :: module\" at %C") == FAILURE
)
549 m
= gfc_match ("% ");
555 use_locus
= gfc_current_locus
;
557 m
= gfc_match_name (module_name
);
564 if (gfc_match_eos () == MATCH_YES
)
566 if (gfc_match_char (',') != MATCH_YES
)
569 if (gfc_match (" only :") == MATCH_YES
)
572 if (gfc_match_eos () == MATCH_YES
)
577 /* Get a new rename struct and add it to the rename list. */
578 new_use
= gfc_get_use_rename ();
579 new_use
->where
= gfc_current_locus
;
582 if (gfc_rename_list
== NULL
)
583 gfc_rename_list
= new_use
;
585 tail
->next
= new_use
;
588 /* See what kind of interface we're dealing with. Assume it is
590 new_use
->op
= INTRINSIC_NONE
;
591 if (gfc_match_generic_spec (&type
, name
, &op
) == MATCH_ERROR
)
596 case INTERFACE_NAMELESS
:
597 gfc_error ("Missing generic specification in USE statement at %C");
600 case INTERFACE_USER_OP
:
601 case INTERFACE_GENERIC
:
602 m
= gfc_match (" =>");
604 if (type
== INTERFACE_USER_OP
&& m
== MATCH_YES
605 && (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: Renaming "
606 "operators in USE statements at %C")
610 if (type
== INTERFACE_USER_OP
)
611 new_use
->op
= INTRINSIC_USER
;
616 strcpy (new_use
->use_name
, name
);
619 strcpy (new_use
->local_name
, name
);
620 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
625 if (m
== MATCH_ERROR
)
633 strcpy (new_use
->local_name
, name
);
635 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
640 if (m
== MATCH_ERROR
)
644 if (strcmp (new_use
->use_name
, module_name
) == 0
645 || strcmp (new_use
->local_name
, module_name
) == 0)
647 gfc_error ("The name '%s' at %C has already been used as "
648 "an external module name.", module_name
);
653 case INTERFACE_INTRINSIC_OP
:
661 if (gfc_match_eos () == MATCH_YES
)
663 if (gfc_match_char (',') != MATCH_YES
)
670 gfc_syntax_error (ST_USE
);
678 /* Given a name and a number, inst, return the inst name
679 under which to load this symbol. Returns NULL if this
680 symbol shouldn't be loaded. If inst is zero, returns
681 the number of instances of this name. If interface is
682 true, a user-defined operator is sought, otherwise only
683 non-operators are sought. */
686 find_use_name_n (const char *name
, int *inst
, bool interface
)
692 for (u
= gfc_rename_list
; u
; u
= u
->next
)
694 if (strcmp (u
->use_name
, name
) != 0
695 || (u
->op
== INTRINSIC_USER
&& !interface
)
696 || (u
->op
!= INTRINSIC_USER
&& interface
))
709 return only_flag
? NULL
: name
;
713 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
717 /* Given a name, return the name under which to load this symbol.
718 Returns NULL if this symbol shouldn't be loaded. */
721 find_use_name (const char *name
, bool interface
)
724 return find_use_name_n (name
, &i
, interface
);
728 /* Given a real name, return the number of use names associated with it. */
731 number_use_names (const char *name
, bool interface
)
735 c
= find_use_name_n (name
, &i
, interface
);
740 /* Try to find the operator in the current list. */
742 static gfc_use_rename
*
743 find_use_operator (gfc_intrinsic_op op
)
747 for (u
= gfc_rename_list
; u
; u
= u
->next
)
755 /*****************************************************************/
757 /* The next couple of subroutines maintain a tree used to avoid a
758 brute-force search for a combination of true name and module name.
759 While symtree names, the name that a particular symbol is known by
760 can changed with USE statements, we still have to keep track of the
761 true names to generate the correct reference, and also avoid
762 loading the same real symbol twice in a program unit.
764 When we start reading, the true name tree is built and maintained
765 as symbols are read. The tree is searched as we load new symbols
766 to see if it already exists someplace in the namespace. */
768 typedef struct true_name
770 BBT_HEADER (true_name
);
775 static true_name
*true_name_root
;
778 /* Compare two true_name structures. */
781 compare_true_names (void *_t1
, void *_t2
)
786 t1
= (true_name
*) _t1
;
787 t2
= (true_name
*) _t2
;
789 c
= ((t1
->sym
->module
> t2
->sym
->module
)
790 - (t1
->sym
->module
< t2
->sym
->module
));
794 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
798 /* Given a true name, search the true name tree to see if it exists
799 within the main namespace. */
802 find_true_name (const char *name
, const char *module
)
808 sym
.name
= gfc_get_string (name
);
810 sym
.module
= gfc_get_string (module
);
818 c
= compare_true_names ((void *) (&t
), (void *) p
);
822 p
= (c
< 0) ? p
->left
: p
->right
;
829 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
832 add_true_name (gfc_symbol
*sym
)
836 t
= XCNEW (true_name
);
839 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
843 /* Recursive function to build the initial true name tree by
844 recursively traversing the current namespace. */
847 build_tnt (gfc_symtree
*st
)
852 build_tnt (st
->left
);
853 build_tnt (st
->right
);
855 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
858 add_true_name (st
->n
.sym
);
862 /* Initialize the true name tree with the current namespace. */
865 init_true_name_tree (void)
867 true_name_root
= NULL
;
868 build_tnt (gfc_current_ns
->sym_root
);
872 /* Recursively free a true name tree node. */
875 free_true_name (true_name
*t
)
879 free_true_name (t
->left
);
880 free_true_name (t
->right
);
886 /*****************************************************************/
888 /* Module reading and writing. */
892 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
896 static atom_type last_atom
;
899 /* The name buffer must be at least as long as a symbol name. Right
900 now it's not clear how we're going to store numeric constants--
901 probably as a hexadecimal string, since this will allow the exact
902 number to be preserved (this can't be done by a decimal
903 representation). Worry about that later. TODO! */
905 #define MAX_ATOM_SIZE 100
908 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
911 /* Report problems with a module. Error reporting is not very
912 elaborate, since this sorts of errors shouldn't really happen.
913 This subroutine never returns. */
915 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
918 bad_module (const char *msgid
)
925 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
926 module_name
, module_line
, module_column
, msgid
);
929 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
930 module_name
, module_line
, module_column
, msgid
);
933 gfc_fatal_error ("Module %s at line %d column %d: %s",
934 module_name
, module_line
, module_column
, msgid
);
940 /* Set the module's input pointer. */
943 set_module_locus (module_locus
*m
)
945 module_column
= m
->column
;
946 module_line
= m
->line
;
947 fsetpos (module_fp
, &m
->pos
);
951 /* Get the module's input pointer so that we can restore it later. */
954 get_module_locus (module_locus
*m
)
956 m
->column
= module_column
;
957 m
->line
= module_line
;
958 fgetpos (module_fp
, &m
->pos
);
962 /* Get the next character in the module, updating our reckoning of
970 c
= getc (module_fp
);
973 bad_module ("Unexpected EOF");
986 /* Parse a string constant. The delimiter is guaranteed to be a
996 get_module_locus (&start
);
1000 /* See how long the string is. */
1005 bad_module ("Unexpected end of module in string constant");
1023 set_module_locus (&start
);
1025 atom_string
= p
= XCNEWVEC (char, len
+ 1);
1027 for (; len
> 0; len
--)
1031 module_char (); /* Guaranteed to be another \'. */
1035 module_char (); /* Terminating \'. */
1036 *p
= '\0'; /* C-style string for debug purposes. */
1040 /* Parse a small integer. */
1043 parse_integer (int c
)
1051 get_module_locus (&m
);
1057 atom_int
= 10 * atom_int
+ c
- '0';
1058 if (atom_int
> 99999999)
1059 bad_module ("Integer overflow");
1062 set_module_locus (&m
);
1080 get_module_locus (&m
);
1085 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
1089 if (++len
> GFC_MAX_SYMBOL_LEN
)
1090 bad_module ("Name too long");
1095 fseek (module_fp
, -1, SEEK_CUR
);
1096 module_column
= m
.column
+ len
- 1;
1103 /* Read the next atom in the module's input stream. */
1114 while (c
== ' ' || c
== '\r' || c
== '\n');
1139 return ATOM_INTEGER
;
1197 bad_module ("Bad name");
1204 /* Peek at the next atom on the input. */
1212 get_module_locus (&m
);
1215 if (a
== ATOM_STRING
)
1216 gfc_free (atom_string
);
1218 set_module_locus (&m
);
1223 /* Read the next atom from the input, requiring that it be a
1227 require_atom (atom_type type
)
1233 get_module_locus (&m
);
1241 p
= _("Expected name");
1244 p
= _("Expected left parenthesis");
1247 p
= _("Expected right parenthesis");
1250 p
= _("Expected integer");
1253 p
= _("Expected string");
1256 gfc_internal_error ("require_atom(): bad atom type required");
1259 set_module_locus (&m
);
1265 /* Given a pointer to an mstring array, require that the current input
1266 be one of the strings in the array. We return the enum value. */
1269 find_enum (const mstring
*m
)
1273 i
= gfc_string2code (m
, atom_name
);
1277 bad_module ("find_enum(): Enum not found");
1283 /**************** Module output subroutines ***************************/
1285 /* Output a character to a module file. */
1288 write_char (char out
)
1290 if (putc (out
, module_fp
) == EOF
)
1291 gfc_fatal_error ("Error writing modules file: %s", strerror (errno
));
1293 /* Add this to our MD5. */
1294 md5_process_bytes (&out
, sizeof (out
), &ctx
);
1306 /* Write an atom to a module. The line wrapping isn't perfect, but it
1307 should work most of the time. This isn't that big of a deal, since
1308 the file really isn't meant to be read by people anyway. */
1311 write_atom (atom_type atom
, const void *v
)
1321 p
= (const char *) v
;
1333 i
= *((const int *) v
);
1335 gfc_internal_error ("write_atom(): Writing negative integer");
1337 sprintf (buffer
, "%d", i
);
1342 gfc_internal_error ("write_atom(): Trying to write dab atom");
1346 if(p
== NULL
|| *p
== '\0')
1351 if (atom
!= ATOM_RPAREN
)
1353 if (module_column
+ len
> 72)
1358 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1363 if (atom
== ATOM_STRING
)
1366 while (p
!= NULL
&& *p
)
1368 if (atom
== ATOM_STRING
&& *p
== '\'')
1373 if (atom
== ATOM_STRING
)
1381 /***************** Mid-level I/O subroutines *****************/
1383 /* These subroutines let their caller read or write atoms without
1384 caring about which of the two is actually happening. This lets a
1385 subroutine concentrate on the actual format of the data being
1388 static void mio_expr (gfc_expr
**);
1389 pointer_info
*mio_symbol_ref (gfc_symbol
**);
1390 pointer_info
*mio_interface_rest (gfc_interface
**);
1391 static void mio_symtree_ref (gfc_symtree
**);
1393 /* Read or write an enumerated value. On writing, we return the input
1394 value for the convenience of callers. We avoid using an integer
1395 pointer because enums are sometimes inside bitfields. */
1398 mio_name (int t
, const mstring
*m
)
1400 if (iomode
== IO_OUTPUT
)
1401 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1404 require_atom (ATOM_NAME
);
1411 /* Specialization of mio_name. */
1413 #define DECL_MIO_NAME(TYPE) \
1414 static inline TYPE \
1415 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1417 return (TYPE) mio_name ((int) t, m); \
1419 #define MIO_NAME(TYPE) mio_name_##TYPE
1424 if (iomode
== IO_OUTPUT
)
1425 write_atom (ATOM_LPAREN
, NULL
);
1427 require_atom (ATOM_LPAREN
);
1434 if (iomode
== IO_OUTPUT
)
1435 write_atom (ATOM_RPAREN
, NULL
);
1437 require_atom (ATOM_RPAREN
);
1442 mio_integer (int *ip
)
1444 if (iomode
== IO_OUTPUT
)
1445 write_atom (ATOM_INTEGER
, ip
);
1448 require_atom (ATOM_INTEGER
);
1454 /* Read or write a character pointer that points to a string on the heap. */
1457 mio_allocated_string (const char *s
)
1459 if (iomode
== IO_OUTPUT
)
1461 write_atom (ATOM_STRING
, s
);
1466 require_atom (ATOM_STRING
);
1472 /* Functions for quoting and unquoting strings. */
1475 quote_string (const gfc_char_t
*s
, const size_t slength
)
1477 const gfc_char_t
*p
;
1481 /* Calculate the length we'll need: a backslash takes two ("\\"),
1482 non-printable characters take 10 ("\Uxxxxxxxx") and others take 1. */
1483 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1487 else if (!gfc_wide_is_printable (*p
))
1493 q
= res
= XCNEWVEC (char, len
+ 1);
1494 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1497 *q
++ = '\\', *q
++ = '\\';
1498 else if (!gfc_wide_is_printable (*p
))
1500 sprintf (q
, "\\U%08" HOST_WIDE_INT_PRINT
"x",
1501 (unsigned HOST_WIDE_INT
) *p
);
1505 *q
++ = (unsigned char) *p
;
1513 unquote_string (const char *s
)
1519 for (p
= s
, len
= 0; *p
; p
++, len
++)
1526 else if (p
[1] == 'U')
1527 p
+= 9; /* That is a "\U????????". */
1529 gfc_internal_error ("unquote_string(): got bad string");
1532 res
= gfc_get_wide_string (len
+ 1);
1533 for (i
= 0, p
= s
; i
< len
; i
++, p
++)
1538 res
[i
] = (unsigned char) *p
;
1539 else if (p
[1] == '\\')
1541 res
[i
] = (unsigned char) '\\';
1546 /* We read the 8-digits hexadecimal constant that follows. */
1551 gcc_assert (p
[1] == 'U');
1552 for (j
= 0; j
< 8; j
++)
1555 gcc_assert (sscanf (&p
[j
+2], "%01x", &n
) == 1);
1569 /* Read or write a character pointer that points to a wide string on the
1570 heap, performing quoting/unquoting of nonprintable characters using the
1571 form \U???????? (where each ? is a hexadecimal digit).
1572 Length is the length of the string, only known and used in output mode. */
1574 static const gfc_char_t
*
1575 mio_allocated_wide_string (const gfc_char_t
*s
, const size_t length
)
1577 if (iomode
== IO_OUTPUT
)
1579 char *quoted
= quote_string (s
, length
);
1580 write_atom (ATOM_STRING
, quoted
);
1586 gfc_char_t
*unquoted
;
1588 require_atom (ATOM_STRING
);
1589 unquoted
= unquote_string (atom_string
);
1590 gfc_free (atom_string
);
1596 /* Read or write a string that is in static memory. */
1599 mio_pool_string (const char **stringp
)
1601 /* TODO: one could write the string only once, and refer to it via a
1604 /* As a special case we have to deal with a NULL string. This
1605 happens for the 'module' member of 'gfc_symbol's that are not in a
1606 module. We read / write these as the empty string. */
1607 if (iomode
== IO_OUTPUT
)
1609 const char *p
= *stringp
== NULL
? "" : *stringp
;
1610 write_atom (ATOM_STRING
, p
);
1614 require_atom (ATOM_STRING
);
1615 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1616 gfc_free (atom_string
);
1621 /* Read or write a string that is inside of some already-allocated
1625 mio_internal_string (char *string
)
1627 if (iomode
== IO_OUTPUT
)
1628 write_atom (ATOM_STRING
, string
);
1631 require_atom (ATOM_STRING
);
1632 strcpy (string
, atom_string
);
1633 gfc_free (atom_string
);
1639 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1640 AB_POINTER
, AB_TARGET
, AB_DUMMY
, AB_RESULT
, AB_DATA
,
1641 AB_IN_NAMELIST
, AB_IN_COMMON
, AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
,
1642 AB_ELEMENTAL
, AB_PURE
, AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
,
1643 AB_CRAY_POINTER
, AB_CRAY_POINTEE
, AB_THREADPRIVATE
, AB_ALLOC_COMP
,
1644 AB_POINTER_COMP
, AB_PRIVATE_COMP
, AB_VALUE
, AB_VOLATILE
, AB_PROTECTED
,
1645 AB_IS_BIND_C
, AB_IS_C_INTEROP
, AB_IS_ISO_C
, AB_ABSTRACT
, AB_ZERO_COMP
,
1646 AB_EXTENSION
, AB_PROCEDURE
, AB_PROC_POINTER
1650 static const mstring attr_bits
[] =
1652 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1653 minit ("DIMENSION", AB_DIMENSION
),
1654 minit ("EXTERNAL", AB_EXTERNAL
),
1655 minit ("INTRINSIC", AB_INTRINSIC
),
1656 minit ("OPTIONAL", AB_OPTIONAL
),
1657 minit ("POINTER", AB_POINTER
),
1658 minit ("VOLATILE", AB_VOLATILE
),
1659 minit ("TARGET", AB_TARGET
),
1660 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1661 minit ("DUMMY", AB_DUMMY
),
1662 minit ("RESULT", AB_RESULT
),
1663 minit ("DATA", AB_DATA
),
1664 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1665 minit ("IN_COMMON", AB_IN_COMMON
),
1666 minit ("FUNCTION", AB_FUNCTION
),
1667 minit ("SUBROUTINE", AB_SUBROUTINE
),
1668 minit ("SEQUENCE", AB_SEQUENCE
),
1669 minit ("ELEMENTAL", AB_ELEMENTAL
),
1670 minit ("PURE", AB_PURE
),
1671 minit ("RECURSIVE", AB_RECURSIVE
),
1672 minit ("GENERIC", AB_GENERIC
),
1673 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1674 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1675 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1676 minit ("IS_BIND_C", AB_IS_BIND_C
),
1677 minit ("IS_C_INTEROP", AB_IS_C_INTEROP
),
1678 minit ("IS_ISO_C", AB_IS_ISO_C
),
1679 minit ("VALUE", AB_VALUE
),
1680 minit ("ALLOC_COMP", AB_ALLOC_COMP
),
1681 minit ("POINTER_COMP", AB_POINTER_COMP
),
1682 minit ("PRIVATE_COMP", AB_PRIVATE_COMP
),
1683 minit ("ZERO_COMP", AB_ZERO_COMP
),
1684 minit ("PROTECTED", AB_PROTECTED
),
1685 minit ("ABSTRACT", AB_ABSTRACT
),
1686 minit ("EXTENSION", AB_EXTENSION
),
1687 minit ("PROCEDURE", AB_PROCEDURE
),
1688 minit ("PROC_POINTER", AB_PROC_POINTER
),
1692 /* For binding attributes. */
1693 static const mstring binding_passing
[] =
1696 minit ("NOPASS", 1),
1699 static const mstring binding_overriding
[] =
1701 minit ("OVERRIDABLE", 0),
1702 minit ("NON_OVERRIDABLE", 1),
1703 minit ("DEFERRED", 2),
1706 static const mstring binding_generic
[] =
1708 minit ("SPECIFIC", 0),
1709 minit ("GENERIC", 1),
1714 /* Specialization of mio_name. */
1715 DECL_MIO_NAME (ab_attribute
)
1716 DECL_MIO_NAME (ar_type
)
1717 DECL_MIO_NAME (array_type
)
1719 DECL_MIO_NAME (expr_t
)
1720 DECL_MIO_NAME (gfc_access
)
1721 DECL_MIO_NAME (gfc_intrinsic_op
)
1722 DECL_MIO_NAME (ifsrc
)
1723 DECL_MIO_NAME (save_state
)
1724 DECL_MIO_NAME (procedure_type
)
1725 DECL_MIO_NAME (ref_type
)
1726 DECL_MIO_NAME (sym_flavor
)
1727 DECL_MIO_NAME (sym_intent
)
1728 #undef DECL_MIO_NAME
1730 /* Symbol attributes are stored in list with the first three elements
1731 being the enumerated fields, while the remaining elements (if any)
1732 indicate the individual attribute bits. The access field is not
1733 saved-- it controls what symbols are exported when a module is
1737 mio_symbol_attribute (symbol_attribute
*attr
)
1743 attr
->flavor
= MIO_NAME (sym_flavor
) (attr
->flavor
, flavors
);
1744 attr
->intent
= MIO_NAME (sym_intent
) (attr
->intent
, intents
);
1745 attr
->proc
= MIO_NAME (procedure_type
) (attr
->proc
, procedures
);
1746 attr
->if_source
= MIO_NAME (ifsrc
) (attr
->if_source
, ifsrc_types
);
1747 attr
->save
= MIO_NAME (save_state
) (attr
->save
, save_status
);
1749 if (iomode
== IO_OUTPUT
)
1751 if (attr
->allocatable
)
1752 MIO_NAME (ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1753 if (attr
->dimension
)
1754 MIO_NAME (ab_attribute
) (AB_DIMENSION
, attr_bits
);
1756 MIO_NAME (ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1757 if (attr
->intrinsic
)
1758 MIO_NAME (ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1760 MIO_NAME (ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1762 MIO_NAME (ab_attribute
) (AB_POINTER
, attr_bits
);
1763 if (attr
->is_protected
)
1764 MIO_NAME (ab_attribute
) (AB_PROTECTED
, attr_bits
);
1766 MIO_NAME (ab_attribute
) (AB_VALUE
, attr_bits
);
1767 if (attr
->volatile_
)
1768 MIO_NAME (ab_attribute
) (AB_VOLATILE
, attr_bits
);
1770 MIO_NAME (ab_attribute
) (AB_TARGET
, attr_bits
);
1771 if (attr
->threadprivate
)
1772 MIO_NAME (ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1774 MIO_NAME (ab_attribute
) (AB_DUMMY
, attr_bits
);
1776 MIO_NAME (ab_attribute
) (AB_RESULT
, attr_bits
);
1777 /* We deliberately don't preserve the "entry" flag. */
1780 MIO_NAME (ab_attribute
) (AB_DATA
, attr_bits
);
1781 if (attr
->in_namelist
)
1782 MIO_NAME (ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1783 if (attr
->in_common
)
1784 MIO_NAME (ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1787 MIO_NAME (ab_attribute
) (AB_FUNCTION
, attr_bits
);
1788 if (attr
->subroutine
)
1789 MIO_NAME (ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1791 MIO_NAME (ab_attribute
) (AB_GENERIC
, attr_bits
);
1793 MIO_NAME (ab_attribute
) (AB_ABSTRACT
, attr_bits
);
1796 MIO_NAME (ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1797 if (attr
->elemental
)
1798 MIO_NAME (ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1800 MIO_NAME (ab_attribute
) (AB_PURE
, attr_bits
);
1801 if (attr
->recursive
)
1802 MIO_NAME (ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1803 if (attr
->always_explicit
)
1804 MIO_NAME (ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1805 if (attr
->cray_pointer
)
1806 MIO_NAME (ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1807 if (attr
->cray_pointee
)
1808 MIO_NAME (ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1809 if (attr
->is_bind_c
)
1810 MIO_NAME(ab_attribute
) (AB_IS_BIND_C
, attr_bits
);
1811 if (attr
->is_c_interop
)
1812 MIO_NAME(ab_attribute
) (AB_IS_C_INTEROP
, attr_bits
);
1814 MIO_NAME(ab_attribute
) (AB_IS_ISO_C
, attr_bits
);
1815 if (attr
->alloc_comp
)
1816 MIO_NAME (ab_attribute
) (AB_ALLOC_COMP
, attr_bits
);
1817 if (attr
->pointer_comp
)
1818 MIO_NAME (ab_attribute
) (AB_POINTER_COMP
, attr_bits
);
1819 if (attr
->private_comp
)
1820 MIO_NAME (ab_attribute
) (AB_PRIVATE_COMP
, attr_bits
);
1821 if (attr
->zero_comp
)
1822 MIO_NAME (ab_attribute
) (AB_ZERO_COMP
, attr_bits
);
1823 if (attr
->extension
)
1824 MIO_NAME (ab_attribute
) (AB_EXTENSION
, attr_bits
);
1825 if (attr
->procedure
)
1826 MIO_NAME (ab_attribute
) (AB_PROCEDURE
, attr_bits
);
1827 if (attr
->proc_pointer
)
1828 MIO_NAME (ab_attribute
) (AB_PROC_POINTER
, attr_bits
);
1838 if (t
== ATOM_RPAREN
)
1841 bad_module ("Expected attribute bit name");
1843 switch ((ab_attribute
) find_enum (attr_bits
))
1845 case AB_ALLOCATABLE
:
1846 attr
->allocatable
= 1;
1849 attr
->dimension
= 1;
1855 attr
->intrinsic
= 1;
1864 attr
->is_protected
= 1;
1870 attr
->volatile_
= 1;
1875 case AB_THREADPRIVATE
:
1876 attr
->threadprivate
= 1;
1887 case AB_IN_NAMELIST
:
1888 attr
->in_namelist
= 1;
1891 attr
->in_common
= 1;
1897 attr
->subroutine
= 1;
1909 attr
->elemental
= 1;
1915 attr
->recursive
= 1;
1917 case AB_ALWAYS_EXPLICIT
:
1918 attr
->always_explicit
= 1;
1920 case AB_CRAY_POINTER
:
1921 attr
->cray_pointer
= 1;
1923 case AB_CRAY_POINTEE
:
1924 attr
->cray_pointee
= 1;
1927 attr
->is_bind_c
= 1;
1929 case AB_IS_C_INTEROP
:
1930 attr
->is_c_interop
= 1;
1936 attr
->alloc_comp
= 1;
1938 case AB_POINTER_COMP
:
1939 attr
->pointer_comp
= 1;
1941 case AB_PRIVATE_COMP
:
1942 attr
->private_comp
= 1;
1945 attr
->zero_comp
= 1;
1948 attr
->extension
= 1;
1951 attr
->procedure
= 1;
1953 case AB_PROC_POINTER
:
1954 attr
->proc_pointer
= 1;
1962 static const mstring bt_types
[] = {
1963 minit ("INTEGER", BT_INTEGER
),
1964 minit ("REAL", BT_REAL
),
1965 minit ("COMPLEX", BT_COMPLEX
),
1966 minit ("LOGICAL", BT_LOGICAL
),
1967 minit ("CHARACTER", BT_CHARACTER
),
1968 minit ("DERIVED", BT_DERIVED
),
1969 minit ("PROCEDURE", BT_PROCEDURE
),
1970 minit ("UNKNOWN", BT_UNKNOWN
),
1971 minit ("VOID", BT_VOID
),
1977 mio_charlen (gfc_charlen
**clp
)
1983 if (iomode
== IO_OUTPUT
)
1987 mio_expr (&cl
->length
);
1991 if (peek_atom () != ATOM_RPAREN
)
1993 cl
= gfc_get_charlen ();
1994 mio_expr (&cl
->length
);
1998 cl
->next
= gfc_current_ns
->cl_list
;
1999 gfc_current_ns
->cl_list
= cl
;
2007 /* See if a name is a generated name. */
2010 check_unique_name (const char *name
)
2012 return *name
== '@';
2017 mio_typespec (gfc_typespec
*ts
)
2021 ts
->type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2023 if (ts
->type
!= BT_DERIVED
)
2024 mio_integer (&ts
->kind
);
2026 mio_symbol_ref (&ts
->derived
);
2028 /* Add info for C interop and is_iso_c. */
2029 mio_integer (&ts
->is_c_interop
);
2030 mio_integer (&ts
->is_iso_c
);
2032 /* If the typespec is for an identifier either from iso_c_binding, or
2033 a constant that was initialized to an identifier from it, use the
2034 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
2036 ts
->f90_type
= MIO_NAME (bt
) (ts
->f90_type
, bt_types
);
2038 ts
->f90_type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2040 if (ts
->type
!= BT_CHARACTER
)
2042 /* ts->cl is only valid for BT_CHARACTER. */
2047 mio_charlen (&ts
->cl
);
2053 static const mstring array_spec_types
[] = {
2054 minit ("EXPLICIT", AS_EXPLICIT
),
2055 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
2056 minit ("DEFERRED", AS_DEFERRED
),
2057 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
2063 mio_array_spec (gfc_array_spec
**asp
)
2070 if (iomode
== IO_OUTPUT
)
2078 if (peek_atom () == ATOM_RPAREN
)
2084 *asp
= as
= gfc_get_array_spec ();
2087 mio_integer (&as
->rank
);
2088 as
->type
= MIO_NAME (array_type
) (as
->type
, array_spec_types
);
2090 for (i
= 0; i
< as
->rank
; i
++)
2092 mio_expr (&as
->lower
[i
]);
2093 mio_expr (&as
->upper
[i
]);
2101 /* Given a pointer to an array reference structure (which lives in a
2102 gfc_ref structure), find the corresponding array specification
2103 structure. Storing the pointer in the ref structure doesn't quite
2104 work when loading from a module. Generating code for an array
2105 reference also needs more information than just the array spec. */
2107 static const mstring array_ref_types
[] = {
2108 minit ("FULL", AR_FULL
),
2109 minit ("ELEMENT", AR_ELEMENT
),
2110 minit ("SECTION", AR_SECTION
),
2116 mio_array_ref (gfc_array_ref
*ar
)
2121 ar
->type
= MIO_NAME (ar_type
) (ar
->type
, array_ref_types
);
2122 mio_integer (&ar
->dimen
);
2130 for (i
= 0; i
< ar
->dimen
; i
++)
2131 mio_expr (&ar
->start
[i
]);
2136 for (i
= 0; i
< ar
->dimen
; i
++)
2138 mio_expr (&ar
->start
[i
]);
2139 mio_expr (&ar
->end
[i
]);
2140 mio_expr (&ar
->stride
[i
]);
2146 gfc_internal_error ("mio_array_ref(): Unknown array ref");
2149 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
2150 we can't call mio_integer directly. Instead loop over each element
2151 and cast it to/from an integer. */
2152 if (iomode
== IO_OUTPUT
)
2154 for (i
= 0; i
< ar
->dimen
; i
++)
2156 int tmp
= (int)ar
->dimen_type
[i
];
2157 write_atom (ATOM_INTEGER
, &tmp
);
2162 for (i
= 0; i
< ar
->dimen
; i
++)
2164 require_atom (ATOM_INTEGER
);
2165 ar
->dimen_type
[i
] = atom_int
;
2169 if (iomode
== IO_INPUT
)
2171 ar
->where
= gfc_current_locus
;
2173 for (i
= 0; i
< ar
->dimen
; i
++)
2174 ar
->c_where
[i
] = gfc_current_locus
;
2181 /* Saves or restores a pointer. The pointer is converted back and
2182 forth from an integer. We return the pointer_info pointer so that
2183 the caller can take additional action based on the pointer type. */
2185 static pointer_info
*
2186 mio_pointer_ref (void *gp
)
2190 if (iomode
== IO_OUTPUT
)
2192 p
= get_pointer (*((char **) gp
));
2193 write_atom (ATOM_INTEGER
, &p
->integer
);
2197 require_atom (ATOM_INTEGER
);
2198 p
= add_fixup (atom_int
, gp
);
2205 /* Save and load references to components that occur within
2206 expressions. We have to describe these references by a number and
2207 by name. The number is necessary for forward references during
2208 reading, and the name is necessary if the symbol already exists in
2209 the namespace and is not loaded again. */
2212 mio_component_ref (gfc_component
**cp
, gfc_symbol
*sym
)
2214 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2218 p
= mio_pointer_ref (cp
);
2219 if (p
->type
== P_UNKNOWN
)
2220 p
->type
= P_COMPONENT
;
2222 if (iomode
== IO_OUTPUT
)
2223 mio_pool_string (&(*cp
)->name
);
2226 mio_internal_string (name
);
2228 /* It can happen that a component reference can be read before the
2229 associated derived type symbol has been loaded. Return now and
2230 wait for a later iteration of load_needed. */
2234 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
2236 /* Symbol already loaded, so search by name. */
2237 for (q
= sym
->components
; q
; q
= q
->next
)
2238 if (strcmp (q
->name
, name
) == 0)
2242 gfc_internal_error ("mio_component_ref(): Component not found");
2244 associate_integer_pointer (p
, q
);
2247 /* Make sure this symbol will eventually be loaded. */
2248 p
= find_pointer2 (sym
);
2249 if (p
->u
.rsym
.state
== UNUSED
)
2250 p
->u
.rsym
.state
= NEEDED
;
2256 mio_component (gfc_component
*c
)
2263 if (iomode
== IO_OUTPUT
)
2265 p
= get_pointer (c
);
2266 mio_integer (&p
->integer
);
2271 p
= get_integer (n
);
2272 associate_integer_pointer (p
, c
);
2275 if (p
->type
== P_UNKNOWN
)
2276 p
->type
= P_COMPONENT
;
2278 mio_pool_string (&c
->name
);
2279 mio_typespec (&c
->ts
);
2280 mio_array_spec (&c
->as
);
2282 mio_symbol_attribute (&c
->attr
);
2283 c
->attr
.access
= MIO_NAME (gfc_access
) (c
->attr
.access
, access_types
);
2285 mio_expr (&c
->initializer
);
2291 mio_component_list (gfc_component
**cp
)
2293 gfc_component
*c
, *tail
;
2297 if (iomode
== IO_OUTPUT
)
2299 for (c
= *cp
; c
; c
= c
->next
)
2309 if (peek_atom () == ATOM_RPAREN
)
2312 c
= gfc_get_component ();
2329 mio_actual_arg (gfc_actual_arglist
*a
)
2332 mio_pool_string (&a
->name
);
2333 mio_expr (&a
->expr
);
2339 mio_actual_arglist (gfc_actual_arglist
**ap
)
2341 gfc_actual_arglist
*a
, *tail
;
2345 if (iomode
== IO_OUTPUT
)
2347 for (a
= *ap
; a
; a
= a
->next
)
2357 if (peek_atom () != ATOM_LPAREN
)
2360 a
= gfc_get_actual_arglist ();
2376 /* Read and write formal argument lists. */
2379 mio_formal_arglist (gfc_symbol
*sym
)
2381 gfc_formal_arglist
*f
, *tail
;
2385 if (iomode
== IO_OUTPUT
)
2387 for (f
= sym
->formal
; f
; f
= f
->next
)
2388 mio_symbol_ref (&f
->sym
);
2392 sym
->formal
= tail
= NULL
;
2394 while (peek_atom () != ATOM_RPAREN
)
2396 f
= gfc_get_formal_arglist ();
2397 mio_symbol_ref (&f
->sym
);
2399 if (sym
->formal
== NULL
)
2412 /* Save or restore a reference to a symbol node. */
2415 mio_symbol_ref (gfc_symbol
**symp
)
2419 p
= mio_pointer_ref (symp
);
2420 if (p
->type
== P_UNKNOWN
)
2423 if (iomode
== IO_OUTPUT
)
2425 if (p
->u
.wsym
.state
== UNREFERENCED
)
2426 p
->u
.wsym
.state
= NEEDS_WRITE
;
2430 if (p
->u
.rsym
.state
== UNUSED
)
2431 p
->u
.rsym
.state
= NEEDED
;
2437 /* Save or restore a reference to a symtree node. */
2440 mio_symtree_ref (gfc_symtree
**stp
)
2445 if (iomode
== IO_OUTPUT
)
2446 mio_symbol_ref (&(*stp
)->n
.sym
);
2449 require_atom (ATOM_INTEGER
);
2450 p
= get_integer (atom_int
);
2452 /* An unused equivalence member; make a symbol and a symtree
2454 if (in_load_equiv
&& p
->u
.rsym
.symtree
== NULL
)
2456 /* Since this is not used, it must have a unique name. */
2457 p
->u
.rsym
.symtree
= gfc_get_unique_symtree (gfc_current_ns
);
2459 /* Make the symbol. */
2460 if (p
->u
.rsym
.sym
== NULL
)
2462 p
->u
.rsym
.sym
= gfc_new_symbol (p
->u
.rsym
.true_name
,
2464 p
->u
.rsym
.sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
2467 p
->u
.rsym
.symtree
->n
.sym
= p
->u
.rsym
.sym
;
2468 p
->u
.rsym
.symtree
->n
.sym
->refs
++;
2469 p
->u
.rsym
.referenced
= 1;
2471 /* If the symbol is PRIVATE and in COMMON, load_commons will
2472 generate a fixup symbol, which must be associated. */
2474 resolve_fixups (p
->fixup
, p
->u
.rsym
.sym
);
2478 if (p
->type
== P_UNKNOWN
)
2481 if (p
->u
.rsym
.state
== UNUSED
)
2482 p
->u
.rsym
.state
= NEEDED
;
2484 if (p
->u
.rsym
.symtree
!= NULL
)
2486 *stp
= p
->u
.rsym
.symtree
;
2490 f
= XCNEW (fixup_t
);
2492 f
->next
= p
->u
.rsym
.stfixup
;
2493 p
->u
.rsym
.stfixup
= f
;
2495 f
->pointer
= (void **) stp
;
2502 mio_iterator (gfc_iterator
**ip
)
2508 if (iomode
== IO_OUTPUT
)
2515 if (peek_atom () == ATOM_RPAREN
)
2521 *ip
= gfc_get_iterator ();
2526 mio_expr (&iter
->var
);
2527 mio_expr (&iter
->start
);
2528 mio_expr (&iter
->end
);
2529 mio_expr (&iter
->step
);
2537 mio_constructor (gfc_constructor
**cp
)
2539 gfc_constructor
*c
, *tail
;
2543 if (iomode
== IO_OUTPUT
)
2545 for (c
= *cp
; c
; c
= c
->next
)
2548 mio_expr (&c
->expr
);
2549 mio_iterator (&c
->iterator
);
2558 while (peek_atom () != ATOM_RPAREN
)
2560 c
= gfc_get_constructor ();
2570 mio_expr (&c
->expr
);
2571 mio_iterator (&c
->iterator
);
2580 static const mstring ref_types
[] = {
2581 minit ("ARRAY", REF_ARRAY
),
2582 minit ("COMPONENT", REF_COMPONENT
),
2583 minit ("SUBSTRING", REF_SUBSTRING
),
2589 mio_ref (gfc_ref
**rp
)
2596 r
->type
= MIO_NAME (ref_type
) (r
->type
, ref_types
);
2601 mio_array_ref (&r
->u
.ar
);
2605 mio_symbol_ref (&r
->u
.c
.sym
);
2606 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2610 mio_expr (&r
->u
.ss
.start
);
2611 mio_expr (&r
->u
.ss
.end
);
2612 mio_charlen (&r
->u
.ss
.length
);
2621 mio_ref_list (gfc_ref
**rp
)
2623 gfc_ref
*ref
, *head
, *tail
;
2627 if (iomode
== IO_OUTPUT
)
2629 for (ref
= *rp
; ref
; ref
= ref
->next
)
2636 while (peek_atom () != ATOM_RPAREN
)
2639 head
= tail
= gfc_get_ref ();
2642 tail
->next
= gfc_get_ref ();
2656 /* Read and write an integer value. */
2659 mio_gmp_integer (mpz_t
*integer
)
2663 if (iomode
== IO_INPUT
)
2665 if (parse_atom () != ATOM_STRING
)
2666 bad_module ("Expected integer string");
2668 mpz_init (*integer
);
2669 if (mpz_set_str (*integer
, atom_string
, 10))
2670 bad_module ("Error converting integer");
2672 gfc_free (atom_string
);
2676 p
= mpz_get_str (NULL
, 10, *integer
);
2677 write_atom (ATOM_STRING
, p
);
2684 mio_gmp_real (mpfr_t
*real
)
2689 if (iomode
== IO_INPUT
)
2691 if (parse_atom () != ATOM_STRING
)
2692 bad_module ("Expected real string");
2695 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2696 gfc_free (atom_string
);
2700 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2702 if (mpfr_nan_p (*real
) || mpfr_inf_p (*real
))
2704 write_atom (ATOM_STRING
, p
);
2709 atom_string
= XCNEWVEC (char, strlen (p
) + 20);
2711 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2713 /* Fix negative numbers. */
2714 if (atom_string
[2] == '-')
2716 atom_string
[0] = '-';
2717 atom_string
[1] = '0';
2718 atom_string
[2] = '.';
2721 write_atom (ATOM_STRING
, atom_string
);
2723 gfc_free (atom_string
);
2729 /* Save and restore the shape of an array constructor. */
2732 mio_shape (mpz_t
**pshape
, int rank
)
2738 /* A NULL shape is represented by (). */
2741 if (iomode
== IO_OUTPUT
)
2753 if (t
== ATOM_RPAREN
)
2760 shape
= gfc_get_shape (rank
);
2764 for (n
= 0; n
< rank
; n
++)
2765 mio_gmp_integer (&shape
[n
]);
2771 static const mstring expr_types
[] = {
2772 minit ("OP", EXPR_OP
),
2773 minit ("FUNCTION", EXPR_FUNCTION
),
2774 minit ("CONSTANT", EXPR_CONSTANT
),
2775 minit ("VARIABLE", EXPR_VARIABLE
),
2776 minit ("SUBSTRING", EXPR_SUBSTRING
),
2777 minit ("STRUCTURE", EXPR_STRUCTURE
),
2778 minit ("ARRAY", EXPR_ARRAY
),
2779 minit ("NULL", EXPR_NULL
),
2780 minit ("COMPCALL", EXPR_COMPCALL
),
2784 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2785 generic operators, not in expressions. INTRINSIC_USER is also
2786 replaced by the correct function name by the time we see it. */
2788 static const mstring intrinsics
[] =
2790 minit ("UPLUS", INTRINSIC_UPLUS
),
2791 minit ("UMINUS", INTRINSIC_UMINUS
),
2792 minit ("PLUS", INTRINSIC_PLUS
),
2793 minit ("MINUS", INTRINSIC_MINUS
),
2794 minit ("TIMES", INTRINSIC_TIMES
),
2795 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2796 minit ("POWER", INTRINSIC_POWER
),
2797 minit ("CONCAT", INTRINSIC_CONCAT
),
2798 minit ("AND", INTRINSIC_AND
),
2799 minit ("OR", INTRINSIC_OR
),
2800 minit ("EQV", INTRINSIC_EQV
),
2801 minit ("NEQV", INTRINSIC_NEQV
),
2802 minit ("EQ_SIGN", INTRINSIC_EQ
),
2803 minit ("EQ", INTRINSIC_EQ_OS
),
2804 minit ("NE_SIGN", INTRINSIC_NE
),
2805 minit ("NE", INTRINSIC_NE_OS
),
2806 minit ("GT_SIGN", INTRINSIC_GT
),
2807 minit ("GT", INTRINSIC_GT_OS
),
2808 minit ("GE_SIGN", INTRINSIC_GE
),
2809 minit ("GE", INTRINSIC_GE_OS
),
2810 minit ("LT_SIGN", INTRINSIC_LT
),
2811 minit ("LT", INTRINSIC_LT_OS
),
2812 minit ("LE_SIGN", INTRINSIC_LE
),
2813 minit ("LE", INTRINSIC_LE_OS
),
2814 minit ("NOT", INTRINSIC_NOT
),
2815 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2820 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2823 fix_mio_expr (gfc_expr
*e
)
2825 gfc_symtree
*ns_st
= NULL
;
2828 if (iomode
!= IO_OUTPUT
)
2833 /* If this is a symtree for a symbol that came from a contained module
2834 namespace, it has a unique name and we should look in the current
2835 namespace to see if the required, non-contained symbol is available
2836 yet. If so, the latter should be written. */
2837 if (e
->symtree
->n
.sym
&& check_unique_name (e
->symtree
->name
))
2838 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2839 e
->symtree
->n
.sym
->name
);
2841 /* On the other hand, if the existing symbol is the module name or the
2842 new symbol is a dummy argument, do not do the promotion. */
2843 if (ns_st
&& ns_st
->n
.sym
2844 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2845 && !e
->symtree
->n
.sym
->attr
.dummy
)
2848 else if (e
->expr_type
== EXPR_FUNCTION
&& e
->value
.function
.name
)
2850 /* In some circumstances, a function used in an initialization
2851 expression, in one use associated module, can fail to be
2852 coupled to its symtree when used in a specification
2853 expression in another module. */
2854 fname
= e
->value
.function
.esym
? e
->value
.function
.esym
->name
2855 : e
->value
.function
.isym
->name
;
2856 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2861 /* Read and write expressions. The form "()" is allowed to indicate a
2865 mio_expr (gfc_expr
**ep
)
2873 if (iomode
== IO_OUTPUT
)
2882 MIO_NAME (expr_t
) (e
->expr_type
, expr_types
);
2887 if (t
== ATOM_RPAREN
)
2894 bad_module ("Expected expression type");
2896 e
= *ep
= gfc_get_expr ();
2897 e
->where
= gfc_current_locus
;
2898 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2901 mio_typespec (&e
->ts
);
2902 mio_integer (&e
->rank
);
2906 switch (e
->expr_type
)
2910 = MIO_NAME (gfc_intrinsic_op
) (e
->value
.op
.op
, intrinsics
);
2912 switch (e
->value
.op
.op
)
2914 case INTRINSIC_UPLUS
:
2915 case INTRINSIC_UMINUS
:
2917 case INTRINSIC_PARENTHESES
:
2918 mio_expr (&e
->value
.op
.op1
);
2921 case INTRINSIC_PLUS
:
2922 case INTRINSIC_MINUS
:
2923 case INTRINSIC_TIMES
:
2924 case INTRINSIC_DIVIDE
:
2925 case INTRINSIC_POWER
:
2926 case INTRINSIC_CONCAT
:
2930 case INTRINSIC_NEQV
:
2932 case INTRINSIC_EQ_OS
:
2934 case INTRINSIC_NE_OS
:
2936 case INTRINSIC_GT_OS
:
2938 case INTRINSIC_GE_OS
:
2940 case INTRINSIC_LT_OS
:
2942 case INTRINSIC_LE_OS
:
2943 mio_expr (&e
->value
.op
.op1
);
2944 mio_expr (&e
->value
.op
.op2
);
2948 bad_module ("Bad operator");
2954 mio_symtree_ref (&e
->symtree
);
2955 mio_actual_arglist (&e
->value
.function
.actual
);
2957 if (iomode
== IO_OUTPUT
)
2959 e
->value
.function
.name
2960 = mio_allocated_string (e
->value
.function
.name
);
2961 flag
= e
->value
.function
.esym
!= NULL
;
2962 mio_integer (&flag
);
2964 mio_symbol_ref (&e
->value
.function
.esym
);
2966 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
2970 require_atom (ATOM_STRING
);
2971 e
->value
.function
.name
= gfc_get_string (atom_string
);
2972 gfc_free (atom_string
);
2974 mio_integer (&flag
);
2976 mio_symbol_ref (&e
->value
.function
.esym
);
2979 require_atom (ATOM_STRING
);
2980 e
->value
.function
.isym
= gfc_find_function (atom_string
);
2981 gfc_free (atom_string
);
2988 mio_symtree_ref (&e
->symtree
);
2989 mio_ref_list (&e
->ref
);
2992 case EXPR_SUBSTRING
:
2993 e
->value
.character
.string
2994 = CONST_CAST (gfc_char_t
*,
2995 mio_allocated_wide_string (e
->value
.character
.string
,
2996 e
->value
.character
.length
));
2997 mio_ref_list (&e
->ref
);
3000 case EXPR_STRUCTURE
:
3002 mio_constructor (&e
->value
.constructor
);
3003 mio_shape (&e
->shape
, e
->rank
);
3010 mio_gmp_integer (&e
->value
.integer
);
3014 gfc_set_model_kind (e
->ts
.kind
);
3015 mio_gmp_real (&e
->value
.real
);
3019 gfc_set_model_kind (e
->ts
.kind
);
3020 mio_gmp_real (&e
->value
.complex.r
);
3021 mio_gmp_real (&e
->value
.complex.i
);
3025 mio_integer (&e
->value
.logical
);
3029 mio_integer (&e
->value
.character
.length
);
3030 e
->value
.character
.string
3031 = CONST_CAST (gfc_char_t
*,
3032 mio_allocated_wide_string (e
->value
.character
.string
,
3033 e
->value
.character
.length
));
3037 bad_module ("Bad type in constant expression");
3054 /* Read and write namelists. */
3057 mio_namelist (gfc_symbol
*sym
)
3059 gfc_namelist
*n
, *m
;
3060 const char *check_name
;
3064 if (iomode
== IO_OUTPUT
)
3066 for (n
= sym
->namelist
; n
; n
= n
->next
)
3067 mio_symbol_ref (&n
->sym
);
3071 /* This departure from the standard is flagged as an error.
3072 It does, in fact, work correctly. TODO: Allow it
3074 if (sym
->attr
.flavor
== FL_NAMELIST
)
3076 check_name
= find_use_name (sym
->name
, false);
3077 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
3078 gfc_error ("Namelist %s cannot be renamed by USE "
3079 "association to %s", sym
->name
, check_name
);
3083 while (peek_atom () != ATOM_RPAREN
)
3085 n
= gfc_get_namelist ();
3086 mio_symbol_ref (&n
->sym
);
3088 if (sym
->namelist
== NULL
)
3095 sym
->namelist_tail
= m
;
3102 /* Save/restore lists of gfc_interface structures. When loading an
3103 interface, we are really appending to the existing list of
3104 interfaces. Checking for duplicate and ambiguous interfaces has to
3105 be done later when all symbols have been loaded. */
3108 mio_interface_rest (gfc_interface
**ip
)
3110 gfc_interface
*tail
, *p
;
3111 pointer_info
*pi
= NULL
;
3113 if (iomode
== IO_OUTPUT
)
3116 for (p
= *ip
; p
; p
= p
->next
)
3117 mio_symbol_ref (&p
->sym
);
3132 if (peek_atom () == ATOM_RPAREN
)
3135 p
= gfc_get_interface ();
3136 p
->where
= gfc_current_locus
;
3137 pi
= mio_symbol_ref (&p
->sym
);
3153 /* Save/restore a nameless operator interface. */
3156 mio_interface (gfc_interface
**ip
)
3159 mio_interface_rest (ip
);
3163 /* Save/restore a named operator interface. */
3166 mio_symbol_interface (const char **name
, const char **module
,
3170 mio_pool_string (name
);
3171 mio_pool_string (module
);
3172 mio_interface_rest (ip
);
3177 mio_namespace_ref (gfc_namespace
**nsp
)
3182 p
= mio_pointer_ref (nsp
);
3184 if (p
->type
== P_UNKNOWN
)
3185 p
->type
= P_NAMESPACE
;
3187 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
3189 ns
= (gfc_namespace
*) p
->u
.pointer
;
3192 ns
= gfc_get_namespace (NULL
, 0);
3193 associate_integer_pointer (p
, ns
);
3201 /* Save/restore the f2k_derived namespace of a derived-type symbol. */
3203 static gfc_namespace
* current_f2k_derived
;
3206 mio_typebound_proc (gfc_typebound_proc
** proc
)
3209 int overriding_flag
;
3211 if (iomode
== IO_INPUT
)
3213 *proc
= gfc_get_typebound_proc ();
3214 (*proc
)->where
= gfc_current_locus
;
3220 (*proc
)->access
= MIO_NAME (gfc_access
) ((*proc
)->access
, access_types
);
3222 /* IO the NON_OVERRIDABLE/DEFERRED combination. */
3223 gcc_assert (!((*proc
)->deferred
&& (*proc
)->non_overridable
));
3224 overriding_flag
= ((*proc
)->deferred
<< 1) | (*proc
)->non_overridable
;
3225 overriding_flag
= mio_name (overriding_flag
, binding_overriding
);
3226 (*proc
)->deferred
= ((overriding_flag
& 2) != 0);
3227 (*proc
)->non_overridable
= ((overriding_flag
& 1) != 0);
3228 gcc_assert (!((*proc
)->deferred
&& (*proc
)->non_overridable
));
3230 (*proc
)->nopass
= mio_name ((*proc
)->nopass
, binding_passing
);
3231 (*proc
)->is_generic
= mio_name ((*proc
)->is_generic
, binding_generic
);
3233 if (iomode
== IO_INPUT
)
3234 (*proc
)->pass_arg
= NULL
;
3236 flag
= (int) (*proc
)->pass_arg_num
;
3237 mio_integer (&flag
);
3238 (*proc
)->pass_arg_num
= (unsigned) flag
;
3240 if ((*proc
)->is_generic
)
3246 if (iomode
== IO_OUTPUT
)
3247 for (g
= (*proc
)->u
.generic
; g
; g
= g
->next
)
3248 mio_allocated_string (g
->specific_st
->name
);
3251 (*proc
)->u
.generic
= NULL
;
3252 while (peek_atom () != ATOM_RPAREN
)
3254 gfc_symtree
** sym_root
;
3256 g
= gfc_get_tbp_generic ();
3259 require_atom (ATOM_STRING
);
3260 sym_root
= ¤t_f2k_derived
->tb_sym_root
;
3261 g
->specific_st
= gfc_get_tbp_symtree (sym_root
, atom_string
);
3262 gfc_free (atom_string
);
3264 g
->next
= (*proc
)->u
.generic
;
3265 (*proc
)->u
.generic
= g
;
3272 mio_symtree_ref (&(*proc
)->u
.specific
);
3278 mio_typebound_symtree (gfc_symtree
* st
)
3280 if (iomode
== IO_OUTPUT
&& !st
->n
.tb
)
3283 if (iomode
== IO_OUTPUT
)
3286 mio_allocated_string (st
->name
);
3288 /* For IO_INPUT, the above is done in mio_f2k_derived. */
3290 mio_typebound_proc (&st
->n
.tb
);
3295 mio_finalizer (gfc_finalizer
**f
)
3297 if (iomode
== IO_OUTPUT
)
3300 gcc_assert ((*f
)->proc_tree
); /* Should already be resolved. */
3301 mio_symtree_ref (&(*f
)->proc_tree
);
3305 *f
= gfc_get_finalizer ();
3306 (*f
)->where
= gfc_current_locus
; /* Value should not matter. */
3309 mio_symtree_ref (&(*f
)->proc_tree
);
3310 (*f
)->proc_sym
= NULL
;
3315 mio_f2k_derived (gfc_namespace
*f2k
)
3317 current_f2k_derived
= f2k
;
3319 /* Handle the list of finalizer procedures. */
3321 if (iomode
== IO_OUTPUT
)
3324 for (f
= f2k
->finalizers
; f
; f
= f
->next
)
3329 f2k
->finalizers
= NULL
;
3330 while (peek_atom () != ATOM_RPAREN
)
3333 mio_finalizer (&cur
);
3334 cur
->next
= f2k
->finalizers
;
3335 f2k
->finalizers
= cur
;
3340 /* Handle type-bound procedures. */
3342 if (iomode
== IO_OUTPUT
)
3343 gfc_traverse_symtree (f2k
->tb_sym_root
, &mio_typebound_symtree
);
3346 while (peek_atom () == ATOM_LPAREN
)
3352 require_atom (ATOM_STRING
);
3353 st
= gfc_get_tbp_symtree (&f2k
->tb_sym_root
, atom_string
);
3354 gfc_free (atom_string
);
3356 mio_typebound_symtree (st
);
3363 mio_full_f2k_derived (gfc_symbol
*sym
)
3367 if (iomode
== IO_OUTPUT
)
3369 if (sym
->f2k_derived
)
3370 mio_f2k_derived (sym
->f2k_derived
);
3374 if (peek_atom () != ATOM_RPAREN
)
3376 sym
->f2k_derived
= gfc_get_namespace (NULL
, 0);
3377 mio_f2k_derived (sym
->f2k_derived
);
3380 gcc_assert (!sym
->f2k_derived
);
3387 /* Unlike most other routines, the address of the symbol node is already
3388 fixed on input and the name/module has already been filled in. */
3391 mio_symbol (gfc_symbol
*sym
)
3393 int intmod
= INTMOD_NONE
;
3395 gfc_formal_arglist
*formal
;
3399 mio_symbol_attribute (&sym
->attr
);
3400 mio_typespec (&sym
->ts
);
3402 /* Contained procedures don't have formal namespaces. Instead we output the
3403 procedure namespace. The will contain the formal arguments. */
3404 if (iomode
== IO_OUTPUT
)
3406 formal
= sym
->formal
;
3407 while (formal
&& !formal
->sym
)
3408 formal
= formal
->next
;
3411 mio_namespace_ref (&formal
->sym
->ns
);
3413 mio_namespace_ref (&sym
->formal_ns
);
3417 mio_namespace_ref (&sym
->formal_ns
);
3420 sym
->formal_ns
->proc_name
= sym
;
3425 /* Save/restore common block links. */
3426 mio_symbol_ref (&sym
->common_next
);
3428 mio_formal_arglist (sym
);
3430 if (sym
->attr
.flavor
== FL_PARAMETER
)
3431 mio_expr (&sym
->value
);
3433 mio_array_spec (&sym
->as
);
3435 mio_symbol_ref (&sym
->result
);
3437 if (sym
->attr
.cray_pointee
)
3438 mio_symbol_ref (&sym
->cp_pointer
);
3440 /* Note that components are always saved, even if they are supposed
3441 to be private. Component access is checked during searching. */
3443 mio_component_list (&sym
->components
);
3445 if (sym
->components
!= NULL
)
3446 sym
->component_access
3447 = MIO_NAME (gfc_access
) (sym
->component_access
, access_types
);
3449 /* Load/save the f2k_derived namespace of a derived-type symbol. */
3450 mio_full_f2k_derived (sym
);
3454 /* Add the fields that say whether this is from an intrinsic module,
3455 and if so, what symbol it is within the module. */
3456 /* mio_integer (&(sym->from_intmod)); */
3457 if (iomode
== IO_OUTPUT
)
3459 intmod
= sym
->from_intmod
;
3460 mio_integer (&intmod
);
3464 mio_integer (&intmod
);
3465 sym
->from_intmod
= intmod
;
3468 mio_integer (&(sym
->intmod_sym_id
));
3474 /************************* Top level subroutines *************************/
3476 /* Given a root symtree node and a symbol, try to find a symtree that
3477 references the symbol that is not a unique name. */
3479 static gfc_symtree
*
3480 find_symtree_for_symbol (gfc_symtree
*st
, gfc_symbol
*sym
)
3482 gfc_symtree
*s
= NULL
;
3487 s
= find_symtree_for_symbol (st
->right
, sym
);
3490 s
= find_symtree_for_symbol (st
->left
, sym
);
3494 if (st
->n
.sym
== sym
&& !check_unique_name (st
->name
))
3501 /* A recursive function to look for a specific symbol by name and by
3502 module. Whilst several symtrees might point to one symbol, its
3503 is sufficient for the purposes here than one exist. Note that
3504 generic interfaces are distinguished as are symbols that have been
3505 renamed in another module. */
3506 static gfc_symtree
*
3507 find_symbol (gfc_symtree
*st
, const char *name
,
3508 const char *module
, int generic
)
3511 gfc_symtree
*retval
, *s
;
3513 if (st
== NULL
|| st
->n
.sym
== NULL
)
3516 c
= strcmp (name
, st
->n
.sym
->name
);
3517 if (c
== 0 && st
->n
.sym
->module
3518 && strcmp (module
, st
->n
.sym
->module
) == 0
3519 && !check_unique_name (st
->name
))
3521 s
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3523 /* Detect symbols that are renamed by use association in another
3524 module by the absence of a symtree and null attr.use_rename,
3525 since the latter is not transmitted in the module file. */
3526 if (((!generic
&& !st
->n
.sym
->attr
.generic
)
3527 || (generic
&& st
->n
.sym
->attr
.generic
))
3528 && !(s
== NULL
&& !st
->n
.sym
->attr
.use_rename
))
3532 retval
= find_symbol (st
->left
, name
, module
, generic
);
3535 retval
= find_symbol (st
->right
, name
, module
, generic
);
3541 /* Skip a list between balanced left and right parens. */
3551 switch (parse_atom ())
3562 gfc_free (atom_string
);
3574 /* Load operator interfaces from the module. Interfaces are unusual
3575 in that they attach themselves to existing symbols. */
3578 load_operator_interfaces (void)
3581 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3583 pointer_info
*pi
= NULL
;
3588 while (peek_atom () != ATOM_RPAREN
)
3592 mio_internal_string (name
);
3593 mio_internal_string (module
);
3595 n
= number_use_names (name
, true);
3598 for (i
= 1; i
<= n
; i
++)
3600 /* Decide if we need to load this one or not. */
3601 p
= find_use_name_n (name
, &i
, true);
3605 while (parse_atom () != ATOM_RPAREN
);
3611 uop
= gfc_get_uop (p
);
3612 pi
= mio_interface_rest (&uop
->op
);
3616 if (gfc_find_uop (p
, NULL
))
3618 uop
= gfc_get_uop (p
);
3619 uop
->op
= gfc_get_interface ();
3620 uop
->op
->where
= gfc_current_locus
;
3621 add_fixup (pi
->integer
, &uop
->op
->sym
);
3630 /* Load interfaces from the module. Interfaces are unusual in that
3631 they attach themselves to existing symbols. */
3634 load_generic_interfaces (void)
3637 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3639 gfc_interface
*generic
= NULL
;
3644 while (peek_atom () != ATOM_RPAREN
)
3648 mio_internal_string (name
);
3649 mio_internal_string (module
);
3651 n
= number_use_names (name
, false);
3652 renamed
= n
? 1 : 0;
3655 for (i
= 1; i
<= n
; i
++)
3658 /* Decide if we need to load this one or not. */
3659 p
= find_use_name_n (name
, &i
, false);
3661 st
= find_symbol (gfc_current_ns
->sym_root
,
3662 name
, module_name
, 1);
3664 if (!p
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
3666 /* Skip the specific names for these cases. */
3667 while (i
== 1 && parse_atom () != ATOM_RPAREN
);
3672 /* If the symbol exists already and is being USEd without being
3673 in an ONLY clause, do not load a new symtree(11.3.2). */
3674 if (!only_flag
&& st
)
3679 /* Make the symbol inaccessible if it has been added by a USE
3680 statement without an ONLY(11.3.2). */
3682 && !st
->n
.sym
->attr
.use_only
3683 && !st
->n
.sym
->attr
.use_rename
3684 && strcmp (st
->n
.sym
->module
, module_name
) == 0)
3687 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3688 st
= gfc_get_unique_symtree (gfc_current_ns
);
3695 if (strcmp (st
->name
, p
) != 0)
3697 st
= gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3703 /* Since we haven't found a valid generic interface, we had
3707 gfc_get_symbol (p
, NULL
, &sym
);
3708 sym
->name
= gfc_get_string (name
);
3709 sym
->module
= gfc_get_string (module_name
);
3710 sym
->attr
.flavor
= FL_PROCEDURE
;
3711 sym
->attr
.generic
= 1;
3712 sym
->attr
.use_assoc
= 1;
3717 /* Unless sym is a generic interface, this reference
3720 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3724 if (st
&& !sym
->attr
.generic
3726 && strcmp(module
, sym
->module
))
3730 sym
->attr
.use_only
= only_flag
;
3731 sym
->attr
.use_rename
= renamed
;
3735 mio_interface_rest (&sym
->generic
);
3736 generic
= sym
->generic
;
3738 else if (!sym
->generic
)
3740 sym
->generic
= generic
;
3741 sym
->attr
.generic_copy
= 1;
3750 /* Load common blocks. */
3755 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3760 while (peek_atom () != ATOM_RPAREN
)
3764 mio_internal_string (name
);
3766 p
= gfc_get_common (name
, 1);
3768 mio_symbol_ref (&p
->head
);
3769 mio_integer (&flags
);
3773 p
->threadprivate
= 1;
3776 /* Get whether this was a bind(c) common or not. */
3777 mio_integer (&p
->is_bind_c
);
3778 /* Get the binding label. */
3779 mio_internal_string (p
->binding_label
);
3788 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3789 so that unused variables are not loaded and so that the expression can
3795 gfc_equiv
*head
, *tail
, *end
, *eq
;
3799 in_load_equiv
= true;
3801 end
= gfc_current_ns
->equiv
;
3802 while (end
!= NULL
&& end
->next
!= NULL
)
3805 while (peek_atom () != ATOM_RPAREN
) {
3809 while(peek_atom () != ATOM_RPAREN
)
3812 head
= tail
= gfc_get_equiv ();
3815 tail
->eq
= gfc_get_equiv ();
3819 mio_pool_string (&tail
->module
);
3820 mio_expr (&tail
->expr
);
3823 /* Unused equivalence members have a unique name. In addition, it
3824 must be checked that the symbols are from the same module. */
3826 for (eq
= head
; eq
; eq
= eq
->eq
)
3828 if (eq
->expr
->symtree
->n
.sym
->module
3829 && head
->expr
->symtree
->n
.sym
->module
3830 && strcmp (head
->expr
->symtree
->n
.sym
->module
,
3831 eq
->expr
->symtree
->n
.sym
->module
) == 0
3832 && !check_unique_name (eq
->expr
->symtree
->name
))
3841 for (eq
= head
; eq
; eq
= head
)
3844 gfc_free_expr (eq
->expr
);
3850 gfc_current_ns
->equiv
= head
;
3861 in_load_equiv
= false;
3865 /* Recursive function to traverse the pointer_info tree and load a
3866 needed symbol. We return nonzero if we load a symbol and stop the
3867 traversal, because the act of loading can alter the tree. */
3870 load_needed (pointer_info
*p
)
3881 rv
|= load_needed (p
->left
);
3882 rv
|= load_needed (p
->right
);
3884 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
3887 p
->u
.rsym
.state
= USED
;
3889 set_module_locus (&p
->u
.rsym
.where
);
3891 sym
= p
->u
.rsym
.sym
;
3894 q
= get_integer (p
->u
.rsym
.ns
);
3896 ns
= (gfc_namespace
*) q
->u
.pointer
;
3899 /* Create an interface namespace if necessary. These are
3900 the namespaces that hold the formal parameters of module
3903 ns
= gfc_get_namespace (NULL
, 0);
3904 associate_integer_pointer (q
, ns
);
3907 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
3908 doesn't go pear-shaped if the symbol is used. */
3910 gfc_find_symbol (p
->u
.rsym
.module
, gfc_current_ns
,
3913 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
3914 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
3915 strcpy (sym
->binding_label
, p
->u
.rsym
.binding_label
);
3917 associate_integer_pointer (p
, sym
);
3921 sym
->attr
.use_assoc
= 1;
3923 sym
->attr
.use_only
= 1;
3924 if (p
->u
.rsym
.renamed
)
3925 sym
->attr
.use_rename
= 1;
3931 /* Recursive function for cleaning up things after a module has been read. */
3934 read_cleanup (pointer_info
*p
)
3942 read_cleanup (p
->left
);
3943 read_cleanup (p
->right
);
3945 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
3947 /* Add hidden symbols to the symtree. */
3948 q
= get_integer (p
->u
.rsym
.ns
);
3949 st
= gfc_get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
3951 st
->n
.sym
= p
->u
.rsym
.sym
;
3954 /* Fixup any symtree references. */
3955 p
->u
.rsym
.symtree
= st
;
3956 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
3957 p
->u
.rsym
.stfixup
= NULL
;
3960 /* Free unused symbols. */
3961 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
3962 gfc_free_symbol (p
->u
.rsym
.sym
);
3966 /* It is not quite enough to check for ambiguity in the symbols by
3967 the loaded symbol and the new symbol not being identical. */
3969 check_for_ambiguous (gfc_symbol
*st_sym
, pointer_info
*info
)
3973 symbol_attribute attr
;
3975 rsym
= info
->u
.rsym
.sym
;
3979 /* If the existing symbol is generic from a different module and
3980 the new symbol is generic there can be no ambiguity. */
3981 if (st_sym
->attr
.generic
3983 && strcmp (st_sym
->module
, module_name
))
3985 /* The new symbol's attributes have not yet been read. Since
3986 we need attr.generic, read it directly. */
3987 get_module_locus (&locus
);
3988 set_module_locus (&info
->u
.rsym
.where
);
3991 mio_symbol_attribute (&attr
);
3992 set_module_locus (&locus
);
4001 /* Read a module file. */
4006 module_locus operator_interfaces
, user_operators
;
4008 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
4010 int ambiguous
, j
, nuse
, symbol
;
4011 pointer_info
*info
, *q
;
4016 get_module_locus (&operator_interfaces
); /* Skip these for now. */
4019 get_module_locus (&user_operators
);
4023 /* Skip commons and equivalences for now. */
4029 /* Create the fixup nodes for all the symbols. */
4031 while (peek_atom () != ATOM_RPAREN
)
4033 require_atom (ATOM_INTEGER
);
4034 info
= get_integer (atom_int
);
4036 info
->type
= P_SYMBOL
;
4037 info
->u
.rsym
.state
= UNUSED
;
4039 mio_internal_string (info
->u
.rsym
.true_name
);
4040 mio_internal_string (info
->u
.rsym
.module
);
4041 mio_internal_string (info
->u
.rsym
.binding_label
);
4044 require_atom (ATOM_INTEGER
);
4045 info
->u
.rsym
.ns
= atom_int
;
4047 get_module_locus (&info
->u
.rsym
.where
);
4050 /* See if the symbol has already been loaded by a previous module.
4051 If so, we reference the existing symbol and prevent it from
4052 being loaded again. This should not happen if the symbol being
4053 read is an index for an assumed shape dummy array (ns != 1). */
4055 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
4058 || (sym
->attr
.flavor
== FL_VARIABLE
&& info
->u
.rsym
.ns
!=1))
4061 info
->u
.rsym
.state
= USED
;
4062 info
->u
.rsym
.sym
= sym
;
4064 /* Some symbols do not have a namespace (eg. formal arguments),
4065 so the automatic "unique symtree" mechanism must be suppressed
4066 by marking them as referenced. */
4067 q
= get_integer (info
->u
.rsym
.ns
);
4068 if (q
->u
.pointer
== NULL
)
4070 info
->u
.rsym
.referenced
= 1;
4074 /* If possible recycle the symtree that references the symbol.
4075 If a symtree is not found and the module does not import one,
4076 a unique-name symtree is found by read_cleanup. */
4077 st
= find_symtree_for_symbol (gfc_current_ns
->sym_root
, sym
);
4080 info
->u
.rsym
.symtree
= st
;
4081 info
->u
.rsym
.referenced
= 1;
4087 /* Parse the symtree lists. This lets us mark which symbols need to
4088 be loaded. Renaming is also done at this point by replacing the
4093 while (peek_atom () != ATOM_RPAREN
)
4095 mio_internal_string (name
);
4096 mio_integer (&ambiguous
);
4097 mio_integer (&symbol
);
4099 info
= get_integer (symbol
);
4101 /* See how many use names there are. If none, go through the start
4102 of the loop at least once. */
4103 nuse
= number_use_names (name
, false);
4104 info
->u
.rsym
.renamed
= nuse
? 1 : 0;
4109 for (j
= 1; j
<= nuse
; j
++)
4111 /* Get the jth local name for this symbol. */
4112 p
= find_use_name_n (name
, &j
, false);
4114 if (p
== NULL
&& strcmp (name
, module_name
) == 0)
4117 /* Skip symtree nodes not in an ONLY clause, unless there
4118 is an existing symtree loaded from another USE statement. */
4121 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4123 info
->u
.rsym
.symtree
= st
;
4127 /* If a symbol of the same name and module exists already,
4128 this symbol, which is not in an ONLY clause, must not be
4129 added to the namespace(11.3.2). Note that find_symbol
4130 only returns the first occurrence that it finds. */
4131 if (!only_flag
&& !info
->u
.rsym
.renamed
4132 && strcmp (name
, module_name
) != 0
4133 && find_symbol (gfc_current_ns
->sym_root
, name
,
4137 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
4141 /* Check for ambiguous symbols. */
4142 if (check_for_ambiguous (st
->n
.sym
, info
))
4144 info
->u
.rsym
.symtree
= st
;
4148 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4150 /* Delete the symtree if the symbol has been added by a USE
4151 statement without an ONLY(11.3.2). Remember that the rsym
4152 will be the same as the symbol found in the symtree, for
4154 if (st
&& (only_flag
|| info
->u
.rsym
.renamed
)
4155 && !st
->n
.sym
->attr
.use_only
4156 && !st
->n
.sym
->attr
.use_rename
4157 && info
->u
.rsym
.sym
== st
->n
.sym
)
4158 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
4160 /* Create a symtree node in the current namespace for this
4162 st
= check_unique_name (p
)
4163 ? gfc_get_unique_symtree (gfc_current_ns
)
4164 : gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
4165 st
->ambiguous
= ambiguous
;
4167 sym
= info
->u
.rsym
.sym
;
4169 /* Create a symbol node if it doesn't already exist. */
4172 info
->u
.rsym
.sym
= gfc_new_symbol (info
->u
.rsym
.true_name
,
4174 sym
= info
->u
.rsym
.sym
;
4175 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
4177 /* TODO: hmm, can we test this? Do we know it will be
4178 initialized to zeros? */
4179 if (info
->u
.rsym
.binding_label
[0] != '\0')
4180 strcpy (sym
->binding_label
, info
->u
.rsym
.binding_label
);
4186 if (strcmp (name
, p
) != 0)
4187 sym
->attr
.use_rename
= 1;
4189 /* We need to set the only_flag here so that symbols from the
4190 same USE...ONLY but earlier are not deleted from the tree in
4191 the gfc_delete_symtree above. */
4192 sym
->attr
.use_only
= only_flag
;
4194 /* Store the symtree pointing to this symbol. */
4195 info
->u
.rsym
.symtree
= st
;
4197 if (info
->u
.rsym
.state
== UNUSED
)
4198 info
->u
.rsym
.state
= NEEDED
;
4199 info
->u
.rsym
.referenced
= 1;
4206 /* Load intrinsic operator interfaces. */
4207 set_module_locus (&operator_interfaces
);
4210 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4212 if (i
== INTRINSIC_USER
)
4217 u
= find_use_operator (i
);
4228 mio_interface (&gfc_current_ns
->op
[i
]);
4233 /* Load generic and user operator interfaces. These must follow the
4234 loading of symtree because otherwise symbols can be marked as
4237 set_module_locus (&user_operators
);
4239 load_operator_interfaces ();
4240 load_generic_interfaces ();
4245 /* At this point, we read those symbols that are needed but haven't
4246 been loaded yet. If one symbol requires another, the other gets
4247 marked as NEEDED if its previous state was UNUSED. */
4249 while (load_needed (pi_root
));
4251 /* Make sure all elements of the rename-list were found in the module. */
4253 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4258 if (u
->op
== INTRINSIC_NONE
)
4260 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
4261 u
->use_name
, &u
->where
, module_name
);
4265 if (u
->op
== INTRINSIC_USER
)
4267 gfc_error ("User operator '%s' referenced at %L not found "
4268 "in module '%s'", u
->use_name
, &u
->where
, module_name
);
4272 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
4273 "in module '%s'", gfc_op2string (u
->op
), &u
->where
,
4277 gfc_check_interfaces (gfc_current_ns
);
4279 /* Clean up symbol nodes that were never loaded, create references
4280 to hidden symbols. */
4282 read_cleanup (pi_root
);
4286 /* Given an access type that is specific to an entity and the default
4287 access, return nonzero if the entity is publicly accessible. If the
4288 element is declared as PUBLIC, then it is public; if declared
4289 PRIVATE, then private, and otherwise it is public unless the default
4290 access in this context has been declared PRIVATE. */
4293 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
4295 if (specific_access
== ACCESS_PUBLIC
)
4297 if (specific_access
== ACCESS_PRIVATE
)
4300 if (gfc_option
.flag_module_private
)
4301 return default_access
== ACCESS_PUBLIC
;
4303 return default_access
!= ACCESS_PRIVATE
;
4307 /* A structure to remember which commons we've already written. */
4309 struct written_common
4311 BBT_HEADER(written_common
);
4312 const char *name
, *label
;
4315 static struct written_common
*written_commons
= NULL
;
4317 /* Comparison function used for balancing the binary tree. */
4320 compare_written_commons (void *a1
, void *b1
)
4322 const char *aname
= ((struct written_common
*) a1
)->name
;
4323 const char *alabel
= ((struct written_common
*) a1
)->label
;
4324 const char *bname
= ((struct written_common
*) b1
)->name
;
4325 const char *blabel
= ((struct written_common
*) b1
)->label
;
4326 int c
= strcmp (aname
, bname
);
4328 return (c
!= 0 ? c
: strcmp (alabel
, blabel
));
4331 /* Free a list of written commons. */
4334 free_written_common (struct written_common
*w
)
4340 free_written_common (w
->left
);
4342 free_written_common (w
->right
);
4347 /* Write a common block to the module -- recursive helper function. */
4350 write_common_0 (gfc_symtree
*st
, bool this_module
)
4356 struct written_common
*w
;
4357 bool write_me
= true;
4362 write_common_0 (st
->left
, this_module
);
4364 /* We will write out the binding label, or the name if no label given. */
4365 name
= st
->n
.common
->name
;
4367 label
= p
->is_bind_c
? p
->binding_label
: p
->name
;
4369 /* Check if we've already output this common. */
4370 w
= written_commons
;
4373 int c
= strcmp (name
, w
->name
);
4374 c
= (c
!= 0 ? c
: strcmp (label
, w
->label
));
4378 w
= (c
< 0) ? w
->left
: w
->right
;
4381 if (this_module
&& p
->use_assoc
)
4386 /* Write the common to the module. */
4388 mio_pool_string (&name
);
4390 mio_symbol_ref (&p
->head
);
4391 flags
= p
->saved
? 1 : 0;
4392 if (p
->threadprivate
)
4394 mio_integer (&flags
);
4396 /* Write out whether the common block is bind(c) or not. */
4397 mio_integer (&(p
->is_bind_c
));
4399 mio_pool_string (&label
);
4402 /* Record that we have written this common. */
4403 w
= XCNEW (struct written_common
);
4406 gfc_insert_bbt (&written_commons
, w
, compare_written_commons
);
4409 write_common_0 (st
->right
, this_module
);
4413 /* Write a common, by initializing the list of written commons, calling
4414 the recursive function write_common_0() and cleaning up afterwards. */
4417 write_common (gfc_symtree
*st
)
4419 written_commons
= NULL
;
4420 write_common_0 (st
, true);
4421 write_common_0 (st
, false);
4422 free_written_common (written_commons
);
4423 written_commons
= NULL
;
4427 /* Write the blank common block to the module. */
4430 write_blank_common (void)
4432 const char * name
= BLANK_COMMON_NAME
;
4434 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4435 this, but it hasn't been checked. Just making it so for now. */
4438 if (gfc_current_ns
->blank_common
.head
== NULL
)
4443 mio_pool_string (&name
);
4445 mio_symbol_ref (&gfc_current_ns
->blank_common
.head
);
4446 saved
= gfc_current_ns
->blank_common
.saved
;
4447 mio_integer (&saved
);
4449 /* Write out whether the common block is bind(c) or not. */
4450 mio_integer (&is_bind_c
);
4452 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4453 it doesn't matter because the label isn't used. */
4454 mio_pool_string (&name
);
4460 /* Write equivalences to the module. */
4469 for (eq
= gfc_current_ns
->equiv
; eq
; eq
= eq
->next
)
4473 for (e
= eq
; e
; e
= e
->eq
)
4475 if (e
->module
== NULL
)
4476 e
->module
= gfc_get_string ("%s.eq.%d", module_name
, num
);
4477 mio_allocated_string (e
->module
);
4478 mio_expr (&e
->expr
);
4487 /* Write a symbol to the module. */
4490 write_symbol (int n
, gfc_symbol
*sym
)
4494 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
4495 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
4498 mio_pool_string (&sym
->name
);
4500 mio_pool_string (&sym
->module
);
4501 if (sym
->attr
.is_bind_c
|| sym
->attr
.is_iso_c
)
4503 label
= sym
->binding_label
;
4504 mio_pool_string (&label
);
4507 mio_pool_string (&sym
->name
);
4509 mio_pointer_ref (&sym
->ns
);
4516 /* Recursive traversal function to write the initial set of symbols to
4517 the module. We check to see if the symbol should be written
4518 according to the access specification. */
4521 write_symbol0 (gfc_symtree
*st
)
4525 bool dont_write
= false;
4530 write_symbol0 (st
->left
);
4533 if (sym
->module
== NULL
)
4534 sym
->module
= gfc_get_string (module_name
);
4536 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4537 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
4540 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4545 p
= get_pointer (sym
);
4546 if (p
->type
== P_UNKNOWN
)
4549 if (p
->u
.wsym
.state
!= WRITTEN
)
4551 write_symbol (p
->integer
, sym
);
4552 p
->u
.wsym
.state
= WRITTEN
;
4556 write_symbol0 (st
->right
);
4560 /* Recursive traversal function to write the secondary set of symbols
4561 to the module file. These are symbols that were not public yet are
4562 needed by the public symbols or another dependent symbol. The act
4563 of writing a symbol can modify the pointer_info tree, so we cease
4564 traversal if we find a symbol to write. We return nonzero if a
4565 symbol was written and pass that information upwards. */
4568 write_symbol1 (pointer_info
*p
)
4575 result
= write_symbol1 (p
->left
);
4577 if (!(p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
))
4579 p
->u
.wsym
.state
= WRITTEN
;
4580 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
4584 result
|= write_symbol1 (p
->right
);
4589 /* Write operator interfaces associated with a symbol. */
4592 write_operator (gfc_user_op
*uop
)
4594 static char nullstring
[] = "";
4595 const char *p
= nullstring
;
4598 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
4601 mio_symbol_interface (&uop
->name
, &p
, &uop
->op
);
4605 /* Write generic interfaces from the namespace sym_root. */
4608 write_generic (gfc_symtree
*st
)
4615 write_generic (st
->left
);
4616 write_generic (st
->right
);
4619 if (!sym
|| check_unique_name (st
->name
))
4622 if (sym
->generic
== NULL
4623 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4626 if (sym
->module
== NULL
)
4627 sym
->module
= gfc_get_string (module_name
);
4629 mio_symbol_interface (&st
->name
, &sym
->module
, &sym
->generic
);
4634 write_symtree (gfc_symtree
*st
)
4641 /* A symbol in an interface body must not be visible in the
4643 if (sym
->ns
!= gfc_current_ns
4644 && sym
->ns
->proc_name
4645 && sym
->ns
->proc_name
->attr
.if_source
== IFSRC_IFBODY
)
4648 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
4649 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4650 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
4653 if (check_unique_name (st
->name
))
4656 p
= find_pointer (sym
);
4658 gfc_internal_error ("write_symtree(): Symbol not written");
4660 mio_pool_string (&st
->name
);
4661 mio_integer (&st
->ambiguous
);
4662 mio_integer (&p
->integer
);
4671 /* Write the operator interfaces. */
4674 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4676 if (i
== INTRINSIC_USER
)
4679 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
4680 gfc_current_ns
->default_access
)
4681 ? &gfc_current_ns
->op
[i
] : NULL
);
4689 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
4695 write_generic (gfc_current_ns
->sym_root
);
4701 write_blank_common ();
4702 write_common (gfc_current_ns
->common_root
);
4713 /* Write symbol information. First we traverse all symbols in the
4714 primary namespace, writing those that need to be written.
4715 Sometimes writing one symbol will cause another to need to be
4716 written. A list of these symbols ends up on the write stack, and
4717 we end by popping the bottom of the stack and writing the symbol
4718 until the stack is empty. */
4722 write_symbol0 (gfc_current_ns
->sym_root
);
4723 while (write_symbol1 (pi_root
))
4732 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
4737 /* Read a MD5 sum from the header of a module file. If the file cannot
4738 be opened, or we have any other error, we return -1. */
4741 read_md5_from_module_file (const char * filename
, unsigned char md5
[16])
4747 /* Open the file. */
4748 if ((file
= fopen (filename
, "r")) == NULL
)
4751 /* Read two lines. */
4752 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
4758 /* The file also needs to be overwritten if the version number changed. */
4759 n
= strlen ("GFORTRAN module version '" MOD_VERSION
"' created");
4760 if (strncmp (buf
, "GFORTRAN module version '" MOD_VERSION
"' created", n
) != 0)
4763 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
4769 /* Close the file. */
4772 /* If the header is not what we expect, or is too short, bail out. */
4773 if (strncmp (buf
, "MD5:", 4) != 0 || strlen (buf
) < 4 + 16)
4776 /* Now, we have a real MD5, read it into the array. */
4777 for (n
= 0; n
< 16; n
++)
4781 if (sscanf (&(buf
[4+2*n
]), "%02x", &x
) != 1)
4791 /* Given module, dump it to disk. If there was an error while
4792 processing the module, dump_flag will be set to zero and we delete
4793 the module file, even if it was already there. */
4796 gfc_dump_module (const char *name
, int dump_flag
)
4799 char *filename
, *filename_tmp
, *p
;
4802 unsigned char md5_new
[16], md5_old
[16];
4804 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
4805 if (gfc_option
.module_dir
!= NULL
)
4807 n
+= strlen (gfc_option
.module_dir
);
4808 filename
= (char *) alloca (n
);
4809 strcpy (filename
, gfc_option
.module_dir
);
4810 strcat (filename
, name
);
4814 filename
= (char *) alloca (n
);
4815 strcpy (filename
, name
);
4817 strcat (filename
, MODULE_EXTENSION
);
4819 /* Name of the temporary file used to write the module. */
4820 filename_tmp
= (char *) alloca (n
+ 1);
4821 strcpy (filename_tmp
, filename
);
4822 strcat (filename_tmp
, "0");
4824 /* There was an error while processing the module. We delete the
4825 module file, even if it was already there. */
4832 /* Write the module to the temporary file. */
4833 module_fp
= fopen (filename_tmp
, "w");
4834 if (module_fp
== NULL
)
4835 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
4836 filename_tmp
, strerror (errno
));
4838 /* Write the header, including space reserved for the MD5 sum. */
4842 *strchr (p
, '\n') = '\0';
4844 fprintf (module_fp
, "GFORTRAN module version '%s' created from %s on %s\n"
4845 "MD5:", MOD_VERSION
, gfc_source_file
, p
);
4846 fgetpos (module_fp
, &md5_pos
);
4847 fputs ("00000000000000000000000000000000 -- "
4848 "If you edit this, you'll get what you deserve.\n\n", module_fp
);
4850 /* Initialize the MD5 context that will be used for output. */
4851 md5_init_ctx (&ctx
);
4853 /* Write the module itself. */
4855 strcpy (module_name
, name
);
4861 free_pi_tree (pi_root
);
4866 /* Write the MD5 sum to the header of the module file. */
4867 md5_finish_ctx (&ctx
, md5_new
);
4868 fsetpos (module_fp
, &md5_pos
);
4869 for (n
= 0; n
< 16; n
++)
4870 fprintf (module_fp
, "%02x", md5_new
[n
]);
4872 if (fclose (module_fp
))
4873 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
4874 filename_tmp
, strerror (errno
));
4876 /* Read the MD5 from the header of the old module file and compare. */
4877 if (read_md5_from_module_file (filename
, md5_old
) != 0
4878 || memcmp (md5_old
, md5_new
, sizeof (md5_old
)) != 0)
4880 /* Module file have changed, replace the old one. */
4881 if (unlink (filename
) && errno
!= ENOENT
)
4882 gfc_fatal_error ("Can't delete module file '%s': %s", filename
,
4884 if (rename (filename_tmp
, filename
))
4885 gfc_fatal_error ("Can't rename module file '%s' to '%s': %s",
4886 filename_tmp
, filename
, strerror (errno
));
4890 if (unlink (filename_tmp
))
4891 gfc_fatal_error ("Can't delete temporary module file '%s': %s",
4892 filename_tmp
, strerror (errno
));
4898 sort_iso_c_rename_list (void)
4900 gfc_use_rename
*tmp_list
= NULL
;
4901 gfc_use_rename
*curr
;
4902 gfc_use_rename
*kinds_used
[ISOCBINDING_NUMBER
] = {NULL
};
4906 for (curr
= gfc_rename_list
; curr
; curr
= curr
->next
)
4908 c_kind
= get_c_kind (curr
->use_name
, c_interop_kinds_table
);
4909 if (c_kind
== ISOCBINDING_INVALID
|| c_kind
== ISOCBINDING_LAST
)
4911 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4912 "intrinsic module ISO_C_BINDING.", curr
->use_name
,
4916 /* Put it in the list. */
4917 kinds_used
[c_kind
] = curr
;
4920 /* Make a new (sorted) rename list. */
4922 while (i
< ISOCBINDING_NUMBER
&& kinds_used
[i
] == NULL
)
4925 if (i
< ISOCBINDING_NUMBER
)
4927 tmp_list
= kinds_used
[i
];
4931 for (; i
< ISOCBINDING_NUMBER
; i
++)
4932 if (kinds_used
[i
] != NULL
)
4934 curr
->next
= kinds_used
[i
];
4940 gfc_rename_list
= tmp_list
;
4944 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
4945 the current namespace for all named constants, pointer types, and
4946 procedures in the module unless the only clause was used or a rename
4947 list was provided. */
4950 import_iso_c_binding_module (void)
4952 gfc_symbol
*mod_sym
= NULL
;
4953 gfc_symtree
*mod_symtree
= NULL
;
4954 const char *iso_c_module_name
= "__iso_c_binding";
4959 /* Look only in the current namespace. */
4960 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, iso_c_module_name
);
4962 if (mod_symtree
== NULL
)
4964 /* symtree doesn't already exist in current namespace. */
4965 gfc_get_sym_tree (iso_c_module_name
, gfc_current_ns
, &mod_symtree
);
4967 if (mod_symtree
!= NULL
)
4968 mod_sym
= mod_symtree
->n
.sym
;
4970 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
4971 "create symbol for %s", iso_c_module_name
);
4973 mod_sym
->attr
.flavor
= FL_MODULE
;
4974 mod_sym
->attr
.intrinsic
= 1;
4975 mod_sym
->module
= gfc_get_string (iso_c_module_name
);
4976 mod_sym
->from_intmod
= INTMOD_ISO_C_BINDING
;
4979 /* Generate the symbols for the named constants representing
4980 the kinds for intrinsic data types. */
4983 /* Sort the rename list because there are dependencies between types
4984 and procedures (e.g., c_loc needs c_ptr). */
4985 sort_iso_c_rename_list ();
4987 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4989 i
= get_c_kind (u
->use_name
, c_interop_kinds_table
);
4991 if (i
== ISOCBINDING_INVALID
|| i
== ISOCBINDING_LAST
)
4993 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4994 "intrinsic module ISO_C_BINDING.", u
->use_name
,
4999 generate_isocbinding_symbol (iso_c_module_name
,
5000 (iso_c_binding_symbol
) i
,
5006 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
5009 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5011 if (strcmp (c_interop_kinds_table
[i
].name
, u
->use_name
) == 0)
5013 local_name
= u
->local_name
;
5018 generate_isocbinding_symbol (iso_c_module_name
,
5019 (iso_c_binding_symbol
) i
,
5023 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5028 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5029 "module ISO_C_BINDING", u
->use_name
, &u
->where
);
5035 /* Add an integer named constant from a given module. */
5038 create_int_parameter (const char *name
, int value
, const char *modname
,
5039 intmod_id module
, int id
)
5041 gfc_symtree
*tmp_symtree
;
5044 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
5045 if (tmp_symtree
!= NULL
)
5047 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
5050 gfc_error ("Symbol '%s' already declared", name
);
5053 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
);
5054 sym
= tmp_symtree
->n
.sym
;
5056 sym
->module
= gfc_get_string (modname
);
5057 sym
->attr
.flavor
= FL_PARAMETER
;
5058 sym
->ts
.type
= BT_INTEGER
;
5059 sym
->ts
.kind
= gfc_default_integer_kind
;
5060 sym
->value
= gfc_int_expr (value
);
5061 sym
->attr
.use_assoc
= 1;
5062 sym
->from_intmod
= module
;
5063 sym
->intmod_sym_id
= id
;
5067 /* USE the ISO_FORTRAN_ENV intrinsic module. */
5070 use_iso_fortran_env_module (void)
5072 static char mod
[] = "iso_fortran_env";
5073 const char *local_name
;
5075 gfc_symbol
*mod_sym
;
5076 gfc_symtree
*mod_symtree
;
5079 intmod_sym symbol
[] = {
5080 #define NAMED_INTCST(a,b,c,d) { a, b, 0, d },
5081 #include "iso-fortran-env.def"
5083 { ISOFORTRANENV_INVALID
, NULL
, -1234, 0 } };
5086 #define NAMED_INTCST(a,b,c,d) symbol[i++].value = c;
5087 #include "iso-fortran-env.def"
5090 /* Generate the symbol for the module itself. */
5091 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, mod
);
5092 if (mod_symtree
== NULL
)
5094 gfc_get_sym_tree (mod
, gfc_current_ns
, &mod_symtree
);
5095 gcc_assert (mod_symtree
);
5096 mod_sym
= mod_symtree
->n
.sym
;
5098 mod_sym
->attr
.flavor
= FL_MODULE
;
5099 mod_sym
->attr
.intrinsic
= 1;
5100 mod_sym
->module
= gfc_get_string (mod
);
5101 mod_sym
->from_intmod
= INTMOD_ISO_FORTRAN_ENV
;
5104 if (!mod_symtree
->n
.sym
->attr
.intrinsic
)
5105 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
5106 "non-intrinsic module name used previously", mod
);
5108 /* Generate the symbols for the module integer named constants. */
5110 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5112 for (i
= 0; symbol
[i
].name
; i
++)
5113 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
5116 if (symbol
[i
].name
== NULL
)
5118 gfc_error ("Symbol '%s' referenced at %L does not exist in "
5119 "intrinsic module ISO_FORTRAN_ENV", u
->use_name
,
5124 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5125 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5126 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5127 "from intrinsic module ISO_FORTRAN_ENV at %L is "
5128 "incompatible with option %s", &u
->where
,
5129 gfc_option
.flag_default_integer
5130 ? "-fdefault-integer-8" : "-fdefault-real-8");
5132 create_int_parameter (u
->local_name
[0] ? u
->local_name
5134 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
5139 for (i
= 0; symbol
[i
].name
; i
++)
5142 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5144 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
5146 local_name
= u
->local_name
;
5152 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5153 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5154 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5155 "from intrinsic module ISO_FORTRAN_ENV at %C is "
5156 "incompatible with option %s",
5157 gfc_option
.flag_default_integer
5158 ? "-fdefault-integer-8" : "-fdefault-real-8");
5160 create_int_parameter (local_name
? local_name
: symbol
[i
].name
,
5161 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
5165 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5170 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5171 "module ISO_FORTRAN_ENV", u
->use_name
, &u
->where
);
5177 /* Process a USE directive. */
5180 gfc_use_module (void)
5185 gfc_symtree
*mod_symtree
;
5186 gfc_use_list
*use_stmt
;
5188 filename
= (char *) alloca (strlen (module_name
) + strlen (MODULE_EXTENSION
)
5190 strcpy (filename
, module_name
);
5191 strcat (filename
, MODULE_EXTENSION
);
5193 /* First, try to find an non-intrinsic module, unless the USE statement
5194 specified that the module is intrinsic. */
5197 module_fp
= gfc_open_included_file (filename
, true, true);
5199 /* Then, see if it's an intrinsic one, unless the USE statement
5200 specified that the module is non-intrinsic. */
5201 if (module_fp
== NULL
&& !specified_nonint
)
5203 if (strcmp (module_name
, "iso_fortran_env") == 0
5204 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: ISO_FORTRAN_ENV "
5205 "intrinsic module at %C") != FAILURE
)
5207 use_iso_fortran_env_module ();
5211 if (strcmp (module_name
, "iso_c_binding") == 0
5212 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
5213 "ISO_C_BINDING module at %C") != FAILURE
)
5215 import_iso_c_binding_module();
5219 module_fp
= gfc_open_intrinsic_module (filename
);
5221 if (module_fp
== NULL
&& specified_int
)
5222 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
5226 if (module_fp
== NULL
)
5227 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
5228 filename
, strerror (errno
));
5230 /* Check that we haven't already USEd an intrinsic module with the
5233 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, module_name
);
5234 if (mod_symtree
&& mod_symtree
->n
.sym
->attr
.intrinsic
)
5235 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
5236 "intrinsic module name used previously", module_name
);
5243 /* Skip the first two lines of the module, after checking that this is
5244 a gfortran module file. */
5250 bad_module ("Unexpected end of module");
5253 if ((start
== 1 && strcmp (atom_name
, "GFORTRAN") != 0)
5254 || (start
== 2 && strcmp (atom_name
, " module") != 0))
5255 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
5259 if (strcmp (atom_name
, " version") != 0
5260 || module_char () != ' '
5261 || parse_atom () != ATOM_STRING
)
5262 gfc_fatal_error ("Parse error when checking module version"
5263 " for file '%s' opened at %C", filename
);
5265 if (strcmp (atom_string
, MOD_VERSION
))
5267 gfc_fatal_error ("Wrong module version '%s' (expected '"
5268 MOD_VERSION
"') for file '%s' opened"
5269 " at %C", atom_string
, filename
);
5277 /* Make sure we're not reading the same module that we may be building. */
5278 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
5279 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
5280 gfc_fatal_error ("Can't USE the same module we're building!");
5283 init_true_name_tree ();
5287 free_true_name (true_name_root
);
5288 true_name_root
= NULL
;
5290 free_pi_tree (pi_root
);
5295 use_stmt
= gfc_get_use_list ();
5296 use_stmt
->module_name
= gfc_get_string (module_name
);
5297 use_stmt
->only_flag
= only_flag
;
5298 use_stmt
->rename
= gfc_rename_list
;
5299 use_stmt
->where
= use_locus
;
5300 gfc_rename_list
= NULL
;
5301 use_stmt
->next
= gfc_current_ns
->use_stmts
;
5302 gfc_current_ns
->use_stmts
= use_stmt
;
5307 gfc_free_use_stmts (gfc_use_list
*use_stmts
)
5310 for (; use_stmts
; use_stmts
= next
)
5312 gfc_use_rename
*next_rename
;
5314 for (; use_stmts
->rename
; use_stmts
->rename
= next_rename
)
5316 next_rename
= use_stmts
->rename
->next
;
5317 gfc_free (use_stmts
->rename
);
5319 next
= use_stmts
->next
;
5320 gfc_free (use_stmts
);
5326 gfc_module_init_2 (void)
5328 last_atom
= ATOM_LPAREN
;
5333 gfc_module_done_2 (void)