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, ie 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
;
172 gfc_intrinsic_op
operator;
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 (ie 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;
506 interface_type type
, type2
;
507 gfc_intrinsic_op
operator;
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 = gfc_get_use_rename ();
585 new->where
= gfc_current_locus
;
588 if (gfc_rename_list
== NULL
)
589 gfc_rename_list
= new;
594 /* See what kind of interface we're dealing with. Assume it is
596 new->operator = INTRINSIC_NONE
;
597 if (gfc_match_generic_spec (&type
, name
, &operator) == 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->operator = INTRINSIC_USER
;
622 strcpy (new->use_name
, name
);
625 strcpy (new->local_name
, name
);
626 m
= gfc_match_generic_spec (&type2
, new->use_name
, &operator);
631 if (m
== MATCH_ERROR
)
639 strcpy (new->local_name
, name
);
641 m
= gfc_match_generic_spec (&type2
, new->use_name
, &operator);
646 if (m
== MATCH_ERROR
)
650 if (strcmp (new->use_name
, module_name
) == 0
651 || strcmp (new->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
:
660 new->operator = operator;
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
->operator == INTRINSIC_USER
&& !interface
)
702 || (u
->operator != 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
operator)
753 for (u
= gfc_rename_list
; u
; u
= u
->next
)
754 if (u
->operator == operator)
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
1655 static const mstring attr_bits
[] =
1657 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1658 minit ("DIMENSION", AB_DIMENSION
),
1659 minit ("EXTERNAL", AB_EXTERNAL
),
1660 minit ("INTRINSIC", AB_INTRINSIC
),
1661 minit ("OPTIONAL", AB_OPTIONAL
),
1662 minit ("POINTER", AB_POINTER
),
1663 minit ("VOLATILE", AB_VOLATILE
),
1664 minit ("TARGET", AB_TARGET
),
1665 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1666 minit ("DUMMY", AB_DUMMY
),
1667 minit ("RESULT", AB_RESULT
),
1668 minit ("DATA", AB_DATA
),
1669 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1670 minit ("IN_COMMON", AB_IN_COMMON
),
1671 minit ("FUNCTION", AB_FUNCTION
),
1672 minit ("SUBROUTINE", AB_SUBROUTINE
),
1673 minit ("SEQUENCE", AB_SEQUENCE
),
1674 minit ("ELEMENTAL", AB_ELEMENTAL
),
1675 minit ("PURE", AB_PURE
),
1676 minit ("RECURSIVE", AB_RECURSIVE
),
1677 minit ("GENERIC", AB_GENERIC
),
1678 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1679 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1680 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1681 minit ("IS_BIND_C", AB_IS_BIND_C
),
1682 minit ("IS_C_INTEROP", AB_IS_C_INTEROP
),
1683 minit ("IS_ISO_C", AB_IS_ISO_C
),
1684 minit ("VALUE", AB_VALUE
),
1685 minit ("ALLOC_COMP", AB_ALLOC_COMP
),
1686 minit ("POINTER_COMP", AB_POINTER_COMP
),
1687 minit ("PRIVATE_COMP", AB_PRIVATE_COMP
),
1688 minit ("ZERO_COMP", AB_ZERO_COMP
),
1689 minit ("PROTECTED", AB_PROTECTED
),
1690 minit ("ABSTRACT", AB_ABSTRACT
),
1695 /* Specialization of mio_name. */
1696 DECL_MIO_NAME (ab_attribute
)
1697 DECL_MIO_NAME (ar_type
)
1698 DECL_MIO_NAME (array_type
)
1700 DECL_MIO_NAME (expr_t
)
1701 DECL_MIO_NAME (gfc_access
)
1702 DECL_MIO_NAME (gfc_intrinsic_op
)
1703 DECL_MIO_NAME (ifsrc
)
1704 DECL_MIO_NAME (save_state
)
1705 DECL_MIO_NAME (procedure_type
)
1706 DECL_MIO_NAME (ref_type
)
1707 DECL_MIO_NAME (sym_flavor
)
1708 DECL_MIO_NAME (sym_intent
)
1709 #undef DECL_MIO_NAME
1711 /* Symbol attributes are stored in list with the first three elements
1712 being the enumerated fields, while the remaining elements (if any)
1713 indicate the individual attribute bits. The access field is not
1714 saved-- it controls what symbols are exported when a module is
1718 mio_symbol_attribute (symbol_attribute
*attr
)
1724 attr
->flavor
= MIO_NAME (sym_flavor
) (attr
->flavor
, flavors
);
1725 attr
->intent
= MIO_NAME (sym_intent
) (attr
->intent
, intents
);
1726 attr
->proc
= MIO_NAME (procedure_type
) (attr
->proc
, procedures
);
1727 attr
->if_source
= MIO_NAME (ifsrc
) (attr
->if_source
, ifsrc_types
);
1728 attr
->save
= MIO_NAME (save_state
) (attr
->save
, save_status
);
1730 if (iomode
== IO_OUTPUT
)
1732 if (attr
->allocatable
)
1733 MIO_NAME (ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1734 if (attr
->dimension
)
1735 MIO_NAME (ab_attribute
) (AB_DIMENSION
, attr_bits
);
1737 MIO_NAME (ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1738 if (attr
->intrinsic
)
1739 MIO_NAME (ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1741 MIO_NAME (ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1743 MIO_NAME (ab_attribute
) (AB_POINTER
, attr_bits
);
1744 if (attr
->is_protected
)
1745 MIO_NAME (ab_attribute
) (AB_PROTECTED
, attr_bits
);
1747 MIO_NAME (ab_attribute
) (AB_VALUE
, attr_bits
);
1748 if (attr
->volatile_
)
1749 MIO_NAME (ab_attribute
) (AB_VOLATILE
, attr_bits
);
1751 MIO_NAME (ab_attribute
) (AB_TARGET
, attr_bits
);
1752 if (attr
->threadprivate
)
1753 MIO_NAME (ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1755 MIO_NAME (ab_attribute
) (AB_DUMMY
, attr_bits
);
1757 MIO_NAME (ab_attribute
) (AB_RESULT
, attr_bits
);
1758 /* We deliberately don't preserve the "entry" flag. */
1761 MIO_NAME (ab_attribute
) (AB_DATA
, attr_bits
);
1762 if (attr
->in_namelist
)
1763 MIO_NAME (ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1764 if (attr
->in_common
)
1765 MIO_NAME (ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1768 MIO_NAME (ab_attribute
) (AB_FUNCTION
, attr_bits
);
1769 if (attr
->subroutine
)
1770 MIO_NAME (ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1772 MIO_NAME (ab_attribute
) (AB_GENERIC
, attr_bits
);
1774 MIO_NAME (ab_attribute
) (AB_ABSTRACT
, attr_bits
);
1777 MIO_NAME (ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1778 if (attr
->elemental
)
1779 MIO_NAME (ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1781 MIO_NAME (ab_attribute
) (AB_PURE
, attr_bits
);
1782 if (attr
->recursive
)
1783 MIO_NAME (ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1784 if (attr
->always_explicit
)
1785 MIO_NAME (ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1786 if (attr
->cray_pointer
)
1787 MIO_NAME (ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1788 if (attr
->cray_pointee
)
1789 MIO_NAME (ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1790 if (attr
->is_bind_c
)
1791 MIO_NAME(ab_attribute
) (AB_IS_BIND_C
, attr_bits
);
1792 if (attr
->is_c_interop
)
1793 MIO_NAME(ab_attribute
) (AB_IS_C_INTEROP
, attr_bits
);
1795 MIO_NAME(ab_attribute
) (AB_IS_ISO_C
, attr_bits
);
1796 if (attr
->alloc_comp
)
1797 MIO_NAME (ab_attribute
) (AB_ALLOC_COMP
, attr_bits
);
1798 if (attr
->pointer_comp
)
1799 MIO_NAME (ab_attribute
) (AB_POINTER_COMP
, attr_bits
);
1800 if (attr
->private_comp
)
1801 MIO_NAME (ab_attribute
) (AB_PRIVATE_COMP
, attr_bits
);
1802 if (attr
->zero_comp
)
1803 MIO_NAME (ab_attribute
) (AB_ZERO_COMP
, attr_bits
);
1813 if (t
== ATOM_RPAREN
)
1816 bad_module ("Expected attribute bit name");
1818 switch ((ab_attribute
) find_enum (attr_bits
))
1820 case AB_ALLOCATABLE
:
1821 attr
->allocatable
= 1;
1824 attr
->dimension
= 1;
1830 attr
->intrinsic
= 1;
1839 attr
->is_protected
= 1;
1845 attr
->volatile_
= 1;
1850 case AB_THREADPRIVATE
:
1851 attr
->threadprivate
= 1;
1862 case AB_IN_NAMELIST
:
1863 attr
->in_namelist
= 1;
1866 attr
->in_common
= 1;
1872 attr
->subroutine
= 1;
1884 attr
->elemental
= 1;
1890 attr
->recursive
= 1;
1892 case AB_ALWAYS_EXPLICIT
:
1893 attr
->always_explicit
= 1;
1895 case AB_CRAY_POINTER
:
1896 attr
->cray_pointer
= 1;
1898 case AB_CRAY_POINTEE
:
1899 attr
->cray_pointee
= 1;
1902 attr
->is_bind_c
= 1;
1904 case AB_IS_C_INTEROP
:
1905 attr
->is_c_interop
= 1;
1911 attr
->alloc_comp
= 1;
1913 case AB_POINTER_COMP
:
1914 attr
->pointer_comp
= 1;
1916 case AB_PRIVATE_COMP
:
1917 attr
->private_comp
= 1;
1920 attr
->zero_comp
= 1;
1928 static const mstring bt_types
[] = {
1929 minit ("INTEGER", BT_INTEGER
),
1930 minit ("REAL", BT_REAL
),
1931 minit ("COMPLEX", BT_COMPLEX
),
1932 minit ("LOGICAL", BT_LOGICAL
),
1933 minit ("CHARACTER", BT_CHARACTER
),
1934 minit ("DERIVED", BT_DERIVED
),
1935 minit ("PROCEDURE", BT_PROCEDURE
),
1936 minit ("UNKNOWN", BT_UNKNOWN
),
1937 minit ("VOID", BT_VOID
),
1943 mio_charlen (gfc_charlen
**clp
)
1949 if (iomode
== IO_OUTPUT
)
1953 mio_expr (&cl
->length
);
1957 if (peek_atom () != ATOM_RPAREN
)
1959 cl
= gfc_get_charlen ();
1960 mio_expr (&cl
->length
);
1964 cl
->next
= gfc_current_ns
->cl_list
;
1965 gfc_current_ns
->cl_list
= cl
;
1973 /* See if a name is a generated name. */
1976 check_unique_name (const char *name
)
1978 return *name
== '@';
1983 mio_typespec (gfc_typespec
*ts
)
1987 ts
->type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
1989 if (ts
->type
!= BT_DERIVED
)
1990 mio_integer (&ts
->kind
);
1992 mio_symbol_ref (&ts
->derived
);
1994 /* Add info for C interop and is_iso_c. */
1995 mio_integer (&ts
->is_c_interop
);
1996 mio_integer (&ts
->is_iso_c
);
1998 /* If the typespec is for an identifier either from iso_c_binding, or
1999 a constant that was initialized to an identifier from it, use the
2000 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
2002 ts
->f90_type
= MIO_NAME (bt
) (ts
->f90_type
, bt_types
);
2004 ts
->f90_type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2006 if (ts
->type
!= BT_CHARACTER
)
2008 /* ts->cl is only valid for BT_CHARACTER. */
2013 mio_charlen (&ts
->cl
);
2019 static const mstring array_spec_types
[] = {
2020 minit ("EXPLICIT", AS_EXPLICIT
),
2021 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
2022 minit ("DEFERRED", AS_DEFERRED
),
2023 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
2029 mio_array_spec (gfc_array_spec
**asp
)
2036 if (iomode
== IO_OUTPUT
)
2044 if (peek_atom () == ATOM_RPAREN
)
2050 *asp
= as
= gfc_get_array_spec ();
2053 mio_integer (&as
->rank
);
2054 as
->type
= MIO_NAME (array_type
) (as
->type
, array_spec_types
);
2056 for (i
= 0; i
< as
->rank
; i
++)
2058 mio_expr (&as
->lower
[i
]);
2059 mio_expr (&as
->upper
[i
]);
2067 /* Given a pointer to an array reference structure (which lives in a
2068 gfc_ref structure), find the corresponding array specification
2069 structure. Storing the pointer in the ref structure doesn't quite
2070 work when loading from a module. Generating code for an array
2071 reference also needs more information than just the array spec. */
2073 static const mstring array_ref_types
[] = {
2074 minit ("FULL", AR_FULL
),
2075 minit ("ELEMENT", AR_ELEMENT
),
2076 minit ("SECTION", AR_SECTION
),
2082 mio_array_ref (gfc_array_ref
*ar
)
2087 ar
->type
= MIO_NAME (ar_type
) (ar
->type
, array_ref_types
);
2088 mio_integer (&ar
->dimen
);
2096 for (i
= 0; i
< ar
->dimen
; i
++)
2097 mio_expr (&ar
->start
[i
]);
2102 for (i
= 0; i
< ar
->dimen
; i
++)
2104 mio_expr (&ar
->start
[i
]);
2105 mio_expr (&ar
->end
[i
]);
2106 mio_expr (&ar
->stride
[i
]);
2112 gfc_internal_error ("mio_array_ref(): Unknown array ref");
2115 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
2116 we can't call mio_integer directly. Instead loop over each element
2117 and cast it to/from an integer. */
2118 if (iomode
== IO_OUTPUT
)
2120 for (i
= 0; i
< ar
->dimen
; i
++)
2122 int tmp
= (int)ar
->dimen_type
[i
];
2123 write_atom (ATOM_INTEGER
, &tmp
);
2128 for (i
= 0; i
< ar
->dimen
; i
++)
2130 require_atom (ATOM_INTEGER
);
2131 ar
->dimen_type
[i
] = atom_int
;
2135 if (iomode
== IO_INPUT
)
2137 ar
->where
= gfc_current_locus
;
2139 for (i
= 0; i
< ar
->dimen
; i
++)
2140 ar
->c_where
[i
] = gfc_current_locus
;
2147 /* Saves or restores a pointer. The pointer is converted back and
2148 forth from an integer. We return the pointer_info pointer so that
2149 the caller can take additional action based on the pointer type. */
2151 static pointer_info
*
2152 mio_pointer_ref (void *gp
)
2156 if (iomode
== IO_OUTPUT
)
2158 p
= get_pointer (*((char **) gp
));
2159 write_atom (ATOM_INTEGER
, &p
->integer
);
2163 require_atom (ATOM_INTEGER
);
2164 p
= add_fixup (atom_int
, gp
);
2171 /* Save and load references to components that occur within
2172 expressions. We have to describe these references by a number and
2173 by name. The number is necessary for forward references during
2174 reading, and the name is necessary if the symbol already exists in
2175 the namespace and is not loaded again. */
2178 mio_component_ref (gfc_component
**cp
, gfc_symbol
*sym
)
2180 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2184 p
= mio_pointer_ref (cp
);
2185 if (p
->type
== P_UNKNOWN
)
2186 p
->type
= P_COMPONENT
;
2188 if (iomode
== IO_OUTPUT
)
2189 mio_pool_string (&(*cp
)->name
);
2192 mio_internal_string (name
);
2194 /* It can happen that a component reference can be read before the
2195 associated derived type symbol has been loaded. Return now and
2196 wait for a later iteration of load_needed. */
2200 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
2202 /* Symbol already loaded, so search by name. */
2203 for (q
= sym
->components
; q
; q
= q
->next
)
2204 if (strcmp (q
->name
, name
) == 0)
2208 gfc_internal_error ("mio_component_ref(): Component not found");
2210 associate_integer_pointer (p
, q
);
2213 /* Make sure this symbol will eventually be loaded. */
2214 p
= find_pointer2 (sym
);
2215 if (p
->u
.rsym
.state
== UNUSED
)
2216 p
->u
.rsym
.state
= NEEDED
;
2222 mio_component (gfc_component
*c
)
2229 if (iomode
== IO_OUTPUT
)
2231 p
= get_pointer (c
);
2232 mio_integer (&p
->integer
);
2237 p
= get_integer (n
);
2238 associate_integer_pointer (p
, c
);
2241 if (p
->type
== P_UNKNOWN
)
2242 p
->type
= P_COMPONENT
;
2244 mio_pool_string (&c
->name
);
2245 mio_typespec (&c
->ts
);
2246 mio_array_spec (&c
->as
);
2248 mio_integer (&c
->dimension
);
2249 mio_integer (&c
->pointer
);
2250 mio_integer (&c
->allocatable
);
2251 c
->access
= MIO_NAME (gfc_access
) (c
->access
, access_types
);
2253 mio_expr (&c
->initializer
);
2259 mio_component_list (gfc_component
**cp
)
2261 gfc_component
*c
, *tail
;
2265 if (iomode
== IO_OUTPUT
)
2267 for (c
= *cp
; c
; c
= c
->next
)
2277 if (peek_atom () == ATOM_RPAREN
)
2280 c
= gfc_get_component ();
2297 mio_actual_arg (gfc_actual_arglist
*a
)
2300 mio_pool_string (&a
->name
);
2301 mio_expr (&a
->expr
);
2307 mio_actual_arglist (gfc_actual_arglist
**ap
)
2309 gfc_actual_arglist
*a
, *tail
;
2313 if (iomode
== IO_OUTPUT
)
2315 for (a
= *ap
; a
; a
= a
->next
)
2325 if (peek_atom () != ATOM_LPAREN
)
2328 a
= gfc_get_actual_arglist ();
2344 /* Read and write formal argument lists. */
2347 mio_formal_arglist (gfc_symbol
*sym
)
2349 gfc_formal_arglist
*f
, *tail
;
2353 if (iomode
== IO_OUTPUT
)
2355 for (f
= sym
->formal
; f
; f
= f
->next
)
2356 mio_symbol_ref (&f
->sym
);
2360 sym
->formal
= tail
= NULL
;
2362 while (peek_atom () != ATOM_RPAREN
)
2364 f
= gfc_get_formal_arglist ();
2365 mio_symbol_ref (&f
->sym
);
2367 if (sym
->formal
== NULL
)
2380 /* Save or restore a reference to a symbol node. */
2383 mio_symbol_ref (gfc_symbol
**symp
)
2387 p
= mio_pointer_ref (symp
);
2388 if (p
->type
== P_UNKNOWN
)
2391 if (iomode
== IO_OUTPUT
)
2393 if (p
->u
.wsym
.state
== UNREFERENCED
)
2394 p
->u
.wsym
.state
= NEEDS_WRITE
;
2398 if (p
->u
.rsym
.state
== UNUSED
)
2399 p
->u
.rsym
.state
= NEEDED
;
2405 /* Save or restore a reference to a symtree node. */
2408 mio_symtree_ref (gfc_symtree
**stp
)
2413 if (iomode
== IO_OUTPUT
)
2414 mio_symbol_ref (&(*stp
)->n
.sym
);
2417 require_atom (ATOM_INTEGER
);
2418 p
= get_integer (atom_int
);
2420 /* An unused equivalence member; make a symbol and a symtree
2422 if (in_load_equiv
&& p
->u
.rsym
.symtree
== NULL
)
2424 /* Since this is not used, it must have a unique name. */
2425 p
->u
.rsym
.symtree
= gfc_get_unique_symtree (gfc_current_ns
);
2427 /* Make the symbol. */
2428 if (p
->u
.rsym
.sym
== NULL
)
2430 p
->u
.rsym
.sym
= gfc_new_symbol (p
->u
.rsym
.true_name
,
2432 p
->u
.rsym
.sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
2435 p
->u
.rsym
.symtree
->n
.sym
= p
->u
.rsym
.sym
;
2436 p
->u
.rsym
.symtree
->n
.sym
->refs
++;
2437 p
->u
.rsym
.referenced
= 1;
2439 /* If the symbol is PRIVATE and in COMMON, load_commons will
2440 generate a fixup symbol, which must be associated. */
2442 resolve_fixups (p
->fixup
, p
->u
.rsym
.sym
);
2446 if (p
->type
== P_UNKNOWN
)
2449 if (p
->u
.rsym
.state
== UNUSED
)
2450 p
->u
.rsym
.state
= NEEDED
;
2452 if (p
->u
.rsym
.symtree
!= NULL
)
2454 *stp
= p
->u
.rsym
.symtree
;
2458 f
= XCNEW (fixup_t
);
2460 f
->next
= p
->u
.rsym
.stfixup
;
2461 p
->u
.rsym
.stfixup
= f
;
2463 f
->pointer
= (void **) stp
;
2470 mio_iterator (gfc_iterator
**ip
)
2476 if (iomode
== IO_OUTPUT
)
2483 if (peek_atom () == ATOM_RPAREN
)
2489 *ip
= gfc_get_iterator ();
2494 mio_expr (&iter
->var
);
2495 mio_expr (&iter
->start
);
2496 mio_expr (&iter
->end
);
2497 mio_expr (&iter
->step
);
2505 mio_constructor (gfc_constructor
**cp
)
2507 gfc_constructor
*c
, *tail
;
2511 if (iomode
== IO_OUTPUT
)
2513 for (c
= *cp
; c
; c
= c
->next
)
2516 mio_expr (&c
->expr
);
2517 mio_iterator (&c
->iterator
);
2526 while (peek_atom () != ATOM_RPAREN
)
2528 c
= gfc_get_constructor ();
2538 mio_expr (&c
->expr
);
2539 mio_iterator (&c
->iterator
);
2548 static const mstring ref_types
[] = {
2549 minit ("ARRAY", REF_ARRAY
),
2550 minit ("COMPONENT", REF_COMPONENT
),
2551 minit ("SUBSTRING", REF_SUBSTRING
),
2557 mio_ref (gfc_ref
**rp
)
2564 r
->type
= MIO_NAME (ref_type
) (r
->type
, ref_types
);
2569 mio_array_ref (&r
->u
.ar
);
2573 mio_symbol_ref (&r
->u
.c
.sym
);
2574 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2578 mio_expr (&r
->u
.ss
.start
);
2579 mio_expr (&r
->u
.ss
.end
);
2580 mio_charlen (&r
->u
.ss
.length
);
2589 mio_ref_list (gfc_ref
**rp
)
2591 gfc_ref
*ref
, *head
, *tail
;
2595 if (iomode
== IO_OUTPUT
)
2597 for (ref
= *rp
; ref
; ref
= ref
->next
)
2604 while (peek_atom () != ATOM_RPAREN
)
2607 head
= tail
= gfc_get_ref ();
2610 tail
->next
= gfc_get_ref ();
2624 /* Read and write an integer value. */
2627 mio_gmp_integer (mpz_t
*integer
)
2631 if (iomode
== IO_INPUT
)
2633 if (parse_atom () != ATOM_STRING
)
2634 bad_module ("Expected integer string");
2636 mpz_init (*integer
);
2637 if (mpz_set_str (*integer
, atom_string
, 10))
2638 bad_module ("Error converting integer");
2640 gfc_free (atom_string
);
2644 p
= mpz_get_str (NULL
, 10, *integer
);
2645 write_atom (ATOM_STRING
, p
);
2652 mio_gmp_real (mpfr_t
*real
)
2657 if (iomode
== IO_INPUT
)
2659 if (parse_atom () != ATOM_STRING
)
2660 bad_module ("Expected real string");
2663 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2664 gfc_free (atom_string
);
2668 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2670 if (mpfr_nan_p (*real
) || mpfr_inf_p (*real
))
2672 write_atom (ATOM_STRING
, p
);
2677 atom_string
= XCNEWVEC (char, strlen (p
) + 20);
2679 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2681 /* Fix negative numbers. */
2682 if (atom_string
[2] == '-')
2684 atom_string
[0] = '-';
2685 atom_string
[1] = '0';
2686 atom_string
[2] = '.';
2689 write_atom (ATOM_STRING
, atom_string
);
2691 gfc_free (atom_string
);
2697 /* Save and restore the shape of an array constructor. */
2700 mio_shape (mpz_t
**pshape
, int rank
)
2706 /* A NULL shape is represented by (). */
2709 if (iomode
== IO_OUTPUT
)
2721 if (t
== ATOM_RPAREN
)
2728 shape
= gfc_get_shape (rank
);
2732 for (n
= 0; n
< rank
; n
++)
2733 mio_gmp_integer (&shape
[n
]);
2739 static const mstring expr_types
[] = {
2740 minit ("OP", EXPR_OP
),
2741 minit ("FUNCTION", EXPR_FUNCTION
),
2742 minit ("CONSTANT", EXPR_CONSTANT
),
2743 minit ("VARIABLE", EXPR_VARIABLE
),
2744 minit ("SUBSTRING", EXPR_SUBSTRING
),
2745 minit ("STRUCTURE", EXPR_STRUCTURE
),
2746 minit ("ARRAY", EXPR_ARRAY
),
2747 minit ("NULL", EXPR_NULL
),
2751 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2752 generic operators, not in expressions. INTRINSIC_USER is also
2753 replaced by the correct function name by the time we see it. */
2755 static const mstring intrinsics
[] =
2757 minit ("UPLUS", INTRINSIC_UPLUS
),
2758 minit ("UMINUS", INTRINSIC_UMINUS
),
2759 minit ("PLUS", INTRINSIC_PLUS
),
2760 minit ("MINUS", INTRINSIC_MINUS
),
2761 minit ("TIMES", INTRINSIC_TIMES
),
2762 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2763 minit ("POWER", INTRINSIC_POWER
),
2764 minit ("CONCAT", INTRINSIC_CONCAT
),
2765 minit ("AND", INTRINSIC_AND
),
2766 minit ("OR", INTRINSIC_OR
),
2767 minit ("EQV", INTRINSIC_EQV
),
2768 minit ("NEQV", INTRINSIC_NEQV
),
2769 minit ("EQ_SIGN", INTRINSIC_EQ
),
2770 minit ("EQ", INTRINSIC_EQ_OS
),
2771 minit ("NE_SIGN", INTRINSIC_NE
),
2772 minit ("NE", INTRINSIC_NE_OS
),
2773 minit ("GT_SIGN", INTRINSIC_GT
),
2774 minit ("GT", INTRINSIC_GT_OS
),
2775 minit ("GE_SIGN", INTRINSIC_GE
),
2776 minit ("GE", INTRINSIC_GE_OS
),
2777 minit ("LT_SIGN", INTRINSIC_LT
),
2778 minit ("LT", INTRINSIC_LT_OS
),
2779 minit ("LE_SIGN", INTRINSIC_LE
),
2780 minit ("LE", INTRINSIC_LE_OS
),
2781 minit ("NOT", INTRINSIC_NOT
),
2782 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2787 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2790 fix_mio_expr (gfc_expr
*e
)
2792 gfc_symtree
*ns_st
= NULL
;
2795 if (iomode
!= IO_OUTPUT
)
2800 /* If this is a symtree for a symbol that came from a contained module
2801 namespace, it has a unique name and we should look in the current
2802 namespace to see if the required, non-contained symbol is available
2803 yet. If so, the latter should be written. */
2804 if (e
->symtree
->n
.sym
&& check_unique_name (e
->symtree
->name
))
2805 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2806 e
->symtree
->n
.sym
->name
);
2808 /* On the other hand, if the existing symbol is the module name or the
2809 new symbol is a dummy argument, do not do the promotion. */
2810 if (ns_st
&& ns_st
->n
.sym
2811 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2812 && !e
->symtree
->n
.sym
->attr
.dummy
)
2815 else if (e
->expr_type
== EXPR_FUNCTION
&& e
->value
.function
.name
)
2817 /* In some circumstances, a function used in an initialization
2818 expression, in one use associated module, can fail to be
2819 coupled to its symtree when used in a specification
2820 expression in another module. */
2821 fname
= e
->value
.function
.esym
? e
->value
.function
.esym
->name
2822 : e
->value
.function
.isym
->name
;
2823 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2828 /* Read and write expressions. The form "()" is allowed to indicate a
2832 mio_expr (gfc_expr
**ep
)
2840 if (iomode
== IO_OUTPUT
)
2849 MIO_NAME (expr_t
) (e
->expr_type
, expr_types
);
2854 if (t
== ATOM_RPAREN
)
2861 bad_module ("Expected expression type");
2863 e
= *ep
= gfc_get_expr ();
2864 e
->where
= gfc_current_locus
;
2865 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2868 mio_typespec (&e
->ts
);
2869 mio_integer (&e
->rank
);
2873 switch (e
->expr_type
)
2876 e
->value
.op
.operator
2877 = MIO_NAME (gfc_intrinsic_op
) (e
->value
.op
.operator, intrinsics
);
2879 switch (e
->value
.op
.operator)
2881 case INTRINSIC_UPLUS
:
2882 case INTRINSIC_UMINUS
:
2884 case INTRINSIC_PARENTHESES
:
2885 mio_expr (&e
->value
.op
.op1
);
2888 case INTRINSIC_PLUS
:
2889 case INTRINSIC_MINUS
:
2890 case INTRINSIC_TIMES
:
2891 case INTRINSIC_DIVIDE
:
2892 case INTRINSIC_POWER
:
2893 case INTRINSIC_CONCAT
:
2897 case INTRINSIC_NEQV
:
2899 case INTRINSIC_EQ_OS
:
2901 case INTRINSIC_NE_OS
:
2903 case INTRINSIC_GT_OS
:
2905 case INTRINSIC_GE_OS
:
2907 case INTRINSIC_LT_OS
:
2909 case INTRINSIC_LE_OS
:
2910 mio_expr (&e
->value
.op
.op1
);
2911 mio_expr (&e
->value
.op
.op2
);
2915 bad_module ("Bad operator");
2921 mio_symtree_ref (&e
->symtree
);
2922 mio_actual_arglist (&e
->value
.function
.actual
);
2924 if (iomode
== IO_OUTPUT
)
2926 e
->value
.function
.name
2927 = mio_allocated_string (e
->value
.function
.name
);
2928 flag
= e
->value
.function
.esym
!= NULL
;
2929 mio_integer (&flag
);
2931 mio_symbol_ref (&e
->value
.function
.esym
);
2933 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
2937 require_atom (ATOM_STRING
);
2938 e
->value
.function
.name
= gfc_get_string (atom_string
);
2939 gfc_free (atom_string
);
2941 mio_integer (&flag
);
2943 mio_symbol_ref (&e
->value
.function
.esym
);
2946 require_atom (ATOM_STRING
);
2947 e
->value
.function
.isym
= gfc_find_function (atom_string
);
2948 gfc_free (atom_string
);
2955 mio_symtree_ref (&e
->symtree
);
2956 mio_ref_list (&e
->ref
);
2959 case EXPR_SUBSTRING
:
2960 e
->value
.character
.string
2961 = CONST_CAST (gfc_char_t
*,
2962 mio_allocated_wide_string (e
->value
.character
.string
,
2963 e
->value
.character
.length
));
2964 mio_ref_list (&e
->ref
);
2967 case EXPR_STRUCTURE
:
2969 mio_constructor (&e
->value
.constructor
);
2970 mio_shape (&e
->shape
, e
->rank
);
2977 mio_gmp_integer (&e
->value
.integer
);
2981 gfc_set_model_kind (e
->ts
.kind
);
2982 mio_gmp_real (&e
->value
.real
);
2986 gfc_set_model_kind (e
->ts
.kind
);
2987 mio_gmp_real (&e
->value
.complex.r
);
2988 mio_gmp_real (&e
->value
.complex.i
);
2992 mio_integer (&e
->value
.logical
);
2996 mio_integer (&e
->value
.character
.length
);
2997 e
->value
.character
.string
2998 = CONST_CAST (gfc_char_t
*,
2999 mio_allocated_wide_string (e
->value
.character
.string
,
3000 e
->value
.character
.length
));
3004 bad_module ("Bad type in constant expression");
3017 /* Read and write namelists. */
3020 mio_namelist (gfc_symbol
*sym
)
3022 gfc_namelist
*n
, *m
;
3023 const char *check_name
;
3027 if (iomode
== IO_OUTPUT
)
3029 for (n
= sym
->namelist
; n
; n
= n
->next
)
3030 mio_symbol_ref (&n
->sym
);
3034 /* This departure from the standard is flagged as an error.
3035 It does, in fact, work correctly. TODO: Allow it
3037 if (sym
->attr
.flavor
== FL_NAMELIST
)
3039 check_name
= find_use_name (sym
->name
, false);
3040 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
3041 gfc_error ("Namelist %s cannot be renamed by USE "
3042 "association to %s", sym
->name
, check_name
);
3046 while (peek_atom () != ATOM_RPAREN
)
3048 n
= gfc_get_namelist ();
3049 mio_symbol_ref (&n
->sym
);
3051 if (sym
->namelist
== NULL
)
3058 sym
->namelist_tail
= m
;
3065 /* Save/restore lists of gfc_interface stuctures. When loading an
3066 interface, we are really appending to the existing list of
3067 interfaces. Checking for duplicate and ambiguous interfaces has to
3068 be done later when all symbols have been loaded. */
3071 mio_interface_rest (gfc_interface
**ip
)
3073 gfc_interface
*tail
, *p
;
3074 pointer_info
*pi
= NULL
;
3076 if (iomode
== IO_OUTPUT
)
3079 for (p
= *ip
; p
; p
= p
->next
)
3080 mio_symbol_ref (&p
->sym
);
3095 if (peek_atom () == ATOM_RPAREN
)
3098 p
= gfc_get_interface ();
3099 p
->where
= gfc_current_locus
;
3100 pi
= mio_symbol_ref (&p
->sym
);
3116 /* Save/restore a nameless operator interface. */
3119 mio_interface (gfc_interface
**ip
)
3122 mio_interface_rest (ip
);
3126 /* Save/restore a named operator interface. */
3129 mio_symbol_interface (const char **name
, const char **module
,
3133 mio_pool_string (name
);
3134 mio_pool_string (module
);
3135 mio_interface_rest (ip
);
3140 mio_namespace_ref (gfc_namespace
**nsp
)
3145 p
= mio_pointer_ref (nsp
);
3147 if (p
->type
== P_UNKNOWN
)
3148 p
->type
= P_NAMESPACE
;
3150 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
3152 ns
= (gfc_namespace
*) p
->u
.pointer
;
3155 ns
= gfc_get_namespace (NULL
, 0);
3156 associate_integer_pointer (p
, ns
);
3164 /* Unlike most other routines, the address of the symbol node is already
3165 fixed on input and the name/module has already been filled in. */
3168 mio_symbol (gfc_symbol
*sym
)
3170 int intmod
= INTMOD_NONE
;
3172 gfc_formal_arglist
*formal
;
3176 mio_symbol_attribute (&sym
->attr
);
3177 mio_typespec (&sym
->ts
);
3179 /* Contained procedures don't have formal namespaces. Instead we output the
3180 procedure namespace. The will contain the formal arguments. */
3181 if (iomode
== IO_OUTPUT
)
3183 formal
= sym
->formal
;
3184 while (formal
&& !formal
->sym
)
3185 formal
= formal
->next
;
3188 mio_namespace_ref (&formal
->sym
->ns
);
3190 mio_namespace_ref (&sym
->formal_ns
);
3194 mio_namespace_ref (&sym
->formal_ns
);
3197 sym
->formal_ns
->proc_name
= sym
;
3202 /* Save/restore common block links. */
3203 mio_symbol_ref (&sym
->common_next
);
3205 mio_formal_arglist (sym
);
3207 if (sym
->attr
.flavor
== FL_PARAMETER
)
3208 mio_expr (&sym
->value
);
3210 mio_array_spec (&sym
->as
);
3212 mio_symbol_ref (&sym
->result
);
3214 if (sym
->attr
.cray_pointee
)
3215 mio_symbol_ref (&sym
->cp_pointer
);
3217 /* Note that components are always saved, even if they are supposed
3218 to be private. Component access is checked during searching. */
3220 mio_component_list (&sym
->components
);
3222 if (sym
->components
!= NULL
)
3223 sym
->component_access
3224 = MIO_NAME (gfc_access
) (sym
->component_access
, access_types
);
3228 /* Add the fields that say whether this is from an intrinsic module,
3229 and if so, what symbol it is within the module. */
3230 /* mio_integer (&(sym->from_intmod)); */
3231 if (iomode
== IO_OUTPUT
)
3233 intmod
= sym
->from_intmod
;
3234 mio_integer (&intmod
);
3238 mio_integer (&intmod
);
3239 sym
->from_intmod
= intmod
;
3242 mio_integer (&(sym
->intmod_sym_id
));
3248 /************************* Top level subroutines *************************/
3250 /* Given a root symtree node and a symbol, try to find a symtree that
3251 references the symbol that is not a unique name. */
3253 static gfc_symtree
*
3254 find_symtree_for_symbol (gfc_symtree
*st
, gfc_symbol
*sym
)
3256 gfc_symtree
*s
= NULL
;
3261 s
= find_symtree_for_symbol (st
->right
, sym
);
3264 s
= find_symtree_for_symbol (st
->left
, sym
);
3268 if (st
->n
.sym
== sym
&& !check_unique_name (st
->name
))
3275 /* A recursive function to look for a speficic symbol by name and by
3276 module. Whilst several symtrees might point to one symbol, its
3277 is sufficient for the purposes here than one exist. Note that
3278 generic interfaces are distinguished as are symbols that have been
3279 renamed in another module. */
3280 static gfc_symtree
*
3281 find_symbol (gfc_symtree
*st
, const char *name
,
3282 const char *module
, int generic
)
3285 gfc_symtree
*retval
, *s
;
3287 if (st
== NULL
|| st
->n
.sym
== NULL
)
3290 c
= strcmp (name
, st
->n
.sym
->name
);
3291 if (c
== 0 && st
->n
.sym
->module
3292 && strcmp (module
, st
->n
.sym
->module
) == 0
3293 && !check_unique_name (st
->name
))
3295 s
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3297 /* Detect symbols that are renamed by use association in another
3298 module by the absence of a symtree and null attr.use_rename,
3299 since the latter is not transmitted in the module file. */
3300 if (((!generic
&& !st
->n
.sym
->attr
.generic
)
3301 || (generic
&& st
->n
.sym
->attr
.generic
))
3302 && !(s
== NULL
&& !st
->n
.sym
->attr
.use_rename
))
3306 retval
= find_symbol (st
->left
, name
, module
, generic
);
3309 retval
= find_symbol (st
->right
, name
, module
, generic
);
3315 /* Skip a list between balanced left and right parens. */
3325 switch (parse_atom ())
3336 gfc_free (atom_string
);
3348 /* Load operator interfaces from the module. Interfaces are unusual
3349 in that they attach themselves to existing symbols. */
3352 load_operator_interfaces (void)
3355 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3357 pointer_info
*pi
= NULL
;
3362 while (peek_atom () != ATOM_RPAREN
)
3366 mio_internal_string (name
);
3367 mio_internal_string (module
);
3369 n
= number_use_names (name
, true);
3372 for (i
= 1; i
<= n
; i
++)
3374 /* Decide if we need to load this one or not. */
3375 p
= find_use_name_n (name
, &i
, true);
3379 while (parse_atom () != ATOM_RPAREN
);
3385 uop
= gfc_get_uop (p
);
3386 pi
= mio_interface_rest (&uop
->operator);
3390 if (gfc_find_uop (p
, NULL
))
3392 uop
= gfc_get_uop (p
);
3393 uop
->operator = gfc_get_interface ();
3394 uop
->operator->where
= gfc_current_locus
;
3395 add_fixup (pi
->integer
, &uop
->operator->sym
);
3404 /* Load interfaces from the module. Interfaces are unusual in that
3405 they attach themselves to existing symbols. */
3408 load_generic_interfaces (void)
3411 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3413 gfc_interface
*generic
= NULL
;
3418 while (peek_atom () != ATOM_RPAREN
)
3422 mio_internal_string (name
);
3423 mio_internal_string (module
);
3425 n
= number_use_names (name
, false);
3426 renamed
= n
? 1 : 0;
3429 for (i
= 1; i
<= n
; i
++)
3432 /* Decide if we need to load this one or not. */
3433 p
= find_use_name_n (name
, &i
, false);
3435 st
= find_symbol (gfc_current_ns
->sym_root
,
3436 name
, module_name
, 1);
3438 if (!p
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
3440 /* Skip the specific names for these cases. */
3441 while (i
== 1 && parse_atom () != ATOM_RPAREN
);
3446 /* If the symbol exists already and is being USEd without being
3447 in an ONLY clause, do not load a new symtree(11.3.2). */
3448 if (!only_flag
&& st
)
3453 /* Make the symbol inaccessible if it has been added by a USE
3454 statement without an ONLY(11.3.2). */
3456 && !st
->n
.sym
->attr
.use_only
3457 && !st
->n
.sym
->attr
.use_rename
3458 && strcmp (st
->n
.sym
->module
, module_name
) == 0)
3461 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3462 st
= gfc_get_unique_symtree (gfc_current_ns
);
3469 if (strcmp (st
->name
, p
) != 0)
3471 st
= gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3477 /* Since we haven't found a valid generic interface, we had
3481 gfc_get_symbol (p
, NULL
, &sym
);
3482 sym
->name
= gfc_get_string (name
);
3483 sym
->module
= gfc_get_string (module_name
);
3484 sym
->attr
.flavor
= FL_PROCEDURE
;
3485 sym
->attr
.generic
= 1;
3486 sym
->attr
.use_assoc
= 1;
3491 /* Unless sym is a generic interface, this reference
3494 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3498 if (st
&& !sym
->attr
.generic
3500 && strcmp(module
, sym
->module
))
3504 sym
->attr
.use_only
= only_flag
;
3505 sym
->attr
.use_rename
= renamed
;
3509 mio_interface_rest (&sym
->generic
);
3510 generic
= sym
->generic
;
3512 else if (!sym
->generic
)
3514 sym
->generic
= generic
;
3515 sym
->attr
.generic_copy
= 1;
3524 /* Load common blocks. */
3529 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3534 while (peek_atom () != ATOM_RPAREN
)
3538 mio_internal_string (name
);
3540 p
= gfc_get_common (name
, 1);
3542 mio_symbol_ref (&p
->head
);
3543 mio_integer (&flags
);
3547 p
->threadprivate
= 1;
3550 /* Get whether this was a bind(c) common or not. */
3551 mio_integer (&p
->is_bind_c
);
3552 /* Get the binding label. */
3553 mio_internal_string (p
->binding_label
);
3562 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3563 so that unused variables are not loaded and so that the expression can
3569 gfc_equiv
*head
, *tail
, *end
, *eq
;
3573 in_load_equiv
= true;
3575 end
= gfc_current_ns
->equiv
;
3576 while (end
!= NULL
&& end
->next
!= NULL
)
3579 while (peek_atom () != ATOM_RPAREN
) {
3583 while(peek_atom () != ATOM_RPAREN
)
3586 head
= tail
= gfc_get_equiv ();
3589 tail
->eq
= gfc_get_equiv ();
3593 mio_pool_string (&tail
->module
);
3594 mio_expr (&tail
->expr
);
3597 /* Unused equivalence members have a unique name. */
3599 for (eq
= head
; eq
; eq
= eq
->eq
)
3601 if (!check_unique_name (eq
->expr
->symtree
->name
))
3610 for (eq
= head
; eq
; eq
= head
)
3613 gfc_free_expr (eq
->expr
);
3619 gfc_current_ns
->equiv
= head
;
3630 in_load_equiv
= false;
3634 /* Recursive function to traverse the pointer_info tree and load a
3635 needed symbol. We return nonzero if we load a symbol and stop the
3636 traversal, because the act of loading can alter the tree. */
3639 load_needed (pointer_info
*p
)
3650 rv
|= load_needed (p
->left
);
3651 rv
|= load_needed (p
->right
);
3653 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
3656 p
->u
.rsym
.state
= USED
;
3658 set_module_locus (&p
->u
.rsym
.where
);
3660 sym
= p
->u
.rsym
.sym
;
3663 q
= get_integer (p
->u
.rsym
.ns
);
3665 ns
= (gfc_namespace
*) q
->u
.pointer
;
3668 /* Create an interface namespace if necessary. These are
3669 the namespaces that hold the formal parameters of module
3672 ns
= gfc_get_namespace (NULL
, 0);
3673 associate_integer_pointer (q
, ns
);
3676 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
3677 doesn't go pear-shaped if the symbol is used. */
3679 gfc_find_symbol (p
->u
.rsym
.module
, gfc_current_ns
,
3682 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
3683 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
3684 strcpy (sym
->binding_label
, p
->u
.rsym
.binding_label
);
3686 associate_integer_pointer (p
, sym
);
3690 sym
->attr
.use_assoc
= 1;
3692 sym
->attr
.use_only
= 1;
3693 if (p
->u
.rsym
.renamed
)
3694 sym
->attr
.use_rename
= 1;
3700 /* Recursive function for cleaning up things after a module has been read. */
3703 read_cleanup (pointer_info
*p
)
3711 read_cleanup (p
->left
);
3712 read_cleanup (p
->right
);
3714 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
3716 /* Add hidden symbols to the symtree. */
3717 q
= get_integer (p
->u
.rsym
.ns
);
3718 st
= gfc_get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
3720 st
->n
.sym
= p
->u
.rsym
.sym
;
3723 /* Fixup any symtree references. */
3724 p
->u
.rsym
.symtree
= st
;
3725 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
3726 p
->u
.rsym
.stfixup
= NULL
;
3729 /* Free unused symbols. */
3730 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
3731 gfc_free_symbol (p
->u
.rsym
.sym
);
3735 /* Read a module file. */
3740 module_locus operator_interfaces
, user_operators
;
3742 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3744 int ambiguous
, j
, nuse
, symbol
;
3745 pointer_info
*info
, *q
;
3750 get_module_locus (&operator_interfaces
); /* Skip these for now. */
3753 get_module_locus (&user_operators
);
3757 /* Skip commons and equivalences for now. */
3763 /* Create the fixup nodes for all the symbols. */
3765 while (peek_atom () != ATOM_RPAREN
)
3767 require_atom (ATOM_INTEGER
);
3768 info
= get_integer (atom_int
);
3770 info
->type
= P_SYMBOL
;
3771 info
->u
.rsym
.state
= UNUSED
;
3773 mio_internal_string (info
->u
.rsym
.true_name
);
3774 mio_internal_string (info
->u
.rsym
.module
);
3775 mio_internal_string (info
->u
.rsym
.binding_label
);
3778 require_atom (ATOM_INTEGER
);
3779 info
->u
.rsym
.ns
= atom_int
;
3781 get_module_locus (&info
->u
.rsym
.where
);
3784 /* See if the symbol has already been loaded by a previous module.
3785 If so, we reference the existing symbol and prevent it from
3786 being loaded again. This should not happen if the symbol being
3787 read is an index for an assumed shape dummy array (ns != 1). */
3789 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
3792 || (sym
->attr
.flavor
== FL_VARIABLE
&& info
->u
.rsym
.ns
!=1))
3795 info
->u
.rsym
.state
= USED
;
3796 info
->u
.rsym
.sym
= sym
;
3798 /* Some symbols do not have a namespace (eg. formal arguments),
3799 so the automatic "unique symtree" mechanism must be suppressed
3800 by marking them as referenced. */
3801 q
= get_integer (info
->u
.rsym
.ns
);
3802 if (q
->u
.pointer
== NULL
)
3804 info
->u
.rsym
.referenced
= 1;
3808 /* If possible recycle the symtree that references the symbol.
3809 If a symtree is not found and the module does not import one,
3810 a unique-name symtree is found by read_cleanup. */
3811 st
= find_symtree_for_symbol (gfc_current_ns
->sym_root
, sym
);
3814 info
->u
.rsym
.symtree
= st
;
3815 info
->u
.rsym
.referenced
= 1;
3821 /* Parse the symtree lists. This lets us mark which symbols need to
3822 be loaded. Renaming is also done at this point by replacing the
3827 while (peek_atom () != ATOM_RPAREN
)
3829 mio_internal_string (name
);
3830 mio_integer (&ambiguous
);
3831 mio_integer (&symbol
);
3833 info
= get_integer (symbol
);
3835 /* See how many use names there are. If none, go through the start
3836 of the loop at least once. */
3837 nuse
= number_use_names (name
, false);
3838 info
->u
.rsym
.renamed
= nuse
? 1 : 0;
3843 for (j
= 1; j
<= nuse
; j
++)
3845 /* Get the jth local name for this symbol. */
3846 p
= find_use_name_n (name
, &j
, false);
3848 if (p
== NULL
&& strcmp (name
, module_name
) == 0)
3851 /* Skip symtree nodes not in an ONLY clause, unless there
3852 is an existing symtree loaded from another USE statement. */
3855 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3857 info
->u
.rsym
.symtree
= st
;
3861 /* If a symbol of the same name and module exists already,
3862 this symbol, which is not in an ONLY clause, must not be
3863 added to the namespace(11.3.2). Note that find_symbol
3864 only returns the first occurrence that it finds. */
3865 if (!only_flag
&& !info
->u
.rsym
.renamed
3866 && strcmp (name
, module_name
) != 0
3867 && find_symbol (gfc_current_ns
->sym_root
, name
,
3871 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3875 /* Check for ambiguous symbols. */
3876 if (st
->n
.sym
!= info
->u
.rsym
.sym
)
3878 info
->u
.rsym
.symtree
= st
;
3882 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3884 /* Delete the symtree if the symbol has been added by a USE
3885 statement without an ONLY(11.3.2). Remember that the rsym
3886 will be the same as the symbol found in the symtree, for
3888 if (st
&& (only_flag
|| info
->u
.rsym
.renamed
)
3889 && !st
->n
.sym
->attr
.use_only
3890 && !st
->n
.sym
->attr
.use_rename
3891 && info
->u
.rsym
.sym
== st
->n
.sym
)
3892 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3894 /* Create a symtree node in the current namespace for this
3896 st
= check_unique_name (p
)
3897 ? gfc_get_unique_symtree (gfc_current_ns
)
3898 : gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3899 st
->ambiguous
= ambiguous
;
3901 sym
= info
->u
.rsym
.sym
;
3903 /* Create a symbol node if it doesn't already exist. */
3906 info
->u
.rsym
.sym
= gfc_new_symbol (info
->u
.rsym
.true_name
,
3908 sym
= info
->u
.rsym
.sym
;
3909 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
3911 /* TODO: hmm, can we test this? Do we know it will be
3912 initialized to zeros? */
3913 if (info
->u
.rsym
.binding_label
[0] != '\0')
3914 strcpy (sym
->binding_label
, info
->u
.rsym
.binding_label
);
3920 if (strcmp (name
, p
) != 0)
3921 sym
->attr
.use_rename
= 1;
3923 /* Store the symtree pointing to this symbol. */
3924 info
->u
.rsym
.symtree
= st
;
3926 if (info
->u
.rsym
.state
== UNUSED
)
3927 info
->u
.rsym
.state
= NEEDED
;
3928 info
->u
.rsym
.referenced
= 1;
3935 /* Load intrinsic operator interfaces. */
3936 set_module_locus (&operator_interfaces
);
3939 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3941 if (i
== INTRINSIC_USER
)
3946 u
= find_use_operator (i
);
3957 mio_interface (&gfc_current_ns
->operator[i
]);
3962 /* Load generic and user operator interfaces. These must follow the
3963 loading of symtree because otherwise symbols can be marked as
3966 set_module_locus (&user_operators
);
3968 load_operator_interfaces ();
3969 load_generic_interfaces ();
3974 /* At this point, we read those symbols that are needed but haven't
3975 been loaded yet. If one symbol requires another, the other gets
3976 marked as NEEDED if its previous state was UNUSED. */
3978 while (load_needed (pi_root
));
3980 /* Make sure all elements of the rename-list were found in the module. */
3982 for (u
= gfc_rename_list
; u
; u
= u
->next
)
3987 if (u
->operator == INTRINSIC_NONE
)
3989 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3990 u
->use_name
, &u
->where
, module_name
);
3994 if (u
->operator == INTRINSIC_USER
)
3996 gfc_error ("User operator '%s' referenced at %L not found "
3997 "in module '%s'", u
->use_name
, &u
->where
, module_name
);
4001 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
4002 "in module '%s'", gfc_op2string (u
->operator), &u
->where
,
4006 gfc_check_interfaces (gfc_current_ns
);
4008 /* Clean up symbol nodes that were never loaded, create references
4009 to hidden symbols. */
4011 read_cleanup (pi_root
);
4015 /* Given an access type that is specific to an entity and the default
4016 access, return nonzero if the entity is publicly accessible. If the
4017 element is declared as PUBLIC, then it is public; if declared
4018 PRIVATE, then private, and otherwise it is public unless the default
4019 access in this context has been declared PRIVATE. */
4022 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
4024 if (specific_access
== ACCESS_PUBLIC
)
4026 if (specific_access
== ACCESS_PRIVATE
)
4029 if (gfc_option
.flag_module_private
)
4030 return default_access
== ACCESS_PUBLIC
;
4032 return default_access
!= ACCESS_PRIVATE
;
4036 /* A structure to remember which commons we've already written. */
4038 struct written_common
4040 BBT_HEADER(written_common
);
4041 const char *name
, *label
;
4044 static struct written_common
*written_commons
= NULL
;
4046 /* Comparison function used for balancing the binary tree. */
4049 compare_written_commons (void *a1
, void *b1
)
4051 const char *aname
= ((struct written_common
*) a1
)->name
;
4052 const char *alabel
= ((struct written_common
*) a1
)->label
;
4053 const char *bname
= ((struct written_common
*) b1
)->name
;
4054 const char *blabel
= ((struct written_common
*) b1
)->label
;
4055 int c
= strcmp (aname
, bname
);
4057 return (c
!= 0 ? c
: strcmp (alabel
, blabel
));
4060 /* Free a list of written commons. */
4063 free_written_common (struct written_common
*w
)
4069 free_written_common (w
->left
);
4071 free_written_common (w
->right
);
4076 /* Write a common block to the module -- recursive helper function. */
4079 write_common_0 (gfc_symtree
*st
)
4085 struct written_common
*w
;
4086 bool write_me
= true;
4091 write_common_0 (st
->left
);
4093 /* We will write out the binding label, or the name if no label given. */
4094 name
= st
->n
.common
->name
;
4096 label
= p
->is_bind_c
? p
->binding_label
: p
->name
;
4098 /* Check if we've already output this common. */
4099 w
= written_commons
;
4102 int c
= strcmp (name
, w
->name
);
4103 c
= (c
!= 0 ? c
: strcmp (label
, w
->label
));
4107 w
= (c
< 0) ? w
->left
: w
->right
;
4112 /* Write the common to the module. */
4114 mio_pool_string (&name
);
4116 mio_symbol_ref (&p
->head
);
4117 flags
= p
->saved
? 1 : 0;
4118 if (p
->threadprivate
)
4120 mio_integer (&flags
);
4122 /* Write out whether the common block is bind(c) or not. */
4123 mio_integer (&(p
->is_bind_c
));
4125 mio_pool_string (&label
);
4128 /* Record that we have written this common. */
4129 w
= XCNEW (struct written_common
);
4132 gfc_insert_bbt (&written_commons
, w
, compare_written_commons
);
4135 write_common_0 (st
->right
);
4139 /* Write a common, by initializing the list of written commons, calling
4140 the recursive function write_common_0() and cleaning up afterwards. */
4143 write_common (gfc_symtree
*st
)
4145 written_commons
= NULL
;
4146 write_common_0 (st
);
4147 free_written_common (written_commons
);
4148 written_commons
= NULL
;
4152 /* Write the blank common block to the module. */
4155 write_blank_common (void)
4157 const char * name
= BLANK_COMMON_NAME
;
4159 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4160 this, but it hasn't been checked. Just making it so for now. */
4163 if (gfc_current_ns
->blank_common
.head
== NULL
)
4168 mio_pool_string (&name
);
4170 mio_symbol_ref (&gfc_current_ns
->blank_common
.head
);
4171 saved
= gfc_current_ns
->blank_common
.saved
;
4172 mio_integer (&saved
);
4174 /* Write out whether the common block is bind(c) or not. */
4175 mio_integer (&is_bind_c
);
4177 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4178 it doesn't matter because the label isn't used. */
4179 mio_pool_string (&name
);
4185 /* Write equivalences to the module. */
4194 for (eq
= gfc_current_ns
->equiv
; eq
; eq
= eq
->next
)
4198 for (e
= eq
; e
; e
= e
->eq
)
4200 if (e
->module
== NULL
)
4201 e
->module
= gfc_get_string ("%s.eq.%d", module_name
, num
);
4202 mio_allocated_string (e
->module
);
4203 mio_expr (&e
->expr
);
4212 /* Write a symbol to the module. */
4215 write_symbol (int n
, gfc_symbol
*sym
)
4219 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
4220 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
4223 mio_pool_string (&sym
->name
);
4225 mio_pool_string (&sym
->module
);
4226 if (sym
->attr
.is_bind_c
|| sym
->attr
.is_iso_c
)
4228 label
= sym
->binding_label
;
4229 mio_pool_string (&label
);
4232 mio_pool_string (&sym
->name
);
4234 mio_pointer_ref (&sym
->ns
);
4241 /* Recursive traversal function to write the initial set of symbols to
4242 the module. We check to see if the symbol should be written
4243 according to the access specification. */
4246 write_symbol0 (gfc_symtree
*st
)
4250 bool dont_write
= false;
4255 write_symbol0 (st
->left
);
4258 if (sym
->module
== NULL
)
4259 sym
->module
= gfc_get_string (module_name
);
4261 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4262 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
4265 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4270 p
= get_pointer (sym
);
4271 if (p
->type
== P_UNKNOWN
)
4274 if (p
->u
.wsym
.state
!= WRITTEN
)
4276 write_symbol (p
->integer
, sym
);
4277 p
->u
.wsym
.state
= WRITTEN
;
4281 write_symbol0 (st
->right
);
4285 /* Recursive traversal function to write the secondary set of symbols
4286 to the module file. These are symbols that were not public yet are
4287 needed by the public symbols or another dependent symbol. The act
4288 of writing a symbol can modify the pointer_info tree, so we cease
4289 traversal if we find a symbol to write. We return nonzero if a
4290 symbol was written and pass that information upwards. */
4293 write_symbol1 (pointer_info
*p
)
4300 result
= write_symbol1 (p
->left
);
4302 if (!(p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
))
4304 p
->u
.wsym
.state
= WRITTEN
;
4305 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
4309 result
|= write_symbol1 (p
->right
);
4314 /* Write operator interfaces associated with a symbol. */
4317 write_operator (gfc_user_op
*uop
)
4319 static char nullstring
[] = "";
4320 const char *p
= nullstring
;
4322 if (uop
->operator == NULL
4323 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
4326 mio_symbol_interface (&uop
->name
, &p
, &uop
->operator);
4330 /* Write generic interfaces from the namespace sym_root. */
4333 write_generic (gfc_symtree
*st
)
4340 write_generic (st
->left
);
4341 write_generic (st
->right
);
4344 if (!sym
|| check_unique_name (st
->name
))
4347 if (sym
->generic
== NULL
4348 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4351 if (sym
->module
== NULL
)
4352 sym
->module
= gfc_get_string (module_name
);
4354 mio_symbol_interface (&st
->name
, &sym
->module
, &sym
->generic
);
4359 write_symtree (gfc_symtree
*st
)
4365 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
4366 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4367 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
4370 if (check_unique_name (st
->name
))
4373 p
= find_pointer (sym
);
4375 gfc_internal_error ("write_symtree(): Symbol not written");
4377 mio_pool_string (&st
->name
);
4378 mio_integer (&st
->ambiguous
);
4379 mio_integer (&p
->integer
);
4388 /* Write the operator interfaces. */
4391 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4393 if (i
== INTRINSIC_USER
)
4396 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
4397 gfc_current_ns
->default_access
)
4398 ? &gfc_current_ns
->operator[i
] : NULL
);
4406 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
4412 write_generic (gfc_current_ns
->sym_root
);
4418 write_blank_common ();
4419 write_common (gfc_current_ns
->common_root
);
4430 /* Write symbol information. First we traverse all symbols in the
4431 primary namespace, writing those that need to be written.
4432 Sometimes writing one symbol will cause another to need to be
4433 written. A list of these symbols ends up on the write stack, and
4434 we end by popping the bottom of the stack and writing the symbol
4435 until the stack is empty. */
4439 write_symbol0 (gfc_current_ns
->sym_root
);
4440 while (write_symbol1 (pi_root
))
4449 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
4454 /* Read a MD5 sum from the header of a module file. If the file cannot
4455 be opened, or we have any other error, we return -1. */
4458 read_md5_from_module_file (const char * filename
, unsigned char md5
[16])
4464 /* Open the file. */
4465 if ((file
= fopen (filename
, "r")) == NULL
)
4468 /* Read two lines. */
4469 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
4470 || fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
4476 /* Close the file. */
4479 /* If the header is not what we expect, or is too short, bail out. */
4480 if (strncmp (buf
, "MD5:", 4) != 0 || strlen (buf
) < 4 + 16)
4483 /* Now, we have a real MD5, read it into the array. */
4484 for (n
= 0; n
< 16; n
++)
4488 if (sscanf (&(buf
[4+2*n
]), "%02x", &x
) != 1)
4498 /* Given module, dump it to disk. If there was an error while
4499 processing the module, dump_flag will be set to zero and we delete
4500 the module file, even if it was already there. */
4503 gfc_dump_module (const char *name
, int dump_flag
)
4506 char *filename
, *filename_tmp
, *p
;
4509 unsigned char md5_new
[16], md5_old
[16];
4511 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
4512 if (gfc_option
.module_dir
!= NULL
)
4514 n
+= strlen (gfc_option
.module_dir
);
4515 filename
= (char *) alloca (n
);
4516 strcpy (filename
, gfc_option
.module_dir
);
4517 strcat (filename
, name
);
4521 filename
= (char *) alloca (n
);
4522 strcpy (filename
, name
);
4524 strcat (filename
, MODULE_EXTENSION
);
4526 /* Name of the temporary file used to write the module. */
4527 filename_tmp
= (char *) alloca (n
+ 1);
4528 strcpy (filename_tmp
, filename
);
4529 strcat (filename_tmp
, "0");
4531 /* There was an error while processing the module. We delete the
4532 module file, even if it was already there. */
4539 /* Write the module to the temporary file. */
4540 module_fp
= fopen (filename_tmp
, "w");
4541 if (module_fp
== NULL
)
4542 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
4543 filename_tmp
, strerror (errno
));
4545 /* Write the header, including space reserved for the MD5 sum. */
4549 *strchr (p
, '\n') = '\0';
4551 fprintf (module_fp
, "GFORTRAN module created from %s on %s\nMD5:",
4552 gfc_source_file
, p
);
4553 fgetpos (module_fp
, &md5_pos
);
4554 fputs ("00000000000000000000000000000000 -- "
4555 "If you edit this, you'll get what you deserve.\n\n", module_fp
);
4557 /* Initialize the MD5 context that will be used for output. */
4558 md5_init_ctx (&ctx
);
4560 /* Write the module itself. */
4562 strcpy (module_name
, name
);
4568 free_pi_tree (pi_root
);
4573 /* Write the MD5 sum to the header of the module file. */
4574 md5_finish_ctx (&ctx
, md5_new
);
4575 fsetpos (module_fp
, &md5_pos
);
4576 for (n
= 0; n
< 16; n
++)
4577 fprintf (module_fp
, "%02x", md5_new
[n
]);
4579 if (fclose (module_fp
))
4580 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
4581 filename_tmp
, strerror (errno
));
4583 /* Read the MD5 from the header of the old module file and compare. */
4584 if (read_md5_from_module_file (filename
, md5_old
) != 0
4585 || memcmp (md5_old
, md5_new
, sizeof (md5_old
)) != 0)
4587 /* Module file have changed, replace the old one. */
4589 rename (filename_tmp
, filename
);
4592 unlink (filename_tmp
);
4597 sort_iso_c_rename_list (void)
4599 gfc_use_rename
*tmp_list
= NULL
;
4600 gfc_use_rename
*curr
;
4601 gfc_use_rename
*kinds_used
[ISOCBINDING_NUMBER
] = {NULL
};
4605 for (curr
= gfc_rename_list
; curr
; curr
= curr
->next
)
4607 c_kind
= get_c_kind (curr
->use_name
, c_interop_kinds_table
);
4608 if (c_kind
== ISOCBINDING_INVALID
|| c_kind
== ISOCBINDING_LAST
)
4610 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4611 "intrinsic module ISO_C_BINDING.", curr
->use_name
,
4615 /* Put it in the list. */
4616 kinds_used
[c_kind
] = curr
;
4619 /* Make a new (sorted) rename list. */
4621 while (i
< ISOCBINDING_NUMBER
&& kinds_used
[i
] == NULL
)
4624 if (i
< ISOCBINDING_NUMBER
)
4626 tmp_list
= kinds_used
[i
];
4630 for (; i
< ISOCBINDING_NUMBER
; i
++)
4631 if (kinds_used
[i
] != NULL
)
4633 curr
->next
= kinds_used
[i
];
4639 gfc_rename_list
= tmp_list
;
4643 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
4644 the current namespace for all named constants, pointer types, and
4645 procedures in the module unless the only clause was used or a rename
4646 list was provided. */
4649 import_iso_c_binding_module (void)
4651 gfc_symbol
*mod_sym
= NULL
;
4652 gfc_symtree
*mod_symtree
= NULL
;
4653 const char *iso_c_module_name
= "__iso_c_binding";
4658 /* Look only in the current namespace. */
4659 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, iso_c_module_name
);
4661 if (mod_symtree
== NULL
)
4663 /* symtree doesn't already exist in current namespace. */
4664 gfc_get_sym_tree (iso_c_module_name
, gfc_current_ns
, &mod_symtree
);
4666 if (mod_symtree
!= NULL
)
4667 mod_sym
= mod_symtree
->n
.sym
;
4669 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
4670 "create symbol for %s", iso_c_module_name
);
4672 mod_sym
->attr
.flavor
= FL_MODULE
;
4673 mod_sym
->attr
.intrinsic
= 1;
4674 mod_sym
->module
= gfc_get_string (iso_c_module_name
);
4675 mod_sym
->from_intmod
= INTMOD_ISO_C_BINDING
;
4678 /* Generate the symbols for the named constants representing
4679 the kinds for intrinsic data types. */
4682 /* Sort the rename list because there are dependencies between types
4683 and procedures (e.g., c_loc needs c_ptr). */
4684 sort_iso_c_rename_list ();
4686 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4688 i
= get_c_kind (u
->use_name
, c_interop_kinds_table
);
4690 if (i
== ISOCBINDING_INVALID
|| i
== ISOCBINDING_LAST
)
4692 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4693 "intrinsic module ISO_C_BINDING.", u
->use_name
,
4698 generate_isocbinding_symbol (iso_c_module_name
, i
, u
->local_name
);
4703 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
4706 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4708 if (strcmp (c_interop_kinds_table
[i
].name
, u
->use_name
) == 0)
4710 local_name
= u
->local_name
;
4715 generate_isocbinding_symbol (iso_c_module_name
, i
, local_name
);
4718 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4723 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4724 "module ISO_C_BINDING", u
->use_name
, &u
->where
);
4730 /* Add an integer named constant from a given module. */
4733 create_int_parameter (const char *name
, int value
, const char *modname
,
4734 intmod_id module
, int id
)
4736 gfc_symtree
*tmp_symtree
;
4739 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4740 if (tmp_symtree
!= NULL
)
4742 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
4745 gfc_error ("Symbol '%s' already declared", name
);
4748 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
);
4749 sym
= tmp_symtree
->n
.sym
;
4751 sym
->module
= gfc_get_string (modname
);
4752 sym
->attr
.flavor
= FL_PARAMETER
;
4753 sym
->ts
.type
= BT_INTEGER
;
4754 sym
->ts
.kind
= gfc_default_integer_kind
;
4755 sym
->value
= gfc_int_expr (value
);
4756 sym
->attr
.use_assoc
= 1;
4757 sym
->from_intmod
= module
;
4758 sym
->intmod_sym_id
= id
;
4762 /* USE the ISO_FORTRAN_ENV intrinsic module. */
4765 use_iso_fortran_env_module (void)
4767 static char mod
[] = "iso_fortran_env";
4768 const char *local_name
;
4770 gfc_symbol
*mod_sym
;
4771 gfc_symtree
*mod_symtree
;
4774 intmod_sym symbol
[] = {
4775 #define NAMED_INTCST(a,b,c,d) { a, b, 0, d },
4776 #include "iso-fortran-env.def"
4778 { ISOFORTRANENV_INVALID
, NULL
, -1234, 0 } };
4781 #define NAMED_INTCST(a,b,c,d) symbol[i++].value = c;
4782 #include "iso-fortran-env.def"
4785 /* Generate the symbol for the module itself. */
4786 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, mod
);
4787 if (mod_symtree
== NULL
)
4789 gfc_get_sym_tree (mod
, gfc_current_ns
, &mod_symtree
);
4790 gcc_assert (mod_symtree
);
4791 mod_sym
= mod_symtree
->n
.sym
;
4793 mod_sym
->attr
.flavor
= FL_MODULE
;
4794 mod_sym
->attr
.intrinsic
= 1;
4795 mod_sym
->module
= gfc_get_string (mod
);
4796 mod_sym
->from_intmod
= INTMOD_ISO_FORTRAN_ENV
;
4799 if (!mod_symtree
->n
.sym
->attr
.intrinsic
)
4800 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
4801 "non-intrinsic module name used previously", mod
);
4803 /* Generate the symbols for the module integer named constants. */
4805 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4807 for (i
= 0; symbol
[i
].name
; i
++)
4808 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
4811 if (symbol
[i
].name
== NULL
)
4813 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4814 "intrinsic module ISO_FORTRAN_ENV", u
->use_name
,
4819 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
4820 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
4821 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4822 "from intrinsic module ISO_FORTRAN_ENV at %L is "
4823 "incompatible with option %s", &u
->where
,
4824 gfc_option
.flag_default_integer
4825 ? "-fdefault-integer-8" : "-fdefault-real-8");
4827 create_int_parameter (u
->local_name
[0] ? u
->local_name
4829 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
4834 for (i
= 0; symbol
[i
].name
; i
++)
4837 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4839 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
4841 local_name
= u
->local_name
;
4847 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
4848 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
4849 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4850 "from intrinsic module ISO_FORTRAN_ENV at %C is "
4851 "incompatible with option %s",
4852 gfc_option
.flag_default_integer
4853 ? "-fdefault-integer-8" : "-fdefault-real-8");
4855 create_int_parameter (local_name
? local_name
: symbol
[i
].name
,
4856 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
4860 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4865 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4866 "module ISO_FORTRAN_ENV", u
->use_name
, &u
->where
);
4872 /* Process a USE directive. */
4875 gfc_use_module (void)
4880 gfc_symtree
*mod_symtree
;
4882 filename
= (char *) alloca (strlen (module_name
) + strlen (MODULE_EXTENSION
)
4884 strcpy (filename
, module_name
);
4885 strcat (filename
, MODULE_EXTENSION
);
4887 /* First, try to find an non-intrinsic module, unless the USE statement
4888 specified that the module is intrinsic. */
4891 module_fp
= gfc_open_included_file (filename
, true, true);
4893 /* Then, see if it's an intrinsic one, unless the USE statement
4894 specified that the module is non-intrinsic. */
4895 if (module_fp
== NULL
&& !specified_nonint
)
4897 if (strcmp (module_name
, "iso_fortran_env") == 0
4898 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: ISO_FORTRAN_ENV "
4899 "intrinsic module at %C") != FAILURE
)
4901 use_iso_fortran_env_module ();
4905 if (strcmp (module_name
, "iso_c_binding") == 0
4906 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
4907 "ISO_C_BINDING module at %C") != FAILURE
)
4909 import_iso_c_binding_module();
4913 module_fp
= gfc_open_intrinsic_module (filename
);
4915 if (module_fp
== NULL
&& specified_int
)
4916 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
4920 if (module_fp
== NULL
)
4921 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
4922 filename
, strerror (errno
));
4924 /* Check that we haven't already USEd an intrinsic module with the
4927 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, module_name
);
4928 if (mod_symtree
&& mod_symtree
->n
.sym
->attr
.intrinsic
)
4929 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
4930 "intrinsic module name used previously", module_name
);
4937 /* Skip the first two lines of the module, after checking that this is
4938 a gfortran module file. */
4944 bad_module ("Unexpected end of module");
4947 if ((start
== 1 && strcmp (atom_name
, "GFORTRAN") != 0)
4948 || (start
== 2 && strcmp (atom_name
, " module") != 0))
4949 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
4956 /* Make sure we're not reading the same module that we may be building. */
4957 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
4958 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
4959 gfc_fatal_error ("Can't USE the same module we're building!");
4962 init_true_name_tree ();
4966 free_true_name (true_name_root
);
4967 true_name_root
= NULL
;
4969 free_pi_tree (pi_root
);
4977 gfc_module_init_2 (void)
4979 last_atom
= ATOM_LPAREN
;
4984 gfc_module_done_2 (void)