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 Free
4 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 static int module_line
, module_column
, only_flag
;
178 { IO_INPUT
, IO_OUTPUT
}
181 static gfc_use_rename
*gfc_rename_list
;
182 static pointer_info
*pi_root
;
183 static int symbol_number
; /* Counter for assigning symbol numbers */
187 /*****************************************************************/
189 /* Pointer/integer conversion. Pointers between structures are stored
190 as integers in the module file. The next couple of subroutines
191 handle this translation for reading and writing. */
193 /* Recursively free the tree of pointer structures. */
196 free_pi_tree (pointer_info
* p
)
201 if (p
->fixup
!= NULL
)
202 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
204 free_pi_tree (p
->left
);
205 free_pi_tree (p
->right
);
211 /* Compare pointers when searching by pointer. Used when writing a
215 compare_pointers (void * _sn1
, void * _sn2
)
217 pointer_info
*sn1
, *sn2
;
219 sn1
= (pointer_info
*) _sn1
;
220 sn2
= (pointer_info
*) _sn2
;
222 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
224 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
231 /* Compare integers when searching by integer. Used when reading a
235 compare_integers (void * _sn1
, void * _sn2
)
237 pointer_info
*sn1
, *sn2
;
239 sn1
= (pointer_info
*) _sn1
;
240 sn2
= (pointer_info
*) _sn2
;
242 if (sn1
->integer
< sn2
->integer
)
244 if (sn1
->integer
> sn2
->integer
)
251 /* Initialize the pointer_info tree. */
260 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
262 /* Pointer 0 is the NULL pointer. */
263 p
= gfc_get_pointer_info ();
268 gfc_insert_bbt (&pi_root
, p
, compare
);
270 /* Pointer 1 is the current namespace. */
271 p
= gfc_get_pointer_info ();
272 p
->u
.pointer
= gfc_current_ns
;
274 p
->type
= P_NAMESPACE
;
276 gfc_insert_bbt (&pi_root
, p
, compare
);
282 /* During module writing, call here with a pointer to something,
283 returning the pointer_info node. */
285 static pointer_info
*
286 find_pointer (void *gp
)
293 if (p
->u
.pointer
== gp
)
295 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
302 /* Given a pointer while writing, returns the pointer_info tree node,
303 creating it if it doesn't exist. */
305 static pointer_info
*
306 get_pointer (void *gp
)
310 p
= find_pointer (gp
);
314 /* Pointer doesn't have an integer. Give it one. */
315 p
= gfc_get_pointer_info ();
318 p
->integer
= symbol_number
++;
320 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
326 /* Given an integer during reading, find it in the pointer_info tree,
327 creating the node if not found. */
329 static pointer_info
*
330 get_integer (int integer
)
340 c
= compare_integers (&t
, p
);
344 p
= (c
< 0) ? p
->left
: p
->right
;
350 p
= gfc_get_pointer_info ();
351 p
->integer
= integer
;
354 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
360 /* Recursive function to find a pointer within a tree by brute force. */
362 static pointer_info
*
363 fp2 (pointer_info
* p
, const void *target
)
370 if (p
->u
.pointer
== target
)
373 q
= fp2 (p
->left
, target
);
377 return fp2 (p
->right
, target
);
381 /* During reading, find a pointer_info node from the pointer value.
382 This amounts to a brute-force search. */
384 static pointer_info
*
385 find_pointer2 (void *p
)
388 return fp2 (pi_root
, p
);
392 /* Resolve any fixups using a known pointer. */
394 resolve_fixups (fixup_t
*f
, void * gp
)
406 /* Call here during module reading when we know what pointer to
407 associate with an integer. Any fixups that exist are resolved at
411 associate_integer_pointer (pointer_info
* p
, void *gp
)
413 if (p
->u
.pointer
!= NULL
)
414 gfc_internal_error ("associate_integer_pointer(): Already associated");
418 resolve_fixups (p
->fixup
, gp
);
424 /* During module reading, given an integer and a pointer to a pointer,
425 either store the pointer from an already-known value or create a
426 fixup structure in order to store things later. Returns zero if
427 the reference has been actually stored, or nonzero if the reference
428 must be fixed later (ie associate_integer_pointer must be called
429 sometime later. Returns the pointer_info structure. */
431 static pointer_info
*
432 add_fixup (int integer
, void *gp
)
438 p
= get_integer (integer
);
440 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
447 f
= gfc_getmem (sizeof (fixup_t
));
459 /*****************************************************************/
461 /* Parser related subroutines */
463 /* Free the rename list left behind by a USE statement. */
468 gfc_use_rename
*next
;
470 for (; gfc_rename_list
; gfc_rename_list
= next
)
472 next
= gfc_rename_list
->next
;
473 gfc_free (gfc_rename_list
);
478 /* Match a USE statement. */
483 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
484 gfc_use_rename
*tail
= NULL
, *new;
486 gfc_intrinsic_op
operator;
489 m
= gfc_match_name (module_name
);
496 if (gfc_match_eos () == MATCH_YES
)
498 if (gfc_match_char (',') != MATCH_YES
)
501 if (gfc_match (" only :") == MATCH_YES
)
504 if (gfc_match_eos () == MATCH_YES
)
509 /* Get a new rename struct and add it to the rename list. */
510 new = gfc_get_use_rename ();
511 new->where
= gfc_current_locus
;
514 if (gfc_rename_list
== NULL
)
515 gfc_rename_list
= new;
520 /* See what kind of interface we're dealing with. Assume it is
522 new->operator = INTRINSIC_NONE
;
523 if (gfc_match_generic_spec (&type
, name
, &operator) == MATCH_ERROR
)
528 case INTERFACE_NAMELESS
:
529 gfc_error ("Missing generic specification in USE statement at %C");
532 case INTERFACE_GENERIC
:
533 m
= gfc_match (" =>");
538 strcpy (new->use_name
, name
);
541 strcpy (new->local_name
, name
);
543 m
= gfc_match_name (new->use_name
);
546 if (m
== MATCH_ERROR
)
554 strcpy (new->local_name
, name
);
556 m
= gfc_match_name (new->use_name
);
559 if (m
== MATCH_ERROR
)
565 case INTERFACE_USER_OP
:
566 strcpy (new->use_name
, name
);
569 case INTERFACE_INTRINSIC_OP
:
570 new->operator = operator;
574 if (gfc_match_eos () == MATCH_YES
)
576 if (gfc_match_char (',') != MATCH_YES
)
583 gfc_syntax_error (ST_USE
);
591 /* Given a name and a number, inst, return the inst name
592 under which to load this symbol. Returns NULL if this
593 symbol shouldn't be loaded. If inst is zero, returns
594 the number of instances of this name. */
597 find_use_name_n (const char *name
, int *inst
)
603 for (u
= gfc_rename_list
; u
; u
= u
->next
)
605 if (strcmp (u
->use_name
, name
) != 0)
618 return only_flag
? NULL
: name
;
622 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
625 /* Given a name, return the name under which to load this symbol.
626 Returns NULL if this symbol shouldn't be loaded. */
629 find_use_name (const char *name
)
632 return find_use_name_n (name
, &i
);
635 /* Given a real name, return the number of use names associated
639 number_use_names (const char *name
)
643 c
= find_use_name_n (name
, &i
);
648 /* Try to find the operator in the current list. */
650 static gfc_use_rename
*
651 find_use_operator (gfc_intrinsic_op
operator)
655 for (u
= gfc_rename_list
; u
; u
= u
->next
)
656 if (u
->operator == operator)
663 /*****************************************************************/
665 /* The next couple of subroutines maintain a tree used to avoid a
666 brute-force search for a combination of true name and module name.
667 While symtree names, the name that a particular symbol is known by
668 can changed with USE statements, we still have to keep track of the
669 true names to generate the correct reference, and also avoid
670 loading the same real symbol twice in a program unit.
672 When we start reading, the true name tree is built and maintained
673 as symbols are read. The tree is searched as we load new symbols
674 to see if it already exists someplace in the namespace. */
676 typedef struct true_name
678 BBT_HEADER (true_name
);
683 static true_name
*true_name_root
;
686 /* Compare two true_name structures. */
689 compare_true_names (void * _t1
, void * _t2
)
694 t1
= (true_name
*) _t1
;
695 t2
= (true_name
*) _t2
;
697 c
= ((t1
->sym
->module
> t2
->sym
->module
)
698 - (t1
->sym
->module
< t2
->sym
->module
));
702 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
706 /* Given a true name, search the true name tree to see if it exists
707 within the main namespace. */
710 find_true_name (const char *name
, const char *module
)
716 sym
.name
= gfc_get_string (name
);
718 sym
.module
= gfc_get_string (module
);
726 c
= compare_true_names ((void *)(&t
), (void *) p
);
730 p
= (c
< 0) ? p
->left
: p
->right
;
737 /* Given a gfc_symbol pointer that is not in the true name tree, add
741 add_true_name (gfc_symbol
* sym
)
745 t
= gfc_getmem (sizeof (true_name
));
748 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
752 /* Recursive function to build the initial true name tree by
753 recursively traversing the current namespace. */
756 build_tnt (gfc_symtree
* st
)
762 build_tnt (st
->left
);
763 build_tnt (st
->right
);
765 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
768 add_true_name (st
->n
.sym
);
772 /* Initialize the true name tree with the current namespace. */
775 init_true_name_tree (void)
777 true_name_root
= NULL
;
779 build_tnt (gfc_current_ns
->sym_root
);
783 /* Recursively free a true name tree node. */
786 free_true_name (true_name
* t
)
791 free_true_name (t
->left
);
792 free_true_name (t
->right
);
798 /*****************************************************************/
800 /* Module reading and writing. */
804 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
808 static atom_type last_atom
;
811 /* The name buffer must be at least as long as a symbol name. Right
812 now it's not clear how we're going to store numeric constants--
813 probably as a hexadecimal string, since this will allow the exact
814 number to be preserved (this can't be done by a decimal
815 representation). Worry about that later. TODO! */
817 #define MAX_ATOM_SIZE 100
820 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
823 /* Report problems with a module. Error reporting is not very
824 elaborate, since this sorts of errors shouldn't really happen.
825 This subroutine never returns. */
827 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
830 bad_module (const char *msgid
)
837 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
838 module_name
, module_line
, module_column
, msgid
);
841 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
842 module_name
, module_line
, module_column
, msgid
);
845 gfc_fatal_error ("Module %s at line %d column %d: %s",
846 module_name
, module_line
, module_column
, msgid
);
852 /* Set the module's input pointer. */
855 set_module_locus (module_locus
* m
)
858 module_column
= m
->column
;
859 module_line
= m
->line
;
860 fsetpos (module_fp
, &m
->pos
);
864 /* Get the module's input pointer so that we can restore it later. */
867 get_module_locus (module_locus
* m
)
870 m
->column
= module_column
;
871 m
->line
= module_line
;
872 fgetpos (module_fp
, &m
->pos
);
876 /* Get the next character in the module, updating our reckoning of
884 c
= fgetc (module_fp
);
887 bad_module ("Unexpected EOF");
900 /* Parse a string constant. The delimiter is guaranteed to be a
910 get_module_locus (&start
);
914 /* See how long the string is */
919 bad_module ("Unexpected end of module in string constant");
937 set_module_locus (&start
);
939 atom_string
= p
= gfc_getmem (len
+ 1);
941 for (; len
> 0; len
--)
945 module_char (); /* Guaranteed to be another \' */
949 module_char (); /* Terminating \' */
950 *p
= '\0'; /* C-style string for debug purposes */
954 /* Parse a small integer. */
957 parse_integer (int c
)
965 get_module_locus (&m
);
971 atom_int
= 10 * atom_int
+ c
- '0';
972 if (atom_int
> 99999999)
973 bad_module ("Integer overflow");
976 set_module_locus (&m
);
994 get_module_locus (&m
);
999 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
1003 if (++len
> GFC_MAX_SYMBOL_LEN
)
1004 bad_module ("Name too long");
1009 fseek (module_fp
, -1, SEEK_CUR
);
1010 module_column
= m
.column
+ len
- 1;
1017 /* Read the next atom in the module's input stream. */
1028 while (c
== ' ' || c
== '\n');
1053 return ATOM_INTEGER
;
1111 bad_module ("Bad name");
1118 /* Peek at the next atom on the input. */
1126 get_module_locus (&m
);
1129 if (a
== ATOM_STRING
)
1130 gfc_free (atom_string
);
1132 set_module_locus (&m
);
1137 /* Read the next atom from the input, requiring that it be a
1141 require_atom (atom_type type
)
1147 get_module_locus (&m
);
1155 p
= _("Expected name");
1158 p
= _("Expected left parenthesis");
1161 p
= _("Expected right parenthesis");
1164 p
= _("Expected integer");
1167 p
= _("Expected string");
1170 gfc_internal_error ("require_atom(): bad atom type required");
1173 set_module_locus (&m
);
1179 /* Given a pointer to an mstring array, require that the current input
1180 be one of the strings in the array. We return the enum value. */
1183 find_enum (const mstring
* m
)
1187 i
= gfc_string2code (m
, atom_name
);
1191 bad_module ("find_enum(): Enum not found");
1197 /**************** Module output subroutines ***************************/
1199 /* Output a character to a module file. */
1202 write_char (char out
)
1205 if (fputc (out
, module_fp
) == EOF
)
1206 gfc_fatal_error ("Error writing modules file: %s", strerror (errno
));
1218 /* Write an atom to a module. The line wrapping isn't perfect, but it
1219 should work most of the time. This isn't that big of a deal, since
1220 the file really isn't meant to be read by people anyway. */
1223 write_atom (atom_type atom
, const void *v
)
1245 i
= *((const int *) v
);
1247 gfc_internal_error ("write_atom(): Writing negative integer");
1249 sprintf (buffer
, "%d", i
);
1254 gfc_internal_error ("write_atom(): Trying to write dab atom");
1260 if (atom
!= ATOM_RPAREN
)
1262 if (module_column
+ len
> 72)
1267 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1272 if (atom
== ATOM_STRING
)
1277 if (atom
== ATOM_STRING
&& *p
== '\'')
1282 if (atom
== ATOM_STRING
)
1290 /***************** Mid-level I/O subroutines *****************/
1292 /* These subroutines let their caller read or write atoms without
1293 caring about which of the two is actually happening. This lets a
1294 subroutine concentrate on the actual format of the data being
1297 static void mio_expr (gfc_expr
**);
1298 static void mio_symbol_ref (gfc_symbol
**);
1299 static void mio_symtree_ref (gfc_symtree
**);
1301 /* Read or write an enumerated value. On writing, we return the input
1302 value for the convenience of callers. We avoid using an integer
1303 pointer because enums are sometimes inside bitfields. */
1306 mio_name (int t
, const mstring
* m
)
1309 if (iomode
== IO_OUTPUT
)
1310 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1313 require_atom (ATOM_NAME
);
1320 /* Specialization of mio_name. */
1322 #define DECL_MIO_NAME(TYPE) \
1323 static inline TYPE \
1324 MIO_NAME(TYPE) (TYPE t, const mstring * m) \
1326 return (TYPE)mio_name ((int)t, m); \
1328 #define MIO_NAME(TYPE) mio_name_##TYPE
1334 if (iomode
== IO_OUTPUT
)
1335 write_atom (ATOM_LPAREN
, NULL
);
1337 require_atom (ATOM_LPAREN
);
1345 if (iomode
== IO_OUTPUT
)
1346 write_atom (ATOM_RPAREN
, NULL
);
1348 require_atom (ATOM_RPAREN
);
1353 mio_integer (int *ip
)
1356 if (iomode
== IO_OUTPUT
)
1357 write_atom (ATOM_INTEGER
, ip
);
1360 require_atom (ATOM_INTEGER
);
1366 /* Read or write a character pointer that points to a string on the
1370 mio_allocated_string (const char *s
)
1372 if (iomode
== IO_OUTPUT
)
1374 write_atom (ATOM_STRING
, s
);
1379 require_atom (ATOM_STRING
);
1385 /* Read or write a string that is in static memory. */
1388 mio_pool_string (const char **stringp
)
1390 /* TODO: one could write the string only once, and refer to it via a
1393 /* As a special case we have to deal with a NULL string. This
1394 happens for the 'module' member of 'gfc_symbol's that are not in a
1395 module. We read / write these as the empty string. */
1396 if (iomode
== IO_OUTPUT
)
1398 const char *p
= *stringp
== NULL
? "" : *stringp
;
1399 write_atom (ATOM_STRING
, p
);
1403 require_atom (ATOM_STRING
);
1404 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1405 gfc_free (atom_string
);
1410 /* Read or write a string that is inside of some already-allocated
1414 mio_internal_string (char *string
)
1417 if (iomode
== IO_OUTPUT
)
1418 write_atom (ATOM_STRING
, string
);
1421 require_atom (ATOM_STRING
);
1422 strcpy (string
, atom_string
);
1423 gfc_free (atom_string
);
1430 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1431 AB_POINTER
, AB_SAVE
, AB_TARGET
, AB_DUMMY
, AB_RESULT
,
1432 AB_DATA
, AB_IN_NAMELIST
, AB_IN_COMMON
,
1433 AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
, AB_ELEMENTAL
, AB_PURE
,
1434 AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
, AB_CRAY_POINTER
,
1435 AB_CRAY_POINTEE
, AB_THREADPRIVATE
1439 static const mstring attr_bits
[] =
1441 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1442 minit ("DIMENSION", AB_DIMENSION
),
1443 minit ("EXTERNAL", AB_EXTERNAL
),
1444 minit ("INTRINSIC", AB_INTRINSIC
),
1445 minit ("OPTIONAL", AB_OPTIONAL
),
1446 minit ("POINTER", AB_POINTER
),
1447 minit ("SAVE", AB_SAVE
),
1448 minit ("TARGET", AB_TARGET
),
1449 minit ("THREADPRIVATE", AB_THREADPRIVATE
),
1450 minit ("DUMMY", AB_DUMMY
),
1451 minit ("RESULT", AB_RESULT
),
1452 minit ("DATA", AB_DATA
),
1453 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1454 minit ("IN_COMMON", AB_IN_COMMON
),
1455 minit ("FUNCTION", AB_FUNCTION
),
1456 minit ("SUBROUTINE", AB_SUBROUTINE
),
1457 minit ("SEQUENCE", AB_SEQUENCE
),
1458 minit ("ELEMENTAL", AB_ELEMENTAL
),
1459 minit ("PURE", AB_PURE
),
1460 minit ("RECURSIVE", AB_RECURSIVE
),
1461 minit ("GENERIC", AB_GENERIC
),
1462 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1463 minit ("CRAY_POINTER", AB_CRAY_POINTER
),
1464 minit ("CRAY_POINTEE", AB_CRAY_POINTEE
),
1468 /* Specialization of mio_name. */
1469 DECL_MIO_NAME(ab_attribute
)
1470 DECL_MIO_NAME(ar_type
)
1471 DECL_MIO_NAME(array_type
)
1473 DECL_MIO_NAME(expr_t
)
1474 DECL_MIO_NAME(gfc_access
)
1475 DECL_MIO_NAME(gfc_intrinsic_op
)
1476 DECL_MIO_NAME(ifsrc
)
1477 DECL_MIO_NAME(procedure_type
)
1478 DECL_MIO_NAME(ref_type
)
1479 DECL_MIO_NAME(sym_flavor
)
1480 DECL_MIO_NAME(sym_intent
)
1481 #undef DECL_MIO_NAME
1483 /* Symbol attributes are stored in list with the first three elements
1484 being the enumerated fields, while the remaining elements (if any)
1485 indicate the individual attribute bits. The access field is not
1486 saved-- it controls what symbols are exported when a module is
1490 mio_symbol_attribute (symbol_attribute
* attr
)
1496 attr
->flavor
= MIO_NAME(sym_flavor
) (attr
->flavor
, flavors
);
1497 attr
->intent
= MIO_NAME(sym_intent
) (attr
->intent
, intents
);
1498 attr
->proc
= MIO_NAME(procedure_type
) (attr
->proc
, procedures
);
1499 attr
->if_source
= MIO_NAME(ifsrc
) (attr
->if_source
, ifsrc_types
);
1501 if (iomode
== IO_OUTPUT
)
1503 if (attr
->allocatable
)
1504 MIO_NAME(ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1505 if (attr
->dimension
)
1506 MIO_NAME(ab_attribute
) (AB_DIMENSION
, attr_bits
);
1508 MIO_NAME(ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1509 if (attr
->intrinsic
)
1510 MIO_NAME(ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1512 MIO_NAME(ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1514 MIO_NAME(ab_attribute
) (AB_POINTER
, attr_bits
);
1516 MIO_NAME(ab_attribute
) (AB_SAVE
, attr_bits
);
1518 MIO_NAME(ab_attribute
) (AB_TARGET
, attr_bits
);
1519 if (attr
->threadprivate
)
1520 MIO_NAME(ab_attribute
) (AB_THREADPRIVATE
, attr_bits
);
1522 MIO_NAME(ab_attribute
) (AB_DUMMY
, attr_bits
);
1524 MIO_NAME(ab_attribute
) (AB_RESULT
, attr_bits
);
1525 /* We deliberately don't preserve the "entry" flag. */
1528 MIO_NAME(ab_attribute
) (AB_DATA
, attr_bits
);
1529 if (attr
->in_namelist
)
1530 MIO_NAME(ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1531 if (attr
->in_common
)
1532 MIO_NAME(ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1535 MIO_NAME(ab_attribute
) (AB_FUNCTION
, attr_bits
);
1536 if (attr
->subroutine
)
1537 MIO_NAME(ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1539 MIO_NAME(ab_attribute
) (AB_GENERIC
, attr_bits
);
1542 MIO_NAME(ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1543 if (attr
->elemental
)
1544 MIO_NAME(ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1546 MIO_NAME(ab_attribute
) (AB_PURE
, attr_bits
);
1547 if (attr
->recursive
)
1548 MIO_NAME(ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1549 if (attr
->always_explicit
)
1550 MIO_NAME(ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1551 if (attr
->cray_pointer
)
1552 MIO_NAME(ab_attribute
) (AB_CRAY_POINTER
, attr_bits
);
1553 if (attr
->cray_pointee
)
1554 MIO_NAME(ab_attribute
) (AB_CRAY_POINTEE
, attr_bits
);
1565 if (t
== ATOM_RPAREN
)
1568 bad_module ("Expected attribute bit name");
1570 switch ((ab_attribute
) find_enum (attr_bits
))
1572 case AB_ALLOCATABLE
:
1573 attr
->allocatable
= 1;
1576 attr
->dimension
= 1;
1582 attr
->intrinsic
= 1;
1596 case AB_THREADPRIVATE
:
1597 attr
->threadprivate
= 1;
1608 case AB_IN_NAMELIST
:
1609 attr
->in_namelist
= 1;
1612 attr
->in_common
= 1;
1618 attr
->subroutine
= 1;
1627 attr
->elemental
= 1;
1633 attr
->recursive
= 1;
1635 case AB_ALWAYS_EXPLICIT
:
1636 attr
->always_explicit
= 1;
1638 case AB_CRAY_POINTER
:
1639 attr
->cray_pointer
= 1;
1641 case AB_CRAY_POINTEE
:
1642 attr
->cray_pointee
= 1;
1650 static const mstring bt_types
[] = {
1651 minit ("INTEGER", BT_INTEGER
),
1652 minit ("REAL", BT_REAL
),
1653 minit ("COMPLEX", BT_COMPLEX
),
1654 minit ("LOGICAL", BT_LOGICAL
),
1655 minit ("CHARACTER", BT_CHARACTER
),
1656 minit ("DERIVED", BT_DERIVED
),
1657 minit ("PROCEDURE", BT_PROCEDURE
),
1658 minit ("UNKNOWN", BT_UNKNOWN
),
1664 mio_charlen (gfc_charlen
** clp
)
1670 if (iomode
== IO_OUTPUT
)
1674 mio_expr (&cl
->length
);
1679 if (peek_atom () != ATOM_RPAREN
)
1681 cl
= gfc_get_charlen ();
1682 mio_expr (&cl
->length
);
1686 cl
->next
= gfc_current_ns
->cl_list
;
1687 gfc_current_ns
->cl_list
= cl
;
1695 /* Return a symtree node with a name that is guaranteed to be unique
1696 within the namespace and corresponds to an illegal fortran name. */
1698 static gfc_symtree
*
1699 get_unique_symtree (gfc_namespace
* ns
)
1701 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
1702 static int serial
= 0;
1704 sprintf (name
, "@%d", serial
++);
1705 return gfc_new_symtree (&ns
->sym_root
, name
);
1709 /* See if a name is a generated name. */
1712 check_unique_name (const char *name
)
1715 return *name
== '@';
1720 mio_typespec (gfc_typespec
* ts
)
1725 ts
->type
= MIO_NAME(bt
) (ts
->type
, bt_types
);
1727 if (ts
->type
!= BT_DERIVED
)
1728 mio_integer (&ts
->kind
);
1730 mio_symbol_ref (&ts
->derived
);
1732 mio_charlen (&ts
->cl
);
1738 static const mstring array_spec_types
[] = {
1739 minit ("EXPLICIT", AS_EXPLICIT
),
1740 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
1741 minit ("DEFERRED", AS_DEFERRED
),
1742 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
1748 mio_array_spec (gfc_array_spec
** asp
)
1755 if (iomode
== IO_OUTPUT
)
1763 if (peek_atom () == ATOM_RPAREN
)
1769 *asp
= as
= gfc_get_array_spec ();
1772 mio_integer (&as
->rank
);
1773 as
->type
= MIO_NAME(array_type
) (as
->type
, array_spec_types
);
1775 for (i
= 0; i
< as
->rank
; i
++)
1777 mio_expr (&as
->lower
[i
]);
1778 mio_expr (&as
->upper
[i
]);
1786 /* Given a pointer to an array reference structure (which lives in a
1787 gfc_ref structure), find the corresponding array specification
1788 structure. Storing the pointer in the ref structure doesn't quite
1789 work when loading from a module. Generating code for an array
1790 reference also needs more information than just the array spec. */
1792 static const mstring array_ref_types
[] = {
1793 minit ("FULL", AR_FULL
),
1794 minit ("ELEMENT", AR_ELEMENT
),
1795 minit ("SECTION", AR_SECTION
),
1800 mio_array_ref (gfc_array_ref
* ar
)
1805 ar
->type
= MIO_NAME(ar_type
) (ar
->type
, array_ref_types
);
1806 mio_integer (&ar
->dimen
);
1814 for (i
= 0; i
< ar
->dimen
; i
++)
1815 mio_expr (&ar
->start
[i
]);
1820 for (i
= 0; i
< ar
->dimen
; i
++)
1822 mio_expr (&ar
->start
[i
]);
1823 mio_expr (&ar
->end
[i
]);
1824 mio_expr (&ar
->stride
[i
]);
1830 gfc_internal_error ("mio_array_ref(): Unknown array ref");
1833 for (i
= 0; i
< ar
->dimen
; i
++)
1834 mio_integer ((int *) &ar
->dimen_type
[i
]);
1836 if (iomode
== IO_INPUT
)
1838 ar
->where
= gfc_current_locus
;
1840 for (i
= 0; i
< ar
->dimen
; i
++)
1841 ar
->c_where
[i
] = gfc_current_locus
;
1848 /* Saves or restores a pointer. The pointer is converted back and
1849 forth from an integer. We return the pointer_info pointer so that
1850 the caller can take additional action based on the pointer type. */
1852 static pointer_info
*
1853 mio_pointer_ref (void *gp
)
1857 if (iomode
== IO_OUTPUT
)
1859 p
= get_pointer (*((char **) gp
));
1860 write_atom (ATOM_INTEGER
, &p
->integer
);
1864 require_atom (ATOM_INTEGER
);
1865 p
= add_fixup (atom_int
, gp
);
1872 /* Save and load references to components that occur within
1873 expressions. We have to describe these references by a number and
1874 by name. The number is necessary for forward references during
1875 reading, and the name is necessary if the symbol already exists in
1876 the namespace and is not loaded again. */
1879 mio_component_ref (gfc_component
** cp
, gfc_symbol
* sym
)
1881 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
1885 p
= mio_pointer_ref (cp
);
1886 if (p
->type
== P_UNKNOWN
)
1887 p
->type
= P_COMPONENT
;
1889 if (iomode
== IO_OUTPUT
)
1890 mio_pool_string (&(*cp
)->name
);
1893 mio_internal_string (name
);
1895 /* It can happen that a component reference can be read before the
1896 associated derived type symbol has been loaded. Return now and
1897 wait for a later iteration of load_needed. */
1901 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
1903 /* Symbol already loaded, so search by name. */
1904 for (q
= sym
->components
; q
; q
= q
->next
)
1905 if (strcmp (q
->name
, name
) == 0)
1909 gfc_internal_error ("mio_component_ref(): Component not found");
1911 associate_integer_pointer (p
, q
);
1914 /* Make sure this symbol will eventually be loaded. */
1915 p
= find_pointer2 (sym
);
1916 if (p
->u
.rsym
.state
== UNUSED
)
1917 p
->u
.rsym
.state
= NEEDED
;
1923 mio_component (gfc_component
* c
)
1930 if (iomode
== IO_OUTPUT
)
1932 p
= get_pointer (c
);
1933 mio_integer (&p
->integer
);
1938 p
= get_integer (n
);
1939 associate_integer_pointer (p
, c
);
1942 if (p
->type
== P_UNKNOWN
)
1943 p
->type
= P_COMPONENT
;
1945 mio_pool_string (&c
->name
);
1946 mio_typespec (&c
->ts
);
1947 mio_array_spec (&c
->as
);
1949 mio_integer (&c
->dimension
);
1950 mio_integer (&c
->pointer
);
1952 mio_expr (&c
->initializer
);
1958 mio_component_list (gfc_component
** cp
)
1960 gfc_component
*c
, *tail
;
1964 if (iomode
== IO_OUTPUT
)
1966 for (c
= *cp
; c
; c
= c
->next
)
1977 if (peek_atom () == ATOM_RPAREN
)
1980 c
= gfc_get_component ();
1997 mio_actual_arg (gfc_actual_arglist
* a
)
2001 mio_pool_string (&a
->name
);
2002 mio_expr (&a
->expr
);
2008 mio_actual_arglist (gfc_actual_arglist
** ap
)
2010 gfc_actual_arglist
*a
, *tail
;
2014 if (iomode
== IO_OUTPUT
)
2016 for (a
= *ap
; a
; a
= a
->next
)
2026 if (peek_atom () != ATOM_LPAREN
)
2029 a
= gfc_get_actual_arglist ();
2045 /* Read and write formal argument lists. */
2048 mio_formal_arglist (gfc_symbol
* sym
)
2050 gfc_formal_arglist
*f
, *tail
;
2054 if (iomode
== IO_OUTPUT
)
2056 for (f
= sym
->formal
; f
; f
= f
->next
)
2057 mio_symbol_ref (&f
->sym
);
2062 sym
->formal
= tail
= NULL
;
2064 while (peek_atom () != ATOM_RPAREN
)
2066 f
= gfc_get_formal_arglist ();
2067 mio_symbol_ref (&f
->sym
);
2069 if (sym
->formal
== NULL
)
2082 /* Save or restore a reference to a symbol node. */
2085 mio_symbol_ref (gfc_symbol
** symp
)
2089 p
= mio_pointer_ref (symp
);
2090 if (p
->type
== P_UNKNOWN
)
2093 if (iomode
== IO_OUTPUT
)
2095 if (p
->u
.wsym
.state
== UNREFERENCED
)
2096 p
->u
.wsym
.state
= NEEDS_WRITE
;
2100 if (p
->u
.rsym
.state
== UNUSED
)
2101 p
->u
.rsym
.state
= NEEDED
;
2106 /* Save or restore a reference to a symtree node. */
2109 mio_symtree_ref (gfc_symtree
** stp
)
2113 gfc_symtree
* ns_st
= NULL
;
2115 if (iomode
== IO_OUTPUT
)
2117 /* If this is a symtree for a symbol that came from a contained module
2118 namespace, it has a unique name and we should look in the current
2119 namespace to see if the required, non-contained symbol is available
2120 yet. If so, the latter should be written. */
2121 if ((*stp
)->n
.sym
&& check_unique_name((*stp
)->name
))
2122 ns_st
= gfc_find_symtree (gfc_current_ns
->sym_root
,
2123 (*stp
)->n
.sym
->name
);
2125 /* On the other hand, if the existing symbol is the module name or the
2126 new symbol is a dummy argument, do not do the promotion. */
2127 if (ns_st
&& ns_st
->n
.sym
2128 && ns_st
->n
.sym
->attr
.flavor
!= FL_MODULE
2129 && !(*stp
)->n
.sym
->attr
.dummy
)
2130 mio_symbol_ref (&ns_st
->n
.sym
);
2132 mio_symbol_ref (&(*stp
)->n
.sym
);
2136 require_atom (ATOM_INTEGER
);
2137 p
= get_integer (atom_int
);
2138 if (p
->type
== P_UNKNOWN
)
2141 if (p
->u
.rsym
.state
== UNUSED
)
2142 p
->u
.rsym
.state
= NEEDED
;
2144 if (p
->u
.rsym
.symtree
!= NULL
)
2146 *stp
= p
->u
.rsym
.symtree
;
2150 f
= gfc_getmem (sizeof (fixup_t
));
2152 f
->next
= p
->u
.rsym
.stfixup
;
2153 p
->u
.rsym
.stfixup
= f
;
2155 f
->pointer
= (void **)stp
;
2161 mio_iterator (gfc_iterator
** ip
)
2167 if (iomode
== IO_OUTPUT
)
2174 if (peek_atom () == ATOM_RPAREN
)
2180 *ip
= gfc_get_iterator ();
2185 mio_expr (&iter
->var
);
2186 mio_expr (&iter
->start
);
2187 mio_expr (&iter
->end
);
2188 mio_expr (&iter
->step
);
2197 mio_constructor (gfc_constructor
** cp
)
2199 gfc_constructor
*c
, *tail
;
2203 if (iomode
== IO_OUTPUT
)
2205 for (c
= *cp
; c
; c
= c
->next
)
2208 mio_expr (&c
->expr
);
2209 mio_iterator (&c
->iterator
);
2219 while (peek_atom () != ATOM_RPAREN
)
2221 c
= gfc_get_constructor ();
2231 mio_expr (&c
->expr
);
2232 mio_iterator (&c
->iterator
);
2242 static const mstring ref_types
[] = {
2243 minit ("ARRAY", REF_ARRAY
),
2244 minit ("COMPONENT", REF_COMPONENT
),
2245 minit ("SUBSTRING", REF_SUBSTRING
),
2251 mio_ref (gfc_ref
** rp
)
2258 r
->type
= MIO_NAME(ref_type
) (r
->type
, ref_types
);
2263 mio_array_ref (&r
->u
.ar
);
2267 mio_symbol_ref (&r
->u
.c
.sym
);
2268 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2272 mio_expr (&r
->u
.ss
.start
);
2273 mio_expr (&r
->u
.ss
.end
);
2274 mio_charlen (&r
->u
.ss
.length
);
2283 mio_ref_list (gfc_ref
** rp
)
2285 gfc_ref
*ref
, *head
, *tail
;
2289 if (iomode
== IO_OUTPUT
)
2291 for (ref
= *rp
; ref
; ref
= ref
->next
)
2298 while (peek_atom () != ATOM_RPAREN
)
2301 head
= tail
= gfc_get_ref ();
2304 tail
->next
= gfc_get_ref ();
2318 /* Read and write an integer value. */
2321 mio_gmp_integer (mpz_t
* integer
)
2325 if (iomode
== IO_INPUT
)
2327 if (parse_atom () != ATOM_STRING
)
2328 bad_module ("Expected integer string");
2330 mpz_init (*integer
);
2331 if (mpz_set_str (*integer
, atom_string
, 10))
2332 bad_module ("Error converting integer");
2334 gfc_free (atom_string
);
2339 p
= mpz_get_str (NULL
, 10, *integer
);
2340 write_atom (ATOM_STRING
, p
);
2347 mio_gmp_real (mpfr_t
* real
)
2352 if (iomode
== IO_INPUT
)
2354 if (parse_atom () != ATOM_STRING
)
2355 bad_module ("Expected real string");
2358 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2359 gfc_free (atom_string
);
2364 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2365 atom_string
= gfc_getmem (strlen (p
) + 20);
2367 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2369 /* Fix negative numbers. */
2370 if (atom_string
[2] == '-')
2372 atom_string
[0] = '-';
2373 atom_string
[1] = '0';
2374 atom_string
[2] = '.';
2377 write_atom (ATOM_STRING
, atom_string
);
2379 gfc_free (atom_string
);
2385 /* Save and restore the shape of an array constructor. */
2388 mio_shape (mpz_t
** pshape
, int rank
)
2394 /* A NULL shape is represented by (). */
2397 if (iomode
== IO_OUTPUT
)
2409 if (t
== ATOM_RPAREN
)
2416 shape
= gfc_get_shape (rank
);
2420 for (n
= 0; n
< rank
; n
++)
2421 mio_gmp_integer (&shape
[n
]);
2427 static const mstring expr_types
[] = {
2428 minit ("OP", EXPR_OP
),
2429 minit ("FUNCTION", EXPR_FUNCTION
),
2430 minit ("CONSTANT", EXPR_CONSTANT
),
2431 minit ("VARIABLE", EXPR_VARIABLE
),
2432 minit ("SUBSTRING", EXPR_SUBSTRING
),
2433 minit ("STRUCTURE", EXPR_STRUCTURE
),
2434 minit ("ARRAY", EXPR_ARRAY
),
2435 minit ("NULL", EXPR_NULL
),
2439 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2440 generic operators, not in expressions. INTRINSIC_USER is also
2441 replaced by the correct function name by the time we see it. */
2443 static const mstring intrinsics
[] =
2445 minit ("UPLUS", INTRINSIC_UPLUS
),
2446 minit ("UMINUS", INTRINSIC_UMINUS
),
2447 minit ("PLUS", INTRINSIC_PLUS
),
2448 minit ("MINUS", INTRINSIC_MINUS
),
2449 minit ("TIMES", INTRINSIC_TIMES
),
2450 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2451 minit ("POWER", INTRINSIC_POWER
),
2452 minit ("CONCAT", INTRINSIC_CONCAT
),
2453 minit ("AND", INTRINSIC_AND
),
2454 minit ("OR", INTRINSIC_OR
),
2455 minit ("EQV", INTRINSIC_EQV
),
2456 minit ("NEQV", INTRINSIC_NEQV
),
2457 minit ("EQ", INTRINSIC_EQ
),
2458 minit ("NE", INTRINSIC_NE
),
2459 minit ("GT", INTRINSIC_GT
),
2460 minit ("GE", INTRINSIC_GE
),
2461 minit ("LT", INTRINSIC_LT
),
2462 minit ("LE", INTRINSIC_LE
),
2463 minit ("NOT", INTRINSIC_NOT
),
2464 minit ("PARENTHESES", INTRINSIC_PARENTHESES
),
2468 /* Read and write expressions. The form "()" is allowed to indicate a
2472 mio_expr (gfc_expr
** ep
)
2480 if (iomode
== IO_OUTPUT
)
2489 MIO_NAME(expr_t
) (e
->expr_type
, expr_types
);
2495 if (t
== ATOM_RPAREN
)
2502 bad_module ("Expected expression type");
2504 e
= *ep
= gfc_get_expr ();
2505 e
->where
= gfc_current_locus
;
2506 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2509 mio_typespec (&e
->ts
);
2510 mio_integer (&e
->rank
);
2512 switch (e
->expr_type
)
2515 e
->value
.op
.operator
2516 = MIO_NAME(gfc_intrinsic_op
) (e
->value
.op
.operator, intrinsics
);
2518 switch (e
->value
.op
.operator)
2520 case INTRINSIC_UPLUS
:
2521 case INTRINSIC_UMINUS
:
2523 case INTRINSIC_PARENTHESES
:
2524 mio_expr (&e
->value
.op
.op1
);
2527 case INTRINSIC_PLUS
:
2528 case INTRINSIC_MINUS
:
2529 case INTRINSIC_TIMES
:
2530 case INTRINSIC_DIVIDE
:
2531 case INTRINSIC_POWER
:
2532 case INTRINSIC_CONCAT
:
2536 case INTRINSIC_NEQV
:
2543 mio_expr (&e
->value
.op
.op1
);
2544 mio_expr (&e
->value
.op
.op2
);
2548 bad_module ("Bad operator");
2554 mio_symtree_ref (&e
->symtree
);
2555 mio_actual_arglist (&e
->value
.function
.actual
);
2557 if (iomode
== IO_OUTPUT
)
2559 e
->value
.function
.name
2560 = mio_allocated_string (e
->value
.function
.name
);
2561 flag
= e
->value
.function
.esym
!= NULL
;
2562 mio_integer (&flag
);
2564 mio_symbol_ref (&e
->value
.function
.esym
);
2566 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
2571 require_atom (ATOM_STRING
);
2572 e
->value
.function
.name
= gfc_get_string (atom_string
);
2573 gfc_free (atom_string
);
2575 mio_integer (&flag
);
2577 mio_symbol_ref (&e
->value
.function
.esym
);
2580 require_atom (ATOM_STRING
);
2581 e
->value
.function
.isym
= gfc_find_function (atom_string
);
2582 gfc_free (atom_string
);
2589 mio_symtree_ref (&e
->symtree
);
2590 mio_ref_list (&e
->ref
);
2593 case EXPR_SUBSTRING
:
2594 e
->value
.character
.string
= (char *)
2595 mio_allocated_string (e
->value
.character
.string
);
2596 mio_ref_list (&e
->ref
);
2599 case EXPR_STRUCTURE
:
2601 mio_constructor (&e
->value
.constructor
);
2602 mio_shape (&e
->shape
, e
->rank
);
2609 mio_gmp_integer (&e
->value
.integer
);
2613 gfc_set_model_kind (e
->ts
.kind
);
2614 mio_gmp_real (&e
->value
.real
);
2618 gfc_set_model_kind (e
->ts
.kind
);
2619 mio_gmp_real (&e
->value
.complex.r
);
2620 mio_gmp_real (&e
->value
.complex.i
);
2624 mio_integer (&e
->value
.logical
);
2628 mio_integer (&e
->value
.character
.length
);
2629 e
->value
.character
.string
= (char *)
2630 mio_allocated_string (e
->value
.character
.string
);
2634 bad_module ("Bad type in constant expression");
2647 /* Read and write namelists */
2650 mio_namelist (gfc_symbol
* sym
)
2652 gfc_namelist
*n
, *m
;
2653 const char *check_name
;
2657 if (iomode
== IO_OUTPUT
)
2659 for (n
= sym
->namelist
; n
; n
= n
->next
)
2660 mio_symbol_ref (&n
->sym
);
2664 /* This departure from the standard is flagged as an error.
2665 It does, in fact, work correctly. TODO: Allow it
2667 if (sym
->attr
.flavor
== FL_NAMELIST
)
2669 check_name
= find_use_name (sym
->name
);
2670 if (check_name
&& strcmp (check_name
, sym
->name
) != 0)
2671 gfc_error("Namelist %s cannot be renamed by USE"
2672 " association to %s.",
2673 sym
->name
, check_name
);
2677 while (peek_atom () != ATOM_RPAREN
)
2679 n
= gfc_get_namelist ();
2680 mio_symbol_ref (&n
->sym
);
2682 if (sym
->namelist
== NULL
)
2689 sym
->namelist_tail
= m
;
2696 /* Save/restore lists of gfc_interface stuctures. When loading an
2697 interface, we are really appending to the existing list of
2698 interfaces. Checking for duplicate and ambiguous interfaces has to
2699 be done later when all symbols have been loaded. */
2702 mio_interface_rest (gfc_interface
** ip
)
2704 gfc_interface
*tail
, *p
;
2706 if (iomode
== IO_OUTPUT
)
2709 for (p
= *ip
; p
; p
= p
->next
)
2710 mio_symbol_ref (&p
->sym
);
2726 if (peek_atom () == ATOM_RPAREN
)
2729 p
= gfc_get_interface ();
2730 p
->where
= gfc_current_locus
;
2731 mio_symbol_ref (&p
->sym
);
2746 /* Save/restore a nameless operator interface. */
2749 mio_interface (gfc_interface
** ip
)
2753 mio_interface_rest (ip
);
2757 /* Save/restore a named operator interface. */
2760 mio_symbol_interface (const char **name
, const char **module
,
2761 gfc_interface
** ip
)
2766 mio_pool_string (name
);
2767 mio_pool_string (module
);
2769 mio_interface_rest (ip
);
2774 mio_namespace_ref (gfc_namespace
** nsp
)
2779 p
= mio_pointer_ref (nsp
);
2781 if (p
->type
== P_UNKNOWN
)
2782 p
->type
= P_NAMESPACE
;
2784 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
2786 ns
= (gfc_namespace
*)p
->u
.pointer
;
2789 ns
= gfc_get_namespace (NULL
, 0);
2790 associate_integer_pointer (p
, ns
);
2798 /* Unlike most other routines, the address of the symbol node is
2799 already fixed on input and the name/module has already been filled
2803 mio_symbol (gfc_symbol
* sym
)
2805 gfc_formal_arglist
*formal
;
2809 mio_symbol_attribute (&sym
->attr
);
2810 mio_typespec (&sym
->ts
);
2812 /* Contained procedures don't have formal namespaces. Instead we output the
2813 procedure namespace. The will contain the formal arguments. */
2814 if (iomode
== IO_OUTPUT
)
2816 formal
= sym
->formal
;
2817 while (formal
&& !formal
->sym
)
2818 formal
= formal
->next
;
2821 mio_namespace_ref (&formal
->sym
->ns
);
2823 mio_namespace_ref (&sym
->formal_ns
);
2827 mio_namespace_ref (&sym
->formal_ns
);
2830 sym
->formal_ns
->proc_name
= sym
;
2835 /* Save/restore common block links */
2836 mio_symbol_ref (&sym
->common_next
);
2838 mio_formal_arglist (sym
);
2840 if (sym
->attr
.flavor
== FL_PARAMETER
)
2841 mio_expr (&sym
->value
);
2843 mio_array_spec (&sym
->as
);
2845 mio_symbol_ref (&sym
->result
);
2847 if (sym
->attr
.cray_pointee
)
2848 mio_symbol_ref (&sym
->cp_pointer
);
2850 /* Note that components are always saved, even if they are supposed
2851 to be private. Component access is checked during searching. */
2853 mio_component_list (&sym
->components
);
2855 if (sym
->components
!= NULL
)
2856 sym
->component_access
=
2857 MIO_NAME(gfc_access
) (sym
->component_access
, access_types
);
2864 /************************* Top level subroutines *************************/
2866 /* Skip a list between balanced left and right parens. */
2876 switch (parse_atom ())
2887 gfc_free (atom_string
);
2899 /* Load operator interfaces from the module. Interfaces are unusual
2900 in that they attach themselves to existing symbols. */
2903 load_operator_interfaces (void)
2906 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
2911 while (peek_atom () != ATOM_RPAREN
)
2915 mio_internal_string (name
);
2916 mio_internal_string (module
);
2918 /* Decide if we need to load this one or not. */
2919 p
= find_use_name (name
);
2922 while (parse_atom () != ATOM_RPAREN
);
2926 uop
= gfc_get_uop (p
);
2927 mio_interface_rest (&uop
->operator);
2935 /* Load interfaces from the module. Interfaces are unusual in that
2936 they attach themselves to existing symbols. */
2939 load_generic_interfaces (void)
2942 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
2947 while (peek_atom () != ATOM_RPAREN
)
2951 mio_internal_string (name
);
2952 mio_internal_string (module
);
2954 /* Decide if we need to load this one or not. */
2955 p
= find_use_name (name
);
2957 if (p
== NULL
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
2959 while (parse_atom () != ATOM_RPAREN
);
2965 gfc_get_symbol (p
, NULL
, &sym
);
2967 sym
->attr
.flavor
= FL_PROCEDURE
;
2968 sym
->attr
.generic
= 1;
2969 sym
->attr
.use_assoc
= 1;
2972 mio_interface_rest (&sym
->generic
);
2979 /* Load common blocks. */
2984 char name
[GFC_MAX_SYMBOL_LEN
+1];
2989 while (peek_atom () != ATOM_RPAREN
)
2993 mio_internal_string (name
);
2995 p
= gfc_get_common (name
, 1);
2997 mio_symbol_ref (&p
->head
);
2998 mio_integer (&flags
);
3002 p
->threadprivate
= 1;
3011 /* load_equiv()-- Load equivalences. */
3016 gfc_equiv
*head
, *tail
, *end
;
3020 end
= gfc_current_ns
->equiv
;
3021 while(end
!= NULL
&& end
->next
!= NULL
)
3024 while(peek_atom() != ATOM_RPAREN
) {
3028 while(peek_atom() != ATOM_RPAREN
)
3031 head
= tail
= gfc_get_equiv();
3034 tail
->eq
= gfc_get_equiv();
3038 mio_pool_string(&tail
->module
);
3039 mio_expr(&tail
->expr
);
3043 gfc_current_ns
->equiv
= head
;
3054 /* Recursive function to traverse the pointer_info tree and load a
3055 needed symbol. We return nonzero if we load a symbol and stop the
3056 traversal, because the act of loading can alter the tree. */
3059 load_needed (pointer_info
* p
)
3067 if (load_needed (p
->left
))
3069 if (load_needed (p
->right
))
3072 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
3075 p
->u
.rsym
.state
= USED
;
3077 set_module_locus (&p
->u
.rsym
.where
);
3079 sym
= p
->u
.rsym
.sym
;
3082 q
= get_integer (p
->u
.rsym
.ns
);
3084 ns
= (gfc_namespace
*) q
->u
.pointer
;
3087 /* Create an interface namespace if necessary. These are
3088 the namespaces that hold the formal parameters of module
3091 ns
= gfc_get_namespace (NULL
, 0);
3092 associate_integer_pointer (q
, ns
);
3095 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
3096 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
3098 associate_integer_pointer (p
, sym
);
3102 sym
->attr
.use_assoc
= 1;
3108 /* Recursive function for cleaning up things after a module has been
3112 read_cleanup (pointer_info
* p
)
3120 read_cleanup (p
->left
);
3121 read_cleanup (p
->right
);
3123 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
3125 /* Add hidden symbols to the symtree. */
3126 q
= get_integer (p
->u
.rsym
.ns
);
3127 st
= get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
3129 st
->n
.sym
= p
->u
.rsym
.sym
;
3132 /* Fixup any symtree references. */
3133 p
->u
.rsym
.symtree
= st
;
3134 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
3135 p
->u
.rsym
.stfixup
= NULL
;
3138 /* Free unused symbols. */
3139 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
3140 gfc_free_symbol (p
->u
.rsym
.sym
);
3144 /* Read a module file. */
3149 module_locus operator_interfaces
, user_operators
;
3151 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
3153 int ambiguous
, j
, nuse
, symbol
;
3159 get_module_locus (&operator_interfaces
); /* Skip these for now */
3162 get_module_locus (&user_operators
);
3166 /* Skip commons and equivalences for now. */
3172 /* Create the fixup nodes for all the symbols. */
3174 while (peek_atom () != ATOM_RPAREN
)
3176 require_atom (ATOM_INTEGER
);
3177 info
= get_integer (atom_int
);
3179 info
->type
= P_SYMBOL
;
3180 info
->u
.rsym
.state
= UNUSED
;
3182 mio_internal_string (info
->u
.rsym
.true_name
);
3183 mio_internal_string (info
->u
.rsym
.module
);
3185 require_atom (ATOM_INTEGER
);
3186 info
->u
.rsym
.ns
= atom_int
;
3188 get_module_locus (&info
->u
.rsym
.where
);
3191 /* See if the symbol has already been loaded by a previous module.
3192 If so, we reference the existing symbol and prevent it from
3193 being loaded again. This should not happen if the symbol being
3194 read is an index for an assumed shape dummy array (ns != 1). */
3196 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
3199 || (sym
->attr
.flavor
== FL_VARIABLE
3200 && info
->u
.rsym
.ns
!=1))
3203 info
->u
.rsym
.state
= USED
;
3204 info
->u
.rsym
.referenced
= 1;
3205 info
->u
.rsym
.sym
= sym
;
3210 /* Parse the symtree lists. This lets us mark which symbols need to
3211 be loaded. Renaming is also done at this point by replacing the
3216 while (peek_atom () != ATOM_RPAREN
)
3218 mio_internal_string (name
);
3219 mio_integer (&ambiguous
);
3220 mio_integer (&symbol
);
3222 info
= get_integer (symbol
);
3224 /* See how many use names there are. If none, go through the start
3225 of the loop at least once. */
3226 nuse
= number_use_names (name
);
3230 for (j
= 1; j
<= nuse
; j
++)
3232 /* Get the jth local name for this symbol. */
3233 p
= find_use_name_n (name
, &j
);
3235 /* Skip symtree nodes not in an ONLY clause. */
3239 /* Check for ambiguous symbols. */
3240 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3244 if (st
->n
.sym
!= info
->u
.rsym
.sym
)
3246 info
->u
.rsym
.symtree
= st
;
3250 /* Create a symtree node in the current namespace for this symbol. */
3251 st
= check_unique_name (p
) ? get_unique_symtree (gfc_current_ns
) :
3252 gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3254 st
->ambiguous
= ambiguous
;
3256 sym
= info
->u
.rsym
.sym
;
3258 /* Create a symbol node if it doesn't already exist. */
3261 sym
= info
->u
.rsym
.sym
=
3262 gfc_new_symbol (info
->u
.rsym
.true_name
,
3265 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
3271 /* Store the symtree pointing to this symbol. */
3272 info
->u
.rsym
.symtree
= st
;
3274 if (info
->u
.rsym
.state
== UNUSED
)
3275 info
->u
.rsym
.state
= NEEDED
;
3276 info
->u
.rsym
.referenced
= 1;
3283 /* Load intrinsic operator interfaces. */
3284 set_module_locus (&operator_interfaces
);
3287 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3289 if (i
== INTRINSIC_USER
)
3294 u
= find_use_operator (i
);
3305 mio_interface (&gfc_current_ns
->operator[i
]);
3310 /* Load generic and user operator interfaces. These must follow the
3311 loading of symtree because otherwise symbols can be marked as
3314 set_module_locus (&user_operators
);
3316 load_operator_interfaces ();
3317 load_generic_interfaces ();
3322 /* At this point, we read those symbols that are needed but haven't
3323 been loaded yet. If one symbol requires another, the other gets
3324 marked as NEEDED if its previous state was UNUSED. */
3326 while (load_needed (pi_root
));
3328 /* Make sure all elements of the rename-list were found in the
3331 for (u
= gfc_rename_list
; u
; u
= u
->next
)
3336 if (u
->operator == INTRINSIC_NONE
)
3338 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3339 u
->use_name
, &u
->where
, module_name
);
3343 if (u
->operator == INTRINSIC_USER
)
3346 ("User operator '%s' referenced at %L not found in module '%s'",
3347 u
->use_name
, &u
->where
, module_name
);
3352 ("Intrinsic operator '%s' referenced at %L not found in module "
3353 "'%s'", gfc_op2string (u
->operator), &u
->where
, module_name
);
3356 gfc_check_interfaces (gfc_current_ns
);
3358 /* Clean up symbol nodes that were never loaded, create references
3359 to hidden symbols. */
3361 read_cleanup (pi_root
);
3365 /* Given an access type that is specific to an entity and the default
3366 access, return nonzero if the entity is publicly accessible. */
3369 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
3372 if (specific_access
== ACCESS_PUBLIC
)
3374 if (specific_access
== ACCESS_PRIVATE
)
3377 if (gfc_option
.flag_module_access_private
)
3378 return default_access
== ACCESS_PUBLIC
;
3380 return default_access
!= ACCESS_PRIVATE
;
3386 /* Write a common block to the module */
3389 write_common (gfc_symtree
*st
)
3398 write_common(st
->left
);
3399 write_common(st
->right
);
3403 /* Write the unmangled name. */
3404 name
= st
->n
.common
->name
;
3406 mio_pool_string(&name
);
3409 mio_symbol_ref(&p
->head
);
3410 flags
= p
->saved
? 1 : 0;
3411 if (p
->threadprivate
) flags
|= 2;
3412 mio_integer(&flags
);
3417 /* Write the blank common block to the module */
3420 write_blank_common (void)
3422 const char * name
= BLANK_COMMON_NAME
;
3425 if (gfc_current_ns
->blank_common
.head
== NULL
)
3430 mio_pool_string(&name
);
3432 mio_symbol_ref(&gfc_current_ns
->blank_common
.head
);
3433 saved
= gfc_current_ns
->blank_common
.saved
;
3434 mio_integer(&saved
);
3439 /* Write equivalences to the module. */
3448 for(eq
=gfc_current_ns
->equiv
; eq
; eq
=eq
->next
)
3452 for(e
=eq
; e
; e
=e
->eq
)
3454 if (e
->module
== NULL
)
3455 e
->module
= gfc_get_string("%s.eq.%d", module_name
, num
);
3456 mio_allocated_string(e
->module
);
3465 /* Write a symbol to the module. */
3468 write_symbol (int n
, gfc_symbol
* sym
)
3471 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
3472 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
3475 mio_pool_string (&sym
->name
);
3477 mio_pool_string (&sym
->module
);
3478 mio_pointer_ref (&sym
->ns
);
3485 /* Recursive traversal function to write the initial set of symbols to
3486 the module. We check to see if the symbol should be written
3487 according to the access specification. */
3490 write_symbol0 (gfc_symtree
* st
)
3498 write_symbol0 (st
->left
);
3499 write_symbol0 (st
->right
);
3502 if (sym
->module
== NULL
)
3503 sym
->module
= gfc_get_string (module_name
);
3505 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
3506 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
3509 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
3512 p
= get_pointer (sym
);
3513 if (p
->type
== P_UNKNOWN
)
3516 if (p
->u
.wsym
.state
== WRITTEN
)
3519 write_symbol (p
->integer
, sym
);
3520 p
->u
.wsym
.state
= WRITTEN
;
3526 /* Recursive traversal function to write the secondary set of symbols
3527 to the module file. These are symbols that were not public yet are
3528 needed by the public symbols or another dependent symbol. The act
3529 of writing a symbol can modify the pointer_info tree, so we cease
3530 traversal if we find a symbol to write. We return nonzero if a
3531 symbol was written and pass that information upwards. */
3534 write_symbol1 (pointer_info
* p
)
3540 if (write_symbol1 (p
->left
))
3542 if (write_symbol1 (p
->right
))
3545 if (p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
)
3548 p
->u
.wsym
.state
= WRITTEN
;
3549 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
3555 /* Write operator interfaces associated with a symbol. */
3558 write_operator (gfc_user_op
* uop
)
3560 static char nullstring
[] = "";
3561 const char *p
= nullstring
;
3563 if (uop
->operator == NULL
3564 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
3567 mio_symbol_interface (&uop
->name
, &p
, &uop
->operator);
3571 /* Write generic interfaces associated with a symbol. */
3574 write_generic (gfc_symbol
* sym
)
3577 if (sym
->generic
== NULL
3578 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
3581 mio_symbol_interface (&sym
->name
, &sym
->module
, &sym
->generic
);
3586 write_symtree (gfc_symtree
* st
)
3592 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
3593 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
3594 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
3597 if (check_unique_name (st
->name
))
3600 p
= find_pointer (sym
);
3602 gfc_internal_error ("write_symtree(): Symbol not written");
3604 mio_pool_string (&st
->name
);
3605 mio_integer (&st
->ambiguous
);
3606 mio_integer (&p
->integer
);
3615 /* Write the operator interfaces. */
3618 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3620 if (i
== INTRINSIC_USER
)
3623 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
3624 gfc_current_ns
->default_access
)
3625 ? &gfc_current_ns
->operator[i
] : NULL
);
3633 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
3639 gfc_traverse_ns (gfc_current_ns
, write_generic
);
3645 write_blank_common ();
3646 write_common (gfc_current_ns
->common_root
);
3654 write_char('\n'); write_char('\n');
3656 /* Write symbol information. First we traverse all symbols in the
3657 primary namespace, writing those that need to be written.
3658 Sometimes writing one symbol will cause another to need to be
3659 written. A list of these symbols ends up on the write stack, and
3660 we end by popping the bottom of the stack and writing the symbol
3661 until the stack is empty. */
3665 write_symbol0 (gfc_current_ns
->sym_root
);
3666 while (write_symbol1 (pi_root
));
3674 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
3679 /* Given module, dump it to disk. If there was an error while
3680 processing the module, dump_flag will be set to zero and we delete
3681 the module file, even if it was already there. */
3684 gfc_dump_module (const char *name
, int dump_flag
)
3690 n
= strlen (name
) + strlen (MODULE_EXTENSION
) + 1;
3691 if (gfc_option
.module_dir
!= NULL
)
3693 filename
= (char *) alloca (n
+ strlen (gfc_option
.module_dir
));
3694 strcpy (filename
, gfc_option
.module_dir
);
3695 strcat (filename
, name
);
3699 filename
= (char *) alloca (n
);
3700 strcpy (filename
, name
);
3702 strcat (filename
, MODULE_EXTENSION
);
3710 module_fp
= fopen (filename
, "w");
3711 if (module_fp
== NULL
)
3712 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
3713 filename
, strerror (errno
));
3718 *strchr (p
, '\n') = '\0';
3720 fprintf (module_fp
, "GFORTRAN module created from %s on %s\n",
3721 gfc_source_file
, p
);
3722 fputs ("If you edit this, you'll get what you deserve.\n\n", module_fp
);
3725 strcpy (module_name
, name
);
3731 free_pi_tree (pi_root
);
3736 if (fclose (module_fp
))
3737 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
3738 filename
, strerror (errno
));
3742 /* Process a USE directive. */
3745 gfc_use_module (void)
3751 filename
= (char *) alloca(strlen(module_name
) + strlen(MODULE_EXTENSION
)
3753 strcpy (filename
, module_name
);
3754 strcat (filename
, MODULE_EXTENSION
);
3756 module_fp
= gfc_open_included_file (filename
, true);
3757 if (module_fp
== NULL
)
3758 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
3759 filename
, strerror (errno
));
3765 /* Skip the first two lines of the module. */
3766 /* FIXME: Could also check for valid two lines here, instead. */
3772 bad_module ("Unexpected end of module");
3777 /* Make sure we're not reading the same module that we may be building. */
3778 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
3779 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
3780 gfc_fatal_error ("Can't USE the same module we're building!");
3783 init_true_name_tree ();
3787 free_true_name (true_name_root
);
3788 true_name_root
= NULL
;
3790 free_pi_tree (pi_root
);
3798 gfc_module_init_2 (void)
3801 last_atom
= ATOM_LPAREN
;
3806 gfc_module_done_2 (void)