1 /* Handle modules, which amounts to loading and saving symbols and
2 their attendant structures.
3 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005 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 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>)
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
71 #include "parse.h" /* FIXME */
73 #define MODULE_EXTENSION ".mod"
76 /* Structure that describes a position within a module file. */
88 P_UNKNOWN
= 0, P_OTHER
, P_NAMESPACE
, P_COMPONENT
, P_SYMBOL
92 /* The fixup structure lists pointers to pointers that have to
93 be updated when a pointer value becomes known. */
95 typedef struct fixup_t
103 /* Structure for holding extra info needed for pointers being read. */
105 typedef struct pointer_info
107 BBT_HEADER (pointer_info
);
111 /* The first component of each member of the union is the pointer
118 void *pointer
; /* Member for doing pointer searches. */
123 char true_name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
125 { UNUSED
, NEEDED
, USED
}
130 gfc_symtree
*symtree
;
138 { UNREFERENCED
= 0, NEEDS_WRITE
, WRITTEN
}
148 #define gfc_get_pointer_info() gfc_getmem(sizeof(pointer_info))
151 /* Lists of rename info for the USE statement. */
153 typedef struct gfc_use_rename
155 char local_name
[GFC_MAX_SYMBOL_LEN
+ 1], use_name
[GFC_MAX_SYMBOL_LEN
+ 1];
156 struct gfc_use_rename
*next
;
158 gfc_intrinsic_op
operator;
163 #define gfc_get_use_rename() gfc_getmem(sizeof(gfc_use_rename))
165 /* Local variables */
167 /* The FILE for the module we're reading or writing. */
168 static FILE *module_fp
;
170 /* The name of the module we're reading (USE'ing) or writing. */
171 static char module_name
[GFC_MAX_SYMBOL_LEN
+ 1];
173 static int module_line
, module_column
, only_flag
;
175 { IO_INPUT
, IO_OUTPUT
}
178 static gfc_use_rename
*gfc_rename_list
;
179 static pointer_info
*pi_root
;
180 static int symbol_number
; /* Counter for assigning symbol numbers */
184 /*****************************************************************/
186 /* Pointer/integer conversion. Pointers between structures are stored
187 as integers in the module file. The next couple of subroutines
188 handle this translation for reading and writing. */
190 /* Recursively free the tree of pointer structures. */
193 free_pi_tree (pointer_info
* p
)
198 if (p
->fixup
!= NULL
)
199 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
201 free_pi_tree (p
->left
);
202 free_pi_tree (p
->right
);
208 /* Compare pointers when searching by pointer. Used when writing a
212 compare_pointers (void * _sn1
, void * _sn2
)
214 pointer_info
*sn1
, *sn2
;
216 sn1
= (pointer_info
*) _sn1
;
217 sn2
= (pointer_info
*) _sn2
;
219 if (sn1
->u
.pointer
< sn2
->u
.pointer
)
221 if (sn1
->u
.pointer
> sn2
->u
.pointer
)
228 /* Compare integers when searching by integer. Used when reading a
232 compare_integers (void * _sn1
, void * _sn2
)
234 pointer_info
*sn1
, *sn2
;
236 sn1
= (pointer_info
*) _sn1
;
237 sn2
= (pointer_info
*) _sn2
;
239 if (sn1
->integer
< sn2
->integer
)
241 if (sn1
->integer
> sn2
->integer
)
248 /* Initialize the pointer_info tree. */
257 compare
= (iomode
== IO_INPUT
) ? compare_integers
: compare_pointers
;
259 /* Pointer 0 is the NULL pointer. */
260 p
= gfc_get_pointer_info ();
265 gfc_insert_bbt (&pi_root
, p
, compare
);
267 /* Pointer 1 is the current namespace. */
268 p
= gfc_get_pointer_info ();
269 p
->u
.pointer
= gfc_current_ns
;
271 p
->type
= P_NAMESPACE
;
273 gfc_insert_bbt (&pi_root
, p
, compare
);
279 /* During module writing, call here with a pointer to something,
280 returning the pointer_info node. */
282 static pointer_info
*
283 find_pointer (void *gp
)
290 if (p
->u
.pointer
== gp
)
292 p
= (gp
< p
->u
.pointer
) ? p
->left
: p
->right
;
299 /* Given a pointer while writing, returns the pointer_info tree node,
300 creating it if it doesn't exist. */
302 static pointer_info
*
303 get_pointer (void *gp
)
307 p
= find_pointer (gp
);
311 /* Pointer doesn't have an integer. Give it one. */
312 p
= gfc_get_pointer_info ();
315 p
->integer
= symbol_number
++;
317 gfc_insert_bbt (&pi_root
, p
, compare_pointers
);
323 /* Given an integer during reading, find it in the pointer_info tree,
324 creating the node if not found. */
326 static pointer_info
*
327 get_integer (int integer
)
337 c
= compare_integers (&t
, p
);
341 p
= (c
< 0) ? p
->left
: p
->right
;
347 p
= gfc_get_pointer_info ();
348 p
->integer
= integer
;
351 gfc_insert_bbt (&pi_root
, p
, compare_integers
);
357 /* Recursive function to find a pointer within a tree by brute force. */
359 static pointer_info
*
360 fp2 (pointer_info
* p
, const void *target
)
367 if (p
->u
.pointer
== target
)
370 q
= fp2 (p
->left
, target
);
374 return fp2 (p
->right
, target
);
378 /* During reading, find a pointer_info node from the pointer value.
379 This amounts to a brute-force search. */
381 static pointer_info
*
382 find_pointer2 (void *p
)
385 return fp2 (pi_root
, p
);
389 /* Resolve any fixups using a known pointer. */
391 resolve_fixups (fixup_t
*f
, void * gp
)
403 /* Call here during module reading when we know what pointer to
404 associate with an integer. Any fixups that exist are resolved at
408 associate_integer_pointer (pointer_info
* p
, void *gp
)
410 if (p
->u
.pointer
!= NULL
)
411 gfc_internal_error ("associate_integer_pointer(): Already associated");
415 resolve_fixups (p
->fixup
, gp
);
421 /* During module reading, given an integer and a pointer to a pointer,
422 either store the pointer from an already-known value or create a
423 fixup structure in order to store things later. Returns zero if
424 the reference has been actually stored, or nonzero if the reference
425 must be fixed later (ie associate_integer_pointer must be called
426 sometime later. Returns the pointer_info structure. */
428 static pointer_info
*
429 add_fixup (int integer
, void *gp
)
435 p
= get_integer (integer
);
437 if (p
->integer
== 0 || p
->u
.pointer
!= NULL
)
444 f
= gfc_getmem (sizeof (fixup_t
));
456 /*****************************************************************/
458 /* Parser related subroutines */
460 /* Free the rename list left behind by a USE statement. */
465 gfc_use_rename
*next
;
467 for (; gfc_rename_list
; gfc_rename_list
= next
)
469 next
= gfc_rename_list
->next
;
470 gfc_free (gfc_rename_list
);
475 /* Match a USE statement. */
480 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
481 gfc_use_rename
*tail
= NULL
, *new;
483 gfc_intrinsic_op
operator;
486 m
= gfc_match_name (module_name
);
493 if (gfc_match_eos () == MATCH_YES
)
495 if (gfc_match_char (',') != MATCH_YES
)
498 if (gfc_match (" only :") == MATCH_YES
)
501 if (gfc_match_eos () == MATCH_YES
)
506 /* Get a new rename struct and add it to the rename list. */
507 new = gfc_get_use_rename ();
508 new->where
= gfc_current_locus
;
511 if (gfc_rename_list
== NULL
)
512 gfc_rename_list
= new;
517 /* See what kind of interface we're dealing with. Assume it is
519 new->operator = INTRINSIC_NONE
;
520 if (gfc_match_generic_spec (&type
, name
, &operator) == MATCH_ERROR
)
525 case INTERFACE_NAMELESS
:
526 gfc_error ("Missing generic specification in USE statement at %C");
529 case INTERFACE_GENERIC
:
530 m
= gfc_match (" =>");
535 strcpy (new->use_name
, name
);
538 strcpy (new->local_name
, name
);
540 m
= gfc_match_name (new->use_name
);
543 if (m
== MATCH_ERROR
)
551 strcpy (new->local_name
, name
);
553 m
= gfc_match_name (new->use_name
);
556 if (m
== MATCH_ERROR
)
562 case INTERFACE_USER_OP
:
563 strcpy (new->use_name
, name
);
566 case INTERFACE_INTRINSIC_OP
:
567 new->operator = operator;
571 if (gfc_match_eos () == MATCH_YES
)
573 if (gfc_match_char (',') != MATCH_YES
)
580 gfc_syntax_error (ST_USE
);
588 /* Given a name, return the name under which to load this symbol.
589 Returns NULL if this symbol shouldn't be loaded. */
592 find_use_name (const char *name
)
596 for (u
= gfc_rename_list
; u
; u
= u
->next
)
597 if (strcmp (u
->use_name
, name
) == 0)
601 return only_flag
? NULL
: name
;
605 return (u
->local_name
[0] != '\0') ? u
->local_name
: name
;
609 /* Try to find the operator in the current list. */
611 static gfc_use_rename
*
612 find_use_operator (gfc_intrinsic_op
operator)
616 for (u
= gfc_rename_list
; u
; u
= u
->next
)
617 if (u
->operator == operator)
624 /*****************************************************************/
626 /* The next couple of subroutines maintain a tree used to avoid a
627 brute-force search for a combination of true name and module name.
628 While symtree names, the name that a particular symbol is known by
629 can changed with USE statements, we still have to keep track of the
630 true names to generate the correct reference, and also avoid
631 loading the same real symbol twice in a program unit.
633 When we start reading, the true name tree is built and maintained
634 as symbols are read. The tree is searched as we load new symbols
635 to see if it already exists someplace in the namespace. */
637 typedef struct true_name
639 BBT_HEADER (true_name
);
644 static true_name
*true_name_root
;
647 /* Compare two true_name structures. */
650 compare_true_names (void * _t1
, void * _t2
)
655 t1
= (true_name
*) _t1
;
656 t2
= (true_name
*) _t2
;
658 c
= ((t1
->sym
->module
> t2
->sym
->module
)
659 - (t1
->sym
->module
< t2
->sym
->module
));
663 return strcmp (t1
->sym
->name
, t2
->sym
->name
);
667 /* Given a true name, search the true name tree to see if it exists
668 within the main namespace. */
671 find_true_name (const char *name
, const char *module
)
677 sym
.name
= gfc_get_string (name
);
679 sym
.module
= gfc_get_string (module
);
687 c
= compare_true_names ((void *)(&t
), (void *) p
);
691 p
= (c
< 0) ? p
->left
: p
->right
;
698 /* Given a gfc_symbol pointer that is not in the true name tree, add
702 add_true_name (gfc_symbol
* sym
)
706 t
= gfc_getmem (sizeof (true_name
));
709 gfc_insert_bbt (&true_name_root
, t
, compare_true_names
);
713 /* Recursive function to build the initial true name tree by
714 recursively traversing the current namespace. */
717 build_tnt (gfc_symtree
* st
)
723 build_tnt (st
->left
);
724 build_tnt (st
->right
);
726 if (find_true_name (st
->n
.sym
->name
, st
->n
.sym
->module
) != NULL
)
729 add_true_name (st
->n
.sym
);
733 /* Initialize the true name tree with the current namespace. */
736 init_true_name_tree (void)
738 true_name_root
= NULL
;
740 build_tnt (gfc_current_ns
->sym_root
);
744 /* Recursively free a true name tree node. */
747 free_true_name (true_name
* t
)
752 free_true_name (t
->left
);
753 free_true_name (t
->right
);
759 /*****************************************************************/
761 /* Module reading and writing. */
765 ATOM_NAME
, ATOM_LPAREN
, ATOM_RPAREN
, ATOM_INTEGER
, ATOM_STRING
769 static atom_type last_atom
;
772 /* The name buffer must be at least as long as a symbol name. Right
773 now it's not clear how we're going to store numeric constants--
774 probably as a hexadecimal string, since this will allow the exact
775 number to be preserved (this can't be done by a decimal
776 representation). Worry about that later. TODO! */
778 #define MAX_ATOM_SIZE 100
781 static char *atom_string
, atom_name
[MAX_ATOM_SIZE
];
784 /* Report problems with a module. Error reporting is not very
785 elaborate, since this sorts of errors shouldn't really happen.
786 This subroutine never returns. */
788 static void bad_module (const char *) ATTRIBUTE_NORETURN
;
791 bad_module (const char *message
)
810 gfc_fatal_error ("%s module %s at line %d column %d: %s", p
,
811 module_name
, module_line
, module_column
, message
);
815 /* Set the module's input pointer. */
818 set_module_locus (module_locus
* m
)
821 module_column
= m
->column
;
822 module_line
= m
->line
;
823 fsetpos (module_fp
, &m
->pos
);
827 /* Get the module's input pointer so that we can restore it later. */
830 get_module_locus (module_locus
* m
)
833 m
->column
= module_column
;
834 m
->line
= module_line
;
835 fgetpos (module_fp
, &m
->pos
);
839 /* Get the next character in the module, updating our reckoning of
847 c
= fgetc (module_fp
);
850 bad_module ("Unexpected EOF");
863 /* Parse a string constant. The delimiter is guaranteed to be a
873 get_module_locus (&start
);
877 /* See how long the string is */
882 bad_module ("Unexpected end of module in string constant");
900 set_module_locus (&start
);
902 atom_string
= p
= gfc_getmem (len
+ 1);
904 for (; len
> 0; len
--)
908 module_char (); /* Guaranteed to be another \' */
912 module_char (); /* Terminating \' */
913 *p
= '\0'; /* C-style string for debug purposes */
917 /* Parse a small integer. */
920 parse_integer (int c
)
928 get_module_locus (&m
);
934 atom_int
= 10 * atom_int
+ c
- '0';
935 if (atom_int
> 99999999)
936 bad_module ("Integer overflow");
939 set_module_locus (&m
);
957 get_module_locus (&m
);
962 if (!ISALNUM (c
) && c
!= '_' && c
!= '-')
966 if (++len
> GFC_MAX_SYMBOL_LEN
)
967 bad_module ("Name too long");
972 fseek (module_fp
, -1, SEEK_CUR
);
973 module_column
= m
.column
+ len
- 1;
980 /* Read the next atom in the module's input stream. */
991 while (c
== ' ' || c
== '\n');
1016 return ATOM_INTEGER
;
1074 bad_module ("Bad name");
1081 /* Peek at the next atom on the input. */
1089 get_module_locus (&m
);
1092 if (a
== ATOM_STRING
)
1093 gfc_free (atom_string
);
1095 set_module_locus (&m
);
1100 /* Read the next atom from the input, requiring that it be a
1104 require_atom (atom_type type
)
1110 get_module_locus (&m
);
1118 p
= "Expected name";
1121 p
= "Expected left parenthesis";
1124 p
= "Expected right parenthesis";
1127 p
= "Expected integer";
1130 p
= "Expected string";
1133 gfc_internal_error ("require_atom(): bad atom type required");
1136 set_module_locus (&m
);
1142 /* Given a pointer to an mstring array, require that the current input
1143 be one of the strings in the array. We return the enum value. */
1146 find_enum (const mstring
* m
)
1150 i
= gfc_string2code (m
, atom_name
);
1154 bad_module ("find_enum(): Enum not found");
1160 /**************** Module output subroutines ***************************/
1162 /* Output a character to a module file. */
1165 write_char (char out
)
1168 if (fputc (out
, module_fp
) == EOF
)
1169 gfc_fatal_error ("Error writing modules file: %s", strerror (errno
));
1181 /* Write an atom to a module. The line wrapping isn't perfect, but it
1182 should work most of the time. This isn't that big of a deal, since
1183 the file really isn't meant to be read by people anyway. */
1186 write_atom (atom_type atom
, const void *v
)
1208 i
= *((const int *) v
);
1210 gfc_internal_error ("write_atom(): Writing negative integer");
1212 sprintf (buffer
, "%d", i
);
1217 gfc_internal_error ("write_atom(): Trying to write dab atom");
1223 if (atom
!= ATOM_RPAREN
)
1225 if (module_column
+ len
> 72)
1230 if (last_atom
!= ATOM_LPAREN
&& module_column
!= 1)
1235 if (atom
== ATOM_STRING
)
1240 if (atom
== ATOM_STRING
&& *p
== '\'')
1245 if (atom
== ATOM_STRING
)
1253 /***************** Mid-level I/O subroutines *****************/
1255 /* These subroutines let their caller read or write atoms without
1256 caring about which of the two is actually happening. This lets a
1257 subroutine concentrate on the actual format of the data being
1260 static void mio_expr (gfc_expr
**);
1261 static void mio_symbol_ref (gfc_symbol
**);
1262 static void mio_symtree_ref (gfc_symtree
**);
1264 /* Read or write an enumerated value. On writing, we return the input
1265 value for the convenience of callers. We avoid using an integer
1266 pointer because enums are sometimes inside bitfields. */
1269 mio_name (int t
, const mstring
* m
)
1272 if (iomode
== IO_OUTPUT
)
1273 write_atom (ATOM_NAME
, gfc_code2string (m
, t
));
1276 require_atom (ATOM_NAME
);
1283 /* Specialisation of mio_name. */
1285 #define DECL_MIO_NAME(TYPE) \
1286 static inline TYPE \
1287 MIO_NAME(TYPE) (TYPE t, const mstring * m) \
1289 return (TYPE)mio_name ((int)t, m); \
1291 #define MIO_NAME(TYPE) mio_name_##TYPE
1297 if (iomode
== IO_OUTPUT
)
1298 write_atom (ATOM_LPAREN
, NULL
);
1300 require_atom (ATOM_LPAREN
);
1308 if (iomode
== IO_OUTPUT
)
1309 write_atom (ATOM_RPAREN
, NULL
);
1311 require_atom (ATOM_RPAREN
);
1316 mio_integer (int *ip
)
1319 if (iomode
== IO_OUTPUT
)
1320 write_atom (ATOM_INTEGER
, ip
);
1323 require_atom (ATOM_INTEGER
);
1329 /* Read or write a character pointer that points to a string on the
1333 mio_allocated_string (const char *s
)
1335 if (iomode
== IO_OUTPUT
)
1337 write_atom (ATOM_STRING
, s
);
1342 require_atom (ATOM_STRING
);
1348 /* Read or write a string that is in static memory. */
1351 mio_pool_string (const char **stringp
)
1353 /* TODO: one could write the string only once, and refer to it via a
1356 /* As a special case we have to deal with a NULL string. This
1357 happens for the 'module' member of 'gfc_symbol's that are not in a
1358 module. We read / write these as the empty string. */
1359 if (iomode
== IO_OUTPUT
)
1361 const char *p
= *stringp
== NULL
? "" : *stringp
;
1362 write_atom (ATOM_STRING
, p
);
1366 require_atom (ATOM_STRING
);
1367 *stringp
= atom_string
[0] == '\0' ? NULL
: gfc_get_string (atom_string
);
1368 gfc_free (atom_string
);
1373 /* Read or write a string that is inside of some already-allocated
1377 mio_internal_string (char *string
)
1380 if (iomode
== IO_OUTPUT
)
1381 write_atom (ATOM_STRING
, string
);
1384 require_atom (ATOM_STRING
);
1385 strcpy (string
, atom_string
);
1386 gfc_free (atom_string
);
1393 { AB_ALLOCATABLE
, AB_DIMENSION
, AB_EXTERNAL
, AB_INTRINSIC
, AB_OPTIONAL
,
1394 AB_POINTER
, AB_SAVE
, AB_TARGET
, AB_DUMMY
, AB_RESULT
,
1395 AB_DATA
, AB_IN_NAMELIST
, AB_IN_COMMON
,
1396 AB_FUNCTION
, AB_SUBROUTINE
, AB_SEQUENCE
, AB_ELEMENTAL
, AB_PURE
,
1397 AB_RECURSIVE
, AB_GENERIC
, AB_ALWAYS_EXPLICIT
1401 static const mstring attr_bits
[] =
1403 minit ("ALLOCATABLE", AB_ALLOCATABLE
),
1404 minit ("DIMENSION", AB_DIMENSION
),
1405 minit ("EXTERNAL", AB_EXTERNAL
),
1406 minit ("INTRINSIC", AB_INTRINSIC
),
1407 minit ("OPTIONAL", AB_OPTIONAL
),
1408 minit ("POINTER", AB_POINTER
),
1409 minit ("SAVE", AB_SAVE
),
1410 minit ("TARGET", AB_TARGET
),
1411 minit ("DUMMY", AB_DUMMY
),
1412 minit ("RESULT", AB_RESULT
),
1413 minit ("DATA", AB_DATA
),
1414 minit ("IN_NAMELIST", AB_IN_NAMELIST
),
1415 minit ("IN_COMMON", AB_IN_COMMON
),
1416 minit ("FUNCTION", AB_FUNCTION
),
1417 minit ("SUBROUTINE", AB_SUBROUTINE
),
1418 minit ("SEQUENCE", AB_SEQUENCE
),
1419 minit ("ELEMENTAL", AB_ELEMENTAL
),
1420 minit ("PURE", AB_PURE
),
1421 minit ("RECURSIVE", AB_RECURSIVE
),
1422 minit ("GENERIC", AB_GENERIC
),
1423 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT
),
1427 /* Specialisation of mio_name. */
1428 DECL_MIO_NAME(ab_attribute
)
1429 DECL_MIO_NAME(ar_type
)
1430 DECL_MIO_NAME(array_type
)
1432 DECL_MIO_NAME(expr_t
)
1433 DECL_MIO_NAME(gfc_access
)
1434 DECL_MIO_NAME(gfc_intrinsic_op
)
1435 DECL_MIO_NAME(ifsrc
)
1436 DECL_MIO_NAME(procedure_type
)
1437 DECL_MIO_NAME(ref_type
)
1438 DECL_MIO_NAME(sym_flavor
)
1439 DECL_MIO_NAME(sym_intent
)
1440 #undef DECL_MIO_NAME
1442 /* Symbol attributes are stored in list with the first three elements
1443 being the enumerated fields, while the remaining elements (if any)
1444 indicate the individual attribute bits. The access field is not
1445 saved-- it controls what symbols are exported when a module is
1449 mio_symbol_attribute (symbol_attribute
* attr
)
1455 attr
->flavor
= MIO_NAME(sym_flavor
) (attr
->flavor
, flavors
);
1456 attr
->intent
= MIO_NAME(sym_intent
) (attr
->intent
, intents
);
1457 attr
->proc
= MIO_NAME(procedure_type
) (attr
->proc
, procedures
);
1458 attr
->if_source
= MIO_NAME(ifsrc
) (attr
->if_source
, ifsrc_types
);
1460 if (iomode
== IO_OUTPUT
)
1462 if (attr
->allocatable
)
1463 MIO_NAME(ab_attribute
) (AB_ALLOCATABLE
, attr_bits
);
1464 if (attr
->dimension
)
1465 MIO_NAME(ab_attribute
) (AB_DIMENSION
, attr_bits
);
1467 MIO_NAME(ab_attribute
) (AB_EXTERNAL
, attr_bits
);
1468 if (attr
->intrinsic
)
1469 MIO_NAME(ab_attribute
) (AB_INTRINSIC
, attr_bits
);
1471 MIO_NAME(ab_attribute
) (AB_OPTIONAL
, attr_bits
);
1473 MIO_NAME(ab_attribute
) (AB_POINTER
, attr_bits
);
1475 MIO_NAME(ab_attribute
) (AB_SAVE
, attr_bits
);
1477 MIO_NAME(ab_attribute
) (AB_TARGET
, attr_bits
);
1479 MIO_NAME(ab_attribute
) (AB_DUMMY
, attr_bits
);
1481 MIO_NAME(ab_attribute
) (AB_RESULT
, attr_bits
);
1482 /* We deliberately don't preserve the "entry" flag. */
1485 MIO_NAME(ab_attribute
) (AB_DATA
, attr_bits
);
1486 if (attr
->in_namelist
)
1487 MIO_NAME(ab_attribute
) (AB_IN_NAMELIST
, attr_bits
);
1488 if (attr
->in_common
)
1489 MIO_NAME(ab_attribute
) (AB_IN_COMMON
, attr_bits
);
1492 MIO_NAME(ab_attribute
) (AB_FUNCTION
, attr_bits
);
1493 if (attr
->subroutine
)
1494 MIO_NAME(ab_attribute
) (AB_SUBROUTINE
, attr_bits
);
1496 MIO_NAME(ab_attribute
) (AB_GENERIC
, attr_bits
);
1499 MIO_NAME(ab_attribute
) (AB_SEQUENCE
, attr_bits
);
1500 if (attr
->elemental
)
1501 MIO_NAME(ab_attribute
) (AB_ELEMENTAL
, attr_bits
);
1503 MIO_NAME(ab_attribute
) (AB_PURE
, attr_bits
);
1504 if (attr
->recursive
)
1505 MIO_NAME(ab_attribute
) (AB_RECURSIVE
, attr_bits
);
1506 if (attr
->always_explicit
)
1507 MIO_NAME(ab_attribute
) (AB_ALWAYS_EXPLICIT
, attr_bits
);
1518 if (t
== ATOM_RPAREN
)
1521 bad_module ("Expected attribute bit name");
1523 switch ((ab_attribute
) find_enum (attr_bits
))
1525 case AB_ALLOCATABLE
:
1526 attr
->allocatable
= 1;
1529 attr
->dimension
= 1;
1535 attr
->intrinsic
= 1;
1558 case AB_IN_NAMELIST
:
1559 attr
->in_namelist
= 1;
1562 attr
->in_common
= 1;
1568 attr
->subroutine
= 1;
1577 attr
->elemental
= 1;
1583 attr
->recursive
= 1;
1585 case AB_ALWAYS_EXPLICIT
:
1586 attr
->always_explicit
= 1;
1594 static const mstring bt_types
[] = {
1595 minit ("INTEGER", BT_INTEGER
),
1596 minit ("REAL", BT_REAL
),
1597 minit ("COMPLEX", BT_COMPLEX
),
1598 minit ("LOGICAL", BT_LOGICAL
),
1599 minit ("CHARACTER", BT_CHARACTER
),
1600 minit ("DERIVED", BT_DERIVED
),
1601 minit ("PROCEDURE", BT_PROCEDURE
),
1602 minit ("UNKNOWN", BT_UNKNOWN
),
1608 mio_charlen (gfc_charlen
** clp
)
1614 if (iomode
== IO_OUTPUT
)
1618 mio_expr (&cl
->length
);
1623 if (peek_atom () != ATOM_RPAREN
)
1625 cl
= gfc_get_charlen ();
1626 mio_expr (&cl
->length
);
1630 cl
->next
= gfc_current_ns
->cl_list
;
1631 gfc_current_ns
->cl_list
= cl
;
1639 /* Return a symtree node with a name that is guaranteed to be unique
1640 within the namespace and corresponds to an illegal fortran name. */
1642 static gfc_symtree
*
1643 get_unique_symtree (gfc_namespace
* ns
)
1645 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
1646 static int serial
= 0;
1648 sprintf (name
, "@%d", serial
++);
1649 return gfc_new_symtree (&ns
->sym_root
, name
);
1653 /* See if a name is a generated name. */
1656 check_unique_name (const char *name
)
1659 return *name
== '@';
1664 mio_typespec (gfc_typespec
* ts
)
1669 ts
->type
= MIO_NAME(bt
) (ts
->type
, bt_types
);
1671 if (ts
->type
!= BT_DERIVED
)
1672 mio_integer (&ts
->kind
);
1674 mio_symbol_ref (&ts
->derived
);
1676 mio_charlen (&ts
->cl
);
1682 static const mstring array_spec_types
[] = {
1683 minit ("EXPLICIT", AS_EXPLICIT
),
1684 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE
),
1685 minit ("DEFERRED", AS_DEFERRED
),
1686 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE
),
1692 mio_array_spec (gfc_array_spec
** asp
)
1699 if (iomode
== IO_OUTPUT
)
1707 if (peek_atom () == ATOM_RPAREN
)
1713 *asp
= as
= gfc_get_array_spec ();
1716 mio_integer (&as
->rank
);
1717 as
->type
= MIO_NAME(array_type
) (as
->type
, array_spec_types
);
1719 for (i
= 0; i
< as
->rank
; i
++)
1721 mio_expr (&as
->lower
[i
]);
1722 mio_expr (&as
->upper
[i
]);
1730 /* Given a pointer to an array reference structure (which lives in a
1731 gfc_ref structure), find the corresponding array specification
1732 structure. Storing the pointer in the ref structure doesn't quite
1733 work when loading from a module. Generating code for an array
1734 reference also needs more information than just the array spec. */
1736 static const mstring array_ref_types
[] = {
1737 minit ("FULL", AR_FULL
),
1738 minit ("ELEMENT", AR_ELEMENT
),
1739 minit ("SECTION", AR_SECTION
),
1744 mio_array_ref (gfc_array_ref
* ar
)
1749 ar
->type
= MIO_NAME(ar_type
) (ar
->type
, array_ref_types
);
1750 mio_integer (&ar
->dimen
);
1758 for (i
= 0; i
< ar
->dimen
; i
++)
1759 mio_expr (&ar
->start
[i
]);
1764 for (i
= 0; i
< ar
->dimen
; i
++)
1766 mio_expr (&ar
->start
[i
]);
1767 mio_expr (&ar
->end
[i
]);
1768 mio_expr (&ar
->stride
[i
]);
1774 gfc_internal_error ("mio_array_ref(): Unknown array ref");
1777 for (i
= 0; i
< ar
->dimen
; i
++)
1778 mio_integer ((int *) &ar
->dimen_type
[i
]);
1780 if (iomode
== IO_INPUT
)
1782 ar
->where
= gfc_current_locus
;
1784 for (i
= 0; i
< ar
->dimen
; i
++)
1785 ar
->c_where
[i
] = gfc_current_locus
;
1792 /* Saves or restores a pointer. The pointer is converted back and
1793 forth from an integer. We return the pointer_info pointer so that
1794 the caller can take additional action based on the pointer type. */
1796 static pointer_info
*
1797 mio_pointer_ref (void *gp
)
1801 if (iomode
== IO_OUTPUT
)
1803 p
= get_pointer (*((char **) gp
));
1804 write_atom (ATOM_INTEGER
, &p
->integer
);
1808 require_atom (ATOM_INTEGER
);
1809 p
= add_fixup (atom_int
, gp
);
1816 /* Save and load references to components that occur within
1817 expressions. We have to describe these references by a number and
1818 by name. The number is necessary for forward references during
1819 reading, and the name is necessary if the symbol already exists in
1820 the namespace and is not loaded again. */
1823 mio_component_ref (gfc_component
** cp
, gfc_symbol
* sym
)
1825 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
1829 p
= mio_pointer_ref (cp
);
1830 if (p
->type
== P_UNKNOWN
)
1831 p
->type
= P_COMPONENT
;
1833 if (iomode
== IO_OUTPUT
)
1834 mio_pool_string (&(*cp
)->name
);
1837 mio_internal_string (name
);
1839 if (sym
->components
!= NULL
&& p
->u
.pointer
== NULL
)
1841 /* Symbol already loaded, so search by name. */
1842 for (q
= sym
->components
; q
; q
= q
->next
)
1843 if (strcmp (q
->name
, name
) == 0)
1847 gfc_internal_error ("mio_component_ref(): Component not found");
1849 associate_integer_pointer (p
, q
);
1852 /* Make sure this symbol will eventually be loaded. */
1853 p
= find_pointer2 (sym
);
1854 if (p
->u
.rsym
.state
== UNUSED
)
1855 p
->u
.rsym
.state
= NEEDED
;
1861 mio_component (gfc_component
* c
)
1868 if (iomode
== IO_OUTPUT
)
1870 p
= get_pointer (c
);
1871 mio_integer (&p
->integer
);
1876 p
= get_integer (n
);
1877 associate_integer_pointer (p
, c
);
1880 if (p
->type
== P_UNKNOWN
)
1881 p
->type
= P_COMPONENT
;
1883 mio_pool_string (&c
->name
);
1884 mio_typespec (&c
->ts
);
1885 mio_array_spec (&c
->as
);
1887 mio_integer (&c
->dimension
);
1888 mio_integer (&c
->pointer
);
1890 mio_expr (&c
->initializer
);
1896 mio_component_list (gfc_component
** cp
)
1898 gfc_component
*c
, *tail
;
1902 if (iomode
== IO_OUTPUT
)
1904 for (c
= *cp
; c
; c
= c
->next
)
1915 if (peek_atom () == ATOM_RPAREN
)
1918 c
= gfc_get_component ();
1935 mio_actual_arg (gfc_actual_arglist
* a
)
1939 mio_pool_string (&a
->name
);
1940 mio_expr (&a
->expr
);
1946 mio_actual_arglist (gfc_actual_arglist
** ap
)
1948 gfc_actual_arglist
*a
, *tail
;
1952 if (iomode
== IO_OUTPUT
)
1954 for (a
= *ap
; a
; a
= a
->next
)
1964 if (peek_atom () != ATOM_LPAREN
)
1967 a
= gfc_get_actual_arglist ();
1983 /* Read and write formal argument lists. */
1986 mio_formal_arglist (gfc_symbol
* sym
)
1988 gfc_formal_arglist
*f
, *tail
;
1992 if (iomode
== IO_OUTPUT
)
1994 for (f
= sym
->formal
; f
; f
= f
->next
)
1995 mio_symbol_ref (&f
->sym
);
2000 sym
->formal
= tail
= NULL
;
2002 while (peek_atom () != ATOM_RPAREN
)
2004 f
= gfc_get_formal_arglist ();
2005 mio_symbol_ref (&f
->sym
);
2007 if (sym
->formal
== NULL
)
2020 /* Save or restore a reference to a symbol node. */
2023 mio_symbol_ref (gfc_symbol
** symp
)
2027 p
= mio_pointer_ref (symp
);
2028 if (p
->type
== P_UNKNOWN
)
2031 if (iomode
== IO_OUTPUT
)
2033 if (p
->u
.wsym
.state
== UNREFERENCED
)
2034 p
->u
.wsym
.state
= NEEDS_WRITE
;
2038 if (p
->u
.rsym
.state
== UNUSED
)
2039 p
->u
.rsym
.state
= NEEDED
;
2044 /* Save or restore a reference to a symtree node. */
2047 mio_symtree_ref (gfc_symtree
** stp
)
2052 if (iomode
== IO_OUTPUT
)
2054 mio_symbol_ref (&(*stp
)->n
.sym
);
2058 require_atom (ATOM_INTEGER
);
2059 p
= get_integer (atom_int
);
2060 if (p
->type
== P_UNKNOWN
)
2063 if (p
->u
.rsym
.state
== UNUSED
)
2064 p
->u
.rsym
.state
= NEEDED
;
2066 if (p
->u
.rsym
.symtree
!= NULL
)
2068 *stp
= p
->u
.rsym
.symtree
;
2072 f
= gfc_getmem (sizeof (fixup_t
));
2074 f
->next
= p
->u
.rsym
.stfixup
;
2075 p
->u
.rsym
.stfixup
= f
;
2077 f
->pointer
= (void **)stp
;
2083 mio_iterator (gfc_iterator
** ip
)
2089 if (iomode
== IO_OUTPUT
)
2096 if (peek_atom () == ATOM_RPAREN
)
2102 *ip
= gfc_get_iterator ();
2107 mio_expr (&iter
->var
);
2108 mio_expr (&iter
->start
);
2109 mio_expr (&iter
->end
);
2110 mio_expr (&iter
->step
);
2119 mio_constructor (gfc_constructor
** cp
)
2121 gfc_constructor
*c
, *tail
;
2125 if (iomode
== IO_OUTPUT
)
2127 for (c
= *cp
; c
; c
= c
->next
)
2130 mio_expr (&c
->expr
);
2131 mio_iterator (&c
->iterator
);
2141 while (peek_atom () != ATOM_RPAREN
)
2143 c
= gfc_get_constructor ();
2153 mio_expr (&c
->expr
);
2154 mio_iterator (&c
->iterator
);
2164 static const mstring ref_types
[] = {
2165 minit ("ARRAY", REF_ARRAY
),
2166 minit ("COMPONENT", REF_COMPONENT
),
2167 minit ("SUBSTRING", REF_SUBSTRING
),
2173 mio_ref (gfc_ref
** rp
)
2180 r
->type
= MIO_NAME(ref_type
) (r
->type
, ref_types
);
2185 mio_array_ref (&r
->u
.ar
);
2189 mio_symbol_ref (&r
->u
.c
.sym
);
2190 mio_component_ref (&r
->u
.c
.component
, r
->u
.c
.sym
);
2194 mio_expr (&r
->u
.ss
.start
);
2195 mio_expr (&r
->u
.ss
.end
);
2196 mio_charlen (&r
->u
.ss
.length
);
2205 mio_ref_list (gfc_ref
** rp
)
2207 gfc_ref
*ref
, *head
, *tail
;
2211 if (iomode
== IO_OUTPUT
)
2213 for (ref
= *rp
; ref
; ref
= ref
->next
)
2220 while (peek_atom () != ATOM_RPAREN
)
2223 head
= tail
= gfc_get_ref ();
2226 tail
->next
= gfc_get_ref ();
2240 /* Read and write an integer value. */
2243 mio_gmp_integer (mpz_t
* integer
)
2247 if (iomode
== IO_INPUT
)
2249 if (parse_atom () != ATOM_STRING
)
2250 bad_module ("Expected integer string");
2252 mpz_init (*integer
);
2253 if (mpz_set_str (*integer
, atom_string
, 10))
2254 bad_module ("Error converting integer");
2256 gfc_free (atom_string
);
2261 p
= mpz_get_str (NULL
, 10, *integer
);
2262 write_atom (ATOM_STRING
, p
);
2269 mio_gmp_real (mpfr_t
* real
)
2274 if (iomode
== IO_INPUT
)
2276 if (parse_atom () != ATOM_STRING
)
2277 bad_module ("Expected real string");
2280 mpfr_set_str (*real
, atom_string
, 16, GFC_RND_MODE
);
2281 gfc_free (atom_string
);
2286 p
= mpfr_get_str (NULL
, &exponent
, 16, 0, *real
, GFC_RND_MODE
);
2287 atom_string
= gfc_getmem (strlen (p
) + 20);
2289 sprintf (atom_string
, "0.%s@%ld", p
, exponent
);
2291 /* Fix negative numbers. */
2292 if (atom_string
[2] == '-')
2294 atom_string
[0] = '-';
2295 atom_string
[1] = '0';
2296 atom_string
[2] = '.';
2299 write_atom (ATOM_STRING
, atom_string
);
2301 gfc_free (atom_string
);
2307 /* Save and restore the shape of an array constructor. */
2310 mio_shape (mpz_t
** pshape
, int rank
)
2316 /* A NULL shape is represented by (). */
2319 if (iomode
== IO_OUTPUT
)
2331 if (t
== ATOM_RPAREN
)
2338 shape
= gfc_get_shape (rank
);
2342 for (n
= 0; n
< rank
; n
++)
2343 mio_gmp_integer (&shape
[n
]);
2349 static const mstring expr_types
[] = {
2350 minit ("OP", EXPR_OP
),
2351 minit ("FUNCTION", EXPR_FUNCTION
),
2352 minit ("CONSTANT", EXPR_CONSTANT
),
2353 minit ("VARIABLE", EXPR_VARIABLE
),
2354 minit ("SUBSTRING", EXPR_SUBSTRING
),
2355 minit ("STRUCTURE", EXPR_STRUCTURE
),
2356 minit ("ARRAY", EXPR_ARRAY
),
2357 minit ("NULL", EXPR_NULL
),
2361 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2362 generic operators, not in expressions. INTRINSIC_USER is also
2363 replaced by the correct function name by the time we see it. */
2365 static const mstring intrinsics
[] =
2367 minit ("UPLUS", INTRINSIC_UPLUS
),
2368 minit ("UMINUS", INTRINSIC_UMINUS
),
2369 minit ("PLUS", INTRINSIC_PLUS
),
2370 minit ("MINUS", INTRINSIC_MINUS
),
2371 minit ("TIMES", INTRINSIC_TIMES
),
2372 minit ("DIVIDE", INTRINSIC_DIVIDE
),
2373 minit ("POWER", INTRINSIC_POWER
),
2374 minit ("CONCAT", INTRINSIC_CONCAT
),
2375 minit ("AND", INTRINSIC_AND
),
2376 minit ("OR", INTRINSIC_OR
),
2377 minit ("EQV", INTRINSIC_EQV
),
2378 minit ("NEQV", INTRINSIC_NEQV
),
2379 minit ("EQ", INTRINSIC_EQ
),
2380 minit ("NE", INTRINSIC_NE
),
2381 minit ("GT", INTRINSIC_GT
),
2382 minit ("GE", INTRINSIC_GE
),
2383 minit ("LT", INTRINSIC_LT
),
2384 minit ("LE", INTRINSIC_LE
),
2385 minit ("NOT", INTRINSIC_NOT
),
2389 /* Read and write expressions. The form "()" is allowed to indicate a
2393 mio_expr (gfc_expr
** ep
)
2401 if (iomode
== IO_OUTPUT
)
2410 MIO_NAME(expr_t
) (e
->expr_type
, expr_types
);
2416 if (t
== ATOM_RPAREN
)
2423 bad_module ("Expected expression type");
2425 e
= *ep
= gfc_get_expr ();
2426 e
->where
= gfc_current_locus
;
2427 e
->expr_type
= (expr_t
) find_enum (expr_types
);
2430 mio_typespec (&e
->ts
);
2431 mio_integer (&e
->rank
);
2433 switch (e
->expr_type
)
2436 e
->value
.op
.operator
2437 = MIO_NAME(gfc_intrinsic_op
) (e
->value
.op
.operator, intrinsics
);
2439 switch (e
->value
.op
.operator)
2441 case INTRINSIC_UPLUS
:
2442 case INTRINSIC_UMINUS
:
2444 mio_expr (&e
->value
.op
.op1
);
2447 case INTRINSIC_PLUS
:
2448 case INTRINSIC_MINUS
:
2449 case INTRINSIC_TIMES
:
2450 case INTRINSIC_DIVIDE
:
2451 case INTRINSIC_POWER
:
2452 case INTRINSIC_CONCAT
:
2456 case INTRINSIC_NEQV
:
2463 mio_expr (&e
->value
.op
.op1
);
2464 mio_expr (&e
->value
.op
.op2
);
2468 bad_module ("Bad operator");
2474 mio_symtree_ref (&e
->symtree
);
2475 mio_actual_arglist (&e
->value
.function
.actual
);
2477 if (iomode
== IO_OUTPUT
)
2479 e
->value
.function
.name
2480 = mio_allocated_string (e
->value
.function
.name
);
2481 flag
= e
->value
.function
.esym
!= NULL
;
2482 mio_integer (&flag
);
2484 mio_symbol_ref (&e
->value
.function
.esym
);
2486 write_atom (ATOM_STRING
, e
->value
.function
.isym
->name
);
2491 require_atom (ATOM_STRING
);
2492 e
->value
.function
.name
= gfc_get_string (atom_string
);
2493 gfc_free (atom_string
);
2495 mio_integer (&flag
);
2497 mio_symbol_ref (&e
->value
.function
.esym
);
2500 require_atom (ATOM_STRING
);
2501 e
->value
.function
.isym
= gfc_find_function (atom_string
);
2502 gfc_free (atom_string
);
2509 mio_symtree_ref (&e
->symtree
);
2510 mio_ref_list (&e
->ref
);
2513 case EXPR_SUBSTRING
:
2514 e
->value
.character
.string
= (char *)
2515 mio_allocated_string (e
->value
.character
.string
);
2516 mio_ref_list (&e
->ref
);
2519 case EXPR_STRUCTURE
:
2521 mio_constructor (&e
->value
.constructor
);
2522 mio_shape (&e
->shape
, e
->rank
);
2529 mio_gmp_integer (&e
->value
.integer
);
2533 gfc_set_model_kind (e
->ts
.kind
);
2534 mio_gmp_real (&e
->value
.real
);
2538 gfc_set_model_kind (e
->ts
.kind
);
2539 mio_gmp_real (&e
->value
.complex.r
);
2540 mio_gmp_real (&e
->value
.complex.i
);
2544 mio_integer (&e
->value
.logical
);
2548 mio_integer (&e
->value
.character
.length
);
2549 e
->value
.character
.string
= (char *)
2550 mio_allocated_string (e
->value
.character
.string
);
2554 bad_module ("Bad type in constant expression");
2567 /* Save/restore lists of gfc_interface stuctures. When loading an
2568 interface, we are really appending to the existing list of
2569 interfaces. Checking for duplicate and ambiguous interfaces has to
2570 be done later when all symbols have been loaded. */
2573 mio_interface_rest (gfc_interface
** ip
)
2575 gfc_interface
*tail
, *p
;
2577 if (iomode
== IO_OUTPUT
)
2580 for (p
= *ip
; p
; p
= p
->next
)
2581 mio_symbol_ref (&p
->sym
);
2597 if (peek_atom () == ATOM_RPAREN
)
2600 p
= gfc_get_interface ();
2601 p
->where
= gfc_current_locus
;
2602 mio_symbol_ref (&p
->sym
);
2617 /* Save/restore a nameless operator interface. */
2620 mio_interface (gfc_interface
** ip
)
2624 mio_interface_rest (ip
);
2628 /* Save/restore a named operator interface. */
2631 mio_symbol_interface (const char **name
, const char **module
,
2632 gfc_interface
** ip
)
2637 mio_pool_string (name
);
2638 mio_pool_string (module
);
2640 mio_interface_rest (ip
);
2645 mio_namespace_ref (gfc_namespace
** nsp
)
2650 p
= mio_pointer_ref (nsp
);
2652 if (p
->type
== P_UNKNOWN
)
2653 p
->type
= P_NAMESPACE
;
2655 if (iomode
== IO_INPUT
&& p
->integer
!= 0)
2657 ns
= (gfc_namespace
*)p
->u
.pointer
;
2660 ns
= gfc_get_namespace (NULL
, 0);
2661 associate_integer_pointer (p
, ns
);
2669 /* Unlike most other routines, the address of the symbol node is
2670 already fixed on input and the name/module has already been filled
2674 mio_symbol (gfc_symbol
* sym
)
2676 gfc_formal_arglist
*formal
;
2680 mio_symbol_attribute (&sym
->attr
);
2681 mio_typespec (&sym
->ts
);
2683 /* Contained procedures don't have formal namespaces. Instead we output the
2684 procedure namespace. The will contain the formal arguments. */
2685 if (iomode
== IO_OUTPUT
)
2687 formal
= sym
->formal
;
2688 while (formal
&& !formal
->sym
)
2689 formal
= formal
->next
;
2692 mio_namespace_ref (&formal
->sym
->ns
);
2694 mio_namespace_ref (&sym
->formal_ns
);
2698 mio_namespace_ref (&sym
->formal_ns
);
2701 sym
->formal_ns
->proc_name
= sym
;
2706 /* Save/restore common block links */
2707 mio_symbol_ref (&sym
->common_next
);
2709 mio_formal_arglist (sym
);
2711 if (sym
->attr
.flavor
== FL_PARAMETER
)
2712 mio_expr (&sym
->value
);
2714 mio_array_spec (&sym
->as
);
2716 mio_symbol_ref (&sym
->result
);
2718 /* Note that components are always saved, even if they are supposed
2719 to be private. Component access is checked during searching. */
2721 mio_component_list (&sym
->components
);
2723 if (sym
->components
!= NULL
)
2724 sym
->component_access
=
2725 MIO_NAME(gfc_access
) (sym
->component_access
, access_types
);
2731 /************************* Top level subroutines *************************/
2733 /* Skip a list between balanced left and right parens. */
2743 switch (parse_atom ())
2754 gfc_free (atom_string
);
2766 /* Load operator interfaces from the module. Interfaces are unusual
2767 in that they attach themselves to existing symbols. */
2770 load_operator_interfaces (void)
2773 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
2778 while (peek_atom () != ATOM_RPAREN
)
2782 mio_internal_string (name
);
2783 mio_internal_string (module
);
2785 /* Decide if we need to load this one or not. */
2786 p
= find_use_name (name
);
2789 while (parse_atom () != ATOM_RPAREN
);
2793 uop
= gfc_get_uop (p
);
2794 mio_interface_rest (&uop
->operator);
2802 /* Load interfaces from the module. Interfaces are unusual in that
2803 they attach themselves to existing symbols. */
2806 load_generic_interfaces (void)
2809 char name
[GFC_MAX_SYMBOL_LEN
+ 1], module
[GFC_MAX_SYMBOL_LEN
+ 1];
2814 while (peek_atom () != ATOM_RPAREN
)
2818 mio_internal_string (name
);
2819 mio_internal_string (module
);
2821 /* Decide if we need to load this one or not. */
2822 p
= find_use_name (name
);
2824 if (p
== NULL
|| gfc_find_symbol (p
, NULL
, 0, &sym
))
2826 while (parse_atom () != ATOM_RPAREN
);
2832 gfc_get_symbol (p
, NULL
, &sym
);
2834 sym
->attr
.flavor
= FL_PROCEDURE
;
2835 sym
->attr
.generic
= 1;
2836 sym
->attr
.use_assoc
= 1;
2839 mio_interface_rest (&sym
->generic
);
2846 /* Load common blocks. */
2851 char name
[GFC_MAX_SYMBOL_LEN
+1];
2856 while (peek_atom () != ATOM_RPAREN
)
2859 mio_internal_string (name
);
2861 p
= gfc_get_common (name
, 1);
2863 mio_symbol_ref (&p
->head
);
2864 mio_integer (&p
->saved
);
2874 /* Recursive function to traverse the pointer_info tree and load a
2875 needed symbol. We return nonzero if we load a symbol and stop the
2876 traversal, because the act of loading can alter the tree. */
2879 load_needed (pointer_info
* p
)
2887 if (load_needed (p
->left
))
2889 if (load_needed (p
->right
))
2892 if (p
->type
!= P_SYMBOL
|| p
->u
.rsym
.state
!= NEEDED
)
2895 p
->u
.rsym
.state
= USED
;
2897 set_module_locus (&p
->u
.rsym
.where
);
2899 sym
= p
->u
.rsym
.sym
;
2902 q
= get_integer (p
->u
.rsym
.ns
);
2904 ns
= (gfc_namespace
*) q
->u
.pointer
;
2907 /* Create an interface namespace if necessary. These are
2908 the namespaces that hold the formal parameters of module
2911 ns
= gfc_get_namespace (NULL
, 0);
2912 associate_integer_pointer (q
, ns
);
2915 sym
= gfc_new_symbol (p
->u
.rsym
.true_name
, ns
);
2916 sym
->module
= gfc_get_string (p
->u
.rsym
.module
);
2918 associate_integer_pointer (p
, sym
);
2922 sym
->attr
.use_assoc
= 1;
2928 /* Recursive function for cleaning up things after a module has been
2932 read_cleanup (pointer_info
* p
)
2940 read_cleanup (p
->left
);
2941 read_cleanup (p
->right
);
2943 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== USED
&& !p
->u
.rsym
.referenced
)
2945 /* Add hidden symbols to the symtree. */
2946 q
= get_integer (p
->u
.rsym
.ns
);
2947 st
= get_unique_symtree ((gfc_namespace
*) q
->u
.pointer
);
2949 st
->n
.sym
= p
->u
.rsym
.sym
;
2952 /* Fixup any symtree references. */
2953 p
->u
.rsym
.symtree
= st
;
2954 resolve_fixups (p
->u
.rsym
.stfixup
, st
);
2955 p
->u
.rsym
.stfixup
= NULL
;
2958 /* Free unused symbols. */
2959 if (p
->type
== P_SYMBOL
&& p
->u
.rsym
.state
== UNUSED
)
2960 gfc_free_symbol (p
->u
.rsym
.sym
);
2964 /* Read a module file. */
2969 module_locus operator_interfaces
, user_operators
;
2971 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2973 int ambiguous
, symbol
;
2979 get_module_locus (&operator_interfaces
); /* Skip these for now */
2982 get_module_locus (&user_operators
);
2989 /* Create the fixup nodes for all the symbols. */
2991 while (peek_atom () != ATOM_RPAREN
)
2993 require_atom (ATOM_INTEGER
);
2994 info
= get_integer (atom_int
);
2996 info
->type
= P_SYMBOL
;
2997 info
->u
.rsym
.state
= UNUSED
;
2999 mio_internal_string (info
->u
.rsym
.true_name
);
3000 mio_internal_string (info
->u
.rsym
.module
);
3002 require_atom (ATOM_INTEGER
);
3003 info
->u
.rsym
.ns
= atom_int
;
3005 get_module_locus (&info
->u
.rsym
.where
);
3008 /* See if the symbol has already been loaded by a previous module.
3009 If so, we reference the existing symbol and prevent it from
3010 being loaded again. */
3012 sym
= find_true_name (info
->u
.rsym
.true_name
, info
->u
.rsym
.module
);
3016 info
->u
.rsym
.state
= USED
;
3017 info
->u
.rsym
.referenced
= 1;
3018 info
->u
.rsym
.sym
= sym
;
3023 /* Parse the symtree lists. This lets us mark which symbols need to
3024 be loaded. Renaming is also done at this point by replacing the
3029 while (peek_atom () != ATOM_RPAREN
)
3031 mio_internal_string (name
);
3032 mio_integer (&ambiguous
);
3033 mio_integer (&symbol
);
3035 info
= get_integer (symbol
);
3037 /* Get the local name for this symbol. */
3038 p
= find_use_name (name
);
3040 /* Skip symtree nodes not in an ONLY caluse. */
3044 /* Check for ambiguous symbols. */
3045 st
= gfc_find_symtree (gfc_current_ns
->sym_root
, p
);
3049 if (st
->n
.sym
!= info
->u
.rsym
.sym
)
3051 info
->u
.rsym
.symtree
= st
;
3055 /* Create a symtree node in the current namespace for this symbol. */
3056 st
= check_unique_name (p
) ? get_unique_symtree (gfc_current_ns
) :
3057 gfc_new_symtree (&gfc_current_ns
->sym_root
, p
);
3059 st
->ambiguous
= ambiguous
;
3061 sym
= info
->u
.rsym
.sym
;
3063 /* Create a symbol node if it doesn't already exist. */
3066 sym
= info
->u
.rsym
.sym
=
3067 gfc_new_symbol (info
->u
.rsym
.true_name
, gfc_current_ns
);
3069 sym
->module
= gfc_get_string (info
->u
.rsym
.module
);
3075 /* Store the symtree pointing to this symbol. */
3076 info
->u
.rsym
.symtree
= st
;
3078 if (info
->u
.rsym
.state
== UNUSED
)
3079 info
->u
.rsym
.state
= NEEDED
;
3080 info
->u
.rsym
.referenced
= 1;
3086 /* Load intrinsic operator interfaces. */
3087 set_module_locus (&operator_interfaces
);
3090 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3092 if (i
== INTRINSIC_USER
)
3097 u
= find_use_operator (i
);
3108 mio_interface (&gfc_current_ns
->operator[i
]);
3113 /* Load generic and user operator interfaces. These must follow the
3114 loading of symtree because otherwise symbols can be marked as
3117 set_module_locus (&user_operators
);
3119 load_operator_interfaces ();
3120 load_generic_interfaces ();
3124 /* At this point, we read those symbols that are needed but haven't
3125 been loaded yet. If one symbol requires another, the other gets
3126 marked as NEEDED if its previous state was UNUSED. */
3128 while (load_needed (pi_root
));
3130 /* Make sure all elements of the rename-list were found in the
3133 for (u
= gfc_rename_list
; u
; u
= u
->next
)
3138 if (u
->operator == INTRINSIC_NONE
)
3140 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3141 u
->use_name
, &u
->where
, module_name
);
3145 if (u
->operator == INTRINSIC_USER
)
3148 ("User operator '%s' referenced at %L not found in module '%s'",
3149 u
->use_name
, &u
->where
, module_name
);
3154 ("Intrinsic operator '%s' referenced at %L not found in module "
3155 "'%s'", gfc_op2string (u
->operator), &u
->where
, module_name
);
3158 gfc_check_interfaces (gfc_current_ns
);
3160 /* Clean up symbol nodes that were never loaded, create references
3161 to hidden symbols. */
3163 read_cleanup (pi_root
);
3167 /* Given an access type that is specific to an entity and the default
3168 access, return nonzero if the entity is publicly accessible. */
3171 gfc_check_access (gfc_access specific_access
, gfc_access default_access
)
3174 if (specific_access
== ACCESS_PUBLIC
)
3176 if (specific_access
== ACCESS_PRIVATE
)
3179 if (gfc_option
.flag_module_access_private
)
3180 return default_access
== ACCESS_PUBLIC
;
3182 return default_access
!= ACCESS_PRIVATE
;
3188 /* Write a common block to the module */
3191 write_common (gfc_symtree
*st
)
3198 write_common(st
->left
);
3199 write_common(st
->right
);
3202 mio_pool_string(&st
->name
);
3205 mio_symbol_ref(&p
->head
);
3206 mio_integer(&p
->saved
);
3212 /* Write a symbol to the module. */
3215 write_symbol (int n
, gfc_symbol
* sym
)
3218 if (sym
->attr
.flavor
== FL_UNKNOWN
|| sym
->attr
.flavor
== FL_LABEL
)
3219 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym
->name
);
3222 mio_pool_string (&sym
->name
);
3224 mio_pool_string (&sym
->module
);
3225 mio_pointer_ref (&sym
->ns
);
3232 /* Recursive traversal function to write the initial set of symbols to
3233 the module. We check to see if the symbol should be written
3234 according to the access specification. */
3237 write_symbol0 (gfc_symtree
* st
)
3245 write_symbol0 (st
->left
);
3246 write_symbol0 (st
->right
);
3249 if (sym
->module
== NULL
)
3250 sym
->module
= gfc_get_string (module_name
);
3252 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
3253 && !sym
->attr
.subroutine
&& !sym
->attr
.function
)
3256 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
3259 p
= get_pointer (sym
);
3260 if (p
->type
== P_UNKNOWN
)
3263 if (p
->u
.wsym
.state
== WRITTEN
)
3266 write_symbol (p
->integer
, sym
);
3267 p
->u
.wsym
.state
= WRITTEN
;
3273 /* Recursive traversal function to write the secondary set of symbols
3274 to the module file. These are symbols that were not public yet are
3275 needed by the public symbols or another dependent symbol. The act
3276 of writing a symbol can modify the pointer_info tree, so we cease
3277 traversal if we find a symbol to write. We return nonzero if a
3278 symbol was written and pass that information upwards. */
3281 write_symbol1 (pointer_info
* p
)
3287 if (write_symbol1 (p
->left
))
3289 if (write_symbol1 (p
->right
))
3292 if (p
->type
!= P_SYMBOL
|| p
->u
.wsym
.state
!= NEEDS_WRITE
)
3295 /* FIXME: This shouldn't be necessary, but it works around
3296 deficiencies in the module loader or/and symbol handling. */
3297 if (p
->u
.wsym
.sym
->module
== NULL
&& p
->u
.wsym
.sym
->attr
.dummy
)
3298 p
->u
.wsym
.sym
->module
= gfc_get_string (module_name
);
3300 p
->u
.wsym
.state
= WRITTEN
;
3301 write_symbol (p
->integer
, p
->u
.wsym
.sym
);
3307 /* Write operator interfaces associated with a symbol. */
3310 write_operator (gfc_user_op
* uop
)
3312 static char nullstring
[] = "";
3313 const char *p
= nullstring
;
3315 if (uop
->operator == NULL
3316 || !gfc_check_access (uop
->access
, uop
->ns
->default_access
))
3319 mio_symbol_interface (&uop
->name
, &p
, &uop
->operator);
3323 /* Write generic interfaces associated with a symbol. */
3326 write_generic (gfc_symbol
* sym
)
3329 if (sym
->generic
== NULL
3330 || !gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
))
3333 mio_symbol_interface (&sym
->name
, &sym
->module
, &sym
->generic
);
3338 write_symtree (gfc_symtree
* st
)
3344 if (!gfc_check_access (sym
->attr
.access
, sym
->ns
->default_access
)
3345 || (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.generic
3346 && !sym
->attr
.subroutine
&& !sym
->attr
.function
))
3349 if (check_unique_name (st
->name
))
3352 p
= find_pointer (sym
);
3354 gfc_internal_error ("write_symtree(): Symbol not written");
3356 mio_pool_string (&st
->name
);
3357 mio_integer (&st
->ambiguous
);
3358 mio_integer (&p
->integer
);
3367 /* Write the operator interfaces. */
3370 for (i
= GFC_INTRINSIC_BEGIN
; i
!= GFC_INTRINSIC_END
; i
++)
3372 if (i
== INTRINSIC_USER
)
3375 mio_interface (gfc_check_access (gfc_current_ns
->operator_access
[i
],
3376 gfc_current_ns
->default_access
)
3377 ? &gfc_current_ns
->operator[i
] : NULL
);
3385 gfc_traverse_user_op (gfc_current_ns
, write_operator
);
3391 gfc_traverse_ns (gfc_current_ns
, write_generic
);
3397 write_common (gfc_current_ns
->common_root
);
3402 /* Write symbol information. First we traverse all symbols in the
3403 primary namespace, writing those that need to be written.
3404 Sometimes writing one symbol will cause another to need to be
3405 written. A list of these symbols ends up on the write stack, and
3406 we end by popping the bottom of the stack and writing the symbol
3407 until the stack is empty. */
3411 write_symbol0 (gfc_current_ns
->sym_root
);
3412 while (write_symbol1 (pi_root
));
3420 gfc_traverse_symtree (gfc_current_ns
->sym_root
, write_symtree
);
3425 /* Given module, dump it to disk. If there was an error while
3426 processing the module, dump_flag will be set to zero and we delete
3427 the module file, even if it was already there. */
3430 gfc_dump_module (const char *name
, int dump_flag
)
3432 char filename
[PATH_MAX
], *p
;
3436 if (gfc_option
.module_dir
!= NULL
)
3437 strcpy (filename
, gfc_option
.module_dir
);
3439 strcat (filename
, name
);
3440 strcat (filename
, MODULE_EXTENSION
);
3448 module_fp
= fopen (filename
, "w");
3449 if (module_fp
== NULL
)
3450 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
3451 filename
, strerror (errno
));
3456 *strchr (p
, '\n') = '\0';
3458 fprintf (module_fp
, "GFORTRAN module created from %s on %s\n",
3459 gfc_source_file
, p
);
3460 fputs ("If you edit this, you'll get what you deserve.\n\n", module_fp
);
3463 strcpy (module_name
, name
);
3469 free_pi_tree (pi_root
);
3474 if (fclose (module_fp
))
3475 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
3476 filename
, strerror (errno
));
3480 /* Process a USE directive. */
3483 gfc_use_module (void)
3485 char filename
[GFC_MAX_SYMBOL_LEN
+ 5];
3489 strcpy (filename
, module_name
);
3490 strcat (filename
, MODULE_EXTENSION
);
3492 module_fp
= gfc_open_included_file (filename
);
3493 if (module_fp
== NULL
)
3494 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
3495 filename
, strerror (errno
));
3501 /* Skip the first two lines of the module. */
3502 /* FIXME: Could also check for valid two lines here, instead. */
3508 bad_module ("Unexpected end of module");
3513 /* Make sure we're not reading the same module that we may be building. */
3514 for (p
= gfc_state_stack
; p
; p
= p
->previous
)
3515 if (p
->state
== COMP_MODULE
&& strcmp (p
->sym
->name
, module_name
) == 0)
3516 gfc_fatal_error ("Can't USE the same module we're building!");
3519 init_true_name_tree ();
3523 free_true_name (true_name_root
);
3524 true_name_root
= NULL
;
3526 free_pi_tree (pi_root
);
3534 gfc_module_init_2 (void)
3537 last_atom
= ATOM_LPAREN
;
3542 gfc_module_done_2 (void)