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
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 2, 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 COPYING. If not, write to the Free
21 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 /* The syntax of gfortran modules resembles that of lisp lists, ie 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 #define MODULE_EXTENSION ".mod"
79 /* Structure that describes a position within a module file. */
91 P_UNKNOWN
= 0, P_OTHER
, P_NAMESPACE
, P_COMPONENT
, P_SYMBOL
95 /* The fixup structure lists pointers to pointers that have to
96 be updated when a pointer value becomes known. */
98 typedef struct fixup_t
101 struct fixup_t
*next
;
106 /* Structure for holding extra info needed for pointers being read. */
108 typedef struct pointer_info
110 BBT_HEADER (pointer_info
);
114 /* The first component of each member of the union is the pointer
121 void *pointer
; /* Member for doing pointer searches. */
126 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
128 { UNUSED
, NEEDED
, USED
}
133 gfc_symtree
*symtree
;
141 { UNREFERENCED
= 0, NEEDS_WRITE
, WRITTEN
}
151 #define gfc_get_pointer_info() gfc_getmem(sizeof(pointer_info))
154 /* Lists of rename info for the USE statement. */
156 typedef struct gfc_use_rename
158 char local_name
[GFC_MAX_SYMBOL_LEN
+ 1], use_name
[GFC_MAX_SYMBOL_LEN
+ 1];
159 struct gfc_use_rename
*next
;
161 gfc_intrinsic_op
operator;
166 #define gfc_get_use_rename() gfc_getmem(sizeof(gfc_use_rename))
168 /* Local variables */
170 /* The FILE for the module we're reading or writing. */
171 static FILE *module_fp
;
173 /* The name of the module we're reading (USE'ing) or writing. */
174 static char module_name
[GFC_MAX_SYMBOL_LEN
+ 1];
176 /* The way the module we're reading was specified. */
177 static bool specified_nonint
, specified_int
;
179 static int module_line
, module_column
, only_flag
;
181 { IO_INPUT
, IO_OUTPUT
}
184 static gfc_use_rename
*gfc_rename_list
;
185 static pointer_info
*pi_root
;
186 static int symbol_number
; /* Counter for assigning symbol numbers */
188 /* Tells mio_expr_ref not to load unused equivalence members. */
189 static bool in_load_equiv
;
193 /*****************************************************************/
195 /* Pointer/integer conversion. Pointers between structures are stored
196 as integers in the module file. The next couple of subroutines
197 handle this translation for reading and writing. */
199 /* Recursively free the tree of pointer structures. */
202 free_pi_tree (pointer_info
*p
)
207 if (p
->fixup
!= NULL
)
208 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
210 free_pi_tree (p
->left
);
211 free_pi_tree (p
->right
);
217 /* Compare pointers when searching by pointer. Used when writing a
221 compare_pointers (void *_sn1
, void *_sn2
)
223 pointer_info
*sn1
, *sn2
;
225 sn1
= (pointer_info
*) _sn1
;
226 sn2
= (pointer_info
*) _sn2
;
228 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
230 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
237 /* Compare integers when searching by integer. Used when reading a
241 compare_integers (void *_sn1
, void *_sn2
)
243 pointer_info
*sn1
, *sn2
;
245 sn1
= (pointer_info
*) _sn1
;
246 sn2
= (pointer_info
*) _sn2
;
248 if (sn1
->integer
< sn2
->integer
)
250 if (sn1
->integer
> sn2
->integer
)
257 /* Initialize the pointer_info tree. */
266 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
268 /* Pointer 0 is the NULL pointer. */
269 p
= gfc_get_pointer_info ();
274 gfc_insert_bbt (&pi_root
, p
, compare
);
276 /* Pointer 1 is the current namespace. */
277 p
= gfc_get_pointer_info ();
278 p
->u
.pointer
= gfc_current_ns
;
280 p
->type
= P_NAMESPACE
;
282 gfc_insert_bbt (&pi_root
, p
, compare
);
288 /* During module writing, call here with a pointer to something,
289 returning the pointer_info node. */
291 static pointer_info
*
292 find_pointer (void *gp
)
299 if (p
->u
.pointer
== gp
)
301 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
308 /* Given a pointer while writing, returns the pointer_info tree node,
309 creating it if it doesn't exist. */
311 static pointer_info
*
312 get_pointer (void *gp
)
316 p
= find_pointer (gp
);
320 /* Pointer doesn't have an integer. Give it one. */
321 p
= gfc_get_pointer_info ();
324 p
->integer
= symbol_number
++;
326 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
332 /* Given an integer during reading, find it in the pointer_info tree,
333 creating the node if not found. */
335 static pointer_info
*
336 get_integer (int integer
)
346 c
= compare_integers (&t
, p
);
350 p
= (c
< 0) ? p
->left
: p
->right
;
356 p
= gfc_get_pointer_info ();
357 p
->integer
= integer
;
360 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
366 /* Recursive function to find a pointer within a tree by brute force. */
368 static pointer_info
*
369 fp2 (pointer_info
*p
, const void *target
)
376 if (p
->u
.pointer
== target
)
379 q
= fp2 (p
->left
, target
);
383 return fp2 (p
->right
, target
);
387 /* During reading, find a pointer_info node from the pointer value.
388 This amounts to a brute-force search. */
390 static pointer_info
*
391 find_pointer2 (void *p
)
393 return fp2 (pi_root
, p
);
397 /* Resolve any fixups using a known pointer. */
399 resolve_fixups (fixup_t
*f
, void *gp
)
412 /* Call here during module reading when we know what pointer to
413 associate with an integer. Any fixups that exist are resolved at
417 associate_integer_pointer (pointer_info
*p
, void *gp
)
419 if (p
->u
.pointer
!= NULL
)
420 gfc_internal_error ("associate_integer_pointer(): Already associated");
424 resolve_fixups (p
->fixup
, gp
);
430 /* During module reading, given an integer and a pointer to a pointer,
431 either store the pointer from an already-known value or create a
432 fixup structure in order to store things later. Returns zero if
433 the reference has been actually stored, or nonzero if the reference
434 must be fixed later (ie associate_integer_pointer must be called
435 sometime later. Returns the pointer_info structure. */
437 static pointer_info
*
438 add_fixup (int integer
, void *gp
)
444 p
= get_integer (integer
);
446 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
453 f
= gfc_getmem (sizeof (fixup_t
));
465 /*****************************************************************/
467 /* Parser related subroutines */
469 /* Free the rename list left behind by a USE statement. */
474 gfc_use_rename
*next
;
476 for (; gfc_rename_list
; gfc_rename_list
= next
)
478 next
= gfc_rename_list
->next
;
479 gfc_free (gfc_rename_list
);
484 /* Match a USE statement. */
489 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module_nature
[GFC_MAX_SYMBOL_LEN
+ 1];
490 gfc_use_rename
*tail
= NULL
, *new;
492 gfc_intrinsic_op
operator;
495 specified_int
= false;
496 specified_nonint
= false;
498 if (gfc_match (" , ") == MATCH_YES
)
500 if ((m
= gfc_match (" %n ::", module_nature
)) == MATCH_YES
)
502 if (gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: module "
503 "nature in USE statement at %C") == FAILURE
)
506 if (strcmp (module_nature
, "intrinsic") == 0)
507 specified_int
= true;
510 if (strcmp (module_nature
, "non_intrinsic") == 0)
511 specified_nonint
= true;
514 gfc_error ("Module nature in USE statement at %C shall "
515 "be either INTRINSIC or NON_INTRINSIC");
522 /* Help output a better error message than "Unclassifiable
524 gfc_match (" %n", module_nature
);
525 if (strcmp (module_nature
, "intrinsic") == 0
526 || strcmp (module_nature
, "non_intrinsic") == 0)
527 gfc_error ("\"::\" was expected after module nature at %C "
528 "but was not found");
534 m
= gfc_match (" ::");
535 if (m
== MATCH_YES
&&
536 gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: "
537 "\"USE :: module\" at %C") == FAILURE
)
542 m
= gfc_match ("% ");
548 m
= gfc_match_name (module_name
);
555 if (gfc_match_eos () == MATCH_YES
)
557 if (gfc_match_char (',') != MATCH_YES
)
560 if (gfc_match (" only :") == MATCH_YES
)
563 if (gfc_match_eos () == MATCH_YES
)
568 /* Get a new rename struct and add it to the rename list. */
569 new = gfc_get_use_rename ();
570 new->where
= gfc_current_locus
;
573 if (gfc_rename_list
== NULL
)
574 gfc_rename_list
= new;
579 /* See what kind of interface we're dealing with. Assume it is
581 new->operator = INTRINSIC_NONE
;
582 if (gfc_match_generic_spec (&type
, name
, &operator) == MATCH_ERROR
)
587 case INTERFACE_NAMELESS
:
588 gfc_error ("Missing generic specification in USE statement at %C");
591 case INTERFACE_GENERIC
:
592 m
= gfc_match (" =>");
597 strcpy (new->use_name
, name
);
600 strcpy (new->local_name
, name
);
602 m
= gfc_match_name (new->use_name
);
605 if (m
== MATCH_ERROR
)
613 strcpy (new->local_name
, name
);
615 m
= gfc_match_name (new->use_name
);
618 if (m
== MATCH_ERROR
)
624 case INTERFACE_USER_OP
:
625 strcpy (new->use_name
, name
);
628 case INTERFACE_INTRINSIC_OP
:
629 new->operator = operator;
633 if (gfc_match_eos () == MATCH_YES
)
635 if (gfc_match_char (',') != MATCH_YES
)
642 gfc_syntax_error (ST_USE
);
650 /* Given a name and a number, inst, return the inst name
651 under which to load this symbol. Returns NULL if this
652 symbol shouldn't be loaded. If inst is zero, returns
653 the number of instances of this name. */
656 find_use_name_n (const char *name
, int *inst
)
662 for (u
= gfc_rename_list
; u
; u
= u
->next
)
664 if (strcmp (u
->use_name
, name
) != 0)
677 return only_flag
? NULL
: name
;
681 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
685 /* Given a name, return the name under which to load this symbol.
686 Returns NULL if this symbol shouldn't be loaded. */
689 find_use_name (const char *name
)
692 return find_use_name_n (name
, &i
);
696 /* Given a real name, return the number of use names associated with it. */
699 number_use_names (const char *name
)
703 c
= find_use_name_n (name
, &i
);
708 /* Try to find the operator in the current list. */
710 static gfc_use_rename
*
711 find_use_operator (gfc_intrinsic_op
operator)
715 for (u
= gfc_rename_list
; u
; u
= u
->next
)
716 if (u
->operator == operator)
723 /*****************************************************************/
725 /* The next couple of subroutines maintain a tree used to avoid a
726 brute-force search for a combination of true name and module name.
727 While symtree names, the name that a particular symbol is known by
728 can changed with USE statements, we still have to keep track of the
729 true names to generate the correct reference, and also avoid
730 loading the same real symbol twice in a program unit.
732 When we start reading, the true name tree is built and maintained
733 as symbols are read. The tree is searched as we load new symbols
734 to see if it already exists someplace in the namespace. */
736 typedef struct true_name
738 BBT_HEADER (true_name
);
743 static true_name
*true_name_root
;
746 /* Compare two true_name structures. */
749 compare_true_names (void *_t1
, void *_t2
)
754 t1
= (true_name
*) _t1
;
755 t2
= (true_name
*) _t2
;
757 c
= ((t1
->sym
->module
> t2
->sym
->module
)
758 - (t1
->sym
->module
< t2
->sym
->module
));
762 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
766 /* Given a true name, search the true name tree to see if it exists
767 within the main namespace. */
770 find_true_name (const char *name
, const char *module
)
776 sym
.name
= gfc_get_string (name
);
778 sym
.module
= gfc_get_string (module
);
786 c
= compare_true_names ((void *) (&t
), (void *) p
);
790 p
= (c
< 0) ? p
->left
: p
->right
;
797 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
800 add_true_name (gfc_symbol
*sym
)
804 t
= gfc_getmem (sizeof (true_name
));
807 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
811 /* Recursive function to build the initial true name tree by
812 recursively traversing the current namespace. */
815 build_tnt (gfc_symtree
*st
)
820 build_tnt (st
->left
);
821 build_tnt (st
->right
);
823 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
826 add_true_name (st
->n
.sym
);
830 /* Initialize the true name tree with the current namespace. */
833 init_true_name_tree (void)
835 true_name_root
= NULL
;
836 build_tnt (gfc_current_ns
->sym_root
);
840 /* Recursively free a true name tree node. */
843 free_true_name (true_name
*t
)
847 free_true_name (t
->left
);
848 free_true_name (t
->right
);
854 /*****************************************************************/
856 /* Module reading and writing. */
860 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
864 static atom_type last_atom
;
867 /* The name buffer must be at least as long as a symbol name. Right
868 now it's not clear how we're going to store numeric constants--
869 probably as a hexadecimal string, since this will allow the exact
870 number to be preserved (this can't be done by a decimal
871 representation). Worry about that later. TODO! */
873 #define MAX_ATOM_SIZE 100
876 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
879 /* Report problems with a module. Error reporting is not very
880 elaborate, since this sorts of errors shouldn't really happen.
881 This subroutine never returns. */
883 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
886 bad_module (const char *msgid
)
893 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
894 module_name
, module_line
, module_column
, msgid
);
897 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
898 module_name
, module_line
, module_column
, msgid
);
901 gfc_fatal_error ("Module %s at line %d column %d: %s",
902 module_name
, module_line
, module_column
, msgid
);
908 /* Set the module's input pointer. */
911 set_module_locus (module_locus
*m
)
913 module_column
= m
->column
;
914 module_line
= m
->line
;
915 fsetpos (module_fp
, &m
->pos
);
919 /* Get the module's input pointer so that we can restore it later. */
922 get_module_locus (module_locus
*m
)
924 m
->column
= module_column
;
925 m
->line
= module_line
;
926 fgetpos (module_fp
, &m
->pos
);
930 /* Get the next character in the module, updating our reckoning of
938 c
= fgetc (module_fp
);
941 bad_module ("Unexpected EOF");
954 /* Parse a string constant. The delimiter is guaranteed to be a
964 get_module_locus (&start
);
968 /* See how long the string is */
973 bad_module ("Unexpected end of module in string constant");
991 set_module_locus (&start
);
993 atom_string
= p
= gfc_getmem (len
+ 1);
995 for (; len
> 0; len
--)
999 module_char (); /* Guaranteed to be another \' */
1003 module_char (); /* Terminating \' */
1004 *p
= '\0'; /* C-style string for debug purposes. */
1008 /* Parse a small integer. */
1011 parse_integer (int c
)
1019 get_module_locus (&m
);
1025 atom_int
= 10 * atom_int
+ c
- '0';
1026 if (atom_int
> 99999999)
1027 bad_module ("Integer overflow");
1030 set_module_locus (&m
);
1048 get_module_locus (&m
);
1053 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
1057 if (++len
> GFC_MAX_SYMBOL_LEN
)
1058 bad_module ("Name too long");
1063 fseek (module_fp
, -1, SEEK_CUR
);
1064 module_column
= m
.column
+ len
- 1;
1071 /* Read the next atom in the module's input stream. */
1082 while (c
== ' ' || c
== '\n');
1107 return ATOM_INTEGER
;
1165 bad_module ("Bad name");
1172 /* Peek at the next atom on the input. */
1180 get_module_locus (&m
);
1183 if (a
== ATOM_STRING
)
1184 gfc_free (atom_string
);
1186 set_module_locus (&m
);
1191 /* Read the next atom from the input, requiring that it be a
1195 require_atom (atom_type type
)
1201 get_module_locus (&m
);
1209 p
= _("Expected name");
1212 p
= _("Expected left parenthesis");
1215 p
= _("Expected right parenthesis");
1218 p
= _("Expected integer");
1221 p
= _("Expected string");
1224 gfc_internal_error ("require_atom(): bad atom type required");
1227 set_module_locus (&m
);
1233 /* Given a pointer to an mstring array, require that the current input
1234 be one of the strings in the array. We return the enum value. */
1237 find_enum (const mstring
*m
)
1241 i
= gfc_string2code (m
, atom_name
);
1245 bad_module ("find_enum(): Enum not found");
1251 /**************** Module output subroutines ***************************/
1253 /* Output a character to a module file. */
1256 write_char (char out
)
1258 if (fputc (out
, module_fp
) == EOF
)
1259 gfc_fatal_error ("Error writing modules file: %s", strerror (errno
));
1271 /* Write an atom to a module. The line wrapping isn't perfect, but it
1272 should work most of the time. This isn't that big of a deal, since
1273 the file really isn't meant to be read by people anyway. */
1276 write_atom (atom_type atom
, const void *v
)
1298 i
= *((const int *) v
);
1300 gfc_internal_error ("write_atom(): Writing negative integer");
1302 sprintf (buffer
, "%d", i
);
1307 gfc_internal_error ("write_atom(): Trying to write dab atom");
1313 if (atom
!= ATOM_RPAREN
)
1315 if (module_column
+ len
> 72)
1320 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1325 if (atom
== ATOM_STRING
)
1330 if (atom
== ATOM_STRING
&& *p
== '\'')
1335 if (atom
== ATOM_STRING
)
1343 /***************** Mid-level I/O subroutines *****************/
1345 /* These subroutines let their caller read or write atoms without
1346 caring about which of the two is actually happening. This lets a
1347 subroutine concentrate on the actual format of the data being
1350 static void mio_expr (gfc_expr
**);
1351 static void mio_symbol_ref (gfc_symbol
**);
1352 static void mio_symtree_ref (gfc_symtree
**);
1354 /* Read or write an enumerated value. On writing, we return the input
1355 value for the convenience of callers. We avoid using an integer
1356 pointer because enums are sometimes inside bitfields. */
1359 mio_name (int t
, const mstring
*m
)
1361 if (iomode
== IO_OUTPUT
)
1362 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1365 require_atom (ATOM_NAME
);
1372 /* Specialization of mio_name. */
1374 #define DECL_MIO_NAME(TYPE) \
1375 static inline TYPE \
1376 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1378 return (TYPE) mio_name ((int) t, m); \
1380 #define MIO_NAME(TYPE) mio_name_##TYPE
1385 if (iomode
== IO_OUTPUT
)
1386 write_atom (ATOM_LPAREN
, NULL
);
1388 require_atom (ATOM_LPAREN
);
1395 if (iomode
== IO_OUTPUT
)
1396 write_atom (ATOM_RPAREN
, NULL
);
1398 require_atom (ATOM_RPAREN
);
1403 mio_integer (int *ip
)
1405 if (iomode
== IO_OUTPUT
)
1406 write_atom (ATOM_INTEGER
, ip
);
1409 require_atom (ATOM_INTEGER
);
1415 /* Read or write a character pointer that points to a string on the
1419 mio_allocated_string (const char *s
)
1421 if (iomode
== IO_OUTPUT
)
1423 write_atom (ATOM_STRING
, s
);
1428 require_atom (ATOM_STRING
);
1434 /* Read or write a string that is in static memory. */
1437 mio_pool_string (const char **stringp
)
1439 /* TODO: one could write the string only once, and refer to it via a
1442 /* As a special case we have to deal with a NULL string. This
1443 happens for the 'module' member of 'gfc_symbol's that are not in a
1444 module. We read / write these as the empty string. */
1445 if (iomode
== IO_OUTPUT
)
1447 const char *p
= *stringp
== NULL
? "" : *stringp
;
1448 write_atom (ATOM_STRING
, p
);
1452 require_atom (ATOM_STRING
);
1453 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1454 gfc_free (atom_string
);
1459 /* Read or write a string that is inside of some already-allocated
1463 mio_internal_string (char *string
)
1465 if (iomode
== IO_OUTPUT
)
1466 write_atom (ATOM_STRING
, string
);
1469 require_atom (ATOM_STRING
);
1470 strcpy (string
, atom_string
);
1471 gfc_free (atom_string
);
1478 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1479 AB_POINTER
, AB_SAVE
, AB_TARGET
, AB_DUMMY
, AB_RESULT
, AB_DATA
,
1480 AB_IN_NAMELIST
, AB_IN_COMMON
, AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
,
1481 AB_ELEMENTAL
, AB_PURE
, AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
,
1482 AB_CRAY_POINTER
, AB_CRAY_POINTEE
, AB_THREADPRIVATE
, AB_ALLOC_COMP
,
1483 AB_VALUE
, AB_VOLATILE
, AB_PROTECTED
1487 static const mstring attr_bits
[] =
1489 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1490 minit ("DIMENSION", AB_DIMENSION
),
1491 minit ("EXTERNAL", AB_EXTERNAL
),
1492 minit ("INTRINSIC", AB_INTRINSIC
),
1493 minit ("OPTIONAL", AB_OPTIONAL
),
1494 minit ("POINTER", AB_POINTER
),
1495 minit ("SAVE", AB_SAVE
),
1496 minit ("VALUE", AB_VALUE
),
1497 minit ("VOLATILE", AB_VOLATILE
),
1498 minit ("TARGET", AB_TARGET
),
1499 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1500 minit ("DUMMY", AB_DUMMY
),
1501 minit ("RESULT", AB_RESULT
),
1502 minit ("DATA", AB_DATA
),
1503 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1504 minit ("IN_COMMON", AB_IN_COMMON
),
1505 minit ("FUNCTION", AB_FUNCTION
),
1506 minit ("SUBROUTINE", AB_SUBROUTINE
),
1507 minit ("SEQUENCE", AB_SEQUENCE
),
1508 minit ("ELEMENTAL", AB_ELEMENTAL
),
1509 minit ("PURE", AB_PURE
),
1510 minit ("RECURSIVE", AB_RECURSIVE
),
1511 minit ("GENERIC", AB_GENERIC
),
1512 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1513 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1514 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1515 minit ("ALLOC_COMP", AB_ALLOC_COMP
),
1516 minit ("PROTECTED", AB_PROTECTED
),
1520 /* Specialization of mio_name. */
1521 DECL_MIO_NAME (ab_attribute
)
1522 DECL_MIO_NAME (ar_type
)
1523 DECL_MIO_NAME (array_type
)
1525 DECL_MIO_NAME (expr_t
)
1526 DECL_MIO_NAME (gfc_access
)
1527 DECL_MIO_NAME (gfc_intrinsic_op
)
1528 DECL_MIO_NAME (ifsrc
)
1529 DECL_MIO_NAME (procedure_type
)
1530 DECL_MIO_NAME (ref_type
)
1531 DECL_MIO_NAME (sym_flavor
)
1532 DECL_MIO_NAME (sym_intent
)
1533 #undef DECL_MIO_NAME
1535 /* Symbol attributes are stored in list with the first three elements
1536 being the enumerated fields, while the remaining elements (if any)
1537 indicate the individual attribute bits. The access field is not
1538 saved-- it controls what symbols are exported when a module is
1542 mio_symbol_attribute (symbol_attribute
*attr
)
1548 attr
->flavor
= MIO_NAME (sym_flavor
) (attr
->flavor
, flavors
);
1549 attr
->intent
= MIO_NAME (sym_intent
) (attr
->intent
, intents
);
1550 attr
->proc
= MIO_NAME (procedure_type
) (attr
->proc
, procedures
);
1551 attr
->if_source
= MIO_NAME (ifsrc
) (attr
->if_source
, ifsrc_types
);
1553 if (iomode
== IO_OUTPUT
)
1555 if (attr
->allocatable
)
1556 MIO_NAME (ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1557 if (attr
->dimension
)
1558 MIO_NAME (ab_attribute
) (AB_DIMENSION
, attr_bits
);
1560 MIO_NAME (ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1561 if (attr
->intrinsic
)
1562 MIO_NAME (ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1564 MIO_NAME (ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1566 MIO_NAME (ab_attribute
) (AB_POINTER
, attr_bits
);
1567 if (attr
->protected)
1568 MIO_NAME (ab_attribute
) (AB_PROTECTED
, attr_bits
);
1570 MIO_NAME (ab_attribute
) (AB_SAVE
, attr_bits
);
1572 MIO_NAME (ab_attribute
) (AB_VALUE
, attr_bits
);
1573 if (attr
->volatile_
)
1574 MIO_NAME (ab_attribute
) (AB_VOLATILE
, attr_bits
);
1576 MIO_NAME (ab_attribute
) (AB_TARGET
, attr_bits
);
1577 if (attr
->threadprivate
)
1578 MIO_NAME (ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1580 MIO_NAME (ab_attribute
) (AB_DUMMY
, attr_bits
);
1582 MIO_NAME (ab_attribute
) (AB_RESULT
, attr_bits
);
1583 /* We deliberately don't preserve the "entry" flag. */
1586 MIO_NAME (ab_attribute
) (AB_DATA
, attr_bits
);
1587 if (attr
->in_namelist
)
1588 MIO_NAME (ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1589 if (attr
->in_common
)
1590 MIO_NAME (ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1593 MIO_NAME (ab_attribute
) (AB_FUNCTION
, attr_bits
);
1594 if (attr
->subroutine
)
1595 MIO_NAME (ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1597 MIO_NAME (ab_attribute
) (AB_GENERIC
, attr_bits
);
1600 MIO_NAME (ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1601 if (attr
->elemental
)
1602 MIO_NAME (ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1604 MIO_NAME (ab_attribute
) (AB_PURE
, attr_bits
);
1605 if (attr
->recursive
)
1606 MIO_NAME (ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1607 if (attr
->always_explicit
)
1608 MIO_NAME (ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1609 if (attr
->cray_pointer
)
1610 MIO_NAME (ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1611 if (attr
->cray_pointee
)
1612 MIO_NAME (ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1613 if (attr
->alloc_comp
)
1614 MIO_NAME (ab_attribute
) (AB_ALLOC_COMP
, attr_bits
);
1624 if (t
== ATOM_RPAREN
)
1627 bad_module ("Expected attribute bit name");
1629 switch ((ab_attribute
) find_enum (attr_bits
))
1631 case AB_ALLOCATABLE
:
1632 attr
->allocatable
= 1;
1635 attr
->dimension
= 1;
1641 attr
->intrinsic
= 1;
1650 attr
->protected = 1;
1659 attr
->volatile_
= 1;
1664 case AB_THREADPRIVATE
:
1665 attr
->threadprivate
= 1;
1676 case AB_IN_NAMELIST
:
1677 attr
->in_namelist
= 1;
1680 attr
->in_common
= 1;
1686 attr
->subroutine
= 1;
1695 attr
->elemental
= 1;
1701 attr
->recursive
= 1;
1703 case AB_ALWAYS_EXPLICIT
:
1704 attr
->always_explicit
= 1;
1706 case AB_CRAY_POINTER
:
1707 attr
->cray_pointer
= 1;
1709 case AB_CRAY_POINTEE
:
1710 attr
->cray_pointee
= 1;
1713 attr
->alloc_comp
= 1;
1721 static const mstring bt_types
[] = {
1722 minit ("INTEGER", BT_INTEGER
),
1723 minit ("REAL", BT_REAL
),
1724 minit ("COMPLEX", BT_COMPLEX
),
1725 minit ("LOGICAL", BT_LOGICAL
),
1726 minit ("CHARACTER", BT_CHARACTER
),
1727 minit ("DERIVED", BT_DERIVED
),
1728 minit ("PROCEDURE", BT_PROCEDURE
),
1729 minit ("UNKNOWN", BT_UNKNOWN
),
1735 mio_charlen (gfc_charlen
**clp
)
1741 if (iomode
== IO_OUTPUT
)
1745 mio_expr (&cl
->length
);
1749 if (peek_atom () != ATOM_RPAREN
)
1751 cl
= gfc_get_charlen ();
1752 mio_expr (&cl
->length
);
1756 cl
->next
= gfc_current_ns
->cl_list
;
1757 gfc_current_ns
->cl_list
= cl
;
1765 /* Return a symtree node with a name that is guaranteed to be unique
1766 within the namespace and corresponds to an illegal fortran name. */
1768 static gfc_symtree
*
1769 get_unique_symtree (gfc_namespace
*ns
)
1771 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
1772 static int serial
= 0;
1774 sprintf (name
, "@%d", serial
++);
1775 return gfc_new_symtree (&ns
->sym_root
, name
);
1779 /* See if a name is a generated name. */
1782 check_unique_name (const char *name
)
1784 return *name
== '@';
1789 mio_typespec (gfc_typespec
*ts
)
1793 ts
->type
= MIO_NAME (bt
) (ts
->type
, bt_types
);
1795 if (ts
->type
!= BT_DERIVED
)
1796 mio_integer (&ts
->kind
);
1798 mio_symbol_ref (&ts
->derived
);
1800 mio_charlen (&ts
->cl
);
1806 static const mstring array_spec_types
[] = {
1807 minit ("EXPLICIT", AS_EXPLICIT
),
1808 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
1809 minit ("DEFERRED", AS_DEFERRED
),
1810 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
1816 mio_array_spec (gfc_array_spec
**asp
)
1823 if (iomode
== IO_OUTPUT
)
1831 if (peek_atom () == ATOM_RPAREN
)
1837 *asp
= as
= gfc_get_array_spec ();
1840 mio_integer (&as
->rank
);
1841 as
->type
= MIO_NAME (array_type
) (as
->type
, array_spec_types
);
1843 for (i
= 0; i
< as
->rank
; i
++)
1845 mio_expr (&as
->lower
[i
]);
1846 mio_expr (&as
->upper
[i
]);
1854 /* Given a pointer to an array reference structure (which lives in a
1855 gfc_ref structure), find the corresponding array specification
1856 structure. Storing the pointer in the ref structure doesn't quite
1857 work when loading from a module. Generating code for an array
1858 reference also needs more information than just the array spec. */
1860 static const mstring array_ref_types
[] = {
1861 minit ("FULL", AR_FULL
),
1862 minit ("ELEMENT", AR_ELEMENT
),
1863 minit ("SECTION", AR_SECTION
),
1869 mio_array_ref (gfc_array_ref
*ar
)
1874 ar
->type
= MIO_NAME (ar_type
) (ar
->type
, array_ref_types
);
1875 mio_integer (&ar
->dimen
);
1883 for (i
= 0; i
< ar
->dimen
; i
++)
1884 mio_expr (&ar
->start
[i
]);
1889 for (i
= 0; i
< ar
->dimen
; i
++)
1891 mio_expr (&ar
->start
[i
]);
1892 mio_expr (&ar
->end
[i
]);
1893 mio_expr (&ar
->stride
[i
]);
1899 gfc_internal_error ("mio_array_ref(): Unknown array ref");
1902 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
1903 we can't call mio_integer directly. Instead loop over each element
1904 and cast it to/from an integer. */
1905 if (iomode
== IO_OUTPUT
)
1907 for (i
= 0; i
< ar
->dimen
; i
++)
1909 int tmp
= (int)ar
->dimen_type
[i
];
1910 write_atom (ATOM_INTEGER
, &tmp
);
1915 for (i
= 0; i
< ar
->dimen
; i
++)
1917 require_atom (ATOM_INTEGER
);
1918 ar
->dimen_type
[i
] = atom_int
;
1922 if (iomode
== IO_INPUT
)
1924 ar
->where
= gfc_current_locus
;
1926 for (i
= 0; i
< ar
->dimen
; i
++)
1927 ar
->c_where
[i
] = gfc_current_locus
;
1934 /* Saves or restores a pointer. The pointer is converted back and
1935 forth from an integer. We return the pointer_info pointer so that
1936 the caller can take additional action based on the pointer type. */
1938 static pointer_info
*
1939 mio_pointer_ref (void *gp
)
1943 if (iomode
== IO_OUTPUT
)
1945 p
= get_pointer (*((char **) gp
));
1946 write_atom (ATOM_INTEGER
, &p
->integer
);
1950 require_atom (ATOM_INTEGER
);
1951 p
= add_fixup (atom_int
, gp
);
1958 /* Save and load references to components that occur within
1959 expressions. We have to describe these references by a number and
1960 by name. The number is necessary for forward references during
1961 reading, and the name is necessary if the symbol already exists in
1962 the namespace and is not loaded again. */
1965 mio_component_ref (gfc_component
**cp
, gfc_symbol
*sym
)
1967 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
1971 p
= mio_pointer_ref (cp
);
1972 if (p
->type
== P_UNKNOWN
)
1973 p
->type
= P_COMPONENT
;
1975 if (iomode
== IO_OUTPUT
)
1976 mio_pool_string (&(*cp
)->name
);
1979 mio_internal_string (name
);
1981 /* It can happen that a component reference can be read before the
1982 associated derived type symbol has been loaded. Return now and
1983 wait for a later iteration of load_needed. */
1987 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
1989 /* Symbol already loaded, so search by name. */
1990 for (q
= sym
->components
; q
; q
= q
->next
)
1991 if (strcmp (q
->name
, name
) == 0)
1995 gfc_internal_error ("mio_component_ref(): Component not found");
1997 associate_integer_pointer (p
, q
);
2000 /* Make sure this symbol will eventually be loaded. */
2001 p
= find_pointer2 (sym
);
2002 if (p
->u
.rsym
.state
== UNUSED
)
2003 p
->u
.rsym
.state
= NEEDED
;
2009 mio_component (gfc_component
*c
)
2016 if (iomode
== IO_OUTPUT
)
2018 p
= get_pointer (c
);
2019 mio_integer (&p
->integer
);
2024 p
= get_integer (n
);
2025 associate_integer_pointer (p
, c
);
2028 if (p
->type
== P_UNKNOWN
)
2029 p
->type
= P_COMPONENT
;
2031 mio_pool_string (&c
->name
);
2032 mio_typespec (&c
->ts
);
2033 mio_array_spec (&c
->as
);
2035 mio_integer (&c
->dimension
);
2036 mio_integer (&c
->pointer
);
2037 mio_integer (&c
->allocatable
);
2039 mio_expr (&c
->initializer
);
2045 mio_component_list (gfc_component
**cp
)
2047 gfc_component
*c
, *tail
;
2051 if (iomode
== IO_OUTPUT
)
2053 for (c
= *cp
; c
; c
= c
->next
)
2063 if (peek_atom () == ATOM_RPAREN
)
2066 c
= gfc_get_component ();
2083 mio_actual_arg (gfc_actual_arglist
*a
)
2086 mio_pool_string (&a
->name
);
2087 mio_expr (&a
->expr
);
2093 mio_actual_arglist (gfc_actual_arglist
**ap
)
2095 gfc_actual_arglist
*a
, *tail
;
2099 if (iomode
== IO_OUTPUT
)
2101 for (a
= *ap
; a
; a
= a
->next
)
2111 if (peek_atom () != ATOM_LPAREN
)
2114 a
= gfc_get_actual_arglist ();
2130 /* Read and write formal argument lists. */
2133 mio_formal_arglist (gfc_symbol
*sym
)
2135 gfc_formal_arglist
*f
, *tail
;
2139 if (iomode
== IO_OUTPUT
)
2141 for (f
= sym
->formal
; f
; f
= f
->next
)
2142 mio_symbol_ref (&f
->sym
);
2147 sym
->formal
= tail
= NULL
;
2149 while (peek_atom () != ATOM_RPAREN
)
2151 f
= gfc_get_formal_arglist ();
2152 mio_symbol_ref (&f
->sym
);
2154 if (sym
->formal
== NULL
)
2167 /* Save or restore a reference to a symbol node. */
2170 mio_symbol_ref (gfc_symbol
**symp
)
2174 p
= mio_pointer_ref (symp
);
2175 if (p
->type
== P_UNKNOWN
)
2178 if (iomode
== IO_OUTPUT
)
2180 if (p
->u
.wsym
.state
== UNREFERENCED
)
2181 p
->u
.wsym
.state
= NEEDS_WRITE
;
2185 if (p
->u
.rsym
.state
== UNUSED
)
2186 p
->u
.rsym
.state
= NEEDED
;
2191 /* Save or restore a reference to a symtree node. */
2194 mio_symtree_ref (gfc_symtree
**stp
)
2199 if (iomode
== IO_OUTPUT
)
2200 mio_symbol_ref (&(*stp
)->n
.sym
);
2203 require_atom (ATOM_INTEGER
);
2204 p
= get_integer (atom_int
);
2206 /* An unused equivalence member; bail out. */
2207 if (in_load_equiv
&& p
->u
.rsym
.symtree
== NULL
)
2210 if (p
->type
== P_UNKNOWN
)
2213 if (p
->u
.rsym
.state
== UNUSED
)
2214 p
->u
.rsym
.state
= NEEDED
;
2216 if (p
->u
.rsym
.symtree
!= NULL
)
2218 *stp
= p
->u
.rsym
.symtree
;
2222 f
= gfc_getmem (sizeof (fixup_t
));
2224 f
->next
= p
->u
.rsym
.stfixup
;
2225 p
->u
.rsym
.stfixup
= f
;
2227 f
->pointer
= (void **)stp
;
2234 mio_iterator (gfc_iterator
**ip
)
2240 if (iomode
== IO_OUTPUT
)
2247 if (peek_atom () == ATOM_RPAREN
)
2253 *ip
= gfc_get_iterator ();
2258 mio_expr (&iter
->var
);
2259 mio_expr (&iter
->start
);
2260 mio_expr (&iter
->end
);
2261 mio_expr (&iter
->step
);
2269 mio_constructor (gfc_constructor
**cp
)
2271 gfc_constructor
*c
, *tail
;
2275 if (iomode
== IO_OUTPUT
)
2277 for (c
= *cp
; c
; c
= c
->next
)
2280 mio_expr (&c
->expr
);
2281 mio_iterator (&c
->iterator
);
2290 while (peek_atom () != ATOM_RPAREN
)
2292 c
= gfc_get_constructor ();
2302 mio_expr (&c
->expr
);
2303 mio_iterator (&c
->iterator
);
2312 static const mstring ref_types
[] = {
2313 minit ("ARRAY", REF_ARRAY
),
2314 minit ("COMPONENT", REF_COMPONENT
),
2315 minit ("SUBSTRING", REF_SUBSTRING
),
2321 mio_ref (gfc_ref
**rp
)
2328 r
->type
= MIO_NAME (ref_type
) (r
->type
, ref_types
);
2333 mio_array_ref (&r
->u
.ar
);
2337 mio_symbol_ref (&r
->u
.c
.sym
);
2338 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2342 mio_expr (&r
->u
.ss
.start
);
2343 mio_expr (&r
->u
.ss
.end
);
2344 mio_charlen (&r
->u
.ss
.length
);
2353 mio_ref_list (gfc_ref
**rp
)
2355 gfc_ref
*ref
, *head
, *tail
;
2359 if (iomode
== IO_OUTPUT
)
2361 for (ref
= *rp
; ref
; ref
= ref
->next
)
2368 while (peek_atom () != ATOM_RPAREN
)
2371 head
= tail
= gfc_get_ref ();
2374 tail
->next
= gfc_get_ref ();
2388 /* Read and write an integer value. */
2391 mio_gmp_integer (mpz_t
*integer
)
2395 if (iomode
== IO_INPUT
)
2397 if (parse_atom () != ATOM_STRING
)
2398 bad_module ("Expected integer string");
2400 mpz_init (*integer
);
2401 if (mpz_set_str (*integer
, atom_string
, 10))
2402 bad_module ("Error converting integer");
2404 gfc_free (atom_string
);
2408 p
= mpz_get_str (NULL
, 10, *integer
);
2409 write_atom (ATOM_STRING
, p
);
2416 mio_gmp_real (mpfr_t
*real
)
2421 if (iomode
== IO_INPUT
)
2423 if (parse_atom () != ATOM_STRING
)
2424 bad_module ("Expected real string");
2427 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2428 gfc_free (atom_string
);
2432 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2433 atom_string
= gfc_getmem (strlen (p
) + 20);
2435 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2437 /* Fix negative numbers. */
2438 if (atom_string
[2] == '-')
2440 atom_string
[0] = '-';
2441 atom_string
[1] = '0';
2442 atom_string
[2] = '.';
2445 write_atom (ATOM_STRING
, atom_string
);
2447 gfc_free (atom_string
);
2453 /* Save and restore the shape of an array constructor. */
2456 mio_shape (mpz_t
**pshape
, int rank
)
2462 /* A NULL shape is represented by (). */
2465 if (iomode
== IO_OUTPUT
)
2477 if (t
== ATOM_RPAREN
)
2484 shape
= gfc_get_shape (rank
);
2488 for (n
= 0; n
< rank
; n
++)
2489 mio_gmp_integer (&shape
[n
]);
2495 static const mstring expr_types
[] = {
2496 minit ("OP", EXPR_OP
),
2497 minit ("FUNCTION", EXPR_FUNCTION
),
2498 minit ("CONSTANT", EXPR_CONSTANT
),
2499 minit ("VARIABLE", EXPR_VARIABLE
),
2500 minit ("SUBSTRING", EXPR_SUBSTRING
),
2501 minit ("STRUCTURE", EXPR_STRUCTURE
),
2502 minit ("ARRAY", EXPR_ARRAY
),
2503 minit ("NULL", EXPR_NULL
),
2507 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2508 generic operators, not in expressions. INTRINSIC_USER is also
2509 replaced by the correct function name by the time we see it. */
2511 static const mstring intrinsics
[] =
2513 minit ("UPLUS", INTRINSIC_UPLUS
),
2514 minit ("UMINUS", INTRINSIC_UMINUS
),
2515 minit ("PLUS", INTRINSIC_PLUS
),
2516 minit ("MINUS", INTRINSIC_MINUS
),
2517 minit ("TIMES", INTRINSIC_TIMES
),
2518 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2519 minit ("POWER", INTRINSIC_POWER
),
2520 minit ("CONCAT", INTRINSIC_CONCAT
),
2521 minit ("AND", INTRINSIC_AND
),
2522 minit ("OR", INTRINSIC_OR
),
2523 minit ("EQV", INTRINSIC_EQV
),
2524 minit ("NEQV", INTRINSIC_NEQV
),
2525 minit ("EQ", INTRINSIC_EQ
),
2526 minit ("NE", INTRINSIC_NE
),
2527 minit ("GT", INTRINSIC_GT
),
2528 minit ("GE", INTRINSIC_GE
),
2529 minit ("LT", INTRINSIC_LT
),
2530 minit ("LE", INTRINSIC_LE
),
2531 minit ("NOT", INTRINSIC_NOT
),
2532 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2537 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2540 fix_mio_expr (gfc_expr
*e
)
2542 gfc_symtree
*ns_st
= NULL
;
2545 if (iomode
!= IO_OUTPUT
)
2550 /* If this is a symtree for a symbol that came from a contained module
2551 namespace, it has a unique name and we should look in the current
2552 namespace to see if the required, non-contained symbol is available
2553 yet. If so, the latter should be written. */
2554 if (e
->symtree
->n
.sym
&& check_unique_name(e
->symtree
->name
))
2555 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2556 e
->symtree
->n
.sym
->name
);
2558 /* On the other hand, if the existing symbol is the module name or the
2559 new symbol is a dummy argument, do not do the promotion. */
2560 if (ns_st
&& ns_st
->n
.sym
2561 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2562 && !e
->symtree
->n
.sym
->attr
.dummy
)
2565 else if (e
->expr_type
== EXPR_FUNCTION
&& e
->value
.function
.name
)
2567 /* In some circumstances, a function used in an initialization
2568 expression, in one use associated module, can fail to be
2569 coupled to its symtree when used in a specification
2570 expression in another module. */
2571 fname
= e
->value
.function
.esym
? e
->value
.function
.esym
->name
2572 : e
->value
.function
.isym
->name
;
2573 e
->symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, fname
);
2578 /* Read and write expressions. The form "()" is allowed to indicate a
2582 mio_expr (gfc_expr
**ep
)
2590 if (iomode
== IO_OUTPUT
)
2599 MIO_NAME (expr_t
) (e
->expr_type
, expr_types
);
2604 if (t
== ATOM_RPAREN
)
2611 bad_module ("Expected expression type");
2613 e
= *ep
= gfc_get_expr ();
2614 e
->where
= gfc_current_locus
;
2615 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2618 mio_typespec (&e
->ts
);
2619 mio_integer (&e
->rank
);
2623 switch (e
->expr_type
)
2626 e
->value
.op
.operator
2627 = MIO_NAME (gfc_intrinsic_op
) (e
->value
.op
.operator, intrinsics
);
2629 switch (e
->value
.op
.operator)
2631 case INTRINSIC_UPLUS
:
2632 case INTRINSIC_UMINUS
:
2634 case INTRINSIC_PARENTHESES
:
2635 mio_expr (&e
->value
.op
.op1
);
2638 case INTRINSIC_PLUS
:
2639 case INTRINSIC_MINUS
:
2640 case INTRINSIC_TIMES
:
2641 case INTRINSIC_DIVIDE
:
2642 case INTRINSIC_POWER
:
2643 case INTRINSIC_CONCAT
:
2647 case INTRINSIC_NEQV
:
2654 mio_expr (&e
->value
.op
.op1
);
2655 mio_expr (&e
->value
.op
.op2
);
2659 bad_module ("Bad operator");
2665 mio_symtree_ref (&e
->symtree
);
2666 mio_actual_arglist (&e
->value
.function
.actual
);
2668 if (iomode
== IO_OUTPUT
)
2670 e
->value
.function
.name
2671 = mio_allocated_string (e
->value
.function
.name
);
2672 flag
= e
->value
.function
.esym
!= NULL
;
2673 mio_integer (&flag
);
2675 mio_symbol_ref (&e
->value
.function
.esym
);
2677 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
2681 require_atom (ATOM_STRING
);
2682 e
->value
.function
.name
= gfc_get_string (atom_string
);
2683 gfc_free (atom_string
);
2685 mio_integer (&flag
);
2687 mio_symbol_ref (&e
->value
.function
.esym
);
2690 require_atom (ATOM_STRING
);
2691 e
->value
.function
.isym
= gfc_find_function (atom_string
);
2692 gfc_free (atom_string
);
2699 mio_symtree_ref (&e
->symtree
);
2700 mio_ref_list (&e
->ref
);
2703 case EXPR_SUBSTRING
:
2704 e
->value
.character
.string
2705 = (char *) mio_allocated_string (e
->value
.character
.string
);
2706 mio_ref_list (&e
->ref
);
2709 case EXPR_STRUCTURE
:
2711 mio_constructor (&e
->value
.constructor
);
2712 mio_shape (&e
->shape
, e
->rank
);
2719 mio_gmp_integer (&e
->value
.integer
);
2723 gfc_set_model_kind (e
->ts
.kind
);
2724 mio_gmp_real (&e
->value
.real
);
2728 gfc_set_model_kind (e
->ts
.kind
);
2729 mio_gmp_real (&e
->value
.complex.r
);
2730 mio_gmp_real (&e
->value
.complex.i
);
2734 mio_integer (&e
->value
.logical
);
2738 mio_integer (&e
->value
.character
.length
);
2739 e
->value
.character
.string
2740 = (char *) mio_allocated_string (e
->value
.character
.string
);
2744 bad_module ("Bad type in constant expression");
2757 /* Read and write namelists */
2760 mio_namelist (gfc_symbol
*sym
)
2762 gfc_namelist
*n
, *m
;
2763 const char *check_name
;
2767 if (iomode
== IO_OUTPUT
)
2769 for (n
= sym
->namelist
; n
; n
= n
->next
)
2770 mio_symbol_ref (&n
->sym
);
2774 /* This departure from the standard is flagged as an error.
2775 It does, in fact, work correctly. TODO: Allow it
2777 if (sym
->attr
.flavor
== FL_NAMELIST
)
2779 check_name
= find_use_name (sym
->name
);
2780 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
2781 gfc_error ("Namelist %s cannot be renamed by USE "
2782 "association to %s", sym
->name
, check_name
);
2786 while (peek_atom () != ATOM_RPAREN
)
2788 n
= gfc_get_namelist ();
2789 mio_symbol_ref (&n
->sym
);
2791 if (sym
->namelist
== NULL
)
2798 sym
->namelist_tail
= m
;
2805 /* Save/restore lists of gfc_interface stuctures. When loading an
2806 interface, we are really appending to the existing list of
2807 interfaces. Checking for duplicate and ambiguous interfaces has to
2808 be done later when all symbols have been loaded. */
2811 mio_interface_rest (gfc_interface
**ip
)
2813 gfc_interface
*tail
, *p
;
2815 if (iomode
== IO_OUTPUT
)
2818 for (p
= *ip
; p
; p
= p
->next
)
2819 mio_symbol_ref (&p
->sym
);
2834 if (peek_atom () == ATOM_RPAREN
)
2837 p
= gfc_get_interface ();
2838 p
->where
= gfc_current_locus
;
2839 mio_symbol_ref (&p
->sym
);
2854 /* Save/restore a nameless operator interface. */
2857 mio_interface (gfc_interface
**ip
)
2860 mio_interface_rest (ip
);
2864 /* Save/restore a named operator interface. */
2867 mio_symbol_interface (const char **name
, const char **module
,
2871 mio_pool_string (name
);
2872 mio_pool_string (module
);
2873 mio_interface_rest (ip
);
2878 mio_namespace_ref (gfc_namespace
**nsp
)
2883 p
= mio_pointer_ref (nsp
);
2885 if (p
->type
== P_UNKNOWN
)
2886 p
->type
= P_NAMESPACE
;
2888 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
2890 ns
= (gfc_namespace
*) p
->u
.pointer
;
2893 ns
= gfc_get_namespace (NULL
, 0);
2894 associate_integer_pointer (p
, ns
);
2902 /* Unlike most other routines, the address of the symbol node is already
2903 fixed on input and the name/module has already been filled in. */
2906 mio_symbol (gfc_symbol
*sym
)
2908 gfc_formal_arglist
*formal
;
2912 mio_symbol_attribute (&sym
->attr
);
2913 mio_typespec (&sym
->ts
);
2915 /* Contained procedures don't have formal namespaces. Instead we output the
2916 procedure namespace. The will contain the formal arguments. */
2917 if (iomode
== IO_OUTPUT
)
2919 formal
= sym
->formal
;
2920 while (formal
&& !formal
->sym
)
2921 formal
= formal
->next
;
2924 mio_namespace_ref (&formal
->sym
->ns
);
2926 mio_namespace_ref (&sym
->formal_ns
);
2930 mio_namespace_ref (&sym
->formal_ns
);
2933 sym
->formal_ns
->proc_name
= sym
;
2938 /* Save/restore common block links */
2939 mio_symbol_ref (&sym
->common_next
);
2941 mio_formal_arglist (sym
);
2943 if (sym
->attr
.flavor
== FL_PARAMETER
)
2944 mio_expr (&sym
->value
);
2946 mio_array_spec (&sym
->as
);
2948 mio_symbol_ref (&sym
->result
);
2950 if (sym
->attr
.cray_pointee
)
2951 mio_symbol_ref (&sym
->cp_pointer
);
2953 /* Note that components are always saved, even if they are supposed
2954 to be private. Component access is checked during searching. */
2956 mio_component_list (&sym
->components
);
2958 if (sym
->components
!= NULL
)
2959 sym
->component_access
2960 = MIO_NAME (gfc_access
) (sym
->component_access
, access_types
);
2967 /************************* Top level subroutines *************************/
2969 /* Skip a list between balanced left and right parens. */
2979 switch (parse_atom ())
2990 gfc_free (atom_string
);
3002 /* Load operator interfaces from the module. Interfaces are unusual
3003 in that they attach themselves to existing symbols. */
3006 load_operator_interfaces (void)
3009 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3014 while (peek_atom () != ATOM_RPAREN
)
3018 mio_internal_string (name
);
3019 mio_internal_string (module
);
3021 /* Decide if we need to load this one or not. */
3022 p
= find_use_name (name
);
3025 while (parse_atom () != ATOM_RPAREN
);
3029 uop
= gfc_get_uop (p
);
3030 mio_interface_rest (&uop
->operator);
3038 /* Load interfaces from the module. Interfaces are unusual in that
3039 they attach themselves to existing symbols. */
3042 load_generic_interfaces (void)
3045 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
3047 gfc_interface
*generic
= NULL
;
3052 while (peek_atom () != ATOM_RPAREN
)
3056 mio_internal_string (name
);
3057 mio_internal_string (module
);
3059 n
= number_use_names (name
);
3062 for (i
= 1; i
<= n
; i
++)
3064 /* Decide if we need to load this one or not. */
3065 p
= find_use_name_n (name
, &i
);
3067 if (p
== NULL
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
3069 while (parse_atom () != ATOM_RPAREN
);
3075 gfc_get_symbol (p
, NULL
, &sym
);
3077 sym
->attr
.flavor
= FL_PROCEDURE
;
3078 sym
->attr
.generic
= 1;
3079 sym
->attr
.use_assoc
= 1;
3083 /* Unless sym is a generic interface, this reference
3087 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3088 if (!sym
->attr
.generic
3089 && sym
->module
!= NULL
3090 && strcmp(module
, sym
->module
) != 0)
3095 mio_interface_rest (&sym
->generic
);
3096 generic
= sym
->generic
;
3100 sym
->generic
= generic
;
3101 sym
->attr
.generic_copy
= 1;
3110 /* Load common blocks. */
3115 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3120 while (peek_atom () != ATOM_RPAREN
)
3124 mio_internal_string (name
);
3126 p
= gfc_get_common (name
, 1);
3128 mio_symbol_ref (&p
->head
);
3129 mio_integer (&flags
);
3133 p
->threadprivate
= 1;
3143 /* load_equiv()-- Load equivalences. The flag in_load_equiv informs
3144 mio_expr_ref of this so that unused variables are not loaded and
3145 so that the expression can be safely freed.*/
3150 gfc_equiv
*head
, *tail
, *end
, *eq
;
3154 in_load_equiv
= true;
3156 end
= gfc_current_ns
->equiv
;
3157 while (end
!= NULL
&& end
->next
!= NULL
)
3160 while (peek_atom() != ATOM_RPAREN
) {
3164 while(peek_atom () != ATOM_RPAREN
)
3167 head
= tail
= gfc_get_equiv ();
3170 tail
->eq
= gfc_get_equiv ();
3174 mio_pool_string (&tail
->module
);
3175 mio_expr (&tail
->expr
);
3178 /* Unused variables have no symtree. */
3180 for (eq
= head
; eq
; eq
= eq
->eq
)
3182 if (!eq
->expr
->symtree
)
3191 for (eq
= head
; eq
; eq
= head
)
3194 gfc_free_expr (eq
->expr
);
3200 gfc_current_ns
->equiv
= head
;
3211 in_load_equiv
= false;
3214 /* Recursive function to traverse the pointer_info tree and load a
3215 needed symbol. We return nonzero if we load a symbol and stop the
3216 traversal, because the act of loading can alter the tree. */
3219 load_needed (pointer_info
*p
)
3230 rv
|= load_needed (p
->left
);
3231 rv
|= load_needed (p
->right
);
3233 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
3236 p
->u
.rsym
.state
= USED
;
3238 set_module_locus (&p
->u
.rsym
.where
);
3240 sym
= p
->u
.rsym
.sym
;
3243 q
= get_integer (p
->u
.rsym
.ns
);
3245 ns
= (gfc_namespace
*) q
->u
.pointer
;
3248 /* Create an interface namespace if necessary. These are
3249 the namespaces that hold the formal parameters of module
3252 ns
= gfc_get_namespace (NULL
, 0);
3253 associate_integer_pointer (q
, ns
);
3256 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
3257 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
3259 associate_integer_pointer (p
, sym
);
3263 sym
->attr
.use_assoc
= 1;
3265 sym
->attr
.use_only
= 1;
3271 /* Recursive function for cleaning up things after a module has been
3275 read_cleanup (pointer_info
*p
)
3283 read_cleanup (p
->left
);
3284 read_cleanup (p
->right
);
3286 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
3288 /* Add hidden symbols to the symtree. */
3289 q
= get_integer (p
->u
.rsym
.ns
);
3290 st
= get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
3292 st
->n
.sym
= p
->u
.rsym
.sym
;
3295 /* Fixup any symtree references. */
3296 p
->u
.rsym
.symtree
= st
;
3297 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
3298 p
->u
.rsym
.stfixup
= NULL
;
3301 /* Free unused symbols. */
3302 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
3303 gfc_free_symbol (p
->u
.rsym
.sym
);
3307 /* Read a module file. */
3312 module_locus operator_interfaces
, user_operators
;
3314 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3316 int ambiguous
, j
, nuse
, symbol
;
3322 get_module_locus (&operator_interfaces
); /* Skip these for now */
3325 get_module_locus (&user_operators
);
3329 /* Skip commons and equivalences for now. */
3335 /* Create the fixup nodes for all the symbols. */
3337 while (peek_atom () != ATOM_RPAREN
)
3339 require_atom (ATOM_INTEGER
);
3340 info
= get_integer (atom_int
);
3342 info
->type
= P_SYMBOL
;
3343 info
->u
.rsym
.state
= UNUSED
;
3345 mio_internal_string (info
->u
.rsym
.true_name
);
3346 mio_internal_string (info
->u
.rsym
.module
);
3348 require_atom (ATOM_INTEGER
);
3349 info
->u
.rsym
.ns
= atom_int
;
3351 get_module_locus (&info
->u
.rsym
.where
);
3354 /* See if the symbol has already been loaded by a previous module.
3355 If so, we reference the existing symbol and prevent it from
3356 being loaded again. This should not happen if the symbol being
3357 read is an index for an assumed shape dummy array (ns != 1). */
3359 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
3362 || (sym
->attr
.flavor
== FL_VARIABLE
&& info
->u
.rsym
.ns
!=1))
3365 info
->u
.rsym
.state
= USED
;
3366 info
->u
.rsym
.referenced
= 1;
3367 info
->u
.rsym
.sym
= sym
;
3372 /* Parse the symtree lists. This lets us mark which symbols need to
3373 be loaded. Renaming is also done at this point by replacing the
3378 while (peek_atom () != ATOM_RPAREN
)
3380 mio_internal_string (name
);
3381 mio_integer (&ambiguous
);
3382 mio_integer (&symbol
);
3384 info
= get_integer (symbol
);
3386 /* See how many use names there are. If none, go through the start
3387 of the loop at least once. */
3388 nuse
= number_use_names (name
);
3392 for (j
= 1; j
<= nuse
; j
++)
3394 /* Get the jth local name for this symbol. */
3395 p
= find_use_name_n (name
, &j
);
3397 /* Skip symtree nodes not in an ONLY clause. */
3401 /* Check for ambiguous symbols. */
3402 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3406 if (st
->n
.sym
!= info
->u
.rsym
.sym
)
3408 info
->u
.rsym
.symtree
= st
;
3412 /* Create a symtree node in the current namespace for this
3414 st
= check_unique_name (p
)
3415 ? get_unique_symtree (gfc_current_ns
)
3416 : gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3418 st
->ambiguous
= ambiguous
;
3420 sym
= info
->u
.rsym
.sym
;
3422 /* Create a symbol node if it doesn't already exist. */
3425 info
->u
.rsym
.sym
= gfc_new_symbol (info
->u
.rsym
.true_name
,
3427 sym
= info
->u
.rsym
.sym
;
3428 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
3434 /* Store the symtree pointing to this symbol. */
3435 info
->u
.rsym
.symtree
= st
;
3437 if (info
->u
.rsym
.state
== UNUSED
)
3438 info
->u
.rsym
.state
= NEEDED
;
3439 info
->u
.rsym
.referenced
= 1;
3446 /* Load intrinsic operator interfaces. */
3447 set_module_locus (&operator_interfaces
);
3450 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3452 if (i
== INTRINSIC_USER
)
3457 u
= find_use_operator (i
);
3468 mio_interface (&gfc_current_ns
->operator[i
]);
3473 /* Load generic and user operator interfaces. These must follow the
3474 loading of symtree because otherwise symbols can be marked as
3477 set_module_locus (&user_operators
);
3479 load_operator_interfaces ();
3480 load_generic_interfaces ();
3485 /* At this point, we read those symbols that are needed but haven't
3486 been loaded yet. If one symbol requires another, the other gets
3487 marked as NEEDED if its previous state was UNUSED. */
3489 while (load_needed (pi_root
));
3491 /* Make sure all elements of the rename-list were found in the module. */
3493 for (u
= gfc_rename_list
; u
; u
= u
->next
)
3498 if (u
->operator == INTRINSIC_NONE
)
3500 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3501 u
->use_name
, &u
->where
, module_name
);
3505 if (u
->operator == INTRINSIC_USER
)
3507 gfc_error ("User operator '%s' referenced at %L not found "
3508 "in module '%s'", u
->use_name
, &u
->where
, module_name
);
3512 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
3513 "in module '%s'", gfc_op2string (u
->operator), &u
->where
,
3517 gfc_check_interfaces (gfc_current_ns
);
3519 /* Clean up symbol nodes that were never loaded, create references
3520 to hidden symbols. */
3522 read_cleanup (pi_root
);
3526 /* Given an access type that is specific to an entity and the default
3527 access, return nonzero if the entity is publicly accessible. If the
3528 element is declared as PUBLIC, then it is public; if declared
3529 PRIVATE, then private, and otherwise it is public unless the default
3530 access in this context has been declared PRIVATE. */
3533 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
3535 if (specific_access
== ACCESS_PUBLIC
)
3537 if (specific_access
== ACCESS_PRIVATE
)
3540 return default_access
!= ACCESS_PRIVATE
;
3544 /* Write a common block to the module */
3547 write_common (gfc_symtree
*st
)
3556 write_common (st
->left
);
3557 write_common (st
->right
);
3561 /* Write the unmangled name. */
3562 name
= st
->n
.common
->name
;
3564 mio_pool_string (&name
);
3567 mio_symbol_ref (&p
->head
);
3568 flags
= p
->saved
? 1 : 0;
3569 if (p
->threadprivate
) flags
|= 2;
3570 mio_integer (&flags
);
3575 /* Write the blank common block to the module */
3578 write_blank_common (void)
3580 const char * name
= BLANK_COMMON_NAME
;
3583 if (gfc_current_ns
->blank_common
.head
== NULL
)
3588 mio_pool_string (&name
);
3590 mio_symbol_ref (&gfc_current_ns
->blank_common
.head
);
3591 saved
= gfc_current_ns
->blank_common
.saved
;
3592 mio_integer (&saved
);
3598 /* Write equivalences to the module. */
3607 for (eq
= gfc_current_ns
->equiv
; eq
; eq
= eq
->next
)
3611 for (e
= eq
; e
; e
= e
->eq
)
3613 if (e
->module
== NULL
)
3614 e
->module
= gfc_get_string ("%s.eq.%d", module_name
, num
);
3615 mio_allocated_string (e
->module
);
3616 mio_expr (&e
->expr
);
3625 /* Write a symbol to the module. */
3628 write_symbol (int n
, gfc_symbol
*sym
)
3631 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
3632 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
3635 mio_pool_string (&sym
->name
);
3637 mio_pool_string (&sym
->module
);
3638 mio_pointer_ref (&sym
->ns
);
3645 /* Recursive traversal function to write the initial set of symbols to
3646 the module. We check to see if the symbol should be written
3647 according to the access specification. */
3650 write_symbol0 (gfc_symtree
*st
)
3658 write_symbol0 (st
->left
);
3659 write_symbol0 (st
->right
);
3662 if (sym
->module
== NULL
)
3663 sym
->module
= gfc_get_string (module_name
);
3665 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
3666 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
3669 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
3672 p
= get_pointer (sym
);
3673 if (p
->type
== P_UNKNOWN
)
3676 if (p
->u
.wsym
.state
== WRITTEN
)
3679 write_symbol (p
->integer
, sym
);
3680 p
->u
.wsym
.state
= WRITTEN
;
3686 /* Recursive traversal function to write the secondary set of symbols
3687 to the module file. These are symbols that were not public yet are
3688 needed by the public symbols or another dependent symbol. The act
3689 of writing a symbol can modify the pointer_info tree, so we cease
3690 traversal if we find a symbol to write. We return nonzero if a
3691 symbol was written and pass that information upwards. */
3694 write_symbol1 (pointer_info
*p
)
3699 if (write_symbol1 (p
->left
))
3701 if (write_symbol1 (p
->right
))
3704 if (p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
)
3707 p
->u
.wsym
.state
= WRITTEN
;
3708 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
3714 /* Write operator interfaces associated with a symbol. */
3717 write_operator (gfc_user_op
*uop
)
3719 static char nullstring
[] = "";
3720 const char *p
= nullstring
;
3722 if (uop
->operator == NULL
3723 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
3726 mio_symbol_interface (&uop
->name
, &p
, &uop
->operator);
3730 /* Write generic interfaces associated with a symbol. */
3733 write_generic (gfc_symbol
*sym
)
3735 if (sym
->generic
== NULL
3736 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
3739 if (sym
->module
== NULL
)
3740 sym
->module
= gfc_get_string (module_name
);
3742 mio_symbol_interface (&sym
->name
, &sym
->module
, &sym
->generic
);
3747 write_symtree (gfc_symtree
*st
)
3753 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
3754 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
3755 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
3758 if (check_unique_name (st
->name
))
3761 p
= find_pointer (sym
);
3763 gfc_internal_error ("write_symtree(): Symbol not written");
3765 mio_pool_string (&st
->name
);
3766 mio_integer (&st
->ambiguous
);
3767 mio_integer (&p
->integer
);
3776 /* Write the operator interfaces. */
3779 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3781 if (i
== INTRINSIC_USER
)
3784 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
3785 gfc_current_ns
->default_access
)
3786 ? &gfc_current_ns
->operator[i
] : NULL
);
3794 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
3800 gfc_traverse_ns (gfc_current_ns
, write_generic
);
3806 write_blank_common ();
3807 write_common (gfc_current_ns
->common_root
);
3818 /* Write symbol information. First we traverse all symbols in the
3819 primary namespace, writing those that need to be written.
3820 Sometimes writing one symbol will cause another to need to be
3821 written. A list of these symbols ends up on the write stack, and
3822 we end by popping the bottom of the stack and writing the symbol
3823 until the stack is empty. */
3827 write_symbol0 (gfc_current_ns
->sym_root
);
3828 while (write_symbol1 (pi_root
));
3836 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
3841 /* Given module, dump it to disk. If there was an error while
3842 processing the module, dump_flag will be set to zero and we delete
3843 the module file, even if it was already there. */
3846 gfc_dump_module (const char *name
, int dump_flag
)
3852 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
3853 if (gfc_option
.module_dir
!= NULL
)
3855 filename
= (char *) alloca (n
+ strlen (gfc_option
.module_dir
));
3856 strcpy (filename
, gfc_option
.module_dir
);
3857 strcat (filename
, name
);
3861 filename
= (char *) alloca (n
);
3862 strcpy (filename
, name
);
3864 strcat (filename
, MODULE_EXTENSION
);
3872 module_fp
= fopen (filename
, "w");
3873 if (module_fp
== NULL
)
3874 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
3875 filename
, strerror (errno
));
3880 *strchr (p
, '\n') = '\0';
3882 fprintf (module_fp
, "GFORTRAN module created from %s on %s\n",
3883 gfc_source_file
, p
);
3884 fputs ("If you edit this, you'll get what you deserve.\n\n", module_fp
);
3887 strcpy (module_name
, name
);
3893 free_pi_tree (pi_root
);
3898 if (fclose (module_fp
))
3899 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
3900 filename
, strerror (errno
));
3904 /* Add an integer named constant from a given module. */
3906 create_int_parameter (const char *name
, int value
, const char *modname
)
3908 gfc_symtree
*tmp_symtree
;
3911 tmp_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, name
);
3912 if (tmp_symtree
!= NULL
)
3914 if (strcmp (modname
, tmp_symtree
->n
.sym
->module
) == 0)
3917 gfc_error ("Symbol '%s' already declared", name
);
3920 gfc_get_sym_tree (name
, gfc_current_ns
, &tmp_symtree
);
3921 sym
= tmp_symtree
->n
.sym
;
3923 sym
->module
= gfc_get_string (modname
);
3924 sym
->attr
.flavor
= FL_PARAMETER
;
3925 sym
->ts
.type
= BT_INTEGER
;
3926 sym
->ts
.kind
= gfc_default_integer_kind
;
3927 sym
->value
= gfc_int_expr (value
);
3928 sym
->attr
.use_assoc
= 1;
3932 /* USE the ISO_FORTRAN_ENV intrinsic module. */
3935 use_iso_fortran_env_module (void)
3937 static char mod
[] = "iso_fortran_env";
3938 const char *local_name
;
3940 gfc_symbol
*mod_sym
;
3941 gfc_symtree
*mod_symtree
;
3944 mstring symbol
[] = {
3945 #define NAMED_INTCST(a,b,c) minit(b,0),
3946 #include "iso-fortran-env.def"
3948 minit (NULL
, -1234) };
3951 #define NAMED_INTCST(a,b,c) symbol[i++].tag = c;
3952 #include "iso-fortran-env.def"
3955 /* Generate the symbol for the module itself. */
3956 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, mod
);
3957 if (mod_symtree
== NULL
)
3959 gfc_get_sym_tree (mod
, gfc_current_ns
, &mod_symtree
);
3960 gcc_assert (mod_symtree
);
3961 mod_sym
= mod_symtree
->n
.sym
;
3963 mod_sym
->attr
.flavor
= FL_MODULE
;
3964 mod_sym
->attr
.intrinsic
= 1;
3965 mod_sym
->module
= gfc_get_string (mod
);
3968 if (!mod_symtree
->n
.sym
->attr
.intrinsic
)
3969 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
3970 "non-intrinsic module name used previously", mod
);
3972 /* Generate the symbols for the module integer named constants. */
3974 for (u
= gfc_rename_list
; u
; u
= u
->next
)
3976 for (i
= 0; symbol
[i
].string
; i
++)
3977 if (strcmp (symbol
[i
].string
, u
->use_name
) == 0)
3980 if (symbol
[i
].string
== NULL
)
3982 gfc_error ("Symbol '%s' referenced at %L does not exist in "
3983 "intrinsic module ISO_FORTRAN_ENV", u
->use_name
,
3988 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
3989 && strcmp (symbol
[i
].string
, "numeric_storage_size") == 0)
3990 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
3991 "from intrinsic module ISO_FORTRAN_ENV at %L is "
3992 "incompatible with option %s", &u
->where
,
3993 gfc_option
.flag_default_integer
3994 ? "-fdefault-integer-8" : "-fdefault-real-8");
3996 create_int_parameter (u
->local_name
[0] ? u
->local_name
3998 symbol
[i
].tag
, mod
);
4002 for (i
= 0; symbol
[i
].string
; i
++)
4005 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4007 if (strcmp (symbol
[i
].string
, u
->use_name
) == 0)
4009 local_name
= u
->local_name
;
4015 if ((gfc_option
.flag_default_integer
|| gfc_option
.flag_default_real
)
4016 && strcmp (symbol
[i
].string
, "numeric_storage_size") == 0)
4017 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4018 "from intrinsic module ISO_FORTRAN_ENV at %C is "
4019 "incompatible with option %s",
4020 gfc_option
.flag_default_integer
4021 ? "-fdefault-integer-8" : "-fdefault-real-8");
4023 create_int_parameter (local_name
? local_name
: symbol
[i
].string
,
4024 symbol
[i
].tag
, mod
);
4027 for (u
= gfc_rename_list
; u
; u
= u
->next
)
4032 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4033 "module ISO_FORTRAN_ENV", u
->use_name
, &u
->where
);
4039 /* Process a USE directive. */
4042 gfc_use_module (void)
4047 gfc_symtree
*mod_symtree
;
4049 filename
= (char *) alloca (strlen (module_name
) + strlen (MODULE_EXTENSION
)
4051 strcpy (filename
, module_name
);
4052 strcat (filename
, MODULE_EXTENSION
);
4054 /* First, try to find an non-intrinsic module, unless the USE statement
4055 specified that the module is intrinsic. */
4058 module_fp
= gfc_open_included_file (filename
, true, true);
4060 /* Then, see if it's an intrinsic one, unless the USE statement
4061 specified that the module is non-intrinsic. */
4062 if (module_fp
== NULL
&& !specified_nonint
)
4064 if (strcmp (module_name
, "iso_fortran_env") == 0
4065 && gfc_notify_std (GFC_STD_F2003
, "Fortran 2003: ISO_FORTRAN_ENV "
4066 "intrinsic module at %C") != FAILURE
)
4068 use_iso_fortran_env_module ();
4072 module_fp
= gfc_open_intrinsic_module (filename
);
4074 if (module_fp
== NULL
&& specified_int
)
4075 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
4079 if (module_fp
== NULL
)
4080 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
4081 filename
, strerror (errno
));
4083 /* Check that we haven't already USEd an intrinsic module with the
4086 mod_symtree
= gfc_find_symtree (gfc_current_ns
->sym_root
, module_name
);
4087 if (mod_symtree
&& mod_symtree
->n
.sym
->attr
.intrinsic
)
4088 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
4089 "intrinsic module name used previously", module_name
);
4096 /* Skip the first two lines of the module, after checking that this is
4097 a gfortran module file. */
4103 bad_module ("Unexpected end of module");
4106 if ((start
== 1 && strcmp (atom_name
, "GFORTRAN") != 0)
4107 || (start
== 2 && strcmp (atom_name
, " module") != 0))
4108 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
4115 /* Make sure we're not reading the same module that we may be building. */
4116 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
4117 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
4118 gfc_fatal_error ("Can't USE the same module we're building!");
4121 init_true_name_tree ();
4125 free_true_name (true_name_root
);
4126 true_name_root
= NULL
;
4128 free_pi_tree (pi_root
);
4136 gfc_module_init_2 (void)
4138 last_atom
= ATOM_LPAREN
;
4143 gfc_module_done_2 (void)