1 /* Handle modules, which amounts to loading and saving symbols and
2 their attendant structures.
3 Copyright (C) 2000, 2001, 2002, 2003, 2004 Free Software Foundation,
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, 59 Temple Place - Suite 330, Boston, MA
24 /* The syntax of g95 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>)
50 ( <Symbol Number (in no particular order)>
52 <Module name of symbol>
53 ( <symbol information> )
62 In general, symbols refer to other symbols by their symbol number,
63 which are zero based. Symbols are written to the module in no
75 #include "parse.h" /* FIXME */
77 #define MODULE_EXTENSION ".mod"
80 /* Structure that descibes a position within a module file */
92 P_UNKNOWN
= 0, P_OTHER
, P_NAMESPACE
, P_COMPONENT
, P_SYMBOL
96 /* The fixup structure lists pointers to pointers that have to
97 be updated when a pointer value becomes known. */
99 typedef struct fixup_t
102 struct fixup_t
*next
;
107 /* Structure for holding extra info needed for pointers being read */
109 typedef struct pointer_info
111 BBT_HEADER (pointer_info
);
115 /* The first component of each member of the union is the pointer
122 void *pointer
; /* Member for doing pointer searches */
127 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
129 { UNUSED
, NEEDED
, USED
}
134 gfc_symtree
*symtree
;
142 { UNREFERENCED
= 0, NEEDS_WRITE
, WRITTEN
}
152 #define gfc_get_pointer_info() gfc_getmem(sizeof(pointer_info))
155 /* Lists of rename info for the USE statement */
157 typedef struct gfc_use_rename
159 char local_name
[GFC_MAX_SYMBOL_LEN
+ 1], use_name
[GFC_MAX_SYMBOL_LEN
+ 1];
160 struct gfc_use_rename
*next
;
162 gfc_intrinsic_op
operator;
167 #define gfc_get_use_rename() gfc_getmem(sizeof(gfc_use_rename))
169 /* Local variables */
171 /* The FILE for the module we're reading or writing. */
172 static FILE *module_fp
;
174 /* The name of the module we're reading (USE'ing) or writing. */
175 static char module_name
[GFC_MAX_SYMBOL_LEN
+ 1];
177 static int module_line
, module_column
, only_flag
;
179 { IO_INPUT
, IO_OUTPUT
}
182 static gfc_use_rename
*gfc_rename_list
;
183 static pointer_info
*pi_root
;
184 static int symbol_number
; /* Counter for assigning symbol numbers */
188 /*****************************************************************/
190 /* Pointer/integer conversion. Pointers between structures are stored
191 as integers in the module file. The next couple of subroutines
192 handle this translation for reading and writing. */
194 /* Recursively free the tree of pointer structures. */
197 free_pi_tree (pointer_info
* p
)
203 if (p
->fixup
!= NULL
)
204 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
206 free_pi_tree (p
->left
);
207 free_pi_tree (p
->right
);
213 /* Compare pointers when searching by pointer. Used when writing a
217 compare_pointers (void * _sn1
, void * _sn2
)
219 pointer_info
*sn1
, *sn2
;
221 sn1
= (pointer_info
*) _sn1
;
222 sn2
= (pointer_info
*) _sn2
;
224 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
226 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
233 /* Compare integers when searching by integer. Used when reading a
237 compare_integers (void * _sn1
, void * _sn2
)
239 pointer_info
*sn1
, *sn2
;
241 sn1
= (pointer_info
*) _sn1
;
242 sn2
= (pointer_info
*) _sn2
;
244 if (sn1
->integer
< sn2
->integer
)
246 if (sn1
->integer
> sn2
->integer
)
253 /* Initialize the pointer_info tree. */
262 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
264 /* Pointer 0 is the NULL pointer. */
265 p
= gfc_get_pointer_info ();
270 gfc_insert_bbt (&pi_root
, p
, compare
);
272 /* Pointer 1 is the current namespace. */
273 p
= gfc_get_pointer_info ();
274 p
->u
.pointer
= gfc_current_ns
;
276 p
->type
= P_NAMESPACE
;
278 gfc_insert_bbt (&pi_root
, p
, compare
);
284 /* During module writing, call here with a pointer to something,
285 returning the pointer_info node. */
287 static pointer_info
*
288 find_pointer (void *gp
)
295 if (p
->u
.pointer
== gp
)
297 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
304 /* Given a pointer while writing, returns the pointer_info tree node,
305 creating it if it doesn't exist. */
307 static pointer_info
*
308 get_pointer (void *gp
)
312 p
= find_pointer (gp
);
316 /* Pointer doesn't have an integer. Give it one. */
317 p
= gfc_get_pointer_info ();
320 p
->integer
= symbol_number
++;
322 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
328 /* Given an integer during reading, find it in the pointer_info tree,
329 creating the node if not found. */
331 static pointer_info
*
332 get_integer (int integer
)
342 c
= compare_integers (&t
, p
);
346 p
= (c
< 0) ? p
->left
: p
->right
;
352 p
= gfc_get_pointer_info ();
353 p
->integer
= integer
;
356 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
362 /* Recursive function to find a pointer within a tree by brute force. */
364 static pointer_info
*
365 fp2 (pointer_info
* p
, const void *target
)
372 if (p
->u
.pointer
== target
)
375 q
= fp2 (p
->left
, target
);
379 return fp2 (p
->right
, target
);
383 /* During reading, find a pointer_info node from the pointer value.
384 This amounts to a brute-force search. */
386 static pointer_info
*
387 find_pointer2 (void *p
)
390 return fp2 (pi_root
, p
);
394 /* Resolve any fixups using a known pointer. */
396 resolve_fixups (fixup_t
*f
, void * gp
)
408 /* Call here during module reading when we know what pointer to
409 associate with an integer. Any fixups that exist are resolved at
413 associate_integer_pointer (pointer_info
* p
, void *gp
)
415 if (p
->u
.pointer
!= NULL
)
416 gfc_internal_error ("associate_integer_pointer(): Already associated");
420 resolve_fixups (p
->fixup
, gp
);
426 /* During module reading, given an integer and a pointer to a pointer,
427 either store the pointer from an already-known value or create a
428 fixup structure in order to store things later. Returns zero if
429 the reference has been actually stored, or nonzero if the reference
430 must be fixed later (ie associate_integer_pointer must be called
431 sometime later. Returns the pointer_info structure. */
433 static pointer_info
*
434 add_fixup (int integer
, void *gp
)
440 p
= get_integer (integer
);
442 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
449 f
= gfc_getmem (sizeof (fixup_t
));
461 /*****************************************************************/
463 /* Parser related subroutines */
465 /* Free the rename list left behind by a USE statement. */
470 gfc_use_rename
*next
;
472 for (; gfc_rename_list
; gfc_rename_list
= next
)
474 next
= gfc_rename_list
->next
;
475 gfc_free (gfc_rename_list
);
480 /* Match a USE statement. */
485 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
486 gfc_use_rename
*tail
= NULL
, *new;
488 gfc_intrinsic_op
operator;
491 m
= gfc_match_name (module_name
);
498 if (gfc_match_eos () == MATCH_YES
)
500 if (gfc_match_char (',') != MATCH_YES
)
503 if (gfc_match (" only :") == MATCH_YES
)
506 if (gfc_match_eos () == MATCH_YES
)
511 /* Get a new rename struct and add it to the rename list. */
512 new = gfc_get_use_rename ();
513 new->where
= gfc_current_locus
;
516 if (gfc_rename_list
== NULL
)
517 gfc_rename_list
= new;
522 /* See what kind of interface we're dealing with. Asusume it is
524 new->operator = INTRINSIC_NONE
;
525 if (gfc_match_generic_spec (&type
, name
, &operator) == MATCH_ERROR
)
530 case INTERFACE_NAMELESS
:
531 gfc_error ("Missing generic specification in USE statement at %C");
534 case INTERFACE_GENERIC
:
535 m
= gfc_match (" =>");
540 strcpy (new->use_name
, name
);
543 strcpy (new->local_name
, name
);
545 m
= gfc_match_name (new->use_name
);
548 if (m
== MATCH_ERROR
)
556 strcpy (new->local_name
, name
);
558 m
= gfc_match_name (new->use_name
);
561 if (m
== MATCH_ERROR
)
567 case INTERFACE_USER_OP
:
568 strcpy (new->use_name
, name
);
571 case INTERFACE_INTRINSIC_OP
:
572 new->operator = operator;
576 if (gfc_match_eos () == MATCH_YES
)
578 if (gfc_match_char (',') != MATCH_YES
)
585 gfc_syntax_error (ST_USE
);
593 /* Given a name, return the name under which to load this symbol.
594 Returns NULL if this symbol shouldn't be loaded. */
597 find_use_name (const char *name
)
601 for (u
= gfc_rename_list
; u
; u
= u
->next
)
602 if (strcmp (u
->use_name
, name
) == 0)
606 return only_flag
? NULL
: name
;
610 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
614 /* Try to find the operator in the current list. */
616 static gfc_use_rename
*
617 find_use_operator (gfc_intrinsic_op
operator)
621 for (u
= gfc_rename_list
; u
; u
= u
->next
)
622 if (u
->operator == operator)
629 /*****************************************************************/
631 /* The next couple of subroutines maintain a tree used to avoid a
632 brute-force search for a combination of true name and module name.
633 While symtree names, the name that a particular symbol is known by
634 can changed with USE statements, we still have to keep track of the
635 true names to generate the correct reference, and also avoid
636 loading the same real symbol twice in a program unit.
638 When we start reading, the true name tree is built and maintained
639 as symbols are read. The tree is searched as we load new symbols
640 to see if it already exists someplace in the namespace. */
642 typedef struct true_name
644 BBT_HEADER (true_name
);
649 static true_name
*true_name_root
;
652 /* Compare two true_name structures. */
655 compare_true_names (void * _t1
, void * _t2
)
660 t1
= (true_name
*) _t1
;
661 t2
= (true_name
*) _t2
;
663 c
= strcmp (t1
->sym
->module
, t2
->sym
->module
);
667 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
671 /* Given a true name, search the true name tree to see if it exists
672 within the main namespace. */
675 find_true_name (const char *name
, const char *module
)
681 strcpy (sym
.name
, name
);
682 strcpy (sym
.module
, module
);
688 c
= compare_true_names ((void *)(&t
), (void *) p
);
692 p
= (c
< 0) ? p
->left
: p
->right
;
699 /* Given a gfc_symbol pointer that is not in the true name tree, add
703 add_true_name (gfc_symbol
* sym
)
707 t
= gfc_getmem (sizeof (true_name
));
710 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
714 /* Recursive function to build the initial true name tree by
715 recursively traversing the current namespace. */
718 build_tnt (gfc_symtree
* st
)
724 build_tnt (st
->left
);
725 build_tnt (st
->right
);
727 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
730 add_true_name (st
->n
.sym
);
734 /* Initialize the true name tree with the current namespace. */
737 init_true_name_tree (void)
739 true_name_root
= NULL
;
741 build_tnt (gfc_current_ns
->sym_root
);
745 /* Recursively free a true name tree node. */
748 free_true_name (true_name
* t
)
753 free_true_name (t
->left
);
754 free_true_name (t
->right
);
760 /*****************************************************************/
762 /* Module reading and writing. */
766 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
770 static atom_type last_atom
;
773 /* The name buffer must be at least as long as a symbol name. Right
774 now it's not clear how we're going to store numeric constants--
775 probably as a hexadecimal string, since this will allow the exact
776 number to be preserved (this can't be done by a decimal
777 representation). Worry about that later. TODO! */
779 #define MAX_ATOM_SIZE 100
782 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
785 /* Report problems with a module. Error reporting is not very
786 elaborate, since this sorts of errors shouldn't really happen.
787 This subroutine never returns. */
789 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
792 bad_module (const char *message
)
811 gfc_fatal_error ("%s module %s at line %d column %d: %s", p
,
812 module_name
, module_line
, module_column
, message
);
816 /* Set the module's input pointer. */
819 set_module_locus (module_locus
* m
)
822 module_column
= m
->column
;
823 module_line
= m
->line
;
824 fsetpos (module_fp
, &m
->pos
);
828 /* Get the module's input pointer so that we can restore it later. */
831 get_module_locus (module_locus
* m
)
834 m
->column
= module_column
;
835 m
->line
= module_line
;
836 fgetpos (module_fp
, &m
->pos
);
840 /* Get the next character in the module, updating our reckoning of
848 c
= fgetc (module_fp
);
851 bad_module ("Unexpected EOF");
864 /* Parse a string constant. The delimiter is guaranteed to be a
874 get_module_locus (&start
);
878 /* See how long the string is */
883 bad_module ("Unexpected end of module in string constant");
901 set_module_locus (&start
);
903 atom_string
= p
= gfc_getmem (len
+ 1);
905 for (; len
> 0; len
--)
909 module_char (); /* Guaranteed to be another \' */
913 module_char (); /* Terminating \' */
914 *p
= '\0'; /* C-style string for debug purposes */
918 /* Parse a small integer. */
921 parse_integer (int c
)
929 get_module_locus (&m
);
935 atom_int
= 10 * atom_int
+ c
- '0';
936 if (atom_int
> 99999999)
937 bad_module ("Integer overflow");
940 set_module_locus (&m
);
958 get_module_locus (&m
);
963 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
967 if (++len
> GFC_MAX_SYMBOL_LEN
)
968 bad_module ("Name too long");
973 fseek (module_fp
, -1, SEEK_CUR
);
974 module_column
= m
.column
+ len
- 1;
981 /* Read the next atom in the module's input stream. */
992 while (c
== ' ' || c
== '\n');
1017 return ATOM_INTEGER
;
1075 bad_module ("Bad name");
1082 /* Peek at the next atom on the input. */
1090 get_module_locus (&m
);
1093 if (a
== ATOM_STRING
)
1094 gfc_free (atom_string
);
1096 set_module_locus (&m
);
1101 /* Read the next atom from the input, requiring that it be a
1105 require_atom (atom_type type
)
1111 get_module_locus (&m
);
1119 p
= "Expected name";
1122 p
= "Expected left parenthesis";
1125 p
= "Expected right parenthesis";
1128 p
= "Expected integer";
1131 p
= "Expected string";
1134 gfc_internal_error ("require_atom(): bad atom type required");
1137 set_module_locus (&m
);
1143 /* Given a pointer to an mstring array, require that the current input
1144 be one of the strings in the array. We return the enum value. */
1147 find_enum (const mstring
* m
)
1151 i
= gfc_string2code (m
, atom_name
);
1155 bad_module ("find_enum(): Enum not found");
1161 /**************** Module output subroutines ***************************/
1163 /* Output a character to a module file. */
1166 write_char (char out
)
1169 if (fputc (out
, module_fp
) == EOF
)
1170 gfc_fatal_error ("Error writing modules file: %s", strerror (errno
));
1182 /* Write an atom to a module. The line wrapping isn't perfect, but it
1183 should work most of the time. This isn't that big of a deal, since
1184 the file really isn't meant to be read by people anyway. */
1187 write_atom (atom_type atom
, const void *v
)
1209 i
= *((const int *) v
);
1211 gfc_internal_error ("write_atom(): Writing negative integer");
1213 sprintf (buffer
, "%d", i
);
1218 gfc_internal_error ("write_atom(): Trying to write dab atom");
1224 if (atom
!= ATOM_RPAREN
)
1226 if (module_column
+ len
> 72)
1231 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1236 if (atom
== ATOM_STRING
)
1241 if (atom
== ATOM_STRING
&& *p
== '\'')
1246 if (atom
== ATOM_STRING
)
1254 /***************** Mid-level I/O subroutines *****************/
1256 /* These subroutines let their caller read or write atoms without
1257 caring about which of the two is actually happening. This lets a
1258 subroutine concentrate on the actual format of the data being
1261 static void mio_expr (gfc_expr
**);
1262 static void mio_symbol_ref (gfc_symbol
**);
1263 static void mio_symtree_ref (gfc_symtree
**);
1265 /* Read or write an enumerated value. On writing, we return the input
1266 value for the convenience of callers. We avoid using an integer
1267 pointer because enums are sometimes inside bitfields. */
1270 mio_name (int t
, const mstring
* m
)
1273 if (iomode
== IO_OUTPUT
)
1274 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1277 require_atom (ATOM_NAME
);
1284 /* Specialisation of mio_name. */
1286 #define DECL_MIO_NAME(TYPE) \
1287 static inline TYPE \
1288 MIO_NAME(TYPE) (TYPE t, const mstring * m) \
1290 return (TYPE)mio_name ((int)t, m); \
1292 #define MIO_NAME(TYPE) mio_name_##TYPE
1298 if (iomode
== IO_OUTPUT
)
1299 write_atom (ATOM_LPAREN
, NULL
);
1301 require_atom (ATOM_LPAREN
);
1309 if (iomode
== IO_OUTPUT
)
1310 write_atom (ATOM_RPAREN
, NULL
);
1312 require_atom (ATOM_RPAREN
);
1317 mio_integer (int *ip
)
1320 if (iomode
== IO_OUTPUT
)
1321 write_atom (ATOM_INTEGER
, ip
);
1324 require_atom (ATOM_INTEGER
);
1330 /* Read or write a character pointer that points to a string on the
1334 mio_allocated_string (char **sp
)
1337 if (iomode
== IO_OUTPUT
)
1338 write_atom (ATOM_STRING
, *sp
);
1341 require_atom (ATOM_STRING
);
1347 /* Read or write a string that is in static memory or inside of some
1348 already-allocated structure. */
1351 mio_internal_string (char *string
)
1354 if (iomode
== IO_OUTPUT
)
1355 write_atom (ATOM_STRING
, string
);
1358 require_atom (ATOM_STRING
);
1359 strcpy (string
, atom_string
);
1360 gfc_free (atom_string
);
1367 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1368 AB_POINTER
, AB_SAVE
, AB_TARGET
, AB_DUMMY
, AB_RESULT
,
1369 AB_ENTRY
, AB_DATA
, AB_IN_NAMELIST
, AB_IN_COMMON
,
1370 AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
, AB_ELEMENTAL
, AB_PURE
,
1371 AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
1375 static const mstring attr_bits
[] =
1377 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1378 minit ("DIMENSION", AB_DIMENSION
),
1379 minit ("EXTERNAL", AB_EXTERNAL
),
1380 minit ("INTRINSIC", AB_INTRINSIC
),
1381 minit ("OPTIONAL", AB_OPTIONAL
),
1382 minit ("POINTER", AB_POINTER
),
1383 minit ("SAVE", AB_SAVE
),
1384 minit ("TARGET", AB_TARGET
),
1385 minit ("DUMMY", AB_DUMMY
),
1386 minit ("RESULT", AB_RESULT
),
1387 minit ("ENTRY", AB_ENTRY
),
1388 minit ("DATA", AB_DATA
),
1389 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1390 minit ("IN_COMMON", AB_IN_COMMON
),
1391 minit ("FUNCTION", AB_FUNCTION
),
1392 minit ("SUBROUTINE", AB_SUBROUTINE
),
1393 minit ("SEQUENCE", AB_SEQUENCE
),
1394 minit ("ELEMENTAL", AB_ELEMENTAL
),
1395 minit ("PURE", AB_PURE
),
1396 minit ("RECURSIVE", AB_RECURSIVE
),
1397 minit ("GENERIC", AB_GENERIC
),
1398 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1402 /* Specialisation of mio_name. */
1403 DECL_MIO_NAME(ab_attribute
)
1404 DECL_MIO_NAME(ar_type
)
1405 DECL_MIO_NAME(array_type
)
1407 DECL_MIO_NAME(expr_t
)
1408 DECL_MIO_NAME(gfc_access
)
1409 DECL_MIO_NAME(gfc_intrinsic_op
)
1410 DECL_MIO_NAME(ifsrc
)
1411 DECL_MIO_NAME(procedure_type
)
1412 DECL_MIO_NAME(ref_type
)
1413 DECL_MIO_NAME(sym_flavor
)
1414 DECL_MIO_NAME(sym_intent
)
1415 #undef DECL_MIO_NAME
1417 /* Symbol attributes are stored in list with the first three elements
1418 being the enumerated fields, while the remaining elements (if any)
1419 indicate the individual attribute bits. The access field is not
1420 saved-- it controls what symbols are exported when a module is
1424 mio_symbol_attribute (symbol_attribute
* attr
)
1430 attr
->flavor
= MIO_NAME(sym_flavor
) (attr
->flavor
, flavors
);
1431 attr
->intent
= MIO_NAME(sym_intent
) (attr
->intent
, intents
);
1432 attr
->proc
= MIO_NAME(procedure_type
) (attr
->proc
, procedures
);
1433 attr
->if_source
= MIO_NAME(ifsrc
) (attr
->if_source
, ifsrc_types
);
1435 if (iomode
== IO_OUTPUT
)
1437 if (attr
->allocatable
)
1438 MIO_NAME(ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1439 if (attr
->dimension
)
1440 MIO_NAME(ab_attribute
) (AB_DIMENSION
, attr_bits
);
1442 MIO_NAME(ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1443 if (attr
->intrinsic
)
1444 MIO_NAME(ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1446 MIO_NAME(ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1448 MIO_NAME(ab_attribute
) (AB_POINTER
, attr_bits
);
1450 MIO_NAME(ab_attribute
) (AB_SAVE
, attr_bits
);
1452 MIO_NAME(ab_attribute
) (AB_TARGET
, attr_bits
);
1454 MIO_NAME(ab_attribute
) (AB_DUMMY
, attr_bits
);
1456 MIO_NAME(ab_attribute
) (AB_RESULT
, attr_bits
);
1458 MIO_NAME(ab_attribute
) (AB_ENTRY
, attr_bits
);
1461 MIO_NAME(ab_attribute
) (AB_DATA
, attr_bits
);
1462 if (attr
->in_namelist
)
1463 MIO_NAME(ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1464 if (attr
->in_common
)
1465 MIO_NAME(ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1468 MIO_NAME(ab_attribute
) (AB_FUNCTION
, attr_bits
);
1469 if (attr
->subroutine
)
1470 MIO_NAME(ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1472 MIO_NAME(ab_attribute
) (AB_GENERIC
, attr_bits
);
1475 MIO_NAME(ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1476 if (attr
->elemental
)
1477 MIO_NAME(ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1479 MIO_NAME(ab_attribute
) (AB_PURE
, attr_bits
);
1480 if (attr
->recursive
)
1481 MIO_NAME(ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1482 if (attr
->always_explicit
)
1483 MIO_NAME(ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1494 if (t
== ATOM_RPAREN
)
1497 bad_module ("Expected attribute bit name");
1499 switch ((ab_attribute
) find_enum (attr_bits
))
1501 case AB_ALLOCATABLE
:
1502 attr
->allocatable
= 1;
1505 attr
->dimension
= 1;
1511 attr
->intrinsic
= 1;
1537 case AB_IN_NAMELIST
:
1538 attr
->in_namelist
= 1;
1541 attr
->in_common
= 1;
1547 attr
->subroutine
= 1;
1556 attr
->elemental
= 1;
1562 attr
->recursive
= 1;
1564 case AB_ALWAYS_EXPLICIT
:
1565 attr
->always_explicit
= 1;
1573 static const mstring bt_types
[] = {
1574 minit ("INTEGER", BT_INTEGER
),
1575 minit ("REAL", BT_REAL
),
1576 minit ("COMPLEX", BT_COMPLEX
),
1577 minit ("LOGICAL", BT_LOGICAL
),
1578 minit ("CHARACTER", BT_CHARACTER
),
1579 minit ("DERIVED", BT_DERIVED
),
1580 minit ("PROCEDURE", BT_PROCEDURE
),
1581 minit ("UNKNOWN", BT_UNKNOWN
),
1587 mio_charlen (gfc_charlen
** clp
)
1593 if (iomode
== IO_OUTPUT
)
1597 mio_expr (&cl
->length
);
1602 if (peek_atom () != ATOM_RPAREN
)
1604 cl
= gfc_get_charlen ();
1605 mio_expr (&cl
->length
);
1609 cl
->next
= gfc_current_ns
->cl_list
;
1610 gfc_current_ns
->cl_list
= cl
;
1618 /* Return a symtree node with a name that is guaranteed to be unique
1619 within the namespace and corresponds to an illegal fortran name. */
1621 static gfc_symtree
*
1622 get_unique_symtree (gfc_namespace
* ns
)
1624 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
1625 static int serial
= 0;
1627 sprintf (name
, "@%d", serial
++);
1628 return gfc_new_symtree (&ns
->sym_root
, name
);
1632 /* See if a name is a generated name. */
1635 check_unique_name (const char *name
)
1638 return *name
== '@';
1643 mio_typespec (gfc_typespec
* ts
)
1648 ts
->type
= MIO_NAME(bt
) (ts
->type
, bt_types
);
1650 if (ts
->type
!= BT_DERIVED
)
1651 mio_integer (&ts
->kind
);
1653 mio_symbol_ref (&ts
->derived
);
1655 mio_charlen (&ts
->cl
);
1661 static const mstring array_spec_types
[] = {
1662 minit ("EXPLICIT", AS_EXPLICIT
),
1663 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
1664 minit ("DEFERRED", AS_DEFERRED
),
1665 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
1671 mio_array_spec (gfc_array_spec
** asp
)
1678 if (iomode
== IO_OUTPUT
)
1686 if (peek_atom () == ATOM_RPAREN
)
1692 *asp
= as
= gfc_get_array_spec ();
1695 mio_integer (&as
->rank
);
1696 as
->type
= MIO_NAME(array_type
) (as
->type
, array_spec_types
);
1698 for (i
= 0; i
< as
->rank
; i
++)
1700 mio_expr (&as
->lower
[i
]);
1701 mio_expr (&as
->upper
[i
]);
1709 /* Given a pointer to an array reference structure (which lives in a
1710 gfc_ref structure), find the corresponding array specification
1711 structure. Storing the pointer in the ref structure doesn't quite
1712 work when loading from a module. Generating code for an array
1713 reference also needs more infomation than just the array spec. */
1715 static const mstring array_ref_types
[] = {
1716 minit ("FULL", AR_FULL
),
1717 minit ("ELEMENT", AR_ELEMENT
),
1718 minit ("SECTION", AR_SECTION
),
1723 mio_array_ref (gfc_array_ref
* ar
)
1728 ar
->type
= MIO_NAME(ar_type
) (ar
->type
, array_ref_types
);
1729 mio_integer (&ar
->dimen
);
1737 for (i
= 0; i
< ar
->dimen
; i
++)
1738 mio_expr (&ar
->start
[i
]);
1743 for (i
= 0; i
< ar
->dimen
; i
++)
1745 mio_expr (&ar
->start
[i
]);
1746 mio_expr (&ar
->end
[i
]);
1747 mio_expr (&ar
->stride
[i
]);
1753 gfc_internal_error ("mio_array_ref(): Unknown array ref");
1756 for (i
= 0; i
< ar
->dimen
; i
++)
1757 mio_integer ((int *) &ar
->dimen_type
[i
]);
1759 if (iomode
== IO_INPUT
)
1761 ar
->where
= gfc_current_locus
;
1763 for (i
= 0; i
< ar
->dimen
; i
++)
1764 ar
->c_where
[i
] = gfc_current_locus
;
1771 /* Saves or restores a pointer. The pointer is converted back and
1772 forth from an integer. We return the pointer_info pointer so that
1773 the caller can take additional action based on the pointer type. */
1775 static pointer_info
*
1776 mio_pointer_ref (void *gp
)
1780 if (iomode
== IO_OUTPUT
)
1782 p
= get_pointer (*((char **) gp
));
1783 write_atom (ATOM_INTEGER
, &p
->integer
);
1787 require_atom (ATOM_INTEGER
);
1788 p
= add_fixup (atom_int
, gp
);
1795 /* Save and load references to components that occur within
1796 expressions. We have to describe these references by a number and
1797 by name. The number is necessary for forward references during
1798 reading, and the name is necessary if the symbol already exists in
1799 the namespace and is not loaded again. */
1802 mio_component_ref (gfc_component
** cp
, gfc_symbol
* sym
)
1804 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
1808 p
= mio_pointer_ref (cp
);
1809 if (p
->type
== P_UNKNOWN
)
1810 p
->type
= P_COMPONENT
;
1812 if (iomode
== IO_OUTPUT
)
1813 mio_internal_string ((*cp
)->name
);
1816 mio_internal_string (name
);
1818 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
1820 /* Symbol already loaded, so search by name. */
1821 for (q
= sym
->components
; q
; q
= q
->next
)
1822 if (strcmp (q
->name
, name
) == 0)
1826 gfc_internal_error ("mio_component_ref(): Component not found");
1828 associate_integer_pointer (p
, q
);
1831 /* Make sure this symbol will eventually be loaded. */
1832 p
= find_pointer2 (sym
);
1833 if (p
->u
.rsym
.state
== UNUSED
)
1834 p
->u
.rsym
.state
= NEEDED
;
1840 mio_component (gfc_component
* c
)
1847 if (iomode
== IO_OUTPUT
)
1849 p
= get_pointer (c
);
1850 mio_integer (&p
->integer
);
1855 p
= get_integer (n
);
1856 associate_integer_pointer (p
, c
);
1859 if (p
->type
== P_UNKNOWN
)
1860 p
->type
= P_COMPONENT
;
1862 mio_internal_string (c
->name
);
1863 mio_typespec (&c
->ts
);
1864 mio_array_spec (&c
->as
);
1866 mio_integer (&c
->dimension
);
1867 mio_integer (&c
->pointer
);
1869 mio_expr (&c
->initializer
);
1875 mio_component_list (gfc_component
** cp
)
1877 gfc_component
*c
, *tail
;
1881 if (iomode
== IO_OUTPUT
)
1883 for (c
= *cp
; c
; c
= c
->next
)
1894 if (peek_atom () == ATOM_RPAREN
)
1897 c
= gfc_get_component ();
1914 mio_actual_arg (gfc_actual_arglist
* a
)
1918 mio_internal_string (a
->name
);
1919 mio_expr (&a
->expr
);
1925 mio_actual_arglist (gfc_actual_arglist
** ap
)
1927 gfc_actual_arglist
*a
, *tail
;
1931 if (iomode
== IO_OUTPUT
)
1933 for (a
= *ap
; a
; a
= a
->next
)
1943 if (peek_atom () != ATOM_LPAREN
)
1946 a
= gfc_get_actual_arglist ();
1962 /* Read and write formal argument lists. */
1965 mio_formal_arglist (gfc_symbol
* sym
)
1967 gfc_formal_arglist
*f
, *tail
;
1971 if (iomode
== IO_OUTPUT
)
1973 for (f
= sym
->formal
; f
; f
= f
->next
)
1974 mio_symbol_ref (&f
->sym
);
1979 sym
->formal
= tail
= NULL
;
1981 while (peek_atom () != ATOM_RPAREN
)
1983 f
= gfc_get_formal_arglist ();
1984 mio_symbol_ref (&f
->sym
);
1986 if (sym
->formal
== NULL
)
1999 /* Save or restore a reference to a symbol node. */
2002 mio_symbol_ref (gfc_symbol
** symp
)
2006 p
= mio_pointer_ref (symp
);
2007 if (p
->type
== P_UNKNOWN
)
2010 if (iomode
== IO_OUTPUT
)
2012 if (p
->u
.wsym
.state
== UNREFERENCED
)
2013 p
->u
.wsym
.state
= NEEDS_WRITE
;
2017 if (p
->u
.rsym
.state
== UNUSED
)
2018 p
->u
.rsym
.state
= NEEDED
;
2023 /* Save or restore a reference to a symtree node. */
2026 mio_symtree_ref (gfc_symtree
** stp
)
2031 if (iomode
== IO_OUTPUT
)
2033 mio_symbol_ref (&(*stp
)->n
.sym
);
2037 require_atom (ATOM_INTEGER
);
2038 p
= get_integer (atom_int
);
2039 if (p
->type
== P_UNKNOWN
)
2042 if (p
->u
.rsym
.state
== UNUSED
)
2043 p
->u
.rsym
.state
= NEEDED
;
2045 if (p
->u
.rsym
.symtree
!= NULL
)
2047 *stp
= p
->u
.rsym
.symtree
;
2051 f
= gfc_getmem (sizeof (fixup_t
));
2053 f
->next
= p
->u
.rsym
.stfixup
;
2054 p
->u
.rsym
.stfixup
= f
;
2056 f
->pointer
= (void **)stp
;
2062 mio_iterator (gfc_iterator
** ip
)
2068 if (iomode
== IO_OUTPUT
)
2075 if (peek_atom () == ATOM_RPAREN
)
2081 *ip
= gfc_get_iterator ();
2086 mio_expr (&iter
->var
);
2087 mio_expr (&iter
->start
);
2088 mio_expr (&iter
->end
);
2089 mio_expr (&iter
->step
);
2098 mio_constructor (gfc_constructor
** cp
)
2100 gfc_constructor
*c
, *tail
;
2104 if (iomode
== IO_OUTPUT
)
2106 for (c
= *cp
; c
; c
= c
->next
)
2109 mio_expr (&c
->expr
);
2110 mio_iterator (&c
->iterator
);
2120 while (peek_atom () != ATOM_RPAREN
)
2122 c
= gfc_get_constructor ();
2132 mio_expr (&c
->expr
);
2133 mio_iterator (&c
->iterator
);
2143 static const mstring ref_types
[] = {
2144 minit ("ARRAY", REF_ARRAY
),
2145 minit ("COMPONENT", REF_COMPONENT
),
2146 minit ("SUBSTRING", REF_SUBSTRING
),
2152 mio_ref (gfc_ref
** rp
)
2159 r
->type
= MIO_NAME(ref_type
) (r
->type
, ref_types
);
2164 mio_array_ref (&r
->u
.ar
);
2168 mio_symbol_ref (&r
->u
.c
.sym
);
2169 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2173 mio_expr (&r
->u
.ss
.start
);
2174 mio_expr (&r
->u
.ss
.end
);
2175 mio_charlen (&r
->u
.ss
.length
);
2184 mio_ref_list (gfc_ref
** rp
)
2186 gfc_ref
*ref
, *head
, *tail
;
2190 if (iomode
== IO_OUTPUT
)
2192 for (ref
= *rp
; ref
; ref
= ref
->next
)
2199 while (peek_atom () != ATOM_RPAREN
)
2202 head
= tail
= gfc_get_ref ();
2205 tail
->next
= gfc_get_ref ();
2219 /* Read and write an integer value. */
2222 mio_gmp_integer (mpz_t
* integer
)
2226 if (iomode
== IO_INPUT
)
2228 if (parse_atom () != ATOM_STRING
)
2229 bad_module ("Expected integer string");
2231 mpz_init (*integer
);
2232 if (mpz_set_str (*integer
, atom_string
, 10))
2233 bad_module ("Error converting integer");
2235 gfc_free (atom_string
);
2240 p
= mpz_get_str (NULL
, 10, *integer
);
2241 write_atom (ATOM_STRING
, p
);
2248 mio_gmp_real (mpf_t
* real
)
2253 if (iomode
== IO_INPUT
)
2255 if (parse_atom () != ATOM_STRING
)
2256 bad_module ("Expected real string");
2259 mpf_set_str (*real
, atom_string
, -16);
2260 gfc_free (atom_string
);
2265 p
= mpf_get_str (NULL
, &exponent
, 16, 0, *real
);
2266 atom_string
= gfc_getmem (strlen (p
) + 20);
2268 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2270 /* Fix negative numbers. */
2271 if (atom_string
[2] == '-')
2273 atom_string
[0] = '-';
2274 atom_string
[1] = '0';
2275 atom_string
[2] = '.';
2278 write_atom (ATOM_STRING
, atom_string
);
2280 gfc_free (atom_string
);
2286 /* Save and restore the shape of an array constructor. */
2289 mio_shape (mpz_t
** pshape
, int rank
)
2295 /* A NULL shape is represented by (). */
2298 if (iomode
== IO_OUTPUT
)
2310 if (t
== ATOM_RPAREN
)
2317 shape
= gfc_get_shape (rank
);
2321 for (n
= 0; n
< rank
; n
++)
2322 mio_gmp_integer (&shape
[n
]);
2328 static const mstring expr_types
[] = {
2329 minit ("OP", EXPR_OP
),
2330 minit ("FUNCTION", EXPR_FUNCTION
),
2331 minit ("CONSTANT", EXPR_CONSTANT
),
2332 minit ("VARIABLE", EXPR_VARIABLE
),
2333 minit ("SUBSTRING", EXPR_SUBSTRING
),
2334 minit ("STRUCTURE", EXPR_STRUCTURE
),
2335 minit ("ARRAY", EXPR_ARRAY
),
2336 minit ("NULL", EXPR_NULL
),
2340 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2341 generic operators, not in expressions. INTRINSIC_USER is also
2342 replaced by the correct function name by the time we see it. */
2344 static const mstring intrinsics
[] =
2346 minit ("UPLUS", INTRINSIC_UPLUS
),
2347 minit ("UMINUS", INTRINSIC_UMINUS
),
2348 minit ("PLUS", INTRINSIC_PLUS
),
2349 minit ("MINUS", INTRINSIC_MINUS
),
2350 minit ("TIMES", INTRINSIC_TIMES
),
2351 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2352 minit ("POWER", INTRINSIC_POWER
),
2353 minit ("CONCAT", INTRINSIC_CONCAT
),
2354 minit ("AND", INTRINSIC_AND
),
2355 minit ("OR", INTRINSIC_OR
),
2356 minit ("EQV", INTRINSIC_EQV
),
2357 minit ("NEQV", INTRINSIC_NEQV
),
2358 minit ("EQ", INTRINSIC_EQ
),
2359 minit ("NE", INTRINSIC_NE
),
2360 minit ("GT", INTRINSIC_GT
),
2361 minit ("GE", INTRINSIC_GE
),
2362 minit ("LT", INTRINSIC_LT
),
2363 minit ("LE", INTRINSIC_LE
),
2364 minit ("NOT", INTRINSIC_NOT
),
2368 /* Read and write expressions. The form "()" is allowed to indicate a
2372 mio_expr (gfc_expr
** ep
)
2380 if (iomode
== IO_OUTPUT
)
2389 MIO_NAME(expr_t
) (e
->expr_type
, expr_types
);
2395 if (t
== ATOM_RPAREN
)
2402 bad_module ("Expected expression type");
2404 e
= *ep
= gfc_get_expr ();
2405 e
->where
= gfc_current_locus
;
2406 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2409 mio_typespec (&e
->ts
);
2410 mio_integer (&e
->rank
);
2412 switch (e
->expr_type
)
2415 e
->operator = MIO_NAME(gfc_intrinsic_op
) (e
->operator, intrinsics
);
2417 switch (e
->operator)
2419 case INTRINSIC_UPLUS
:
2420 case INTRINSIC_UMINUS
:
2425 case INTRINSIC_PLUS
:
2426 case INTRINSIC_MINUS
:
2427 case INTRINSIC_TIMES
:
2428 case INTRINSIC_DIVIDE
:
2429 case INTRINSIC_POWER
:
2430 case INTRINSIC_CONCAT
:
2434 case INTRINSIC_NEQV
:
2446 bad_module ("Bad operator");
2452 mio_symtree_ref (&e
->symtree
);
2453 mio_actual_arglist (&e
->value
.function
.actual
);
2455 if (iomode
== IO_OUTPUT
)
2457 mio_allocated_string (&e
->value
.function
.name
);
2458 flag
= e
->value
.function
.esym
!= NULL
;
2459 mio_integer (&flag
);
2461 mio_symbol_ref (&e
->value
.function
.esym
);
2463 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
2468 require_atom (ATOM_STRING
);
2469 e
->value
.function
.name
= gfc_get_string (atom_string
);
2470 gfc_free (atom_string
);
2472 mio_integer (&flag
);
2474 mio_symbol_ref (&e
->value
.function
.esym
);
2477 require_atom (ATOM_STRING
);
2478 e
->value
.function
.isym
= gfc_find_function (atom_string
);
2479 gfc_free (atom_string
);
2486 mio_symtree_ref (&e
->symtree
);
2487 mio_ref_list (&e
->ref
);
2490 case EXPR_SUBSTRING
:
2491 mio_allocated_string (&e
->value
.character
.string
);
2496 case EXPR_STRUCTURE
:
2498 mio_constructor (&e
->value
.constructor
);
2499 mio_shape (&e
->shape
, e
->rank
);
2506 mio_gmp_integer (&e
->value
.integer
);
2510 mio_gmp_real (&e
->value
.real
);
2514 mio_gmp_real (&e
->value
.complex.r
);
2515 mio_gmp_real (&e
->value
.complex.i
);
2519 mio_integer (&e
->value
.logical
);
2523 mio_integer (&e
->value
.character
.length
);
2524 mio_allocated_string (&e
->value
.character
.string
);
2528 bad_module ("Bad type in constant expression");
2541 /* Save/restore lists of gfc_interface stuctures. When loading an
2542 interface, we are really appending to the existing list of
2543 interfaces. Checking for duplicate and ambiguous interfaces has to
2544 be done later when all symbols have been loaded. */
2547 mio_interface_rest (gfc_interface
** ip
)
2549 gfc_interface
*tail
, *p
;
2551 if (iomode
== IO_OUTPUT
)
2554 for (p
= *ip
; p
; p
= p
->next
)
2555 mio_symbol_ref (&p
->sym
);
2571 if (peek_atom () == ATOM_RPAREN
)
2574 p
= gfc_get_interface ();
2575 mio_symbol_ref (&p
->sym
);
2590 /* Save/restore a nameless operator interface. */
2593 mio_interface (gfc_interface
** ip
)
2597 mio_interface_rest (ip
);
2601 /* Save/restore a named operator interface. */
2604 mio_symbol_interface (char *name
, char *module
,
2605 gfc_interface
** ip
)
2610 mio_internal_string (name
);
2611 mio_internal_string (module
);
2613 mio_interface_rest (ip
);
2618 mio_namespace_ref (gfc_namespace
** nsp
)
2623 p
= mio_pointer_ref (nsp
);
2625 if (p
->type
== P_UNKNOWN
)
2626 p
->type
= P_NAMESPACE
;
2628 if (iomode
== IO_INPUT
&& p
->integer
!= 0 && p
->u
.pointer
== NULL
)
2630 ns
= gfc_get_namespace (NULL
);
2631 associate_integer_pointer (p
, ns
);
2636 /* Unlike most other routines, the address of the symbol node is
2637 already fixed on input and the name/module has already been filled
2641 mio_symbol (gfc_symbol
* sym
)
2643 gfc_formal_arglist
*formal
;
2647 mio_symbol_attribute (&sym
->attr
);
2648 mio_typespec (&sym
->ts
);
2650 /* Contained procedures don't have formal namespaces. Instead we output the
2651 procedure namespace. The will contain the formal arguments. */
2652 if (iomode
== IO_OUTPUT
)
2654 formal
= sym
->formal
;
2655 while (formal
&& !formal
->sym
)
2656 formal
= formal
->next
;
2659 mio_namespace_ref (&formal
->sym
->ns
);
2661 mio_namespace_ref (&sym
->formal_ns
);
2665 mio_namespace_ref (&sym
->formal_ns
);
2668 sym
->formal_ns
->proc_name
= sym
;
2673 /* Save/restore common block links */
2674 mio_symbol_ref (&sym
->common_next
);
2676 mio_formal_arglist (sym
);
2678 mio_expr (&sym
->value
);
2679 mio_array_spec (&sym
->as
);
2681 mio_symbol_ref (&sym
->result
);
2683 /* Note that components are always saved, even if they are supposed
2684 to be private. Component access is checked during searching. */
2686 mio_component_list (&sym
->components
);
2688 if (sym
->components
!= NULL
)
2689 sym
->component_access
=
2690 MIO_NAME(gfc_access
) (sym
->component_access
, access_types
);
2696 /************************* Top level subroutines *************************/
2698 /* Skip a list between balanced left and right parens. */
2708 switch (parse_atom ())
2719 gfc_free (atom_string
);
2731 /* Load operator interfaces from the module. Interfaces are unusual
2732 in that they attach themselves to existing symbols. */
2735 load_operator_interfaces (void)
2738 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
2743 while (peek_atom () != ATOM_RPAREN
)
2747 mio_internal_string (name
);
2748 mio_internal_string (module
);
2750 /* Decide if we need to load this one or not. */
2751 p
= find_use_name (name
);
2754 while (parse_atom () != ATOM_RPAREN
);
2758 uop
= gfc_get_uop (p
);
2759 mio_interface_rest (&uop
->operator);
2767 /* Load interfaces from the module. Interfaces are unusual in that
2768 they attach themselves to existing symbols. */
2771 load_generic_interfaces (void)
2774 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
2779 while (peek_atom () != ATOM_RPAREN
)
2783 mio_internal_string (name
);
2784 mio_internal_string (module
);
2786 /* Decide if we need to load this one or not. */
2787 p
= find_use_name (name
);
2789 if (p
== NULL
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
2791 while (parse_atom () != ATOM_RPAREN
);
2797 gfc_get_symbol (p
, NULL
, &sym
);
2799 sym
->attr
.flavor
= FL_PROCEDURE
;
2800 sym
->attr
.generic
= 1;
2801 sym
->attr
.use_assoc
= 1;
2804 mio_interface_rest (&sym
->generic
);
2811 /* Load common blocks. */
2816 char name
[GFC_MAX_SYMBOL_LEN
+1];
2821 while (peek_atom () != ATOM_RPAREN
)
2824 mio_internal_string (name
);
2826 p
= gfc_get_common (name
);
2828 mio_symbol_ref (&p
->head
);
2829 mio_integer (&p
->saved
);
2839 /* Recursive function to traverse the pointer_info tree and load a
2840 needed symbol. We return nonzero if we load a symbol and stop the
2841 traversal, because the act of loading can alter the tree. */
2844 load_needed (pointer_info
* p
)
2852 if (load_needed (p
->left
))
2854 if (load_needed (p
->right
))
2857 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
2860 p
->u
.rsym
.state
= USED
;
2862 set_module_locus (&p
->u
.rsym
.where
);
2864 sym
= p
->u
.rsym
.sym
;
2867 q
= get_integer (p
->u
.rsym
.ns
);
2869 ns
= (gfc_namespace
*) q
->u
.pointer
;
2872 /* Create an interface namespace if necessary. These are
2873 the namespaces that hold the formal parameters of module
2876 ns
= gfc_get_namespace (NULL
);
2877 associate_integer_pointer (q
, ns
);
2880 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
2881 strcpy (sym
->module
, p
->u
.rsym
.module
);
2883 associate_integer_pointer (p
, sym
);
2887 sym
->attr
.use_assoc
= 1;
2893 /* Recursive function for cleaning up things after a module has been
2897 read_cleanup (pointer_info
* p
)
2905 read_cleanup (p
->left
);
2906 read_cleanup (p
->right
);
2908 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
2910 /* Add hidden symbols to the symtree. */
2911 q
= get_integer (p
->u
.rsym
.ns
);
2912 st
= get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
2914 st
->n
.sym
= p
->u
.rsym
.sym
;
2917 /* Fixup any symtree references. */
2918 p
->u
.rsym
.symtree
= st
;
2919 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
2920 p
->u
.rsym
.stfixup
= NULL
;
2923 /* Free unused symbols. */
2924 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
2925 gfc_free_symbol (p
->u
.rsym
.sym
);
2929 /* Read a module file. */
2934 module_locus operator_interfaces
, user_operators
;
2936 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2938 int ambiguous
, symbol
;
2944 get_module_locus (&operator_interfaces
); /* Skip these for now */
2947 get_module_locus (&user_operators
);
2954 /* Create the fixup nodes for all the symbols. */
2956 while (peek_atom () != ATOM_RPAREN
)
2958 require_atom (ATOM_INTEGER
);
2959 info
= get_integer (atom_int
);
2961 info
->type
= P_SYMBOL
;
2962 info
->u
.rsym
.state
= UNUSED
;
2964 mio_internal_string (info
->u
.rsym
.true_name
);
2965 mio_internal_string (info
->u
.rsym
.module
);
2967 require_atom (ATOM_INTEGER
);
2968 info
->u
.rsym
.ns
= atom_int
;
2970 get_module_locus (&info
->u
.rsym
.where
);
2973 /* See if the symbol has already been loaded by a previous module.
2974 If so, we reference the existing symbol and prevent it from
2975 being loaded again. */
2977 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
2981 info
->u
.rsym
.state
= USED
;
2982 info
->u
.rsym
.referenced
= 1;
2983 info
->u
.rsym
.sym
= sym
;
2988 /* Parse the symtree lists. This lets us mark which symbols need to
2989 be loaded. Renaming is also done at this point by replacing the
2994 while (peek_atom () != ATOM_RPAREN
)
2996 mio_internal_string (name
);
2997 mio_integer (&ambiguous
);
2998 mio_integer (&symbol
);
3000 info
= get_integer (symbol
);
3002 /* Get the local name for this symbol. */
3003 p
= find_use_name (name
);
3005 /* Skip symtree nodes not in an ONLY caluse. */
3009 /* Check for ambiguous symbols. */
3010 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3014 if (st
->n
.sym
!= info
->u
.rsym
.sym
)
3016 info
->u
.rsym
.symtree
= st
;
3020 /* Create a symtree node in the current namespace for this symbol. */
3021 st
= check_unique_name (p
) ? get_unique_symtree (gfc_current_ns
) :
3022 gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3024 st
->ambiguous
= ambiguous
;
3026 sym
= info
->u
.rsym
.sym
;
3028 /* Create a symbol node if it doesn't already exist. */
3031 sym
= info
->u
.rsym
.sym
=
3032 gfc_new_symbol (info
->u
.rsym
.true_name
, gfc_current_ns
);
3034 strcpy (sym
->module
, info
->u
.rsym
.module
);
3040 /* Store the symtree pointing to this symbol. */
3041 info
->u
.rsym
.symtree
= st
;
3043 if (info
->u
.rsym
.state
== UNUSED
)
3044 info
->u
.rsym
.state
= NEEDED
;
3045 info
->u
.rsym
.referenced
= 1;
3051 /* Load intrinsic operator interfaces. */
3052 set_module_locus (&operator_interfaces
);
3055 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3057 if (i
== INTRINSIC_USER
)
3062 u
= find_use_operator (i
);
3073 mio_interface (&gfc_current_ns
->operator[i
]);
3078 /* Load generic and user operator interfaces. These must follow the
3079 loading of symtree because otherwise symbols can be marked as
3082 set_module_locus (&user_operators
);
3084 load_operator_interfaces ();
3085 load_generic_interfaces ();
3089 /* At this point, we read those symbols that are needed but haven't
3090 been loaded yet. If one symbol requires another, the other gets
3091 marked as NEEDED if its previous state was UNUSED. */
3093 while (load_needed (pi_root
));
3095 /* Make sure all elements of the rename-list were found in the
3098 for (u
= gfc_rename_list
; u
; u
= u
->next
)
3103 if (u
->operator == INTRINSIC_NONE
)
3105 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3106 u
->use_name
, &u
->where
, module_name
);
3110 if (u
->operator == INTRINSIC_USER
)
3113 ("User operator '%s' referenced at %L not found in module '%s'",
3114 u
->use_name
, &u
->where
, module_name
);
3119 ("Intrinsic operator '%s' referenced at %L not found in module "
3120 "'%s'", gfc_op2string (u
->operator), &u
->where
, module_name
);
3123 gfc_check_interfaces (gfc_current_ns
);
3125 /* Clean up symbol nodes that were never loaded, create references
3126 to hidden symbols. */
3128 read_cleanup (pi_root
);
3132 /* Given an access type that is specific to an entity and the default
3133 access, return nonzero if we should write the entity. */
3136 check_access (gfc_access specific_access
, gfc_access default_access
)
3139 if (specific_access
== ACCESS_PUBLIC
)
3141 if (specific_access
== ACCESS_PRIVATE
)
3144 if (gfc_option
.flag_module_access_private
)
3146 if (default_access
== ACCESS_PUBLIC
)
3151 if (default_access
!= ACCESS_PRIVATE
)
3159 /* Write a common block to the module */
3162 write_common (gfc_symtree
*st
)
3169 write_common(st
->left
);
3170 write_common(st
->right
);
3173 mio_internal_string(st
->name
);
3176 mio_symbol_ref(&p
->head
);
3177 mio_integer(&p
->saved
);
3183 /* Write a symbol to the module. */
3186 write_symbol (int n
, gfc_symbol
* sym
)
3189 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
3190 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
3193 if (sym
->attr
.flavor
== FL_VARIABLE
&& sym
->ts
.type
== BT_UNKNOWN
)
3194 /* TODO: this is a workaround for some of the problems in PR15481,
3195 and fixes the dependent bug PR13372. In an ideal frontend, this
3196 should never happen. */
3200 mio_internal_string (sym
->name
);
3202 if (sym
->module
[0] == '\0')
3203 strcpy (sym
->module
, module_name
);
3205 mio_internal_string (sym
->module
);
3206 mio_pointer_ref (&sym
->ns
);
3213 /* Recursive traversal function to write the initial set of symbols to
3214 the module. We check to see if the symbol should be written
3215 according to the access specification. */
3218 write_symbol0 (gfc_symtree
* st
)
3226 write_symbol0 (st
->left
);
3227 write_symbol0 (st
->right
);
3231 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
3232 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
3235 if (!check_access (sym
->attr
.access
, sym
->ns
->default_access
))
3238 p
= get_pointer (sym
);
3239 if (p
->type
== P_UNKNOWN
)
3242 if (p
->u
.wsym
.state
== WRITTEN
)
3245 write_symbol (p
->integer
, sym
);
3246 p
->u
.wsym
.state
= WRITTEN
;
3252 /* Recursive traversal function to write the secondary set of symbols
3253 to the module file. These are symbols that were not public yet are
3254 needed by the public symbols or another dependent symbol. The act
3255 of writing a symbol can modify the pointer_info tree, so we cease
3256 traversal if we find a symbol to write. We return nonzero if a
3257 symbol was written and pass that information upwards. */
3260 write_symbol1 (pointer_info
* p
)
3266 if (write_symbol1 (p
->left
))
3268 if (write_symbol1 (p
->right
))
3271 if (p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
)
3274 p
->u
.wsym
.state
= WRITTEN
;
3275 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
3281 /* Write operator interfaces associated with a symbol. */
3284 write_operator (gfc_user_op
* uop
)
3286 static char nullstring
[] = "";
3288 if (uop
->operator == NULL
3289 || !check_access (uop
->access
, uop
->ns
->default_access
))
3292 mio_symbol_interface (uop
->name
, nullstring
, &uop
->operator);
3296 /* Write generic interfaces associated with a symbol. */
3299 write_generic (gfc_symbol
* sym
)
3302 if (sym
->generic
== NULL
3303 || !check_access (sym
->attr
.access
, sym
->ns
->default_access
))
3306 mio_symbol_interface (sym
->name
, sym
->module
, &sym
->generic
);
3311 write_symtree (gfc_symtree
* st
)
3317 if (!check_access (sym
->attr
.access
, sym
->ns
->default_access
)
3318 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
3319 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
3322 if (sym
->attr
.flavor
== FL_VARIABLE
&& sym
->ts
.type
== BT_UNKNOWN
)
3323 /* TODO: this is a workaround for some of the problems in PR15481,
3324 and fixes the dependent bug PR13372. In an ideal frontend, this
3325 should never happen. */
3328 if (check_unique_name (st
->name
))
3331 p
= find_pointer (sym
);
3333 gfc_internal_error ("write_symtree(): Symbol not written");
3335 mio_internal_string (st
->name
);
3336 mio_integer (&st
->ambiguous
);
3337 mio_integer (&p
->integer
);
3346 /* Write the operator interfaces. */
3349 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3351 if (i
== INTRINSIC_USER
)
3354 mio_interface (check_access (gfc_current_ns
->operator_access
[i
],
3355 gfc_current_ns
->default_access
)
3356 ? &gfc_current_ns
->operator[i
] : NULL
);
3364 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
3370 gfc_traverse_ns (gfc_current_ns
, write_generic
);
3376 write_common (gfc_current_ns
->common_root
);
3381 /* Write symbol information. First we traverse all symbols in the
3382 primary namespace, writing those that need to be written.
3383 Sometimes writing one symbol will cause another to need to be
3384 written. A list of these symbols ends up on the write stack, and
3385 we end by popping the bottom of the stack and writing the symbol
3386 until the stack is empty. */
3390 write_symbol0 (gfc_current_ns
->sym_root
);
3391 while (write_symbol1 (pi_root
));
3399 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
3404 /* Given module, dump it to disk. If there was an error while
3405 processing the module, dump_flag will be set to zero and we delete
3406 the module file, even if it was already there. */
3409 gfc_dump_module (const char *name
, int dump_flag
)
3411 char filename
[PATH_MAX
], *p
;
3415 if (gfc_option
.module_dir
!= NULL
)
3416 strcpy (filename
, gfc_option
.module_dir
);
3418 strcat (filename
, name
);
3419 strcat (filename
, MODULE_EXTENSION
);
3427 module_fp
= fopen (filename
, "w");
3428 if (module_fp
== NULL
)
3429 gfc_fatal_error ("Can't open module file '%s' for writing: %s",
3430 filename
, strerror (errno
));
3435 *strchr (p
, '\n') = '\0';
3437 fprintf (module_fp
, "GFORTRAN module created from %s on %s\n",
3438 gfc_source_file
, p
);
3439 fputs ("If you edit this, you'll get what you deserve.\n\n", module_fp
);
3442 strcpy (module_name
, name
);
3448 free_pi_tree (pi_root
);
3453 if (fclose (module_fp
))
3454 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
3455 filename
, strerror (errno
));
3459 /* Process a USE directive. */
3462 gfc_use_module (void)
3464 char filename
[GFC_MAX_SYMBOL_LEN
+ 5];
3468 strcpy (filename
, module_name
);
3469 strcat (filename
, MODULE_EXTENSION
);
3471 module_fp
= gfc_open_included_file (filename
);
3472 if (module_fp
== NULL
)
3473 gfc_fatal_error ("Can't open module file '%s' for reading: %s",
3474 filename
, strerror (errno
));
3480 /* Skip the first two lines of the module. */
3481 /* FIXME: Could also check for valid two lines here, instead. */
3487 bad_module ("Unexpected end of module");
3492 /* Make sure we're not reading the same module that we may be building. */
3493 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
3494 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
3495 gfc_fatal_error ("Can't USE the same module we're building!");
3498 init_true_name_tree ();
3502 free_true_name (true_name_root
);
3503 true_name_root
= NULL
;
3505 free_pi_tree (pi_root
);
3513 gfc_module_init_2 (void)
3516 last_atom
= ATOM_LPAREN
;
3521 gfc_module_done_2 (void)