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 = strcmp (t1->sym->module, t2->sym->module);
662 return strcmp (t1->sym->name, t2->sym->name);
666 /* Given a true name, search the true name tree to see if it exists
667 within the main namespace. */
670 find_true_name (const char *name, const char *module)
676 strcpy (sym.name, name);
677 strcpy (sym.module, module);
683 c = compare_true_names ((void *)(&t), (void *) p);
687 p = (c < 0) ? p->left : p->right;
694 /* Given a gfc_symbol pointer that is not in the true name tree, add
698 add_true_name (gfc_symbol * sym)
702 t = gfc_getmem (sizeof (true_name));
705 gfc_insert_bbt (&true_name_root, t, compare_true_names);
709 /* Recursive function to build the initial true name tree by
710 recursively traversing the current namespace. */
713 build_tnt (gfc_symtree * st)
719 build_tnt (st->left);
720 build_tnt (st->right);
722 if (find_true_name (st->n.sym->name, st->n.sym->module) != NULL)
725 add_true_name (st->n.sym);
729 /* Initialize the true name tree with the current namespace. */
732 init_true_name_tree (void)
734 true_name_root = NULL;
736 build_tnt (gfc_current_ns->sym_root);
740 /* Recursively free a true name tree node. */
743 free_true_name (true_name * t)
748 free_true_name (t->left);
749 free_true_name (t->right);
755 /*****************************************************************/
757 /* Module reading and writing. */
761 ATOM_NAME, ATOM_LPAREN, ATOM_RPAREN, ATOM_INTEGER, ATOM_STRING
765 static atom_type last_atom;
768 /* The name buffer must be at least as long as a symbol name. Right
769 now it's not clear how we're going to store numeric constants--
770 probably as a hexadecimal string, since this will allow the exact
771 number to be preserved (this can't be done by a decimal
772 representation). Worry about that later. TODO! */
774 #define MAX_ATOM_SIZE 100
777 static char *atom_string, atom_name[MAX_ATOM_SIZE];
780 /* Report problems with a module. Error reporting is not very
781 elaborate, since this sorts of errors shouldn't really happen.
782 This subroutine never returns. */
784 static void bad_module (const char *) ATTRIBUTE_NORETURN;
787 bad_module (const char *message)
806 gfc_fatal_error ("%s module %s at line %d column %d: %s", p,
807 module_name, module_line, module_column, message);
811 /* Set the module's input pointer. */
814 set_module_locus (module_locus * m)
817 module_column = m->column;
818 module_line = m->line;
819 fsetpos (module_fp, &m->pos);
823 /* Get the module's input pointer so that we can restore it later. */
826 get_module_locus (module_locus * m)
829 m->column = module_column;
830 m->line = module_line;
831 fgetpos (module_fp, &m->pos);
835 /* Get the next character in the module, updating our reckoning of
843 c = fgetc (module_fp);
846 bad_module ("Unexpected EOF");
859 /* Parse a string constant. The delimiter is guaranteed to be a
869 get_module_locus (&start);
873 /* See how long the string is */
878 bad_module ("Unexpected end of module in string constant");
896 set_module_locus (&start);
898 atom_string = p = gfc_getmem (len + 1);
900 for (; len > 0; len--)
904 module_char (); /* Guaranteed to be another \' */
908 module_char (); /* Terminating \' */
909 *p = '\0'; /* C-style string for debug purposes */
913 /* Parse a small integer. */
916 parse_integer (int c)
924 get_module_locus (&m);
930 atom_int = 10 * atom_int + c - '0';
931 if (atom_int > 99999999)
932 bad_module ("Integer overflow");
935 set_module_locus (&m);
953 get_module_locus (&m);
958 if (!ISALNUM (c) && c != '_' && c != '-')
962 if (++len > GFC_MAX_SYMBOL_LEN)
963 bad_module ("Name too long");
968 fseek (module_fp, -1, SEEK_CUR);
969 module_column = m.column + len - 1;
976 /* Read the next atom in the module's input stream. */
987 while (c == ' ' || c == '\n');
1012 return ATOM_INTEGER;
1070 bad_module ("Bad name");
1077 /* Peek at the next atom on the input. */
1085 get_module_locus (&m);
1088 if (a == ATOM_STRING)
1089 gfc_free (atom_string);
1091 set_module_locus (&m);
1096 /* Read the next atom from the input, requiring that it be a
1100 require_atom (atom_type type)
1106 get_module_locus (&m);
1114 p = "Expected name";
1117 p = "Expected left parenthesis";
1120 p = "Expected right parenthesis";
1123 p = "Expected integer";
1126 p = "Expected string";
1129 gfc_internal_error ("require_atom(): bad atom type required");
1132 set_module_locus (&m);
1138 /* Given a pointer to an mstring array, require that the current input
1139 be one of the strings in the array. We return the enum value. */
1142 find_enum (const mstring * m)
1146 i = gfc_string2code (m, atom_name);
1150 bad_module ("find_enum(): Enum not found");
1156 /**************** Module output subroutines ***************************/
1158 /* Output a character to a module file. */
1161 write_char (char out)
1164 if (fputc (out, module_fp) == EOF)
1165 gfc_fatal_error ("Error writing modules file: %s", strerror (errno));
1177 /* Write an atom to a module. The line wrapping isn't perfect, but it
1178 should work most of the time. This isn't that big of a deal, since
1179 the file really isn't meant to be read by people anyway. */
1182 write_atom (atom_type atom, const void *v)
1204 i = *((const int *) v);
1206 gfc_internal_error ("write_atom(): Writing negative integer");
1208 sprintf (buffer, "%d", i);
1213 gfc_internal_error ("write_atom(): Trying to write dab atom");
1219 if (atom != ATOM_RPAREN)
1221 if (module_column + len > 72)
1226 if (last_atom != ATOM_LPAREN && module_column != 1)
1231 if (atom == ATOM_STRING)
1236 if (atom == ATOM_STRING && *p == '\'')
1241 if (atom == ATOM_STRING)
1249 /***************** Mid-level I/O subroutines *****************/
1251 /* These subroutines let their caller read or write atoms without
1252 caring about which of the two is actually happening. This lets a
1253 subroutine concentrate on the actual format of the data being
1256 static void mio_expr (gfc_expr **);
1257 static void mio_symbol_ref (gfc_symbol **);
1258 static void mio_symtree_ref (gfc_symtree **);
1260 /* Read or write an enumerated value. On writing, we return the input
1261 value for the convenience of callers. We avoid using an integer
1262 pointer because enums are sometimes inside bitfields. */
1265 mio_name (int t, const mstring * m)
1268 if (iomode == IO_OUTPUT)
1269 write_atom (ATOM_NAME, gfc_code2string (m, t));
1272 require_atom (ATOM_NAME);
1279 /* Specialisation of mio_name. */
1281 #define DECL_MIO_NAME(TYPE) \
1282 static inline TYPE \
1283 MIO_NAME(TYPE) (TYPE t, const mstring * m) \
1285 return (TYPE)mio_name ((int)t, m); \
1287 #define MIO_NAME(TYPE) mio_name_##TYPE
1293 if (iomode == IO_OUTPUT)
1294 write_atom (ATOM_LPAREN, NULL);
1296 require_atom (ATOM_LPAREN);
1304 if (iomode == IO_OUTPUT)
1305 write_atom (ATOM_RPAREN, NULL);
1307 require_atom (ATOM_RPAREN);
1312 mio_integer (int *ip)
1315 if (iomode == IO_OUTPUT)
1316 write_atom (ATOM_INTEGER, ip);
1319 require_atom (ATOM_INTEGER);
1325 /* Read or write a character pointer that points to a string on the
1329 mio_allocated_string (const char *s)
1331 if (iomode == IO_OUTPUT)
1333 write_atom (ATOM_STRING, s);
1338 require_atom (ATOM_STRING);
1344 /* Read or write a string that is in static memory or inside of some
1345 already-allocated structure. */
1348 mio_internal_string (char *string)
1351 if (iomode == IO_OUTPUT)
1352 write_atom (ATOM_STRING, string);
1355 require_atom (ATOM_STRING);
1356 strcpy (string, atom_string);
1357 gfc_free (atom_string);
1364 { AB_ALLOCATABLE, AB_DIMENSION, AB_EXTERNAL, AB_INTRINSIC, AB_OPTIONAL,
1365 AB_POINTER, AB_SAVE, AB_TARGET, AB_DUMMY, AB_RESULT,
1366 AB_DATA, AB_IN_NAMELIST, AB_IN_COMMON,
1367 AB_FUNCTION, AB_SUBROUTINE, AB_SEQUENCE, AB_ELEMENTAL, AB_PURE,
1368 AB_RECURSIVE, AB_GENERIC, AB_ALWAYS_EXPLICIT
1372 static const mstring attr_bits[] =
1374 minit ("ALLOCATABLE", AB_ALLOCATABLE),
1375 minit ("DIMENSION", AB_DIMENSION),
1376 minit ("EXTERNAL", AB_EXTERNAL),
1377 minit ("INTRINSIC", AB_INTRINSIC),
1378 minit ("OPTIONAL", AB_OPTIONAL),
1379 minit ("POINTER", AB_POINTER),
1380 minit ("SAVE", AB_SAVE),
1381 minit ("TARGET", AB_TARGET),
1382 minit ("DUMMY", AB_DUMMY),
1383 minit ("RESULT", AB_RESULT),
1384 minit ("DATA", AB_DATA),
1385 minit ("IN_NAMELIST", AB_IN_NAMELIST),
1386 minit ("IN_COMMON", AB_IN_COMMON),
1387 minit ("FUNCTION", AB_FUNCTION),
1388 minit ("SUBROUTINE", AB_SUBROUTINE),
1389 minit ("SEQUENCE", AB_SEQUENCE),
1390 minit ("ELEMENTAL", AB_ELEMENTAL),
1391 minit ("PURE", AB_PURE),
1392 minit ("RECURSIVE", AB_RECURSIVE),
1393 minit ("GENERIC", AB_GENERIC),
1394 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT),
1398 /* Specialisation of mio_name. */
1399 DECL_MIO_NAME(ab_attribute)
1400 DECL_MIO_NAME(ar_type)
1401 DECL_MIO_NAME(array_type)
1403 DECL_MIO_NAME(expr_t)
1404 DECL_MIO_NAME(gfc_access)
1405 DECL_MIO_NAME(gfc_intrinsic_op)
1406 DECL_MIO_NAME(ifsrc)
1407 DECL_MIO_NAME(procedure_type)
1408 DECL_MIO_NAME(ref_type)
1409 DECL_MIO_NAME(sym_flavor)
1410 DECL_MIO_NAME(sym_intent)
1411 #undef DECL_MIO_NAME
1413 /* Symbol attributes are stored in list with the first three elements
1414 being the enumerated fields, while the remaining elements (if any)
1415 indicate the individual attribute bits. The access field is not
1416 saved-- it controls what symbols are exported when a module is
1420 mio_symbol_attribute (symbol_attribute * attr)
1426 attr->flavor = MIO_NAME(sym_flavor) (attr->flavor, flavors);
1427 attr->intent = MIO_NAME(sym_intent) (attr->intent, intents);
1428 attr->proc = MIO_NAME(procedure_type) (attr->proc, procedures);
1429 attr->if_source = MIO_NAME(ifsrc) (attr->if_source, ifsrc_types);
1431 if (iomode == IO_OUTPUT)
1433 if (attr->allocatable)
1434 MIO_NAME(ab_attribute) (AB_ALLOCATABLE, attr_bits);
1435 if (attr->dimension)
1436 MIO_NAME(ab_attribute) (AB_DIMENSION, attr_bits);
1438 MIO_NAME(ab_attribute) (AB_EXTERNAL, attr_bits);
1439 if (attr->intrinsic)
1440 MIO_NAME(ab_attribute) (AB_INTRINSIC, attr_bits);
1442 MIO_NAME(ab_attribute) (AB_OPTIONAL, attr_bits);
1444 MIO_NAME(ab_attribute) (AB_POINTER, attr_bits);
1446 MIO_NAME(ab_attribute) (AB_SAVE, attr_bits);
1448 MIO_NAME(ab_attribute) (AB_TARGET, attr_bits);
1450 MIO_NAME(ab_attribute) (AB_DUMMY, attr_bits);
1452 MIO_NAME(ab_attribute) (AB_RESULT, attr_bits);
1453 /* We deliberately don't preserve the "entry" flag. */
1456 MIO_NAME(ab_attribute) (AB_DATA, attr_bits);
1457 if (attr->in_namelist)
1458 MIO_NAME(ab_attribute) (AB_IN_NAMELIST, attr_bits);
1459 if (attr->in_common)
1460 MIO_NAME(ab_attribute) (AB_IN_COMMON, attr_bits);
1463 MIO_NAME(ab_attribute) (AB_FUNCTION, attr_bits);
1464 if (attr->subroutine)
1465 MIO_NAME(ab_attribute) (AB_SUBROUTINE, attr_bits);
1467 MIO_NAME(ab_attribute) (AB_GENERIC, attr_bits);
1470 MIO_NAME(ab_attribute) (AB_SEQUENCE, attr_bits);
1471 if (attr->elemental)
1472 MIO_NAME(ab_attribute) (AB_ELEMENTAL, attr_bits);
1474 MIO_NAME(ab_attribute) (AB_PURE, attr_bits);
1475 if (attr->recursive)
1476 MIO_NAME(ab_attribute) (AB_RECURSIVE, attr_bits);
1477 if (attr->always_explicit)
1478 MIO_NAME(ab_attribute) (AB_ALWAYS_EXPLICIT, attr_bits);
1489 if (t == ATOM_RPAREN)
1492 bad_module ("Expected attribute bit name");
1494 switch ((ab_attribute) find_enum (attr_bits))
1496 case AB_ALLOCATABLE:
1497 attr->allocatable = 1;
1500 attr->dimension = 1;
1506 attr->intrinsic = 1;
1529 case AB_IN_NAMELIST:
1530 attr->in_namelist = 1;
1533 attr->in_common = 1;
1539 attr->subroutine = 1;
1548 attr->elemental = 1;
1554 attr->recursive = 1;
1556 case AB_ALWAYS_EXPLICIT:
1557 attr->always_explicit = 1;
1565 static const mstring bt_types[] = {
1566 minit ("INTEGER", BT_INTEGER),
1567 minit ("REAL", BT_REAL),
1568 minit ("COMPLEX", BT_COMPLEX),
1569 minit ("LOGICAL", BT_LOGICAL),
1570 minit ("CHARACTER", BT_CHARACTER),
1571 minit ("DERIVED", BT_DERIVED),
1572 minit ("PROCEDURE", BT_PROCEDURE),
1573 minit ("UNKNOWN", BT_UNKNOWN),
1579 mio_charlen (gfc_charlen ** clp)
1585 if (iomode == IO_OUTPUT)
1589 mio_expr (&cl->length);
1594 if (peek_atom () != ATOM_RPAREN)
1596 cl = gfc_get_charlen ();
1597 mio_expr (&cl->length);
1601 cl->next = gfc_current_ns->cl_list;
1602 gfc_current_ns->cl_list = cl;
1610 /* Return a symtree node with a name that is guaranteed to be unique
1611 within the namespace and corresponds to an illegal fortran name. */
1613 static gfc_symtree *
1614 get_unique_symtree (gfc_namespace * ns)
1616 char name[GFC_MAX_SYMBOL_LEN + 1];
1617 static int serial = 0;
1619 sprintf (name, "@%d", serial++);
1620 return gfc_new_symtree (&ns->sym_root, name);
1624 /* See if a name is a generated name. */
1627 check_unique_name (const char *name)
1630 return *name == '@';
1635 mio_typespec (gfc_typespec * ts)
1640 ts->type = MIO_NAME(bt) (ts->type, bt_types);
1642 if (ts->type != BT_DERIVED)
1643 mio_integer (&ts->kind);
1645 mio_symbol_ref (&ts->derived);
1647 mio_charlen (&ts->cl);
1653 static const mstring array_spec_types[] = {
1654 minit ("EXPLICIT", AS_EXPLICIT),
1655 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE),
1656 minit ("DEFERRED", AS_DEFERRED),
1657 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE),
1663 mio_array_spec (gfc_array_spec ** asp)
1670 if (iomode == IO_OUTPUT)
1678 if (peek_atom () == ATOM_RPAREN)
1684 *asp = as = gfc_get_array_spec ();
1687 mio_integer (&as->rank);
1688 as->type = MIO_NAME(array_type) (as->type, array_spec_types);
1690 for (i = 0; i < as->rank; i++)
1692 mio_expr (&as->lower[i]);
1693 mio_expr (&as->upper[i]);
1701 /* Given a pointer to an array reference structure (which lives in a
1702 gfc_ref structure), find the corresponding array specification
1703 structure. Storing the pointer in the ref structure doesn't quite
1704 work when loading from a module. Generating code for an array
1705 reference also needs more information than just the array spec. */
1707 static const mstring array_ref_types[] = {
1708 minit ("FULL", AR_FULL),
1709 minit ("ELEMENT", AR_ELEMENT),
1710 minit ("SECTION", AR_SECTION),
1715 mio_array_ref (gfc_array_ref * ar)
1720 ar->type = MIO_NAME(ar_type) (ar->type, array_ref_types);
1721 mio_integer (&ar->dimen);
1729 for (i = 0; i < ar->dimen; i++)
1730 mio_expr (&ar->start[i]);
1735 for (i = 0; i < ar->dimen; i++)
1737 mio_expr (&ar->start[i]);
1738 mio_expr (&ar->end[i]);
1739 mio_expr (&ar->stride[i]);
1745 gfc_internal_error ("mio_array_ref(): Unknown array ref");
1748 for (i = 0; i < ar->dimen; i++)
1749 mio_integer ((int *) &ar->dimen_type[i]);
1751 if (iomode == IO_INPUT)
1753 ar->where = gfc_current_locus;
1755 for (i = 0; i < ar->dimen; i++)
1756 ar->c_where[i] = gfc_current_locus;
1763 /* Saves or restores a pointer. The pointer is converted back and
1764 forth from an integer. We return the pointer_info pointer so that
1765 the caller can take additional action based on the pointer type. */
1767 static pointer_info *
1768 mio_pointer_ref (void *gp)
1772 if (iomode == IO_OUTPUT)
1774 p = get_pointer (*((char **) gp));
1775 write_atom (ATOM_INTEGER, &p->integer);
1779 require_atom (ATOM_INTEGER);
1780 p = add_fixup (atom_int, gp);
1787 /* Save and load references to components that occur within
1788 expressions. We have to describe these references by a number and
1789 by name. The number is necessary for forward references during
1790 reading, and the name is necessary if the symbol already exists in
1791 the namespace and is not loaded again. */
1794 mio_component_ref (gfc_component ** cp, gfc_symbol * sym)
1796 char name[GFC_MAX_SYMBOL_LEN + 1];
1800 p = mio_pointer_ref (cp);
1801 if (p->type == P_UNKNOWN)
1802 p->type = P_COMPONENT;
1804 if (iomode == IO_OUTPUT)
1805 mio_internal_string ((*cp)->name);
1808 mio_internal_string (name);
1810 if (sym->components != NULL && p->u.pointer == NULL)
1812 /* Symbol already loaded, so search by name. */
1813 for (q = sym->components; q; q = q->next)
1814 if (strcmp (q->name, name) == 0)
1818 gfc_internal_error ("mio_component_ref(): Component not found");
1820 associate_integer_pointer (p, q);
1823 /* Make sure this symbol will eventually be loaded. */
1824 p = find_pointer2 (sym);
1825 if (p->u.rsym.state == UNUSED)
1826 p->u.rsym.state = NEEDED;
1832 mio_component (gfc_component * c)
1839 if (iomode == IO_OUTPUT)
1841 p = get_pointer (c);
1842 mio_integer (&p->integer);
1847 p = get_integer (n);
1848 associate_integer_pointer (p, c);
1851 if (p->type == P_UNKNOWN)
1852 p->type = P_COMPONENT;
1854 mio_internal_string (c->name);
1855 mio_typespec (&c->ts);
1856 mio_array_spec (&c->as);
1858 mio_integer (&c->dimension);
1859 mio_integer (&c->pointer);
1861 mio_expr (&c->initializer);
1867 mio_component_list (gfc_component ** cp)
1869 gfc_component *c, *tail;
1873 if (iomode == IO_OUTPUT)
1875 for (c = *cp; c; c = c->next)
1886 if (peek_atom () == ATOM_RPAREN)
1889 c = gfc_get_component ();
1906 mio_actual_arg (gfc_actual_arglist * a)
1910 mio_internal_string (a->name);
1911 mio_expr (&a->expr);
1917 mio_actual_arglist (gfc_actual_arglist ** ap)
1919 gfc_actual_arglist *a, *tail;
1923 if (iomode == IO_OUTPUT)
1925 for (a = *ap; a; a = a->next)
1935 if (peek_atom () != ATOM_LPAREN)
1938 a = gfc_get_actual_arglist ();
1954 /* Read and write formal argument lists. */
1957 mio_formal_arglist (gfc_symbol * sym)
1959 gfc_formal_arglist *f, *tail;
1963 if (iomode == IO_OUTPUT)
1965 for (f = sym->formal; f; f = f->next)
1966 mio_symbol_ref (&f->sym);
1971 sym->formal = tail = NULL;
1973 while (peek_atom () != ATOM_RPAREN)
1975 f = gfc_get_formal_arglist ();
1976 mio_symbol_ref (&f->sym);
1978 if (sym->formal == NULL)
1991 /* Save or restore a reference to a symbol node. */
1994 mio_symbol_ref (gfc_symbol ** symp)
1998 p = mio_pointer_ref (symp);
1999 if (p->type == P_UNKNOWN)
2002 if (iomode == IO_OUTPUT)
2004 if (p->u.wsym.state == UNREFERENCED)
2005 p->u.wsym.state = NEEDS_WRITE;
2009 if (p->u.rsym.state == UNUSED)
2010 p->u.rsym.state = NEEDED;
2015 /* Save or restore a reference to a symtree node. */
2018 mio_symtree_ref (gfc_symtree ** stp)
2023 if (iomode == IO_OUTPUT)
2025 mio_symbol_ref (&(*stp)->n.sym);
2029 require_atom (ATOM_INTEGER);
2030 p = get_integer (atom_int);
2031 if (p->type == P_UNKNOWN)
2034 if (p->u.rsym.state == UNUSED)
2035 p->u.rsym.state = NEEDED;
2037 if (p->u.rsym.symtree != NULL)
2039 *stp = p->u.rsym.symtree;
2043 f = gfc_getmem (sizeof (fixup_t));
2045 f->next = p->u.rsym.stfixup;
2046 p->u.rsym.stfixup = f;
2048 f->pointer = (void **)stp;
2054 mio_iterator (gfc_iterator ** ip)
2060 if (iomode == IO_OUTPUT)
2067 if (peek_atom () == ATOM_RPAREN)
2073 *ip = gfc_get_iterator ();
2078 mio_expr (&iter->var);
2079 mio_expr (&iter->start);
2080 mio_expr (&iter->end);
2081 mio_expr (&iter->step);
2090 mio_constructor (gfc_constructor ** cp)
2092 gfc_constructor *c, *tail;
2096 if (iomode == IO_OUTPUT)
2098 for (c = *cp; c; c = c->next)
2101 mio_expr (&c->expr);
2102 mio_iterator (&c->iterator);
2112 while (peek_atom () != ATOM_RPAREN)
2114 c = gfc_get_constructor ();
2124 mio_expr (&c->expr);
2125 mio_iterator (&c->iterator);
2135 static const mstring ref_types[] = {
2136 minit ("ARRAY", REF_ARRAY),
2137 minit ("COMPONENT", REF_COMPONENT),
2138 minit ("SUBSTRING", REF_SUBSTRING),
2144 mio_ref (gfc_ref ** rp)
2151 r->type = MIO_NAME(ref_type) (r->type, ref_types);
2156 mio_array_ref (&r->u.ar);
2160 mio_symbol_ref (&r->u.c.sym);
2161 mio_component_ref (&r->u.c.component, r->u.c.sym);
2165 mio_expr (&r->u.ss.start);
2166 mio_expr (&r->u.ss.end);
2167 mio_charlen (&r->u.ss.length);
2176 mio_ref_list (gfc_ref ** rp)
2178 gfc_ref *ref, *head, *tail;
2182 if (iomode == IO_OUTPUT)
2184 for (ref = *rp; ref; ref = ref->next)
2191 while (peek_atom () != ATOM_RPAREN)
2194 head = tail = gfc_get_ref ();
2197 tail->next = gfc_get_ref ();
2211 /* Read and write an integer value. */
2214 mio_gmp_integer (mpz_t * integer)
2218 if (iomode == IO_INPUT)
2220 if (parse_atom () != ATOM_STRING)
2221 bad_module ("Expected integer string");
2223 mpz_init (*integer);
2224 if (mpz_set_str (*integer, atom_string, 10))
2225 bad_module ("Error converting integer");
2227 gfc_free (atom_string);
2232 p = mpz_get_str (NULL, 10, *integer);
2233 write_atom (ATOM_STRING, p);
2240 mio_gmp_real (mpfr_t * real)
2245 if (iomode == IO_INPUT)
2247 if (parse_atom () != ATOM_STRING)
2248 bad_module ("Expected real string");
2251 mpfr_set_str (*real, atom_string, 16, GFC_RND_MODE);
2252 gfc_free (atom_string);
2257 p = mpfr_get_str (NULL, &exponent, 16, 0, *real, GFC_RND_MODE);
2258 atom_string = gfc_getmem (strlen (p) + 20);
2260 sprintf (atom_string, "0.%s@%ld", p, exponent);
2262 /* Fix negative numbers. */
2263 if (atom_string[2] == '-')
2265 atom_string[0] = '-';
2266 atom_string[1] = '0';
2267 atom_string[2] = '.';
2270 write_atom (ATOM_STRING, atom_string);
2272 gfc_free (atom_string);
2278 /* Save and restore the shape of an array constructor. */
2281 mio_shape (mpz_t ** pshape, int rank)
2287 /* A NULL shape is represented by (). */
2290 if (iomode == IO_OUTPUT)
2302 if (t == ATOM_RPAREN)
2309 shape = gfc_get_shape (rank);
2313 for (n = 0; n < rank; n++)
2314 mio_gmp_integer (&shape[n]);
2320 static const mstring expr_types[] = {
2321 minit ("OP", EXPR_OP),
2322 minit ("FUNCTION", EXPR_FUNCTION),
2323 minit ("CONSTANT", EXPR_CONSTANT),
2324 minit ("VARIABLE", EXPR_VARIABLE),
2325 minit ("SUBSTRING", EXPR_SUBSTRING),
2326 minit ("STRUCTURE", EXPR_STRUCTURE),
2327 minit ("ARRAY", EXPR_ARRAY),
2328 minit ("NULL", EXPR_NULL),
2332 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2333 generic operators, not in expressions. INTRINSIC_USER is also
2334 replaced by the correct function name by the time we see it. */
2336 static const mstring intrinsics[] =
2338 minit ("UPLUS", INTRINSIC_UPLUS),
2339 minit ("UMINUS", INTRINSIC_UMINUS),
2340 minit ("PLUS", INTRINSIC_PLUS),
2341 minit ("MINUS", INTRINSIC_MINUS),
2342 minit ("TIMES", INTRINSIC_TIMES),
2343 minit ("DIVIDE", INTRINSIC_DIVIDE),
2344 minit ("POWER", INTRINSIC_POWER),
2345 minit ("CONCAT", INTRINSIC_CONCAT),
2346 minit ("AND", INTRINSIC_AND),
2347 minit ("OR", INTRINSIC_OR),
2348 minit ("EQV", INTRINSIC_EQV),
2349 minit ("NEQV", INTRINSIC_NEQV),
2350 minit ("EQ", INTRINSIC_EQ),
2351 minit ("NE", INTRINSIC_NE),
2352 minit ("GT", INTRINSIC_GT),
2353 minit ("GE", INTRINSIC_GE),
2354 minit ("LT", INTRINSIC_LT),
2355 minit ("LE", INTRINSIC_LE),
2356 minit ("NOT", INTRINSIC_NOT),
2360 /* Read and write expressions. The form "()" is allowed to indicate a
2364 mio_expr (gfc_expr ** ep)
2372 if (iomode == IO_OUTPUT)
2381 MIO_NAME(expr_t) (e->expr_type, expr_types);
2387 if (t == ATOM_RPAREN)
2394 bad_module ("Expected expression type");
2396 e = *ep = gfc_get_expr ();
2397 e->where = gfc_current_locus;
2398 e->expr_type = (expr_t) find_enum (expr_types);
2401 mio_typespec (&e->ts);
2402 mio_integer (&e->rank);
2404 switch (e->expr_type)
2407 e->operator = MIO_NAME(gfc_intrinsic_op) (e->operator, intrinsics);
2409 switch (e->operator)
2411 case INTRINSIC_UPLUS:
2412 case INTRINSIC_UMINUS:
2417 case INTRINSIC_PLUS:
2418 case INTRINSIC_MINUS:
2419 case INTRINSIC_TIMES:
2420 case INTRINSIC_DIVIDE:
2421 case INTRINSIC_POWER:
2422 case INTRINSIC_CONCAT:
2426 case INTRINSIC_NEQV:
2438 bad_module ("Bad operator");
2444 mio_symtree_ref (&e->symtree);
2445 mio_actual_arglist (&e->value.function.actual);
2447 if (iomode == IO_OUTPUT)
2449 e->value.function.name
2450 = mio_allocated_string (e->value.function.name);
2451 flag = e->value.function.esym != NULL;
2452 mio_integer (&flag);
2454 mio_symbol_ref (&e->value.function.esym);
2456 write_atom (ATOM_STRING, e->value.function.isym->name);
2461 require_atom (ATOM_STRING);
2462 e->value.function.name = gfc_get_string (atom_string);
2463 gfc_free (atom_string);
2465 mio_integer (&flag);
2467 mio_symbol_ref (&e->value.function.esym);
2470 require_atom (ATOM_STRING);
2471 e->value.function.isym = gfc_find_function (atom_string);
2472 gfc_free (atom_string);
2479 mio_symtree_ref (&e->symtree);
2480 mio_ref_list (&e->ref);
2483 case EXPR_SUBSTRING:
2484 e->value.character.string = (char *)
2485 mio_allocated_string (e->value.character.string);
2490 case EXPR_STRUCTURE:
2492 mio_constructor (&e->value.constructor);
2493 mio_shape (&e->shape, e->rank);
2500 mio_gmp_integer (&e->value.integer);
2504 gfc_set_model_kind (e->ts.kind);
2505 mio_gmp_real (&e->value.real);
2509 gfc_set_model_kind (e->ts.kind);
2510 mio_gmp_real (&e->value.complex.r);
2511 mio_gmp_real (&e->value.complex.i);
2515 mio_integer (&e->value.logical);
2519 mio_integer (&e->value.character.length);
2520 e->value.character.string = (char *)
2521 mio_allocated_string (e->value.character.string);
2525 bad_module ("Bad type in constant expression");
2538 /* Save/restore lists of gfc_interface stuctures. When loading an
2539 interface, we are really appending to the existing list of
2540 interfaces. Checking for duplicate and ambiguous interfaces has to
2541 be done later when all symbols have been loaded. */
2544 mio_interface_rest (gfc_interface ** ip)
2546 gfc_interface *tail, *p;
2548 if (iomode == IO_OUTPUT)
2551 for (p = *ip; p; p = p->next)
2552 mio_symbol_ref (&p->sym);
2568 if (peek_atom () == ATOM_RPAREN)
2571 p = gfc_get_interface ();
2572 p->where = gfc_current_locus;
2573 mio_symbol_ref (&p->sym);
2588 /* Save/restore a nameless operator interface. */
2591 mio_interface (gfc_interface ** ip)
2595 mio_interface_rest (ip);
2599 /* Save/restore a named operator interface. */
2602 mio_symbol_interface (char *name, char *module,
2603 gfc_interface ** ip)
2608 mio_internal_string (name);
2609 mio_internal_string (module);
2611 mio_interface_rest (ip);
2616 mio_namespace_ref (gfc_namespace ** nsp)
2621 p = mio_pointer_ref (nsp);
2623 if (p->type == P_UNKNOWN)
2624 p->type = P_NAMESPACE;
2626 if (iomode == IO_INPUT && p->integer != 0)
2628 ns = (gfc_namespace *)p->u.pointer;
2631 ns = gfc_get_namespace (NULL);
2632 associate_integer_pointer (p, ns);
2640 /* Unlike most other routines, the address of the symbol node is
2641 already fixed on input and the name/module has already been filled
2645 mio_symbol (gfc_symbol * sym)
2647 gfc_formal_arglist *formal;
2651 mio_symbol_attribute (&sym->attr);
2652 mio_typespec (&sym->ts);
2654 /* Contained procedures don't have formal namespaces. Instead we output the
2655 procedure namespace. The will contain the formal arguments. */
2656 if (iomode == IO_OUTPUT)
2658 formal = sym->formal;
2659 while (formal && !formal->sym)
2660 formal = formal->next;
2663 mio_namespace_ref (&formal->sym->ns);
2665 mio_namespace_ref (&sym->formal_ns);
2669 mio_namespace_ref (&sym->formal_ns);
2672 sym->formal_ns->proc_name = sym;
2677 /* Save/restore common block links */
2678 mio_symbol_ref (&sym->common_next);
2680 mio_formal_arglist (sym);
2682 if (sym->attr.flavor == FL_PARAMETER)
2683 mio_expr (&sym->value);
2685 mio_array_spec (&sym->as);
2687 mio_symbol_ref (&sym->result);
2689 /* Note that components are always saved, even if they are supposed
2690 to be private. Component access is checked during searching. */
2692 mio_component_list (&sym->components);
2694 if (sym->components != NULL)
2695 sym->component_access =
2696 MIO_NAME(gfc_access) (sym->component_access, access_types);
2702 /************************* Top level subroutines *************************/
2704 /* Skip a list between balanced left and right parens. */
2714 switch (parse_atom ())
2725 gfc_free (atom_string);
2737 /* Load operator interfaces from the module. Interfaces are unusual
2738 in that they attach themselves to existing symbols. */
2741 load_operator_interfaces (void)
2744 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
2749 while (peek_atom () != ATOM_RPAREN)
2753 mio_internal_string (name);
2754 mio_internal_string (module);
2756 /* Decide if we need to load this one or not. */
2757 p = find_use_name (name);
2760 while (parse_atom () != ATOM_RPAREN);
2764 uop = gfc_get_uop (p);
2765 mio_interface_rest (&uop->operator);
2773 /* Load interfaces from the module. Interfaces are unusual in that
2774 they attach themselves to existing symbols. */
2777 load_generic_interfaces (void)
2780 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
2785 while (peek_atom () != ATOM_RPAREN)
2789 mio_internal_string (name);
2790 mio_internal_string (module);
2792 /* Decide if we need to load this one or not. */
2793 p = find_use_name (name);
2795 if (p == NULL || gfc_find_symbol (p, NULL, 0, &sym))
2797 while (parse_atom () != ATOM_RPAREN);
2803 gfc_get_symbol (p, NULL, &sym);
2805 sym->attr.flavor = FL_PROCEDURE;
2806 sym->attr.generic = 1;
2807 sym->attr.use_assoc = 1;
2810 mio_interface_rest (&sym->generic);
2817 /* Load common blocks. */
2822 char name[GFC_MAX_SYMBOL_LEN+1];
2827 while (peek_atom () != ATOM_RPAREN)
2830 mio_internal_string (name);
2832 p = gfc_get_common (name, 1);
2834 mio_symbol_ref (&p->head);
2835 mio_integer (&p->saved);
2845 /* Recursive function to traverse the pointer_info tree and load a
2846 needed symbol. We return nonzero if we load a symbol and stop the
2847 traversal, because the act of loading can alter the tree. */
2850 load_needed (pointer_info * p)
2858 if (load_needed (p->left))
2860 if (load_needed (p->right))
2863 if (p->type != P_SYMBOL || p->u.rsym.state != NEEDED)
2866 p->u.rsym.state = USED;
2868 set_module_locus (&p->u.rsym.where);
2870 sym = p->u.rsym.sym;
2873 q = get_integer (p->u.rsym.ns);
2875 ns = (gfc_namespace *) q->u.pointer;
2878 /* Create an interface namespace if necessary. These are
2879 the namespaces that hold the formal parameters of module
2882 ns = gfc_get_namespace (NULL);
2883 associate_integer_pointer (q, ns);
2886 sym = gfc_new_symbol (p->u.rsym.true_name, ns);
2887 strcpy (sym->module, p->u.rsym.module);
2889 associate_integer_pointer (p, sym);
2893 sym->attr.use_assoc = 1;
2899 /* Recursive function for cleaning up things after a module has been
2903 read_cleanup (pointer_info * p)
2911 read_cleanup (p->left);
2912 read_cleanup (p->right);
2914 if (p->type == P_SYMBOL && p->u.rsym.state == USED && !p->u.rsym.referenced)
2916 /* Add hidden symbols to the symtree. */
2917 q = get_integer (p->u.rsym.ns);
2918 st = get_unique_symtree ((gfc_namespace *) q->u.pointer);
2920 st->n.sym = p->u.rsym.sym;
2923 /* Fixup any symtree references. */
2924 p->u.rsym.symtree = st;
2925 resolve_fixups (p->u.rsym.stfixup, st);
2926 p->u.rsym.stfixup = NULL;
2929 /* Free unused symbols. */
2930 if (p->type == P_SYMBOL && p->u.rsym.state == UNUSED)
2931 gfc_free_symbol (p->u.rsym.sym);
2935 /* Read a module file. */
2940 module_locus operator_interfaces, user_operators;
2942 char name[GFC_MAX_SYMBOL_LEN + 1];
2944 int ambiguous, symbol;
2950 get_module_locus (&operator_interfaces); /* Skip these for now */
2953 get_module_locus (&user_operators);
2960 /* Create the fixup nodes for all the symbols. */
2962 while (peek_atom () != ATOM_RPAREN)
2964 require_atom (ATOM_INTEGER);
2965 info = get_integer (atom_int);
2967 info->type = P_SYMBOL;
2968 info->u.rsym.state = UNUSED;
2970 mio_internal_string (info->u.rsym.true_name);
2971 mio_internal_string (info->u.rsym.module);
2973 require_atom (ATOM_INTEGER);
2974 info->u.rsym.ns = atom_int;
2976 get_module_locus (&info->u.rsym.where);
2979 /* See if the symbol has already been loaded by a previous module.
2980 If so, we reference the existing symbol and prevent it from
2981 being loaded again. */
2983 sym = find_true_name (info->u.rsym.true_name, info->u.rsym.module);
2987 info->u.rsym.state = USED;
2988 info->u.rsym.referenced = 1;
2989 info->u.rsym.sym = sym;
2994 /* Parse the symtree lists. This lets us mark which symbols need to
2995 be loaded. Renaming is also done at this point by replacing the
3000 while (peek_atom () != ATOM_RPAREN)
3002 mio_internal_string (name);
3003 mio_integer (&ambiguous);
3004 mio_integer (&symbol);
3006 info = get_integer (symbol);
3008 /* Get the local name for this symbol. */
3009 p = find_use_name (name);
3011 /* Skip symtree nodes not in an ONLY caluse. */
3015 /* Check for ambiguous symbols. */
3016 st = gfc_find_symtree (gfc_current_ns->sym_root, p);
3020 if (st->n.sym != info->u.rsym.sym)
3022 info->u.rsym.symtree = st;
3026 /* Create a symtree node in the current namespace for this symbol. */
3027 st = check_unique_name (p) ? get_unique_symtree (gfc_current_ns) :
3028 gfc_new_symtree (&gfc_current_ns->sym_root, p);
3030 st->ambiguous = ambiguous;
3032 sym = info->u.rsym.sym;
3034 /* Create a symbol node if it doesn't already exist. */
3037 sym = info->u.rsym.sym =
3038 gfc_new_symbol (info->u.rsym.true_name, gfc_current_ns);
3040 strcpy (sym->module, info->u.rsym.module);
3046 /* Store the symtree pointing to this symbol. */
3047 info->u.rsym.symtree = st;
3049 if (info->u.rsym.state == UNUSED)
3050 info->u.rsym.state = NEEDED;
3051 info->u.rsym.referenced = 1;
3057 /* Load intrinsic operator interfaces. */
3058 set_module_locus (&operator_interfaces);
3061 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
3063 if (i == INTRINSIC_USER)
3068 u = find_use_operator (i);
3079 mio_interface (&gfc_current_ns->operator[i]);
3084 /* Load generic and user operator interfaces. These must follow the
3085 loading of symtree because otherwise symbols can be marked as
3088 set_module_locus (&user_operators);
3090 load_operator_interfaces ();
3091 load_generic_interfaces ();
3095 /* At this point, we read those symbols that are needed but haven't
3096 been loaded yet. If one symbol requires another, the other gets
3097 marked as NEEDED if its previous state was UNUSED. */
3099 while (load_needed (pi_root));
3101 /* Make sure all elements of the rename-list were found in the
3104 for (u = gfc_rename_list; u; u = u->next)
3109 if (u->operator == INTRINSIC_NONE)
3111 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3112 u->use_name, &u->where, module_name);
3116 if (u->operator == INTRINSIC_USER)
3119 ("User operator '%s' referenced at %L not found in module '%s'",
3120 u->use_name, &u->where, module_name);
3125 ("Intrinsic operator '%s' referenced at %L not found in module "
3126 "'%s'", gfc_op2string (u->operator), &u->where, module_name);
3129 gfc_check_interfaces (gfc_current_ns);
3131 /* Clean up symbol nodes that were never loaded, create references
3132 to hidden symbols. */
3134 read_cleanup (pi_root);
3138 /* Given an access type that is specific to an entity and the default
3139 access, return nonzero if the entity is publicly accessible. */
3142 gfc_check_access (gfc_access specific_access, gfc_access default_access)
3145 if (specific_access == ACCESS_PUBLIC)
3147 if (specific_access == ACCESS_PRIVATE)
3150 if (gfc_option.flag_module_access_private)
3151 return default_access == ACCESS_PUBLIC;
3153 return 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 mio_internal_string (sym->name);
3195 mio_internal_string (sym->module);
3196 mio_pointer_ref (&sym->ns);
3203 /* Recursive traversal function to write the initial set of symbols to
3204 the module. We check to see if the symbol should be written
3205 according to the access specification. */
3208 write_symbol0 (gfc_symtree * st)
3216 write_symbol0 (st->left);
3217 write_symbol0 (st->right);
3220 if (sym->module[0] == '\0')
3221 strcpy (sym->module, module_name);
3223 if (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
3224 && !sym->attr.subroutine && !sym->attr.function)
3227 if (!gfc_check_access (sym->attr.access, sym->ns->default_access))
3230 p = get_pointer (sym);
3231 if (p->type == P_UNKNOWN)
3234 if (p->u.wsym.state == WRITTEN)
3237 write_symbol (p->integer, sym);
3238 p->u.wsym.state = WRITTEN;
3244 /* Recursive traversal function to write the secondary set of symbols
3245 to the module file. These are symbols that were not public yet are
3246 needed by the public symbols or another dependent symbol. The act
3247 of writing a symbol can modify the pointer_info tree, so we cease
3248 traversal if we find a symbol to write. We return nonzero if a
3249 symbol was written and pass that information upwards. */
3252 write_symbol1 (pointer_info * p)
3258 if (write_symbol1 (p->left))
3260 if (write_symbol1 (p->right))
3263 if (p->type != P_SYMBOL || p->u.wsym.state != NEEDS_WRITE)
3266 /* FIXME: This shouldn't be necessary, but it works around
3267 deficiencies in the module loader or/and symbol handling. */
3268 if (p->u.wsym.sym->module[0] == '\0' && p->u.wsym.sym->attr.dummy)
3269 strcpy (p->u.wsym.sym->module, module_name);
3271 p->u.wsym.state = WRITTEN;
3272 write_symbol (p->integer, p->u.wsym.sym);
3278 /* Write operator interfaces associated with a symbol. */
3281 write_operator (gfc_user_op * uop)
3283 static char nullstring[] = "";
3285 if (uop->operator == NULL
3286 || !gfc_check_access (uop->access, uop->ns->default_access))
3289 mio_symbol_interface (uop->name, nullstring, &uop->operator);
3293 /* Write generic interfaces associated with a symbol. */
3296 write_generic (gfc_symbol * sym)
3299 if (sym->generic == NULL
3300 || !gfc_check_access (sym->attr.access, sym->ns->default_access))
3303 mio_symbol_interface (sym->name, sym->module, &sym->generic);
3308 write_symtree (gfc_symtree * st)
3314 if (!gfc_check_access (sym->attr.access, sym->ns->default_access)
3315 || (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
3316 && !sym->attr.subroutine && !sym->attr.function))
3319 if (check_unique_name (st->name))
3322 p = find_pointer (sym);
3324 gfc_internal_error ("write_symtree(): Symbol not written");
3326 mio_internal_string (st->name);
3327 mio_integer (&st->ambiguous);
3328 mio_integer (&p->integer);
3337 /* Write the operator interfaces. */
3340 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
3342 if (i == INTRINSIC_USER)
3345 mio_interface (gfc_check_access (gfc_current_ns->operator_access[i],
3346 gfc_current_ns->default_access)
3347 ? &gfc_current_ns->operator[i] : NULL);
3355 gfc_traverse_user_op (gfc_current_ns, write_operator);
3361 gfc_traverse_ns (gfc_current_ns, write_generic);
3367 write_common (gfc_current_ns->common_root);
3372 /* Write symbol information. First we traverse all symbols in the
3373 primary namespace, writing those that need to be written.
3374 Sometimes writing one symbol will cause another to need to be
3375 written. A list of these symbols ends up on the write stack, and
3376 we end by popping the bottom of the stack and writing the symbol
3377 until the stack is empty. */
3381 write_symbol0 (gfc_current_ns->sym_root);
3382 while (write_symbol1 (pi_root));
3390 gfc_traverse_symtree (gfc_current_ns->sym_root, write_symtree);
3395 /* Given module, dump it to disk. If there was an error while
3396 processing the module, dump_flag will be set to zero and we delete
3397 the module file, even if it was already there. */
3400 gfc_dump_module (const char *name, int dump_flag)
3402 char filename[PATH_MAX], *p;
3406 if (gfc_option.module_dir != NULL)
3407 strcpy (filename, gfc_option.module_dir);
3409 strcat (filename, name);
3410 strcat (filename, MODULE_EXTENSION);
3418 module_fp = fopen (filename, "w");
3419 if (module_fp == NULL)
3420 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
3421 filename, strerror (errno));
3426 *strchr (p, '\n') = '\0';
3428 fprintf (module_fp, "GFORTRAN module created from %s on %s\n",
3429 gfc_source_file, p);
3430 fputs ("If you edit this, you'll get what you deserve.\n\n", module_fp);
3433 strcpy (module_name, name);
3439 free_pi_tree (pi_root);
3444 if (fclose (module_fp))
3445 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
3446 filename, strerror (errno));
3450 /* Process a USE directive. */
3453 gfc_use_module (void)
3455 char filename[GFC_MAX_SYMBOL_LEN + 5];
3459 strcpy (filename, module_name);
3460 strcat (filename, MODULE_EXTENSION);
3462 module_fp = gfc_open_included_file (filename);
3463 if (module_fp == NULL)
3464 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
3465 filename, strerror (errno));
3471 /* Skip the first two lines of the module. */
3472 /* FIXME: Could also check for valid two lines here, instead. */
3478 bad_module ("Unexpected end of module");
3483 /* Make sure we're not reading the same module that we may be building. */
3484 for (p = gfc_state_stack; p; p = p->previous)
3485 if (p->state == COMP_MODULE && strcmp (p->sym->name, module_name) == 0)
3486 gfc_fatal_error ("Can't USE the same module we're building!");
3489 init_true_name_tree ();
3493 free_true_name (true_name_root);
3494 true_name_root = NULL;
3496 free_pi_tree (pi_root);
3504 gfc_module_init_2 (void)
3507 last_atom = ATOM_LPAREN;
3512 gfc_module_done_2 (void)