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,
5 Free Software Foundation, Inc.
6 Contributed by Andy Vaught
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
24 /* The syntax of gfortran modules resembles that of lisp lists, i.e. a
25 sequence of atoms, which can be left or right parenthesis, names,
26 integers or strings. Parenthesis are always matched which allows
27 us to skip over sections at high speed without having to know
28 anything about the internal structure of the lists. A "name" is
29 usually a fortran 95 identifier, but can also start with '@' in
30 order to reference a hidden symbol.
32 The first line of a module is an informational message about what
33 created the module, the file it came from and when it was created.
34 The second line is a warning for people not to edit the module.
35 The rest of the module looks like:
37 ( ( <Interface info for UPLUS> )
38 ( <Interface info for UMINUS> )
41 ( ( <name of operator interface> <module of op interface> <i/f1> ... )
44 ( ( <name of generic interface> <module of generic interface> <i/f1> ... )
47 ( ( <common name> <symbol> <saved flag>)
53 ( <Symbol Number (in no particular order)>
55 <Module name of symbol>
56 ( <symbol information> )
65 In general, symbols refer to other symbols by their symbol number,
66 which are zero based. Symbols are written to the module in no
74 #include "parse.h" /* FIXME */
76 #include "constructor.h"
79 #define MODULE_EXTENSION ".mod"
81 /* Don't put any single quote (') in MOD_VERSION,
82 if yout want it to be recognized. */
83 #define MOD_VERSION "6"
86 /* Structure that describes a position within a module file. */
95 /* Structure for list of symbols of intrinsic modules. */
108 P_UNKNOWN
= 0, P_OTHER
, P_NAMESPACE
, P_COMPONENT
, P_SYMBOL
112 /* The fixup structure lists pointers to pointers that have to
113 be updated when a pointer value becomes known. */
115 typedef struct fixup_t
118 struct fixup_t
*next
;
123 /* Structure for holding extra info needed for pointers being read. */
139 typedef struct pointer_info
141 BBT_HEADER (pointer_info
);
145 /* The first component of each member of the union is the pointer
152 void *pointer
; /* Member for doing pointer searches. */
157 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
158 enum gfc_rsym_state state
;
159 int ns
, referenced
, renamed
;
162 gfc_symtree
*symtree
;
163 char binding_label
[GFC_MAX_SYMBOL_LEN
+ 1];
170 enum gfc_wsym_state state
;
179 #define gfc_get_pointer_info() XCNEW (pointer_info)
182 /* Local variables */
184 /* The FILE for the module we're reading or writing. */
185 static FILE *module_fp
;
187 /* MD5 context structure. */
188 static struct md5_ctx ctx
;
190 /* The name of the module we're reading (USE'ing) or writing. */
191 static char module_name
[GFC_MAX_SYMBOL_LEN
+ 1];
193 /* The way the module we're reading was specified. */
194 static bool specified_nonint
, specified_int
;
196 static int module_line
, module_column
, only_flag
;
198 { IO_INPUT
, IO_OUTPUT
}
201 static gfc_use_rename
*gfc_rename_list
;
202 static pointer_info
*pi_root
;
203 static int symbol_number
; /* Counter for assigning symbol numbers */
205 /* Tells mio_expr_ref to make symbols for unused equivalence members. */
206 static bool in_load_equiv
;
208 static locus use_locus
;
212 /*****************************************************************/
214 /* Pointer/integer conversion. Pointers between structures are stored
215 as integers in the module file. The next couple of subroutines
216 handle this translation for reading and writing. */
218 /* Recursively free the tree of pointer structures. */
221 free_pi_tree (pointer_info
*p
)
226 if (p
->fixup
!= NULL
)
227 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
229 free_pi_tree (p
->left
);
230 free_pi_tree (p
->right
);
236 /* Compare pointers when searching by pointer. Used when writing a
240 compare_pointers (void *_sn1
, void *_sn2
)
242 pointer_info
*sn1
, *sn2
;
244 sn1
= (pointer_info
*) _sn1
;
245 sn2
= (pointer_info
*) _sn2
;
247 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
249 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
256 /* Compare integers when searching by integer. Used when reading a
260 compare_integers (void *_sn1
, void *_sn2
)
262 pointer_info
*sn1
, *sn2
;
264 sn1
= (pointer_info
*) _sn1
;
265 sn2
= (pointer_info
*) _sn2
;
267 if (sn1
->integer
< sn2
->integer
)
269 if (sn1
->integer
> sn2
->integer
)
276 /* Initialize the pointer_info tree. */
285 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
287 /* Pointer 0 is the NULL pointer. */
288 p
= gfc_get_pointer_info ();
293 gfc_insert_bbt (&pi_root
, p
, compare
);
295 /* Pointer 1 is the current namespace. */
296 p
= gfc_get_pointer_info ();
297 p
->u
.pointer
= gfc_current_ns
;
299 p
->type
= P_NAMESPACE
;
301 gfc_insert_bbt (&pi_root
, p
, compare
);
307 /* During module writing, call here with a pointer to something,
308 returning the pointer_info node. */
310 static pointer_info
*
311 find_pointer (void *gp
)
318 if (p
->u
.pointer
== gp
)
320 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
327 /* Given a pointer while writing, returns the pointer_info tree node,
328 creating it if it doesn't exist. */
330 static pointer_info
*
331 get_pointer (void *gp
)
335 p
= find_pointer (gp
);
339 /* Pointer doesn't have an integer. Give it one. */
340 p
= gfc_get_pointer_info ();
343 p
->integer
= symbol_number
++;
345 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
351 /* Given an integer during reading, find it in the pointer_info tree,
352 creating the node if not found. */
354 static pointer_info
*
355 get_integer (int integer
)
365 c
= compare_integers (&t
, p
);
369 p
= (c
< 0) ? p
->left
: p
->right
;
375 p
= gfc_get_pointer_info ();
376 p
->integer
= integer
;
379 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
385 /* Recursive function to find a pointer within a tree by brute force. */
387 static pointer_info
*
388 fp2 (pointer_info
*p
, const void *target
)
395 if (p
->u
.pointer
== target
)
398 q
= fp2 (p
->left
, target
);
402 return fp2 (p
->right
, target
);
406 /* During reading, find a pointer_info node from the pointer value.
407 This amounts to a brute-force search. */
409 static pointer_info
*
410 find_pointer2 (void *p
)
412 return fp2 (pi_root
, p
);
416 /* Resolve any fixups using a known pointer. */
419 resolve_fixups (fixup_t
*f
, void *gp
)
432 /* Call here during module reading when we know what pointer to
433 associate with an integer. Any fixups that exist are resolved at
437 associate_integer_pointer (pointer_info
*p
, void *gp
)
439 if (p
->u
.pointer
!= NULL
)
440 gfc_internal_error ("associate_integer_pointer(): Already associated");
444 resolve_fixups (p
->fixup
, gp
);
450 /* During module reading, given an integer and a pointer to a pointer,
451 either store the pointer from an already-known value or create a
452 fixup structure in order to store things later. Returns zero if
453 the reference has been actually stored, or nonzero if the reference
454 must be fixed later (i.e., associate_integer_pointer must be called
455 sometime later. Returns the pointer_info structure. */
457 static pointer_info
*
458 add_fixup (int integer
, void *gp
)
464 p
= get_integer (integer
);
466 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
469 *cp
= (char *) p
->u
.pointer
;
478 f
->pointer
= (void **) gp
;
485 /*****************************************************************/
487 /* Parser related subroutines */
489 /* Free the rename list left behind by a USE statement. */
494 gfc_use_rename
*next
;
496 for (; gfc_rename_list
; gfc_rename_list
= next
)
498 next
= gfc_rename_list
->next
;
499 gfc_free (gfc_rename_list
);
504 /* Match a USE statement. */
509 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module_nature
[GFC_MAX_SYMBOL_LEN
+ 1];
510 gfc_use_rename
*tail
= NULL
, *new_use
;
511 interface_type type
, type2
;
515 specified_int
= false;
516 specified_nonint
= false;
518 if (gfc_match (" , ") == MATCH_YES
)
520 if ((m
= gfc_match (" %n ::", module_nature
)) == MATCH_YES
)
522 if (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: module "
523 "nature in USE statement at %C") == FAILURE
)
526 if (strcmp (module_nature
, "intrinsic") == 0)
527 specified_int
= true;
530 if (strcmp (module_nature
, "non_intrinsic") == 0)
531 specified_nonint
= true;
534 gfc_error ("Module nature in USE statement at %C shall "
535 "be either INTRINSIC or NON_INTRINSIC");
542 /* Help output a better error message than "Unclassifiable
544 gfc_match (" %n", module_nature
);
545 if (strcmp (module_nature
, "intrinsic") == 0
546 || strcmp (module_nature
, "non_intrinsic") == 0)
547 gfc_error ("\"::\" was expected after module nature at %C "
548 "but was not found");
554 m
= gfc_match (" ::");
555 if (m
== MATCH_YES
&&
556 gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
557 "\"USE :: module\" at %C") == FAILURE
)
562 m
= gfc_match ("% ");
568 use_locus
= gfc_current_locus
;
570 m
= gfc_match_name (module_name
);
577 if (gfc_match_eos () == MATCH_YES
)
579 if (gfc_match_char (',') != MATCH_YES
)
582 if (gfc_match (" only :") == MATCH_YES
)
585 if (gfc_match_eos () == MATCH_YES
)
590 /* Get a new rename struct and add it to the rename list. */
591 new_use
= gfc_get_use_rename ();
592 new_use
->where
= gfc_current_locus
;
595 if (gfc_rename_list
== NULL
)
596 gfc_rename_list
= new_use
;
598 tail
->next
= new_use
;
601 /* See what kind of interface we're dealing with. Assume it is
603 new_use
->op
= INTRINSIC_NONE
;
604 if (gfc_match_generic_spec (&type
, name
, &op
) == MATCH_ERROR
)
609 case INTERFACE_NAMELESS
:
610 gfc_error ("Missing generic specification in USE statement at %C");
613 case INTERFACE_USER_OP
:
614 case INTERFACE_GENERIC
:
615 m
= gfc_match (" =>");
617 if (type
== INTERFACE_USER_OP
&& m
== MATCH_YES
618 && (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: Renaming "
619 "operators in USE statements at %C")
623 if (type
== INTERFACE_USER_OP
)
624 new_use
->op
= INTRINSIC_USER
;
629 strcpy (new_use
->use_name
, name
);
632 strcpy (new_use
->local_name
, name
);
633 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
638 if (m
== MATCH_ERROR
)
646 strcpy (new_use
->local_name
, name
);
648 m
= gfc_match_generic_spec (&type2
, new_use
->use_name
, &op
);
653 if (m
== MATCH_ERROR
)
657 if (strcmp (new_use
->use_name
, module_name
) == 0
658 || strcmp (new_use
->local_name
, module_name
) == 0)
660 gfc_error ("The name '%s' at %C has already been used as "
661 "an external module name.", module_name
);
666 case INTERFACE_INTRINSIC_OP
:
674 if (gfc_match_eos () == MATCH_YES
)
676 if (gfc_match_char (',') != MATCH_YES
)
683 gfc_syntax_error (ST_USE
);
691 /* Given a name and a number, inst, return the inst name
692 under which to load this symbol. Returns NULL if this
693 symbol shouldn't be loaded. If inst is zero, returns
694 the number of instances of this name. If interface is
695 true, a user-defined operator is sought, otherwise only
696 non-operators are sought. */
699 find_use_name_n (const char *name
, int *inst
, bool interface
)
705 for (u
= gfc_rename_list
; u
; u
= u
->next
)
707 if (strcmp (u
->use_name
, name
) != 0
708 || (u
->op
== INTRINSIC_USER
&& !interface
)
709 || (u
->op
!= INTRINSIC_USER
&& interface
))
722 return only_flag
? NULL
: name
;
726 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
730 /* Given a name, return the name under which to load this symbol.
731 Returns NULL if this symbol shouldn't be loaded. */
734 find_use_name (const char *name
, bool interface
)
737 return find_use_name_n (name
, &i
, interface
);
741 /* Given a real name, return the number of use names associated with it. */
744 number_use_names (const char *name
, bool interface
)
747 find_use_name_n (name
, &i
, interface
);
752 /* Try to find the operator in the current list. */
754 static gfc_use_rename
*
755 find_use_operator (gfc_intrinsic_op op
)
759 for (u
= gfc_rename_list
; u
; u
= u
->next
)
767 /*****************************************************************/
769 /* The next couple of subroutines maintain a tree used to avoid a
770 brute-force search for a combination of true name and module name.
771 While symtree names, the name that a particular symbol is known by
772 can changed with USE statements, we still have to keep track of the
773 true names to generate the correct reference, and also avoid
774 loading the same real symbol twice in a program unit.
776 When we start reading, the true name tree is built and maintained
777 as symbols are read. The tree is searched as we load new symbols
778 to see if it already exists someplace in the namespace. */
780 typedef struct true_name
782 BBT_HEADER (true_name
);
787 static true_name
*true_name_root
;
790 /* Compare two true_name structures. */
793 compare_true_names (void *_t1
, void *_t2
)
798 t1
= (true_name
*) _t1
;
799 t2
= (true_name
*) _t2
;
801 c
= ((t1
->sym
->module
> t2
->sym
->module
)
802 - (t1
->sym
->module
< t2
->sym
->module
));
806 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
810 /* Given a true name, search the true name tree to see if it exists
811 within the main namespace. */
814 find_true_name (const char *name
, const char *module
)
820 sym
.name
= gfc_get_string (name
);
822 sym
.module
= gfc_get_string (module
);
830 c
= compare_true_names ((void *) (&t
), (void *) p
);
834 p
= (c
< 0) ? p
->left
: p
->right
;
841 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
844 add_true_name (gfc_symbol
*sym
)
848 t
= XCNEW (true_name
);
851 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
855 /* Recursive function to build the initial true name tree by
856 recursively traversing the current namespace. */
859 build_tnt (gfc_symtree
*st
)
864 build_tnt (st
->left
);
865 build_tnt (st
->right
);
867 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
870 add_true_name (st
->n
.sym
);
874 /* Initialize the true name tree with the current namespace. */
877 init_true_name_tree (void)
879 true_name_root
= NULL
;
880 build_tnt (gfc_current_ns
->sym_root
);
884 /* Recursively free a true name tree node. */
887 free_true_name (true_name
*t
)
891 free_true_name (t
->left
);
892 free_true_name (t
->right
);
898 /*****************************************************************/
900 /* Module reading and writing. */
904 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
908 static atom_type last_atom
;
911 /* The name buffer must be at least as long as a symbol name. Right
912 now it's not clear how we're going to store numeric constants--
913 probably as a hexadecimal string, since this will allow the exact
914 number to be preserved (this can't be done by a decimal
915 representation). Worry about that later. TODO! */
917 #define MAX_ATOM_SIZE 100
920 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
923 /* Report problems with a module. Error reporting is not very
924 elaborate, since this sorts of errors shouldn't really happen.
925 This subroutine never returns. */
927 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
930 bad_module (const char *msgid
)
937 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
938 module_name
, module_line
, module_column
, msgid
);
941 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
942 module_name
, module_line
, module_column
, msgid
);
945 gfc_fatal_error ("Module %s at line %d column %d: %s",
946 module_name
, module_line
, module_column
, msgid
);
952 /* Set the module's input pointer. */
955 set_module_locus (module_locus
*m
)
957 module_column
= m
->column
;
958 module_line
= m
->line
;
959 fsetpos (module_fp
, &m
->pos
);
963 /* Get the module's input pointer so that we can restore it later. */
966 get_module_locus (module_locus
*m
)
968 m
->column
= module_column
;
969 m
->line
= module_line
;
970 fgetpos (module_fp
, &m
->pos
);
974 /* Get the next character in the module, updating our reckoning of
982 c
= getc (module_fp
);
985 bad_module ("Unexpected EOF");
998 /* Parse a string constant. The delimiter is guaranteed to be a
1008 get_module_locus (&start
);
1012 /* See how long the string is. */
1017 bad_module ("Unexpected end of module in string constant");
1035 set_module_locus (&start
);
1037 atom_string
= p
= XCNEWVEC (char, len
+ 1);
1039 for (; len
> 0; len
--)
1043 module_char (); /* Guaranteed to be another \'. */
1047 module_char (); /* Terminating \'. */
1048 *p
= '\0'; /* C-style string for debug purposes. */
1052 /* Parse a small integer. */
1055 parse_integer (int c
)
1063 get_module_locus (&m
);
1069 atom_int
= 10 * atom_int
+ c
- '0';
1070 if (atom_int
> 99999999)
1071 bad_module ("Integer overflow");
1074 set_module_locus (&m
);
1092 get_module_locus (&m
);
1097 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
1101 if (++len
> GFC_MAX_SYMBOL_LEN
)
1102 bad_module ("Name too long");
1107 fseek (module_fp
, -1, SEEK_CUR
);
1108 module_column
= m
.column
+ len
- 1;
1115 /* Read the next atom in the module's input stream. */
1126 while (c
== ' ' || c
== '\r' || c
== '\n');
1151 return ATOM_INTEGER
;
1209 bad_module ("Bad name");
1216 /* Peek at the next atom on the input. */
1224 get_module_locus (&m
);
1227 if (a
== ATOM_STRING
)
1228 gfc_free (atom_string
);
1230 set_module_locus (&m
);
1235 /* Read the next atom from the input, requiring that it be a
1239 require_atom (atom_type type
)
1245 get_module_locus (&m
);
1253 p
= _("Expected name");
1256 p
= _("Expected left parenthesis");
1259 p
= _("Expected right parenthesis");
1262 p
= _("Expected integer");
1265 p
= _("Expected string");
1268 gfc_internal_error ("require_atom(): bad atom type required");
1271 set_module_locus (&m
);
1277 /* Given a pointer to an mstring array, require that the current input
1278 be one of the strings in the array. We return the enum value. */
1281 find_enum (const mstring
*m
)
1285 i
= gfc_string2code (m
, atom_name
);
1289 bad_module ("find_enum(): Enum not found");
1295 /**************** Module output subroutines ***************************/
1297 /* Output a character to a module file. */
1300 write_char (char out
)
1302 if (putc (out
, module_fp
) == EOF
)
1303 gfc_fatal_error ("Error writing modules file: %s", xstrerror (errno
));
1305 /* Add this to our MD5. */
1306 md5_process_bytes (&out
, sizeof (out
), &ctx
);
1318 /* Write an atom to a module. The line wrapping isn't perfect, but it
1319 should work most of the time. This isn't that big of a deal, since
1320 the file really isn't meant to be read by people anyway. */
1323 write_atom (atom_type atom
, const void *v
)
1333 p
= (const char *) v
;
1345 i
= *((const int *) v
);
1347 gfc_internal_error ("write_atom(): Writing negative integer");
1349 sprintf (buffer
, "%d", i
);
1354 gfc_internal_error ("write_atom(): Trying to write dab atom");
1358 if(p
== NULL
|| *p
== '\0')
1363 if (atom
!= ATOM_RPAREN
)
1365 if (module_column
+ len
> 72)
1370 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1375 if (atom
== ATOM_STRING
)
1378 while (p
!= NULL
&& *p
)
1380 if (atom
== ATOM_STRING
&& *p
== '\'')
1385 if (atom
== ATOM_STRING
)
1393 /***************** Mid-level I/O subroutines *****************/
1395 /* These subroutines let their caller read or write atoms without
1396 caring about which of the two is actually happening. This lets a
1397 subroutine concentrate on the actual format of the data being
1400 static void mio_expr (gfc_expr
**);
1401 pointer_info
*mio_symbol_ref (gfc_symbol
**);
1402 pointer_info
*mio_interface_rest (gfc_interface
**);
1403 static void mio_symtree_ref (gfc_symtree
**);
1405 /* Read or write an enumerated value. On writing, we return the input
1406 value for the convenience of callers. We avoid using an integer
1407 pointer because enums are sometimes inside bitfields. */
1410 mio_name (int t
, const mstring
*m
)
1412 if (iomode
== IO_OUTPUT
)
1413 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1416 require_atom (ATOM_NAME
);
1423 /* Specialization of mio_name. */
1425 #define DECL_MIO_NAME(TYPE) \
1426 static inline TYPE \
1427 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1429 return (TYPE) mio_name ((int) t, m); \
1431 #define MIO_NAME(TYPE) mio_name_##TYPE
1436 if (iomode
== IO_OUTPUT
)
1437 write_atom (ATOM_LPAREN
, NULL
);
1439 require_atom (ATOM_LPAREN
);
1446 if (iomode
== IO_OUTPUT
)
1447 write_atom (ATOM_RPAREN
, NULL
);
1449 require_atom (ATOM_RPAREN
);
1454 mio_integer (int *ip
)
1456 if (iomode
== IO_OUTPUT
)
1457 write_atom (ATOM_INTEGER
, ip
);
1460 require_atom (ATOM_INTEGER
);
1466 /* Read or write a gfc_intrinsic_op value. */
1469 mio_intrinsic_op (gfc_intrinsic_op
* op
)
1471 /* FIXME: Would be nicer to do this via the operators symbolic name. */
1472 if (iomode
== IO_OUTPUT
)
1474 int converted
= (int) *op
;
1475 write_atom (ATOM_INTEGER
, &converted
);
1479 require_atom (ATOM_INTEGER
);
1480 *op
= (gfc_intrinsic_op
) atom_int
;
1485 /* Read or write a character pointer that points to a string on the heap. */
1488 mio_allocated_string (const char *s
)
1490 if (iomode
== IO_OUTPUT
)
1492 write_atom (ATOM_STRING
, s
);
1497 require_atom (ATOM_STRING
);
1503 /* Functions for quoting and unquoting strings. */
1506 quote_string (const gfc_char_t
*s
, const size_t slength
)
1508 const gfc_char_t
*p
;
1512 /* Calculate the length we'll need: a backslash takes two ("\\"),
1513 non-printable characters take 10 ("\Uxxxxxxxx") and others take 1. */
1514 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1518 else if (!gfc_wide_is_printable (*p
))
1524 q
= res
= XCNEWVEC (char, len
+ 1);
1525 for (p
= s
, i
= 0; i
< slength
; p
++, i
++)
1528 *q
++ = '\\', *q
++ = '\\';
1529 else if (!gfc_wide_is_printable (*p
))
1531 sprintf (q
, "\\U%08" HOST_WIDE_INT_PRINT
"x",
1532 (unsigned HOST_WIDE_INT
) *p
);
1536 *q
++ = (unsigned char) *p
;
1544 unquote_string (const char *s
)
1550 for (p
= s
, len
= 0; *p
; p
++, len
++)
1557 else if (p
[1] == 'U')
1558 p
+= 9; /* That is a "\U????????". */
1560 gfc_internal_error ("unquote_string(): got bad string");
1563 res
= gfc_get_wide_string (len
+ 1);
1564 for (i
= 0, p
= s
; i
< len
; i
++, p
++)
1569 res
[i
] = (unsigned char) *p
;
1570 else if (p
[1] == '\\')
1572 res
[i
] = (unsigned char) '\\';
1577 /* We read the 8-digits hexadecimal constant that follows. */
1582 gcc_assert (p
[1] == 'U');
1583 for (j
= 0; j
< 8; j
++)
1586 gcc_assert (sscanf (&p
[j
+2], "%01x", &n
) == 1);
1600 /* Read or write a character pointer that points to a wide string on the
1601 heap, performing quoting/unquoting of nonprintable characters using the
1602 form \U???????? (where each ? is a hexadecimal digit).
1603 Length is the length of the string, only known and used in output mode. */
1605 static const gfc_char_t
*
1606 mio_allocated_wide_string (const gfc_char_t
*s
, const size_t length
)
1608 if (iomode
== IO_OUTPUT
)
1610 char *quoted
= quote_string (s
, length
);
1611 write_atom (ATOM_STRING
, quoted
);
1617 gfc_char_t
*unquoted
;
1619 require_atom (ATOM_STRING
);
1620 unquoted
= unquote_string (atom_string
);
1621 gfc_free (atom_string
);
1627 /* Read or write a string that is in static memory. */
1630 mio_pool_string (const char **stringp
)
1632 /* TODO: one could write the string only once, and refer to it via a
1635 /* As a special case we have to deal with a NULL string. This
1636 happens for the 'module' member of 'gfc_symbol's that are not in a
1637 module. We read / write these as the empty string. */
1638 if (iomode
== IO_OUTPUT
)
1640 const char *p
= *stringp
== NULL
? "" : *stringp
;
1641 write_atom (ATOM_STRING
, p
);
1645 require_atom (ATOM_STRING
);
1646 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1647 gfc_free (atom_string
);
1652 /* Read or write a string that is inside of some already-allocated
1656 mio_internal_string (char *string
)
1658 if (iomode
== IO_OUTPUT
)
1659 write_atom (ATOM_STRING
, string
);
1662 require_atom (ATOM_STRING
);
1663 strcpy (string
, atom_string
);
1664 gfc_free (atom_string
);
1670 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1671 AB_POINTER
, AB_TARGET
, AB_DUMMY
, AB_RESULT
, AB_DATA
,
1672 AB_IN_NAMELIST
, AB_IN_COMMON
, AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
,
1673 AB_ELEMENTAL
, AB_PURE
, AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
,
1674 AB_CRAY_POINTER
, AB_CRAY_POINTEE
, AB_THREADPRIVATE
, AB_ALLOC_COMP
,
1675 AB_POINTER_COMP
, AB_PRIVATE_COMP
, AB_VALUE
, AB_VOLATILE
, AB_PROTECTED
,
1676 AB_IS_BIND_C
, AB_IS_C_INTEROP
, AB_IS_ISO_C
, AB_ABSTRACT
, AB_ZERO_COMP
,
1677 AB_IS_CLASS
, AB_PROCEDURE
, AB_PROC_POINTER
, AB_ASYNCHRONOUS
, AB_CODIMENSION
,
1678 AB_COARRAY_COMP
, AB_VTYPE
, AB_VTAB
, AB_CONTIGUOUS
, AB_CLASS_POINTER
,
1683 static const mstring attr_bits
[] =
1685 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1686 minit ("ASYNCHRONOUS", AB_ASYNCHRONOUS
),
1687 minit ("DIMENSION", AB_DIMENSION
),
1688 minit ("CODIMENSION", AB_CODIMENSION
),
1689 minit ("CONTIGUOUS", AB_CONTIGUOUS
),
1690 minit ("EXTERNAL", AB_EXTERNAL
),
1691 minit ("INTRINSIC", AB_INTRINSIC
),
1692 minit ("OPTIONAL", AB_OPTIONAL
),
1693 minit ("POINTER", AB_POINTER
),
1694 minit ("VOLATILE", AB_VOLATILE
),
1695 minit ("TARGET", AB_TARGET
),
1696 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1697 minit ("DUMMY", AB_DUMMY
),
1698 minit ("RESULT", AB_RESULT
),
1699 minit ("DATA", AB_DATA
),
1700 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1701 minit ("IN_COMMON", AB_IN_COMMON
),
1702 minit ("FUNCTION", AB_FUNCTION
),
1703 minit ("SUBROUTINE", AB_SUBROUTINE
),
1704 minit ("SEQUENCE", AB_SEQUENCE
),
1705 minit ("ELEMENTAL", AB_ELEMENTAL
),
1706 minit ("PURE", AB_PURE
),
1707 minit ("RECURSIVE", AB_RECURSIVE
),
1708 minit ("GENERIC", AB_GENERIC
),
1709 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1710 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1711 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1712 minit ("IS_BIND_C", AB_IS_BIND_C
),
1713 minit ("IS_C_INTEROP", AB_IS_C_INTEROP
),
1714 minit ("IS_ISO_C", AB_IS_ISO_C
),
1715 minit ("VALUE", AB_VALUE
),
1716 minit ("ALLOC_COMP", AB_ALLOC_COMP
),
1717 minit ("COARRAY_COMP", AB_COARRAY_COMP
),
1718 minit ("POINTER_COMP", AB_POINTER_COMP
),
1719 minit ("PRIVATE_COMP", AB_PRIVATE_COMP
),
1720 minit ("ZERO_COMP", AB_ZERO_COMP
),
1721 minit ("PROTECTED", AB_PROTECTED
),
1722 minit ("ABSTRACT", AB_ABSTRACT
),
1723 minit ("IS_CLASS", AB_IS_CLASS
),
1724 minit ("PROCEDURE", AB_PROCEDURE
),
1725 minit ("PROC_POINTER", AB_PROC_POINTER
),
1726 minit ("VTYPE", AB_VTYPE
),
1727 minit ("VTAB", AB_VTAB
),
1728 minit ("CLASS_POINTER", AB_CLASS_POINTER
),
1729 minit ("IMPLICIT_PURE", AB_IMPLICIT_PURE
),
1733 /* For binding attributes. */
1734 static const mstring binding_passing
[] =
1737 minit ("NOPASS", 1),
1740 static const mstring binding_overriding
[] =
1742 minit ("OVERRIDABLE", 0),
1743 minit ("NON_OVERRIDABLE", 1),
1744 minit ("DEFERRED", 2),
1747 static const mstring binding_generic
[] =
1749 minit ("SPECIFIC", 0),
1750 minit ("GENERIC", 1),
1753 static const mstring binding_ppc
[] =
1755 minit ("NO_PPC", 0),
1760 /* Specialization of mio_name. */
1761 DECL_MIO_NAME (ab_attribute
)
1762 DECL_MIO_NAME (ar_type
)
1763 DECL_MIO_NAME (array_type
)
1765 DECL_MIO_NAME (expr_t
)
1766 DECL_MIO_NAME (gfc_access
)
1767 DECL_MIO_NAME (gfc_intrinsic_op
)
1768 DECL_MIO_NAME (ifsrc
)
1769 DECL_MIO_NAME (save_state
)
1770 DECL_MIO_NAME (procedure_type
)
1771 DECL_MIO_NAME (ref_type
)
1772 DECL_MIO_NAME (sym_flavor
)
1773 DECL_MIO_NAME (sym_intent
)
1774 #undef DECL_MIO_NAME
1776 /* Symbol attributes are stored in list with the first three elements
1777 being the enumerated fields, while the remaining elements (if any)
1778 indicate the individual attribute bits. The access field is not
1779 saved-- it controls what symbols are exported when a module is
1783 mio_symbol_attribute (symbol_attribute
*attr
)
1786 unsigned ext_attr
,extension_level
;
1790 attr
->flavor
= MIO_NAME (sym_flavor
) (attr
->flavor
, flavors
);
1791 attr
->intent
= MIO_NAME (sym_intent
) (attr
->intent
, intents
);
1792 attr
->proc
= MIO_NAME (procedure_type
) (attr
->proc
, procedures
);
1793 attr
->if_source
= MIO_NAME (ifsrc
) (attr
->if_source
, ifsrc_types
);
1794 attr
->save
= MIO_NAME (save_state
) (attr
->save
, save_status
);
1796 ext_attr
= attr
->ext_attr
;
1797 mio_integer ((int *) &ext_attr
);
1798 attr
->ext_attr
= ext_attr
;
1800 extension_level
= attr
->extension
;
1801 mio_integer ((int *) &extension_level
);
1802 attr
->extension
= extension_level
;
1804 if (iomode
== IO_OUTPUT
)
1806 if (attr
->allocatable
)
1807 MIO_NAME (ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1808 if (attr
->asynchronous
)
1809 MIO_NAME (ab_attribute
) (AB_ASYNCHRONOUS
, attr_bits
);
1810 if (attr
->dimension
)
1811 MIO_NAME (ab_attribute
) (AB_DIMENSION
, attr_bits
);
1812 if (attr
->codimension
)
1813 MIO_NAME (ab_attribute
) (AB_CODIMENSION
, attr_bits
);
1814 if (attr
->contiguous
)
1815 MIO_NAME (ab_attribute
) (AB_CONTIGUOUS
, attr_bits
);
1817 MIO_NAME (ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1818 if (attr
->intrinsic
)
1819 MIO_NAME (ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1821 MIO_NAME (ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1823 MIO_NAME (ab_attribute
) (AB_POINTER
, attr_bits
);
1824 if (attr
->class_pointer
)
1825 MIO_NAME (ab_attribute
) (AB_CLASS_POINTER
, attr_bits
);
1826 if (attr
->is_protected
)
1827 MIO_NAME (ab_attribute
) (AB_PROTECTED
, attr_bits
);
1829 MIO_NAME (ab_attribute
) (AB_VALUE
, attr_bits
);
1830 if (attr
->volatile_
)
1831 MIO_NAME (ab_attribute
) (AB_VOLATILE
, attr_bits
);
1833 MIO_NAME (ab_attribute
) (AB_TARGET
, attr_bits
);
1834 if (attr
->threadprivate
)
1835 MIO_NAME (ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1837 MIO_NAME (ab_attribute
) (AB_DUMMY
, attr_bits
);
1839 MIO_NAME (ab_attribute
) (AB_RESULT
, attr_bits
);
1840 /* We deliberately don't preserve the "entry" flag. */
1843 MIO_NAME (ab_attribute
) (AB_DATA
, attr_bits
);
1844 if (attr
->in_namelist
)
1845 MIO_NAME (ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1846 if (attr
->in_common
)
1847 MIO_NAME (ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1850 MIO_NAME (ab_attribute
) (AB_FUNCTION
, attr_bits
);
1851 if (attr
->subroutine
)
1852 MIO_NAME (ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1854 MIO_NAME (ab_attribute
) (AB_GENERIC
, attr_bits
);
1856 MIO_NAME (ab_attribute
) (AB_ABSTRACT
, attr_bits
);
1859 MIO_NAME (ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1860 if (attr
->elemental
)
1861 MIO_NAME (ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1863 MIO_NAME (ab_attribute
) (AB_PURE
, attr_bits
);
1864 if (attr
->implicit_pure
)
1865 MIO_NAME (ab_attribute
) (AB_IMPLICIT_PURE
, attr_bits
);
1866 if (attr
->recursive
)
1867 MIO_NAME (ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1868 if (attr
->always_explicit
)
1869 MIO_NAME (ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1870 if (attr
->cray_pointer
)
1871 MIO_NAME (ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1872 if (attr
->cray_pointee
)
1873 MIO_NAME (ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1874 if (attr
->is_bind_c
)
1875 MIO_NAME(ab_attribute
) (AB_IS_BIND_C
, attr_bits
);
1876 if (attr
->is_c_interop
)
1877 MIO_NAME(ab_attribute
) (AB_IS_C_INTEROP
, attr_bits
);
1879 MIO_NAME(ab_attribute
) (AB_IS_ISO_C
, attr_bits
);
1880 if (attr
->alloc_comp
)
1881 MIO_NAME (ab_attribute
) (AB_ALLOC_COMP
, attr_bits
);
1882 if (attr
->pointer_comp
)
1883 MIO_NAME (ab_attribute
) (AB_POINTER_COMP
, attr_bits
);
1884 if (attr
->private_comp
)
1885 MIO_NAME (ab_attribute
) (AB_PRIVATE_COMP
, attr_bits
);
1886 if (attr
->coarray_comp
)
1887 MIO_NAME (ab_attribute
) (AB_COARRAY_COMP
, attr_bits
);
1888 if (attr
->zero_comp
)
1889 MIO_NAME (ab_attribute
) (AB_ZERO_COMP
, attr_bits
);
1891 MIO_NAME (ab_attribute
) (AB_IS_CLASS
, attr_bits
);
1892 if (attr
->procedure
)
1893 MIO_NAME (ab_attribute
) (AB_PROCEDURE
, attr_bits
);
1894 if (attr
->proc_pointer
)
1895 MIO_NAME (ab_attribute
) (AB_PROC_POINTER
, attr_bits
);
1897 MIO_NAME (ab_attribute
) (AB_VTYPE
, attr_bits
);
1899 MIO_NAME (ab_attribute
) (AB_VTAB
, attr_bits
);
1909 if (t
== ATOM_RPAREN
)
1912 bad_module ("Expected attribute bit name");
1914 switch ((ab_attribute
) find_enum (attr_bits
))
1916 case AB_ALLOCATABLE
:
1917 attr
->allocatable
= 1;
1919 case AB_ASYNCHRONOUS
:
1920 attr
->asynchronous
= 1;
1923 attr
->dimension
= 1;
1925 case AB_CODIMENSION
:
1926 attr
->codimension
= 1;
1929 attr
->contiguous
= 1;
1935 attr
->intrinsic
= 1;
1943 case AB_CLASS_POINTER
:
1944 attr
->class_pointer
= 1;
1947 attr
->is_protected
= 1;
1953 attr
->volatile_
= 1;
1958 case AB_THREADPRIVATE
:
1959 attr
->threadprivate
= 1;
1970 case AB_IN_NAMELIST
:
1971 attr
->in_namelist
= 1;
1974 attr
->in_common
= 1;
1980 attr
->subroutine
= 1;
1992 attr
->elemental
= 1;
1997 case AB_IMPLICIT_PURE
:
1998 attr
->implicit_pure
= 1;
2001 attr
->recursive
= 1;
2003 case AB_ALWAYS_EXPLICIT
:
2004 attr
->always_explicit
= 1;
2006 case AB_CRAY_POINTER
:
2007 attr
->cray_pointer
= 1;
2009 case AB_CRAY_POINTEE
:
2010 attr
->cray_pointee
= 1;
2013 attr
->is_bind_c
= 1;
2015 case AB_IS_C_INTEROP
:
2016 attr
->is_c_interop
= 1;
2022 attr
->alloc_comp
= 1;
2024 case AB_COARRAY_COMP
:
2025 attr
->coarray_comp
= 1;
2027 case AB_POINTER_COMP
:
2028 attr
->pointer_comp
= 1;
2030 case AB_PRIVATE_COMP
:
2031 attr
->private_comp
= 1;
2034 attr
->zero_comp
= 1;
2040 attr
->procedure
= 1;
2042 case AB_PROC_POINTER
:
2043 attr
->proc_pointer
= 1;
2057 static const mstring bt_types
[] = {
2058 minit ("INTEGER", BT_INTEGER
),
2059 minit ("REAL", BT_REAL
),
2060 minit ("COMPLEX", BT_COMPLEX
),
2061 minit ("LOGICAL", BT_LOGICAL
),
2062 minit ("CHARACTER", BT_CHARACTER
),
2063 minit ("DERIVED", BT_DERIVED
),
2064 minit ("CLASS", BT_CLASS
),
2065 minit ("PROCEDURE", BT_PROCEDURE
),
2066 minit ("UNKNOWN", BT_UNKNOWN
),
2067 minit ("VOID", BT_VOID
),
2073 mio_charlen (gfc_charlen
**clp
)
2079 if (iomode
== IO_OUTPUT
)
2083 mio_expr (&cl
->length
);
2087 if (peek_atom () != ATOM_RPAREN
)
2089 cl
= gfc_new_charlen (gfc_current_ns
, NULL
);
2090 mio_expr (&cl
->length
);
2099 /* See if a name is a generated name. */
2102 check_unique_name (const char *name
)
2104 return *name
== '@';
2109 mio_typespec (gfc_typespec
*ts
)
2113 ts
->type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2115 if (ts
->type
!= BT_DERIVED
&& ts
->type
!= BT_CLASS
)
2116 mio_integer (&ts
->kind
);
2118 mio_symbol_ref (&ts
->u
.derived
);
2120 /* Add info for C interop and is_iso_c. */
2121 mio_integer (&ts
->is_c_interop
);
2122 mio_integer (&ts
->is_iso_c
);
2124 /* If the typespec is for an identifier either from iso_c_binding, or
2125 a constant that was initialized to an identifier from it, use the
2126 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
2128 ts
->f90_type
= MIO_NAME (bt
) (ts
->f90_type
, bt_types
);
2130 ts
->f90_type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
2132 if (ts
->type
!= BT_CHARACTER
)
2134 /* ts->u.cl is only valid for BT_CHARACTER. */
2139 mio_charlen (&ts
->u
.cl
);
2145 static const mstring array_spec_types
[] = {
2146 minit ("EXPLICIT", AS_EXPLICIT
),
2147 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
2148 minit ("DEFERRED", AS_DEFERRED
),
2149 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
2155 mio_array_spec (gfc_array_spec
**asp
)
2162 if (iomode
== IO_OUTPUT
)
2170 if (peek_atom () == ATOM_RPAREN
)
2176 *asp
= as
= gfc_get_array_spec ();
2179 mio_integer (&as
->rank
);
2180 mio_integer (&as
->corank
);
2181 as
->type
= MIO_NAME (array_type
) (as
->type
, array_spec_types
);
2183 for (i
= 0; i
< as
->rank
+ as
->corank
; i
++)
2185 mio_expr (&as
->lower
[i
]);
2186 mio_expr (&as
->upper
[i
]);
2194 /* Given a pointer to an array reference structure (which lives in a
2195 gfc_ref structure), find the corresponding array specification
2196 structure. Storing the pointer in the ref structure doesn't quite
2197 work when loading from a module. Generating code for an array
2198 reference also needs more information than just the array spec. */
2200 static const mstring array_ref_types
[] = {
2201 minit ("FULL", AR_FULL
),
2202 minit ("ELEMENT", AR_ELEMENT
),
2203 minit ("SECTION", AR_SECTION
),
2209 mio_array_ref (gfc_array_ref
*ar
)
2214 ar
->type
= MIO_NAME (ar_type
) (ar
->type
, array_ref_types
);
2215 mio_integer (&ar
->dimen
);
2223 for (i
= 0; i
< ar
->dimen
; i
++)
2224 mio_expr (&ar
->start
[i
]);
2229 for (i
= 0; i
< ar
->dimen
; i
++)
2231 mio_expr (&ar
->start
[i
]);
2232 mio_expr (&ar
->end
[i
]);
2233 mio_expr (&ar
->stride
[i
]);
2239 gfc_internal_error ("mio_array_ref(): Unknown array ref");
2242 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
2243 we can't call mio_integer directly. Instead loop over each element
2244 and cast it to/from an integer. */
2245 if (iomode
== IO_OUTPUT
)
2247 for (i
= 0; i
< ar
->dimen
; i
++)
2249 int tmp
= (int)ar
->dimen_type
[i
];
2250 write_atom (ATOM_INTEGER
, &tmp
);
2255 for (i
= 0; i
< ar
->dimen
; i
++)
2257 require_atom (ATOM_INTEGER
);
2258 ar
->dimen_type
[i
] = (enum gfc_array_ref_dimen_type
) atom_int
;
2262 if (iomode
== IO_INPUT
)
2264 ar
->where
= gfc_current_locus
;
2266 for (i
= 0; i
< ar
->dimen
; i
++)
2267 ar
->c_where
[i
] = gfc_current_locus
;
2274 /* Saves or restores a pointer. The pointer is converted back and
2275 forth from an integer. We return the pointer_info pointer so that
2276 the caller can take additional action based on the pointer type. */
2278 static pointer_info
*
2279 mio_pointer_ref (void *gp
)
2283 if (iomode
== IO_OUTPUT
)
2285 p
= get_pointer (*((char **) gp
));
2286 write_atom (ATOM_INTEGER
, &p
->integer
);
2290 require_atom (ATOM_INTEGER
);
2291 p
= add_fixup (atom_int
, gp
);
2298 /* Save and load references to components that occur within
2299 expressions. We have to describe these references by a number and
2300 by name. The number is necessary for forward references during
2301 reading, and the name is necessary if the symbol already exists in
2302 the namespace and is not loaded again. */
2305 mio_component_ref (gfc_component
**cp
, gfc_symbol
*sym
)
2307 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2311 p
= mio_pointer_ref (cp
);
2312 if (p
->type
== P_UNKNOWN
)
2313 p
->type
= P_COMPONENT
;
2315 if (iomode
== IO_OUTPUT
)
2316 mio_pool_string (&(*cp
)->name
);
2319 mio_internal_string (name
);
2321 if (sym
&& sym
->attr
.is_class
)
2322 sym
= sym
->components
->ts
.u
.derived
;
2324 /* It can happen that a component reference can be read before the
2325 associated derived type symbol has been loaded. Return now and
2326 wait for a later iteration of load_needed. */
2330 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
2332 /* Symbol already loaded, so search by name. */
2333 for (q
= sym
->components
; q
; q
= q
->next
)
2334 if (strcmp (q
->name
, name
) == 0)
2338 gfc_internal_error ("mio_component_ref(): Component not found");
2340 associate_integer_pointer (p
, q
);
2343 /* Make sure this symbol will eventually be loaded. */
2344 p
= find_pointer2 (sym
);
2345 if (p
->u
.rsym
.state
== UNUSED
)
2346 p
->u
.rsym
.state
= NEEDED
;
2351 static void mio_namespace_ref (gfc_namespace
**nsp
);
2352 static void mio_formal_arglist (gfc_formal_arglist
**formal
);
2353 static void mio_typebound_proc (gfc_typebound_proc
** proc
);
2356 mio_component (gfc_component
*c
, int vtype
)
2360 gfc_formal_arglist
*formal
;
2364 if (iomode
== IO_OUTPUT
)
2366 p
= get_pointer (c
);
2367 mio_integer (&p
->integer
);
2372 p
= get_integer (n
);
2373 associate_integer_pointer (p
, c
);
2376 if (p
->type
== P_UNKNOWN
)
2377 p
->type
= P_COMPONENT
;
2379 mio_pool_string (&c
->name
);
2380 mio_typespec (&c
->ts
);
2381 mio_array_spec (&c
->as
);
2383 mio_symbol_attribute (&c
->attr
);
2384 c
->attr
.access
= MIO_NAME (gfc_access
) (c
->attr
.access
, access_types
);
2387 mio_expr (&c
->initializer
);
2389 if (c
->attr
.proc_pointer
)
2391 if (iomode
== IO_OUTPUT
)
2394 while (formal
&& !formal
->sym
)
2395 formal
= formal
->next
;
2398 mio_namespace_ref (&formal
->sym
->ns
);
2400 mio_namespace_ref (&c
->formal_ns
);
2404 mio_namespace_ref (&c
->formal_ns
);
2405 /* TODO: if (c->formal_ns)
2407 c->formal_ns->proc_name = c;
2412 mio_formal_arglist (&c
->formal
);
2414 mio_typebound_proc (&c
->tb
);
2422 mio_component_list (gfc_component
**cp
, int vtype
)
2424 gfc_component
*c
, *tail
;
2428 if (iomode
== IO_OUTPUT
)
2430 for (c
= *cp
; c
; c
= c
->next
)
2431 mio_component (c
, vtype
);
2440 if (peek_atom () == ATOM_RPAREN
)
2443 c
= gfc_get_component ();
2444 mio_component (c
, vtype
);
2460 mio_actual_arg (gfc_actual_arglist
*a
)
2463 mio_pool_string (&a
->name
);
2464 mio_expr (&a
->expr
);
2470 mio_actual_arglist (gfc_actual_arglist
**ap
)
2472 gfc_actual_arglist
*a
, *tail
;
2476 if (iomode
== IO_OUTPUT
)
2478 for (a
= *ap
; a
; a
= a
->next
)
2488 if (peek_atom () != ATOM_LPAREN
)
2491 a
= gfc_get_actual_arglist ();
2507 /* Read and write formal argument lists. */
2510 mio_formal_arglist (gfc_formal_arglist
**formal
)
2512 gfc_formal_arglist
*f
, *tail
;
2516 if (iomode
== IO_OUTPUT
)
2518 for (f
= *formal
; f
; f
= f
->next
)
2519 mio_symbol_ref (&f
->sym
);
2523 *formal
= tail
= NULL
;
2525 while (peek_atom () != ATOM_RPAREN
)
2527 f
= gfc_get_formal_arglist ();
2528 mio_symbol_ref (&f
->sym
);
2530 if (*formal
== NULL
)
2543 /* Save or restore a reference to a symbol node. */
2546 mio_symbol_ref (gfc_symbol
**symp
)
2550 p
= mio_pointer_ref (symp
);
2551 if (p
->type
== P_UNKNOWN
)
2554 if (iomode
== IO_OUTPUT
)
2556 if (p
->u
.wsym
.state
== UNREFERENCED
)
2557 p
->u
.wsym
.state
= NEEDS_WRITE
;
2561 if (p
->u
.rsym
.state
== UNUSED
)
2562 p
->u
.rsym
.state
= NEEDED
;
2568 /* Save or restore a reference to a symtree node. */
2571 mio_symtree_ref (gfc_symtree
**stp
)
2576 if (iomode
== IO_OUTPUT
)
2577 mio_symbol_ref (&(*stp
)->n
.sym
);
2580 require_atom (ATOM_INTEGER
);
2581 p
= get_integer (atom_int
);
2583 /* An unused equivalence member; make a symbol and a symtree
2585 if (in_load_equiv
&& p
->u
.rsym
.symtree
== NULL
)
2587 /* Since this is not used, it must have a unique name. */
2588 p
->u
.rsym
.symtree
= gfc_get_unique_symtree (gfc_current_ns
);
2590 /* Make the symbol. */
2591 if (p
->u
.rsym
.sym
== NULL
)
2593 p
->u
.rsym
.sym
= gfc_new_symbol (p
->u
.rsym
.true_name
,
2595 p
->u
.rsym
.sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
2598 p
->u
.rsym
.symtree
->n
.sym
= p
->u
.rsym
.sym
;
2599 p
->u
.rsym
.symtree
->n
.sym
->refs
++;
2600 p
->u
.rsym
.referenced
= 1;
2602 /* If the symbol is PRIVATE and in COMMON, load_commons will
2603 generate a fixup symbol, which must be associated. */
2605 resolve_fixups (p
->fixup
, p
->u
.rsym
.sym
);
2609 if (p
->type
== P_UNKNOWN
)
2612 if (p
->u
.rsym
.state
== UNUSED
)
2613 p
->u
.rsym
.state
= NEEDED
;
2615 if (p
->u
.rsym
.symtree
!= NULL
)
2617 *stp
= p
->u
.rsym
.symtree
;
2621 f
= XCNEW (fixup_t
);
2623 f
->next
= p
->u
.rsym
.stfixup
;
2624 p
->u
.rsym
.stfixup
= f
;
2626 f
->pointer
= (void **) stp
;
2633 mio_iterator (gfc_iterator
**ip
)
2639 if (iomode
== IO_OUTPUT
)
2646 if (peek_atom () == ATOM_RPAREN
)
2652 *ip
= gfc_get_iterator ();
2657 mio_expr (&iter
->var
);
2658 mio_expr (&iter
->start
);
2659 mio_expr (&iter
->end
);
2660 mio_expr (&iter
->step
);
2668 mio_constructor (gfc_constructor_base
*cp
)
2674 if (iomode
== IO_OUTPUT
)
2676 for (c
= gfc_constructor_first (*cp
); c
; c
= gfc_constructor_next (c
))
2679 mio_expr (&c
->expr
);
2680 mio_iterator (&c
->iterator
);
2686 while (peek_atom () != ATOM_RPAREN
)
2688 c
= gfc_constructor_append_expr (cp
, NULL
, NULL
);
2691 mio_expr (&c
->expr
);
2692 mio_iterator (&c
->iterator
);
2701 static const mstring ref_types
[] = {
2702 minit ("ARRAY", REF_ARRAY
),
2703 minit ("COMPONENT", REF_COMPONENT
),
2704 minit ("SUBSTRING", REF_SUBSTRING
),
2710 mio_ref (gfc_ref
**rp
)
2717 r
->type
= MIO_NAME (ref_type
) (r
->type
, ref_types
);
2722 mio_array_ref (&r
->u
.ar
);
2726 mio_symbol_ref (&r
->u
.c
.sym
);
2727 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2731 mio_expr (&r
->u
.ss
.start
);
2732 mio_expr (&r
->u
.ss
.end
);
2733 mio_charlen (&r
->u
.ss
.length
);
2742 mio_ref_list (gfc_ref
**rp
)
2744 gfc_ref
*ref
, *head
, *tail
;
2748 if (iomode
== IO_OUTPUT
)
2750 for (ref
= *rp
; ref
; ref
= ref
->next
)
2757 while (peek_atom () != ATOM_RPAREN
)
2760 head
= tail
= gfc_get_ref ();
2763 tail
->next
= gfc_get_ref ();
2777 /* Read and write an integer value. */
2780 mio_gmp_integer (mpz_t
*integer
)
2784 if (iomode
== IO_INPUT
)
2786 if (parse_atom () != ATOM_STRING
)
2787 bad_module ("Expected integer string");
2789 mpz_init (*integer
);
2790 if (mpz_set_str (*integer
, atom_string
, 10))
2791 bad_module ("Error converting integer");
2793 gfc_free (atom_string
);
2797 p
= mpz_get_str (NULL
, 10, *integer
);
2798 write_atom (ATOM_STRING
, p
);
2805 mio_gmp_real (mpfr_t
*real
)
2810 if (iomode
== IO_INPUT
)
2812 if (parse_atom () != ATOM_STRING
)
2813 bad_module ("Expected real string");
2816 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2817 gfc_free (atom_string
);
2821 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2823 if (mpfr_nan_p (*real
) || mpfr_inf_p (*real
))
2825 write_atom (ATOM_STRING
, p
);
2830 atom_string
= XCNEWVEC (char, strlen (p
) + 20);
2832 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2834 /* Fix negative numbers. */
2835 if (atom_string
[2] == '-')
2837 atom_string
[0] = '-';
2838 atom_string
[1] = '0';
2839 atom_string
[2] = '.';
2842 write_atom (ATOM_STRING
, atom_string
);
2844 gfc_free (atom_string
);
2850 /* Save and restore the shape of an array constructor. */
2853 mio_shape (mpz_t
**pshape
, int rank
)
2859 /* A NULL shape is represented by (). */
2862 if (iomode
== IO_OUTPUT
)
2874 if (t
== ATOM_RPAREN
)
2881 shape
= gfc_get_shape (rank
);
2885 for (n
= 0; n
< rank
; n
++)
2886 mio_gmp_integer (&shape
[n
]);
2892 static const mstring expr_types
[] = {
2893 minit ("OP", EXPR_OP
),
2894 minit ("FUNCTION", EXPR_FUNCTION
),
2895 minit ("CONSTANT", EXPR_CONSTANT
),
2896 minit ("VARIABLE", EXPR_VARIABLE
),
2897 minit ("SUBSTRING", EXPR_SUBSTRING
),
2898 minit ("STRUCTURE", EXPR_STRUCTURE
),
2899 minit ("ARRAY", EXPR_ARRAY
),
2900 minit ("NULL", EXPR_NULL
),
2901 minit ("COMPCALL", EXPR_COMPCALL
),
2905 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2906 generic operators, not in expressions. INTRINSIC_USER is also
2907 replaced by the correct function name by the time we see it. */
2909 static const mstring intrinsics
[] =
2911 minit ("UPLUS", INTRINSIC_UPLUS
),
2912 minit ("UMINUS", INTRINSIC_UMINUS
),
2913 minit ("PLUS", INTRINSIC_PLUS
),
2914 minit ("MINUS", INTRINSIC_MINUS
),
2915 minit ("TIMES", INTRINSIC_TIMES
),
2916 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2917 minit ("POWER", INTRINSIC_POWER
),
2918 minit ("CONCAT", INTRINSIC_CONCAT
),
2919 minit ("AND", INTRINSIC_AND
),
2920 minit ("OR", INTRINSIC_OR
),
2921 minit ("EQV", INTRINSIC_EQV
),
2922 minit ("NEQV", INTRINSIC_NEQV
),
2923 minit ("EQ_SIGN", INTRINSIC_EQ
),
2924 minit ("EQ", INTRINSIC_EQ_OS
),
2925 minit ("NE_SIGN", INTRINSIC_NE
),
2926 minit ("NE", INTRINSIC_NE_OS
),
2927 minit ("GT_SIGN", INTRINSIC_GT
),
2928 minit ("GT", INTRINSIC_GT_OS
),
2929 minit ("GE_SIGN", INTRINSIC_GE
),
2930 minit ("GE", INTRINSIC_GE_OS
),
2931 minit ("LT_SIGN", INTRINSIC_LT
),
2932 minit ("LT", INTRINSIC_LT_OS
),
2933 minit ("LE_SIGN", INTRINSIC_LE
),
2934 minit ("LE", INTRINSIC_LE_OS
),
2935 minit ("NOT", INTRINSIC_NOT
),
2936 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2941 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2944 fix_mio_expr (gfc_expr
*e
)
2946 gfc_symtree
*ns_st
= NULL
;
2949 if (iomode
!= IO_OUTPUT
)
2954 /* If this is a symtree for a symbol that came from a contained module
2955 namespace, it has a unique name and we should look in the current
2956 namespace to see if the required, non-contained symbol is available
2957 yet. If so, the latter should be written. */
2958 if (e
->symtree
->n
.sym
&& check_unique_name (e
->symtree
->name
))
2959 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2960 e
->symtree
->n
.sym
->name
);
2962 /* On the other hand, if the existing symbol is the module name or the
2963 new symbol is a dummy argument, do not do the promotion. */
2964 if (ns_st
&& ns_st
->n
.sym
2965 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2966 && !e
->symtree
->n
.sym
->attr
.dummy
)
2969 else if (e
->expr_type
== EXPR_FUNCTION
&& e
->value
.function
.name
)
2973 /* In some circumstances, a function used in an initialization
2974 expression, in one use associated module, can fail to be
2975 coupled to its symtree when used in a specification
2976 expression in another module. */
2977 fname
= e
->value
.function
.esym
? e
->value
.function
.esym
->name
2978 : e
->value
.function
.isym
->name
;
2979 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2984 /* This is probably a reference to a private procedure from another
2985 module. To prevent a segfault, make a generic with no specific
2986 instances. If this module is used, without the required
2987 specific coming from somewhere, the appropriate error message
2989 gfc_get_symbol (fname
, gfc_current_ns
, &sym
);
2990 sym
->attr
.flavor
= FL_PROCEDURE
;
2991 sym
->attr
.generic
= 1;
2992 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2997 /* Read and write expressions. The form "()" is allowed to indicate a
3001 mio_expr (gfc_expr
**ep
)
3009 if (iomode
== IO_OUTPUT
)
3018 MIO_NAME (expr_t
) (e
->expr_type
, expr_types
);
3023 if (t
== ATOM_RPAREN
)
3030 bad_module ("Expected expression type");
3032 e
= *ep
= gfc_get_expr ();
3033 e
->where
= gfc_current_locus
;
3034 e
->expr_type
= (expr_t
) find_enum (expr_types
);
3037 mio_typespec (&e
->ts
);
3038 mio_integer (&e
->rank
);
3042 switch (e
->expr_type
)
3046 = MIO_NAME (gfc_intrinsic_op
) (e
->value
.op
.op
, intrinsics
);
3048 switch (e
->value
.op
.op
)
3050 case INTRINSIC_UPLUS
:
3051 case INTRINSIC_UMINUS
:
3053 case INTRINSIC_PARENTHESES
:
3054 mio_expr (&e
->value
.op
.op1
);
3057 case INTRINSIC_PLUS
:
3058 case INTRINSIC_MINUS
:
3059 case INTRINSIC_TIMES
:
3060 case INTRINSIC_DIVIDE
:
3061 case INTRINSIC_POWER
:
3062 case INTRINSIC_CONCAT
:
3066 case INTRINSIC_NEQV
:
3068 case INTRINSIC_EQ_OS
:
3070 case INTRINSIC_NE_OS
:
3072 case INTRINSIC_GT_OS
:
3074 case INTRINSIC_GE_OS
:
3076 case INTRINSIC_LT_OS
:
3078 case INTRINSIC_LE_OS
:
3079 mio_expr (&e
->value
.op
.op1
);
3080 mio_expr (&e
->value
.op
.op2
);
3084 bad_module ("Bad operator");
3090 mio_symtree_ref (&e
->symtree
);
3091 mio_actual_arglist (&e
->value
.function
.actual
);
3093 if (iomode
== IO_OUTPUT
)
3095 e
->value
.function
.name
3096 = mio_allocated_string (e
->value
.function
.name
);
3097 flag
= e
->value
.function
.esym
!= NULL
;
3098 mio_integer (&flag
);
3100 mio_symbol_ref (&e
->value
.function
.esym
);
3102 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
3106 require_atom (ATOM_STRING
);
3107 e
->value
.function
.name
= gfc_get_string (atom_string
);
3108 gfc_free (atom_string
);
3110 mio_integer (&flag
);
3112 mio_symbol_ref (&e
->value
.function
.esym
);
3115 require_atom (ATOM_STRING
);
3116 e
->value
.function
.isym
= gfc_find_function (atom_string
);
3117 gfc_free (atom_string
);
3124 mio_symtree_ref (&e
->symtree
);
3125 mio_ref_list (&e
->ref
);
3128 case EXPR_SUBSTRING
:
3129 e
->value
.character
.string
3130 = CONST_CAST (gfc_char_t
*,
3131 mio_allocated_wide_string (e
->value
.character
.string
,
3132 e
->value
.character
.length
));
3133 mio_ref_list (&e
->ref
);
3136 case EXPR_STRUCTURE
:
3138 mio_constructor (&e
->value
.constructor
);
3139 mio_shape (&e
->shape
, e
->rank
);
3146 mio_gmp_integer (&e
->value
.integer
);
3150 gfc_set_model_kind (e
->ts
.kind
);
3151 mio_gmp_real (&e
->value
.real
);
3155 gfc_set_model_kind (e
->ts
.kind
);
3156 mio_gmp_real (&mpc_realref (e
->value
.complex));
3157 mio_gmp_real (&mpc_imagref (e
->value
.complex));
3161 mio_integer (&e
->value
.logical
);
3165 mio_integer (&e
->value
.character
.length
);
3166 e
->value
.character
.string
3167 = CONST_CAST (gfc_char_t
*,
3168 mio_allocated_wide_string (e
->value
.character
.string
,
3169 e
->value
.character
.length
));
3173 bad_module ("Bad type in constant expression");
3191 /* Read and write namelists. */
3194 mio_namelist (gfc_symbol
*sym
)
3196 gfc_namelist
*n
, *m
;
3197 const char *check_name
;
3201 if (iomode
== IO_OUTPUT
)
3203 for (n
= sym
->namelist
; n
; n
= n
->next
)
3204 mio_symbol_ref (&n
->sym
);
3208 /* This departure from the standard is flagged as an error.
3209 It does, in fact, work correctly. TODO: Allow it
3211 if (sym
->attr
.flavor
== FL_NAMELIST
)
3213 check_name
= find_use_name (sym
->name
, false);
3214 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
3215 gfc_error ("Namelist %s cannot be renamed by USE "
3216 "association to %s", sym
->name
, check_name
);
3220 while (peek_atom () != ATOM_RPAREN
)
3222 n
= gfc_get_namelist ();
3223 mio_symbol_ref (&n
->sym
);
3225 if (sym
->namelist
== NULL
)
3232 sym
->namelist_tail
= m
;
3239 /* Save/restore lists of gfc_interface structures. When loading an
3240 interface, we are really appending to the existing list of
3241 interfaces. Checking for duplicate and ambiguous interfaces has to
3242 be done later when all symbols have been loaded. */
3245 mio_interface_rest (gfc_interface
**ip
)
3247 gfc_interface
*tail
, *p
;
3248 pointer_info
*pi
= NULL
;
3250 if (iomode
== IO_OUTPUT
)
3253 for (p
= *ip
; p
; p
= p
->next
)
3254 mio_symbol_ref (&p
->sym
);
3269 if (peek_atom () == ATOM_RPAREN
)
3272 p
= gfc_get_interface ();
3273 p
->where
= gfc_current_locus
;
3274 pi
= mio_symbol_ref (&p
->sym
);
3290 /* Save/restore a nameless operator interface. */
3293 mio_interface (gfc_interface
**ip
)
3296 mio_interface_rest (ip
);
3300 /* Save/restore a named operator interface. */
3303 mio_symbol_interface (const char **name
, const char **module
,
3307 mio_pool_string (name
);
3308 mio_pool_string (module
);
3309 mio_interface_rest (ip
);
3314 mio_namespace_ref (gfc_namespace
**nsp
)
3319 p
= mio_pointer_ref (nsp
);
3321 if (p
->type
== P_UNKNOWN
)
3322 p
->type
= P_NAMESPACE
;
3324 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
3326 ns
= (gfc_namespace
*) p
->u
.pointer
;
3329 ns
= gfc_get_namespace (NULL
, 0);
3330 associate_integer_pointer (p
, ns
);
3338 /* Save/restore the f2k_derived namespace of a derived-type symbol. */
3340 static gfc_namespace
* current_f2k_derived
;
3343 mio_typebound_proc (gfc_typebound_proc
** proc
)
3346 int overriding_flag
;
3348 if (iomode
== IO_INPUT
)
3350 *proc
= gfc_get_typebound_proc (NULL
);
3351 (*proc
)->where
= gfc_current_locus
;
3357 (*proc
)->access
= MIO_NAME (gfc_access
) ((*proc
)->access
, access_types
);
3359 /* IO the NON_OVERRIDABLE/DEFERRED combination. */
3360 gcc_assert (!((*proc
)->deferred
&& (*proc
)->non_overridable
));
3361 overriding_flag
= ((*proc
)->deferred
<< 1) | (*proc
)->non_overridable
;
3362 overriding_flag
= mio_name (overriding_flag
, binding_overriding
);
3363 (*proc
)->deferred
= ((overriding_flag
& 2) != 0);
3364 (*proc
)->non_overridable
= ((overriding_flag
& 1) != 0);
3365 gcc_assert (!((*proc
)->deferred
&& (*proc
)->non_overridable
));
3367 (*proc
)->nopass
= mio_name ((*proc
)->nopass
, binding_passing
);
3368 (*proc
)->is_generic
= mio_name ((*proc
)->is_generic
, binding_generic
);
3369 (*proc
)->ppc
= mio_name((*proc
)->ppc
, binding_ppc
);
3371 mio_pool_string (&((*proc
)->pass_arg
));
3373 flag
= (int) (*proc
)->pass_arg_num
;
3374 mio_integer (&flag
);
3375 (*proc
)->pass_arg_num
= (unsigned) flag
;
3377 if ((*proc
)->is_generic
)
3383 if (iomode
== IO_OUTPUT
)
3384 for (g
= (*proc
)->u
.generic
; g
; g
= g
->next
)
3385 mio_allocated_string (g
->specific_st
->name
);
3388 (*proc
)->u
.generic
= NULL
;
3389 while (peek_atom () != ATOM_RPAREN
)
3391 gfc_symtree
** sym_root
;
3393 g
= gfc_get_tbp_generic ();
3396 require_atom (ATOM_STRING
);
3397 sym_root
= ¤t_f2k_derived
->tb_sym_root
;
3398 g
->specific_st
= gfc_get_tbp_symtree (sym_root
, atom_string
);
3399 gfc_free (atom_string
);
3401 g
->next
= (*proc
)->u
.generic
;
3402 (*proc
)->u
.generic
= g
;
3408 else if (!(*proc
)->ppc
)
3409 mio_symtree_ref (&(*proc
)->u
.specific
);
3414 /* Walker-callback function for this purpose. */
3416 mio_typebound_symtree (gfc_symtree
* st
)
3418 if (iomode
== IO_OUTPUT
&& !st
->n
.tb
)
3421 if (iomode
== IO_OUTPUT
)
3424 mio_allocated_string (st
->name
);
3426 /* For IO_INPUT, the above is done in mio_f2k_derived. */
3428 mio_typebound_proc (&st
->n
.tb
);
3432 /* IO a full symtree (in all depth). */
3434 mio_full_typebound_tree (gfc_symtree
** root
)
3438 if (iomode
== IO_OUTPUT
)
3439 gfc_traverse_symtree (*root
, &mio_typebound_symtree
);
3442 while (peek_atom () == ATOM_LPAREN
)
3448 require_atom (ATOM_STRING
);
3449 st
= gfc_get_tbp_symtree (root
, atom_string
);
3450 gfc_free (atom_string
);
3452 mio_typebound_symtree (st
);
3460 mio_finalizer (gfc_finalizer
**f
)
3462 if (iomode
== IO_OUTPUT
)
3465 gcc_assert ((*f
)->proc_tree
); /* Should already be resolved. */
3466 mio_symtree_ref (&(*f
)->proc_tree
);
3470 *f
= gfc_get_finalizer ();
3471 (*f
)->where
= gfc_current_locus
; /* Value should not matter. */
3474 mio_symtree_ref (&(*f
)->proc_tree
);
3475 (*f
)->proc_sym
= NULL
;
3480 mio_f2k_derived (gfc_namespace
*f2k
)
3482 current_f2k_derived
= f2k
;
3484 /* Handle the list of finalizer procedures. */
3486 if (iomode
== IO_OUTPUT
)
3489 for (f
= f2k
->finalizers
; f
; f
= f
->next
)
3494 f2k
->finalizers
= NULL
;
3495 while (peek_atom () != ATOM_RPAREN
)
3497 gfc_finalizer
*cur
= NULL
;
3498 mio_finalizer (&cur
);
3499 cur
->next
= f2k
->finalizers
;
3500 f2k
->finalizers
= cur
;
3505 /* Handle type-bound procedures. */
3506 mio_full_typebound_tree (&f2k
->tb_sym_root
);
3508 /* Type-bound user operators. */
3509 mio_full_typebound_tree (&f2k
->tb_uop_root
);
3511 /* Type-bound intrinsic operators. */
3513 if (iomode
== IO_OUTPUT
)
3516 for (op
= GFC_INTRINSIC_BEGIN
; op
!= GFC_INTRINSIC_END
; ++op
)
3518 gfc_intrinsic_op realop
;
3520 if (op
== INTRINSIC_USER
|| !f2k
->tb_op
[op
])
3524 realop
= (gfc_intrinsic_op
) op
;
3525 mio_intrinsic_op (&realop
);
3526 mio_typebound_proc (&f2k
->tb_op
[op
]);
3531 while (peek_atom () != ATOM_RPAREN
)
3533 gfc_intrinsic_op op
= GFC_INTRINSIC_BEGIN
; /* Silence GCC. */
3536 mio_intrinsic_op (&op
);
3537 mio_typebound_proc (&f2k
->tb_op
[op
]);
3544 mio_full_f2k_derived (gfc_symbol
*sym
)
3548 if (iomode
== IO_OUTPUT
)
3550 if (sym
->f2k_derived
)
3551 mio_f2k_derived (sym
->f2k_derived
);
3555 if (peek_atom () != ATOM_RPAREN
)
3557 sym
->f2k_derived
= gfc_get_namespace (NULL
, 0);
3558 mio_f2k_derived (sym
->f2k_derived
);
3561 gcc_assert (!sym
->f2k_derived
);
3568 /* Unlike most other routines, the address of the symbol node is already
3569 fixed on input and the name/module has already been filled in. */
3572 mio_symbol (gfc_symbol
*sym
)
3574 int intmod
= INTMOD_NONE
;
3578 mio_symbol_attribute (&sym
->attr
);
3579 mio_typespec (&sym
->ts
);
3581 if (iomode
== IO_OUTPUT
)
3582 mio_namespace_ref (&sym
->formal_ns
);
3585 mio_namespace_ref (&sym
->formal_ns
);
3588 sym
->formal_ns
->proc_name
= sym
;
3593 /* Save/restore common block links. */
3594 mio_symbol_ref (&sym
->common_next
);
3596 mio_formal_arglist (&sym
->formal
);
3598 if (sym
->attr
.flavor
== FL_PARAMETER
)
3599 mio_expr (&sym
->value
);
3601 mio_array_spec (&sym
->as
);
3603 mio_symbol_ref (&sym
->result
);
3605 if (sym
->attr
.cray_pointee
)
3606 mio_symbol_ref (&sym
->cp_pointer
);
3608 /* Note that components are always saved, even if they are supposed
3609 to be private. Component access is checked during searching. */
3611 mio_component_list (&sym
->components
, sym
->attr
.vtype
);
3613 if (sym
->components
!= NULL
)
3614 sym
->component_access
3615 = MIO_NAME (gfc_access
) (sym
->component_access
, access_types
);
3617 /* Load/save the f2k_derived namespace of a derived-type symbol. */
3618 mio_full_f2k_derived (sym
);
3622 /* Add the fields that say whether this is from an intrinsic module,
3623 and if so, what symbol it is within the module. */
3624 /* mio_integer (&(sym->from_intmod)); */
3625 if (iomode
== IO_OUTPUT
)
3627 intmod
= sym
->from_intmod
;
3628 mio_integer (&intmod
);
3632 mio_integer (&intmod
);
3633 sym
->from_intmod
= (intmod_id
) intmod
;
3636 mio_integer (&(sym
->intmod_sym_id
));
3638 if (sym
->attr
.flavor
== FL_DERIVED
)
3639 mio_integer (&(sym
->hash_value
));
3645 /************************* Top level subroutines *************************/
3647 /* Given a root symtree node and a symbol, try to find a symtree that
3648 references the symbol that is not a unique name. */
3650 static gfc_symtree
*
3651 find_symtree_for_symbol (gfc_symtree
*st
, gfc_symbol
*sym
)
3653 gfc_symtree
*s
= NULL
;
3658 s
= find_symtree_for_symbol (st
->right
, sym
);
3661 s
= find_symtree_for_symbol (st
->left
, sym
);
3665 if (st
->n
.sym
== sym
&& !check_unique_name (st
->name
))
3672 /* A recursive function to look for a specific symbol by name and by
3673 module. Whilst several symtrees might point to one symbol, its
3674 is sufficient for the purposes here than one exist. Note that
3675 generic interfaces are distinguished as are symbols that have been
3676 renamed in another module. */
3677 static gfc_symtree
*
3678 find_symbol (gfc_symtree
*st
, const char *name
,
3679 const char *module
, int generic
)
3682 gfc_symtree
*retval
, *s
;
3684 if (st
== NULL
|| st
->n
.sym
== NULL
)
3687 c
= strcmp (name
, st
->n
.sym
->name
);
3688 if (c
== 0 && st
->n
.sym
->module
3689 && strcmp (module
, st
->n
.sym
->module
) == 0
3690 && !check_unique_name (st
->name
))
3692 s
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3694 /* Detect symbols that are renamed by use association in another
3695 module by the absence of a symtree and null attr.use_rename,
3696 since the latter is not transmitted in the module file. */
3697 if (((!generic
&& !st
->n
.sym
->attr
.generic
)
3698 || (generic
&& st
->n
.sym
->attr
.generic
))
3699 && !(s
== NULL
&& !st
->n
.sym
->attr
.use_rename
))
3703 retval
= find_symbol (st
->left
, name
, module
, generic
);
3706 retval
= find_symbol (st
->right
, name
, module
, generic
);
3712 /* Skip a list between balanced left and right parens. */
3722 switch (parse_atom ())
3733 gfc_free (atom_string
);
3745 /* Load operator interfaces from the module. Interfaces are unusual
3746 in that they attach themselves to existing symbols. */
3749 load_operator_interfaces (void)
3752 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3754 pointer_info
*pi
= NULL
;
3759 while (peek_atom () != ATOM_RPAREN
)
3763 mio_internal_string (name
);
3764 mio_internal_string (module
);
3766 n
= number_use_names (name
, true);
3769 for (i
= 1; i
<= n
; i
++)
3771 /* Decide if we need to load this one or not. */
3772 p
= find_use_name_n (name
, &i
, true);
3776 while (parse_atom () != ATOM_RPAREN
);
3782 uop
= gfc_get_uop (p
);
3783 pi
= mio_interface_rest (&uop
->op
);
3787 if (gfc_find_uop (p
, NULL
))
3789 uop
= gfc_get_uop (p
);
3790 uop
->op
= gfc_get_interface ();
3791 uop
->op
->where
= gfc_current_locus
;
3792 add_fixup (pi
->integer
, &uop
->op
->sym
);
3801 /* Load interfaces from the module. Interfaces are unusual in that
3802 they attach themselves to existing symbols. */
3805 load_generic_interfaces (void)
3808 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3810 gfc_interface
*generic
= NULL
, *gen
= NULL
;
3812 bool ambiguous_set
= false;
3816 while (peek_atom () != ATOM_RPAREN
)
3820 mio_internal_string (name
);
3821 mio_internal_string (module
);
3823 n
= number_use_names (name
, false);
3824 renamed
= n
? 1 : 0;
3827 for (i
= 1; i
<= n
; i
++)
3830 /* Decide if we need to load this one or not. */
3831 p
= find_use_name_n (name
, &i
, false);
3833 st
= find_symbol (gfc_current_ns
->sym_root
,
3834 name
, module_name
, 1);
3836 if (!p
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
3838 /* Skip the specific names for these cases. */
3839 while (i
== 1 && parse_atom () != ATOM_RPAREN
);
3844 /* If the symbol exists already and is being USEd without being
3845 in an ONLY clause, do not load a new symtree(11.3.2). */
3846 if (!only_flag
&& st
)
3851 /* Make the symbol inaccessible if it has been added by a USE
3852 statement without an ONLY(11.3.2). */
3854 && !st
->n
.sym
->attr
.use_only
3855 && !st
->n
.sym
->attr
.use_rename
3856 && strcmp (st
->n
.sym
->module
, module_name
) == 0)
3859 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3860 st
= gfc_get_unique_symtree (gfc_current_ns
);
3867 if (strcmp (st
->name
, p
) != 0)
3869 st
= gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3875 /* Since we haven't found a valid generic interface, we had
3879 gfc_get_symbol (p
, NULL
, &sym
);
3880 sym
->name
= gfc_get_string (name
);
3881 sym
->module
= gfc_get_string (module_name
);
3882 sym
->attr
.flavor
= FL_PROCEDURE
;
3883 sym
->attr
.generic
= 1;
3884 sym
->attr
.use_assoc
= 1;
3889 /* Unless sym is a generic interface, this reference
3892 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3896 if (st
&& !sym
->attr
.generic
3899 && strcmp(module
, sym
->module
))
3901 ambiguous_set
= true;
3906 sym
->attr
.use_only
= only_flag
;
3907 sym
->attr
.use_rename
= renamed
;
3911 mio_interface_rest (&sym
->generic
);
3912 generic
= sym
->generic
;
3914 else if (!sym
->generic
)
3916 sym
->generic
= generic
;
3917 sym
->attr
.generic_copy
= 1;
3920 /* If a procedure that is not generic has generic interfaces
3921 that include itself, it is generic! We need to take care
3922 to retain symbols ambiguous that were already so. */
3923 if (sym
->attr
.use_assoc
3924 && !sym
->attr
.generic
3925 && sym
->attr
.flavor
== FL_PROCEDURE
)
3927 for (gen
= generic
; gen
; gen
= gen
->next
)
3929 if (gen
->sym
== sym
)
3931 sym
->attr
.generic
= 1;
3946 /* Load common blocks. */
3951 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3956 while (peek_atom () != ATOM_RPAREN
)
3960 mio_internal_string (name
);
3962 p
= gfc_get_common (name
, 1);
3964 mio_symbol_ref (&p
->head
);
3965 mio_integer (&flags
);
3969 p
->threadprivate
= 1;
3972 /* Get whether this was a bind(c) common or not. */
3973 mio_integer (&p
->is_bind_c
);
3974 /* Get the binding label. */
3975 mio_internal_string (p
->binding_label
);
3984 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3985 so that unused variables are not loaded and so that the expression can
3991 gfc_equiv
*head
, *tail
, *end
, *eq
;
3995 in_load_equiv
= true;
3997 end
= gfc_current_ns
->equiv
;
3998 while (end
!= NULL
&& end
->next
!= NULL
)
4001 while (peek_atom () != ATOM_RPAREN
) {
4005 while(peek_atom () != ATOM_RPAREN
)
4008 head
= tail
= gfc_get_equiv ();
4011 tail
->eq
= gfc_get_equiv ();
4015 mio_pool_string (&tail
->module
);
4016 mio_expr (&tail
->expr
);
4019 /* Unused equivalence members have a unique name. In addition, it
4020 must be checked that the symbols are from the same module. */
4022 for (eq
= head
; eq
; eq
= eq
->eq
)
4024 if (eq
->expr
->symtree
->n
.sym
->module
4025 && head
->expr
->symtree
->n
.sym
->module
4026 && strcmp (head
->expr
->symtree
->n
.sym
->module
,
4027 eq
->expr
->symtree
->n
.sym
->module
) == 0
4028 && !check_unique_name (eq
->expr
->symtree
->name
))
4037 for (eq
= head
; eq
; eq
= head
)
4040 gfc_free_expr (eq
->expr
);
4046 gfc_current_ns
->equiv
= head
;
4057 in_load_equiv
= false;
4061 /* This function loads the sym_root of f2k_derived with the extensions to
4062 the derived type. */
4064 load_derived_extensions (void)
4067 gfc_symbol
*derived
;
4071 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
4072 char module
[GFC_MAX_SYMBOL_LEN
+ 1];
4076 while (peek_atom () != ATOM_RPAREN
)
4079 mio_integer (&symbol
);
4080 info
= get_integer (symbol
);
4081 derived
= info
->u
.rsym
.sym
;
4083 /* This one is not being loaded. */
4084 if (!info
|| !derived
)
4086 while (peek_atom () != ATOM_RPAREN
)
4091 gcc_assert (derived
->attr
.flavor
== FL_DERIVED
);
4092 if (derived
->f2k_derived
== NULL
)
4093 derived
->f2k_derived
= gfc_get_namespace (NULL
, 0);
4095 while (peek_atom () != ATOM_RPAREN
)
4098 mio_internal_string (name
);
4099 mio_internal_string (module
);
4101 /* Only use one use name to find the symbol. */
4103 p
= find_use_name_n (name
, &j
, false);
4106 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
4108 st
= gfc_find_symtree (derived
->f2k_derived
->sym_root
, name
);
4111 /* Only use the real name in f2k_derived to ensure a single
4113 st
= gfc_new_symtree (&derived
->f2k_derived
->sym_root
, name
);
4126 /* Recursive function to traverse the pointer_info tree and load a
4127 needed symbol. We return nonzero if we load a symbol and stop the
4128 traversal, because the act of loading can alter the tree. */
4131 load_needed (pointer_info
*p
)
4142 rv
|= load_needed (p
->left
);
4143 rv
|= load_needed (p
->right
);
4145 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
4148 p
->u
.rsym
.state
= USED
;
4150 set_module_locus (&p
->u
.rsym
.where
);
4152 sym
= p
->u
.rsym
.sym
;
4155 q
= get_integer (p
->u
.rsym
.ns
);
4157 ns
= (gfc_namespace
*) q
->u
.pointer
;
4160 /* Create an interface namespace if necessary. These are
4161 the namespaces that hold the formal parameters of module
4164 ns
= gfc_get_namespace (NULL
, 0);
4165 associate_integer_pointer (q
, ns
);
4168 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
4169 doesn't go pear-shaped if the symbol is used. */
4171 gfc_find_symbol (p
->u
.rsym
.module
, gfc_current_ns
,
4174 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
4175 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
4176 strcpy (sym
->binding_label
, p
->u
.rsym
.binding_label
);
4178 associate_integer_pointer (p
, sym
);
4182 sym
->attr
.use_assoc
= 1;
4184 sym
->attr
.use_only
= 1;
4185 if (p
->u
.rsym
.renamed
)
4186 sym
->attr
.use_rename
= 1;
4192 /* Recursive function for cleaning up things after a module has been read. */
4195 read_cleanup (pointer_info
*p
)
4203 read_cleanup (p
->left
);
4204 read_cleanup (p
->right
);
4206 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
4208 /* Add hidden symbols to the symtree. */
4209 q
= get_integer (p
->u
.rsym
.ns
);
4210 st
= gfc_get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
4212 st
->n
.sym
= p
->u
.rsym
.sym
;
4215 /* Fixup any symtree references. */
4216 p
->u
.rsym
.symtree
= st
;
4217 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
4218 p
->u
.rsym
.stfixup
= NULL
;
4221 /* Free unused symbols. */
4222 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
4223 gfc_free_symbol (p
->u
.rsym
.sym
);
4227 /* It is not quite enough to check for ambiguity in the symbols by
4228 the loaded symbol and the new symbol not being identical. */
4230 check_for_ambiguous (gfc_symbol
*st_sym
, pointer_info
*info
)
4234 symbol_attribute attr
;
4236 rsym
= info
->u
.rsym
.sym
;
4240 if (st_sym
->attr
.vtab
|| st_sym
->attr
.vtype
)
4243 /* If the existing symbol is generic from a different module and
4244 the new symbol is generic there can be no ambiguity. */
4245 if (st_sym
->attr
.generic
4247 && strcmp (st_sym
->module
, module_name
))
4249 /* The new symbol's attributes have not yet been read. Since
4250 we need attr.generic, read it directly. */
4251 get_module_locus (&locus
);
4252 set_module_locus (&info
->u
.rsym
.where
);
4255 mio_symbol_attribute (&attr
);
4256 set_module_locus (&locus
);
4265 /* Read a module file. */
4270 module_locus operator_interfaces
, user_operators
, extensions
;
4272 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
4274 int ambiguous
, j
, nuse
, symbol
;
4275 pointer_info
*info
, *q
;
4280 get_module_locus (&operator_interfaces
); /* Skip these for now. */
4283 get_module_locus (&user_operators
);
4287 /* Skip commons, equivalences and derived type extensions for now. */
4291 get_module_locus (&extensions
);
4296 /* Create the fixup nodes for all the symbols. */
4298 while (peek_atom () != ATOM_RPAREN
)
4300 require_atom (ATOM_INTEGER
);
4301 info
= get_integer (atom_int
);
4303 info
->type
= P_SYMBOL
;
4304 info
->u
.rsym
.state
= UNUSED
;
4306 mio_internal_string (info
->u
.rsym
.true_name
);
4307 mio_internal_string (info
->u
.rsym
.module
);
4308 mio_internal_string (info
->u
.rsym
.binding_label
);
4311 require_atom (ATOM_INTEGER
);
4312 info
->u
.rsym
.ns
= atom_int
;
4314 get_module_locus (&info
->u
.rsym
.where
);
4317 /* See if the symbol has already been loaded by a previous module.
4318 If so, we reference the existing symbol and prevent it from
4319 being loaded again. This should not happen if the symbol being
4320 read is an index for an assumed shape dummy array (ns != 1). */
4322 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
4325 || (sym
->attr
.flavor
== FL_VARIABLE
&& info
->u
.rsym
.ns
!=1))
4328 info
->u
.rsym
.state
= USED
;
4329 info
->u
.rsym
.sym
= sym
;
4331 /* Some symbols do not have a namespace (eg. formal arguments),
4332 so the automatic "unique symtree" mechanism must be suppressed
4333 by marking them as referenced. */
4334 q
= get_integer (info
->u
.rsym
.ns
);
4335 if (q
->u
.pointer
== NULL
)
4337 info
->u
.rsym
.referenced
= 1;
4341 /* If possible recycle the symtree that references the symbol.
4342 If a symtree is not found and the module does not import one,
4343 a unique-name symtree is found by read_cleanup. */
4344 st
= find_symtree_for_symbol (gfc_current_ns
->sym_root
, sym
);
4347 info
->u
.rsym
.symtree
= st
;
4348 info
->u
.rsym
.referenced
= 1;
4354 /* Parse the symtree lists. This lets us mark which symbols need to
4355 be loaded. Renaming is also done at this point by replacing the
4360 while (peek_atom () != ATOM_RPAREN
)
4362 mio_internal_string (name
);
4363 mio_integer (&ambiguous
);
4364 mio_integer (&symbol
);
4366 info
= get_integer (symbol
);
4368 /* See how many use names there are. If none, go through the start
4369 of the loop at least once. */
4370 nuse
= number_use_names (name
, false);
4371 info
->u
.rsym
.renamed
= nuse
? 1 : 0;
4376 for (j
= 1; j
<= nuse
; j
++)
4378 /* Get the jth local name for this symbol. */
4379 p
= find_use_name_n (name
, &j
, false);
4381 if (p
== NULL
&& strcmp (name
, module_name
) == 0)
4384 /* Exception: Always import vtabs & vtypes. */
4385 if (p
== NULL
&& (strncmp (name
, "__vtab_", 5) == 0
4386 || strncmp (name
, "__vtype_", 6) == 0))
4389 /* Skip symtree nodes not in an ONLY clause, unless there
4390 is an existing symtree loaded from another USE statement. */
4393 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4395 info
->u
.rsym
.symtree
= st
;
4399 /* If a symbol of the same name and module exists already,
4400 this symbol, which is not in an ONLY clause, must not be
4401 added to the namespace(11.3.2). Note that find_symbol
4402 only returns the first occurrence that it finds. */
4403 if (!only_flag
&& !info
->u
.rsym
.renamed
4404 && strcmp (name
, module_name
) != 0
4405 && find_symbol (gfc_current_ns
->sym_root
, name
,
4409 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
4413 /* Check for ambiguous symbols. */
4414 if (check_for_ambiguous (st
->n
.sym
, info
))
4416 info
->u
.rsym
.symtree
= st
;
4420 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4422 /* Delete the symtree if the symbol has been added by a USE
4423 statement without an ONLY(11.3.2). Remember that the rsym
4424 will be the same as the symbol found in the symtree, for
4426 if (st
&& (only_flag
|| info
->u
.rsym
.renamed
)
4427 && !st
->n
.sym
->attr
.use_only
4428 && !st
->n
.sym
->attr
.use_rename
4429 && info
->u
.rsym
.sym
== st
->n
.sym
)
4430 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
4432 /* Create a symtree node in the current namespace for this
4434 st
= check_unique_name (p
)
4435 ? gfc_get_unique_symtree (gfc_current_ns
)
4436 : gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
4437 st
->ambiguous
= ambiguous
;
4439 sym
= info
->u
.rsym
.sym
;
4441 /* Create a symbol node if it doesn't already exist. */
4444 info
->u
.rsym
.sym
= gfc_new_symbol (info
->u
.rsym
.true_name
,
4446 sym
= info
->u
.rsym
.sym
;
4447 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
4449 /* TODO: hmm, can we test this? Do we know it will be
4450 initialized to zeros? */
4451 if (info
->u
.rsym
.binding_label
[0] != '\0')
4452 strcpy (sym
->binding_label
, info
->u
.rsym
.binding_label
);
4458 if (strcmp (name
, p
) != 0)
4459 sym
->attr
.use_rename
= 1;
4461 /* We need to set the only_flag here so that symbols from the
4462 same USE...ONLY but earlier are not deleted from the tree in
4463 the gfc_delete_symtree above. */
4464 sym
->attr
.use_only
= only_flag
;
4466 /* Store the symtree pointing to this symbol. */
4467 info
->u
.rsym
.symtree
= st
;
4469 if (info
->u
.rsym
.state
== UNUSED
)
4470 info
->u
.rsym
.state
= NEEDED
;
4471 info
->u
.rsym
.referenced
= 1;
4478 /* Load intrinsic operator interfaces. */
4479 set_module_locus (&operator_interfaces
);
4482 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4484 if (i
== INTRINSIC_USER
)
4489 u
= find_use_operator ((gfc_intrinsic_op
) i
);
4500 mio_interface (&gfc_current_ns
->op
[i
]);
4505 /* Load generic and user operator interfaces. These must follow the
4506 loading of symtree because otherwise symbols can be marked as
4509 set_module_locus (&user_operators
);
4511 load_operator_interfaces ();
4512 load_generic_interfaces ();
4517 /* At this point, we read those symbols that are needed but haven't
4518 been loaded yet. If one symbol requires another, the other gets
4519 marked as NEEDED if its previous state was UNUSED. */
4521 while (load_needed (pi_root
));
4523 /* Make sure all elements of the rename-list were found in the module. */
4525 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4530 if (u
->op
== INTRINSIC_NONE
)
4532 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
4533 u
->use_name
, &u
->where
, module_name
);
4537 if (u
->op
== INTRINSIC_USER
)
4539 gfc_error ("User operator '%s' referenced at %L not found "
4540 "in module '%s'", u
->use_name
, &u
->where
, module_name
);
4544 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
4545 "in module '%s'", gfc_op2string (u
->op
), &u
->where
,
4549 /* Now we should be in a position to fill f2k_derived with derived type
4550 extensions, since everything has been loaded. */
4551 set_module_locus (&extensions
);
4552 load_derived_extensions ();
4554 /* Clean up symbol nodes that were never loaded, create references
4555 to hidden symbols. */
4557 read_cleanup (pi_root
);
4561 /* Given an access type that is specific to an entity and the default
4562 access, return nonzero if the entity is publicly accessible. If the
4563 element is declared as PUBLIC, then it is public; if declared
4564 PRIVATE, then private, and otherwise it is public unless the default
4565 access in this context has been declared PRIVATE. */
4568 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
4570 if (specific_access
== ACCESS_PUBLIC
)
4572 if (specific_access
== ACCESS_PRIVATE
)
4575 if (gfc_option
.flag_module_private
)
4576 return default_access
== ACCESS_PUBLIC
;
4578 return default_access
!= ACCESS_PRIVATE
;
4582 /* A structure to remember which commons we've already written. */
4584 struct written_common
4586 BBT_HEADER(written_common
);
4587 const char *name
, *label
;
4590 static struct written_common
*written_commons
= NULL
;
4592 /* Comparison function used for balancing the binary tree. */
4595 compare_written_commons (void *a1
, void *b1
)
4597 const char *aname
= ((struct written_common
*) a1
)->name
;
4598 const char *alabel
= ((struct written_common
*) a1
)->label
;
4599 const char *bname
= ((struct written_common
*) b1
)->name
;
4600 const char *blabel
= ((struct written_common
*) b1
)->label
;
4601 int c
= strcmp (aname
, bname
);
4603 return (c
!= 0 ? c
: strcmp (alabel
, blabel
));
4606 /* Free a list of written commons. */
4609 free_written_common (struct written_common
*w
)
4615 free_written_common (w
->left
);
4617 free_written_common (w
->right
);
4622 /* Write a common block to the module -- recursive helper function. */
4625 write_common_0 (gfc_symtree
*st
, bool this_module
)
4631 struct written_common
*w
;
4632 bool write_me
= true;
4637 write_common_0 (st
->left
, this_module
);
4639 /* We will write out the binding label, or the name if no label given. */
4640 name
= st
->n
.common
->name
;
4642 label
= p
->is_bind_c
? p
->binding_label
: p
->name
;
4644 /* Check if we've already output this common. */
4645 w
= written_commons
;
4648 int c
= strcmp (name
, w
->name
);
4649 c
= (c
!= 0 ? c
: strcmp (label
, w
->label
));
4653 w
= (c
< 0) ? w
->left
: w
->right
;
4656 if (this_module
&& p
->use_assoc
)
4661 /* Write the common to the module. */
4663 mio_pool_string (&name
);
4665 mio_symbol_ref (&p
->head
);
4666 flags
= p
->saved
? 1 : 0;
4667 if (p
->threadprivate
)
4669 mio_integer (&flags
);
4671 /* Write out whether the common block is bind(c) or not. */
4672 mio_integer (&(p
->is_bind_c
));
4674 mio_pool_string (&label
);
4677 /* Record that we have written this common. */
4678 w
= XCNEW (struct written_common
);
4681 gfc_insert_bbt (&written_commons
, w
, compare_written_commons
);
4684 write_common_0 (st
->right
, this_module
);
4688 /* Write a common, by initializing the list of written commons, calling
4689 the recursive function write_common_0() and cleaning up afterwards. */
4692 write_common (gfc_symtree
*st
)
4694 written_commons
= NULL
;
4695 write_common_0 (st
, true);
4696 write_common_0 (st
, false);
4697 free_written_common (written_commons
);
4698 written_commons
= NULL
;
4702 /* Write the blank common block to the module. */
4705 write_blank_common (void)
4707 const char * name
= BLANK_COMMON_NAME
;
4709 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4710 this, but it hasn't been checked. Just making it so for now. */
4713 if (gfc_current_ns
->blank_common
.head
== NULL
)
4718 mio_pool_string (&name
);
4720 mio_symbol_ref (&gfc_current_ns
->blank_common
.head
);
4721 saved
= gfc_current_ns
->blank_common
.saved
;
4722 mio_integer (&saved
);
4724 /* Write out whether the common block is bind(c) or not. */
4725 mio_integer (&is_bind_c
);
4727 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4728 it doesn't matter because the label isn't used. */
4729 mio_pool_string (&name
);
4735 /* Write equivalences to the module. */
4744 for (eq
= gfc_current_ns
->equiv
; eq
; eq
= eq
->next
)
4748 for (e
= eq
; e
; e
= e
->eq
)
4750 if (e
->module
== NULL
)
4751 e
->module
= gfc_get_string ("%s.eq.%d", module_name
, num
);
4752 mio_allocated_string (e
->module
);
4753 mio_expr (&e
->expr
);
4762 /* Write derived type extensions to the module. */
4765 write_dt_extensions (gfc_symtree
*st
)
4767 if (!gfc_check_access (st
->n
.sym
->attr
.access
,
4768 st
->n
.sym
->ns
->default_access
))
4772 mio_pool_string (&st
->n
.sym
->name
);
4773 if (st
->n
.sym
->module
!= NULL
)
4774 mio_pool_string (&st
->n
.sym
->module
);
4776 mio_internal_string (module_name
);
4781 write_derived_extensions (gfc_symtree
*st
)
4783 if (!((st
->n
.sym
->attr
.flavor
== FL_DERIVED
)
4784 && (st
->n
.sym
->f2k_derived
!= NULL
)
4785 && (st
->n
.sym
->f2k_derived
->sym_root
!= NULL
)))
4789 mio_symbol_ref (&(st
->n
.sym
));
4790 gfc_traverse_symtree (st
->n
.sym
->f2k_derived
->sym_root
,
4791 write_dt_extensions
);
4796 /* Write a symbol to the module. */
4799 write_symbol (int n
, gfc_symbol
*sym
)
4803 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
4804 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
4807 mio_pool_string (&sym
->name
);
4809 mio_pool_string (&sym
->module
);
4810 if (sym
->attr
.is_bind_c
|| sym
->attr
.is_iso_c
)
4812 label
= sym
->binding_label
;
4813 mio_pool_string (&label
);
4816 mio_pool_string (&sym
->name
);
4818 mio_pointer_ref (&sym
->ns
);
4825 /* Recursive traversal function to write the initial set of symbols to
4826 the module. We check to see if the symbol should be written
4827 according to the access specification. */
4830 write_symbol0 (gfc_symtree
*st
)
4834 bool dont_write
= false;
4839 write_symbol0 (st
->left
);
4842 if (sym
->module
== NULL
)
4843 sym
->module
= gfc_get_string (module_name
);
4845 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4846 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
4849 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4854 p
= get_pointer (sym
);
4855 if (p
->type
== P_UNKNOWN
)
4858 if (p
->u
.wsym
.state
!= WRITTEN
)
4860 write_symbol (p
->integer
, sym
);
4861 p
->u
.wsym
.state
= WRITTEN
;
4865 write_symbol0 (st
->right
);
4869 /* Recursive traversal function to write the secondary set of symbols
4870 to the module file. These are symbols that were not public yet are
4871 needed by the public symbols or another dependent symbol. The act
4872 of writing a symbol can modify the pointer_info tree, so we cease
4873 traversal if we find a symbol to write. We return nonzero if a
4874 symbol was written and pass that information upwards. */
4877 write_symbol1 (pointer_info
*p
)
4884 result
= write_symbol1 (p
->left
);
4886 if (!(p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
))
4888 p
->u
.wsym
.state
= WRITTEN
;
4889 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
4893 result
|= write_symbol1 (p
->right
);
4898 /* Write operator interfaces associated with a symbol. */
4901 write_operator (gfc_user_op
*uop
)
4903 static char nullstring
[] = "";
4904 const char *p
= nullstring
;
4907 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
4910 mio_symbol_interface (&uop
->name
, &p
, &uop
->op
);
4914 /* Write generic interfaces from the namespace sym_root. */
4917 write_generic (gfc_symtree
*st
)
4924 write_generic (st
->left
);
4925 write_generic (st
->right
);
4928 if (!sym
|| check_unique_name (st
->name
))
4931 if (sym
->generic
== NULL
4932 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4935 if (sym
->module
== NULL
)
4936 sym
->module
= gfc_get_string (module_name
);
4938 mio_symbol_interface (&st
->name
, &sym
->module
, &sym
->generic
);
4943 write_symtree (gfc_symtree
*st
)
4950 /* A symbol in an interface body must not be visible in the
4952 if (sym
->ns
!= gfc_current_ns
4953 && sym
->ns
->proc_name
4954 && sym
->ns
->proc_name
->attr
.if_source
== IFSRC_IFBODY
)
4957 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
4958 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4959 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
4962 if (check_unique_name (st
->name
))
4965 p
= find_pointer (sym
);
4967 gfc_internal_error ("write_symtree(): Symbol not written");
4969 mio_pool_string (&st
->name
);
4970 mio_integer (&st
->ambiguous
);
4971 mio_integer (&p
->integer
);
4980 /* Write the operator interfaces. */
4983 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4985 if (i
== INTRINSIC_USER
)
4988 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
4989 gfc_current_ns
->default_access
)
4990 ? &gfc_current_ns
->op
[i
] : NULL
);
4998 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
5004 write_generic (gfc_current_ns
->sym_root
);
5010 write_blank_common ();
5011 write_common (gfc_current_ns
->common_root
);
5023 gfc_traverse_symtree (gfc_current_ns
->sym_root
,
5024 write_derived_extensions
);
5029 /* Write symbol information. First we traverse all symbols in the
5030 primary namespace, writing those that need to be written.
5031 Sometimes writing one symbol will cause another to need to be
5032 written. A list of these symbols ends up on the write stack, and
5033 we end by popping the bottom of the stack and writing the symbol
5034 until the stack is empty. */
5038 write_symbol0 (gfc_current_ns
->sym_root
);
5039 while (write_symbol1 (pi_root
))
5048 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
5053 /* Read a MD5 sum from the header of a module file. If the file cannot
5054 be opened, or we have any other error, we return -1. */
5057 read_md5_from_module_file (const char * filename
, unsigned char md5
[16])
5063 /* Open the file. */
5064 if ((file
= fopen (filename
, "r")) == NULL
)
5067 /* Read the first line. */
5068 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
5074 /* The file also needs to be overwritten if the version number changed. */
5075 n
= strlen ("GFORTRAN module version '" MOD_VERSION
"' created");
5076 if (strncmp (buf
, "GFORTRAN module version '" MOD_VERSION
"' created", n
) != 0)
5082 /* Read a second line. */
5083 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
5089 /* Close the file. */
5092 /* If the header is not what we expect, or is too short, bail out. */
5093 if (strncmp (buf
, "MD5:", 4) != 0 || strlen (buf
) < 4 + 16)
5096 /* Now, we have a real MD5, read it into the array. */
5097 for (n
= 0; n
< 16; n
++)
5101 if (sscanf (&(buf
[4+2*n
]), "%02x", &x
) != 1)
5111 /* Given module, dump it to disk. If there was an error while
5112 processing the module, dump_flag will be set to zero and we delete
5113 the module file, even if it was already there. */
5116 gfc_dump_module (const char *name
, int dump_flag
)
5119 char *filename
, *filename_tmp
, *p
;
5122 unsigned char md5_new
[16], md5_old
[16];
5124 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
5125 if (gfc_option
.module_dir
!= NULL
)
5127 n
+= strlen (gfc_option
.module_dir
);
5128 filename
= (char *) alloca (n
);
5129 strcpy (filename
, gfc_option
.module_dir
);
5130 strcat (filename
, name
);
5134 filename
= (char *) alloca (n
);
5135 strcpy (filename
, name
);
5137 strcat (filename
, MODULE_EXTENSION
);
5139 /* Name of the temporary file used to write the module. */
5140 filename_tmp
= (char *) alloca (n
+ 1);
5141 strcpy (filename_tmp
, filename
);
5142 strcat (filename_tmp
, "0");
5144 /* There was an error while processing the module. We delete the
5145 module file, even if it was already there. */
5152 if (gfc_cpp_makedep ())
5153 gfc_cpp_add_target (filename
);
5155 /* Write the module to the temporary file. */
5156 module_fp
= fopen (filename_tmp
, "w");
5157 if (module_fp
== NULL
)
5158 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
5159 filename_tmp
, xstrerror (errno
));
5161 /* Write the header, including space reserved for the MD5 sum. */
5165 *strchr (p
, '\n') = '\0';
5167 fprintf (module_fp
, "GFORTRAN module version '%s' created from %s on %s\n"
5168 "MD5:", MOD_VERSION
, gfc_source_file
, p
);
5169 fgetpos (module_fp
, &md5_pos
);
5170 fputs ("00000000000000000000000000000000 -- "
5171 "If you edit this, you'll get what you deserve.\n\n", module_fp
);
5173 /* Initialize the MD5 context that will be used for output. */
5174 md5_init_ctx (&ctx
);
5176 /* Write the module itself. */
5178 strcpy (module_name
, name
);
5184 free_pi_tree (pi_root
);
5189 /* Write the MD5 sum to the header of the module file. */
5190 md5_finish_ctx (&ctx
, md5_new
);
5191 fsetpos (module_fp
, &md5_pos
);
5192 for (n
= 0; n
< 16; n
++)
5193 fprintf (module_fp
, "%02x", md5_new
[n
]);
5195 if (fclose (module_fp
))
5196 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
5197 filename_tmp
, xstrerror (errno
));
5199 /* Read the MD5 from the header of the old module file and compare. */
5200 if (read_md5_from_module_file (filename
, md5_old
) != 0
5201 || memcmp (md5_old
, md5_new
, sizeof (md5_old
)) != 0)
5203 /* Module file have changed, replace the old one. */
5204 if (unlink (filename
) && errno
!= ENOENT
)
5205 gfc_fatal_error ("Can't delete module file '%s': %s", filename
,
5207 if (rename (filename_tmp
, filename
))
5208 gfc_fatal_error ("Can't rename module file '%s' to '%s': %s",
5209 filename_tmp
, filename
, xstrerror (errno
));
5213 if (unlink (filename_tmp
))
5214 gfc_fatal_error ("Can't delete temporary module file '%s': %s",
5215 filename_tmp
, xstrerror (errno
));
5221 create_intrinsic_function (const char *name
, gfc_isym_id id
,
5222 const char *modname
, intmod_id module
)
5224 gfc_intrinsic_sym
*isym
;
5225 gfc_symtree
*tmp_symtree
;
5228 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
5231 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
5233 gfc_error ("Symbol '%s' already declared", name
);
5236 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
, false);
5237 sym
= tmp_symtree
->n
.sym
;
5239 isym
= gfc_intrinsic_function_by_id (id
);
5242 sym
->attr
.flavor
= FL_PROCEDURE
;
5243 sym
->attr
.intrinsic
= 1;
5245 sym
->module
= gfc_get_string (modname
);
5246 sym
->attr
.use_assoc
= 1;
5247 sym
->from_intmod
= module
;
5248 sym
->intmod_sym_id
= id
;
5252 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
5253 the current namespace for all named constants, pointer types, and
5254 procedures in the module unless the only clause was used or a rename
5255 list was provided. */
5258 import_iso_c_binding_module (void)
5260 gfc_symbol
*mod_sym
= NULL
;
5261 gfc_symtree
*mod_symtree
= NULL
;
5262 const char *iso_c_module_name
= "__iso_c_binding";
5266 /* Look only in the current namespace. */
5267 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, iso_c_module_name
);
5269 if (mod_symtree
== NULL
)
5271 /* symtree doesn't already exist in current namespace. */
5272 gfc_get_sym_tree (iso_c_module_name
, gfc_current_ns
, &mod_symtree
,
5275 if (mod_symtree
!= NULL
)
5276 mod_sym
= mod_symtree
->n
.sym
;
5278 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
5279 "create symbol for %s", iso_c_module_name
);
5281 mod_sym
->attr
.flavor
= FL_MODULE
;
5282 mod_sym
->attr
.intrinsic
= 1;
5283 mod_sym
->module
= gfc_get_string (iso_c_module_name
);
5284 mod_sym
->from_intmod
= INTMOD_ISO_C_BINDING
;
5287 /* Generate the symbols for the named constants representing
5288 the kinds for intrinsic data types. */
5289 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
5292 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5293 if (strcmp (c_interop_kinds_table
[i
].name
, u
->use_name
) == 0)
5299 #define NAMED_FUNCTION(a,b,c,d) \
5301 create_intrinsic_function (u->local_name[0] ? u->local_name \
5304 iso_c_module_name, \
5305 INTMOD_ISO_C_BINDING); \
5307 #include "iso-c-binding.def"
5308 #undef NAMED_FUNCTION
5311 generate_isocbinding_symbol (iso_c_module_name
,
5312 (iso_c_binding_symbol
) i
,
5313 u
->local_name
[0] ? u
->local_name
5318 if (!found
&& !only_flag
)
5321 #define NAMED_FUNCTION(a,b,c,d) \
5323 if ((gfc_option.allow_std & d) == 0) \
5325 create_intrinsic_function (b, (gfc_isym_id) c, \
5326 iso_c_module_name, \
5327 INTMOD_ISO_C_BINDING); \
5329 #include "iso-c-binding.def"
5330 #undef NAMED_FUNCTION
5333 generate_isocbinding_symbol (iso_c_module_name
,
5334 (iso_c_binding_symbol
) i
, NULL
);
5338 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5343 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5344 "module ISO_C_BINDING", u
->use_name
, &u
->where
);
5349 /* Add an integer named constant from a given module. */
5352 create_int_parameter (const char *name
, int value
, const char *modname
,
5353 intmod_id module
, int id
)
5355 gfc_symtree
*tmp_symtree
;
5358 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
5359 if (tmp_symtree
!= NULL
)
5361 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
5364 gfc_error ("Symbol '%s' already declared", name
);
5367 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
, false);
5368 sym
= tmp_symtree
->n
.sym
;
5370 sym
->module
= gfc_get_string (modname
);
5371 sym
->attr
.flavor
= FL_PARAMETER
;
5372 sym
->ts
.type
= BT_INTEGER
;
5373 sym
->ts
.kind
= gfc_default_integer_kind
;
5374 sym
->value
= gfc_get_int_expr (gfc_default_integer_kind
, NULL
, value
);
5375 sym
->attr
.use_assoc
= 1;
5376 sym
->from_intmod
= module
;
5377 sym
->intmod_sym_id
= id
;
5381 /* Value is already contained by the array constructor, but not
5385 create_int_parameter_array (const char *name
, int size
, gfc_expr
*value
,
5386 const char *modname
, intmod_id module
, int id
)
5388 gfc_symtree
*tmp_symtree
;
5391 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
5392 if (tmp_symtree
!= NULL
)
5394 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
5397 gfc_error ("Symbol '%s' already declared", name
);
5400 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
, false);
5401 sym
= tmp_symtree
->n
.sym
;
5403 sym
->module
= gfc_get_string (modname
);
5404 sym
->attr
.flavor
= FL_PARAMETER
;
5405 sym
->ts
.type
= BT_INTEGER
;
5406 sym
->ts
.kind
= gfc_default_integer_kind
;
5407 sym
->attr
.use_assoc
= 1;
5408 sym
->from_intmod
= module
;
5409 sym
->intmod_sym_id
= id
;
5410 sym
->attr
.dimension
= 1;
5411 sym
->as
= gfc_get_array_spec ();
5413 sym
->as
->type
= AS_EXPLICIT
;
5414 sym
->as
->lower
[0] = gfc_get_int_expr (gfc_default_integer_kind
, NULL
, 1);
5415 sym
->as
->upper
[0] = gfc_get_int_expr (gfc_default_integer_kind
, NULL
, size
);
5418 sym
->value
->shape
= gfc_get_shape (1);
5419 mpz_init_set_ui (sym
->value
->shape
[0], size
);
5424 /* USE the ISO_FORTRAN_ENV intrinsic module. */
5427 use_iso_fortran_env_module (void)
5429 static char mod
[] = "iso_fortran_env";
5431 gfc_symbol
*mod_sym
;
5432 gfc_symtree
*mod_symtree
;
5436 intmod_sym symbol
[] = {
5437 #define NAMED_INTCST(a,b,c,d) { a, b, 0, d },
5438 #include "iso-fortran-env.def"
5440 #define NAMED_KINDARRAY(a,b,c,d) { a, b, 0, d },
5441 #include "iso-fortran-env.def"
5442 #undef NAMED_KINDARRAY
5443 #define NAMED_FUNCTION(a,b,c,d) { a, b, c, d },
5444 #include "iso-fortran-env.def"
5445 #undef NAMED_FUNCTION
5446 { ISOFORTRANENV_INVALID
, NULL
, -1234, 0 } };
5449 #define NAMED_INTCST(a,b,c,d) symbol[i++].value = c;
5450 #include "iso-fortran-env.def"
5453 /* Generate the symbol for the module itself. */
5454 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, mod
);
5455 if (mod_symtree
== NULL
)
5457 gfc_get_sym_tree (mod
, gfc_current_ns
, &mod_symtree
, false);
5458 gcc_assert (mod_symtree
);
5459 mod_sym
= mod_symtree
->n
.sym
;
5461 mod_sym
->attr
.flavor
= FL_MODULE
;
5462 mod_sym
->attr
.intrinsic
= 1;
5463 mod_sym
->module
= gfc_get_string (mod
);
5464 mod_sym
->from_intmod
= INTMOD_ISO_FORTRAN_ENV
;
5467 if (!mod_symtree
->n
.sym
->attr
.intrinsic
)
5468 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
5469 "non-intrinsic module name used previously", mod
);
5471 /* Generate the symbols for the module integer named constants. */
5473 for (i
= 0; symbol
[i
].name
; i
++)
5476 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5478 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
5483 if (gfc_notify_std (symbol
[i
].standard
, "The symbol '%s', "
5484 "referrenced at %C, is not in the selected "
5485 "standard", symbol
[i
].name
) == FAILURE
)
5488 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5489 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5490 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named "
5491 "constant from intrinsic module "
5492 "ISO_FORTRAN_ENV at %C is incompatible with "
5494 gfc_option
.flag_default_integer
5495 ? "-fdefault-integer-8"
5496 : "-fdefault-real-8");
5497 switch (symbol
[i
].id
)
5499 #define NAMED_INTCST(a,b,c,d) \
5501 #include "iso-fortran-env.def"
5503 create_int_parameter (u
->local_name
[0] ? u
->local_name
5505 symbol
[i
].value
, mod
,
5506 INTMOD_ISO_FORTRAN_ENV
, symbol
[i
].id
);
5509 #define NAMED_KINDARRAY(a,b,KINDS,d) \
5511 expr = gfc_get_array_expr (BT_INTEGER, \
5512 gfc_default_integer_kind,\
5514 for (j = 0; KINDS[j].kind != 0; j++) \
5515 gfc_constructor_append_expr (&expr->value.constructor, \
5516 gfc_get_int_expr (gfc_default_integer_kind, NULL, \
5517 KINDS[j].kind), NULL); \
5518 create_int_parameter_array (u->local_name[0] ? u->local_name \
5521 INTMOD_ISO_FORTRAN_ENV, \
5524 #include "iso-fortran-env.def"
5525 #undef NAMED_KINDARRAY
5527 #define NAMED_FUNCTION(a,b,c,d) \
5529 #include "iso-fortran-env.def"
5530 #undef NAMED_FUNCTION
5531 create_intrinsic_function (u
->local_name
[0] ? u
->local_name
5533 (gfc_isym_id
) symbol
[i
].value
, mod
,
5534 INTMOD_ISO_FORTRAN_ENV
);
5543 if (!found
&& !only_flag
)
5545 if ((gfc_option
.allow_std
& symbol
[i
].standard
) == 0)
5548 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
5549 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
5550 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5551 "from intrinsic module ISO_FORTRAN_ENV at %C is "
5552 "incompatible with option %s",
5553 gfc_option
.flag_default_integer
5554 ? "-fdefault-integer-8" : "-fdefault-real-8");
5556 switch (symbol
[i
].id
)
5558 #define NAMED_INTCST(a,b,c,d) \
5560 #include "iso-fortran-env.def"
5562 create_int_parameter (symbol
[i
].name
, symbol
[i
].value
, mod
,
5563 INTMOD_ISO_FORTRAN_ENV
, symbol
[i
].id
);
5566 #define NAMED_KINDARRAY(a,b,KINDS,d) \
5568 expr = gfc_get_array_expr (BT_INTEGER, gfc_default_integer_kind, \
5570 for (j = 0; KINDS[j].kind != 0; j++) \
5571 gfc_constructor_append_expr (&expr->value.constructor, \
5572 gfc_get_int_expr (gfc_default_integer_kind, NULL, \
5573 KINDS[j].kind), NULL); \
5574 create_int_parameter_array (symbol[i].name, j, expr, mod, \
5575 INTMOD_ISO_FORTRAN_ENV, symbol[i].id);\
5577 #include "iso-fortran-env.def"
5578 #undef NAMED_KINDARRAY
5580 #define NAMED_FUNCTION(a,b,c,d) \
5582 #include "iso-fortran-env.def"
5583 #undef NAMED_FUNCTION
5584 create_intrinsic_function (symbol
[i
].name
,
5585 (gfc_isym_id
) symbol
[i
].value
, mod
,
5586 INTMOD_ISO_FORTRAN_ENV
);
5595 for (u
= gfc_rename_list
; u
; u
= u
->next
)
5600 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5601 "module ISO_FORTRAN_ENV", u
->use_name
, &u
->where
);
5606 /* Process a USE directive. */
5609 gfc_use_module (void)
5614 gfc_symtree
*mod_symtree
;
5615 gfc_use_list
*use_stmt
;
5617 filename
= (char *) alloca (strlen (module_name
) + strlen (MODULE_EXTENSION
)
5619 strcpy (filename
, module_name
);
5620 strcat (filename
, MODULE_EXTENSION
);
5622 /* First, try to find an non-intrinsic module, unless the USE statement
5623 specified that the module is intrinsic. */
5626 module_fp
= gfc_open_included_file (filename
, true, true);
5628 /* Then, see if it's an intrinsic one, unless the USE statement
5629 specified that the module is non-intrinsic. */
5630 if (module_fp
== NULL
&& !specified_nonint
)
5632 if (strcmp (module_name
, "iso_fortran_env") == 0
5633 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: ISO_FORTRAN_ENV "
5634 "intrinsic module at %C") != FAILURE
)
5636 use_iso_fortran_env_module ();
5640 if (strcmp (module_name
, "iso_c_binding") == 0
5641 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
5642 "ISO_C_BINDING module at %C") != FAILURE
)
5644 import_iso_c_binding_module();
5648 module_fp
= gfc_open_intrinsic_module (filename
);
5650 if (module_fp
== NULL
&& specified_int
)
5651 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
5655 if (module_fp
== NULL
)
5656 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
5657 filename
, xstrerror (errno
));
5659 /* Check that we haven't already USEd an intrinsic module with the
5662 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, module_name
);
5663 if (mod_symtree
&& mod_symtree
->n
.sym
->attr
.intrinsic
)
5664 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
5665 "intrinsic module name used previously", module_name
);
5672 /* Skip the first two lines of the module, after checking that this is
5673 a gfortran module file. */
5679 bad_module ("Unexpected end of module");
5682 if ((start
== 1 && strcmp (atom_name
, "GFORTRAN") != 0)
5683 || (start
== 2 && strcmp (atom_name
, " module") != 0))
5684 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
5688 if (strcmp (atom_name
, " version") != 0
5689 || module_char () != ' '
5690 || parse_atom () != ATOM_STRING
)
5691 gfc_fatal_error ("Parse error when checking module version"
5692 " for file '%s' opened at %C", filename
);
5694 if (strcmp (atom_string
, MOD_VERSION
))
5696 gfc_fatal_error ("Wrong module version '%s' (expected '%s') "
5697 "for file '%s' opened at %C", atom_string
,
5698 MOD_VERSION
, filename
);
5701 gfc_free (atom_string
);
5708 /* Make sure we're not reading the same module that we may be building. */
5709 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
5710 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
5711 gfc_fatal_error ("Can't USE the same module we're building!");
5714 init_true_name_tree ();
5718 free_true_name (true_name_root
);
5719 true_name_root
= NULL
;
5721 free_pi_tree (pi_root
);
5726 use_stmt
= gfc_get_use_list ();
5727 use_stmt
->module_name
= gfc_get_string (module_name
);
5728 use_stmt
->only_flag
= only_flag
;
5729 use_stmt
->rename
= gfc_rename_list
;
5730 use_stmt
->where
= use_locus
;
5731 gfc_rename_list
= NULL
;
5732 use_stmt
->next
= gfc_current_ns
->use_stmts
;
5733 gfc_current_ns
->use_stmts
= use_stmt
;
5738 gfc_free_use_stmts (gfc_use_list
*use_stmts
)
5741 for (; use_stmts
; use_stmts
= next
)
5743 gfc_use_rename
*next_rename
;
5745 for (; use_stmts
->rename
; use_stmts
->rename
= next_rename
)
5747 next_rename
= use_stmts
->rename
->next
;
5748 gfc_free (use_stmts
->rename
);
5750 next
= use_stmts
->next
;
5751 gfc_free (use_stmts
);
5757 gfc_module_init_2 (void)
5759 last_atom
= ATOM_LPAREN
;
5764 gfc_module_done_2 (void)