1 /* Handle modules, which amounts to loading and saving symbols and
2 their attendant structures.
3 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
5 Contributed by Andy Vaught
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* The syntax of gfortran modules resembles that of lisp lists, i.e. a
24 sequence of atoms, which can be left or right parenthesis, names,
25 integers or strings. Parenthesis are always matched which allows
26 us to skip over sections at high speed without having to know
27 anything about the internal structure of the lists. A "name" is
28 usually a fortran 95 identifier, but can also start with '@' in
29 order to reference a hidden symbol.
31 The first line of a module is an informational message about what
32 created the module, the file it came from and when it was created.
33 The second line is a warning for people not to edit the module.
34 The rest of the module looks like:
36 ( ( <Interface info for UPLUS> )
37 ( <Interface info for UMINUS> )
40 ( ( <name of operator interface> <module of op interface> <i/f1> ... )
43 ( ( <name of generic interface> <module of generic interface> <i/f1> ... )
46 ( ( <common name> <symbol> <saved flag>)
52 ( <Symbol Number (in no particular order)>
54 <Module name of symbol>
55 ( <symbol information> )
64 In general, symbols refer to other symbols by their symbol number,
65 which are zero based. Symbols are written to the module in no
73 #include "parse.h" /* FIXME */
76 #define MODULE_EXTENSION ".mod"
79 /* Structure that describes a position within a module file. */
88 /* Structure for list of symbols of intrinsic modules. */
101 P_UNKNOWN
= 0, P_OTHER
, P_NAMESPACE
, P_COMPONENT
, P_SYMBOL
105 /* The fixup structure lists pointers to pointers that have to
106 be updated when a pointer value becomes known. */
108 typedef struct fixup_t
111 struct fixup_t
*next
;
116 /* Structure for holding extra info needed for pointers being read. */
118 typedef struct pointer_info
120 BBT_HEADER (pointer_info
);
124 /* The first component of each member of the union is the pointer
131 void *pointer
; /* Member for doing pointer searches. */
136 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
138 { UNUSED
, NEEDED
, USED
}
140 int ns
, referenced
, renamed
;
143 gfc_symtree
*symtree
;
144 char binding_label
[GFC_MAX_SYMBOL_LEN
+ 1];
152 { UNREFERENCED
= 0, NEEDS_WRITE
, WRITTEN
}
162 #define gfc_get_pointer_info() XCNEW (pointer_info)
165 /* Lists of rename info for the USE statement. */
167 typedef struct gfc_use_rename
169 char local_name
[GFC_MAX_SYMBOL_LEN
+ 1], use_name
[GFC_MAX_SYMBOL_LEN
+ 1];
170 struct gfc_use_rename
*next
;
177 #define gfc_get_use_rename() XCNEW (gfc_use_rename);
179 /* Local variables */
181 /* The FILE for the module we're reading or writing. */
182 static FILE *module_fp
;
184 /* MD5 context structure. */
185 static struct md5_ctx ctx
;
187 /* The name of the module we're reading (USE'ing) or writing. */
188 static char module_name
[GFC_MAX_SYMBOL_LEN
+ 1];
190 /* The way the module we're reading was specified. */
191 static bool specified_nonint
, specified_int
;
193 static int module_line
, module_column
, only_flag
;
195 { IO_INPUT
, IO_OUTPUT
}
198 static gfc_use_rename
*gfc_rename_list
;
199 static pointer_info
*pi_root
;
200 static int symbol_number
; /* Counter for assigning symbol numbers */
202 /* Tells mio_expr_ref to make symbols for unused equivalence members. */
203 static bool in_load_equiv
;
207 /*****************************************************************/
209 /* Pointer/integer conversion. Pointers between structures are stored
210 as integers in the module file. The next couple of subroutines
211 handle this translation for reading and writing. */
213 /* Recursively free the tree of pointer structures. */
216 free_pi_tree (pointer_info
*p
)
221 if (p
->fixup
!= NULL
)
222 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
224 free_pi_tree (p
->left
);
225 free_pi_tree (p
->right
);
231 /* Compare pointers when searching by pointer. Used when writing a
235 compare_pointers (void *_sn1
, void *_sn2
)
237 pointer_info
*sn1
, *sn2
;
239 sn1
= (pointer_info
*) _sn1
;
240 sn2
= (pointer_info
*) _sn2
;
242 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
244 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
251 /* Compare integers when searching by integer. Used when reading a
255 compare_integers (void *_sn1
, void *_sn2
)
257 pointer_info
*sn1
, *sn2
;
259 sn1
= (pointer_info
*) _sn1
;
260 sn2
= (pointer_info
*) _sn2
;
262 if (sn1
->integer
< sn2
->integer
)
264 if (sn1
->integer
> sn2
->integer
)
271 /* Initialize the pointer_info tree. */
280 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
282 /* Pointer 0 is the NULL pointer. */
283 p
= gfc_get_pointer_info ();
288 gfc_insert_bbt (&pi_root
, p
, compare
);
290 /* Pointer 1 is the current namespace. */
291 p
= gfc_get_pointer_info ();
292 p
->u
.pointer
= gfc_current_ns
;
294 p
->type
= P_NAMESPACE
;
296 gfc_insert_bbt (&pi_root
, p
, compare
);
302 /* During module writing, call here with a pointer to something,
303 returning the pointer_info node. */
305 static pointer_info
*
306 find_pointer (void *gp
)
313 if (p
->u
.pointer
== gp
)
315 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
322 /* Given a pointer while writing, returns the pointer_info tree node,
323 creating it if it doesn't exist. */
325 static pointer_info
*
326 get_pointer (void *gp
)
330 p
= find_pointer (gp
);
334 /* Pointer doesn't have an integer. Give it one. */
335 p
= gfc_get_pointer_info ();
338 p
->integer
= symbol_number
++;
340 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
346 /* Given an integer during reading, find it in the pointer_info tree,
347 creating the node if not found. */
349 static pointer_info
*
350 get_integer (int integer
)
360 c
= compare_integers (&t
, p
);
364 p
= (c
< 0) ? p
->left
: p
->right
;
370 p
= gfc_get_pointer_info ();
371 p
->integer
= integer
;
374 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
380 /* Recursive function to find a pointer within a tree by brute force. */
382 static pointer_info
*
383 fp2 (pointer_info
*p
, const void *target
)
390 if (p
->u
.pointer
== target
)
393 q
= fp2 (p
->left
, target
);
397 return fp2 (p
->right
, target
);
401 /* During reading, find a pointer_info node from the pointer value.
402 This amounts to a brute-force search. */
404 static pointer_info
*
405 find_pointer2 (void *p
)
407 return fp2 (pi_root
, p
);
411 /* Resolve any fixups using a known pointer. */
414 resolve_fixups (fixup_t
*f
, void *gp
)
427 /* Call here during module reading when we know what pointer to
428 associate with an integer. Any fixups that exist are resolved at
432 associate_integer_pointer (pointer_info
*p
, void *gp
)
434 if (p
->u
.pointer
!= NULL
)
435 gfc_internal_error ("associate_integer_pointer(): Already associated");
439 resolve_fixups (p
->fixup
, gp
);
445 /* During module reading, given an integer and a pointer to a pointer,
446 either store the pointer from an already-known value or create a
447 fixup structure in order to store things later. Returns zero if
448 the reference has been actually stored, or nonzero if the reference
449 must be fixed later (i.e., associate_integer_pointer must be called
450 sometime later. Returns the pointer_info structure. */
452 static pointer_info
*
453 add_fixup (int integer
, void *gp
)
459 p
= get_integer (integer
);
461 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
464 *cp
= (char *) p
->u
.pointer
;
473 f
->pointer
= (void **) gp
;
480 /*****************************************************************/
482 /* Parser related subroutines */
484 /* Free the rename list left behind by a USE statement. */
489 gfc_use_rename
*next
;
491 for (; gfc_rename_list
; gfc_rename_list
= next
)
493 next
= gfc_rename_list
->next
;
494 gfc_free (gfc_rename_list
);
499 /* Match a USE statement. */
504 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module_nature
[GFC_MAX_SYMBOL_LEN
+ 1];
505 gfc_use_rename
*tail
= NULL
, *new_use
;
506 interface_type type
, type2
;
510 specified_int
= false;
511 specified_nonint
= false;
513 if (gfc_match (" , ") == MATCH_YES
)
515 if ((m
= gfc_match (" %n ::", module_nature
)) == MATCH_YES
)
517 if (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: module "
518 "nature in USE statement at %C") == FAILURE
)
521 if (strcmp (module_nature
, "intrinsic") == 0)
522 specified_int
= true;
525 if (strcmp (module_nature
, "non_intrinsic") == 0)
526 specified_nonint
= true;
529 gfc_error ("Module nature in USE statement at %C shall "
530 "be either INTRINSIC or NON_INTRINSIC");
537 /* Help output a better error message than "Unclassifiable
539 gfc_match (" %n", module_nature
);
540 if (strcmp (module_nature
, "intrinsic") == 0
541 || strcmp (module_nature
, "non_intrinsic") == 0)
542 gfc_error ("\"::\" was expected after module nature at %C "
543 "but was not found");
549 m
= gfc_match (" ::");
550 if (m
== MATCH_YES
&&
551 gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
552 "\"USE :: module\" at %C") == FAILURE
)
557 m
= gfc_match ("% ");
563 m
= gfc_match_name (module_name
);
570 if (gfc_match_eos () == MATCH_YES
)
572 if (gfc_match_char (',') != MATCH_YES
)
575 if (gfc_match (" only :") == MATCH_YES
)
578 if (gfc_match_eos () == MATCH_YES
)
583 /* Get a new rename struct and add it to the rename list. */
584 new_use
= gfc_get_use_rename ();
585 new_use
->where
= gfc_current_locus
;
588 if (gfc_rename_list
== NULL
)
589 gfc_rename_list
= new_use
;
591 tail
->next
= new_use
;
594 /* See what kind of interface we're dealing with. Assume it is
596 new_use
->op
= INTRINSIC_NONE
;
597 if (gfc_match_generic_spec (&type
, name
, &op
) == MATCH_ERROR
)
602 case INTERFACE_NAMELESS
:
603 gfc_error ("Missing generic specification in USE statement at %C");
606 case INTERFACE_USER_OP
:
607 case INTERFACE_GENERIC
:
608 m
= gfc_match (" =>");
610 if (type
== INTERFACE_USER_OP
&& m
== MATCH_YES
611 && (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: Renaming "
612 "operators in USE statements at %C")
616 if (type
== INTERFACE_USER_OP
)
617 new_use
->op
= INTRINSIC_USER
;
622 strcpy (new_use
->use_name
, name
);
625 strcpy (new_use
->local_name
, name
);
626 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
631 if (m
== MATCH_ERROR
)
639 strcpy (new_use
->local_name
, name
);
641 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
646 if (m
== MATCH_ERROR
)
650 if (strcmp (new_use
->use_name
, module_name
) == 0
651 || strcmp (new_use
->local_name
, module_name
) == 0)
653 gfc_error ("The name '%s' at %C has already been used as "
654 "an external module name.", module_name
);
659 case INTERFACE_INTRINSIC_OP
:
667 if (gfc_match_eos () == MATCH_YES
)
669 if (gfc_match_char (',') != MATCH_YES
)
676 gfc_syntax_error (ST_USE
);
684 /* Given a name and a number, inst, return the inst name
685 under which to load this symbol. Returns NULL if this
686 symbol shouldn't be loaded. If inst is zero, returns
687 the number of instances of this name. If interface is
688 true, a user-defined operator is sought, otherwise only
689 non-operators are sought. */
692 find_use_name_n (const char *name
, int *inst
, bool interface
)
698 for (u
= gfc_rename_list
; u
; u
= u
->next
)
700 if (strcmp (u
->use_name
, name
) != 0
701 || (u
->op
== INTRINSIC_USER
&& !interface
)
702 || (u
->op
!= INTRINSIC_USER
&& interface
))
715 return only_flag
? NULL
: name
;
719 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
723 /* Given a name, return the name under which to load this symbol.
724 Returns NULL if this symbol shouldn't be loaded. */
727 find_use_name (const char *name
, bool interface
)
730 return find_use_name_n (name
, &i
, interface
);
734 /* Given a real name, return the number of use names associated with it. */
737 number_use_names (const char *name
, bool interface
)
741 c
= find_use_name_n (name
, &i
, interface
);
746 /* Try to find the operator in the current list. */
748 static gfc_use_rename
*
749 find_use_operator (gfc_intrinsic_op op
)
753 for (u
= gfc_rename_list
; u
; u
= u
->next
)
761 /*****************************************************************/
763 /* The next couple of subroutines maintain a tree used to avoid a
764 brute-force search for a combination of true name and module name.
765 While symtree names, the name that a particular symbol is known by
766 can changed with USE statements, we still have to keep track of the
767 true names to generate the correct reference, and also avoid
768 loading the same real symbol twice in a program unit.
770 When we start reading, the true name tree is built and maintained
771 as symbols are read. The tree is searched as we load new symbols
772 to see if it already exists someplace in the namespace. */
774 typedef struct true_name
776 BBT_HEADER (true_name
);
781 static true_name
*true_name_root
;
784 /* Compare two true_name structures. */
787 compare_true_names (void *_t1
, void *_t2
)
792 t1
= (true_name
*) _t1
;
793 t2
= (true_name
*) _t2
;
795 c
= ((t1
->sym
->module
> t2
->sym
->module
)
796 - (t1
->sym
->module
< t2
->sym
->module
));
800 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
804 /* Given a true name, search the true name tree to see if it exists
805 within the main namespace. */
808 find_true_name (const char *name
, const char *module
)
814 sym
.name
= gfc_get_string (name
);
816 sym
.module
= gfc_get_string (module
);
824 c
= compare_true_names ((void *) (&t
), (void *) p
);
828 p
= (c
< 0) ? p
->left
: p
->right
;
835 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
838 add_true_name (gfc_symbol
*sym
)
842 t
= XCNEW (true_name
);
845 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
849 /* Recursive function to build the initial true name tree by
850 recursively traversing the current namespace. */
853 build_tnt (gfc_symtree
*st
)
858 build_tnt (st
->left
);
859 build_tnt (st
->right
);
861 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
864 add_true_name (st
->n
.sym
);
868 /* Initialize the true name tree with the current namespace. */
871 init_true_name_tree (void)
873 true_name_root
= NULL
;
874 build_tnt (gfc_current_ns
->sym_root
);
878 /* Recursively free a true name tree node. */
881 free_true_name (true_name
*t
)
885 free_true_name (t
->left
);
886 free_true_name (t
->right
);
892 /*****************************************************************/
894 /* Module reading and writing. */
898 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
902 static atom_type last_atom
;
905 /* The name buffer must be at least as long as a symbol name. Right
906 now it's not clear how we're going to store numeric constants--
907 probably as a hexadecimal string, since this will allow the exact
908 number to be preserved (this can't be done by a decimal
909 representation). Worry about that later. TODO! */
911 #define MAX_ATOM_SIZE 100
914 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
917 /* Report problems with a module. Error reporting is not very
918 elaborate, since this sorts of errors shouldn't really happen.
919 This subroutine never returns. */
921 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
924 bad_module (const char *msgid
)
931 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
932 module_name
, module_line
, module_column
, msgid
);
935 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
936 module_name
, module_line
, module_column
, msgid
);
939 gfc_fatal_error ("Module %s at line %d column %d: %s",
940 module_name
, module_line
, module_column
, msgid
);
946 /* Set the module's input pointer. */
949 set_module_locus (module_locus
*m
)
951 module_column
= m
->column
;
952 module_line
= m
->line
;
953 fsetpos (module_fp
, &m
->pos
);
957 /* Get the module's input pointer so that we can restore it later. */
960 get_module_locus (module_locus
*m
)
962 m
->column
= module_column
;
963 m
->line
= module_line
;
964 fgetpos (module_fp
, &m
->pos
);
968 /* Get the next character in the module, updating our reckoning of
976 c
= getc (module_fp
);
979 bad_module ("Unexpected EOF");
992 /* Parse a string constant. The delimiter is guaranteed to be a
1002 get_module_locus (&start
);
1006 /* See how long the string is. */
1011 bad_module ("Unexpected end of module in string constant");
1029 set_module_locus (&start
);
1031 atom_string
= p
= XCNEWVEC (char, len
+ 1);
1033 for (; len
> 0; len
--)
1037 module_char (); /* Guaranteed to be another \'. */
1041 module_char (); /* Terminating \'. */
1042 *p
= '\0'; /* C-style string for debug purposes. */
1046 /* Parse a small integer. */
1049 parse_integer (int c
)
1057 get_module_locus (&m
);
1063 atom_int
= 10 * atom_int
+ c
- '0';
1064 if (atom_int
> 99999999)
1065 bad_module ("Integer overflow");
1068 set_module_locus (&m
);
1086 get_module_locus (&m
);
1091 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
1095 if (++len
> GFC_MAX_SYMBOL_LEN
)
1096 bad_module ("Name too long");
1101 fseek (module_fp
, -1, SEEK_CUR
);
1102 module_column
= m
.column
+ len
- 1;
1109 /* Read the next atom in the module's input stream. */
1120 while (c
== ' ' || c
== '\r' || c
== '\n');
1145 return ATOM_INTEGER
;
1203 bad_module ("Bad name");
1210 /* Peek at the next atom on the input. */
1218 get_module_locus (&m
);
1221 if (a
== ATOM_STRING
)
1222 gfc_free (atom_string
);
1224 set_module_locus (&m
);
1229 /* Read the next atom from the input, requiring that it be a
1233 require_atom (atom_type type
)
1239 get_module_locus (&m
);
1247 p
= _("Expected name");
1250 p
= _("Expected left parenthesis");
1253 p
= _("Expected right parenthesis");
1256 p
= _("Expected integer");
1259 p
= _("Expected string");
1262 gfc_internal_error ("require_atom(): bad atom type required");
1265 set_module_locus (&m
);
1271 /* Given a pointer to an mstring array, require that the current input
1272 be one of the strings in the array. We return the enum value. */
1275 find_enum (const mstring
*m
)
1279 i
= gfc_string2code (m
, atom_name
);
1283 bad_module ("find_enum(): Enum not found");
1289 /**************** Module output subroutines ***************************/
1291 /* Output a character to a module file. */
1294 write_char (char out
)
1296 if (putc (out
, module_fp
) == EOF
)
1297 gfc_fatal_error ("Error writing modules file: %s", strerror (errno
));
1299 /* Add this to our MD5. */
1300 md5_process_bytes (&out
, sizeof (out
), &ctx
);
1312 /* Write an atom to a module. The line wrapping isn't perfect, but it
1313 should work most of the time. This isn't that big of a deal, since
1314 the file really isn't meant to be read by people anyway. */
1317 write_atom (atom_type atom
, const void *v
)
1327 p
= (const char *) v
;
1339 i
= *((const int *) v
);
1341 gfc_internal_error ("write_atom(): Writing negative integer");
1343 sprintf (buffer
, "%d", i
);
1348 gfc_internal_error ("write_atom(): Trying to write dab atom");
1352 if(p
== NULL
|| *p
== '\0')
1357 if (atom
!= ATOM_RPAREN
)
1359 if (module_column
+ len
> 72)
1364 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1369 if (atom
== ATOM_STRING
)
1372 while (p
!= NULL
&& *p
)
1374 if (atom
== ATOM_STRING
&& *p
== '\'')
1379 if (atom
== ATOM_STRING
)
1387 /***************** Mid-level I/O subroutines *****************/
1389 /* These subroutines let their caller read or write atoms without
1390 caring about which of the two is actually happening. This lets a
1391 subroutine concentrate on the actual format of the data being
1394 static void mio_expr (gfc_expr
**);
1395 pointer_info
*mio_symbol_ref (gfc_symbol
**);
1396 pointer_info
*mio_interface_rest (gfc_interface
**);
1397 static void mio_symtree_ref (gfc_symtree
**);
1399 /* Read or write an enumerated value. On writing, we return the input
1400 value for the convenience of callers. We avoid using an integer
1401 pointer because enums are sometimes inside bitfields. */
1404 mio_name (int t
, const mstring
*m
)
1406 if (iomode
== IO_OUTPUT
)
1407 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1410 require_atom (ATOM_NAME
);
1417 /* Specialization of mio_name. */
1419 #define DECL_MIO_NAME(TYPE) \
1420 static inline TYPE \
1421 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1423 return (TYPE) mio_name ((int) t, m); \
1425 #define MIO_NAME(TYPE) mio_name_##TYPE
1430 if (iomode
== IO_OUTPUT
)
1431 write_atom (ATOM_LPAREN
, NULL
);
1433 require_atom (ATOM_LPAREN
);
1440 if (iomode
== IO_OUTPUT
)
1441 write_atom (ATOM_RPAREN
, NULL
);
1443 require_atom (ATOM_RPAREN
);
1448 mio_integer (int *ip
)
1450 if (iomode
== IO_OUTPUT
)
1451 write_atom (ATOM_INTEGER
, ip
);
1454 require_atom (ATOM_INTEGER
);
1460 /* Read or write a character pointer that points to a string on the heap. */
1463 mio_allocated_string (const char *s
)
1465 if (iomode
== IO_OUTPUT
)
1467 write_atom (ATOM_STRING
, s
);
1472 require_atom (ATOM_STRING
);
1478 /* Functions for quoting and unquoting strings. */
1481 quote_string (const gfc_char_t
*s
, const size_t slength
)
1483 const gfc_char_t
*p
;
1487 /* Calculate the length we'll need: a backslash takes two ("\\"),
1488 non-printable characters take 10 ("\Uxxxxxxxx") and others take 1. */
1489 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1493 else if (!gfc_wide_is_printable (*p
))
1499 q
= res
= XCNEWVEC (char, len
+ 1);
1500 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1503 *q
++ = '\\', *q
++ = '\\';
1504 else if (!gfc_wide_is_printable (*p
))
1506 sprintf (q
, "\\U%08" HOST_WIDE_INT_PRINT
"x",
1507 (unsigned HOST_WIDE_INT
) *p
);
1511 *q
++ = (unsigned char) *p
;
1519 unquote_string (const char *s
)
1525 for (p
= s
, len
= 0; *p
; p
++, len
++)
1532 else if (p
[1] == 'U')
1533 p
+= 9; /* That is a "\U????????". */
1535 gfc_internal_error ("unquote_string(): got bad string");
1538 res
= gfc_get_wide_string (len
+ 1);
1539 for (i
= 0, p
= s
; i
< len
; i
++, p
++)
1544 res
[i
] = (unsigned char) *p
;
1545 else if (p
[1] == '\\')
1547 res
[i
] = (unsigned char) '\\';
1552 /* We read the 8-digits hexadecimal constant that follows. */
1557 gcc_assert (p
[1] == 'U');
1558 for (j
= 0; j
< 8; j
++)
1561 gcc_assert (sscanf (&p
[j
+2], "%01x", &n
) == 1);
1575 /* Read or write a character pointer that points to a wide string on the
1576 heap, performing quoting/unquoting of nonprintable characters using the
1577 form \U???????? (where each ? is a hexadecimal digit).
1578 Length is the length of the string, only known and used in output mode. */
1580 static const gfc_char_t
*
1581 mio_allocated_wide_string (const gfc_char_t
*s
, const size_t length
)
1583 if (iomode
== IO_OUTPUT
)
1585 char *quoted
= quote_string (s
, length
);
1586 write_atom (ATOM_STRING
, quoted
);
1592 gfc_char_t
*unquoted
;
1594 require_atom (ATOM_STRING
);
1595 unquoted
= unquote_string (atom_string
);
1596 gfc_free (atom_string
);
1602 /* Read or write a string that is in static memory. */
1605 mio_pool_string (const char **stringp
)
1607 /* TODO: one could write the string only once, and refer to it via a
1610 /* As a special case we have to deal with a NULL string. This
1611 happens for the 'module' member of 'gfc_symbol's that are not in a
1612 module. We read / write these as the empty string. */
1613 if (iomode
== IO_OUTPUT
)
1615 const char *p
= *stringp
== NULL
? "" : *stringp
;
1616 write_atom (ATOM_STRING
, p
);
1620 require_atom (ATOM_STRING
);
1621 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1622 gfc_free (atom_string
);
1627 /* Read or write a string that is inside of some already-allocated
1631 mio_internal_string (char *string
)
1633 if (iomode
== IO_OUTPUT
)
1634 write_atom (ATOM_STRING
, string
);
1637 require_atom (ATOM_STRING
);
1638 strcpy (string
, atom_string
);
1639 gfc_free (atom_string
);
1645 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1646 AB_POINTER
, AB_TARGET
, AB_DUMMY
, AB_RESULT
, AB_DATA
,
1647 AB_IN_NAMELIST
, AB_IN_COMMON
, AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
,
1648 AB_ELEMENTAL
, AB_PURE
, AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
,
1649 AB_CRAY_POINTER
, AB_CRAY_POINTEE
, AB_THREADPRIVATE
, AB_ALLOC_COMP
,
1650 AB_POINTER_COMP
, AB_PRIVATE_COMP
, AB_VALUE
, AB_VOLATILE
, AB_PROTECTED
,
1651 AB_IS_BIND_C
, AB_IS_C_INTEROP
, AB_IS_ISO_C
, AB_ABSTRACT
, AB_ZERO_COMP
,
1656 static const mstring attr_bits
[] =
1658 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1659 minit ("DIMENSION", AB_DIMENSION
),
1660 minit ("EXTERNAL", AB_EXTERNAL
),
1661 minit ("INTRINSIC", AB_INTRINSIC
),
1662 minit ("OPTIONAL", AB_OPTIONAL
),
1663 minit ("POINTER", AB_POINTER
),
1664 minit ("VOLATILE", AB_VOLATILE
),
1665 minit ("TARGET", AB_TARGET
),
1666 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1667 minit ("DUMMY", AB_DUMMY
),
1668 minit ("RESULT", AB_RESULT
),
1669 minit ("DATA", AB_DATA
),
1670 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1671 minit ("IN_COMMON", AB_IN_COMMON
),
1672 minit ("FUNCTION", AB_FUNCTION
),
1673 minit ("SUBROUTINE", AB_SUBROUTINE
),
1674 minit ("SEQUENCE", AB_SEQUENCE
),
1675 minit ("ELEMENTAL", AB_ELEMENTAL
),
1676 minit ("PURE", AB_PURE
),
1677 minit ("RECURSIVE", AB_RECURSIVE
),
1678 minit ("GENERIC", AB_GENERIC
),
1679 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1680 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1681 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1682 minit ("IS_BIND_C", AB_IS_BIND_C
),
1683 minit ("IS_C_INTEROP", AB_IS_C_INTEROP
),
1684 minit ("IS_ISO_C", AB_IS_ISO_C
),
1685 minit ("VALUE", AB_VALUE
),
1686 minit ("ALLOC_COMP", AB_ALLOC_COMP
),
1687 minit ("POINTER_COMP", AB_POINTER_COMP
),
1688 minit ("PRIVATE_COMP", AB_PRIVATE_COMP
),
1689 minit ("ZERO_COMP", AB_ZERO_COMP
),
1690 minit ("PROTECTED", AB_PROTECTED
),
1691 minit ("ABSTRACT", AB_ABSTRACT
),
1692 minit ("EXTENSION", AB_EXTENSION
),
1697 /* Specialization of mio_name. */
1698 DECL_MIO_NAME (ab_attribute
)
1699 DECL_MIO_NAME (ar_type
)
1700 DECL_MIO_NAME (array_type
)
1702 DECL_MIO_NAME (expr_t
)
1703 DECL_MIO_NAME (gfc_access
)
1704 DECL_MIO_NAME (gfc_intrinsic_op
)
1705 DECL_MIO_NAME (ifsrc
)
1706 DECL_MIO_NAME (save_state
)
1707 DECL_MIO_NAME (procedure_type
)
1708 DECL_MIO_NAME (ref_type
)
1709 DECL_MIO_NAME (sym_flavor
)
1710 DECL_MIO_NAME (sym_intent
)
1711 #undef DECL_MIO_NAME
1713 /* Symbol attributes are stored in list with the first three elements
1714 being the enumerated fields, while the remaining elements (if any)
1715 indicate the individual attribute bits. The access field is not
1716 saved-- it controls what symbols are exported when a module is
1720 mio_symbol_attribute (symbol_attribute
*attr
)
1726 attr
->flavor
= MIO_NAME (sym_flavor
) (attr
->flavor
, flavors
);
1727 attr
->intent
= MIO_NAME (sym_intent
) (attr
->intent
, intents
);
1728 attr
->proc
= MIO_NAME (procedure_type
) (attr
->proc
, procedures
);
1729 attr
->if_source
= MIO_NAME (ifsrc
) (attr
->if_source
, ifsrc_types
);
1730 attr
->save
= MIO_NAME (save_state
) (attr
->save
, save_status
);
1732 if (iomode
== IO_OUTPUT
)
1734 if (attr
->allocatable
)
1735 MIO_NAME (ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1736 if (attr
->dimension
)
1737 MIO_NAME (ab_attribute
) (AB_DIMENSION
, attr_bits
);
1739 MIO_NAME (ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1740 if (attr
->intrinsic
)
1741 MIO_NAME (ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1743 MIO_NAME (ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1745 MIO_NAME (ab_attribute
) (AB_POINTER
, attr_bits
);
1746 if (attr
->is_protected
)
1747 MIO_NAME (ab_attribute
) (AB_PROTECTED
, attr_bits
);
1749 MIO_NAME (ab_attribute
) (AB_VALUE
, attr_bits
);
1750 if (attr
->volatile_
)
1751 MIO_NAME (ab_attribute
) (AB_VOLATILE
, attr_bits
);
1753 MIO_NAME (ab_attribute
) (AB_TARGET
, attr_bits
);
1754 if (attr
->threadprivate
)
1755 MIO_NAME (ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1757 MIO_NAME (ab_attribute
) (AB_DUMMY
, attr_bits
);
1759 MIO_NAME (ab_attribute
) (AB_RESULT
, attr_bits
);
1760 /* We deliberately don't preserve the "entry" flag. */
1763 MIO_NAME (ab_attribute
) (AB_DATA
, attr_bits
);
1764 if (attr
->in_namelist
)
1765 MIO_NAME (ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1766 if (attr
->in_common
)
1767 MIO_NAME (ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1770 MIO_NAME (ab_attribute
) (AB_FUNCTION
, attr_bits
);
1771 if (attr
->subroutine
)
1772 MIO_NAME (ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1774 MIO_NAME (ab_attribute
) (AB_GENERIC
, attr_bits
);
1776 MIO_NAME (ab_attribute
) (AB_ABSTRACT
, attr_bits
);
1779 MIO_NAME (ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1780 if (attr
->elemental
)
1781 MIO_NAME (ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1783 MIO_NAME (ab_attribute
) (AB_PURE
, attr_bits
);
1784 if (attr
->recursive
)
1785 MIO_NAME (ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1786 if (attr
->always_explicit
)
1787 MIO_NAME (ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1788 if (attr
->cray_pointer
)
1789 MIO_NAME (ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1790 if (attr
->cray_pointee
)
1791 MIO_NAME (ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1792 if (attr
->is_bind_c
)
1793 MIO_NAME(ab_attribute
) (AB_IS_BIND_C
, attr_bits
);
1794 if (attr
->is_c_interop
)
1795 MIO_NAME(ab_attribute
) (AB_IS_C_INTEROP
, attr_bits
);
1797 MIO_NAME(ab_attribute
) (AB_IS_ISO_C
, attr_bits
);
1798 if (attr
->alloc_comp
)
1799 MIO_NAME (ab_attribute
) (AB_ALLOC_COMP
, attr_bits
);
1800 if (attr
->pointer_comp
)
1801 MIO_NAME (ab_attribute
) (AB_POINTER_COMP
, attr_bits
);
1802 if (attr
->private_comp
)
1803 MIO_NAME (ab_attribute
) (AB_PRIVATE_COMP
, attr_bits
);
1804 if (attr
->zero_comp
)
1805 MIO_NAME (ab_attribute
) (AB_ZERO_COMP
, attr_bits
);
1806 if (attr
->extension
)
1807 MIO_NAME (ab_attribute
) (AB_EXTENSION
, attr_bits
);
1817 if (t
== ATOM_RPAREN
)
1820 bad_module ("Expected attribute bit name");
1822 switch ((ab_attribute
) find_enum (attr_bits
))
1824 case AB_ALLOCATABLE
:
1825 attr
->allocatable
= 1;
1828 attr
->dimension
= 1;
1834 attr
->intrinsic
= 1;
1843 attr
->is_protected
= 1;
1849 attr
->volatile_
= 1;
1854 case AB_THREADPRIVATE
:
1855 attr
->threadprivate
= 1;
1866 case AB_IN_NAMELIST
:
1867 attr
->in_namelist
= 1;
1870 attr
->in_common
= 1;
1876 attr
->subroutine
= 1;
1888 attr
->elemental
= 1;
1894 attr
->recursive
= 1;
1896 case AB_ALWAYS_EXPLICIT
:
1897 attr
->always_explicit
= 1;
1899 case AB_CRAY_POINTER
:
1900 attr
->cray_pointer
= 1;
1902 case AB_CRAY_POINTEE
:
1903 attr
->cray_pointee
= 1;
1906 attr
->is_bind_c
= 1;
1908 case AB_IS_C_INTEROP
:
1909 attr
->is_c_interop
= 1;
1915 attr
->alloc_comp
= 1;
1917 case AB_POINTER_COMP
:
1918 attr
->pointer_comp
= 1;
1920 case AB_PRIVATE_COMP
:
1921 attr
->private_comp
= 1;
1924 attr
->zero_comp
= 1;
1927 attr
->extension
= 1;
1935 static const mstring bt_types
[] = {
1936 minit ("INTEGER", BT_INTEGER
),
1937 minit ("REAL", BT_REAL
),
1938 minit ("COMPLEX", BT_COMPLEX
),
1939 minit ("LOGICAL", BT_LOGICAL
),
1940 minit ("CHARACTER", BT_CHARACTER
),
1941 minit ("DERIVED", BT_DERIVED
),
1942 minit ("PROCEDURE", BT_PROCEDURE
),
1943 minit ("UNKNOWN", BT_UNKNOWN
),
1944 minit ("VOID", BT_VOID
),
1950 mio_charlen (gfc_charlen
**clp
)
1956 if (iomode
== IO_OUTPUT
)
1960 mio_expr (&cl
->length
);
1964 if (peek_atom () != ATOM_RPAREN
)
1966 cl
= gfc_get_charlen ();
1967 mio_expr (&cl
->length
);
1971 cl
->next
= gfc_current_ns
->cl_list
;
1972 gfc_current_ns
->cl_list
= cl
;
1980 /* See if a name is a generated name. */
1983 check_unique_name (const char *name
)
1985 return *name
== '@';
1990 mio_typespec (gfc_typespec
*ts
)
1994 ts
->type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
1996 if (ts
->type
!= BT_DERIVED
)
1997 mio_integer (&ts
->kind
);
1999 mio_symbol_ref (&ts
->derived
);
2001 /* Add info for C interop and is_iso_c. */
2002 mio_integer (&ts
->is_c_interop
);
2003 mio_integer (&ts
->is_iso_c
);
2005 /* If the typespec is for an identifier either from iso_c_binding, or
2006 a constant that was initialized to an identifier from it, use the
2007 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
2009 ts
->f90_type
= MIO_NAME (bt
) (ts
->f90_type
, bt_types
);
2011 ts
->f90_type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2013 if (ts
->type
!= BT_CHARACTER
)
2015 /* ts->cl is only valid for BT_CHARACTER. */
2020 mio_charlen (&ts
->cl
);
2026 static const mstring array_spec_types
[] = {
2027 minit ("EXPLICIT", AS_EXPLICIT
),
2028 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
2029 minit ("DEFERRED", AS_DEFERRED
),
2030 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
2036 mio_array_spec (gfc_array_spec
**asp
)
2043 if (iomode
== IO_OUTPUT
)
2051 if (peek_atom () == ATOM_RPAREN
)
2057 *asp
= as
= gfc_get_array_spec ();
2060 mio_integer (&as
->rank
);
2061 as
->type
= MIO_NAME (array_type
) (as
->type
, array_spec_types
);
2063 for (i
= 0; i
< as
->rank
; i
++)
2065 mio_expr (&as
->lower
[i
]);
2066 mio_expr (&as
->upper
[i
]);
2074 /* Given a pointer to an array reference structure (which lives in a
2075 gfc_ref structure), find the corresponding array specification
2076 structure. Storing the pointer in the ref structure doesn't quite
2077 work when loading from a module. Generating code for an array
2078 reference also needs more information than just the array spec. */
2080 static const mstring array_ref_types
[] = {
2081 minit ("FULL", AR_FULL
),
2082 minit ("ELEMENT", AR_ELEMENT
),
2083 minit ("SECTION", AR_SECTION
),
2089 mio_array_ref (gfc_array_ref
*ar
)
2094 ar
->type
= MIO_NAME (ar_type
) (ar
->type
, array_ref_types
);
2095 mio_integer (&ar
->dimen
);
2103 for (i
= 0; i
< ar
->dimen
; i
++)
2104 mio_expr (&ar
->start
[i
]);
2109 for (i
= 0; i
< ar
->dimen
; i
++)
2111 mio_expr (&ar
->start
[i
]);
2112 mio_expr (&ar
->end
[i
]);
2113 mio_expr (&ar
->stride
[i
]);
2119 gfc_internal_error ("mio_array_ref(): Unknown array ref");
2122 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
2123 we can't call mio_integer directly. Instead loop over each element
2124 and cast it to/from an integer. */
2125 if (iomode
== IO_OUTPUT
)
2127 for (i
= 0; i
< ar
->dimen
; i
++)
2129 int tmp
= (int)ar
->dimen_type
[i
];
2130 write_atom (ATOM_INTEGER
, &tmp
);
2135 for (i
= 0; i
< ar
->dimen
; i
++)
2137 require_atom (ATOM_INTEGER
);
2138 ar
->dimen_type
[i
] = atom_int
;
2142 if (iomode
== IO_INPUT
)
2144 ar
->where
= gfc_current_locus
;
2146 for (i
= 0; i
< ar
->dimen
; i
++)
2147 ar
->c_where
[i
] = gfc_current_locus
;
2154 /* Saves or restores a pointer. The pointer is converted back and
2155 forth from an integer. We return the pointer_info pointer so that
2156 the caller can take additional action based on the pointer type. */
2158 static pointer_info
*
2159 mio_pointer_ref (void *gp
)
2163 if (iomode
== IO_OUTPUT
)
2165 p
= get_pointer (*((char **) gp
));
2166 write_atom (ATOM_INTEGER
, &p
->integer
);
2170 require_atom (ATOM_INTEGER
);
2171 p
= add_fixup (atom_int
, gp
);
2178 /* Save and load references to components that occur within
2179 expressions. We have to describe these references by a number and
2180 by name. The number is necessary for forward references during
2181 reading, and the name is necessary if the symbol already exists in
2182 the namespace and is not loaded again. */
2185 mio_component_ref (gfc_component
**cp
, gfc_symbol
*sym
)
2187 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2191 p
= mio_pointer_ref (cp
);
2192 if (p
->type
== P_UNKNOWN
)
2193 p
->type
= P_COMPONENT
;
2195 if (iomode
== IO_OUTPUT
)
2196 mio_pool_string (&(*cp
)->name
);
2199 mio_internal_string (name
);
2201 /* It can happen that a component reference can be read before the
2202 associated derived type symbol has been loaded. Return now and
2203 wait for a later iteration of load_needed. */
2207 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
2209 /* Symbol already loaded, so search by name. */
2210 for (q
= sym
->components
; q
; q
= q
->next
)
2211 if (strcmp (q
->name
, name
) == 0)
2215 gfc_internal_error ("mio_component_ref(): Component not found");
2217 associate_integer_pointer (p
, q
);
2220 /* Make sure this symbol will eventually be loaded. */
2221 p
= find_pointer2 (sym
);
2222 if (p
->u
.rsym
.state
== UNUSED
)
2223 p
->u
.rsym
.state
= NEEDED
;
2229 mio_component (gfc_component
*c
)
2236 if (iomode
== IO_OUTPUT
)
2238 p
= get_pointer (c
);
2239 mio_integer (&p
->integer
);
2244 p
= get_integer (n
);
2245 associate_integer_pointer (p
, c
);
2248 if (p
->type
== P_UNKNOWN
)
2249 p
->type
= P_COMPONENT
;
2251 mio_pool_string (&c
->name
);
2252 mio_typespec (&c
->ts
);
2253 mio_array_spec (&c
->as
);
2255 mio_integer (&c
->dimension
);
2256 mio_integer (&c
->pointer
);
2257 mio_integer (&c
->allocatable
);
2258 c
->access
= MIO_NAME (gfc_access
) (c
->access
, access_types
);
2260 mio_expr (&c
->initializer
);
2266 mio_component_list (gfc_component
**cp
)
2268 gfc_component
*c
, *tail
;
2272 if (iomode
== IO_OUTPUT
)
2274 for (c
= *cp
; c
; c
= c
->next
)
2284 if (peek_atom () == ATOM_RPAREN
)
2287 c
= gfc_get_component ();
2304 mio_actual_arg (gfc_actual_arglist
*a
)
2307 mio_pool_string (&a
->name
);
2308 mio_expr (&a
->expr
);
2314 mio_actual_arglist (gfc_actual_arglist
**ap
)
2316 gfc_actual_arglist
*a
, *tail
;
2320 if (iomode
== IO_OUTPUT
)
2322 for (a
= *ap
; a
; a
= a
->next
)
2332 if (peek_atom () != ATOM_LPAREN
)
2335 a
= gfc_get_actual_arglist ();
2351 /* Read and write formal argument lists. */
2354 mio_formal_arglist (gfc_symbol
*sym
)
2356 gfc_formal_arglist
*f
, *tail
;
2360 if (iomode
== IO_OUTPUT
)
2362 for (f
= sym
->formal
; f
; f
= f
->next
)
2363 mio_symbol_ref (&f
->sym
);
2367 sym
->formal
= tail
= NULL
;
2369 while (peek_atom () != ATOM_RPAREN
)
2371 f
= gfc_get_formal_arglist ();
2372 mio_symbol_ref (&f
->sym
);
2374 if (sym
->formal
== NULL
)
2387 /* Save or restore a reference to a symbol node. */
2390 mio_symbol_ref (gfc_symbol
**symp
)
2394 p
= mio_pointer_ref (symp
);
2395 if (p
->type
== P_UNKNOWN
)
2398 if (iomode
== IO_OUTPUT
)
2400 if (p
->u
.wsym
.state
== UNREFERENCED
)
2401 p
->u
.wsym
.state
= NEEDS_WRITE
;
2405 if (p
->u
.rsym
.state
== UNUSED
)
2406 p
->u
.rsym
.state
= NEEDED
;
2412 /* Save or restore a reference to a symtree node. */
2415 mio_symtree_ref (gfc_symtree
**stp
)
2420 if (iomode
== IO_OUTPUT
)
2421 mio_symbol_ref (&(*stp
)->n
.sym
);
2424 require_atom (ATOM_INTEGER
);
2425 p
= get_integer (atom_int
);
2427 /* An unused equivalence member; make a symbol and a symtree
2429 if (in_load_equiv
&& p
->u
.rsym
.symtree
== NULL
)
2431 /* Since this is not used, it must have a unique name. */
2432 p
->u
.rsym
.symtree
= gfc_get_unique_symtree (gfc_current_ns
);
2434 /* Make the symbol. */
2435 if (p
->u
.rsym
.sym
== NULL
)
2437 p
->u
.rsym
.sym
= gfc_new_symbol (p
->u
.rsym
.true_name
,
2439 p
->u
.rsym
.sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
2442 p
->u
.rsym
.symtree
->n
.sym
= p
->u
.rsym
.sym
;
2443 p
->u
.rsym
.symtree
->n
.sym
->refs
++;
2444 p
->u
.rsym
.referenced
= 1;
2446 /* If the symbol is PRIVATE and in COMMON, load_commons will
2447 generate a fixup symbol, which must be associated. */
2449 resolve_fixups (p
->fixup
, p
->u
.rsym
.sym
);
2453 if (p
->type
== P_UNKNOWN
)
2456 if (p
->u
.rsym
.state
== UNUSED
)
2457 p
->u
.rsym
.state
= NEEDED
;
2459 if (p
->u
.rsym
.symtree
!= NULL
)
2461 *stp
= p
->u
.rsym
.symtree
;
2465 f
= XCNEW (fixup_t
);
2467 f
->next
= p
->u
.rsym
.stfixup
;
2468 p
->u
.rsym
.stfixup
= f
;
2470 f
->pointer
= (void **) stp
;
2477 mio_iterator (gfc_iterator
**ip
)
2483 if (iomode
== IO_OUTPUT
)
2490 if (peek_atom () == ATOM_RPAREN
)
2496 *ip
= gfc_get_iterator ();
2501 mio_expr (&iter
->var
);
2502 mio_expr (&iter
->start
);
2503 mio_expr (&iter
->end
);
2504 mio_expr (&iter
->step
);
2512 mio_constructor (gfc_constructor
**cp
)
2514 gfc_constructor
*c
, *tail
;
2518 if (iomode
== IO_OUTPUT
)
2520 for (c
= *cp
; c
; c
= c
->next
)
2523 mio_expr (&c
->expr
);
2524 mio_iterator (&c
->iterator
);
2533 while (peek_atom () != ATOM_RPAREN
)
2535 c
= gfc_get_constructor ();
2545 mio_expr (&c
->expr
);
2546 mio_iterator (&c
->iterator
);
2555 static const mstring ref_types
[] = {
2556 minit ("ARRAY", REF_ARRAY
),
2557 minit ("COMPONENT", REF_COMPONENT
),
2558 minit ("SUBSTRING", REF_SUBSTRING
),
2564 mio_ref (gfc_ref
**rp
)
2571 r
->type
= MIO_NAME (ref_type
) (r
->type
, ref_types
);
2576 mio_array_ref (&r
->u
.ar
);
2580 mio_symbol_ref (&r
->u
.c
.sym
);
2581 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2585 mio_expr (&r
->u
.ss
.start
);
2586 mio_expr (&r
->u
.ss
.end
);
2587 mio_charlen (&r
->u
.ss
.length
);
2596 mio_ref_list (gfc_ref
**rp
)
2598 gfc_ref
*ref
, *head
, *tail
;
2602 if (iomode
== IO_OUTPUT
)
2604 for (ref
= *rp
; ref
; ref
= ref
->next
)
2611 while (peek_atom () != ATOM_RPAREN
)
2614 head
= tail
= gfc_get_ref ();
2617 tail
->next
= gfc_get_ref ();
2631 /* Read and write an integer value. */
2634 mio_gmp_integer (mpz_t
*integer
)
2638 if (iomode
== IO_INPUT
)
2640 if (parse_atom () != ATOM_STRING
)
2641 bad_module ("Expected integer string");
2643 mpz_init (*integer
);
2644 if (mpz_set_str (*integer
, atom_string
, 10))
2645 bad_module ("Error converting integer");
2647 gfc_free (atom_string
);
2651 p
= mpz_get_str (NULL
, 10, *integer
);
2652 write_atom (ATOM_STRING
, p
);
2659 mio_gmp_real (mpfr_t
*real
)
2664 if (iomode
== IO_INPUT
)
2666 if (parse_atom () != ATOM_STRING
)
2667 bad_module ("Expected real string");
2670 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2671 gfc_free (atom_string
);
2675 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2677 if (mpfr_nan_p (*real
) || mpfr_inf_p (*real
))
2679 write_atom (ATOM_STRING
, p
);
2684 atom_string
= XCNEWVEC (char, strlen (p
) + 20);
2686 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2688 /* Fix negative numbers. */
2689 if (atom_string
[2] == '-')
2691 atom_string
[0] = '-';
2692 atom_string
[1] = '0';
2693 atom_string
[2] = '.';
2696 write_atom (ATOM_STRING
, atom_string
);
2698 gfc_free (atom_string
);
2704 /* Save and restore the shape of an array constructor. */
2707 mio_shape (mpz_t
**pshape
, int rank
)
2713 /* A NULL shape is represented by (). */
2716 if (iomode
== IO_OUTPUT
)
2728 if (t
== ATOM_RPAREN
)
2735 shape
= gfc_get_shape (rank
);
2739 for (n
= 0; n
< rank
; n
++)
2740 mio_gmp_integer (&shape
[n
]);
2746 static const mstring expr_types
[] = {
2747 minit ("OP", EXPR_OP
),
2748 minit ("FUNCTION", EXPR_FUNCTION
),
2749 minit ("CONSTANT", EXPR_CONSTANT
),
2750 minit ("VARIABLE", EXPR_VARIABLE
),
2751 minit ("SUBSTRING", EXPR_SUBSTRING
),
2752 minit ("STRUCTURE", EXPR_STRUCTURE
),
2753 minit ("ARRAY", EXPR_ARRAY
),
2754 minit ("NULL", EXPR_NULL
),
2758 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2759 generic operators, not in expressions. INTRINSIC_USER is also
2760 replaced by the correct function name by the time we see it. */
2762 static const mstring intrinsics
[] =
2764 minit ("UPLUS", INTRINSIC_UPLUS
),
2765 minit ("UMINUS", INTRINSIC_UMINUS
),
2766 minit ("PLUS", INTRINSIC_PLUS
),
2767 minit ("MINUS", INTRINSIC_MINUS
),
2768 minit ("TIMES", INTRINSIC_TIMES
),
2769 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2770 minit ("POWER", INTRINSIC_POWER
),
2771 minit ("CONCAT", INTRINSIC_CONCAT
),
2772 minit ("AND", INTRINSIC_AND
),
2773 minit ("OR", INTRINSIC_OR
),
2774 minit ("EQV", INTRINSIC_EQV
),
2775 minit ("NEQV", INTRINSIC_NEQV
),
2776 minit ("EQ_SIGN", INTRINSIC_EQ
),
2777 minit ("EQ", INTRINSIC_EQ_OS
),
2778 minit ("NE_SIGN", INTRINSIC_NE
),
2779 minit ("NE", INTRINSIC_NE_OS
),
2780 minit ("GT_SIGN", INTRINSIC_GT
),
2781 minit ("GT", INTRINSIC_GT_OS
),
2782 minit ("GE_SIGN", INTRINSIC_GE
),
2783 minit ("GE", INTRINSIC_GE_OS
),
2784 minit ("LT_SIGN", INTRINSIC_LT
),
2785 minit ("LT", INTRINSIC_LT_OS
),
2786 minit ("LE_SIGN", INTRINSIC_LE
),
2787 minit ("LE", INTRINSIC_LE_OS
),
2788 minit ("NOT", INTRINSIC_NOT
),
2789 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2794 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2797 fix_mio_expr (gfc_expr
*e
)
2799 gfc_symtree
*ns_st
= NULL
;
2802 if (iomode
!= IO_OUTPUT
)
2807 /* If this is a symtree for a symbol that came from a contained module
2808 namespace, it has a unique name and we should look in the current
2809 namespace to see if the required, non-contained symbol is available
2810 yet. If so, the latter should be written. */
2811 if (e
->symtree
->n
.sym
&& check_unique_name (e
->symtree
->name
))
2812 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2813 e
->symtree
->n
.sym
->name
);
2815 /* On the other hand, if the existing symbol is the module name or the
2816 new symbol is a dummy argument, do not do the promotion. */
2817 if (ns_st
&& ns_st
->n
.sym
2818 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2819 && !e
->symtree
->n
.sym
->attr
.dummy
)
2822 else if (e
->expr_type
== EXPR_FUNCTION
&& e
->value
.function
.name
)
2824 /* In some circumstances, a function used in an initialization
2825 expression, in one use associated module, can fail to be
2826 coupled to its symtree when used in a specification
2827 expression in another module. */
2828 fname
= e
->value
.function
.esym
? e
->value
.function
.esym
->name
2829 : e
->value
.function
.isym
->name
;
2830 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2835 /* Read and write expressions. The form "()" is allowed to indicate a
2839 mio_expr (gfc_expr
**ep
)
2847 if (iomode
== IO_OUTPUT
)
2856 MIO_NAME (expr_t
) (e
->expr_type
, expr_types
);
2861 if (t
== ATOM_RPAREN
)
2868 bad_module ("Expected expression type");
2870 e
= *ep
= gfc_get_expr ();
2871 e
->where
= gfc_current_locus
;
2872 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2875 mio_typespec (&e
->ts
);
2876 mio_integer (&e
->rank
);
2880 switch (e
->expr_type
)
2884 = MIO_NAME (gfc_intrinsic_op
) (e
->value
.op
.op
, intrinsics
);
2886 switch (e
->value
.op
.op
)
2888 case INTRINSIC_UPLUS
:
2889 case INTRINSIC_UMINUS
:
2891 case INTRINSIC_PARENTHESES
:
2892 mio_expr (&e
->value
.op
.op1
);
2895 case INTRINSIC_PLUS
:
2896 case INTRINSIC_MINUS
:
2897 case INTRINSIC_TIMES
:
2898 case INTRINSIC_DIVIDE
:
2899 case INTRINSIC_POWER
:
2900 case INTRINSIC_CONCAT
:
2904 case INTRINSIC_NEQV
:
2906 case INTRINSIC_EQ_OS
:
2908 case INTRINSIC_NE_OS
:
2910 case INTRINSIC_GT_OS
:
2912 case INTRINSIC_GE_OS
:
2914 case INTRINSIC_LT_OS
:
2916 case INTRINSIC_LE_OS
:
2917 mio_expr (&e
->value
.op
.op1
);
2918 mio_expr (&e
->value
.op
.op2
);
2922 bad_module ("Bad operator");
2928 mio_symtree_ref (&e
->symtree
);
2929 mio_actual_arglist (&e
->value
.function
.actual
);
2931 if (iomode
== IO_OUTPUT
)
2933 e
->value
.function
.name
2934 = mio_allocated_string (e
->value
.function
.name
);
2935 flag
= e
->value
.function
.esym
!= NULL
;
2936 mio_integer (&flag
);
2938 mio_symbol_ref (&e
->value
.function
.esym
);
2940 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
2944 require_atom (ATOM_STRING
);
2945 e
->value
.function
.name
= gfc_get_string (atom_string
);
2946 gfc_free (atom_string
);
2948 mio_integer (&flag
);
2950 mio_symbol_ref (&e
->value
.function
.esym
);
2953 require_atom (ATOM_STRING
);
2954 e
->value
.function
.isym
= gfc_find_function (atom_string
);
2955 gfc_free (atom_string
);
2962 mio_symtree_ref (&e
->symtree
);
2963 mio_ref_list (&e
->ref
);
2966 case EXPR_SUBSTRING
:
2967 e
->value
.character
.string
2968 = CONST_CAST (gfc_char_t
*,
2969 mio_allocated_wide_string (e
->value
.character
.string
,
2970 e
->value
.character
.length
));
2971 mio_ref_list (&e
->ref
);
2974 case EXPR_STRUCTURE
:
2976 mio_constructor (&e
->value
.constructor
);
2977 mio_shape (&e
->shape
, e
->rank
);
2984 mio_gmp_integer (&e
->value
.integer
);
2988 gfc_set_model_kind (e
->ts
.kind
);
2989 mio_gmp_real (&e
->value
.real
);
2993 gfc_set_model_kind (e
->ts
.kind
);
2994 mio_gmp_real (&e
->value
.complex.r
);
2995 mio_gmp_real (&e
->value
.complex.i
);
2999 mio_integer (&e
->value
.logical
);
3003 mio_integer (&e
->value
.character
.length
);
3004 e
->value
.character
.string
3005 = CONST_CAST (gfc_char_t
*,
3006 mio_allocated_wide_string (e
->value
.character
.string
,
3007 e
->value
.character
.length
));
3011 bad_module ("Bad type in constant expression");
3024 /* Read and write namelists. */
3027 mio_namelist (gfc_symbol
*sym
)
3029 gfc_namelist
*n
, *m
;
3030 const char *check_name
;
3034 if (iomode
== IO_OUTPUT
)
3036 for (n
= sym
->namelist
; n
; n
= n
->next
)
3037 mio_symbol_ref (&n
->sym
);
3041 /* This departure from the standard is flagged as an error.
3042 It does, in fact, work correctly. TODO: Allow it
3044 if (sym
->attr
.flavor
== FL_NAMELIST
)
3046 check_name
= find_use_name (sym
->name
, false);
3047 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
3048 gfc_error ("Namelist %s cannot be renamed by USE "
3049 "association to %s", sym
->name
, check_name
);
3053 while (peek_atom () != ATOM_RPAREN
)
3055 n
= gfc_get_namelist ();
3056 mio_symbol_ref (&n
->sym
);
3058 if (sym
->namelist
== NULL
)
3065 sym
->namelist_tail
= m
;
3072 /* Save/restore lists of gfc_interface structures. When loading an
3073 interface, we are really appending to the existing list of
3074 interfaces. Checking for duplicate and ambiguous interfaces has to
3075 be done later when all symbols have been loaded. */
3078 mio_interface_rest (gfc_interface
**ip
)
3080 gfc_interface
*tail
, *p
;
3081 pointer_info
*pi
= NULL
;
3083 if (iomode
== IO_OUTPUT
)
3086 for (p
= *ip
; p
; p
= p
->next
)
3087 mio_symbol_ref (&p
->sym
);
3102 if (peek_atom () == ATOM_RPAREN
)
3105 p
= gfc_get_interface ();
3106 p
->where
= gfc_current_locus
;
3107 pi
= mio_symbol_ref (&p
->sym
);
3123 /* Save/restore a nameless operator interface. */
3126 mio_interface (gfc_interface
**ip
)
3129 mio_interface_rest (ip
);
3133 /* Save/restore a named operator interface. */
3136 mio_symbol_interface (const char **name
, const char **module
,
3140 mio_pool_string (name
);
3141 mio_pool_string (module
);
3142 mio_interface_rest (ip
);
3147 mio_namespace_ref (gfc_namespace
**nsp
)
3152 p
= mio_pointer_ref (nsp
);
3154 if (p
->type
== P_UNKNOWN
)
3155 p
->type
= P_NAMESPACE
;
3157 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
3159 ns
= (gfc_namespace
*) p
->u
.pointer
;
3162 ns
= gfc_get_namespace (NULL
, 0);
3163 associate_integer_pointer (p
, ns
);
3171 /* Unlike most other routines, the address of the symbol node is already
3172 fixed on input and the name/module has already been filled in. */
3175 mio_symbol (gfc_symbol
*sym
)
3177 int intmod
= INTMOD_NONE
;
3179 gfc_formal_arglist
*formal
;
3183 mio_symbol_attribute (&sym
->attr
);
3184 mio_typespec (&sym
->ts
);
3186 /* Contained procedures don't have formal namespaces. Instead we output the
3187 procedure namespace. The will contain the formal arguments. */
3188 if (iomode
== IO_OUTPUT
)
3190 formal
= sym
->formal
;
3191 while (formal
&& !formal
->sym
)
3192 formal
= formal
->next
;
3195 mio_namespace_ref (&formal
->sym
->ns
);
3197 mio_namespace_ref (&sym
->formal_ns
);
3201 mio_namespace_ref (&sym
->formal_ns
);
3204 sym
->formal_ns
->proc_name
= sym
;
3209 /* Save/restore common block links. */
3210 mio_symbol_ref (&sym
->common_next
);
3212 mio_formal_arglist (sym
);
3214 if (sym
->attr
.flavor
== FL_PARAMETER
)
3215 mio_expr (&sym
->value
);
3217 mio_array_spec (&sym
->as
);
3219 mio_symbol_ref (&sym
->result
);
3221 if (sym
->attr
.cray_pointee
)
3222 mio_symbol_ref (&sym
->cp_pointer
);
3224 /* Note that components are always saved, even if they are supposed
3225 to be private. Component access is checked during searching. */
3227 mio_component_list (&sym
->components
);
3229 if (sym
->components
!= NULL
)
3230 sym
->component_access
3231 = MIO_NAME (gfc_access
) (sym
->component_access
, access_types
);
3235 /* Add the fields that say whether this is from an intrinsic module,
3236 and if so, what symbol it is within the module. */
3237 /* mio_integer (&(sym->from_intmod)); */
3238 if (iomode
== IO_OUTPUT
)
3240 intmod
= sym
->from_intmod
;
3241 mio_integer (&intmod
);
3245 mio_integer (&intmod
);
3246 sym
->from_intmod
= intmod
;
3249 mio_integer (&(sym
->intmod_sym_id
));
3255 /************************* Top level subroutines *************************/
3257 /* Given a root symtree node and a symbol, try to find a symtree that
3258 references the symbol that is not a unique name. */
3260 static gfc_symtree
*
3261 find_symtree_for_symbol (gfc_symtree
*st
, gfc_symbol
*sym
)
3263 gfc_symtree
*s
= NULL
;
3268 s
= find_symtree_for_symbol (st
->right
, sym
);
3271 s
= find_symtree_for_symbol (st
->left
, sym
);
3275 if (st
->n
.sym
== sym
&& !check_unique_name (st
->name
))
3282 /* A recursive function to look for a specific symbol by name and by
3283 module. Whilst several symtrees might point to one symbol, its
3284 is sufficient for the purposes here than one exist. Note that
3285 generic interfaces are distinguished as are symbols that have been
3286 renamed in another module. */
3287 static gfc_symtree
*
3288 find_symbol (gfc_symtree
*st
, const char *name
,
3289 const char *module
, int generic
)
3292 gfc_symtree
*retval
, *s
;
3294 if (st
== NULL
|| st
->n
.sym
== NULL
)
3297 c
= strcmp (name
, st
->n
.sym
->name
);
3298 if (c
== 0 && st
->n
.sym
->module
3299 && strcmp (module
, st
->n
.sym
->module
) == 0
3300 && !check_unique_name (st
->name
))
3302 s
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3304 /* Detect symbols that are renamed by use association in another
3305 module by the absence of a symtree and null attr.use_rename,
3306 since the latter is not transmitted in the module file. */
3307 if (((!generic
&& !st
->n
.sym
->attr
.generic
)
3308 || (generic
&& st
->n
.sym
->attr
.generic
))
3309 && !(s
== NULL
&& !st
->n
.sym
->attr
.use_rename
))
3313 retval
= find_symbol (st
->left
, name
, module
, generic
);
3316 retval
= find_symbol (st
->right
, name
, module
, generic
);
3322 /* Skip a list between balanced left and right parens. */
3332 switch (parse_atom ())
3343 gfc_free (atom_string
);
3355 /* Load operator interfaces from the module. Interfaces are unusual
3356 in that they attach themselves to existing symbols. */
3359 load_operator_interfaces (void)
3362 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3364 pointer_info
*pi
= NULL
;
3369 while (peek_atom () != ATOM_RPAREN
)
3373 mio_internal_string (name
);
3374 mio_internal_string (module
);
3376 n
= number_use_names (name
, true);
3379 for (i
= 1; i
<= n
; i
++)
3381 /* Decide if we need to load this one or not. */
3382 p
= find_use_name_n (name
, &i
, true);
3386 while (parse_atom () != ATOM_RPAREN
);
3392 uop
= gfc_get_uop (p
);
3393 pi
= mio_interface_rest (&uop
->op
);
3397 if (gfc_find_uop (p
, NULL
))
3399 uop
= gfc_get_uop (p
);
3400 uop
->op
= gfc_get_interface ();
3401 uop
->op
->where
= gfc_current_locus
;
3402 add_fixup (pi
->integer
, &uop
->op
->sym
);
3411 /* Load interfaces from the module. Interfaces are unusual in that
3412 they attach themselves to existing symbols. */
3415 load_generic_interfaces (void)
3418 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3420 gfc_interface
*generic
= NULL
;
3425 while (peek_atom () != ATOM_RPAREN
)
3429 mio_internal_string (name
);
3430 mio_internal_string (module
);
3432 n
= number_use_names (name
, false);
3433 renamed
= n
? 1 : 0;
3436 for (i
= 1; i
<= n
; i
++)
3439 /* Decide if we need to load this one or not. */
3440 p
= find_use_name_n (name
, &i
, false);
3442 st
= find_symbol (gfc_current_ns
->sym_root
,
3443 name
, module_name
, 1);
3445 if (!p
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
3447 /* Skip the specific names for these cases. */
3448 while (i
== 1 && parse_atom () != ATOM_RPAREN
);
3453 /* If the symbol exists already and is being USEd without being
3454 in an ONLY clause, do not load a new symtree(11.3.2). */
3455 if (!only_flag
&& st
)
3460 /* Make the symbol inaccessible if it has been added by a USE
3461 statement without an ONLY(11.3.2). */
3463 && !st
->n
.sym
->attr
.use_only
3464 && !st
->n
.sym
->attr
.use_rename
3465 && strcmp (st
->n
.sym
->module
, module_name
) == 0)
3468 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3469 st
= gfc_get_unique_symtree (gfc_current_ns
);
3476 if (strcmp (st
->name
, p
) != 0)
3478 st
= gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3484 /* Since we haven't found a valid generic interface, we had
3488 gfc_get_symbol (p
, NULL
, &sym
);
3489 sym
->name
= gfc_get_string (name
);
3490 sym
->module
= gfc_get_string (module_name
);
3491 sym
->attr
.flavor
= FL_PROCEDURE
;
3492 sym
->attr
.generic
= 1;
3493 sym
->attr
.use_assoc
= 1;
3498 /* Unless sym is a generic interface, this reference
3501 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3505 if (st
&& !sym
->attr
.generic
3507 && strcmp(module
, sym
->module
))
3511 sym
->attr
.use_only
= only_flag
;
3512 sym
->attr
.use_rename
= renamed
;
3516 mio_interface_rest (&sym
->generic
);
3517 generic
= sym
->generic
;
3519 else if (!sym
->generic
)
3521 sym
->generic
= generic
;
3522 sym
->attr
.generic_copy
= 1;
3531 /* Load common blocks. */
3536 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3541 while (peek_atom () != ATOM_RPAREN
)
3545 mio_internal_string (name
);
3547 p
= gfc_get_common (name
, 1);
3549 mio_symbol_ref (&p
->head
);
3550 mio_integer (&flags
);
3554 p
->threadprivate
= 1;
3557 /* Get whether this was a bind(c) common or not. */
3558 mio_integer (&p
->is_bind_c
);
3559 /* Get the binding label. */
3560 mio_internal_string (p
->binding_label
);
3569 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3570 so that unused variables are not loaded and so that the expression can
3576 gfc_equiv
*head
, *tail
, *end
, *eq
;
3580 in_load_equiv
= true;
3582 end
= gfc_current_ns
->equiv
;
3583 while (end
!= NULL
&& end
->next
!= NULL
)
3586 while (peek_atom () != ATOM_RPAREN
) {
3590 while(peek_atom () != ATOM_RPAREN
)
3593 head
= tail
= gfc_get_equiv ();
3596 tail
->eq
= gfc_get_equiv ();
3600 mio_pool_string (&tail
->module
);
3601 mio_expr (&tail
->expr
);
3604 /* Unused equivalence members have a unique name. */
3606 for (eq
= head
; eq
; eq
= eq
->eq
)
3608 if (!check_unique_name (eq
->expr
->symtree
->name
))
3617 for (eq
= head
; eq
; eq
= head
)
3620 gfc_free_expr (eq
->expr
);
3626 gfc_current_ns
->equiv
= head
;
3637 in_load_equiv
= false;
3641 /* Recursive function to traverse the pointer_info tree and load a
3642 needed symbol. We return nonzero if we load a symbol and stop the
3643 traversal, because the act of loading can alter the tree. */
3646 load_needed (pointer_info
*p
)
3657 rv
|= load_needed (p
->left
);
3658 rv
|= load_needed (p
->right
);
3660 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
3663 p
->u
.rsym
.state
= USED
;
3665 set_module_locus (&p
->u
.rsym
.where
);
3667 sym
= p
->u
.rsym
.sym
;
3670 q
= get_integer (p
->u
.rsym
.ns
);
3672 ns
= (gfc_namespace
*) q
->u
.pointer
;
3675 /* Create an interface namespace if necessary. These are
3676 the namespaces that hold the formal parameters of module
3679 ns
= gfc_get_namespace (NULL
, 0);
3680 associate_integer_pointer (q
, ns
);
3683 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
3684 doesn't go pear-shaped if the symbol is used. */
3686 gfc_find_symbol (p
->u
.rsym
.module
, gfc_current_ns
,
3689 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
3690 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
3691 strcpy (sym
->binding_label
, p
->u
.rsym
.binding_label
);
3693 associate_integer_pointer (p
, sym
);
3697 sym
->attr
.use_assoc
= 1;
3699 sym
->attr
.use_only
= 1;
3700 if (p
->u
.rsym
.renamed
)
3701 sym
->attr
.use_rename
= 1;
3707 /* Recursive function for cleaning up things after a module has been read. */
3710 read_cleanup (pointer_info
*p
)
3718 read_cleanup (p
->left
);
3719 read_cleanup (p
->right
);
3721 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
3723 /* Add hidden symbols to the symtree. */
3724 q
= get_integer (p
->u
.rsym
.ns
);
3725 st
= gfc_get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
3727 st
->n
.sym
= p
->u
.rsym
.sym
;
3730 /* Fixup any symtree references. */
3731 p
->u
.rsym
.symtree
= st
;
3732 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
3733 p
->u
.rsym
.stfixup
= NULL
;
3736 /* Free unused symbols. */
3737 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
3738 gfc_free_symbol (p
->u
.rsym
.sym
);
3742 /* Read a module file. */
3747 module_locus operator_interfaces
, user_operators
;
3749 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3751 int ambiguous
, j
, nuse
, symbol
;
3752 pointer_info
*info
, *q
;
3757 get_module_locus (&operator_interfaces
); /* Skip these for now. */
3760 get_module_locus (&user_operators
);
3764 /* Skip commons and equivalences for now. */
3770 /* Create the fixup nodes for all the symbols. */
3772 while (peek_atom () != ATOM_RPAREN
)
3774 require_atom (ATOM_INTEGER
);
3775 info
= get_integer (atom_int
);
3777 info
->type
= P_SYMBOL
;
3778 info
->u
.rsym
.state
= UNUSED
;
3780 mio_internal_string (info
->u
.rsym
.true_name
);
3781 mio_internal_string (info
->u
.rsym
.module
);
3782 mio_internal_string (info
->u
.rsym
.binding_label
);
3785 require_atom (ATOM_INTEGER
);
3786 info
->u
.rsym
.ns
= atom_int
;
3788 get_module_locus (&info
->u
.rsym
.where
);
3791 /* See if the symbol has already been loaded by a previous module.
3792 If so, we reference the existing symbol and prevent it from
3793 being loaded again. This should not happen if the symbol being
3794 read is an index for an assumed shape dummy array (ns != 1). */
3796 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
3799 || (sym
->attr
.flavor
== FL_VARIABLE
&& info
->u
.rsym
.ns
!=1))
3802 info
->u
.rsym
.state
= USED
;
3803 info
->u
.rsym
.sym
= sym
;
3805 /* Some symbols do not have a namespace (eg. formal arguments),
3806 so the automatic "unique symtree" mechanism must be suppressed
3807 by marking them as referenced. */
3808 q
= get_integer (info
->u
.rsym
.ns
);
3809 if (q
->u
.pointer
== NULL
)
3811 info
->u
.rsym
.referenced
= 1;
3815 /* If possible recycle the symtree that references the symbol.
3816 If a symtree is not found and the module does not import one,
3817 a unique-name symtree is found by read_cleanup. */
3818 st
= find_symtree_for_symbol (gfc_current_ns
->sym_root
, sym
);
3821 info
->u
.rsym
.symtree
= st
;
3822 info
->u
.rsym
.referenced
= 1;
3828 /* Parse the symtree lists. This lets us mark which symbols need to
3829 be loaded. Renaming is also done at this point by replacing the
3834 while (peek_atom () != ATOM_RPAREN
)
3836 mio_internal_string (name
);
3837 mio_integer (&ambiguous
);
3838 mio_integer (&symbol
);
3840 info
= get_integer (symbol
);
3842 /* See how many use names there are. If none, go through the start
3843 of the loop at least once. */
3844 nuse
= number_use_names (name
, false);
3845 info
->u
.rsym
.renamed
= nuse
? 1 : 0;
3850 for (j
= 1; j
<= nuse
; j
++)
3852 /* Get the jth local name for this symbol. */
3853 p
= find_use_name_n (name
, &j
, false);
3855 if (p
== NULL
&& strcmp (name
, module_name
) == 0)
3858 /* Skip symtree nodes not in an ONLY clause, unless there
3859 is an existing symtree loaded from another USE statement. */
3862 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3864 info
->u
.rsym
.symtree
= st
;
3868 /* If a symbol of the same name and module exists already,
3869 this symbol, which is not in an ONLY clause, must not be
3870 added to the namespace(11.3.2). Note that find_symbol
3871 only returns the first occurrence that it finds. */
3872 if (!only_flag
&& !info
->u
.rsym
.renamed
3873 && strcmp (name
, module_name
) != 0
3874 && find_symbol (gfc_current_ns
->sym_root
, name
,
3878 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3882 /* Check for ambiguous symbols. */
3883 if (st
->n
.sym
!= info
->u
.rsym
.sym
)
3885 info
->u
.rsym
.symtree
= st
;
3889 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3891 /* Delete the symtree if the symbol has been added by a USE
3892 statement without an ONLY(11.3.2). Remember that the rsym
3893 will be the same as the symbol found in the symtree, for
3895 if (st
&& (only_flag
|| info
->u
.rsym
.renamed
)
3896 && !st
->n
.sym
->attr
.use_only
3897 && !st
->n
.sym
->attr
.use_rename
3898 && info
->u
.rsym
.sym
== st
->n
.sym
)
3899 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3901 /* Create a symtree node in the current namespace for this
3903 st
= check_unique_name (p
)
3904 ? gfc_get_unique_symtree (gfc_current_ns
)
3905 : gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3906 st
->ambiguous
= ambiguous
;
3908 sym
= info
->u
.rsym
.sym
;
3910 /* Create a symbol node if it doesn't already exist. */
3913 info
->u
.rsym
.sym
= gfc_new_symbol (info
->u
.rsym
.true_name
,
3915 sym
= info
->u
.rsym
.sym
;
3916 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
3918 /* TODO: hmm, can we test this? Do we know it will be
3919 initialized to zeros? */
3920 if (info
->u
.rsym
.binding_label
[0] != '\0')
3921 strcpy (sym
->binding_label
, info
->u
.rsym
.binding_label
);
3927 if (strcmp (name
, p
) != 0)
3928 sym
->attr
.use_rename
= 1;
3930 /* Store the symtree pointing to this symbol. */
3931 info
->u
.rsym
.symtree
= st
;
3933 if (info
->u
.rsym
.state
== UNUSED
)
3934 info
->u
.rsym
.state
= NEEDED
;
3935 info
->u
.rsym
.referenced
= 1;
3942 /* Load intrinsic operator interfaces. */
3943 set_module_locus (&operator_interfaces
);
3946 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3948 if (i
== INTRINSIC_USER
)
3953 u
= find_use_operator (i
);
3964 mio_interface (&gfc_current_ns
->op
[i
]);
3969 /* Load generic and user operator interfaces. These must follow the
3970 loading of symtree because otherwise symbols can be marked as
3973 set_module_locus (&user_operators
);
3975 load_operator_interfaces ();
3976 load_generic_interfaces ();
3981 /* At this point, we read those symbols that are needed but haven't
3982 been loaded yet. If one symbol requires another, the other gets
3983 marked as NEEDED if its previous state was UNUSED. */
3985 while (load_needed (pi_root
));
3987 /* Make sure all elements of the rename-list were found in the module. */
3989 for (u
= gfc_rename_list
; u
; u
= u
->next
)
3994 if (u
->op
== INTRINSIC_NONE
)
3996 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3997 u
->use_name
, &u
->where
, module_name
);
4001 if (u
->op
== INTRINSIC_USER
)
4003 gfc_error ("User operator '%s' referenced at %L not found "
4004 "in module '%s'", u
->use_name
, &u
->where
, module_name
);
4008 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
4009 "in module '%s'", gfc_op2string (u
->op
), &u
->where
,
4013 gfc_check_interfaces (gfc_current_ns
);
4015 /* Clean up symbol nodes that were never loaded, create references
4016 to hidden symbols. */
4018 read_cleanup (pi_root
);
4022 /* Given an access type that is specific to an entity and the default
4023 access, return nonzero if the entity is publicly accessible. If the
4024 element is declared as PUBLIC, then it is public; if declared
4025 PRIVATE, then private, and otherwise it is public unless the default
4026 access in this context has been declared PRIVATE. */
4029 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
4031 if (specific_access
== ACCESS_PUBLIC
)
4033 if (specific_access
== ACCESS_PRIVATE
)
4036 if (gfc_option
.flag_module_private
)
4037 return default_access
== ACCESS_PUBLIC
;
4039 return default_access
!= ACCESS_PRIVATE
;
4043 /* A structure to remember which commons we've already written. */
4045 struct written_common
4047 BBT_HEADER(written_common
);
4048 const char *name
, *label
;
4051 static struct written_common
*written_commons
= NULL
;
4053 /* Comparison function used for balancing the binary tree. */
4056 compare_written_commons (void *a1
, void *b1
)
4058 const char *aname
= ((struct written_common
*) a1
)->name
;
4059 const char *alabel
= ((struct written_common
*) a1
)->label
;
4060 const char *bname
= ((struct written_common
*) b1
)->name
;
4061 const char *blabel
= ((struct written_common
*) b1
)->label
;
4062 int c
= strcmp (aname
, bname
);
4064 return (c
!= 0 ? c
: strcmp (alabel
, blabel
));
4067 /* Free a list of written commons. */
4070 free_written_common (struct written_common
*w
)
4076 free_written_common (w
->left
);
4078 free_written_common (w
->right
);
4083 /* Write a common block to the module -- recursive helper function. */
4086 write_common_0 (gfc_symtree
*st
)
4092 struct written_common
*w
;
4093 bool write_me
= true;
4098 write_common_0 (st
->left
);
4100 /* We will write out the binding label, or the name if no label given. */
4101 name
= st
->n
.common
->name
;
4103 label
= p
->is_bind_c
? p
->binding_label
: p
->name
;
4105 /* Check if we've already output this common. */
4106 w
= written_commons
;
4109 int c
= strcmp (name
, w
->name
);
4110 c
= (c
!= 0 ? c
: strcmp (label
, w
->label
));
4114 w
= (c
< 0) ? w
->left
: w
->right
;
4119 /* Write the common to the module. */
4121 mio_pool_string (&name
);
4123 mio_symbol_ref (&p
->head
);
4124 flags
= p
->saved
? 1 : 0;
4125 if (p
->threadprivate
)
4127 mio_integer (&flags
);
4129 /* Write out whether the common block is bind(c) or not. */
4130 mio_integer (&(p
->is_bind_c
));
4132 mio_pool_string (&label
);
4135 /* Record that we have written this common. */
4136 w
= XCNEW (struct written_common
);
4139 gfc_insert_bbt (&written_commons
, w
, compare_written_commons
);
4142 write_common_0 (st
->right
);
4146 /* Write a common, by initializing the list of written commons, calling
4147 the recursive function write_common_0() and cleaning up afterwards. */
4150 write_common (gfc_symtree
*st
)
4152 written_commons
= NULL
;
4153 write_common_0 (st
);
4154 free_written_common (written_commons
);
4155 written_commons
= NULL
;
4159 /* Write the blank common block to the module. */
4162 write_blank_common (void)
4164 const char * name
= BLANK_COMMON_NAME
;
4166 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4167 this, but it hasn't been checked. Just making it so for now. */
4170 if (gfc_current_ns
->blank_common
.head
== NULL
)
4175 mio_pool_string (&name
);
4177 mio_symbol_ref (&gfc_current_ns
->blank_common
.head
);
4178 saved
= gfc_current_ns
->blank_common
.saved
;
4179 mio_integer (&saved
);
4181 /* Write out whether the common block is bind(c) or not. */
4182 mio_integer (&is_bind_c
);
4184 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4185 it doesn't matter because the label isn't used. */
4186 mio_pool_string (&name
);
4192 /* Write equivalences to the module. */
4201 for (eq
= gfc_current_ns
->equiv
; eq
; eq
= eq
->next
)
4205 for (e
= eq
; e
; e
= e
->eq
)
4207 if (e
->module
== NULL
)
4208 e
->module
= gfc_get_string ("%s.eq.%d", module_name
, num
);
4209 mio_allocated_string (e
->module
);
4210 mio_expr (&e
->expr
);
4219 /* Write a symbol to the module. */
4222 write_symbol (int n
, gfc_symbol
*sym
)
4226 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
4227 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
4230 mio_pool_string (&sym
->name
);
4232 mio_pool_string (&sym
->module
);
4233 if (sym
->attr
.is_bind_c
|| sym
->attr
.is_iso_c
)
4235 label
= sym
->binding_label
;
4236 mio_pool_string (&label
);
4239 mio_pool_string (&sym
->name
);
4241 mio_pointer_ref (&sym
->ns
);
4248 /* Recursive traversal function to write the initial set of symbols to
4249 the module. We check to see if the symbol should be written
4250 according to the access specification. */
4253 write_symbol0 (gfc_symtree
*st
)
4257 bool dont_write
= false;
4262 write_symbol0 (st
->left
);
4265 if (sym
->module
== NULL
)
4266 sym
->module
= gfc_get_string (module_name
);
4268 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4269 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
4272 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4277 p
= get_pointer (sym
);
4278 if (p
->type
== P_UNKNOWN
)
4281 if (p
->u
.wsym
.state
!= WRITTEN
)
4283 write_symbol (p
->integer
, sym
);
4284 p
->u
.wsym
.state
= WRITTEN
;
4288 write_symbol0 (st
->right
);
4292 /* Recursive traversal function to write the secondary set of symbols
4293 to the module file. These are symbols that were not public yet are
4294 needed by the public symbols or another dependent symbol. The act
4295 of writing a symbol can modify the pointer_info tree, so we cease
4296 traversal if we find a symbol to write. We return nonzero if a
4297 symbol was written and pass that information upwards. */
4300 write_symbol1 (pointer_info
*p
)
4307 result
= write_symbol1 (p
->left
);
4309 if (!(p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
))
4311 p
->u
.wsym
.state
= WRITTEN
;
4312 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
4316 result
|= write_symbol1 (p
->right
);
4321 /* Write operator interfaces associated with a symbol. */
4324 write_operator (gfc_user_op
*uop
)
4326 static char nullstring
[] = "";
4327 const char *p
= nullstring
;
4330 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
4333 mio_symbol_interface (&uop
->name
, &p
, &uop
->op
);
4337 /* Write generic interfaces from the namespace sym_root. */
4340 write_generic (gfc_symtree
*st
)
4347 write_generic (st
->left
);
4348 write_generic (st
->right
);
4351 if (!sym
|| check_unique_name (st
->name
))
4354 if (sym
->generic
== NULL
4355 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4358 if (sym
->module
== NULL
)
4359 sym
->module
= gfc_get_string (module_name
);
4361 mio_symbol_interface (&st
->name
, &sym
->module
, &sym
->generic
);
4366 write_symtree (gfc_symtree
*st
)
4372 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
4373 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4374 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
4377 if (check_unique_name (st
->name
))
4380 p
= find_pointer (sym
);
4382 gfc_internal_error ("write_symtree(): Symbol not written");
4384 mio_pool_string (&st
->name
);
4385 mio_integer (&st
->ambiguous
);
4386 mio_integer (&p
->integer
);
4395 /* Write the operator interfaces. */
4398 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4400 if (i
== INTRINSIC_USER
)
4403 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
4404 gfc_current_ns
->default_access
)
4405 ? &gfc_current_ns
->op
[i
] : NULL
);
4413 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
4419 write_generic (gfc_current_ns
->sym_root
);
4425 write_blank_common ();
4426 write_common (gfc_current_ns
->common_root
);
4437 /* Write symbol information. First we traverse all symbols in the
4438 primary namespace, writing those that need to be written.
4439 Sometimes writing one symbol will cause another to need to be
4440 written. A list of these symbols ends up on the write stack, and
4441 we end by popping the bottom of the stack and writing the symbol
4442 until the stack is empty. */
4446 write_symbol0 (gfc_current_ns
->sym_root
);
4447 while (write_symbol1 (pi_root
))
4456 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
4461 /* Read a MD5 sum from the header of a module file. If the file cannot
4462 be opened, or we have any other error, we return -1. */
4465 read_md5_from_module_file (const char * filename
, unsigned char md5
[16])
4471 /* Open the file. */
4472 if ((file
= fopen (filename
, "r")) == NULL
)
4475 /* Read two lines. */
4476 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
4477 || fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
4483 /* Close the file. */
4486 /* If the header is not what we expect, or is too short, bail out. */
4487 if (strncmp (buf
, "MD5:", 4) != 0 || strlen (buf
) < 4 + 16)
4490 /* Now, we have a real MD5, read it into the array. */
4491 for (n
= 0; n
< 16; n
++)
4495 if (sscanf (&(buf
[4+2*n
]), "%02x", &x
) != 1)
4505 /* Given module, dump it to disk. If there was an error while
4506 processing the module, dump_flag will be set to zero and we delete
4507 the module file, even if it was already there. */
4510 gfc_dump_module (const char *name
, int dump_flag
)
4513 char *filename
, *filename_tmp
, *p
;
4516 unsigned char md5_new
[16], md5_old
[16];
4518 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
4519 if (gfc_option
.module_dir
!= NULL
)
4521 n
+= strlen (gfc_option
.module_dir
);
4522 filename
= (char *) alloca (n
);
4523 strcpy (filename
, gfc_option
.module_dir
);
4524 strcat (filename
, name
);
4528 filename
= (char *) alloca (n
);
4529 strcpy (filename
, name
);
4531 strcat (filename
, MODULE_EXTENSION
);
4533 /* Name of the temporary file used to write the module. */
4534 filename_tmp
= (char *) alloca (n
+ 1);
4535 strcpy (filename_tmp
, filename
);
4536 strcat (filename_tmp
, "0");
4538 /* There was an error while processing the module. We delete the
4539 module file, even if it was already there. */
4546 /* Write the module to the temporary file. */
4547 module_fp
= fopen (filename_tmp
, "w");
4548 if (module_fp
== NULL
)
4549 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
4550 filename_tmp
, strerror (errno
));
4552 /* Write the header, including space reserved for the MD5 sum. */
4556 *strchr (p
, '\n') = '\0';
4558 fprintf (module_fp
, "GFORTRAN module created from %s on %s\nMD5:",
4559 gfc_source_file
, p
);
4560 fgetpos (module_fp
, &md5_pos
);
4561 fputs ("00000000000000000000000000000000 -- "
4562 "If you edit this, you'll get what you deserve.\n\n", module_fp
);
4564 /* Initialize the MD5 context that will be used for output. */
4565 md5_init_ctx (&ctx
);
4567 /* Write the module itself. */
4569 strcpy (module_name
, name
);
4575 free_pi_tree (pi_root
);
4580 /* Write the MD5 sum to the header of the module file. */
4581 md5_finish_ctx (&ctx
, md5_new
);
4582 fsetpos (module_fp
, &md5_pos
);
4583 for (n
= 0; n
< 16; n
++)
4584 fprintf (module_fp
, "%02x", md5_new
[n
]);
4586 if (fclose (module_fp
))
4587 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
4588 filename_tmp
, strerror (errno
));
4590 /* Read the MD5 from the header of the old module file and compare. */
4591 if (read_md5_from_module_file (filename
, md5_old
) != 0
4592 || memcmp (md5_old
, md5_new
, sizeof (md5_old
)) != 0)
4594 /* Module file have changed, replace the old one. */
4596 rename (filename_tmp
, filename
);
4599 unlink (filename_tmp
);
4604 sort_iso_c_rename_list (void)
4606 gfc_use_rename
*tmp_list
= NULL
;
4607 gfc_use_rename
*curr
;
4608 gfc_use_rename
*kinds_used
[ISOCBINDING_NUMBER
] = {NULL
};
4612 for (curr
= gfc_rename_list
; curr
; curr
= curr
->next
)
4614 c_kind
= get_c_kind (curr
->use_name
, c_interop_kinds_table
);
4615 if (c_kind
== ISOCBINDING_INVALID
|| c_kind
== ISOCBINDING_LAST
)
4617 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4618 "intrinsic module ISO_C_BINDING.", curr
->use_name
,
4622 /* Put it in the list. */
4623 kinds_used
[c_kind
] = curr
;
4626 /* Make a new (sorted) rename list. */
4628 while (i
< ISOCBINDING_NUMBER
&& kinds_used
[i
] == NULL
)
4631 if (i
< ISOCBINDING_NUMBER
)
4633 tmp_list
= kinds_used
[i
];
4637 for (; i
< ISOCBINDING_NUMBER
; i
++)
4638 if (kinds_used
[i
] != NULL
)
4640 curr
->next
= kinds_used
[i
];
4646 gfc_rename_list
= tmp_list
;
4650 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
4651 the current namespace for all named constants, pointer types, and
4652 procedures in the module unless the only clause was used or a rename
4653 list was provided. */
4656 import_iso_c_binding_module (void)
4658 gfc_symbol
*mod_sym
= NULL
;
4659 gfc_symtree
*mod_symtree
= NULL
;
4660 const char *iso_c_module_name
= "__iso_c_binding";
4665 /* Look only in the current namespace. */
4666 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, iso_c_module_name
);
4668 if (mod_symtree
== NULL
)
4670 /* symtree doesn't already exist in current namespace. */
4671 gfc_get_sym_tree (iso_c_module_name
, gfc_current_ns
, &mod_symtree
);
4673 if (mod_symtree
!= NULL
)
4674 mod_sym
= mod_symtree
->n
.sym
;
4676 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
4677 "create symbol for %s", iso_c_module_name
);
4679 mod_sym
->attr
.flavor
= FL_MODULE
;
4680 mod_sym
->attr
.intrinsic
= 1;
4681 mod_sym
->module
= gfc_get_string (iso_c_module_name
);
4682 mod_sym
->from_intmod
= INTMOD_ISO_C_BINDING
;
4685 /* Generate the symbols for the named constants representing
4686 the kinds for intrinsic data types. */
4689 /* Sort the rename list because there are dependencies between types
4690 and procedures (e.g., c_loc needs c_ptr). */
4691 sort_iso_c_rename_list ();
4693 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4695 i
= get_c_kind (u
->use_name
, c_interop_kinds_table
);
4697 if (i
== ISOCBINDING_INVALID
|| i
== ISOCBINDING_LAST
)
4699 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4700 "intrinsic module ISO_C_BINDING.", u
->use_name
,
4705 generate_isocbinding_symbol (iso_c_module_name
, i
, u
->local_name
);
4710 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
4713 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4715 if (strcmp (c_interop_kinds_table
[i
].name
, u
->use_name
) == 0)
4717 local_name
= u
->local_name
;
4722 generate_isocbinding_symbol (iso_c_module_name
, i
, local_name
);
4725 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4730 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4731 "module ISO_C_BINDING", u
->use_name
, &u
->where
);
4737 /* Add an integer named constant from a given module. */
4740 create_int_parameter (const char *name
, int value
, const char *modname
,
4741 intmod_id module
, int id
)
4743 gfc_symtree
*tmp_symtree
;
4746 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4747 if (tmp_symtree
!= NULL
)
4749 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
4752 gfc_error ("Symbol '%s' already declared", name
);
4755 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
);
4756 sym
= tmp_symtree
->n
.sym
;
4758 sym
->module
= gfc_get_string (modname
);
4759 sym
->attr
.flavor
= FL_PARAMETER
;
4760 sym
->ts
.type
= BT_INTEGER
;
4761 sym
->ts
.kind
= gfc_default_integer_kind
;
4762 sym
->value
= gfc_int_expr (value
);
4763 sym
->attr
.use_assoc
= 1;
4764 sym
->from_intmod
= module
;
4765 sym
->intmod_sym_id
= id
;
4769 /* USE the ISO_FORTRAN_ENV intrinsic module. */
4772 use_iso_fortran_env_module (void)
4774 static char mod
[] = "iso_fortran_env";
4775 const char *local_name
;
4777 gfc_symbol
*mod_sym
;
4778 gfc_symtree
*mod_symtree
;
4781 intmod_sym symbol
[] = {
4782 #define NAMED_INTCST(a,b,c,d) { a, b, 0, d },
4783 #include "iso-fortran-env.def"
4785 { ISOFORTRANENV_INVALID
, NULL
, -1234, 0 } };
4788 #define NAMED_INTCST(a,b,c,d) symbol[i++].value = c;
4789 #include "iso-fortran-env.def"
4792 /* Generate the symbol for the module itself. */
4793 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, mod
);
4794 if (mod_symtree
== NULL
)
4796 gfc_get_sym_tree (mod
, gfc_current_ns
, &mod_symtree
);
4797 gcc_assert (mod_symtree
);
4798 mod_sym
= mod_symtree
->n
.sym
;
4800 mod_sym
->attr
.flavor
= FL_MODULE
;
4801 mod_sym
->attr
.intrinsic
= 1;
4802 mod_sym
->module
= gfc_get_string (mod
);
4803 mod_sym
->from_intmod
= INTMOD_ISO_FORTRAN_ENV
;
4806 if (!mod_symtree
->n
.sym
->attr
.intrinsic
)
4807 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
4808 "non-intrinsic module name used previously", mod
);
4810 /* Generate the symbols for the module integer named constants. */
4812 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4814 for (i
= 0; symbol
[i
].name
; i
++)
4815 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
4818 if (symbol
[i
].name
== NULL
)
4820 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4821 "intrinsic module ISO_FORTRAN_ENV", u
->use_name
,
4826 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
4827 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
4828 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4829 "from intrinsic module ISO_FORTRAN_ENV at %L is "
4830 "incompatible with option %s", &u
->where
,
4831 gfc_option
.flag_default_integer
4832 ? "-fdefault-integer-8" : "-fdefault-real-8");
4834 create_int_parameter (u
->local_name
[0] ? u
->local_name
4836 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
4841 for (i
= 0; symbol
[i
].name
; i
++)
4844 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4846 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
4848 local_name
= u
->local_name
;
4854 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
4855 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
4856 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4857 "from intrinsic module ISO_FORTRAN_ENV at %C is "
4858 "incompatible with option %s",
4859 gfc_option
.flag_default_integer
4860 ? "-fdefault-integer-8" : "-fdefault-real-8");
4862 create_int_parameter (local_name
? local_name
: symbol
[i
].name
,
4863 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
4867 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4872 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4873 "module ISO_FORTRAN_ENV", u
->use_name
, &u
->where
);
4879 /* Process a USE directive. */
4882 gfc_use_module (void)
4887 gfc_symtree
*mod_symtree
;
4889 filename
= (char *) alloca (strlen (module_name
) + strlen (MODULE_EXTENSION
)
4891 strcpy (filename
, module_name
);
4892 strcat (filename
, MODULE_EXTENSION
);
4894 /* First, try to find an non-intrinsic module, unless the USE statement
4895 specified that the module is intrinsic. */
4898 module_fp
= gfc_open_included_file (filename
, true, true);
4900 /* Then, see if it's an intrinsic one, unless the USE statement
4901 specified that the module is non-intrinsic. */
4902 if (module_fp
== NULL
&& !specified_nonint
)
4904 if (strcmp (module_name
, "iso_fortran_env") == 0
4905 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: ISO_FORTRAN_ENV "
4906 "intrinsic module at %C") != FAILURE
)
4908 use_iso_fortran_env_module ();
4912 if (strcmp (module_name
, "iso_c_binding") == 0
4913 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
4914 "ISO_C_BINDING module at %C") != FAILURE
)
4916 import_iso_c_binding_module();
4920 module_fp
= gfc_open_intrinsic_module (filename
);
4922 if (module_fp
== NULL
&& specified_int
)
4923 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
4927 if (module_fp
== NULL
)
4928 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
4929 filename
, strerror (errno
));
4931 /* Check that we haven't already USEd an intrinsic module with the
4934 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, module_name
);
4935 if (mod_symtree
&& mod_symtree
->n
.sym
->attr
.intrinsic
)
4936 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
4937 "intrinsic module name used previously", module_name
);
4944 /* Skip the first two lines of the module, after checking that this is
4945 a gfortran module file. */
4951 bad_module ("Unexpected end of module");
4954 if ((start
== 1 && strcmp (atom_name
, "GFORTRAN") != 0)
4955 || (start
== 2 && strcmp (atom_name
, " module") != 0))
4956 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
4963 /* Make sure we're not reading the same module that we may be building. */
4964 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
4965 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
4966 gfc_fatal_error ("Can't USE the same module we're building!");
4969 init_true_name_tree ();
4973 free_true_name (true_name_root
);
4974 true_name_root
= NULL
;
4976 free_pi_tree (pi_root
);
4984 gfc_module_init_2 (void)
4986 last_atom
= ATOM_LPAREN
;
4991 gfc_module_done_2 (void)