1 /* Handle modules, which amounts to loading and saving symbols and
2 their attendant structures.
3 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
5 Contributed by Andy Vaught
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* The syntax of gfortran modules resembles that of lisp lists, ie a
24 sequence of atoms, which can be left or right parenthesis, names,
25 integers or strings. Parenthesis are always matched which allows
26 us to skip over sections at high speed without having to know
27 anything about the internal structure of the lists. A "name" is
28 usually a fortran 95 identifier, but can also start with '@' in
29 order to reference a hidden symbol.
31 The first line of a module is an informational message about what
32 created the module, the file it came from and when it was created.
33 The second line is a warning for people not to edit the module.
34 The rest of the module looks like:
36 ( ( <Interface info for UPLUS> )
37 ( <Interface info for UMINUS> )
40 ( ( <name of operator interface> <module of op interface> <i/f1> ... )
43 ( ( <name of generic interface> <module of generic interface> <i/f1> ... )
46 ( ( <common name> <symbol> <saved flag>)
52 ( <Symbol Number (in no particular order)>
54 <Module name of symbol>
55 ( <symbol information> )
64 In general, symbols refer to other symbols by their symbol number,
65 which are zero based. Symbols are written to the module in no
73 #include "parse.h" /* FIXME */
76 #define MODULE_EXTENSION ".mod"
79 /* Structure that describes a position within a module file. */
88 /* Structure for list of symbols of intrinsic modules. */
100 P_UNKNOWN
= 0, P_OTHER
, P_NAMESPACE
, P_COMPONENT
, P_SYMBOL
104 /* The fixup structure lists pointers to pointers that have to
105 be updated when a pointer value becomes known. */
107 typedef struct fixup_t
110 struct fixup_t
*next
;
115 /* Structure for holding extra info needed for pointers being read. */
117 typedef struct pointer_info
119 BBT_HEADER (pointer_info
);
123 /* The first component of each member of the union is the pointer
130 void *pointer
; /* Member for doing pointer searches. */
135 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
137 { UNUSED
, NEEDED
, USED
}
139 int ns
, referenced
, renamed
;
142 gfc_symtree
*symtree
;
143 char binding_label
[GFC_MAX_SYMBOL_LEN
+ 1];
151 { UNREFERENCED
= 0, NEEDS_WRITE
, WRITTEN
}
161 #define gfc_get_pointer_info() gfc_getmem(sizeof(pointer_info))
164 /* Lists of rename info for the USE statement. */
166 typedef struct gfc_use_rename
168 char local_name
[GFC_MAX_SYMBOL_LEN
+ 1], use_name
[GFC_MAX_SYMBOL_LEN
+ 1];
169 struct gfc_use_rename
*next
;
171 gfc_intrinsic_op
operator;
176 #define gfc_get_use_rename() gfc_getmem(sizeof(gfc_use_rename))
178 /* Local variables */
180 /* The FILE for the module we're reading or writing. */
181 static FILE *module_fp
;
183 /* MD5 context structure. */
184 static struct md5_ctx ctx
;
186 /* The name of the module we're reading (USE'ing) or writing. */
187 static char module_name
[GFC_MAX_SYMBOL_LEN
+ 1];
189 /* The way the module we're reading was specified. */
190 static bool specified_nonint
, specified_int
;
192 static int module_line
, module_column
, only_flag
;
194 { IO_INPUT
, IO_OUTPUT
}
197 static gfc_use_rename
*gfc_rename_list
;
198 static pointer_info
*pi_root
;
199 static int symbol_number
; /* Counter for assigning symbol numbers */
201 /* Tells mio_expr_ref to make symbols for unused equivalence members. */
202 static bool in_load_equiv
;
206 /*****************************************************************/
208 /* Pointer/integer conversion. Pointers between structures are stored
209 as integers in the module file. The next couple of subroutines
210 handle this translation for reading and writing. */
212 /* Recursively free the tree of pointer structures. */
215 free_pi_tree (pointer_info
*p
)
220 if (p
->fixup
!= NULL
)
221 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
223 free_pi_tree (p
->left
);
224 free_pi_tree (p
->right
);
230 /* Compare pointers when searching by pointer. Used when writing a
234 compare_pointers (void *_sn1
, void *_sn2
)
236 pointer_info
*sn1
, *sn2
;
238 sn1
= (pointer_info
*) _sn1
;
239 sn2
= (pointer_info
*) _sn2
;
241 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
243 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
250 /* Compare integers when searching by integer. Used when reading a
254 compare_integers (void *_sn1
, void *_sn2
)
256 pointer_info
*sn1
, *sn2
;
258 sn1
= (pointer_info
*) _sn1
;
259 sn2
= (pointer_info
*) _sn2
;
261 if (sn1
->integer
< sn2
->integer
)
263 if (sn1
->integer
> sn2
->integer
)
270 /* Initialize the pointer_info tree. */
279 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
281 /* Pointer 0 is the NULL pointer. */
282 p
= gfc_get_pointer_info ();
287 gfc_insert_bbt (&pi_root
, p
, compare
);
289 /* Pointer 1 is the current namespace. */
290 p
= gfc_get_pointer_info ();
291 p
->u
.pointer
= gfc_current_ns
;
293 p
->type
= P_NAMESPACE
;
295 gfc_insert_bbt (&pi_root
, p
, compare
);
301 /* During module writing, call here with a pointer to something,
302 returning the pointer_info node. */
304 static pointer_info
*
305 find_pointer (void *gp
)
312 if (p
->u
.pointer
== gp
)
314 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
321 /* Given a pointer while writing, returns the pointer_info tree node,
322 creating it if it doesn't exist. */
324 static pointer_info
*
325 get_pointer (void *gp
)
329 p
= find_pointer (gp
);
333 /* Pointer doesn't have an integer. Give it one. */
334 p
= gfc_get_pointer_info ();
337 p
->integer
= symbol_number
++;
339 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
345 /* Given an integer during reading, find it in the pointer_info tree,
346 creating the node if not found. */
348 static pointer_info
*
349 get_integer (int integer
)
359 c
= compare_integers (&t
, p
);
363 p
= (c
< 0) ? p
->left
: p
->right
;
369 p
= gfc_get_pointer_info ();
370 p
->integer
= integer
;
373 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
379 /* Recursive function to find a pointer within a tree by brute force. */
381 static pointer_info
*
382 fp2 (pointer_info
*p
, const void *target
)
389 if (p
->u
.pointer
== target
)
392 q
= fp2 (p
->left
, target
);
396 return fp2 (p
->right
, target
);
400 /* During reading, find a pointer_info node from the pointer value.
401 This amounts to a brute-force search. */
403 static pointer_info
*
404 find_pointer2 (void *p
)
406 return fp2 (pi_root
, p
);
410 /* Resolve any fixups using a known pointer. */
413 resolve_fixups (fixup_t
*f
, void *gp
)
426 /* Call here during module reading when we know what pointer to
427 associate with an integer. Any fixups that exist are resolved at
431 associate_integer_pointer (pointer_info
*p
, void *gp
)
433 if (p
->u
.pointer
!= NULL
)
434 gfc_internal_error ("associate_integer_pointer(): Already associated");
438 resolve_fixups (p
->fixup
, gp
);
444 /* During module reading, given an integer and a pointer to a pointer,
445 either store the pointer from an already-known value or create a
446 fixup structure in order to store things later. Returns zero if
447 the reference has been actually stored, or nonzero if the reference
448 must be fixed later (ie associate_integer_pointer must be called
449 sometime later. Returns the pointer_info structure. */
451 static pointer_info
*
452 add_fixup (int integer
, void *gp
)
458 p
= get_integer (integer
);
460 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
467 f
= gfc_getmem (sizeof (fixup_t
));
479 /*****************************************************************/
481 /* Parser related subroutines */
483 /* Free the rename list left behind by a USE statement. */
488 gfc_use_rename
*next
;
490 for (; gfc_rename_list
; gfc_rename_list
= next
)
492 next
= gfc_rename_list
->next
;
493 gfc_free (gfc_rename_list
);
498 /* Match a USE statement. */
503 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module_nature
[GFC_MAX_SYMBOL_LEN
+ 1];
504 gfc_use_rename
*tail
= NULL
, *new;
505 interface_type type
, type2
;
506 gfc_intrinsic_op
operator;
509 specified_int
= false;
510 specified_nonint
= false;
512 if (gfc_match (" , ") == MATCH_YES
)
514 if ((m
= gfc_match (" %n ::", module_nature
)) == MATCH_YES
)
516 if (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: module "
517 "nature in USE statement at %C") == FAILURE
)
520 if (strcmp (module_nature
, "intrinsic") == 0)
521 specified_int
= true;
524 if (strcmp (module_nature
, "non_intrinsic") == 0)
525 specified_nonint
= true;
528 gfc_error ("Module nature in USE statement at %C shall "
529 "be either INTRINSIC or NON_INTRINSIC");
536 /* Help output a better error message than "Unclassifiable
538 gfc_match (" %n", module_nature
);
539 if (strcmp (module_nature
, "intrinsic") == 0
540 || strcmp (module_nature
, "non_intrinsic") == 0)
541 gfc_error ("\"::\" was expected after module nature at %C "
542 "but was not found");
548 m
= gfc_match (" ::");
549 if (m
== MATCH_YES
&&
550 gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
551 "\"USE :: module\" at %C") == FAILURE
)
556 m
= gfc_match ("% ");
562 m
= gfc_match_name (module_name
);
569 if (gfc_match_eos () == MATCH_YES
)
571 if (gfc_match_char (',') != MATCH_YES
)
574 if (gfc_match (" only :") == MATCH_YES
)
577 if (gfc_match_eos () == MATCH_YES
)
582 /* Get a new rename struct and add it to the rename list. */
583 new = gfc_get_use_rename ();
584 new->where
= gfc_current_locus
;
587 if (gfc_rename_list
== NULL
)
588 gfc_rename_list
= new;
593 /* See what kind of interface we're dealing with. Assume it is
595 new->operator = INTRINSIC_NONE
;
596 if (gfc_match_generic_spec (&type
, name
, &operator) == MATCH_ERROR
)
601 case INTERFACE_NAMELESS
:
602 gfc_error ("Missing generic specification in USE statement at %C");
605 case INTERFACE_USER_OP
:
606 case INTERFACE_GENERIC
:
607 m
= gfc_match (" =>");
609 if (type
== INTERFACE_USER_OP
&& m
== MATCH_YES
610 && (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: Renaming "
611 "operators in USE statements at %C")
615 if (type
== INTERFACE_USER_OP
)
616 new->operator = INTRINSIC_USER
;
621 strcpy (new->use_name
, name
);
624 strcpy (new->local_name
, name
);
625 m
= gfc_match_generic_spec (&type2
, new->use_name
, &operator);
630 if (m
== MATCH_ERROR
)
638 strcpy (new->local_name
, name
);
640 m
= gfc_match_generic_spec (&type2
, new->use_name
, &operator);
645 if (m
== MATCH_ERROR
)
649 if (strcmp (new->use_name
, module_name
) == 0
650 || strcmp (new->local_name
, module_name
) == 0)
652 gfc_error ("The name '%s' at %C has already been used as "
653 "an external module name.", module_name
);
658 case INTERFACE_INTRINSIC_OP
:
659 new->operator = operator;
666 if (gfc_match_eos () == MATCH_YES
)
668 if (gfc_match_char (',') != MATCH_YES
)
675 gfc_syntax_error (ST_USE
);
683 /* Given a name and a number, inst, return the inst name
684 under which to load this symbol. Returns NULL if this
685 symbol shouldn't be loaded. If inst is zero, returns
686 the number of instances of this name. If interface is
687 true, a user-defined operator is sought, otherwise only
688 non-operators are sought. */
691 find_use_name_n (const char *name
, int *inst
, bool interface
)
697 for (u
= gfc_rename_list
; u
; u
= u
->next
)
699 if (strcmp (u
->use_name
, name
) != 0
700 || (u
->operator == INTRINSIC_USER
&& !interface
)
701 || (u
->operator != INTRINSIC_USER
&& interface
))
714 return only_flag
? NULL
: name
;
718 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
722 /* Given a name, return the name under which to load this symbol.
723 Returns NULL if this symbol shouldn't be loaded. */
726 find_use_name (const char *name
, bool interface
)
729 return find_use_name_n (name
, &i
, interface
);
733 /* Given a real name, return the number of use names associated with it. */
736 number_use_names (const char *name
, bool interface
)
740 c
= find_use_name_n (name
, &i
, interface
);
745 /* Try to find the operator in the current list. */
747 static gfc_use_rename
*
748 find_use_operator (gfc_intrinsic_op
operator)
752 for (u
= gfc_rename_list
; u
; u
= u
->next
)
753 if (u
->operator == operator)
760 /*****************************************************************/
762 /* The next couple of subroutines maintain a tree used to avoid a
763 brute-force search for a combination of true name and module name.
764 While symtree names, the name that a particular symbol is known by
765 can changed with USE statements, we still have to keep track of the
766 true names to generate the correct reference, and also avoid
767 loading the same real symbol twice in a program unit.
769 When we start reading, the true name tree is built and maintained
770 as symbols are read. The tree is searched as we load new symbols
771 to see if it already exists someplace in the namespace. */
773 typedef struct true_name
775 BBT_HEADER (true_name
);
780 static true_name
*true_name_root
;
783 /* Compare two true_name structures. */
786 compare_true_names (void *_t1
, void *_t2
)
791 t1
= (true_name
*) _t1
;
792 t2
= (true_name
*) _t2
;
794 c
= ((t1
->sym
->module
> t2
->sym
->module
)
795 - (t1
->sym
->module
< t2
->sym
->module
));
799 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
803 /* Given a true name, search the true name tree to see if it exists
804 within the main namespace. */
807 find_true_name (const char *name
, const char *module
)
813 sym
.name
= gfc_get_string (name
);
815 sym
.module
= gfc_get_string (module
);
823 c
= compare_true_names ((void *) (&t
), (void *) p
);
827 p
= (c
< 0) ? p
->left
: p
->right
;
834 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
837 add_true_name (gfc_symbol
*sym
)
841 t
= gfc_getmem (sizeof (true_name
));
844 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
848 /* Recursive function to build the initial true name tree by
849 recursively traversing the current namespace. */
852 build_tnt (gfc_symtree
*st
)
857 build_tnt (st
->left
);
858 build_tnt (st
->right
);
860 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
863 add_true_name (st
->n
.sym
);
867 /* Initialize the true name tree with the current namespace. */
870 init_true_name_tree (void)
872 true_name_root
= NULL
;
873 build_tnt (gfc_current_ns
->sym_root
);
877 /* Recursively free a true name tree node. */
880 free_true_name (true_name
*t
)
884 free_true_name (t
->left
);
885 free_true_name (t
->right
);
891 /*****************************************************************/
893 /* Module reading and writing. */
897 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
901 static atom_type last_atom
;
904 /* The name buffer must be at least as long as a symbol name. Right
905 now it's not clear how we're going to store numeric constants--
906 probably as a hexadecimal string, since this will allow the exact
907 number to be preserved (this can't be done by a decimal
908 representation). Worry about that later. TODO! */
910 #define MAX_ATOM_SIZE 100
913 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
916 /* Report problems with a module. Error reporting is not very
917 elaborate, since this sorts of errors shouldn't really happen.
918 This subroutine never returns. */
920 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
923 bad_module (const char *msgid
)
930 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
931 module_name
, module_line
, module_column
, msgid
);
934 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
935 module_name
, module_line
, module_column
, msgid
);
938 gfc_fatal_error ("Module %s at line %d column %d: %s",
939 module_name
, module_line
, module_column
, msgid
);
945 /* Set the module's input pointer. */
948 set_module_locus (module_locus
*m
)
950 module_column
= m
->column
;
951 module_line
= m
->line
;
952 fsetpos (module_fp
, &m
->pos
);
956 /* Get the module's input pointer so that we can restore it later. */
959 get_module_locus (module_locus
*m
)
961 m
->column
= module_column
;
962 m
->line
= module_line
;
963 fgetpos (module_fp
, &m
->pos
);
967 /* Get the next character in the module, updating our reckoning of
975 c
= getc (module_fp
);
978 bad_module ("Unexpected EOF");
991 /* Parse a string constant. The delimiter is guaranteed to be a
1001 get_module_locus (&start
);
1005 /* See how long the string is. */
1010 bad_module ("Unexpected end of module in string constant");
1028 set_module_locus (&start
);
1030 atom_string
= p
= gfc_getmem (len
+ 1);
1032 for (; len
> 0; len
--)
1036 module_char (); /* Guaranteed to be another \'. */
1040 module_char (); /* Terminating \'. */
1041 *p
= '\0'; /* C-style string for debug purposes. */
1045 /* Parse a small integer. */
1048 parse_integer (int c
)
1056 get_module_locus (&m
);
1062 atom_int
= 10 * atom_int
+ c
- '0';
1063 if (atom_int
> 99999999)
1064 bad_module ("Integer overflow");
1067 set_module_locus (&m
);
1085 get_module_locus (&m
);
1090 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
1094 if (++len
> GFC_MAX_SYMBOL_LEN
)
1095 bad_module ("Name too long");
1100 fseek (module_fp
, -1, SEEK_CUR
);
1101 module_column
= m
.column
+ len
- 1;
1108 /* Read the next atom in the module's input stream. */
1119 while (c
== ' ' || c
== '\r' || c
== '\n');
1144 return ATOM_INTEGER
;
1202 bad_module ("Bad name");
1209 /* Peek at the next atom on the input. */
1217 get_module_locus (&m
);
1220 if (a
== ATOM_STRING
)
1221 gfc_free (atom_string
);
1223 set_module_locus (&m
);
1228 /* Read the next atom from the input, requiring that it be a
1232 require_atom (atom_type type
)
1238 get_module_locus (&m
);
1246 p
= _("Expected name");
1249 p
= _("Expected left parenthesis");
1252 p
= _("Expected right parenthesis");
1255 p
= _("Expected integer");
1258 p
= _("Expected string");
1261 gfc_internal_error ("require_atom(): bad atom type required");
1264 set_module_locus (&m
);
1270 /* Given a pointer to an mstring array, require that the current input
1271 be one of the strings in the array. We return the enum value. */
1274 find_enum (const mstring
*m
)
1278 i
= gfc_string2code (m
, atom_name
);
1282 bad_module ("find_enum(): Enum not found");
1288 /**************** Module output subroutines ***************************/
1290 /* Output a character to a module file. */
1293 write_char (char out
)
1295 if (putc (out
, module_fp
) == EOF
)
1296 gfc_fatal_error ("Error writing modules file: %s", strerror (errno
));
1298 /* Add this to our MD5. */
1299 md5_process_bytes (&out
, sizeof (out
), &ctx
);
1311 /* Write an atom to a module. The line wrapping isn't perfect, but it
1312 should work most of the time. This isn't that big of a deal, since
1313 the file really isn't meant to be read by people anyway. */
1316 write_atom (atom_type atom
, const void *v
)
1338 i
= *((const int *) v
);
1340 gfc_internal_error ("write_atom(): Writing negative integer");
1342 sprintf (buffer
, "%d", i
);
1347 gfc_internal_error ("write_atom(): Trying to write dab atom");
1351 if(p
== NULL
|| *p
== '\0')
1356 if (atom
!= ATOM_RPAREN
)
1358 if (module_column
+ len
> 72)
1363 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1368 if (atom
== ATOM_STRING
)
1371 while (p
!= NULL
&& *p
)
1373 if (atom
== ATOM_STRING
&& *p
== '\'')
1378 if (atom
== ATOM_STRING
)
1386 /***************** Mid-level I/O subroutines *****************/
1388 /* These subroutines let their caller read or write atoms without
1389 caring about which of the two is actually happening. This lets a
1390 subroutine concentrate on the actual format of the data being
1393 static void mio_expr (gfc_expr
**);
1394 pointer_info
*mio_symbol_ref (gfc_symbol
**);
1395 pointer_info
*mio_interface_rest (gfc_interface
**);
1396 static void mio_symtree_ref (gfc_symtree
**);
1398 /* Read or write an enumerated value. On writing, we return the input
1399 value for the convenience of callers. We avoid using an integer
1400 pointer because enums are sometimes inside bitfields. */
1403 mio_name (int t
, const mstring
*m
)
1405 if (iomode
== IO_OUTPUT
)
1406 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1409 require_atom (ATOM_NAME
);
1416 /* Specialization of mio_name. */
1418 #define DECL_MIO_NAME(TYPE) \
1419 static inline TYPE \
1420 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1422 return (TYPE) mio_name ((int) t, m); \
1424 #define MIO_NAME(TYPE) mio_name_##TYPE
1429 if (iomode
== IO_OUTPUT
)
1430 write_atom (ATOM_LPAREN
, NULL
);
1432 require_atom (ATOM_LPAREN
);
1439 if (iomode
== IO_OUTPUT
)
1440 write_atom (ATOM_RPAREN
, NULL
);
1442 require_atom (ATOM_RPAREN
);
1447 mio_integer (int *ip
)
1449 if (iomode
== IO_OUTPUT
)
1450 write_atom (ATOM_INTEGER
, ip
);
1453 require_atom (ATOM_INTEGER
);
1459 /* Read or write a character pointer that points to a string on the heap. */
1462 mio_allocated_string (const char *s
)
1464 if (iomode
== IO_OUTPUT
)
1466 write_atom (ATOM_STRING
, s
);
1471 require_atom (ATOM_STRING
);
1477 /* Read or write a string that is in static memory. */
1480 mio_pool_string (const char **stringp
)
1482 /* TODO: one could write the string only once, and refer to it via a
1485 /* As a special case we have to deal with a NULL string. This
1486 happens for the 'module' member of 'gfc_symbol's that are not in a
1487 module. We read / write these as the empty string. */
1488 if (iomode
== IO_OUTPUT
)
1490 const char *p
= *stringp
== NULL
? "" : *stringp
;
1491 write_atom (ATOM_STRING
, p
);
1495 require_atom (ATOM_STRING
);
1496 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1497 gfc_free (atom_string
);
1502 /* Read or write a string that is inside of some already-allocated
1506 mio_internal_string (char *string
)
1508 if (iomode
== IO_OUTPUT
)
1509 write_atom (ATOM_STRING
, string
);
1512 require_atom (ATOM_STRING
);
1513 strcpy (string
, atom_string
);
1514 gfc_free (atom_string
);
1520 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1521 AB_POINTER
, AB_TARGET
, AB_DUMMY
, AB_RESULT
, AB_DATA
,
1522 AB_IN_NAMELIST
, AB_IN_COMMON
, AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
,
1523 AB_ELEMENTAL
, AB_PURE
, AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
,
1524 AB_CRAY_POINTER
, AB_CRAY_POINTEE
, AB_THREADPRIVATE
, AB_ALLOC_COMP
,
1525 AB_POINTER_COMP
, AB_PRIVATE_COMP
, AB_VALUE
, AB_VOLATILE
, AB_PROTECTED
,
1526 AB_IS_BIND_C
, AB_IS_C_INTEROP
, AB_IS_ISO_C
, AB_ABSTRACT
, AB_ZERO_COMP
1530 static const mstring attr_bits
[] =
1532 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1533 minit ("DIMENSION", AB_DIMENSION
),
1534 minit ("EXTERNAL", AB_EXTERNAL
),
1535 minit ("INTRINSIC", AB_INTRINSIC
),
1536 minit ("OPTIONAL", AB_OPTIONAL
),
1537 minit ("POINTER", AB_POINTER
),
1538 minit ("VOLATILE", AB_VOLATILE
),
1539 minit ("TARGET", AB_TARGET
),
1540 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1541 minit ("DUMMY", AB_DUMMY
),
1542 minit ("RESULT", AB_RESULT
),
1543 minit ("DATA", AB_DATA
),
1544 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1545 minit ("IN_COMMON", AB_IN_COMMON
),
1546 minit ("FUNCTION", AB_FUNCTION
),
1547 minit ("SUBROUTINE", AB_SUBROUTINE
),
1548 minit ("SEQUENCE", AB_SEQUENCE
),
1549 minit ("ELEMENTAL", AB_ELEMENTAL
),
1550 minit ("PURE", AB_PURE
),
1551 minit ("RECURSIVE", AB_RECURSIVE
),
1552 minit ("GENERIC", AB_GENERIC
),
1553 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1554 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1555 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1556 minit ("IS_BIND_C", AB_IS_BIND_C
),
1557 minit ("IS_C_INTEROP", AB_IS_C_INTEROP
),
1558 minit ("IS_ISO_C", AB_IS_ISO_C
),
1559 minit ("VALUE", AB_VALUE
),
1560 minit ("ALLOC_COMP", AB_ALLOC_COMP
),
1561 minit ("POINTER_COMP", AB_POINTER_COMP
),
1562 minit ("PRIVATE_COMP", AB_PRIVATE_COMP
),
1563 minit ("ZERO_COMP", AB_ZERO_COMP
),
1564 minit ("PROTECTED", AB_PROTECTED
),
1565 minit ("ABSTRACT", AB_ABSTRACT
),
1570 /* Specialization of mio_name. */
1571 DECL_MIO_NAME (ab_attribute
)
1572 DECL_MIO_NAME (ar_type
)
1573 DECL_MIO_NAME (array_type
)
1575 DECL_MIO_NAME (expr_t
)
1576 DECL_MIO_NAME (gfc_access
)
1577 DECL_MIO_NAME (gfc_intrinsic_op
)
1578 DECL_MIO_NAME (ifsrc
)
1579 DECL_MIO_NAME (save_state
)
1580 DECL_MIO_NAME (procedure_type
)
1581 DECL_MIO_NAME (ref_type
)
1582 DECL_MIO_NAME (sym_flavor
)
1583 DECL_MIO_NAME (sym_intent
)
1584 #undef DECL_MIO_NAME
1586 /* Symbol attributes are stored in list with the first three elements
1587 being the enumerated fields, while the remaining elements (if any)
1588 indicate the individual attribute bits. The access field is not
1589 saved-- it controls what symbols are exported when a module is
1593 mio_symbol_attribute (symbol_attribute
*attr
)
1599 attr
->flavor
= MIO_NAME (sym_flavor
) (attr
->flavor
, flavors
);
1600 attr
->intent
= MIO_NAME (sym_intent
) (attr
->intent
, intents
);
1601 attr
->proc
= MIO_NAME (procedure_type
) (attr
->proc
, procedures
);
1602 attr
->if_source
= MIO_NAME (ifsrc
) (attr
->if_source
, ifsrc_types
);
1603 attr
->save
= MIO_NAME (save_state
) (attr
->save
, save_status
);
1605 if (iomode
== IO_OUTPUT
)
1607 if (attr
->allocatable
)
1608 MIO_NAME (ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1609 if (attr
->dimension
)
1610 MIO_NAME (ab_attribute
) (AB_DIMENSION
, attr_bits
);
1612 MIO_NAME (ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1613 if (attr
->intrinsic
)
1614 MIO_NAME (ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1616 MIO_NAME (ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1618 MIO_NAME (ab_attribute
) (AB_POINTER
, attr_bits
);
1619 if (attr
->protected)
1620 MIO_NAME (ab_attribute
) (AB_PROTECTED
, attr_bits
);
1622 MIO_NAME (ab_attribute
) (AB_VALUE
, attr_bits
);
1623 if (attr
->volatile_
)
1624 MIO_NAME (ab_attribute
) (AB_VOLATILE
, attr_bits
);
1626 MIO_NAME (ab_attribute
) (AB_TARGET
, attr_bits
);
1627 if (attr
->threadprivate
)
1628 MIO_NAME (ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1630 MIO_NAME (ab_attribute
) (AB_DUMMY
, attr_bits
);
1632 MIO_NAME (ab_attribute
) (AB_RESULT
, attr_bits
);
1633 /* We deliberately don't preserve the "entry" flag. */
1636 MIO_NAME (ab_attribute
) (AB_DATA
, attr_bits
);
1637 if (attr
->in_namelist
)
1638 MIO_NAME (ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1639 if (attr
->in_common
)
1640 MIO_NAME (ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1643 MIO_NAME (ab_attribute
) (AB_FUNCTION
, attr_bits
);
1644 if (attr
->subroutine
)
1645 MIO_NAME (ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1647 MIO_NAME (ab_attribute
) (AB_GENERIC
, attr_bits
);
1649 MIO_NAME (ab_attribute
) (AB_ABSTRACT
, attr_bits
);
1652 MIO_NAME (ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1653 if (attr
->elemental
)
1654 MIO_NAME (ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1656 MIO_NAME (ab_attribute
) (AB_PURE
, attr_bits
);
1657 if (attr
->recursive
)
1658 MIO_NAME (ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1659 if (attr
->always_explicit
)
1660 MIO_NAME (ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1661 if (attr
->cray_pointer
)
1662 MIO_NAME (ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1663 if (attr
->cray_pointee
)
1664 MIO_NAME (ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1665 if (attr
->is_bind_c
)
1666 MIO_NAME(ab_attribute
) (AB_IS_BIND_C
, attr_bits
);
1667 if (attr
->is_c_interop
)
1668 MIO_NAME(ab_attribute
) (AB_IS_C_INTEROP
, attr_bits
);
1670 MIO_NAME(ab_attribute
) (AB_IS_ISO_C
, attr_bits
);
1671 if (attr
->alloc_comp
)
1672 MIO_NAME (ab_attribute
) (AB_ALLOC_COMP
, attr_bits
);
1673 if (attr
->pointer_comp
)
1674 MIO_NAME (ab_attribute
) (AB_POINTER_COMP
, attr_bits
);
1675 if (attr
->private_comp
)
1676 MIO_NAME (ab_attribute
) (AB_PRIVATE_COMP
, attr_bits
);
1677 if (attr
->zero_comp
)
1678 MIO_NAME (ab_attribute
) (AB_ZERO_COMP
, attr_bits
);
1688 if (t
== ATOM_RPAREN
)
1691 bad_module ("Expected attribute bit name");
1693 switch ((ab_attribute
) find_enum (attr_bits
))
1695 case AB_ALLOCATABLE
:
1696 attr
->allocatable
= 1;
1699 attr
->dimension
= 1;
1705 attr
->intrinsic
= 1;
1714 attr
->protected = 1;
1720 attr
->volatile_
= 1;
1725 case AB_THREADPRIVATE
:
1726 attr
->threadprivate
= 1;
1737 case AB_IN_NAMELIST
:
1738 attr
->in_namelist
= 1;
1741 attr
->in_common
= 1;
1747 attr
->subroutine
= 1;
1759 attr
->elemental
= 1;
1765 attr
->recursive
= 1;
1767 case AB_ALWAYS_EXPLICIT
:
1768 attr
->always_explicit
= 1;
1770 case AB_CRAY_POINTER
:
1771 attr
->cray_pointer
= 1;
1773 case AB_CRAY_POINTEE
:
1774 attr
->cray_pointee
= 1;
1777 attr
->is_bind_c
= 1;
1779 case AB_IS_C_INTEROP
:
1780 attr
->is_c_interop
= 1;
1786 attr
->alloc_comp
= 1;
1788 case AB_POINTER_COMP
:
1789 attr
->pointer_comp
= 1;
1791 case AB_PRIVATE_COMP
:
1792 attr
->private_comp
= 1;
1795 attr
->zero_comp
= 1;
1803 static const mstring bt_types
[] = {
1804 minit ("INTEGER", BT_INTEGER
),
1805 minit ("REAL", BT_REAL
),
1806 minit ("COMPLEX", BT_COMPLEX
),
1807 minit ("LOGICAL", BT_LOGICAL
),
1808 minit ("CHARACTER", BT_CHARACTER
),
1809 minit ("DERIVED", BT_DERIVED
),
1810 minit ("PROCEDURE", BT_PROCEDURE
),
1811 minit ("UNKNOWN", BT_UNKNOWN
),
1812 minit ("VOID", BT_VOID
),
1818 mio_charlen (gfc_charlen
**clp
)
1824 if (iomode
== IO_OUTPUT
)
1828 mio_expr (&cl
->length
);
1832 if (peek_atom () != ATOM_RPAREN
)
1834 cl
= gfc_get_charlen ();
1835 mio_expr (&cl
->length
);
1839 cl
->next
= gfc_current_ns
->cl_list
;
1840 gfc_current_ns
->cl_list
= cl
;
1848 /* See if a name is a generated name. */
1851 check_unique_name (const char *name
)
1853 return *name
== '@';
1858 mio_typespec (gfc_typespec
*ts
)
1862 ts
->type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
1864 if (ts
->type
!= BT_DERIVED
)
1865 mio_integer (&ts
->kind
);
1867 mio_symbol_ref (&ts
->derived
);
1869 /* Add info for C interop and is_iso_c. */
1870 mio_integer (&ts
->is_c_interop
);
1871 mio_integer (&ts
->is_iso_c
);
1873 /* If the typespec is for an identifier either from iso_c_binding, or
1874 a constant that was initialized to an identifier from it, use the
1875 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
1877 ts
->f90_type
= MIO_NAME (bt
) (ts
->f90_type
, bt_types
);
1879 ts
->f90_type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
1881 if (ts
->type
!= BT_CHARACTER
)
1883 /* ts->cl is only valid for BT_CHARACTER. */
1888 mio_charlen (&ts
->cl
);
1894 static const mstring array_spec_types
[] = {
1895 minit ("EXPLICIT", AS_EXPLICIT
),
1896 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
1897 minit ("DEFERRED", AS_DEFERRED
),
1898 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
1904 mio_array_spec (gfc_array_spec
**asp
)
1911 if (iomode
== IO_OUTPUT
)
1919 if (peek_atom () == ATOM_RPAREN
)
1925 *asp
= as
= gfc_get_array_spec ();
1928 mio_integer (&as
->rank
);
1929 as
->type
= MIO_NAME (array_type
) (as
->type
, array_spec_types
);
1931 for (i
= 0; i
< as
->rank
; i
++)
1933 mio_expr (&as
->lower
[i
]);
1934 mio_expr (&as
->upper
[i
]);
1942 /* Given a pointer to an array reference structure (which lives in a
1943 gfc_ref structure), find the corresponding array specification
1944 structure. Storing the pointer in the ref structure doesn't quite
1945 work when loading from a module. Generating code for an array
1946 reference also needs more information than just the array spec. */
1948 static const mstring array_ref_types
[] = {
1949 minit ("FULL", AR_FULL
),
1950 minit ("ELEMENT", AR_ELEMENT
),
1951 minit ("SECTION", AR_SECTION
),
1957 mio_array_ref (gfc_array_ref
*ar
)
1962 ar
->type
= MIO_NAME (ar_type
) (ar
->type
, array_ref_types
);
1963 mio_integer (&ar
->dimen
);
1971 for (i
= 0; i
< ar
->dimen
; i
++)
1972 mio_expr (&ar
->start
[i
]);
1977 for (i
= 0; i
< ar
->dimen
; i
++)
1979 mio_expr (&ar
->start
[i
]);
1980 mio_expr (&ar
->end
[i
]);
1981 mio_expr (&ar
->stride
[i
]);
1987 gfc_internal_error ("mio_array_ref(): Unknown array ref");
1990 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
1991 we can't call mio_integer directly. Instead loop over each element
1992 and cast it to/from an integer. */
1993 if (iomode
== IO_OUTPUT
)
1995 for (i
= 0; i
< ar
->dimen
; i
++)
1997 int tmp
= (int)ar
->dimen_type
[i
];
1998 write_atom (ATOM_INTEGER
, &tmp
);
2003 for (i
= 0; i
< ar
->dimen
; i
++)
2005 require_atom (ATOM_INTEGER
);
2006 ar
->dimen_type
[i
] = atom_int
;
2010 if (iomode
== IO_INPUT
)
2012 ar
->where
= gfc_current_locus
;
2014 for (i
= 0; i
< ar
->dimen
; i
++)
2015 ar
->c_where
[i
] = gfc_current_locus
;
2022 /* Saves or restores a pointer. The pointer is converted back and
2023 forth from an integer. We return the pointer_info pointer so that
2024 the caller can take additional action based on the pointer type. */
2026 static pointer_info
*
2027 mio_pointer_ref (void *gp
)
2031 if (iomode
== IO_OUTPUT
)
2033 p
= get_pointer (*((char **) gp
));
2034 write_atom (ATOM_INTEGER
, &p
->integer
);
2038 require_atom (ATOM_INTEGER
);
2039 p
= add_fixup (atom_int
, gp
);
2046 /* Save and load references to components that occur within
2047 expressions. We have to describe these references by a number and
2048 by name. The number is necessary for forward references during
2049 reading, and the name is necessary if the symbol already exists in
2050 the namespace and is not loaded again. */
2053 mio_component_ref (gfc_component
**cp
, gfc_symbol
*sym
)
2055 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2059 p
= mio_pointer_ref (cp
);
2060 if (p
->type
== P_UNKNOWN
)
2061 p
->type
= P_COMPONENT
;
2063 if (iomode
== IO_OUTPUT
)
2064 mio_pool_string (&(*cp
)->name
);
2067 mio_internal_string (name
);
2069 /* It can happen that a component reference can be read before the
2070 associated derived type symbol has been loaded. Return now and
2071 wait for a later iteration of load_needed. */
2075 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
2077 /* Symbol already loaded, so search by name. */
2078 for (q
= sym
->components
; q
; q
= q
->next
)
2079 if (strcmp (q
->name
, name
) == 0)
2083 gfc_internal_error ("mio_component_ref(): Component not found");
2085 associate_integer_pointer (p
, q
);
2088 /* Make sure this symbol will eventually be loaded. */
2089 p
= find_pointer2 (sym
);
2090 if (p
->u
.rsym
.state
== UNUSED
)
2091 p
->u
.rsym
.state
= NEEDED
;
2097 mio_component (gfc_component
*c
)
2104 if (iomode
== IO_OUTPUT
)
2106 p
= get_pointer (c
);
2107 mio_integer (&p
->integer
);
2112 p
= get_integer (n
);
2113 associate_integer_pointer (p
, c
);
2116 if (p
->type
== P_UNKNOWN
)
2117 p
->type
= P_COMPONENT
;
2119 mio_pool_string (&c
->name
);
2120 mio_typespec (&c
->ts
);
2121 mio_array_spec (&c
->as
);
2123 mio_integer (&c
->dimension
);
2124 mio_integer (&c
->pointer
);
2125 mio_integer (&c
->allocatable
);
2126 c
->access
= MIO_NAME (gfc_access
) (c
->access
, access_types
);
2128 mio_expr (&c
->initializer
);
2134 mio_component_list (gfc_component
**cp
)
2136 gfc_component
*c
, *tail
;
2140 if (iomode
== IO_OUTPUT
)
2142 for (c
= *cp
; c
; c
= c
->next
)
2152 if (peek_atom () == ATOM_RPAREN
)
2155 c
= gfc_get_component ();
2172 mio_actual_arg (gfc_actual_arglist
*a
)
2175 mio_pool_string (&a
->name
);
2176 mio_expr (&a
->expr
);
2182 mio_actual_arglist (gfc_actual_arglist
**ap
)
2184 gfc_actual_arglist
*a
, *tail
;
2188 if (iomode
== IO_OUTPUT
)
2190 for (a
= *ap
; a
; a
= a
->next
)
2200 if (peek_atom () != ATOM_LPAREN
)
2203 a
= gfc_get_actual_arglist ();
2219 /* Read and write formal argument lists. */
2222 mio_formal_arglist (gfc_symbol
*sym
)
2224 gfc_formal_arglist
*f
, *tail
;
2228 if (iomode
== IO_OUTPUT
)
2230 for (f
= sym
->formal
; f
; f
= f
->next
)
2231 mio_symbol_ref (&f
->sym
);
2235 sym
->formal
= tail
= NULL
;
2237 while (peek_atom () != ATOM_RPAREN
)
2239 f
= gfc_get_formal_arglist ();
2240 mio_symbol_ref (&f
->sym
);
2242 if (sym
->formal
== NULL
)
2255 /* Save or restore a reference to a symbol node. */
2258 mio_symbol_ref (gfc_symbol
**symp
)
2262 p
= mio_pointer_ref (symp
);
2263 if (p
->type
== P_UNKNOWN
)
2266 if (iomode
== IO_OUTPUT
)
2268 if (p
->u
.wsym
.state
== UNREFERENCED
)
2269 p
->u
.wsym
.state
= NEEDS_WRITE
;
2273 if (p
->u
.rsym
.state
== UNUSED
)
2274 p
->u
.rsym
.state
= NEEDED
;
2280 /* Save or restore a reference to a symtree node. */
2283 mio_symtree_ref (gfc_symtree
**stp
)
2288 if (iomode
== IO_OUTPUT
)
2289 mio_symbol_ref (&(*stp
)->n
.sym
);
2292 require_atom (ATOM_INTEGER
);
2293 p
= get_integer (atom_int
);
2295 /* An unused equivalence member; make a symbol and a symtree
2297 if (in_load_equiv
&& p
->u
.rsym
.symtree
== NULL
)
2299 /* Since this is not used, it must have a unique name. */
2300 p
->u
.rsym
.symtree
= gfc_get_unique_symtree (gfc_current_ns
);
2302 /* Make the symbol. */
2303 if (p
->u
.rsym
.sym
== NULL
)
2305 p
->u
.rsym
.sym
= gfc_new_symbol (p
->u
.rsym
.true_name
,
2307 p
->u
.rsym
.sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
2310 p
->u
.rsym
.symtree
->n
.sym
= p
->u
.rsym
.sym
;
2311 p
->u
.rsym
.symtree
->n
.sym
->refs
++;
2312 p
->u
.rsym
.referenced
= 1;
2314 /* If the symbol is PRIVATE and in COMMON, load_commons will
2315 generate a fixup symbol, which must be associated. */
2317 resolve_fixups (p
->fixup
, p
->u
.rsym
.sym
);
2321 if (p
->type
== P_UNKNOWN
)
2324 if (p
->u
.rsym
.state
== UNUSED
)
2325 p
->u
.rsym
.state
= NEEDED
;
2327 if (p
->u
.rsym
.symtree
!= NULL
)
2329 *stp
= p
->u
.rsym
.symtree
;
2333 f
= gfc_getmem (sizeof (fixup_t
));
2335 f
->next
= p
->u
.rsym
.stfixup
;
2336 p
->u
.rsym
.stfixup
= f
;
2338 f
->pointer
= (void **) stp
;
2345 mio_iterator (gfc_iterator
**ip
)
2351 if (iomode
== IO_OUTPUT
)
2358 if (peek_atom () == ATOM_RPAREN
)
2364 *ip
= gfc_get_iterator ();
2369 mio_expr (&iter
->var
);
2370 mio_expr (&iter
->start
);
2371 mio_expr (&iter
->end
);
2372 mio_expr (&iter
->step
);
2380 mio_constructor (gfc_constructor
**cp
)
2382 gfc_constructor
*c
, *tail
;
2386 if (iomode
== IO_OUTPUT
)
2388 for (c
= *cp
; c
; c
= c
->next
)
2391 mio_expr (&c
->expr
);
2392 mio_iterator (&c
->iterator
);
2401 while (peek_atom () != ATOM_RPAREN
)
2403 c
= gfc_get_constructor ();
2413 mio_expr (&c
->expr
);
2414 mio_iterator (&c
->iterator
);
2423 static const mstring ref_types
[] = {
2424 minit ("ARRAY", REF_ARRAY
),
2425 minit ("COMPONENT", REF_COMPONENT
),
2426 minit ("SUBSTRING", REF_SUBSTRING
),
2432 mio_ref (gfc_ref
**rp
)
2439 r
->type
= MIO_NAME (ref_type
) (r
->type
, ref_types
);
2444 mio_array_ref (&r
->u
.ar
);
2448 mio_symbol_ref (&r
->u
.c
.sym
);
2449 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2453 mio_expr (&r
->u
.ss
.start
);
2454 mio_expr (&r
->u
.ss
.end
);
2455 mio_charlen (&r
->u
.ss
.length
);
2464 mio_ref_list (gfc_ref
**rp
)
2466 gfc_ref
*ref
, *head
, *tail
;
2470 if (iomode
== IO_OUTPUT
)
2472 for (ref
= *rp
; ref
; ref
= ref
->next
)
2479 while (peek_atom () != ATOM_RPAREN
)
2482 head
= tail
= gfc_get_ref ();
2485 tail
->next
= gfc_get_ref ();
2499 /* Read and write an integer value. */
2502 mio_gmp_integer (mpz_t
*integer
)
2506 if (iomode
== IO_INPUT
)
2508 if (parse_atom () != ATOM_STRING
)
2509 bad_module ("Expected integer string");
2511 mpz_init (*integer
);
2512 if (mpz_set_str (*integer
, atom_string
, 10))
2513 bad_module ("Error converting integer");
2515 gfc_free (atom_string
);
2519 p
= mpz_get_str (NULL
, 10, *integer
);
2520 write_atom (ATOM_STRING
, p
);
2527 mio_gmp_real (mpfr_t
*real
)
2532 if (iomode
== IO_INPUT
)
2534 if (parse_atom () != ATOM_STRING
)
2535 bad_module ("Expected real string");
2538 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2539 gfc_free (atom_string
);
2543 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2545 if (mpfr_nan_p (*real
) || mpfr_inf_p (*real
))
2547 write_atom (ATOM_STRING
, p
);
2552 atom_string
= gfc_getmem (strlen (p
) + 20);
2554 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2556 /* Fix negative numbers. */
2557 if (atom_string
[2] == '-')
2559 atom_string
[0] = '-';
2560 atom_string
[1] = '0';
2561 atom_string
[2] = '.';
2564 write_atom (ATOM_STRING
, atom_string
);
2566 gfc_free (atom_string
);
2572 /* Save and restore the shape of an array constructor. */
2575 mio_shape (mpz_t
**pshape
, int rank
)
2581 /* A NULL shape is represented by (). */
2584 if (iomode
== IO_OUTPUT
)
2596 if (t
== ATOM_RPAREN
)
2603 shape
= gfc_get_shape (rank
);
2607 for (n
= 0; n
< rank
; n
++)
2608 mio_gmp_integer (&shape
[n
]);
2614 static const mstring expr_types
[] = {
2615 minit ("OP", EXPR_OP
),
2616 minit ("FUNCTION", EXPR_FUNCTION
),
2617 minit ("CONSTANT", EXPR_CONSTANT
),
2618 minit ("VARIABLE", EXPR_VARIABLE
),
2619 minit ("SUBSTRING", EXPR_SUBSTRING
),
2620 minit ("STRUCTURE", EXPR_STRUCTURE
),
2621 minit ("ARRAY", EXPR_ARRAY
),
2622 minit ("NULL", EXPR_NULL
),
2626 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2627 generic operators, not in expressions. INTRINSIC_USER is also
2628 replaced by the correct function name by the time we see it. */
2630 static const mstring intrinsics
[] =
2632 minit ("UPLUS", INTRINSIC_UPLUS
),
2633 minit ("UMINUS", INTRINSIC_UMINUS
),
2634 minit ("PLUS", INTRINSIC_PLUS
),
2635 minit ("MINUS", INTRINSIC_MINUS
),
2636 minit ("TIMES", INTRINSIC_TIMES
),
2637 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2638 minit ("POWER", INTRINSIC_POWER
),
2639 minit ("CONCAT", INTRINSIC_CONCAT
),
2640 minit ("AND", INTRINSIC_AND
),
2641 minit ("OR", INTRINSIC_OR
),
2642 minit ("EQV", INTRINSIC_EQV
),
2643 minit ("NEQV", INTRINSIC_NEQV
),
2644 minit ("EQ_SIGN", INTRINSIC_EQ
),
2645 minit ("EQ", INTRINSIC_EQ_OS
),
2646 minit ("NE_SIGN", INTRINSIC_NE
),
2647 minit ("NE", INTRINSIC_NE_OS
),
2648 minit ("GT_SIGN", INTRINSIC_GT
),
2649 minit ("GT", INTRINSIC_GT_OS
),
2650 minit ("GE_SIGN", INTRINSIC_GE
),
2651 minit ("GE", INTRINSIC_GE_OS
),
2652 minit ("LT_SIGN", INTRINSIC_LT
),
2653 minit ("LT", INTRINSIC_LT_OS
),
2654 minit ("LE_SIGN", INTRINSIC_LE
),
2655 minit ("LE", INTRINSIC_LE_OS
),
2656 minit ("NOT", INTRINSIC_NOT
),
2657 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2662 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2665 fix_mio_expr (gfc_expr
*e
)
2667 gfc_symtree
*ns_st
= NULL
;
2670 if (iomode
!= IO_OUTPUT
)
2675 /* If this is a symtree for a symbol that came from a contained module
2676 namespace, it has a unique name and we should look in the current
2677 namespace to see if the required, non-contained symbol is available
2678 yet. If so, the latter should be written. */
2679 if (e
->symtree
->n
.sym
&& check_unique_name (e
->symtree
->name
))
2680 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2681 e
->symtree
->n
.sym
->name
);
2683 /* On the other hand, if the existing symbol is the module name or the
2684 new symbol is a dummy argument, do not do the promotion. */
2685 if (ns_st
&& ns_st
->n
.sym
2686 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2687 && !e
->symtree
->n
.sym
->attr
.dummy
)
2690 else if (e
->expr_type
== EXPR_FUNCTION
&& e
->value
.function
.name
)
2692 /* In some circumstances, a function used in an initialization
2693 expression, in one use associated module, can fail to be
2694 coupled to its symtree when used in a specification
2695 expression in another module. */
2696 fname
= e
->value
.function
.esym
? e
->value
.function
.esym
->name
2697 : e
->value
.function
.isym
->name
;
2698 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2703 /* Read and write expressions. The form "()" is allowed to indicate a
2707 mio_expr (gfc_expr
**ep
)
2716 if (iomode
== IO_OUTPUT
)
2725 MIO_NAME (expr_t
) (e
->expr_type
, expr_types
);
2730 if (t
== ATOM_RPAREN
)
2737 bad_module ("Expected expression type");
2739 e
= *ep
= gfc_get_expr ();
2740 e
->where
= gfc_current_locus
;
2741 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2744 mio_typespec (&e
->ts
);
2745 mio_integer (&e
->rank
);
2749 switch (e
->expr_type
)
2752 e
->value
.op
.operator
2753 = MIO_NAME (gfc_intrinsic_op
) (e
->value
.op
.operator, intrinsics
);
2755 switch (e
->value
.op
.operator)
2757 case INTRINSIC_UPLUS
:
2758 case INTRINSIC_UMINUS
:
2760 case INTRINSIC_PARENTHESES
:
2761 mio_expr (&e
->value
.op
.op1
);
2764 case INTRINSIC_PLUS
:
2765 case INTRINSIC_MINUS
:
2766 case INTRINSIC_TIMES
:
2767 case INTRINSIC_DIVIDE
:
2768 case INTRINSIC_POWER
:
2769 case INTRINSIC_CONCAT
:
2773 case INTRINSIC_NEQV
:
2775 case INTRINSIC_EQ_OS
:
2777 case INTRINSIC_NE_OS
:
2779 case INTRINSIC_GT_OS
:
2781 case INTRINSIC_GE_OS
:
2783 case INTRINSIC_LT_OS
:
2785 case INTRINSIC_LE_OS
:
2786 mio_expr (&e
->value
.op
.op1
);
2787 mio_expr (&e
->value
.op
.op2
);
2791 bad_module ("Bad operator");
2797 mio_symtree_ref (&e
->symtree
);
2798 mio_actual_arglist (&e
->value
.function
.actual
);
2800 if (iomode
== IO_OUTPUT
)
2802 e
->value
.function
.name
2803 = mio_allocated_string (e
->value
.function
.name
);
2804 flag
= e
->value
.function
.esym
!= NULL
;
2805 mio_integer (&flag
);
2807 mio_symbol_ref (&e
->value
.function
.esym
);
2809 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
2813 require_atom (ATOM_STRING
);
2814 e
->value
.function
.name
= gfc_get_string (atom_string
);
2815 gfc_free (atom_string
);
2817 mio_integer (&flag
);
2819 mio_symbol_ref (&e
->value
.function
.esym
);
2822 require_atom (ATOM_STRING
);
2823 e
->value
.function
.isym
= gfc_find_function (atom_string
);
2824 gfc_free (atom_string
);
2831 mio_symtree_ref (&e
->symtree
);
2832 mio_ref_list (&e
->ref
);
2835 case EXPR_SUBSTRING
:
2836 s
= gfc_widechar_to_char (e
->value
.character
.string
, -1);
2837 s
= CONST_CAST (char *, mio_allocated_string (s
));
2838 e
->value
.character
.string
= gfc_char_to_widechar (s
);
2840 mio_ref_list (&e
->ref
);
2843 case EXPR_STRUCTURE
:
2845 mio_constructor (&e
->value
.constructor
);
2846 mio_shape (&e
->shape
, e
->rank
);
2853 mio_gmp_integer (&e
->value
.integer
);
2857 gfc_set_model_kind (e
->ts
.kind
);
2858 mio_gmp_real (&e
->value
.real
);
2862 gfc_set_model_kind (e
->ts
.kind
);
2863 mio_gmp_real (&e
->value
.complex.r
);
2864 mio_gmp_real (&e
->value
.complex.i
);
2868 mio_integer (&e
->value
.logical
);
2872 mio_integer (&e
->value
.character
.length
);
2873 s
= gfc_widechar_to_char (e
->value
.character
.string
, -1);
2874 s
= CONST_CAST (char *, mio_allocated_string (s
));
2875 e
->value
.character
.string
= gfc_char_to_widechar (s
);
2880 bad_module ("Bad type in constant expression");
2893 /* Read and write namelists. */
2896 mio_namelist (gfc_symbol
*sym
)
2898 gfc_namelist
*n
, *m
;
2899 const char *check_name
;
2903 if (iomode
== IO_OUTPUT
)
2905 for (n
= sym
->namelist
; n
; n
= n
->next
)
2906 mio_symbol_ref (&n
->sym
);
2910 /* This departure from the standard is flagged as an error.
2911 It does, in fact, work correctly. TODO: Allow it
2913 if (sym
->attr
.flavor
== FL_NAMELIST
)
2915 check_name
= find_use_name (sym
->name
, false);
2916 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
2917 gfc_error ("Namelist %s cannot be renamed by USE "
2918 "association to %s", sym
->name
, check_name
);
2922 while (peek_atom () != ATOM_RPAREN
)
2924 n
= gfc_get_namelist ();
2925 mio_symbol_ref (&n
->sym
);
2927 if (sym
->namelist
== NULL
)
2934 sym
->namelist_tail
= m
;
2941 /* Save/restore lists of gfc_interface stuctures. When loading an
2942 interface, we are really appending to the existing list of
2943 interfaces. Checking for duplicate and ambiguous interfaces has to
2944 be done later when all symbols have been loaded. */
2947 mio_interface_rest (gfc_interface
**ip
)
2949 gfc_interface
*tail
, *p
;
2950 pointer_info
*pi
= NULL
;
2952 if (iomode
== IO_OUTPUT
)
2955 for (p
= *ip
; p
; p
= p
->next
)
2956 mio_symbol_ref (&p
->sym
);
2971 if (peek_atom () == ATOM_RPAREN
)
2974 p
= gfc_get_interface ();
2975 p
->where
= gfc_current_locus
;
2976 pi
= mio_symbol_ref (&p
->sym
);
2992 /* Save/restore a nameless operator interface. */
2995 mio_interface (gfc_interface
**ip
)
2998 mio_interface_rest (ip
);
3002 /* Save/restore a named operator interface. */
3005 mio_symbol_interface (const char **name
, const char **module
,
3009 mio_pool_string (name
);
3010 mio_pool_string (module
);
3011 mio_interface_rest (ip
);
3016 mio_namespace_ref (gfc_namespace
**nsp
)
3021 p
= mio_pointer_ref (nsp
);
3023 if (p
->type
== P_UNKNOWN
)
3024 p
->type
= P_NAMESPACE
;
3026 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
3028 ns
= (gfc_namespace
*) p
->u
.pointer
;
3031 ns
= gfc_get_namespace (NULL
, 0);
3032 associate_integer_pointer (p
, ns
);
3040 /* Unlike most other routines, the address of the symbol node is already
3041 fixed on input and the name/module has already been filled in. */
3044 mio_symbol (gfc_symbol
*sym
)
3046 int intmod
= INTMOD_NONE
;
3048 gfc_formal_arglist
*formal
;
3052 mio_symbol_attribute (&sym
->attr
);
3053 mio_typespec (&sym
->ts
);
3055 /* Contained procedures don't have formal namespaces. Instead we output the
3056 procedure namespace. The will contain the formal arguments. */
3057 if (iomode
== IO_OUTPUT
)
3059 formal
= sym
->formal
;
3060 while (formal
&& !formal
->sym
)
3061 formal
= formal
->next
;
3064 mio_namespace_ref (&formal
->sym
->ns
);
3066 mio_namespace_ref (&sym
->formal_ns
);
3070 mio_namespace_ref (&sym
->formal_ns
);
3073 sym
->formal_ns
->proc_name
= sym
;
3078 /* Save/restore common block links. */
3079 mio_symbol_ref (&sym
->common_next
);
3081 mio_formal_arglist (sym
);
3083 if (sym
->attr
.flavor
== FL_PARAMETER
)
3084 mio_expr (&sym
->value
);
3086 mio_array_spec (&sym
->as
);
3088 mio_symbol_ref (&sym
->result
);
3090 if (sym
->attr
.cray_pointee
)
3091 mio_symbol_ref (&sym
->cp_pointer
);
3093 /* Note that components are always saved, even if they are supposed
3094 to be private. Component access is checked during searching. */
3096 mio_component_list (&sym
->components
);
3098 if (sym
->components
!= NULL
)
3099 sym
->component_access
3100 = MIO_NAME (gfc_access
) (sym
->component_access
, access_types
);
3104 /* Add the fields that say whether this is from an intrinsic module,
3105 and if so, what symbol it is within the module. */
3106 /* mio_integer (&(sym->from_intmod)); */
3107 if (iomode
== IO_OUTPUT
)
3109 intmod
= sym
->from_intmod
;
3110 mio_integer (&intmod
);
3114 mio_integer (&intmod
);
3115 sym
->from_intmod
= intmod
;
3118 mio_integer (&(sym
->intmod_sym_id
));
3124 /************************* Top level subroutines *************************/
3126 /* Given a root symtree node and a symbol, try to find a symtree that
3127 references the symbol that is not a unique name. */
3129 static gfc_symtree
*
3130 find_symtree_for_symbol (gfc_symtree
*st
, gfc_symbol
*sym
)
3132 gfc_symtree
*s
= NULL
;
3137 s
= find_symtree_for_symbol (st
->right
, sym
);
3140 s
= find_symtree_for_symbol (st
->left
, sym
);
3144 if (st
->n
.sym
== sym
&& !check_unique_name (st
->name
))
3151 /* A recursive function to look for a speficic symbol by name and by
3152 module. Whilst several symtrees might point to one symbol, its
3153 is sufficient for the purposes here than one exist. Note that
3154 generic interfaces are distinguished as are symbols that have been
3155 renamed in another module. */
3156 static gfc_symtree
*
3157 find_symbol (gfc_symtree
*st
, const char *name
,
3158 const char *module
, int generic
)
3161 gfc_symtree
*retval
, *s
;
3163 if (st
== NULL
|| st
->n
.sym
== NULL
)
3166 c
= strcmp (name
, st
->n
.sym
->name
);
3167 if (c
== 0 && st
->n
.sym
->module
3168 && strcmp (module
, st
->n
.sym
->module
) == 0
3169 && !check_unique_name (st
->name
))
3171 s
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3173 /* Detect symbols that are renamed by use association in another
3174 module by the absence of a symtree and null attr.use_rename,
3175 since the latter is not transmitted in the module file. */
3176 if (((!generic
&& !st
->n
.sym
->attr
.generic
)
3177 || (generic
&& st
->n
.sym
->attr
.generic
))
3178 && !(s
== NULL
&& !st
->n
.sym
->attr
.use_rename
))
3182 retval
= find_symbol (st
->left
, name
, module
, generic
);
3185 retval
= find_symbol (st
->right
, name
, module
, generic
);
3191 /* Skip a list between balanced left and right parens. */
3201 switch (parse_atom ())
3212 gfc_free (atom_string
);
3224 /* Load operator interfaces from the module. Interfaces are unusual
3225 in that they attach themselves to existing symbols. */
3228 load_operator_interfaces (void)
3231 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3233 pointer_info
*pi
= NULL
;
3238 while (peek_atom () != ATOM_RPAREN
)
3242 mio_internal_string (name
);
3243 mio_internal_string (module
);
3245 n
= number_use_names (name
, true);
3248 for (i
= 1; i
<= n
; i
++)
3250 /* Decide if we need to load this one or not. */
3251 p
= find_use_name_n (name
, &i
, true);
3255 while (parse_atom () != ATOM_RPAREN
);
3261 uop
= gfc_get_uop (p
);
3262 pi
= mio_interface_rest (&uop
->operator);
3266 if (gfc_find_uop (p
, NULL
))
3268 uop
= gfc_get_uop (p
);
3269 uop
->operator = gfc_get_interface ();
3270 uop
->operator->where
= gfc_current_locus
;
3271 add_fixup (pi
->integer
, &uop
->operator->sym
);
3280 /* Load interfaces from the module. Interfaces are unusual in that
3281 they attach themselves to existing symbols. */
3284 load_generic_interfaces (void)
3287 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3289 gfc_interface
*generic
= NULL
;
3294 while (peek_atom () != ATOM_RPAREN
)
3298 mio_internal_string (name
);
3299 mio_internal_string (module
);
3301 n
= number_use_names (name
, false);
3302 renamed
= n
? 1 : 0;
3305 for (i
= 1; i
<= n
; i
++)
3308 /* Decide if we need to load this one or not. */
3309 p
= find_use_name_n (name
, &i
, false);
3311 st
= find_symbol (gfc_current_ns
->sym_root
,
3312 name
, module_name
, 1);
3314 if (!p
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
3316 /* Skip the specific names for these cases. */
3317 while (i
== 1 && parse_atom () != ATOM_RPAREN
);
3322 /* If the symbol exists already and is being USEd without being
3323 in an ONLY clause, do not load a new symtree(11.3.2). */
3324 if (!only_flag
&& st
)
3329 /* Make the symbol inaccessible if it has been added by a USE
3330 statement without an ONLY(11.3.2). */
3332 && !st
->n
.sym
->attr
.use_only
3333 && !st
->n
.sym
->attr
.use_rename
3334 && strcmp (st
->n
.sym
->module
, module_name
) == 0)
3337 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3338 st
= gfc_get_unique_symtree (gfc_current_ns
);
3345 if (strcmp (st
->name
, p
) != 0)
3347 st
= gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3353 /* Since we haven't found a valid generic interface, we had
3357 gfc_get_symbol (p
, NULL
, &sym
);
3358 sym
->name
= gfc_get_string (name
);
3359 sym
->module
= gfc_get_string (module_name
);
3360 sym
->attr
.flavor
= FL_PROCEDURE
;
3361 sym
->attr
.generic
= 1;
3362 sym
->attr
.use_assoc
= 1;
3367 /* Unless sym is a generic interface, this reference
3370 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3374 if (st
&& !sym
->attr
.generic
3376 && strcmp(module
, sym
->module
))
3380 sym
->attr
.use_only
= only_flag
;
3381 sym
->attr
.use_rename
= renamed
;
3385 mio_interface_rest (&sym
->generic
);
3386 generic
= sym
->generic
;
3388 else if (!sym
->generic
)
3390 sym
->generic
= generic
;
3391 sym
->attr
.generic_copy
= 1;
3400 /* Load common blocks. */
3405 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3410 while (peek_atom () != ATOM_RPAREN
)
3414 mio_internal_string (name
);
3416 p
= gfc_get_common (name
, 1);
3418 mio_symbol_ref (&p
->head
);
3419 mio_integer (&flags
);
3423 p
->threadprivate
= 1;
3426 /* Get whether this was a bind(c) common or not. */
3427 mio_integer (&p
->is_bind_c
);
3428 /* Get the binding label. */
3429 mio_internal_string (p
->binding_label
);
3438 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3439 so that unused variables are not loaded and so that the expression can
3445 gfc_equiv
*head
, *tail
, *end
, *eq
;
3449 in_load_equiv
= true;
3451 end
= gfc_current_ns
->equiv
;
3452 while (end
!= NULL
&& end
->next
!= NULL
)
3455 while (peek_atom () != ATOM_RPAREN
) {
3459 while(peek_atom () != ATOM_RPAREN
)
3462 head
= tail
= gfc_get_equiv ();
3465 tail
->eq
= gfc_get_equiv ();
3469 mio_pool_string (&tail
->module
);
3470 mio_expr (&tail
->expr
);
3473 /* Unused equivalence members have a unique name. */
3475 for (eq
= head
; eq
; eq
= eq
->eq
)
3477 if (!check_unique_name (eq
->expr
->symtree
->name
))
3486 for (eq
= head
; eq
; eq
= head
)
3489 gfc_free_expr (eq
->expr
);
3495 gfc_current_ns
->equiv
= head
;
3506 in_load_equiv
= false;
3510 /* Recursive function to traverse the pointer_info tree and load a
3511 needed symbol. We return nonzero if we load a symbol and stop the
3512 traversal, because the act of loading can alter the tree. */
3515 load_needed (pointer_info
*p
)
3526 rv
|= load_needed (p
->left
);
3527 rv
|= load_needed (p
->right
);
3529 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
3532 p
->u
.rsym
.state
= USED
;
3534 set_module_locus (&p
->u
.rsym
.where
);
3536 sym
= p
->u
.rsym
.sym
;
3539 q
= get_integer (p
->u
.rsym
.ns
);
3541 ns
= (gfc_namespace
*) q
->u
.pointer
;
3544 /* Create an interface namespace if necessary. These are
3545 the namespaces that hold the formal parameters of module
3548 ns
= gfc_get_namespace (NULL
, 0);
3549 associate_integer_pointer (q
, ns
);
3552 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
3553 doesn't go pear-shaped if the symbol is used. */
3555 gfc_find_symbol (p
->u
.rsym
.module
, gfc_current_ns
,
3558 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
3559 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
3560 strcpy (sym
->binding_label
, p
->u
.rsym
.binding_label
);
3562 associate_integer_pointer (p
, sym
);
3566 sym
->attr
.use_assoc
= 1;
3568 sym
->attr
.use_only
= 1;
3569 if (p
->u
.rsym
.renamed
)
3570 sym
->attr
.use_rename
= 1;
3576 /* Recursive function for cleaning up things after a module has been read. */
3579 read_cleanup (pointer_info
*p
)
3587 read_cleanup (p
->left
);
3588 read_cleanup (p
->right
);
3590 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
3592 /* Add hidden symbols to the symtree. */
3593 q
= get_integer (p
->u
.rsym
.ns
);
3594 st
= gfc_get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
3596 st
->n
.sym
= p
->u
.rsym
.sym
;
3599 /* Fixup any symtree references. */
3600 p
->u
.rsym
.symtree
= st
;
3601 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
3602 p
->u
.rsym
.stfixup
= NULL
;
3605 /* Free unused symbols. */
3606 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
3607 gfc_free_symbol (p
->u
.rsym
.sym
);
3611 /* Read a module file. */
3616 module_locus operator_interfaces
, user_operators
;
3618 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3620 int ambiguous
, j
, nuse
, symbol
;
3621 pointer_info
*info
, *q
;
3626 get_module_locus (&operator_interfaces
); /* Skip these for now. */
3629 get_module_locus (&user_operators
);
3633 /* Skip commons and equivalences for now. */
3639 /* Create the fixup nodes for all the symbols. */
3641 while (peek_atom () != ATOM_RPAREN
)
3643 require_atom (ATOM_INTEGER
);
3644 info
= get_integer (atom_int
);
3646 info
->type
= P_SYMBOL
;
3647 info
->u
.rsym
.state
= UNUSED
;
3649 mio_internal_string (info
->u
.rsym
.true_name
);
3650 mio_internal_string (info
->u
.rsym
.module
);
3651 mio_internal_string (info
->u
.rsym
.binding_label
);
3654 require_atom (ATOM_INTEGER
);
3655 info
->u
.rsym
.ns
= atom_int
;
3657 get_module_locus (&info
->u
.rsym
.where
);
3660 /* See if the symbol has already been loaded by a previous module.
3661 If so, we reference the existing symbol and prevent it from
3662 being loaded again. This should not happen if the symbol being
3663 read is an index for an assumed shape dummy array (ns != 1). */
3665 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
3668 || (sym
->attr
.flavor
== FL_VARIABLE
&& info
->u
.rsym
.ns
!=1))
3671 info
->u
.rsym
.state
= USED
;
3672 info
->u
.rsym
.sym
= sym
;
3674 /* Some symbols do not have a namespace (eg. formal arguments),
3675 so the automatic "unique symtree" mechanism must be suppressed
3676 by marking them as referenced. */
3677 q
= get_integer (info
->u
.rsym
.ns
);
3678 if (q
->u
.pointer
== NULL
)
3680 info
->u
.rsym
.referenced
= 1;
3684 /* If possible recycle the symtree that references the symbol.
3685 If a symtree is not found and the module does not import one,
3686 a unique-name symtree is found by read_cleanup. */
3687 st
= find_symtree_for_symbol (gfc_current_ns
->sym_root
, sym
);
3690 info
->u
.rsym
.symtree
= st
;
3691 info
->u
.rsym
.referenced
= 1;
3697 /* Parse the symtree lists. This lets us mark which symbols need to
3698 be loaded. Renaming is also done at this point by replacing the
3703 while (peek_atom () != ATOM_RPAREN
)
3705 mio_internal_string (name
);
3706 mio_integer (&ambiguous
);
3707 mio_integer (&symbol
);
3709 info
= get_integer (symbol
);
3711 /* See how many use names there are. If none, go through the start
3712 of the loop at least once. */
3713 nuse
= number_use_names (name
, false);
3714 info
->u
.rsym
.renamed
= nuse
? 1 : 0;
3719 for (j
= 1; j
<= nuse
; j
++)
3721 /* Get the jth local name for this symbol. */
3722 p
= find_use_name_n (name
, &j
, false);
3724 if (p
== NULL
&& strcmp (name
, module_name
) == 0)
3727 /* Skip symtree nodes not in an ONLY clause, unless there
3728 is an existing symtree loaded from another USE statement. */
3731 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3733 info
->u
.rsym
.symtree
= st
;
3737 /* If a symbol of the same name and module exists already,
3738 this symbol, which is not in an ONLY clause, must not be
3739 added to the namespace(11.3.2). Note that find_symbol
3740 only returns the first occurrence that it finds. */
3741 if (!only_flag
&& !info
->u
.rsym
.renamed
3742 && strcmp (name
, module_name
) != 0
3743 && find_symbol (gfc_current_ns
->sym_root
, name
,
3747 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3751 /* Check for ambiguous symbols. */
3752 if (st
->n
.sym
!= info
->u
.rsym
.sym
)
3754 info
->u
.rsym
.symtree
= st
;
3758 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3760 /* Delete the symtree if the symbol has been added by a USE
3761 statement without an ONLY(11.3.2). Remember that the rsym
3762 will be the same as the symbol found in the symtree, for
3764 if (st
&& (only_flag
|| info
->u
.rsym
.renamed
)
3765 && !st
->n
.sym
->attr
.use_only
3766 && !st
->n
.sym
->attr
.use_rename
3767 && info
->u
.rsym
.sym
== st
->n
.sym
)
3768 gfc_delete_symtree (&gfc_current_ns
->sym_root
, name
);
3770 /* Create a symtree node in the current namespace for this
3772 st
= check_unique_name (p
)
3773 ? gfc_get_unique_symtree (gfc_current_ns
)
3774 : gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3775 st
->ambiguous
= ambiguous
;
3777 sym
= info
->u
.rsym
.sym
;
3779 /* Create a symbol node if it doesn't already exist. */
3782 info
->u
.rsym
.sym
= gfc_new_symbol (info
->u
.rsym
.true_name
,
3784 sym
= info
->u
.rsym
.sym
;
3785 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
3787 /* TODO: hmm, can we test this? Do we know it will be
3788 initialized to zeros? */
3789 if (info
->u
.rsym
.binding_label
[0] != '\0')
3790 strcpy (sym
->binding_label
, info
->u
.rsym
.binding_label
);
3796 if (strcmp (name
, p
) != 0)
3797 sym
->attr
.use_rename
= 1;
3799 /* Store the symtree pointing to this symbol. */
3800 info
->u
.rsym
.symtree
= st
;
3802 if (info
->u
.rsym
.state
== UNUSED
)
3803 info
->u
.rsym
.state
= NEEDED
;
3804 info
->u
.rsym
.referenced
= 1;
3811 /* Load intrinsic operator interfaces. */
3812 set_module_locus (&operator_interfaces
);
3815 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3817 if (i
== INTRINSIC_USER
)
3822 u
= find_use_operator (i
);
3833 mio_interface (&gfc_current_ns
->operator[i
]);
3838 /* Load generic and user operator interfaces. These must follow the
3839 loading of symtree because otherwise symbols can be marked as
3842 set_module_locus (&user_operators
);
3844 load_operator_interfaces ();
3845 load_generic_interfaces ();
3850 /* At this point, we read those symbols that are needed but haven't
3851 been loaded yet. If one symbol requires another, the other gets
3852 marked as NEEDED if its previous state was UNUSED. */
3854 while (load_needed (pi_root
));
3856 /* Make sure all elements of the rename-list were found in the module. */
3858 for (u
= gfc_rename_list
; u
; u
= u
->next
)
3863 if (u
->operator == INTRINSIC_NONE
)
3865 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3866 u
->use_name
, &u
->where
, module_name
);
3870 if (u
->operator == INTRINSIC_USER
)
3872 gfc_error ("User operator '%s' referenced at %L not found "
3873 "in module '%s'", u
->use_name
, &u
->where
, module_name
);
3877 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
3878 "in module '%s'", gfc_op2string (u
->operator), &u
->where
,
3882 gfc_check_interfaces (gfc_current_ns
);
3884 /* Clean up symbol nodes that were never loaded, create references
3885 to hidden symbols. */
3887 read_cleanup (pi_root
);
3891 /* Given an access type that is specific to an entity and the default
3892 access, return nonzero if the entity is publicly accessible. If the
3893 element is declared as PUBLIC, then it is public; if declared
3894 PRIVATE, then private, and otherwise it is public unless the default
3895 access in this context has been declared PRIVATE. */
3898 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
3900 if (specific_access
== ACCESS_PUBLIC
)
3902 if (specific_access
== ACCESS_PRIVATE
)
3905 if (gfc_option
.flag_module_private
)
3906 return default_access
== ACCESS_PUBLIC
;
3908 return default_access
!= ACCESS_PRIVATE
;
3912 /* A structure to remember which commons we've already written. */
3914 struct written_common
3916 BBT_HEADER(written_common
);
3917 const char *name
, *label
;
3920 static struct written_common
*written_commons
= NULL
;
3922 /* Comparison function used for balancing the binary tree. */
3925 compare_written_commons (void *a1
, void *b1
)
3927 const char *aname
= ((struct written_common
*) a1
)->name
;
3928 const char *alabel
= ((struct written_common
*) a1
)->label
;
3929 const char *bname
= ((struct written_common
*) b1
)->name
;
3930 const char *blabel
= ((struct written_common
*) b1
)->label
;
3931 int c
= strcmp (aname
, bname
);
3933 return (c
!= 0 ? c
: strcmp (alabel
, blabel
));
3936 /* Free a list of written commons. */
3939 free_written_common (struct written_common
*w
)
3945 free_written_common (w
->left
);
3947 free_written_common (w
->right
);
3952 /* Write a common block to the module -- recursive helper function. */
3955 write_common_0 (gfc_symtree
*st
)
3961 struct written_common
*w
;
3962 bool write_me
= true;
3967 write_common_0 (st
->left
);
3969 /* We will write out the binding label, or the name if no label given. */
3970 name
= st
->n
.common
->name
;
3972 label
= p
->is_bind_c
? p
->binding_label
: p
->name
;
3974 /* Check if we've already output this common. */
3975 w
= written_commons
;
3978 int c
= strcmp (name
, w
->name
);
3979 c
= (c
!= 0 ? c
: strcmp (label
, w
->label
));
3983 w
= (c
< 0) ? w
->left
: w
->right
;
3988 /* Write the common to the module. */
3990 mio_pool_string (&name
);
3992 mio_symbol_ref (&p
->head
);
3993 flags
= p
->saved
? 1 : 0;
3994 if (p
->threadprivate
)
3996 mio_integer (&flags
);
3998 /* Write out whether the common block is bind(c) or not. */
3999 mio_integer (&(p
->is_bind_c
));
4001 mio_pool_string (&label
);
4004 /* Record that we have written this common. */
4005 w
= gfc_getmem (sizeof (struct written_common
));
4008 gfc_insert_bbt (&written_commons
, w
, compare_written_commons
);
4011 write_common_0 (st
->right
);
4015 /* Write a common, by initializing the list of written commons, calling
4016 the recursive function write_common_0() and cleaning up afterwards. */
4019 write_common (gfc_symtree
*st
)
4021 written_commons
= NULL
;
4022 write_common_0 (st
);
4023 free_written_common (written_commons
);
4024 written_commons
= NULL
;
4028 /* Write the blank common block to the module. */
4031 write_blank_common (void)
4033 const char * name
= BLANK_COMMON_NAME
;
4035 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4036 this, but it hasn't been checked. Just making it so for now. */
4039 if (gfc_current_ns
->blank_common
.head
== NULL
)
4044 mio_pool_string (&name
);
4046 mio_symbol_ref (&gfc_current_ns
->blank_common
.head
);
4047 saved
= gfc_current_ns
->blank_common
.saved
;
4048 mio_integer (&saved
);
4050 /* Write out whether the common block is bind(c) or not. */
4051 mio_integer (&is_bind_c
);
4053 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4054 it doesn't matter because the label isn't used. */
4055 mio_pool_string (&name
);
4061 /* Write equivalences to the module. */
4070 for (eq
= gfc_current_ns
->equiv
; eq
; eq
= eq
->next
)
4074 for (e
= eq
; e
; e
= e
->eq
)
4076 if (e
->module
== NULL
)
4077 e
->module
= gfc_get_string ("%s.eq.%d", module_name
, num
);
4078 mio_allocated_string (e
->module
);
4079 mio_expr (&e
->expr
);
4088 /* Write a symbol to the module. */
4091 write_symbol (int n
, gfc_symbol
*sym
)
4095 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
4096 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
4099 mio_pool_string (&sym
->name
);
4101 mio_pool_string (&sym
->module
);
4102 if (sym
->attr
.is_bind_c
|| sym
->attr
.is_iso_c
)
4104 label
= sym
->binding_label
;
4105 mio_pool_string (&label
);
4108 mio_pool_string (&sym
->name
);
4110 mio_pointer_ref (&sym
->ns
);
4117 /* Recursive traversal function to write the initial set of symbols to
4118 the module. We check to see if the symbol should be written
4119 according to the access specification. */
4122 write_symbol0 (gfc_symtree
*st
)
4126 bool dont_write
= false;
4131 write_symbol0 (st
->left
);
4134 if (sym
->module
== NULL
)
4135 sym
->module
= gfc_get_string (module_name
);
4137 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4138 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
4141 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4146 p
= get_pointer (sym
);
4147 if (p
->type
== P_UNKNOWN
)
4150 if (p
->u
.wsym
.state
!= WRITTEN
)
4152 write_symbol (p
->integer
, sym
);
4153 p
->u
.wsym
.state
= WRITTEN
;
4157 write_symbol0 (st
->right
);
4161 /* Recursive traversal function to write the secondary set of symbols
4162 to the module file. These are symbols that were not public yet are
4163 needed by the public symbols or another dependent symbol. The act
4164 of writing a symbol can modify the pointer_info tree, so we cease
4165 traversal if we find a symbol to write. We return nonzero if a
4166 symbol was written and pass that information upwards. */
4169 write_symbol1 (pointer_info
*p
)
4176 result
= write_symbol1 (p
->left
);
4178 if (!(p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
))
4180 p
->u
.wsym
.state
= WRITTEN
;
4181 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
4185 result
|= write_symbol1 (p
->right
);
4190 /* Write operator interfaces associated with a symbol. */
4193 write_operator (gfc_user_op
*uop
)
4195 static char nullstring
[] = "";
4196 const char *p
= nullstring
;
4198 if (uop
->operator == NULL
4199 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
4202 mio_symbol_interface (&uop
->name
, &p
, &uop
->operator);
4206 /* Write generic interfaces from the namespace sym_root. */
4209 write_generic (gfc_symtree
*st
)
4216 write_generic (st
->left
);
4217 write_generic (st
->right
);
4220 if (!sym
|| check_unique_name (st
->name
))
4223 if (sym
->generic
== NULL
4224 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
4227 if (sym
->module
== NULL
)
4228 sym
->module
= gfc_get_string (module_name
);
4230 mio_symbol_interface (&st
->name
, &sym
->module
, &sym
->generic
);
4235 write_symtree (gfc_symtree
*st
)
4241 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
4242 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
4243 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
4246 if (check_unique_name (st
->name
))
4249 p
= find_pointer (sym
);
4251 gfc_internal_error ("write_symtree(): Symbol not written");
4253 mio_pool_string (&st
->name
);
4254 mio_integer (&st
->ambiguous
);
4255 mio_integer (&p
->integer
);
4264 /* Write the operator interfaces. */
4267 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
4269 if (i
== INTRINSIC_USER
)
4272 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
4273 gfc_current_ns
->default_access
)
4274 ? &gfc_current_ns
->operator[i
] : NULL
);
4282 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
4288 write_generic (gfc_current_ns
->sym_root
);
4294 write_blank_common ();
4295 write_common (gfc_current_ns
->common_root
);
4306 /* Write symbol information. First we traverse all symbols in the
4307 primary namespace, writing those that need to be written.
4308 Sometimes writing one symbol will cause another to need to be
4309 written. A list of these symbols ends up on the write stack, and
4310 we end by popping the bottom of the stack and writing the symbol
4311 until the stack is empty. */
4315 write_symbol0 (gfc_current_ns
->sym_root
);
4316 while (write_symbol1 (pi_root
))
4325 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
4330 /* Read a MD5 sum from the header of a module file. If the file cannot
4331 be opened, or we have any other error, we return -1. */
4334 read_md5_from_module_file (const char * filename
, unsigned char md5
[16])
4340 /* Open the file. */
4341 if ((file
= fopen (filename
, "r")) == NULL
)
4344 /* Read two lines. */
4345 if (fgets (buf
, sizeof (buf
) - 1, file
) == NULL
4346 || fgets (buf
, sizeof (buf
) - 1, file
) == NULL
)
4352 /* Close the file. */
4355 /* If the header is not what we expect, or is too short, bail out. */
4356 if (strncmp (buf
, "MD5:", 4) != 0 || strlen (buf
) < 4 + 16)
4359 /* Now, we have a real MD5, read it into the array. */
4360 for (n
= 0; n
< 16; n
++)
4364 if (sscanf (&(buf
[4+2*n
]), "%02x", &x
) != 1)
4374 /* Given module, dump it to disk. If there was an error while
4375 processing the module, dump_flag will be set to zero and we delete
4376 the module file, even if it was already there. */
4379 gfc_dump_module (const char *name
, int dump_flag
)
4382 char *filename
, *filename_tmp
, *p
;
4385 unsigned char md5_new
[16], md5_old
[16];
4387 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
4388 if (gfc_option
.module_dir
!= NULL
)
4390 n
+= strlen (gfc_option
.module_dir
);
4391 filename
= (char *) alloca (n
);
4392 strcpy (filename
, gfc_option
.module_dir
);
4393 strcat (filename
, name
);
4397 filename
= (char *) alloca (n
);
4398 strcpy (filename
, name
);
4400 strcat (filename
, MODULE_EXTENSION
);
4402 /* Name of the temporary file used to write the module. */
4403 filename_tmp
= (char *) alloca (n
+ 1);
4404 strcpy (filename_tmp
, filename
);
4405 strcat (filename_tmp
, "0");
4407 /* There was an error while processing the module. We delete the
4408 module file, even if it was already there. */
4415 /* Write the module to the temporary file. */
4416 module_fp
= fopen (filename_tmp
, "w");
4417 if (module_fp
== NULL
)
4418 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
4419 filename_tmp
, strerror (errno
));
4421 /* Write the header, including space reserved for the MD5 sum. */
4425 *strchr (p
, '\n') = '\0';
4427 fprintf (module_fp
, "GFORTRAN module created from %s on %s\nMD5:",
4428 gfc_source_file
, p
);
4429 fgetpos (module_fp
, &md5_pos
);
4430 fputs ("00000000000000000000000000000000 -- "
4431 "If you edit this, you'll get what you deserve.\n\n", module_fp
);
4433 /* Initialize the MD5 context that will be used for output. */
4434 md5_init_ctx (&ctx
);
4436 /* Write the module itself. */
4438 strcpy (module_name
, name
);
4444 free_pi_tree (pi_root
);
4449 /* Write the MD5 sum to the header of the module file. */
4450 md5_finish_ctx (&ctx
, md5_new
);
4451 fsetpos (module_fp
, &md5_pos
);
4452 for (n
= 0; n
< 16; n
++)
4453 fprintf (module_fp
, "%02x", md5_new
[n
]);
4455 if (fclose (module_fp
))
4456 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
4457 filename_tmp
, strerror (errno
));
4459 /* Read the MD5 from the header of the old module file and compare. */
4460 if (read_md5_from_module_file (filename
, md5_old
) != 0
4461 || memcmp (md5_old
, md5_new
, sizeof (md5_old
)) != 0)
4463 /* Module file have changed, replace the old one. */
4465 rename (filename_tmp
, filename
);
4468 unlink (filename_tmp
);
4473 sort_iso_c_rename_list (void)
4475 gfc_use_rename
*tmp_list
= NULL
;
4476 gfc_use_rename
*curr
;
4477 gfc_use_rename
*kinds_used
[ISOCBINDING_NUMBER
] = {NULL
};
4481 for (curr
= gfc_rename_list
; curr
; curr
= curr
->next
)
4483 c_kind
= get_c_kind (curr
->use_name
, c_interop_kinds_table
);
4484 if (c_kind
== ISOCBINDING_INVALID
|| c_kind
== ISOCBINDING_LAST
)
4486 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4487 "intrinsic module ISO_C_BINDING.", curr
->use_name
,
4491 /* Put it in the list. */
4492 kinds_used
[c_kind
] = curr
;
4495 /* Make a new (sorted) rename list. */
4497 while (i
< ISOCBINDING_NUMBER
&& kinds_used
[i
] == NULL
)
4500 if (i
< ISOCBINDING_NUMBER
)
4502 tmp_list
= kinds_used
[i
];
4506 for (; i
< ISOCBINDING_NUMBER
; i
++)
4507 if (kinds_used
[i
] != NULL
)
4509 curr
->next
= kinds_used
[i
];
4515 gfc_rename_list
= tmp_list
;
4519 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
4520 the current namespace for all named constants, pointer types, and
4521 procedures in the module unless the only clause was used or a rename
4522 list was provided. */
4525 import_iso_c_binding_module (void)
4527 gfc_symbol
*mod_sym
= NULL
;
4528 gfc_symtree
*mod_symtree
= NULL
;
4529 const char *iso_c_module_name
= "__iso_c_binding";
4534 /* Look only in the current namespace. */
4535 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, iso_c_module_name
);
4537 if (mod_symtree
== NULL
)
4539 /* symtree doesn't already exist in current namespace. */
4540 gfc_get_sym_tree (iso_c_module_name
, gfc_current_ns
, &mod_symtree
);
4542 if (mod_symtree
!= NULL
)
4543 mod_sym
= mod_symtree
->n
.sym
;
4545 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
4546 "create symbol for %s", iso_c_module_name
);
4548 mod_sym
->attr
.flavor
= FL_MODULE
;
4549 mod_sym
->attr
.intrinsic
= 1;
4550 mod_sym
->module
= gfc_get_string (iso_c_module_name
);
4551 mod_sym
->from_intmod
= INTMOD_ISO_C_BINDING
;
4554 /* Generate the symbols for the named constants representing
4555 the kinds for intrinsic data types. */
4558 /* Sort the rename list because there are dependencies between types
4559 and procedures (e.g., c_loc needs c_ptr). */
4560 sort_iso_c_rename_list ();
4562 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4564 i
= get_c_kind (u
->use_name
, c_interop_kinds_table
);
4566 if (i
== ISOCBINDING_INVALID
|| i
== ISOCBINDING_LAST
)
4568 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4569 "intrinsic module ISO_C_BINDING.", u
->use_name
,
4574 generate_isocbinding_symbol (iso_c_module_name
, i
, u
->local_name
);
4579 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
4582 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4584 if (strcmp (c_interop_kinds_table
[i
].name
, u
->use_name
) == 0)
4586 local_name
= u
->local_name
;
4591 generate_isocbinding_symbol (iso_c_module_name
, i
, local_name
);
4594 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4599 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4600 "module ISO_C_BINDING", u
->use_name
, &u
->where
);
4606 /* Add an integer named constant from a given module. */
4609 create_int_parameter (const char *name
, int value
, const char *modname
,
4610 intmod_id module
, int id
)
4612 gfc_symtree
*tmp_symtree
;
4615 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
4616 if (tmp_symtree
!= NULL
)
4618 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
4621 gfc_error ("Symbol '%s' already declared", name
);
4624 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
);
4625 sym
= tmp_symtree
->n
.sym
;
4627 sym
->module
= gfc_get_string (modname
);
4628 sym
->attr
.flavor
= FL_PARAMETER
;
4629 sym
->ts
.type
= BT_INTEGER
;
4630 sym
->ts
.kind
= gfc_default_integer_kind
;
4631 sym
->value
= gfc_int_expr (value
);
4632 sym
->attr
.use_assoc
= 1;
4633 sym
->from_intmod
= module
;
4634 sym
->intmod_sym_id
= id
;
4638 /* USE the ISO_FORTRAN_ENV intrinsic module. */
4641 use_iso_fortran_env_module (void)
4643 static char mod
[] = "iso_fortran_env";
4644 const char *local_name
;
4646 gfc_symbol
*mod_sym
;
4647 gfc_symtree
*mod_symtree
;
4650 intmod_sym symbol
[] = {
4651 #define NAMED_INTCST(a,b,c) { a, b, 0 },
4652 #include "iso-fortran-env.def"
4654 { ISOFORTRANENV_INVALID
, NULL
, -1234 } };
4657 #define NAMED_INTCST(a,b,c) symbol[i++].value = c;
4658 #include "iso-fortran-env.def"
4661 /* Generate the symbol for the module itself. */
4662 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, mod
);
4663 if (mod_symtree
== NULL
)
4665 gfc_get_sym_tree (mod
, gfc_current_ns
, &mod_symtree
);
4666 gcc_assert (mod_symtree
);
4667 mod_sym
= mod_symtree
->n
.sym
;
4669 mod_sym
->attr
.flavor
= FL_MODULE
;
4670 mod_sym
->attr
.intrinsic
= 1;
4671 mod_sym
->module
= gfc_get_string (mod
);
4672 mod_sym
->from_intmod
= INTMOD_ISO_FORTRAN_ENV
;
4675 if (!mod_symtree
->n
.sym
->attr
.intrinsic
)
4676 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
4677 "non-intrinsic module name used previously", mod
);
4679 /* Generate the symbols for the module integer named constants. */
4681 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4683 for (i
= 0; symbol
[i
].name
; i
++)
4684 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
4687 if (symbol
[i
].name
== NULL
)
4689 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4690 "intrinsic module ISO_FORTRAN_ENV", u
->use_name
,
4695 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
4696 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
4697 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4698 "from intrinsic module ISO_FORTRAN_ENV at %L is "
4699 "incompatible with option %s", &u
->where
,
4700 gfc_option
.flag_default_integer
4701 ? "-fdefault-integer-8" : "-fdefault-real-8");
4703 create_int_parameter (u
->local_name
[0] ? u
->local_name
4705 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
4710 for (i
= 0; symbol
[i
].name
; i
++)
4713 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4715 if (strcmp (symbol
[i
].name
, u
->use_name
) == 0)
4717 local_name
= u
->local_name
;
4723 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
4724 && symbol
[i
].id
== ISOFORTRANENV_NUMERIC_STORAGE_SIZE
)
4725 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4726 "from intrinsic module ISO_FORTRAN_ENV at %C is "
4727 "incompatible with option %s",
4728 gfc_option
.flag_default_integer
4729 ? "-fdefault-integer-8" : "-fdefault-real-8");
4731 create_int_parameter (local_name
? local_name
: symbol
[i
].name
,
4732 symbol
[i
].value
, mod
, INTMOD_ISO_FORTRAN_ENV
,
4736 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4741 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4742 "module ISO_FORTRAN_ENV", u
->use_name
, &u
->where
);
4748 /* Process a USE directive. */
4751 gfc_use_module (void)
4756 gfc_symtree
*mod_symtree
;
4758 filename
= (char *) alloca (strlen (module_name
) + strlen (MODULE_EXTENSION
)
4760 strcpy (filename
, module_name
);
4761 strcat (filename
, MODULE_EXTENSION
);
4763 /* First, try to find an non-intrinsic module, unless the USE statement
4764 specified that the module is intrinsic. */
4767 module_fp
= gfc_open_included_file (filename
, true, true);
4769 /* Then, see if it's an intrinsic one, unless the USE statement
4770 specified that the module is non-intrinsic. */
4771 if (module_fp
== NULL
&& !specified_nonint
)
4773 if (strcmp (module_name
, "iso_fortran_env") == 0
4774 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: ISO_FORTRAN_ENV "
4775 "intrinsic module at %C") != FAILURE
)
4777 use_iso_fortran_env_module ();
4781 if (strcmp (module_name
, "iso_c_binding") == 0
4782 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
4783 "ISO_C_BINDING module at %C") != FAILURE
)
4785 import_iso_c_binding_module();
4789 module_fp
= gfc_open_intrinsic_module (filename
);
4791 if (module_fp
== NULL
&& specified_int
)
4792 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
4796 if (module_fp
== NULL
)
4797 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
4798 filename
, strerror (errno
));
4800 /* Check that we haven't already USEd an intrinsic module with the
4803 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, module_name
);
4804 if (mod_symtree
&& mod_symtree
->n
.sym
->attr
.intrinsic
)
4805 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
4806 "intrinsic module name used previously", module_name
);
4813 /* Skip the first two lines of the module, after checking that this is
4814 a gfortran module file. */
4820 bad_module ("Unexpected end of module");
4823 if ((start
== 1 && strcmp (atom_name
, "GFORTRAN") != 0)
4824 || (start
== 2 && strcmp (atom_name
, " module") != 0))
4825 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
4832 /* Make sure we're not reading the same module that we may be building. */
4833 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
4834 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
4835 gfc_fatal_error ("Can't USE the same module we're building!");
4838 init_true_name_tree ();
4842 free_true_name (true_name_root
);
4843 true_name_root
= NULL
;
4845 free_pi_tree (pi_root
);
4853 gfc_module_init_2 (void)
4855 last_atom
= ATOM_LPAREN
;
4860 gfc_module_done_2 (void)