1 /* Handle modules, which amounts to loading and saving symbols and
2 their attendant structures.
3 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008,
5 Free Software Foundation, Inc.
6 Contributed by Andy Vaught
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
24 /* The syntax of gfortran modules resembles that of lisp lists, i.e. a
25 sequence of atoms, which can be left or right parenthesis, names,
26 integers or strings. Parenthesis are always matched which allows
27 us to skip over sections at high speed without having to know
28 anything about the internal structure of the lists. A "name" is
29 usually a fortran 95 identifier, but can also start with '@' in
30 order to reference a hidden symbol.
32 The first line of a module is an informational message about what
33 created the module, the file it came from and when it was created.
34 The second line is a warning for people not to edit the module.
35 The rest of the module looks like:
37 ( ( <Interface info for UPLUS> )
38 ( <Interface info for UMINUS> )
41 ( ( <name of operator interface> <module of op interface> <i/f1> ... )
44 ( ( <name of generic interface> <module of generic interface> <i/f1> ... )
47 ( ( <common name> <symbol> <saved flag>)
53 ( <Symbol Number (in no particular order)>
55 <Module name of symbol>
56 ( <symbol information> )
65 In general, symbols refer to other symbols by their symbol number,
66 which are zero based. Symbols are written to the module in no
74 #include "parse.h" /* FIXME */
77 #define MODULE_EXTENSION ".mod"
79 /* Don't put any single quote (') in MOD_VERSION,
80 if yout want it to be recognized. */
81 #define MOD_VERSION "4"
84 /* Structure that describes a position within a module file. */
93 /* Structure for list of symbols of intrinsic modules. */
106 P_UNKNOWN = 0, P_OTHER, P_NAMESPACE, P_COMPONENT, P_SYMBOL
110 /* The fixup structure lists pointers to pointers that have to
111 be updated when a pointer value becomes known. */
113 typedef struct fixup_t
116 struct fixup_t *next;
121 /* Structure for holding extra info needed for pointers being read. */
137 typedef struct pointer_info
139 BBT_HEADER (pointer_info);
143 /* The first component of each member of the union is the pointer
150 void *pointer; /* Member for doing pointer searches. */
155 char true_name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
156 enum gfc_rsym_state state;
157 int ns, referenced, renamed;
160 gfc_symtree *symtree;
161 char binding_label[GFC_MAX_SYMBOL_LEN + 1];
168 enum gfc_wsym_state state;
177 #define gfc_get_pointer_info() XCNEW (pointer_info)
180 /* Local variables */
182 /* The FILE for the module we're reading or writing. */
183 static FILE *module_fp;
185 /* MD5 context structure. */
186 static struct md5_ctx ctx;
188 /* The name of the module we're reading (USE'ing) or writing. */
189 static char module_name[GFC_MAX_SYMBOL_LEN + 1];
191 /* The way the module we're reading was specified. */
192 static bool specified_nonint, specified_int;
194 static int module_line, module_column, only_flag;
196 { IO_INPUT, IO_OUTPUT }
199 static gfc_use_rename *gfc_rename_list;
200 static pointer_info *pi_root;
201 static int symbol_number; /* Counter for assigning symbol numbers */
203 /* Tells mio_expr_ref to make symbols for unused equivalence members. */
204 static bool in_load_equiv;
206 static locus use_locus;
210 /*****************************************************************/
212 /* Pointer/integer conversion. Pointers between structures are stored
213 as integers in the module file. The next couple of subroutines
214 handle this translation for reading and writing. */
216 /* Recursively free the tree of pointer structures. */
219 free_pi_tree (pointer_info *p)
224 if (p->fixup != NULL)
225 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
227 free_pi_tree (p->left);
228 free_pi_tree (p->right);
234 /* Compare pointers when searching by pointer. Used when writing a
238 compare_pointers (void *_sn1, void *_sn2)
240 pointer_info *sn1, *sn2;
242 sn1 = (pointer_info *) _sn1;
243 sn2 = (pointer_info *) _sn2;
245 if (sn1->u.pointer < sn2->u.pointer)
247 if (sn1->u.pointer > sn2->u.pointer)
254 /* Compare integers when searching by integer. Used when reading a
258 compare_integers (void *_sn1, void *_sn2)
260 pointer_info *sn1, *sn2;
262 sn1 = (pointer_info *) _sn1;
263 sn2 = (pointer_info *) _sn2;
265 if (sn1->integer < sn2->integer)
267 if (sn1->integer > sn2->integer)
274 /* Initialize the pointer_info tree. */
283 compare = (iomode == IO_INPUT) ? compare_integers : compare_pointers;
285 /* Pointer 0 is the NULL pointer. */
286 p = gfc_get_pointer_info ();
291 gfc_insert_bbt (&pi_root, p, compare);
293 /* Pointer 1 is the current namespace. */
294 p = gfc_get_pointer_info ();
295 p->u.pointer = gfc_current_ns;
297 p->type = P_NAMESPACE;
299 gfc_insert_bbt (&pi_root, p, compare);
305 /* During module writing, call here with a pointer to something,
306 returning the pointer_info node. */
308 static pointer_info *
309 find_pointer (void *gp)
316 if (p->u.pointer == gp)
318 p = (gp < p->u.pointer) ? p->left : p->right;
325 /* Given a pointer while writing, returns the pointer_info tree node,
326 creating it if it doesn't exist. */
328 static pointer_info *
329 get_pointer (void *gp)
333 p = find_pointer (gp);
337 /* Pointer doesn't have an integer. Give it one. */
338 p = gfc_get_pointer_info ();
341 p->integer = symbol_number++;
343 gfc_insert_bbt (&pi_root, p, compare_pointers);
349 /* Given an integer during reading, find it in the pointer_info tree,
350 creating the node if not found. */
352 static pointer_info *
353 get_integer (int integer)
363 c = compare_integers (&t, p);
367 p = (c < 0) ? p->left : p->right;
373 p = gfc_get_pointer_info ();
374 p->integer = integer;
377 gfc_insert_bbt (&pi_root, p, compare_integers);
383 /* Recursive function to find a pointer within a tree by brute force. */
385 static pointer_info *
386 fp2 (pointer_info *p, const void *target)
393 if (p->u.pointer == target)
396 q = fp2 (p->left, target);
400 return fp2 (p->right, target);
404 /* During reading, find a pointer_info node from the pointer value.
405 This amounts to a brute-force search. */
407 static pointer_info *
408 find_pointer2 (void *p)
410 return fp2 (pi_root, p);
414 /* Resolve any fixups using a known pointer. */
417 resolve_fixups (fixup_t *f, void *gp)
430 /* Call here during module reading when we know what pointer to
431 associate with an integer. Any fixups that exist are resolved at
435 associate_integer_pointer (pointer_info *p, void *gp)
437 if (p->u.pointer != NULL)
438 gfc_internal_error ("associate_integer_pointer(): Already associated");
442 resolve_fixups (p->fixup, gp);
448 /* During module reading, given an integer and a pointer to a pointer,
449 either store the pointer from an already-known value or create a
450 fixup structure in order to store things later. Returns zero if
451 the reference has been actually stored, or nonzero if the reference
452 must be fixed later (i.e., associate_integer_pointer must be called
453 sometime later. Returns the pointer_info structure. */
455 static pointer_info *
456 add_fixup (int integer, void *gp)
462 p = get_integer (integer);
464 if (p->integer == 0 || p->u.pointer != NULL)
467 *cp = (char *) p->u.pointer;
476 f->pointer = (void **) gp;
483 /*****************************************************************/
485 /* Parser related subroutines */
487 /* Free the rename list left behind by a USE statement. */
492 gfc_use_rename *next;
494 for (; gfc_rename_list; gfc_rename_list = next)
496 next = gfc_rename_list->next;
497 gfc_free (gfc_rename_list);
502 /* Match a USE statement. */
507 char name[GFC_MAX_SYMBOL_LEN + 1], module_nature[GFC_MAX_SYMBOL_LEN + 1];
508 gfc_use_rename *tail = NULL, *new_use;
509 interface_type type, type2;
513 specified_int = false;
514 specified_nonint = false;
516 if (gfc_match (" , ") == MATCH_YES)
518 if ((m = gfc_match (" %n ::", module_nature)) == MATCH_YES)
520 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: module "
521 "nature in USE statement at %C") == FAILURE)
524 if (strcmp (module_nature, "intrinsic") == 0)
525 specified_int = true;
528 if (strcmp (module_nature, "non_intrinsic") == 0)
529 specified_nonint = true;
532 gfc_error ("Module nature in USE statement at %C shall "
533 "be either INTRINSIC or NON_INTRINSIC");
540 /* Help output a better error message than "Unclassifiable
542 gfc_match (" %n", module_nature);
543 if (strcmp (module_nature, "intrinsic") == 0
544 || strcmp (module_nature, "non_intrinsic") == 0)
545 gfc_error ("\"::\" was expected after module nature at %C "
546 "but was not found");
552 m = gfc_match (" ::");
553 if (m == MATCH_YES &&
554 gfc_notify_std (GFC_STD_F2003, "Fortran 2003: "
555 "\"USE :: module\" at %C") == FAILURE)
560 m = gfc_match ("% ");
566 use_locus = gfc_current_locus;
568 m = gfc_match_name (module_name);
575 if (gfc_match_eos () == MATCH_YES)
577 if (gfc_match_char (',') != MATCH_YES)
580 if (gfc_match (" only :") == MATCH_YES)
583 if (gfc_match_eos () == MATCH_YES)
588 /* Get a new rename struct and add it to the rename list. */
589 new_use = gfc_get_use_rename ();
590 new_use->where = gfc_current_locus;
593 if (gfc_rename_list == NULL)
594 gfc_rename_list = new_use;
596 tail->next = new_use;
599 /* See what kind of interface we're dealing with. Assume it is
601 new_use->op = INTRINSIC_NONE;
602 if (gfc_match_generic_spec (&type, name, &op) == MATCH_ERROR)
607 case INTERFACE_NAMELESS:
608 gfc_error ("Missing generic specification in USE statement at %C");
611 case INTERFACE_USER_OP:
612 case INTERFACE_GENERIC:
613 m = gfc_match (" =>");
615 if (type == INTERFACE_USER_OP && m == MATCH_YES
616 && (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: Renaming "
617 "operators in USE statements at %C")
621 if (type == INTERFACE_USER_OP)
622 new_use->op = INTRINSIC_USER;
627 strcpy (new_use->use_name, name);
630 strcpy (new_use->local_name, name);
631 m = gfc_match_generic_spec (&type2, new_use->use_name, &op);
636 if (m == MATCH_ERROR)
644 strcpy (new_use->local_name, name);
646 m = gfc_match_generic_spec (&type2, new_use->use_name, &op);
651 if (m == MATCH_ERROR)
655 if (strcmp (new_use->use_name, module_name) == 0
656 || strcmp (new_use->local_name, module_name) == 0)
658 gfc_error ("The name '%s' at %C has already been used as "
659 "an external module name.", module_name);
664 case INTERFACE_INTRINSIC_OP:
672 if (gfc_match_eos () == MATCH_YES)
674 if (gfc_match_char (',') != MATCH_YES)
681 gfc_syntax_error (ST_USE);
689 /* Given a name and a number, inst, return the inst name
690 under which to load this symbol. Returns NULL if this
691 symbol shouldn't be loaded. If inst is zero, returns
692 the number of instances of this name. If interface is
693 true, a user-defined operator is sought, otherwise only
694 non-operators are sought. */
697 find_use_name_n (const char *name, int *inst, bool interface)
703 for (u = gfc_rename_list; u; u = u->next)
705 if (strcmp (u->use_name, name) != 0
706 || (u->op == INTRINSIC_USER && !interface)
707 || (u->op != INTRINSIC_USER && interface))
720 return only_flag ? NULL : name;
724 return (u->local_name[0] != '\0') ? u->local_name : name;
728 /* Given a name, return the name under which to load this symbol.
729 Returns NULL if this symbol shouldn't be loaded. */
732 find_use_name (const char *name, bool interface)
735 return find_use_name_n (name, &i, interface);
739 /* Given a real name, return the number of use names associated with it. */
742 number_use_names (const char *name, bool interface)
745 find_use_name_n (name, &i, interface);
750 /* Try to find the operator in the current list. */
752 static gfc_use_rename *
753 find_use_operator (gfc_intrinsic_op op)
757 for (u = gfc_rename_list; u; u = u->next)
765 /*****************************************************************/
767 /* The next couple of subroutines maintain a tree used to avoid a
768 brute-force search for a combination of true name and module name.
769 While symtree names, the name that a particular symbol is known by
770 can changed with USE statements, we still have to keep track of the
771 true names to generate the correct reference, and also avoid
772 loading the same real symbol twice in a program unit.
774 When we start reading, the true name tree is built and maintained
775 as symbols are read. The tree is searched as we load new symbols
776 to see if it already exists someplace in the namespace. */
778 typedef struct true_name
780 BBT_HEADER (true_name);
785 static true_name *true_name_root;
788 /* Compare two true_name structures. */
791 compare_true_names (void *_t1, void *_t2)
796 t1 = (true_name *) _t1;
797 t2 = (true_name *) _t2;
799 c = ((t1->sym->module > t2->sym->module)
800 - (t1->sym->module < t2->sym->module));
804 return strcmp (t1->sym->name, t2->sym->name);
808 /* Given a true name, search the true name tree to see if it exists
809 within the main namespace. */
812 find_true_name (const char *name, const char *module)
818 sym.name = gfc_get_string (name);
820 sym.module = gfc_get_string (module);
828 c = compare_true_names ((void *) (&t), (void *) p);
832 p = (c < 0) ? p->left : p->right;
839 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
842 add_true_name (gfc_symbol *sym)
846 t = XCNEW (true_name);
849 gfc_insert_bbt (&true_name_root, t, compare_true_names);
853 /* Recursive function to build the initial true name tree by
854 recursively traversing the current namespace. */
857 build_tnt (gfc_symtree *st)
862 build_tnt (st->left);
863 build_tnt (st->right);
865 if (find_true_name (st->n.sym->name, st->n.sym->module) != NULL)
868 add_true_name (st->n.sym);
872 /* Initialize the true name tree with the current namespace. */
875 init_true_name_tree (void)
877 true_name_root = NULL;
878 build_tnt (gfc_current_ns->sym_root);
882 /* Recursively free a true name tree node. */
885 free_true_name (true_name *t)
889 free_true_name (t->left);
890 free_true_name (t->right);
896 /*****************************************************************/
898 /* Module reading and writing. */
902 ATOM_NAME, ATOM_LPAREN, ATOM_RPAREN, ATOM_INTEGER, ATOM_STRING
906 static atom_type last_atom;
909 /* The name buffer must be at least as long as a symbol name. Right
910 now it's not clear how we're going to store numeric constants--
911 probably as a hexadecimal string, since this will allow the exact
912 number to be preserved (this can't be done by a decimal
913 representation). Worry about that later. TODO! */
915 #define MAX_ATOM_SIZE 100
918 static char *atom_string, atom_name[MAX_ATOM_SIZE];
921 /* Report problems with a module. Error reporting is not very
922 elaborate, since this sorts of errors shouldn't really happen.
923 This subroutine never returns. */
925 static void bad_module (const char *) ATTRIBUTE_NORETURN;
928 bad_module (const char *msgid)
935 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
936 module_name, module_line, module_column, msgid);
939 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
940 module_name, module_line, module_column, msgid);
943 gfc_fatal_error ("Module %s at line %d column %d: %s",
944 module_name, module_line, module_column, msgid);
950 /* Set the module's input pointer. */
953 set_module_locus (module_locus *m)
955 module_column = m->column;
956 module_line = m->line;
957 fsetpos (module_fp, &m->pos);
961 /* Get the module's input pointer so that we can restore it later. */
964 get_module_locus (module_locus *m)
966 m->column = module_column;
967 m->line = module_line;
968 fgetpos (module_fp, &m->pos);
972 /* Get the next character in the module, updating our reckoning of
980 c = getc (module_fp);
983 bad_module ("Unexpected EOF");
996 /* Parse a string constant. The delimiter is guaranteed to be a
1006 get_module_locus (&start);
1010 /* See how long the string is. */
1015 bad_module ("Unexpected end of module in string constant");
1033 set_module_locus (&start);
1035 atom_string = p = XCNEWVEC (char, len + 1);
1037 for (; len > 0; len--)
1041 module_char (); /* Guaranteed to be another \'. */
1045 module_char (); /* Terminating \'. */
1046 *p = '\0'; /* C-style string for debug purposes. */
1050 /* Parse a small integer. */
1053 parse_integer (int c)
1061 get_module_locus (&m);
1067 atom_int = 10 * atom_int + c - '0';
1068 if (atom_int > 99999999)
1069 bad_module ("Integer overflow");
1072 set_module_locus (&m);
1090 get_module_locus (&m);
1095 if (!ISALNUM (c) && c != '_' && c != '-')
1099 if (++len > GFC_MAX_SYMBOL_LEN)
1100 bad_module ("Name too long");
1105 fseek (module_fp, -1, SEEK_CUR);
1106 module_column = m.column + len - 1;
1113 /* Read the next atom in the module's input stream. */
1124 while (c == ' ' || c == '\r' || c == '\n');
1149 return ATOM_INTEGER;
1207 bad_module ("Bad name");
1214 /* Peek at the next atom on the input. */
1222 get_module_locus (&m);
1225 if (a == ATOM_STRING)
1226 gfc_free (atom_string);
1228 set_module_locus (&m);
1233 /* Read the next atom from the input, requiring that it be a
1237 require_atom (atom_type type)
1243 get_module_locus (&m);
1251 p = _("Expected name");
1254 p = _("Expected left parenthesis");
1257 p = _("Expected right parenthesis");
1260 p = _("Expected integer");
1263 p = _("Expected string");
1266 gfc_internal_error ("require_atom(): bad atom type required");
1269 set_module_locus (&m);
1275 /* Given a pointer to an mstring array, require that the current input
1276 be one of the strings in the array. We return the enum value. */
1279 find_enum (const mstring *m)
1283 i = gfc_string2code (m, atom_name);
1287 bad_module ("find_enum(): Enum not found");
1293 /**************** Module output subroutines ***************************/
1295 /* Output a character to a module file. */
1298 write_char (char out)
1300 if (putc (out, module_fp) == EOF)
1301 gfc_fatal_error ("Error writing modules file: %s", strerror (errno));
1303 /* Add this to our MD5. */
1304 md5_process_bytes (&out, sizeof (out), &ctx);
1316 /* Write an atom to a module. The line wrapping isn't perfect, but it
1317 should work most of the time. This isn't that big of a deal, since
1318 the file really isn't meant to be read by people anyway. */
1321 write_atom (atom_type atom, const void *v)
1331 p = (const char *) v;
1343 i = *((const int *) v);
1345 gfc_internal_error ("write_atom(): Writing negative integer");
1347 sprintf (buffer, "%d", i);
1352 gfc_internal_error ("write_atom(): Trying to write dab atom");
1356 if(p == NULL || *p == '\0')
1361 if (atom != ATOM_RPAREN)
1363 if (module_column + len > 72)
1368 if (last_atom != ATOM_LPAREN && module_column != 1)
1373 if (atom == ATOM_STRING)
1376 while (p != NULL && *p)
1378 if (atom == ATOM_STRING && *p == '\'')
1383 if (atom == ATOM_STRING)
1391 /***************** Mid-level I/O subroutines *****************/
1393 /* These subroutines let their caller read or write atoms without
1394 caring about which of the two is actually happening. This lets a
1395 subroutine concentrate on the actual format of the data being
1398 static void mio_expr (gfc_expr **);
1399 pointer_info *mio_symbol_ref (gfc_symbol **);
1400 pointer_info *mio_interface_rest (gfc_interface **);
1401 static void mio_symtree_ref (gfc_symtree **);
1403 /* Read or write an enumerated value. On writing, we return the input
1404 value for the convenience of callers. We avoid using an integer
1405 pointer because enums are sometimes inside bitfields. */
1408 mio_name (int t, const mstring *m)
1410 if (iomode == IO_OUTPUT)
1411 write_atom (ATOM_NAME, gfc_code2string (m, t));
1414 require_atom (ATOM_NAME);
1421 /* Specialization of mio_name. */
1423 #define DECL_MIO_NAME(TYPE) \
1424 static inline TYPE \
1425 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1427 return (TYPE) mio_name ((int) t, m); \
1429 #define MIO_NAME(TYPE) mio_name_##TYPE
1434 if (iomode == IO_OUTPUT)
1435 write_atom (ATOM_LPAREN, NULL);
1437 require_atom (ATOM_LPAREN);
1444 if (iomode == IO_OUTPUT)
1445 write_atom (ATOM_RPAREN, NULL);
1447 require_atom (ATOM_RPAREN);
1452 mio_integer (int *ip)
1454 if (iomode == IO_OUTPUT)
1455 write_atom (ATOM_INTEGER, ip);
1458 require_atom (ATOM_INTEGER);
1464 /* Read or write a gfc_intrinsic_op value. */
1467 mio_intrinsic_op (gfc_intrinsic_op* op)
1469 /* FIXME: Would be nicer to do this via the operators symbolic name. */
1470 if (iomode == IO_OUTPUT)
1472 int converted = (int) *op;
1473 write_atom (ATOM_INTEGER, &converted);
1477 require_atom (ATOM_INTEGER);
1478 *op = (gfc_intrinsic_op) atom_int;
1483 /* Read or write a character pointer that points to a string on the heap. */
1486 mio_allocated_string (const char *s)
1488 if (iomode == IO_OUTPUT)
1490 write_atom (ATOM_STRING, s);
1495 require_atom (ATOM_STRING);
1501 /* Functions for quoting and unquoting strings. */
1504 quote_string (const gfc_char_t *s, const size_t slength)
1506 const gfc_char_t *p;
1510 /* Calculate the length we'll need: a backslash takes two ("\\"),
1511 non-printable characters take 10 ("\Uxxxxxxxx") and others take 1. */
1512 for (p = s, i = 0; i < slength; p++, i++)
1516 else if (!gfc_wide_is_printable (*p))
1522 q = res = XCNEWVEC (char, len + 1);
1523 for (p = s, i = 0; i < slength; p++, i++)
1526 *q++ = '\\', *q++ = '\\';
1527 else if (!gfc_wide_is_printable (*p))
1529 sprintf (q, "\\U%08" HOST_WIDE_INT_PRINT "x",
1530 (unsigned HOST_WIDE_INT) *p);
1534 *q++ = (unsigned char) *p;
1542 unquote_string (const char *s)
1548 for (p = s, len = 0; *p; p++, len++)
1555 else if (p[1] == 'U')
1556 p += 9; /* That is a "\U????????". */
1558 gfc_internal_error ("unquote_string(): got bad string");
1561 res = gfc_get_wide_string (len + 1);
1562 for (i = 0, p = s; i < len; i++, p++)
1567 res[i] = (unsigned char) *p;
1568 else if (p[1] == '\\')
1570 res[i] = (unsigned char) '\\';
1575 /* We read the 8-digits hexadecimal constant that follows. */
1580 gcc_assert (p[1] == 'U');
1581 for (j = 0; j < 8; j++)
1584 gcc_assert (sscanf (&p[j+2], "%01x", &n) == 1);
1598 /* Read or write a character pointer that points to a wide string on the
1599 heap, performing quoting/unquoting of nonprintable characters using the
1600 form \U???????? (where each ? is a hexadecimal digit).
1601 Length is the length of the string, only known and used in output mode. */
1603 static const gfc_char_t *
1604 mio_allocated_wide_string (const gfc_char_t *s, const size_t length)
1606 if (iomode == IO_OUTPUT)
1608 char *quoted = quote_string (s, length);
1609 write_atom (ATOM_STRING, quoted);
1615 gfc_char_t *unquoted;
1617 require_atom (ATOM_STRING);
1618 unquoted = unquote_string (atom_string);
1619 gfc_free (atom_string);
1625 /* Read or write a string that is in static memory. */
1628 mio_pool_string (const char **stringp)
1630 /* TODO: one could write the string only once, and refer to it via a
1633 /* As a special case we have to deal with a NULL string. This
1634 happens for the 'module' member of 'gfc_symbol's that are not in a
1635 module. We read / write these as the empty string. */
1636 if (iomode == IO_OUTPUT)
1638 const char *p = *stringp == NULL ? "" : *stringp;
1639 write_atom (ATOM_STRING, p);
1643 require_atom (ATOM_STRING);
1644 *stringp = atom_string[0] == '\0' ? NULL : gfc_get_string (atom_string);
1645 gfc_free (atom_string);
1650 /* Read or write a string that is inside of some already-allocated
1654 mio_internal_string (char *string)
1656 if (iomode == IO_OUTPUT)
1657 write_atom (ATOM_STRING, string);
1660 require_atom (ATOM_STRING);
1661 strcpy (string, atom_string);
1662 gfc_free (atom_string);
1668 { AB_ALLOCATABLE, AB_DIMENSION, AB_EXTERNAL, AB_INTRINSIC, AB_OPTIONAL,
1669 AB_POINTER, AB_TARGET, AB_DUMMY, AB_RESULT, AB_DATA,
1670 AB_IN_NAMELIST, AB_IN_COMMON, AB_FUNCTION, AB_SUBROUTINE, AB_SEQUENCE,
1671 AB_ELEMENTAL, AB_PURE, AB_RECURSIVE, AB_GENERIC, AB_ALWAYS_EXPLICIT,
1672 AB_CRAY_POINTER, AB_CRAY_POINTEE, AB_THREADPRIVATE, AB_ALLOC_COMP,
1673 AB_POINTER_COMP, AB_PRIVATE_COMP, AB_VALUE, AB_VOLATILE, AB_PROTECTED,
1674 AB_IS_BIND_C, AB_IS_C_INTEROP, AB_IS_ISO_C, AB_ABSTRACT, AB_ZERO_COMP,
1675 AB_IS_CLASS, AB_PROCEDURE, AB_PROC_POINTER, AB_ASYNCHRONOUS
1679 static const mstring attr_bits[] =
1681 minit ("ALLOCATABLE", AB_ALLOCATABLE),
1682 minit ("ASYNCHRONOUS", AB_ASYNCHRONOUS),
1683 minit ("DIMENSION", AB_DIMENSION),
1684 minit ("EXTERNAL", AB_EXTERNAL),
1685 minit ("INTRINSIC", AB_INTRINSIC),
1686 minit ("OPTIONAL", AB_OPTIONAL),
1687 minit ("POINTER", AB_POINTER),
1688 minit ("VOLATILE", AB_VOLATILE),
1689 minit ("TARGET", AB_TARGET),
1690 minit ("THREADPRIVATE", AB_THREADPRIVATE),
1691 minit ("DUMMY", AB_DUMMY),
1692 minit ("RESULT", AB_RESULT),
1693 minit ("DATA", AB_DATA),
1694 minit ("IN_NAMELIST", AB_IN_NAMELIST),
1695 minit ("IN_COMMON", AB_IN_COMMON),
1696 minit ("FUNCTION", AB_FUNCTION),
1697 minit ("SUBROUTINE", AB_SUBROUTINE),
1698 minit ("SEQUENCE", AB_SEQUENCE),
1699 minit ("ELEMENTAL", AB_ELEMENTAL),
1700 minit ("PURE", AB_PURE),
1701 minit ("RECURSIVE", AB_RECURSIVE),
1702 minit ("GENERIC", AB_GENERIC),
1703 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT),
1704 minit ("CRAY_POINTER", AB_CRAY_POINTER),
1705 minit ("CRAY_POINTEE", AB_CRAY_POINTEE),
1706 minit ("IS_BIND_C", AB_IS_BIND_C),
1707 minit ("IS_C_INTEROP", AB_IS_C_INTEROP),
1708 minit ("IS_ISO_C", AB_IS_ISO_C),
1709 minit ("VALUE", AB_VALUE),
1710 minit ("ALLOC_COMP", AB_ALLOC_COMP),
1711 minit ("POINTER_COMP", AB_POINTER_COMP),
1712 minit ("PRIVATE_COMP", AB_PRIVATE_COMP),
1713 minit ("ZERO_COMP", AB_ZERO_COMP),
1714 minit ("PROTECTED", AB_PROTECTED),
1715 minit ("ABSTRACT", AB_ABSTRACT),
1716 minit ("IS_CLASS", AB_IS_CLASS),
1717 minit ("PROCEDURE", AB_PROCEDURE),
1718 minit ("PROC_POINTER", AB_PROC_POINTER),
1722 /* For binding attributes. */
1723 static const mstring binding_passing[] =
1726 minit ("NOPASS", 1),
1729 static const mstring binding_overriding[] =
1731 minit ("OVERRIDABLE", 0),
1732 minit ("NON_OVERRIDABLE", 1),
1733 minit ("DEFERRED", 2),
1736 static const mstring binding_generic[] =
1738 minit ("SPECIFIC", 0),
1739 minit ("GENERIC", 1),
1742 static const mstring binding_ppc[] =
1744 minit ("NO_PPC", 0),
1749 /* Specialization of mio_name. */
1750 DECL_MIO_NAME (ab_attribute)
1751 DECL_MIO_NAME (ar_type)
1752 DECL_MIO_NAME (array_type)
1754 DECL_MIO_NAME (expr_t)
1755 DECL_MIO_NAME (gfc_access)
1756 DECL_MIO_NAME (gfc_intrinsic_op)
1757 DECL_MIO_NAME (ifsrc)
1758 DECL_MIO_NAME (save_state)
1759 DECL_MIO_NAME (procedure_type)
1760 DECL_MIO_NAME (ref_type)
1761 DECL_MIO_NAME (sym_flavor)
1762 DECL_MIO_NAME (sym_intent)
1763 #undef DECL_MIO_NAME
1765 /* Symbol attributes are stored in list with the first three elements
1766 being the enumerated fields, while the remaining elements (if any)
1767 indicate the individual attribute bits. The access field is not
1768 saved-- it controls what symbols are exported when a module is
1772 mio_symbol_attribute (symbol_attribute *attr)
1775 unsigned ext_attr,extension_level;
1779 attr->flavor = MIO_NAME (sym_flavor) (attr->flavor, flavors);
1780 attr->intent = MIO_NAME (sym_intent) (attr->intent, intents);
1781 attr->proc = MIO_NAME (procedure_type) (attr->proc, procedures);
1782 attr->if_source = MIO_NAME (ifsrc) (attr->if_source, ifsrc_types);
1783 attr->save = MIO_NAME (save_state) (attr->save, save_status);
1785 ext_attr = attr->ext_attr;
1786 mio_integer ((int *) &ext_attr);
1787 attr->ext_attr = ext_attr;
1789 extension_level = attr->extension;
1790 mio_integer ((int *) &extension_level);
1791 attr->extension = extension_level;
1793 if (iomode == IO_OUTPUT)
1795 if (attr->allocatable)
1796 MIO_NAME (ab_attribute) (AB_ALLOCATABLE, attr_bits);
1797 if (attr->asynchronous)
1798 MIO_NAME (ab_attribute) (AB_ASYNCHRONOUS, attr_bits);
1799 if (attr->dimension)
1800 MIO_NAME (ab_attribute) (AB_DIMENSION, attr_bits);
1802 MIO_NAME (ab_attribute) (AB_EXTERNAL, attr_bits);
1803 if (attr->intrinsic)
1804 MIO_NAME (ab_attribute) (AB_INTRINSIC, attr_bits);
1806 MIO_NAME (ab_attribute) (AB_OPTIONAL, attr_bits);
1808 MIO_NAME (ab_attribute) (AB_POINTER, attr_bits);
1809 if (attr->is_protected)
1810 MIO_NAME (ab_attribute) (AB_PROTECTED, attr_bits);
1812 MIO_NAME (ab_attribute) (AB_VALUE, attr_bits);
1813 if (attr->volatile_)
1814 MIO_NAME (ab_attribute) (AB_VOLATILE, attr_bits);
1816 MIO_NAME (ab_attribute) (AB_TARGET, attr_bits);
1817 if (attr->threadprivate)
1818 MIO_NAME (ab_attribute) (AB_THREADPRIVATE, attr_bits);
1820 MIO_NAME (ab_attribute) (AB_DUMMY, attr_bits);
1822 MIO_NAME (ab_attribute) (AB_RESULT, attr_bits);
1823 /* We deliberately don't preserve the "entry" flag. */
1826 MIO_NAME (ab_attribute) (AB_DATA, attr_bits);
1827 if (attr->in_namelist)
1828 MIO_NAME (ab_attribute) (AB_IN_NAMELIST, attr_bits);
1829 if (attr->in_common)
1830 MIO_NAME (ab_attribute) (AB_IN_COMMON, attr_bits);
1833 MIO_NAME (ab_attribute) (AB_FUNCTION, attr_bits);
1834 if (attr->subroutine)
1835 MIO_NAME (ab_attribute) (AB_SUBROUTINE, attr_bits);
1837 MIO_NAME (ab_attribute) (AB_GENERIC, attr_bits);
1839 MIO_NAME (ab_attribute) (AB_ABSTRACT, attr_bits);
1842 MIO_NAME (ab_attribute) (AB_SEQUENCE, attr_bits);
1843 if (attr->elemental)
1844 MIO_NAME (ab_attribute) (AB_ELEMENTAL, attr_bits);
1846 MIO_NAME (ab_attribute) (AB_PURE, attr_bits);
1847 if (attr->recursive)
1848 MIO_NAME (ab_attribute) (AB_RECURSIVE, attr_bits);
1849 if (attr->always_explicit)
1850 MIO_NAME (ab_attribute) (AB_ALWAYS_EXPLICIT, attr_bits);
1851 if (attr->cray_pointer)
1852 MIO_NAME (ab_attribute) (AB_CRAY_POINTER, attr_bits);
1853 if (attr->cray_pointee)
1854 MIO_NAME (ab_attribute) (AB_CRAY_POINTEE, attr_bits);
1855 if (attr->is_bind_c)
1856 MIO_NAME(ab_attribute) (AB_IS_BIND_C, attr_bits);
1857 if (attr->is_c_interop)
1858 MIO_NAME(ab_attribute) (AB_IS_C_INTEROP, attr_bits);
1860 MIO_NAME(ab_attribute) (AB_IS_ISO_C, attr_bits);
1861 if (attr->alloc_comp)
1862 MIO_NAME (ab_attribute) (AB_ALLOC_COMP, attr_bits);
1863 if (attr->pointer_comp)
1864 MIO_NAME (ab_attribute) (AB_POINTER_COMP, attr_bits);
1865 if (attr->private_comp)
1866 MIO_NAME (ab_attribute) (AB_PRIVATE_COMP, attr_bits);
1867 if (attr->zero_comp)
1868 MIO_NAME (ab_attribute) (AB_ZERO_COMP, attr_bits);
1870 MIO_NAME (ab_attribute) (AB_IS_CLASS, attr_bits);
1871 if (attr->procedure)
1872 MIO_NAME (ab_attribute) (AB_PROCEDURE, attr_bits);
1873 if (attr->proc_pointer)
1874 MIO_NAME (ab_attribute) (AB_PROC_POINTER, attr_bits);
1884 if (t == ATOM_RPAREN)
1887 bad_module ("Expected attribute bit name");
1889 switch ((ab_attribute) find_enum (attr_bits))
1891 case AB_ALLOCATABLE:
1892 attr->allocatable = 1;
1894 case AB_ASYNCHRONOUS:
1895 attr->asynchronous = 1;
1898 attr->dimension = 1;
1904 attr->intrinsic = 1;
1913 attr->is_protected = 1;
1919 attr->volatile_ = 1;
1924 case AB_THREADPRIVATE:
1925 attr->threadprivate = 1;
1936 case AB_IN_NAMELIST:
1937 attr->in_namelist = 1;
1940 attr->in_common = 1;
1946 attr->subroutine = 1;
1958 attr->elemental = 1;
1964 attr->recursive = 1;
1966 case AB_ALWAYS_EXPLICIT:
1967 attr->always_explicit = 1;
1969 case AB_CRAY_POINTER:
1970 attr->cray_pointer = 1;
1972 case AB_CRAY_POINTEE:
1973 attr->cray_pointee = 1;
1976 attr->is_bind_c = 1;
1978 case AB_IS_C_INTEROP:
1979 attr->is_c_interop = 1;
1985 attr->alloc_comp = 1;
1987 case AB_POINTER_COMP:
1988 attr->pointer_comp = 1;
1990 case AB_PRIVATE_COMP:
1991 attr->private_comp = 1;
1994 attr->zero_comp = 1;
2000 attr->procedure = 1;
2002 case AB_PROC_POINTER:
2003 attr->proc_pointer = 1;
2011 static const mstring bt_types[] = {
2012 minit ("INTEGER", BT_INTEGER),
2013 minit ("REAL", BT_REAL),
2014 minit ("COMPLEX", BT_COMPLEX),
2015 minit ("LOGICAL", BT_LOGICAL),
2016 minit ("CHARACTER", BT_CHARACTER),
2017 minit ("DERIVED", BT_DERIVED),
2018 minit ("CLASS", BT_CLASS),
2019 minit ("PROCEDURE", BT_PROCEDURE),
2020 minit ("UNKNOWN", BT_UNKNOWN),
2021 minit ("VOID", BT_VOID),
2027 mio_charlen (gfc_charlen **clp)
2033 if (iomode == IO_OUTPUT)
2037 mio_expr (&cl->length);
2041 if (peek_atom () != ATOM_RPAREN)
2043 cl = gfc_new_charlen (gfc_current_ns, NULL);
2044 mio_expr (&cl->length);
2053 /* See if a name is a generated name. */
2056 check_unique_name (const char *name)
2058 return *name == '@';
2063 mio_typespec (gfc_typespec *ts)
2067 ts->type = MIO_NAME (bt) (ts->type, bt_types);
2069 if (ts->type != BT_DERIVED && ts->type != BT_CLASS)
2070 mio_integer (&ts->kind);
2072 mio_symbol_ref (&ts->u.derived);
2074 /* Add info for C interop and is_iso_c. */
2075 mio_integer (&ts->is_c_interop);
2076 mio_integer (&ts->is_iso_c);
2078 /* If the typespec is for an identifier either from iso_c_binding, or
2079 a constant that was initialized to an identifier from it, use the
2080 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
2082 ts->f90_type = MIO_NAME (bt) (ts->f90_type, bt_types);
2084 ts->f90_type = MIO_NAME (bt) (ts->type, bt_types);
2086 if (ts->type != BT_CHARACTER)
2088 /* ts->u.cl is only valid for BT_CHARACTER. */
2093 mio_charlen (&ts->u.cl);
2099 static const mstring array_spec_types[] = {
2100 minit ("EXPLICIT", AS_EXPLICIT),
2101 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE),
2102 minit ("DEFERRED", AS_DEFERRED),
2103 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE),
2109 mio_array_spec (gfc_array_spec **asp)
2116 if (iomode == IO_OUTPUT)
2124 if (peek_atom () == ATOM_RPAREN)
2130 *asp = as = gfc_get_array_spec ();
2133 mio_integer (&as->rank);
2134 as->type = MIO_NAME (array_type) (as->type, array_spec_types);
2136 for (i = 0; i < as->rank; i++)
2138 mio_expr (&as->lower[i]);
2139 mio_expr (&as->upper[i]);
2147 /* Given a pointer to an array reference structure (which lives in a
2148 gfc_ref structure), find the corresponding array specification
2149 structure. Storing the pointer in the ref structure doesn't quite
2150 work when loading from a module. Generating code for an array
2151 reference also needs more information than just the array spec. */
2153 static const mstring array_ref_types[] = {
2154 minit ("FULL", AR_FULL),
2155 minit ("ELEMENT", AR_ELEMENT),
2156 minit ("SECTION", AR_SECTION),
2162 mio_array_ref (gfc_array_ref *ar)
2167 ar->type = MIO_NAME (ar_type) (ar->type, array_ref_types);
2168 mio_integer (&ar->dimen);
2176 for (i = 0; i < ar->dimen; i++)
2177 mio_expr (&ar->start[i]);
2182 for (i = 0; i < ar->dimen; i++)
2184 mio_expr (&ar->start[i]);
2185 mio_expr (&ar->end[i]);
2186 mio_expr (&ar->stride[i]);
2192 gfc_internal_error ("mio_array_ref(): Unknown array ref");
2195 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
2196 we can't call mio_integer directly. Instead loop over each element
2197 and cast it to/from an integer. */
2198 if (iomode == IO_OUTPUT)
2200 for (i = 0; i < ar->dimen; i++)
2202 int tmp = (int)ar->dimen_type[i];
2203 write_atom (ATOM_INTEGER, &tmp);
2208 for (i = 0; i < ar->dimen; i++)
2210 require_atom (ATOM_INTEGER);
2211 ar->dimen_type[i] = (enum gfc_array_ref_dimen_type) atom_int;
2215 if (iomode == IO_INPUT)
2217 ar->where = gfc_current_locus;
2219 for (i = 0; i < ar->dimen; i++)
2220 ar->c_where[i] = gfc_current_locus;
2227 /* Saves or restores a pointer. The pointer is converted back and
2228 forth from an integer. We return the pointer_info pointer so that
2229 the caller can take additional action based on the pointer type. */
2231 static pointer_info *
2232 mio_pointer_ref (void *gp)
2236 if (iomode == IO_OUTPUT)
2238 p = get_pointer (*((char **) gp));
2239 write_atom (ATOM_INTEGER, &p->integer);
2243 require_atom (ATOM_INTEGER);
2244 p = add_fixup (atom_int, gp);
2251 /* Save and load references to components that occur within
2252 expressions. We have to describe these references by a number and
2253 by name. The number is necessary for forward references during
2254 reading, and the name is necessary if the symbol already exists in
2255 the namespace and is not loaded again. */
2258 mio_component_ref (gfc_component **cp, gfc_symbol *sym)
2260 char name[GFC_MAX_SYMBOL_LEN + 1];
2264 p = mio_pointer_ref (cp);
2265 if (p->type == P_UNKNOWN)
2266 p->type = P_COMPONENT;
2268 if (iomode == IO_OUTPUT)
2269 mio_pool_string (&(*cp)->name);
2272 mio_internal_string (name);
2274 /* It can happen that a component reference can be read before the
2275 associated derived type symbol has been loaded. Return now and
2276 wait for a later iteration of load_needed. */
2280 if (sym->components != NULL && p->u.pointer == NULL)
2282 /* Symbol already loaded, so search by name. */
2283 for (q = sym->components; q; q = q->next)
2284 if (strcmp (q->name, name) == 0)
2288 gfc_internal_error ("mio_component_ref(): Component not found");
2290 associate_integer_pointer (p, q);
2293 /* Make sure this symbol will eventually be loaded. */
2294 p = find_pointer2 (sym);
2295 if (p->u.rsym.state == UNUSED)
2296 p->u.rsym.state = NEEDED;
2301 static void mio_namespace_ref (gfc_namespace **nsp);
2302 static void mio_formal_arglist (gfc_formal_arglist **formal);
2303 static void mio_typebound_proc (gfc_typebound_proc** proc);
2306 mio_component (gfc_component *c)
2310 gfc_formal_arglist *formal;
2314 if (iomode == IO_OUTPUT)
2316 p = get_pointer (c);
2317 mio_integer (&p->integer);
2322 p = get_integer (n);
2323 associate_integer_pointer (p, c);
2326 if (p->type == P_UNKNOWN)
2327 p->type = P_COMPONENT;
2329 mio_pool_string (&c->name);
2330 mio_typespec (&c->ts);
2331 mio_array_spec (&c->as);
2333 mio_symbol_attribute (&c->attr);
2334 c->attr.access = MIO_NAME (gfc_access) (c->attr.access, access_types);
2336 mio_expr (&c->initializer);
2338 if (c->attr.proc_pointer)
2340 if (iomode == IO_OUTPUT)
2343 while (formal && !formal->sym)
2344 formal = formal->next;
2347 mio_namespace_ref (&formal->sym->ns);
2349 mio_namespace_ref (&c->formal_ns);
2353 mio_namespace_ref (&c->formal_ns);
2354 /* TODO: if (c->formal_ns)
2356 c->formal_ns->proc_name = c;
2361 mio_formal_arglist (&c->formal);
2363 mio_typebound_proc (&c->tb);
2371 mio_component_list (gfc_component **cp)
2373 gfc_component *c, *tail;
2377 if (iomode == IO_OUTPUT)
2379 for (c = *cp; c; c = c->next)
2389 if (peek_atom () == ATOM_RPAREN)
2392 c = gfc_get_component ();
2409 mio_actual_arg (gfc_actual_arglist *a)
2412 mio_pool_string (&a->name);
2413 mio_expr (&a->expr);
2419 mio_actual_arglist (gfc_actual_arglist **ap)
2421 gfc_actual_arglist *a, *tail;
2425 if (iomode == IO_OUTPUT)
2427 for (a = *ap; a; a = a->next)
2437 if (peek_atom () != ATOM_LPAREN)
2440 a = gfc_get_actual_arglist ();
2456 /* Read and write formal argument lists. */
2459 mio_formal_arglist (gfc_formal_arglist **formal)
2461 gfc_formal_arglist *f, *tail;
2465 if (iomode == IO_OUTPUT)
2467 for (f = *formal; f; f = f->next)
2468 mio_symbol_ref (&f->sym);
2472 *formal = tail = NULL;
2474 while (peek_atom () != ATOM_RPAREN)
2476 f = gfc_get_formal_arglist ();
2477 mio_symbol_ref (&f->sym);
2479 if (*formal == NULL)
2492 /* Save or restore a reference to a symbol node. */
2495 mio_symbol_ref (gfc_symbol **symp)
2499 p = mio_pointer_ref (symp);
2500 if (p->type == P_UNKNOWN)
2503 if (iomode == IO_OUTPUT)
2505 if (p->u.wsym.state == UNREFERENCED)
2506 p->u.wsym.state = NEEDS_WRITE;
2510 if (p->u.rsym.state == UNUSED)
2511 p->u.rsym.state = NEEDED;
2517 /* Save or restore a reference to a symtree node. */
2520 mio_symtree_ref (gfc_symtree **stp)
2525 if (iomode == IO_OUTPUT)
2526 mio_symbol_ref (&(*stp)->n.sym);
2529 require_atom (ATOM_INTEGER);
2530 p = get_integer (atom_int);
2532 /* An unused equivalence member; make a symbol and a symtree
2534 if (in_load_equiv && p->u.rsym.symtree == NULL)
2536 /* Since this is not used, it must have a unique name. */
2537 p->u.rsym.symtree = gfc_get_unique_symtree (gfc_current_ns);
2539 /* Make the symbol. */
2540 if (p->u.rsym.sym == NULL)
2542 p->u.rsym.sym = gfc_new_symbol (p->u.rsym.true_name,
2544 p->u.rsym.sym->module = gfc_get_string (p->u.rsym.module);
2547 p->u.rsym.symtree->n.sym = p->u.rsym.sym;
2548 p->u.rsym.symtree->n.sym->refs++;
2549 p->u.rsym.referenced = 1;
2551 /* If the symbol is PRIVATE and in COMMON, load_commons will
2552 generate a fixup symbol, which must be associated. */
2554 resolve_fixups (p->fixup, p->u.rsym.sym);
2558 if (p->type == P_UNKNOWN)
2561 if (p->u.rsym.state == UNUSED)
2562 p->u.rsym.state = NEEDED;
2564 if (p->u.rsym.symtree != NULL)
2566 *stp = p->u.rsym.symtree;
2570 f = XCNEW (fixup_t);
2572 f->next = p->u.rsym.stfixup;
2573 p->u.rsym.stfixup = f;
2575 f->pointer = (void **) stp;
2582 mio_iterator (gfc_iterator **ip)
2588 if (iomode == IO_OUTPUT)
2595 if (peek_atom () == ATOM_RPAREN)
2601 *ip = gfc_get_iterator ();
2606 mio_expr (&iter->var);
2607 mio_expr (&iter->start);
2608 mio_expr (&iter->end);
2609 mio_expr (&iter->step);
2617 mio_constructor (gfc_constructor **cp)
2619 gfc_constructor *c, *tail;
2623 if (iomode == IO_OUTPUT)
2625 for (c = *cp; c; c = c->next)
2628 mio_expr (&c->expr);
2629 mio_iterator (&c->iterator);
2638 while (peek_atom () != ATOM_RPAREN)
2640 c = gfc_get_constructor ();
2650 mio_expr (&c->expr);
2651 mio_iterator (&c->iterator);
2660 static const mstring ref_types[] = {
2661 minit ("ARRAY", REF_ARRAY),
2662 minit ("COMPONENT", REF_COMPONENT),
2663 minit ("SUBSTRING", REF_SUBSTRING),
2669 mio_ref (gfc_ref **rp)
2676 r->type = MIO_NAME (ref_type) (r->type, ref_types);
2681 mio_array_ref (&r->u.ar);
2685 mio_symbol_ref (&r->u.c.sym);
2686 mio_component_ref (&r->u.c.component, r->u.c.sym);
2690 mio_expr (&r->u.ss.start);
2691 mio_expr (&r->u.ss.end);
2692 mio_charlen (&r->u.ss.length);
2701 mio_ref_list (gfc_ref **rp)
2703 gfc_ref *ref, *head, *tail;
2707 if (iomode == IO_OUTPUT)
2709 for (ref = *rp; ref; ref = ref->next)
2716 while (peek_atom () != ATOM_RPAREN)
2719 head = tail = gfc_get_ref ();
2722 tail->next = gfc_get_ref ();
2736 /* Read and write an integer value. */
2739 mio_gmp_integer (mpz_t *integer)
2743 if (iomode == IO_INPUT)
2745 if (parse_atom () != ATOM_STRING)
2746 bad_module ("Expected integer string");
2748 mpz_init (*integer);
2749 if (mpz_set_str (*integer, atom_string, 10))
2750 bad_module ("Error converting integer");
2752 gfc_free (atom_string);
2756 p = mpz_get_str (NULL, 10, *integer);
2757 write_atom (ATOM_STRING, p);
2764 mio_gmp_real (mpfr_t *real)
2769 if (iomode == IO_INPUT)
2771 if (parse_atom () != ATOM_STRING)
2772 bad_module ("Expected real string");
2775 mpfr_set_str (*real, atom_string, 16, GFC_RND_MODE);
2776 gfc_free (atom_string);
2780 p = mpfr_get_str (NULL, &exponent, 16, 0, *real, GFC_RND_MODE);
2782 if (mpfr_nan_p (*real) || mpfr_inf_p (*real))
2784 write_atom (ATOM_STRING, p);
2789 atom_string = XCNEWVEC (char, strlen (p) + 20);
2791 sprintf (atom_string, "0.%s@%ld", p, exponent);
2793 /* Fix negative numbers. */
2794 if (atom_string[2] == '-')
2796 atom_string[0] = '-';
2797 atom_string[1] = '0';
2798 atom_string[2] = '.';
2801 write_atom (ATOM_STRING, atom_string);
2803 gfc_free (atom_string);
2809 /* Save and restore the shape of an array constructor. */
2812 mio_shape (mpz_t **pshape, int rank)
2818 /* A NULL shape is represented by (). */
2821 if (iomode == IO_OUTPUT)
2833 if (t == ATOM_RPAREN)
2840 shape = gfc_get_shape (rank);
2844 for (n = 0; n < rank; n++)
2845 mio_gmp_integer (&shape[n]);
2851 static const mstring expr_types[] = {
2852 minit ("OP", EXPR_OP),
2853 minit ("FUNCTION", EXPR_FUNCTION),
2854 minit ("CONSTANT", EXPR_CONSTANT),
2855 minit ("VARIABLE", EXPR_VARIABLE),
2856 minit ("SUBSTRING", EXPR_SUBSTRING),
2857 minit ("STRUCTURE", EXPR_STRUCTURE),
2858 minit ("ARRAY", EXPR_ARRAY),
2859 minit ("NULL", EXPR_NULL),
2860 minit ("COMPCALL", EXPR_COMPCALL),
2864 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2865 generic operators, not in expressions. INTRINSIC_USER is also
2866 replaced by the correct function name by the time we see it. */
2868 static const mstring intrinsics[] =
2870 minit ("UPLUS", INTRINSIC_UPLUS),
2871 minit ("UMINUS", INTRINSIC_UMINUS),
2872 minit ("PLUS", INTRINSIC_PLUS),
2873 minit ("MINUS", INTRINSIC_MINUS),
2874 minit ("TIMES", INTRINSIC_TIMES),
2875 minit ("DIVIDE", INTRINSIC_DIVIDE),
2876 minit ("POWER", INTRINSIC_POWER),
2877 minit ("CONCAT", INTRINSIC_CONCAT),
2878 minit ("AND", INTRINSIC_AND),
2879 minit ("OR", INTRINSIC_OR),
2880 minit ("EQV", INTRINSIC_EQV),
2881 minit ("NEQV", INTRINSIC_NEQV),
2882 minit ("EQ_SIGN", INTRINSIC_EQ),
2883 minit ("EQ", INTRINSIC_EQ_OS),
2884 minit ("NE_SIGN", INTRINSIC_NE),
2885 minit ("NE", INTRINSIC_NE_OS),
2886 minit ("GT_SIGN", INTRINSIC_GT),
2887 minit ("GT", INTRINSIC_GT_OS),
2888 minit ("GE_SIGN", INTRINSIC_GE),
2889 minit ("GE", INTRINSIC_GE_OS),
2890 minit ("LT_SIGN", INTRINSIC_LT),
2891 minit ("LT", INTRINSIC_LT_OS),
2892 minit ("LE_SIGN", INTRINSIC_LE),
2893 minit ("LE", INTRINSIC_LE_OS),
2894 minit ("NOT", INTRINSIC_NOT),
2895 minit ("PARENTHESES", INTRINSIC_PARENTHESES),
2900 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2903 fix_mio_expr (gfc_expr *e)
2905 gfc_symtree *ns_st = NULL;
2908 if (iomode != IO_OUTPUT)
2913 /* If this is a symtree for a symbol that came from a contained module
2914 namespace, it has a unique name and we should look in the current
2915 namespace to see if the required, non-contained symbol is available
2916 yet. If so, the latter should be written. */
2917 if (e->symtree->n.sym && check_unique_name (e->symtree->name))
2918 ns_st = gfc_find_symtree (gfc_current_ns->sym_root,
2919 e->symtree->n.sym->name);
2921 /* On the other hand, if the existing symbol is the module name or the
2922 new symbol is a dummy argument, do not do the promotion. */
2923 if (ns_st && ns_st->n.sym
2924 && ns_st->n.sym->attr.flavor != FL_MODULE
2925 && !e->symtree->n.sym->attr.dummy)
2928 else if (e->expr_type == EXPR_FUNCTION && e->value.function.name)
2930 /* In some circumstances, a function used in an initialization
2931 expression, in one use associated module, can fail to be
2932 coupled to its symtree when used in a specification
2933 expression in another module. */
2934 fname = e->value.function.esym ? e->value.function.esym->name
2935 : e->value.function.isym->name;
2936 e->symtree = gfc_find_symtree (gfc_current_ns->sym_root, fname);
2941 /* Read and write expressions. The form "()" is allowed to indicate a
2945 mio_expr (gfc_expr **ep)
2953 if (iomode == IO_OUTPUT)
2962 MIO_NAME (expr_t) (e->expr_type, expr_types);
2967 if (t == ATOM_RPAREN)
2974 bad_module ("Expected expression type");
2976 e = *ep = gfc_get_expr ();
2977 e->where = gfc_current_locus;
2978 e->expr_type = (expr_t) find_enum (expr_types);
2981 mio_typespec (&e->ts);
2982 mio_integer (&e->rank);
2986 switch (e->expr_type)
2990 = MIO_NAME (gfc_intrinsic_op) (e->value.op.op, intrinsics);
2992 switch (e->value.op.op)
2994 case INTRINSIC_UPLUS:
2995 case INTRINSIC_UMINUS:
2997 case INTRINSIC_PARENTHESES:
2998 mio_expr (&e->value.op.op1);
3001 case INTRINSIC_PLUS:
3002 case INTRINSIC_MINUS:
3003 case INTRINSIC_TIMES:
3004 case INTRINSIC_DIVIDE:
3005 case INTRINSIC_POWER:
3006 case INTRINSIC_CONCAT:
3010 case INTRINSIC_NEQV:
3012 case INTRINSIC_EQ_OS:
3014 case INTRINSIC_NE_OS:
3016 case INTRINSIC_GT_OS:
3018 case INTRINSIC_GE_OS:
3020 case INTRINSIC_LT_OS:
3022 case INTRINSIC_LE_OS:
3023 mio_expr (&e->value.op.op1);
3024 mio_expr (&e->value.op.op2);
3028 bad_module ("Bad operator");
3034 mio_symtree_ref (&e->symtree);
3035 mio_actual_arglist (&e->value.function.actual);
3037 if (iomode == IO_OUTPUT)
3039 e->value.function.name
3040 = mio_allocated_string (e->value.function.name);
3041 flag = e->value.function.esym != NULL;
3042 mio_integer (&flag);
3044 mio_symbol_ref (&e->value.function.esym);
3046 write_atom (ATOM_STRING, e->value.function.isym->name);
3050 require_atom (ATOM_STRING);
3051 e->value.function.name = gfc_get_string (atom_string);
3052 gfc_free (atom_string);
3054 mio_integer (&flag);
3056 mio_symbol_ref (&e->value.function.esym);
3059 require_atom (ATOM_STRING);
3060 e->value.function.isym = gfc_find_function (atom_string);
3061 gfc_free (atom_string);
3068 mio_symtree_ref (&e->symtree);
3069 mio_ref_list (&e->ref);
3072 case EXPR_SUBSTRING:
3073 e->value.character.string
3074 = CONST_CAST (gfc_char_t *,
3075 mio_allocated_wide_string (e->value.character.string,
3076 e->value.character.length));
3077 mio_ref_list (&e->ref);
3080 case EXPR_STRUCTURE:
3082 mio_constructor (&e->value.constructor);
3083 mio_shape (&e->shape, e->rank);
3090 mio_gmp_integer (&e->value.integer);
3094 gfc_set_model_kind (e->ts.kind);
3095 mio_gmp_real (&e->value.real);
3099 gfc_set_model_kind (e->ts.kind);
3100 mio_gmp_real (&mpc_realref (e->value.complex));
3101 mio_gmp_real (&mpc_imagref (e->value.complex));
3105 mio_integer (&e->value.logical);
3109 mio_integer (&e->value.character.length);
3110 e->value.character.string
3111 = CONST_CAST (gfc_char_t *,
3112 mio_allocated_wide_string (e->value.character.string,
3113 e->value.character.length));
3117 bad_module ("Bad type in constant expression");
3135 /* Read and write namelists. */
3138 mio_namelist (gfc_symbol *sym)
3140 gfc_namelist *n, *m;
3141 const char *check_name;
3145 if (iomode == IO_OUTPUT)
3147 for (n = sym->namelist; n; n = n->next)
3148 mio_symbol_ref (&n->sym);
3152 /* This departure from the standard is flagged as an error.
3153 It does, in fact, work correctly. TODO: Allow it
3155 if (sym->attr.flavor == FL_NAMELIST)
3157 check_name = find_use_name (sym->name, false);
3158 if (check_name && strcmp (check_name, sym->name) != 0)
3159 gfc_error ("Namelist %s cannot be renamed by USE "
3160 "association to %s", sym->name, check_name);
3164 while (peek_atom () != ATOM_RPAREN)
3166 n = gfc_get_namelist ();
3167 mio_symbol_ref (&n->sym);
3169 if (sym->namelist == NULL)
3176 sym->namelist_tail = m;
3183 /* Save/restore lists of gfc_interface structures. When loading an
3184 interface, we are really appending to the existing list of
3185 interfaces. Checking for duplicate and ambiguous interfaces has to
3186 be done later when all symbols have been loaded. */
3189 mio_interface_rest (gfc_interface **ip)
3191 gfc_interface *tail, *p;
3192 pointer_info *pi = NULL;
3194 if (iomode == IO_OUTPUT)
3197 for (p = *ip; p; p = p->next)
3198 mio_symbol_ref (&p->sym);
3213 if (peek_atom () == ATOM_RPAREN)
3216 p = gfc_get_interface ();
3217 p->where = gfc_current_locus;
3218 pi = mio_symbol_ref (&p->sym);
3234 /* Save/restore a nameless operator interface. */
3237 mio_interface (gfc_interface **ip)
3240 mio_interface_rest (ip);
3244 /* Save/restore a named operator interface. */
3247 mio_symbol_interface (const char **name, const char **module,
3251 mio_pool_string (name);
3252 mio_pool_string (module);
3253 mio_interface_rest (ip);
3258 mio_namespace_ref (gfc_namespace **nsp)
3263 p = mio_pointer_ref (nsp);
3265 if (p->type == P_UNKNOWN)
3266 p->type = P_NAMESPACE;
3268 if (iomode == IO_INPUT && p->integer != 0)
3270 ns = (gfc_namespace *) p->u.pointer;
3273 ns = gfc_get_namespace (NULL, 0);
3274 associate_integer_pointer (p, ns);
3282 /* Save/restore the f2k_derived namespace of a derived-type symbol. */
3284 static gfc_namespace* current_f2k_derived;
3287 mio_typebound_proc (gfc_typebound_proc** proc)
3290 int overriding_flag;
3292 if (iomode == IO_INPUT)
3294 *proc = gfc_get_typebound_proc ();
3295 (*proc)->where = gfc_current_locus;
3301 (*proc)->access = MIO_NAME (gfc_access) ((*proc)->access, access_types);
3303 /* IO the NON_OVERRIDABLE/DEFERRED combination. */
3304 gcc_assert (!((*proc)->deferred && (*proc)->non_overridable));
3305 overriding_flag = ((*proc)->deferred << 1) | (*proc)->non_overridable;
3306 overriding_flag = mio_name (overriding_flag, binding_overriding);
3307 (*proc)->deferred = ((overriding_flag & 2) != 0);
3308 (*proc)->non_overridable = ((overriding_flag & 1) != 0);
3309 gcc_assert (!((*proc)->deferred && (*proc)->non_overridable));
3311 (*proc)->nopass = mio_name ((*proc)->nopass, binding_passing);
3312 (*proc)->is_generic = mio_name ((*proc)->is_generic, binding_generic);
3313 (*proc)->ppc = mio_name((*proc)->ppc, binding_ppc);
3315 mio_pool_string (&((*proc)->pass_arg));
3317 flag = (int) (*proc)->pass_arg_num;
3318 mio_integer (&flag);
3319 (*proc)->pass_arg_num = (unsigned) flag;
3321 if ((*proc)->is_generic)
3327 if (iomode == IO_OUTPUT)
3328 for (g = (*proc)->u.generic; g; g = g->next)
3329 mio_allocated_string (g->specific_st->name);
3332 (*proc)->u.generic = NULL;
3333 while (peek_atom () != ATOM_RPAREN)
3335 gfc_symtree** sym_root;
3337 g = gfc_get_tbp_generic ();
3340 require_atom (ATOM_STRING);
3341 sym_root = ¤t_f2k_derived->tb_sym_root;
3342 g->specific_st = gfc_get_tbp_symtree (sym_root, atom_string);
3343 gfc_free (atom_string);
3345 g->next = (*proc)->u.generic;
3346 (*proc)->u.generic = g;
3352 else if (!(*proc)->ppc)
3353 mio_symtree_ref (&(*proc)->u.specific);
3358 /* Walker-callback function for this purpose. */
3360 mio_typebound_symtree (gfc_symtree* st)
3362 if (iomode == IO_OUTPUT && !st->n.tb)
3365 if (iomode == IO_OUTPUT)
3368 mio_allocated_string (st->name);
3370 /* For IO_INPUT, the above is done in mio_f2k_derived. */
3372 mio_typebound_proc (&st->n.tb);
3376 /* IO a full symtree (in all depth). */
3378 mio_full_typebound_tree (gfc_symtree** root)
3382 if (iomode == IO_OUTPUT)
3383 gfc_traverse_symtree (*root, &mio_typebound_symtree);
3386 while (peek_atom () == ATOM_LPAREN)
3392 require_atom (ATOM_STRING);
3393 st = gfc_get_tbp_symtree (root, atom_string);
3394 gfc_free (atom_string);
3396 mio_typebound_symtree (st);
3404 mio_finalizer (gfc_finalizer **f)
3406 if (iomode == IO_OUTPUT)
3409 gcc_assert ((*f)->proc_tree); /* Should already be resolved. */
3410 mio_symtree_ref (&(*f)->proc_tree);
3414 *f = gfc_get_finalizer ();
3415 (*f)->where = gfc_current_locus; /* Value should not matter. */
3418 mio_symtree_ref (&(*f)->proc_tree);
3419 (*f)->proc_sym = NULL;
3424 mio_f2k_derived (gfc_namespace *f2k)
3426 current_f2k_derived = f2k;
3428 /* Handle the list of finalizer procedures. */
3430 if (iomode == IO_OUTPUT)
3433 for (f = f2k->finalizers; f; f = f->next)
3438 f2k->finalizers = NULL;
3439 while (peek_atom () != ATOM_RPAREN)
3441 gfc_finalizer *cur = NULL;
3442 mio_finalizer (&cur);
3443 cur->next = f2k->finalizers;
3444 f2k->finalizers = cur;
3449 /* Handle type-bound procedures. */
3450 mio_full_typebound_tree (&f2k->tb_sym_root);
3452 /* Type-bound user operators. */
3453 mio_full_typebound_tree (&f2k->tb_uop_root);
3455 /* Type-bound intrinsic operators. */
3457 if (iomode == IO_OUTPUT)
3460 for (op = GFC_INTRINSIC_BEGIN; op != GFC_INTRINSIC_END; ++op)
3462 gfc_intrinsic_op realop;
3464 if (op == INTRINSIC_USER || !f2k->tb_op[op])
3468 realop = (gfc_intrinsic_op) op;
3469 mio_intrinsic_op (&realop);
3470 mio_typebound_proc (&f2k->tb_op[op]);
3475 while (peek_atom () != ATOM_RPAREN)
3477 gfc_intrinsic_op op = 0; /* Silence GCC. */
3480 mio_intrinsic_op (&op);
3481 mio_typebound_proc (&f2k->tb_op[op]);
3488 mio_full_f2k_derived (gfc_symbol *sym)
3492 if (iomode == IO_OUTPUT)
3494 if (sym->f2k_derived)
3495 mio_f2k_derived (sym->f2k_derived);
3499 if (peek_atom () != ATOM_RPAREN)
3501 sym->f2k_derived = gfc_get_namespace (NULL, 0);
3502 mio_f2k_derived (sym->f2k_derived);
3505 gcc_assert (!sym->f2k_derived);
3512 /* Unlike most other routines, the address of the symbol node is already
3513 fixed on input and the name/module has already been filled in. */
3516 mio_symbol (gfc_symbol *sym)
3518 int intmod = INTMOD_NONE;
3522 mio_symbol_attribute (&sym->attr);
3523 mio_typespec (&sym->ts);
3525 if (iomode == IO_OUTPUT)
3526 mio_namespace_ref (&sym->formal_ns);
3529 mio_namespace_ref (&sym->formal_ns);
3532 sym->formal_ns->proc_name = sym;
3537 /* Save/restore common block links. */
3538 mio_symbol_ref (&sym->common_next);
3540 mio_formal_arglist (&sym->formal);
3542 if (sym->attr.flavor == FL_PARAMETER)
3543 mio_expr (&sym->value);
3545 mio_array_spec (&sym->as);
3547 mio_symbol_ref (&sym->result);
3549 if (sym->attr.cray_pointee)
3550 mio_symbol_ref (&sym->cp_pointer);
3552 /* Note that components are always saved, even if they are supposed
3553 to be private. Component access is checked during searching. */
3555 mio_component_list (&sym->components);
3557 if (sym->components != NULL)
3558 sym->component_access
3559 = MIO_NAME (gfc_access) (sym->component_access, access_types);
3561 /* Load/save the f2k_derived namespace of a derived-type symbol. */
3562 mio_full_f2k_derived (sym);
3566 /* Add the fields that say whether this is from an intrinsic module,
3567 and if so, what symbol it is within the module. */
3568 /* mio_integer (&(sym->from_intmod)); */
3569 if (iomode == IO_OUTPUT)
3571 intmod = sym->from_intmod;
3572 mio_integer (&intmod);
3576 mio_integer (&intmod);
3577 sym->from_intmod = (intmod_id) intmod;
3580 mio_integer (&(sym->intmod_sym_id));
3582 if (sym->attr.flavor == FL_DERIVED)
3583 mio_integer (&(sym->hash_value));
3589 /************************* Top level subroutines *************************/
3591 /* Given a root symtree node and a symbol, try to find a symtree that
3592 references the symbol that is not a unique name. */
3594 static gfc_symtree *
3595 find_symtree_for_symbol (gfc_symtree *st, gfc_symbol *sym)
3597 gfc_symtree *s = NULL;
3602 s = find_symtree_for_symbol (st->right, sym);
3605 s = find_symtree_for_symbol (st->left, sym);
3609 if (st->n.sym == sym && !check_unique_name (st->name))
3616 /* A recursive function to look for a specific symbol by name and by
3617 module. Whilst several symtrees might point to one symbol, its
3618 is sufficient for the purposes here than one exist. Note that
3619 generic interfaces are distinguished as are symbols that have been
3620 renamed in another module. */
3621 static gfc_symtree *
3622 find_symbol (gfc_symtree *st, const char *name,
3623 const char *module, int generic)
3626 gfc_symtree *retval, *s;
3628 if (st == NULL || st->n.sym == NULL)
3631 c = strcmp (name, st->n.sym->name);
3632 if (c == 0 && st->n.sym->module
3633 && strcmp (module, st->n.sym->module) == 0
3634 && !check_unique_name (st->name))
3636 s = gfc_find_symtree (gfc_current_ns->sym_root, name);
3638 /* Detect symbols that are renamed by use association in another
3639 module by the absence of a symtree and null attr.use_rename,
3640 since the latter is not transmitted in the module file. */
3641 if (((!generic && !st->n.sym->attr.generic)
3642 || (generic && st->n.sym->attr.generic))
3643 && !(s == NULL && !st->n.sym->attr.use_rename))
3647 retval = find_symbol (st->left, name, module, generic);
3650 retval = find_symbol (st->right, name, module, generic);
3656 /* Skip a list between balanced left and right parens. */
3666 switch (parse_atom ())
3677 gfc_free (atom_string);
3689 /* Load operator interfaces from the module. Interfaces are unusual
3690 in that they attach themselves to existing symbols. */
3693 load_operator_interfaces (void)
3696 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
3698 pointer_info *pi = NULL;
3703 while (peek_atom () != ATOM_RPAREN)
3707 mio_internal_string (name);
3708 mio_internal_string (module);
3710 n = number_use_names (name, true);
3713 for (i = 1; i <= n; i++)
3715 /* Decide if we need to load this one or not. */
3716 p = find_use_name_n (name, &i, true);
3720 while (parse_atom () != ATOM_RPAREN);
3726 uop = gfc_get_uop (p);
3727 pi = mio_interface_rest (&uop->op);
3731 if (gfc_find_uop (p, NULL))
3733 uop = gfc_get_uop (p);
3734 uop->op = gfc_get_interface ();
3735 uop->op->where = gfc_current_locus;
3736 add_fixup (pi->integer, &uop->op->sym);
3745 /* Load interfaces from the module. Interfaces are unusual in that
3746 they attach themselves to existing symbols. */
3749 load_generic_interfaces (void)
3752 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
3754 gfc_interface *generic = NULL, *gen = NULL;
3756 bool ambiguous_set = false;
3760 while (peek_atom () != ATOM_RPAREN)
3764 mio_internal_string (name);
3765 mio_internal_string (module);
3767 n = number_use_names (name, false);
3768 renamed = n ? 1 : 0;
3771 for (i = 1; i <= n; i++)
3774 /* Decide if we need to load this one or not. */
3775 p = find_use_name_n (name, &i, false);
3777 st = find_symbol (gfc_current_ns->sym_root,
3778 name, module_name, 1);
3780 if (!p || gfc_find_symbol (p, NULL, 0, &sym))
3782 /* Skip the specific names for these cases. */
3783 while (i == 1 && parse_atom () != ATOM_RPAREN);
3788 /* If the symbol exists already and is being USEd without being
3789 in an ONLY clause, do not load a new symtree(11.3.2). */
3790 if (!only_flag && st)
3795 /* Make the symbol inaccessible if it has been added by a USE
3796 statement without an ONLY(11.3.2). */
3798 && !st->n.sym->attr.use_only
3799 && !st->n.sym->attr.use_rename
3800 && strcmp (st->n.sym->module, module_name) == 0)
3803 gfc_delete_symtree (&gfc_current_ns->sym_root, name);
3804 st = gfc_get_unique_symtree (gfc_current_ns);
3811 if (strcmp (st->name, p) != 0)
3813 st = gfc_new_symtree (&gfc_current_ns->sym_root, p);
3819 /* Since we haven't found a valid generic interface, we had
3823 gfc_get_symbol (p, NULL, &sym);
3824 sym->name = gfc_get_string (name);
3825 sym->module = gfc_get_string (module_name);
3826 sym->attr.flavor = FL_PROCEDURE;
3827 sym->attr.generic = 1;
3828 sym->attr.use_assoc = 1;
3833 /* Unless sym is a generic interface, this reference
3836 st = gfc_find_symtree (gfc_current_ns->sym_root, p);
3840 if (st && !sym->attr.generic
3843 && strcmp(module, sym->module))
3845 ambiguous_set = true;
3850 sym->attr.use_only = only_flag;
3851 sym->attr.use_rename = renamed;
3855 mio_interface_rest (&sym->generic);
3856 generic = sym->generic;
3858 else if (!sym->generic)
3860 sym->generic = generic;
3861 sym->attr.generic_copy = 1;
3864 /* If a procedure that is not generic has generic interfaces
3865 that include itself, it is generic! We need to take care
3866 to retain symbols ambiguous that were already so. */
3867 if (sym->attr.use_assoc
3868 && !sym->attr.generic
3869 && sym->attr.flavor == FL_PROCEDURE)
3871 for (gen = generic; gen; gen = gen->next)
3873 if (gen->sym == sym)
3875 sym->attr.generic = 1;
3890 /* Load common blocks. */
3895 char name[GFC_MAX_SYMBOL_LEN + 1];
3900 while (peek_atom () != ATOM_RPAREN)
3904 mio_internal_string (name);
3906 p = gfc_get_common (name, 1);
3908 mio_symbol_ref (&p->head);
3909 mio_integer (&flags);
3913 p->threadprivate = 1;
3916 /* Get whether this was a bind(c) common or not. */
3917 mio_integer (&p->is_bind_c);
3918 /* Get the binding label. */
3919 mio_internal_string (p->binding_label);
3928 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3929 so that unused variables are not loaded and so that the expression can
3935 gfc_equiv *head, *tail, *end, *eq;
3939 in_load_equiv = true;
3941 end = gfc_current_ns->equiv;
3942 while (end != NULL && end->next != NULL)
3945 while (peek_atom () != ATOM_RPAREN) {
3949 while(peek_atom () != ATOM_RPAREN)
3952 head = tail = gfc_get_equiv ();
3955 tail->eq = gfc_get_equiv ();
3959 mio_pool_string (&tail->module);
3960 mio_expr (&tail->expr);
3963 /* Unused equivalence members have a unique name. In addition, it
3964 must be checked that the symbols are from the same module. */
3966 for (eq = head; eq; eq = eq->eq)
3968 if (eq->expr->symtree->n.sym->module
3969 && head->expr->symtree->n.sym->module
3970 && strcmp (head->expr->symtree->n.sym->module,
3971 eq->expr->symtree->n.sym->module) == 0
3972 && !check_unique_name (eq->expr->symtree->name))
3981 for (eq = head; eq; eq = head)
3984 gfc_free_expr (eq->expr);
3990 gfc_current_ns->equiv = head;
4001 in_load_equiv = false;
4005 /* This function loads the sym_root of f2k_derived with the extensions to
4006 the derived type. */
4008 load_derived_extensions (void)
4011 gfc_symbol *derived;
4015 char name[GFC_MAX_SYMBOL_LEN + 1];
4016 char module[GFC_MAX_SYMBOL_LEN + 1];
4020 while (peek_atom () != ATOM_RPAREN)
4023 mio_integer (&symbol);
4024 info = get_integer (symbol);
4025 derived = info->u.rsym.sym;
4027 /* This one is not being loaded. */
4028 if (!info || !derived)
4030 while (peek_atom () != ATOM_RPAREN)
4035 gcc_assert (derived->attr.flavor == FL_DERIVED);
4036 if (derived->f2k_derived == NULL)
4037 derived->f2k_derived = gfc_get_namespace (NULL, 0);
4039 while (peek_atom () != ATOM_RPAREN)
4042 mio_internal_string (name);
4043 mio_internal_string (module);
4045 /* Only use one use name to find the symbol. */
4047 p = find_use_name_n (name, &j, false);
4050 st = gfc_find_symtree (gfc_current_ns->sym_root, p);
4052 st = gfc_find_symtree (derived->f2k_derived->sym_root, name);
4055 /* Only use the real name in f2k_derived to ensure a single
4057 st = gfc_new_symtree (&derived->f2k_derived->sym_root, name);
4070 /* Recursive function to traverse the pointer_info tree and load a
4071 needed symbol. We return nonzero if we load a symbol and stop the
4072 traversal, because the act of loading can alter the tree. */
4075 load_needed (pointer_info *p)
4086 rv |= load_needed (p->left);
4087 rv |= load_needed (p->right);
4089 if (p->type != P_SYMBOL || p->u.rsym.state != NEEDED)
4092 p->u.rsym.state = USED;
4094 set_module_locus (&p->u.rsym.where);
4096 sym = p->u.rsym.sym;
4099 q = get_integer (p->u.rsym.ns);
4101 ns = (gfc_namespace *) q->u.pointer;
4104 /* Create an interface namespace if necessary. These are
4105 the namespaces that hold the formal parameters of module
4108 ns = gfc_get_namespace (NULL, 0);
4109 associate_integer_pointer (q, ns);
4112 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
4113 doesn't go pear-shaped if the symbol is used. */
4115 gfc_find_symbol (p->u.rsym.module, gfc_current_ns,
4118 sym = gfc_new_symbol (p->u.rsym.true_name, ns);
4119 sym->module = gfc_get_string (p->u.rsym.module);
4120 strcpy (sym->binding_label, p->u.rsym.binding_label);
4122 associate_integer_pointer (p, sym);
4126 sym->attr.use_assoc = 1;
4128 sym->attr.use_only = 1;
4129 if (p->u.rsym.renamed)
4130 sym->attr.use_rename = 1;
4136 /* Recursive function for cleaning up things after a module has been read. */
4139 read_cleanup (pointer_info *p)
4147 read_cleanup (p->left);
4148 read_cleanup (p->right);
4150 if (p->type == P_SYMBOL && p->u.rsym.state == USED && !p->u.rsym.referenced)
4152 /* Add hidden symbols to the symtree. */
4153 q = get_integer (p->u.rsym.ns);
4154 st = gfc_get_unique_symtree ((gfc_namespace *) q->u.pointer);
4156 st->n.sym = p->u.rsym.sym;
4159 /* Fixup any symtree references. */
4160 p->u.rsym.symtree = st;
4161 resolve_fixups (p->u.rsym.stfixup, st);
4162 p->u.rsym.stfixup = NULL;
4165 /* Free unused symbols. */
4166 if (p->type == P_SYMBOL && p->u.rsym.state == UNUSED)
4167 gfc_free_symbol (p->u.rsym.sym);
4171 /* It is not quite enough to check for ambiguity in the symbols by
4172 the loaded symbol and the new symbol not being identical. */
4174 check_for_ambiguous (gfc_symbol *st_sym, pointer_info *info)
4178 symbol_attribute attr;
4180 rsym = info->u.rsym.sym;
4184 /* If the existing symbol is generic from a different module and
4185 the new symbol is generic there can be no ambiguity. */
4186 if (st_sym->attr.generic
4188 && strcmp (st_sym->module, module_name))
4190 /* The new symbol's attributes have not yet been read. Since
4191 we need attr.generic, read it directly. */
4192 get_module_locus (&locus);
4193 set_module_locus (&info->u.rsym.where);
4196 mio_symbol_attribute (&attr);
4197 set_module_locus (&locus);
4206 /* Read a module file. */
4211 module_locus operator_interfaces, user_operators, extensions;
4213 char name[GFC_MAX_SYMBOL_LEN + 1];
4215 int ambiguous, j, nuse, symbol;
4216 pointer_info *info, *q;
4221 get_module_locus (&operator_interfaces); /* Skip these for now. */
4224 get_module_locus (&user_operators);
4228 /* Skip commons, equivalences and derived type extensions for now. */
4232 get_module_locus (&extensions);
4237 /* Create the fixup nodes for all the symbols. */
4239 while (peek_atom () != ATOM_RPAREN)
4241 require_atom (ATOM_INTEGER);
4242 info = get_integer (atom_int);
4244 info->type = P_SYMBOL;
4245 info->u.rsym.state = UNUSED;
4247 mio_internal_string (info->u.rsym.true_name);
4248 mio_internal_string (info->u.rsym.module);
4249 mio_internal_string (info->u.rsym.binding_label);
4252 require_atom (ATOM_INTEGER);
4253 info->u.rsym.ns = atom_int;
4255 get_module_locus (&info->u.rsym.where);
4258 /* See if the symbol has already been loaded by a previous module.
4259 If so, we reference the existing symbol and prevent it from
4260 being loaded again. This should not happen if the symbol being
4261 read is an index for an assumed shape dummy array (ns != 1). */
4263 sym = find_true_name (info->u.rsym.true_name, info->u.rsym.module);
4266 || (sym->attr.flavor == FL_VARIABLE && info->u.rsym.ns !=1))
4269 info->u.rsym.state = USED;
4270 info->u.rsym.sym = sym;
4272 /* Some symbols do not have a namespace (eg. formal arguments),
4273 so the automatic "unique symtree" mechanism must be suppressed
4274 by marking them as referenced. */
4275 q = get_integer (info->u.rsym.ns);
4276 if (q->u.pointer == NULL)
4278 info->u.rsym.referenced = 1;
4282 /* If possible recycle the symtree that references the symbol.
4283 If a symtree is not found and the module does not import one,
4284 a unique-name symtree is found by read_cleanup. */
4285 st = find_symtree_for_symbol (gfc_current_ns->sym_root, sym);
4288 info->u.rsym.symtree = st;
4289 info->u.rsym.referenced = 1;
4295 /* Parse the symtree lists. This lets us mark which symbols need to
4296 be loaded. Renaming is also done at this point by replacing the
4301 while (peek_atom () != ATOM_RPAREN)
4303 mio_internal_string (name);
4304 mio_integer (&ambiguous);
4305 mio_integer (&symbol);
4307 info = get_integer (symbol);
4309 /* See how many use names there are. If none, go through the start
4310 of the loop at least once. */
4311 nuse = number_use_names (name, false);
4312 info->u.rsym.renamed = nuse ? 1 : 0;
4317 for (j = 1; j <= nuse; j++)
4319 /* Get the jth local name for this symbol. */
4320 p = find_use_name_n (name, &j, false);
4322 if (p == NULL && strcmp (name, module_name) == 0)
4325 /* Skip symtree nodes not in an ONLY clause, unless there
4326 is an existing symtree loaded from another USE statement. */
4329 st = gfc_find_symtree (gfc_current_ns->sym_root, name);
4331 info->u.rsym.symtree = st;
4335 /* If a symbol of the same name and module exists already,
4336 this symbol, which is not in an ONLY clause, must not be
4337 added to the namespace(11.3.2). Note that find_symbol
4338 only returns the first occurrence that it finds. */
4339 if (!only_flag && !info->u.rsym.renamed
4340 && strcmp (name, module_name) != 0
4341 && find_symbol (gfc_current_ns->sym_root, name,
4345 st = gfc_find_symtree (gfc_current_ns->sym_root, p);
4349 /* Check for ambiguous symbols. */
4350 if (check_for_ambiguous (st->n.sym, info))
4352 info->u.rsym.symtree = st;
4356 st = gfc_find_symtree (gfc_current_ns->sym_root, name);
4358 /* Delete the symtree if the symbol has been added by a USE
4359 statement without an ONLY(11.3.2). Remember that the rsym
4360 will be the same as the symbol found in the symtree, for
4362 if (st && (only_flag || info->u.rsym.renamed)
4363 && !st->n.sym->attr.use_only
4364 && !st->n.sym->attr.use_rename
4365 && info->u.rsym.sym == st->n.sym)
4366 gfc_delete_symtree (&gfc_current_ns->sym_root, name);
4368 /* Create a symtree node in the current namespace for this
4370 st = check_unique_name (p)
4371 ? gfc_get_unique_symtree (gfc_current_ns)
4372 : gfc_new_symtree (&gfc_current_ns->sym_root, p);
4373 st->ambiguous = ambiguous;
4375 sym = info->u.rsym.sym;
4377 /* Create a symbol node if it doesn't already exist. */
4380 info->u.rsym.sym = gfc_new_symbol (info->u.rsym.true_name,
4382 sym = info->u.rsym.sym;
4383 sym->module = gfc_get_string (info->u.rsym.module);
4385 /* TODO: hmm, can we test this? Do we know it will be
4386 initialized to zeros? */
4387 if (info->u.rsym.binding_label[0] != '\0')
4388 strcpy (sym->binding_label, info->u.rsym.binding_label);
4394 if (strcmp (name, p) != 0)
4395 sym->attr.use_rename = 1;
4397 /* We need to set the only_flag here so that symbols from the
4398 same USE...ONLY but earlier are not deleted from the tree in
4399 the gfc_delete_symtree above. */
4400 sym->attr.use_only = only_flag;
4402 /* Store the symtree pointing to this symbol. */
4403 info->u.rsym.symtree = st;
4405 if (info->u.rsym.state == UNUSED)
4406 info->u.rsym.state = NEEDED;
4407 info->u.rsym.referenced = 1;
4414 /* Load intrinsic operator interfaces. */
4415 set_module_locus (&operator_interfaces);
4418 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
4420 if (i == INTRINSIC_USER)
4425 u = find_use_operator ((gfc_intrinsic_op) i);
4436 mio_interface (&gfc_current_ns->op[i]);
4441 /* Load generic and user operator interfaces. These must follow the
4442 loading of symtree because otherwise symbols can be marked as
4445 set_module_locus (&user_operators);
4447 load_operator_interfaces ();
4448 load_generic_interfaces ();
4453 /* At this point, we read those symbols that are needed but haven't
4454 been loaded yet. If one symbol requires another, the other gets
4455 marked as NEEDED if its previous state was UNUSED. */
4457 while (load_needed (pi_root));
4459 /* Make sure all elements of the rename-list were found in the module. */
4461 for (u = gfc_rename_list; u; u = u->next)
4466 if (u->op == INTRINSIC_NONE)
4468 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
4469 u->use_name, &u->where, module_name);
4473 if (u->op == INTRINSIC_USER)
4475 gfc_error ("User operator '%s' referenced at %L not found "
4476 "in module '%s'", u->use_name, &u->where, module_name);
4480 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
4481 "in module '%s'", gfc_op2string (u->op), &u->where,
4485 gfc_check_interfaces (gfc_current_ns);
4487 /* Now we should be in a position to fill f2k_derived with derived type
4488 extensions, since everything has been loaded. */
4489 set_module_locus (&extensions);
4490 load_derived_extensions ();
4492 /* Clean up symbol nodes that were never loaded, create references
4493 to hidden symbols. */
4495 read_cleanup (pi_root);
4499 /* Given an access type that is specific to an entity and the default
4500 access, return nonzero if the entity is publicly accessible. If the
4501 element is declared as PUBLIC, then it is public; if declared
4502 PRIVATE, then private, and otherwise it is public unless the default
4503 access in this context has been declared PRIVATE. */
4506 gfc_check_access (gfc_access specific_access, gfc_access default_access)
4508 if (specific_access == ACCESS_PUBLIC)
4510 if (specific_access == ACCESS_PRIVATE)
4513 if (gfc_option.flag_module_private)
4514 return default_access == ACCESS_PUBLIC;
4516 return default_access != ACCESS_PRIVATE;
4520 /* A structure to remember which commons we've already written. */
4522 struct written_common
4524 BBT_HEADER(written_common);
4525 const char *name, *label;
4528 static struct written_common *written_commons = NULL;
4530 /* Comparison function used for balancing the binary tree. */
4533 compare_written_commons (void *a1, void *b1)
4535 const char *aname = ((struct written_common *) a1)->name;
4536 const char *alabel = ((struct written_common *) a1)->label;
4537 const char *bname = ((struct written_common *) b1)->name;
4538 const char *blabel = ((struct written_common *) b1)->label;
4539 int c = strcmp (aname, bname);
4541 return (c != 0 ? c : strcmp (alabel, blabel));
4544 /* Free a list of written commons. */
4547 free_written_common (struct written_common *w)
4553 free_written_common (w->left);
4555 free_written_common (w->right);
4560 /* Write a common block to the module -- recursive helper function. */
4563 write_common_0 (gfc_symtree *st, bool this_module)
4569 struct written_common *w;
4570 bool write_me = true;
4575 write_common_0 (st->left, this_module);
4577 /* We will write out the binding label, or the name if no label given. */
4578 name = st->n.common->name;
4580 label = p->is_bind_c ? p->binding_label : p->name;
4582 /* Check if we've already output this common. */
4583 w = written_commons;
4586 int c = strcmp (name, w->name);
4587 c = (c != 0 ? c : strcmp (label, w->label));
4591 w = (c < 0) ? w->left : w->right;
4594 if (this_module && p->use_assoc)
4599 /* Write the common to the module. */
4601 mio_pool_string (&name);
4603 mio_symbol_ref (&p->head);
4604 flags = p->saved ? 1 : 0;
4605 if (p->threadprivate)
4607 mio_integer (&flags);
4609 /* Write out whether the common block is bind(c) or not. */
4610 mio_integer (&(p->is_bind_c));
4612 mio_pool_string (&label);
4615 /* Record that we have written this common. */
4616 w = XCNEW (struct written_common);
4619 gfc_insert_bbt (&written_commons, w, compare_written_commons);
4622 write_common_0 (st->right, this_module);
4626 /* Write a common, by initializing the list of written commons, calling
4627 the recursive function write_common_0() and cleaning up afterwards. */
4630 write_common (gfc_symtree *st)
4632 written_commons = NULL;
4633 write_common_0 (st, true);
4634 write_common_0 (st, false);
4635 free_written_common (written_commons);
4636 written_commons = NULL;
4640 /* Write the blank common block to the module. */
4643 write_blank_common (void)
4645 const char * name = BLANK_COMMON_NAME;
4647 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4648 this, but it hasn't been checked. Just making it so for now. */
4651 if (gfc_current_ns->blank_common.head == NULL)
4656 mio_pool_string (&name);
4658 mio_symbol_ref (&gfc_current_ns->blank_common.head);
4659 saved = gfc_current_ns->blank_common.saved;
4660 mio_integer (&saved);
4662 /* Write out whether the common block is bind(c) or not. */
4663 mio_integer (&is_bind_c);
4665 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4666 it doesn't matter because the label isn't used. */
4667 mio_pool_string (&name);
4673 /* Write equivalences to the module. */
4682 for (eq = gfc_current_ns->equiv; eq; eq = eq->next)
4686 for (e = eq; e; e = e->eq)
4688 if (e->module == NULL)
4689 e->module = gfc_get_string ("%s.eq.%d", module_name, num);
4690 mio_allocated_string (e->module);
4691 mio_expr (&e->expr);
4700 /* Write derived type extensions to the module. */
4703 write_dt_extensions (gfc_symtree *st)
4705 if (!gfc_check_access (st->n.sym->attr.access,
4706 st->n.sym->ns->default_access))
4710 mio_pool_string (&st->n.sym->name);
4711 if (st->n.sym->module != NULL)
4712 mio_pool_string (&st->n.sym->module);
4714 mio_internal_string (module_name);
4719 write_derived_extensions (gfc_symtree *st)
4721 if (!((st->n.sym->attr.flavor == FL_DERIVED)
4722 && (st->n.sym->f2k_derived != NULL)
4723 && (st->n.sym->f2k_derived->sym_root != NULL)))
4727 mio_symbol_ref (&(st->n.sym));
4728 gfc_traverse_symtree (st->n.sym->f2k_derived->sym_root,
4729 write_dt_extensions);
4734 /* Write a symbol to the module. */
4737 write_symbol (int n, gfc_symbol *sym)
4741 if (sym->attr.flavor == FL_UNKNOWN || sym->attr.flavor == FL_LABEL)
4742 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym->name);
4745 mio_pool_string (&sym->name);
4747 mio_pool_string (&sym->module);
4748 if (sym->attr.is_bind_c || sym->attr.is_iso_c)
4750 label = sym->binding_label;
4751 mio_pool_string (&label);
4754 mio_pool_string (&sym->name);
4756 mio_pointer_ref (&sym->ns);
4763 /* Recursive traversal function to write the initial set of symbols to
4764 the module. We check to see if the symbol should be written
4765 according to the access specification. */
4768 write_symbol0 (gfc_symtree *st)
4772 bool dont_write = false;
4777 write_symbol0 (st->left);
4780 if (sym->module == NULL)
4781 sym->module = gfc_get_string (module_name);
4783 if (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
4784 && !sym->attr.subroutine && !sym->attr.function)
4787 if (!gfc_check_access (sym->attr.access, sym->ns->default_access))
4792 p = get_pointer (sym);
4793 if (p->type == P_UNKNOWN)
4796 if (p->u.wsym.state != WRITTEN)
4798 write_symbol (p->integer, sym);
4799 p->u.wsym.state = WRITTEN;
4803 write_symbol0 (st->right);
4807 /* Recursive traversal function to write the secondary set of symbols
4808 to the module file. These are symbols that were not public yet are
4809 needed by the public symbols or another dependent symbol. The act
4810 of writing a symbol can modify the pointer_info tree, so we cease
4811 traversal if we find a symbol to write. We return nonzero if a
4812 symbol was written and pass that information upwards. */
4815 write_symbol1 (pointer_info *p)
4822 result = write_symbol1 (p->left);
4824 if (!(p->type != P_SYMBOL || p->u.wsym.state != NEEDS_WRITE))
4826 p->u.wsym.state = WRITTEN;
4827 write_symbol (p->integer, p->u.wsym.sym);
4831 result |= write_symbol1 (p->right);
4836 /* Write operator interfaces associated with a symbol. */
4839 write_operator (gfc_user_op *uop)
4841 static char nullstring[] = "";
4842 const char *p = nullstring;
4845 || !gfc_check_access (uop->access, uop->ns->default_access))
4848 mio_symbol_interface (&uop->name, &p, &uop->op);
4852 /* Write generic interfaces from the namespace sym_root. */
4855 write_generic (gfc_symtree *st)
4862 write_generic (st->left);
4863 write_generic (st->right);
4866 if (!sym || check_unique_name (st->name))
4869 if (sym->generic == NULL
4870 || !gfc_check_access (sym->attr.access, sym->ns->default_access))
4873 if (sym->module == NULL)
4874 sym->module = gfc_get_string (module_name);
4876 mio_symbol_interface (&st->name, &sym->module, &sym->generic);
4881 write_symtree (gfc_symtree *st)
4888 /* A symbol in an interface body must not be visible in the
4890 if (sym->ns != gfc_current_ns
4891 && sym->ns->proc_name
4892 && sym->ns->proc_name->attr.if_source == IFSRC_IFBODY)
4895 if (!gfc_check_access (sym->attr.access, sym->ns->default_access)
4896 || (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
4897 && !sym->attr.subroutine && !sym->attr.function))
4900 if (check_unique_name (st->name))
4903 p = find_pointer (sym);
4905 gfc_internal_error ("write_symtree(): Symbol not written");
4907 mio_pool_string (&st->name);
4908 mio_integer (&st->ambiguous);
4909 mio_integer (&p->integer);
4918 /* Write the operator interfaces. */
4921 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
4923 if (i == INTRINSIC_USER)
4926 mio_interface (gfc_check_access (gfc_current_ns->operator_access[i],
4927 gfc_current_ns->default_access)
4928 ? &gfc_current_ns->op[i] : NULL);
4936 gfc_traverse_user_op (gfc_current_ns, write_operator);
4942 write_generic (gfc_current_ns->sym_root);
4948 write_blank_common ();
4949 write_common (gfc_current_ns->common_root);
4961 gfc_traverse_symtree (gfc_current_ns->sym_root,
4962 write_derived_extensions);
4967 /* Write symbol information. First we traverse all symbols in the
4968 primary namespace, writing those that need to be written.
4969 Sometimes writing one symbol will cause another to need to be
4970 written. A list of these symbols ends up on the write stack, and
4971 we end by popping the bottom of the stack and writing the symbol
4972 until the stack is empty. */
4976 write_symbol0 (gfc_current_ns->sym_root);
4977 while (write_symbol1 (pi_root))
4986 gfc_traverse_symtree (gfc_current_ns->sym_root, write_symtree);
4991 /* Read a MD5 sum from the header of a module file. If the file cannot
4992 be opened, or we have any other error, we return -1. */
4995 read_md5_from_module_file (const char * filename, unsigned char md5[16])
5001 /* Open the file. */
5002 if ((file = fopen (filename, "r")) == NULL)
5005 /* Read the first line. */
5006 if (fgets (buf, sizeof (buf) - 1, file) == NULL)
5012 /* The file also needs to be overwritten if the version number changed. */
5013 n = strlen ("GFORTRAN module version '" MOD_VERSION "' created");
5014 if (strncmp (buf, "GFORTRAN module version '" MOD_VERSION "' created", n) != 0)
5020 /* Read a second line. */
5021 if (fgets (buf, sizeof (buf) - 1, file) == NULL)
5027 /* Close the file. */
5030 /* If the header is not what we expect, or is too short, bail out. */
5031 if (strncmp (buf, "MD5:", 4) != 0 || strlen (buf) < 4 + 16)
5034 /* Now, we have a real MD5, read it into the array. */
5035 for (n = 0; n < 16; n++)
5039 if (sscanf (&(buf[4+2*n]), "%02x", &x) != 1)
5049 /* Given module, dump it to disk. If there was an error while
5050 processing the module, dump_flag will be set to zero and we delete
5051 the module file, even if it was already there. */
5054 gfc_dump_module (const char *name, int dump_flag)
5057 char *filename, *filename_tmp, *p;
5060 unsigned char md5_new[16], md5_old[16];
5062 n = strlen (name) + strlen (MODULE_EXTENSION) + 1;
5063 if (gfc_option.module_dir != NULL)
5065 n += strlen (gfc_option.module_dir);
5066 filename = (char *) alloca (n);
5067 strcpy (filename, gfc_option.module_dir);
5068 strcat (filename, name);
5072 filename = (char *) alloca (n);
5073 strcpy (filename, name);
5075 strcat (filename, MODULE_EXTENSION);
5077 /* Name of the temporary file used to write the module. */
5078 filename_tmp = (char *) alloca (n + 1);
5079 strcpy (filename_tmp, filename);
5080 strcat (filename_tmp, "0");
5082 /* There was an error while processing the module. We delete the
5083 module file, even if it was already there. */
5090 /* Write the module to the temporary file. */
5091 module_fp = fopen (filename_tmp, "w");
5092 if (module_fp == NULL)
5093 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
5094 filename_tmp, strerror (errno));
5096 /* Write the header, including space reserved for the MD5 sum. */
5100 *strchr (p, '\n') = '\0';
5102 fprintf (module_fp, "GFORTRAN module version '%s' created from %s on %s\n"
5103 "MD5:", MOD_VERSION, gfc_source_file, p);
5104 fgetpos (module_fp, &md5_pos);
5105 fputs ("00000000000000000000000000000000 -- "
5106 "If you edit this, you'll get what you deserve.\n\n", module_fp);
5108 /* Initialize the MD5 context that will be used for output. */
5109 md5_init_ctx (&ctx);
5111 /* Write the module itself. */
5113 strcpy (module_name, name);
5119 free_pi_tree (pi_root);
5124 /* Write the MD5 sum to the header of the module file. */
5125 md5_finish_ctx (&ctx, md5_new);
5126 fsetpos (module_fp, &md5_pos);
5127 for (n = 0; n < 16; n++)
5128 fprintf (module_fp, "%02x", md5_new[n]);
5130 if (fclose (module_fp))
5131 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
5132 filename_tmp, strerror (errno));
5134 /* Read the MD5 from the header of the old module file and compare. */
5135 if (read_md5_from_module_file (filename, md5_old) != 0
5136 || memcmp (md5_old, md5_new, sizeof (md5_old)) != 0)
5138 /* Module file have changed, replace the old one. */
5139 if (unlink (filename) && errno != ENOENT)
5140 gfc_fatal_error ("Can't delete module file '%s': %s", filename,
5142 if (rename (filename_tmp, filename))
5143 gfc_fatal_error ("Can't rename module file '%s' to '%s': %s",
5144 filename_tmp, filename, strerror (errno));
5148 if (unlink (filename_tmp))
5149 gfc_fatal_error ("Can't delete temporary module file '%s': %s",
5150 filename_tmp, strerror (errno));
5156 sort_iso_c_rename_list (void)
5158 gfc_use_rename *tmp_list = NULL;
5159 gfc_use_rename *curr;
5160 gfc_use_rename *kinds_used[ISOCBINDING_NUMBER] = {NULL};
5164 for (curr = gfc_rename_list; curr; curr = curr->next)
5166 c_kind = get_c_kind (curr->use_name, c_interop_kinds_table);
5167 if (c_kind == ISOCBINDING_INVALID || c_kind == ISOCBINDING_LAST)
5169 gfc_error ("Symbol '%s' referenced at %L does not exist in "
5170 "intrinsic module ISO_C_BINDING.", curr->use_name,
5174 /* Put it in the list. */
5175 kinds_used[c_kind] = curr;
5178 /* Make a new (sorted) rename list. */
5180 while (i < ISOCBINDING_NUMBER && kinds_used[i] == NULL)
5183 if (i < ISOCBINDING_NUMBER)
5185 tmp_list = kinds_used[i];
5189 for (; i < ISOCBINDING_NUMBER; i++)
5190 if (kinds_used[i] != NULL)
5192 curr->next = kinds_used[i];
5198 gfc_rename_list = tmp_list;
5202 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
5203 the current namespace for all named constants, pointer types, and
5204 procedures in the module unless the only clause was used or a rename
5205 list was provided. */
5208 import_iso_c_binding_module (void)
5210 gfc_symbol *mod_sym = NULL;
5211 gfc_symtree *mod_symtree = NULL;
5212 const char *iso_c_module_name = "__iso_c_binding";
5217 /* Look only in the current namespace. */
5218 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, iso_c_module_name);
5220 if (mod_symtree == NULL)
5222 /* symtree doesn't already exist in current namespace. */
5223 gfc_get_sym_tree (iso_c_module_name, gfc_current_ns, &mod_symtree,
5226 if (mod_symtree != NULL)
5227 mod_sym = mod_symtree->n.sym;
5229 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
5230 "create symbol for %s", iso_c_module_name);
5232 mod_sym->attr.flavor = FL_MODULE;
5233 mod_sym->attr.intrinsic = 1;
5234 mod_sym->module = gfc_get_string (iso_c_module_name);
5235 mod_sym->from_intmod = INTMOD_ISO_C_BINDING;
5238 /* Generate the symbols for the named constants representing
5239 the kinds for intrinsic data types. */
5242 /* Sort the rename list because there are dependencies between types
5243 and procedures (e.g., c_loc needs c_ptr). */
5244 sort_iso_c_rename_list ();
5246 for (u = gfc_rename_list; u; u = u->next)
5248 i = get_c_kind (u->use_name, c_interop_kinds_table);
5250 if (i == ISOCBINDING_INVALID || i == ISOCBINDING_LAST)
5252 gfc_error ("Symbol '%s' referenced at %L does not exist in "
5253 "intrinsic module ISO_C_BINDING.", u->use_name,
5258 generate_isocbinding_symbol (iso_c_module_name,
5259 (iso_c_binding_symbol) i,
5265 for (i = 0; i < ISOCBINDING_NUMBER; i++)
5268 for (u = gfc_rename_list; u; u = u->next)
5270 if (strcmp (c_interop_kinds_table[i].name, u->use_name) == 0)
5272 local_name = u->local_name;
5277 generate_isocbinding_symbol (iso_c_module_name,
5278 (iso_c_binding_symbol) i,
5282 for (u = gfc_rename_list; u; u = u->next)
5287 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5288 "module ISO_C_BINDING", u->use_name, &u->where);
5294 /* Add an integer named constant from a given module. */
5297 create_int_parameter (const char *name, int value, const char *modname,
5298 intmod_id module, int id)
5300 gfc_symtree *tmp_symtree;
5303 tmp_symtree = gfc_find_symtree (gfc_current_ns->sym_root, name);
5304 if (tmp_symtree != NULL)
5306 if (strcmp (modname, tmp_symtree->n.sym->module) == 0)
5309 gfc_error ("Symbol '%s' already declared", name);
5312 gfc_get_sym_tree (name, gfc_current_ns, &tmp_symtree, false);
5313 sym = tmp_symtree->n.sym;
5315 sym->module = gfc_get_string (modname);
5316 sym->attr.flavor = FL_PARAMETER;
5317 sym->ts.type = BT_INTEGER;
5318 sym->ts.kind = gfc_default_integer_kind;
5319 sym->value = gfc_int_expr (value);
5320 sym->attr.use_assoc = 1;
5321 sym->from_intmod = module;
5322 sym->intmod_sym_id = id;
5326 /* USE the ISO_FORTRAN_ENV intrinsic module. */
5329 use_iso_fortran_env_module (void)
5331 static char mod[] = "iso_fortran_env";
5332 const char *local_name;
5334 gfc_symbol *mod_sym;
5335 gfc_symtree *mod_symtree;
5338 intmod_sym symbol[] = {
5339 #define NAMED_INTCST(a,b,c,d) { a, b, 0, d },
5340 #include "iso-fortran-env.def"
5342 { ISOFORTRANENV_INVALID, NULL, -1234, 0 } };
5345 #define NAMED_INTCST(a,b,c,d) symbol[i++].value = c;
5346 #include "iso-fortran-env.def"
5349 /* Generate the symbol for the module itself. */
5350 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, mod);
5351 if (mod_symtree == NULL)
5353 gfc_get_sym_tree (mod, gfc_current_ns, &mod_symtree, false);
5354 gcc_assert (mod_symtree);
5355 mod_sym = mod_symtree->n.sym;
5357 mod_sym->attr.flavor = FL_MODULE;
5358 mod_sym->attr.intrinsic = 1;
5359 mod_sym->module = gfc_get_string (mod);
5360 mod_sym->from_intmod = INTMOD_ISO_FORTRAN_ENV;
5363 if (!mod_symtree->n.sym->attr.intrinsic)
5364 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
5365 "non-intrinsic module name used previously", mod);
5367 /* Generate the symbols for the module integer named constants. */
5369 for (u = gfc_rename_list; u; u = u->next)
5371 for (i = 0; symbol[i].name; i++)
5372 if (strcmp (symbol[i].name, u->use_name) == 0)
5375 if (symbol[i].name == NULL)
5377 gfc_error ("Symbol '%s' referenced at %L does not exist in "
5378 "intrinsic module ISO_FORTRAN_ENV", u->use_name,
5383 if ((gfc_option.flag_default_integer || gfc_option.flag_default_real)
5384 && symbol[i].id == ISOFORTRANENV_NUMERIC_STORAGE_SIZE)
5385 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5386 "from intrinsic module ISO_FORTRAN_ENV at %L is "
5387 "incompatible with option %s", &u->where,
5388 gfc_option.flag_default_integer
5389 ? "-fdefault-integer-8" : "-fdefault-real-8");
5391 create_int_parameter (u->local_name[0] ? u->local_name
5393 symbol[i].value, mod, INTMOD_ISO_FORTRAN_ENV,
5398 for (i = 0; symbol[i].name; i++)
5401 for (u = gfc_rename_list; u; u = u->next)
5403 if (strcmp (symbol[i].name, u->use_name) == 0)
5405 local_name = u->local_name;
5411 if ((gfc_option.flag_default_integer || gfc_option.flag_default_real)
5412 && symbol[i].id == ISOFORTRANENV_NUMERIC_STORAGE_SIZE)
5413 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
5414 "from intrinsic module ISO_FORTRAN_ENV at %C is "
5415 "incompatible with option %s",
5416 gfc_option.flag_default_integer
5417 ? "-fdefault-integer-8" : "-fdefault-real-8");
5419 create_int_parameter (local_name ? local_name : symbol[i].name,
5420 symbol[i].value, mod, INTMOD_ISO_FORTRAN_ENV,
5424 for (u = gfc_rename_list; u; u = u->next)
5429 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
5430 "module ISO_FORTRAN_ENV", u->use_name, &u->where);
5436 /* Process a USE directive. */
5439 gfc_use_module (void)
5444 gfc_symtree *mod_symtree;
5445 gfc_use_list *use_stmt;
5447 filename = (char *) alloca (strlen (module_name) + strlen (MODULE_EXTENSION)
5449 strcpy (filename, module_name);
5450 strcat (filename, MODULE_EXTENSION);
5452 /* First, try to find an non-intrinsic module, unless the USE statement
5453 specified that the module is intrinsic. */
5456 module_fp = gfc_open_included_file (filename, true, true);
5458 /* Then, see if it's an intrinsic one, unless the USE statement
5459 specified that the module is non-intrinsic. */
5460 if (module_fp == NULL && !specified_nonint)
5462 if (strcmp (module_name, "iso_fortran_env") == 0
5463 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: ISO_FORTRAN_ENV "
5464 "intrinsic module at %C") != FAILURE)
5466 use_iso_fortran_env_module ();
5470 if (strcmp (module_name, "iso_c_binding") == 0
5471 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: "
5472 "ISO_C_BINDING module at %C") != FAILURE)
5474 import_iso_c_binding_module();
5478 module_fp = gfc_open_intrinsic_module (filename);
5480 if (module_fp == NULL && specified_int)
5481 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
5485 if (module_fp == NULL)
5486 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
5487 filename, strerror (errno));
5489 /* Check that we haven't already USEd an intrinsic module with the
5492 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, module_name);
5493 if (mod_symtree && mod_symtree->n.sym->attr.intrinsic)
5494 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
5495 "intrinsic module name used previously", module_name);
5502 /* Skip the first two lines of the module, after checking that this is
5503 a gfortran module file. */
5509 bad_module ("Unexpected end of module");
5512 if ((start == 1 && strcmp (atom_name, "GFORTRAN") != 0)
5513 || (start == 2 && strcmp (atom_name, " module") != 0))
5514 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
5518 if (strcmp (atom_name, " version") != 0
5519 || module_char () != ' '
5520 || parse_atom () != ATOM_STRING)
5521 gfc_fatal_error ("Parse error when checking module version"
5522 " for file '%s' opened at %C", filename);
5524 if (strcmp (atom_string, MOD_VERSION))
5526 gfc_fatal_error ("Wrong module version '%s' (expected '%s') "
5527 "for file '%s' opened at %C", atom_string,
5528 MOD_VERSION, filename);
5536 /* Make sure we're not reading the same module that we may be building. */
5537 for (p = gfc_state_stack; p; p = p->previous)
5538 if (p->state == COMP_MODULE && strcmp (p->sym->name, module_name) == 0)
5539 gfc_fatal_error ("Can't USE the same module we're building!");
5542 init_true_name_tree ();
5546 free_true_name (true_name_root);
5547 true_name_root = NULL;
5549 free_pi_tree (pi_root);
5554 use_stmt = gfc_get_use_list ();
5555 use_stmt->module_name = gfc_get_string (module_name);
5556 use_stmt->only_flag = only_flag;
5557 use_stmt->rename = gfc_rename_list;
5558 use_stmt->where = use_locus;
5559 gfc_rename_list = NULL;
5560 use_stmt->next = gfc_current_ns->use_stmts;
5561 gfc_current_ns->use_stmts = use_stmt;
5566 gfc_free_use_stmts (gfc_use_list *use_stmts)
5569 for (; use_stmts; use_stmts = next)
5571 gfc_use_rename *next_rename;
5573 for (; use_stmts->rename; use_stmts->rename = next_rename)
5575 next_rename = use_stmts->rename->next;
5576 gfc_free (use_stmts->rename);
5578 next = use_stmts->next;
5579 gfc_free (use_stmts);
5585 gfc_module_init_2 (void)
5587 last_atom = ATOM_LPAREN;
5592 gfc_module_done_2 (void)