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
4 Free Software Foundation, Inc.
5 Contributed by Andy Vaught
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* The syntax of gfortran modules resembles that of lisp lists, ie a
24 sequence of atoms, which can be left or right parenthesis, names,
25 integers or strings. Parenthesis are always matched which allows
26 us to skip over sections at high speed without having to know
27 anything about the internal structure of the lists. A "name" is
28 usually a fortran 95 identifier, but can also start with '@' in
29 order to reference a hidden symbol.
31 The first line of a module is an informational message about what
32 created the module, the file it came from and when it was created.
33 The second line is a warning for people not to edit the module.
34 The rest of the module looks like:
36 ( ( <Interface info for UPLUS> )
37 ( <Interface info for UMINUS> )
40 ( ( <name of operator interface> <module of op interface> <i/f1> ... )
43 ( ( <name of generic interface> <module of generic interface> <i/f1> ... )
46 ( ( <common name> <symbol> <saved flag>)
52 ( <Symbol Number (in no particular order)>
54 <Module name of symbol>
55 ( <symbol information> )
64 In general, symbols refer to other symbols by their symbol number,
65 which are zero based. Symbols are written to the module in no
73 #include "parse.h" /* FIXME */
76 #define MODULE_EXTENSION ".mod"
79 /* Structure that describes a position within a module file. */
88 /* Structure for list of symbols of intrinsic modules. */
100 P_UNKNOWN = 0, P_OTHER, P_NAMESPACE, P_COMPONENT, P_SYMBOL
104 /* The fixup structure lists pointers to pointers that have to
105 be updated when a pointer value becomes known. */
107 typedef struct fixup_t
110 struct fixup_t *next;
115 /* Structure for holding extra info needed for pointers being read. */
117 typedef struct pointer_info
119 BBT_HEADER (pointer_info);
123 /* The first component of each member of the union is the pointer
130 void *pointer; /* Member for doing pointer searches. */
135 char true_name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
137 { UNUSED, NEEDED, USED }
139 int ns, referenced, renamed;
142 gfc_symtree *symtree;
143 char binding_label[GFC_MAX_SYMBOL_LEN + 1];
151 { UNREFERENCED = 0, NEEDS_WRITE, WRITTEN }
161 #define gfc_get_pointer_info() gfc_getmem(sizeof(pointer_info))
164 /* Lists of rename info for the USE statement. */
166 typedef struct gfc_use_rename
168 char local_name[GFC_MAX_SYMBOL_LEN + 1], use_name[GFC_MAX_SYMBOL_LEN + 1];
169 struct gfc_use_rename *next;
171 gfc_intrinsic_op operator;
176 #define gfc_get_use_rename() gfc_getmem(sizeof(gfc_use_rename))
178 /* Local variables */
180 /* The FILE for the module we're reading or writing. */
181 static FILE *module_fp;
183 /* MD5 context structure. */
184 static struct md5_ctx ctx;
186 /* The name of the module we're reading (USE'ing) or writing. */
187 static char module_name[GFC_MAX_SYMBOL_LEN + 1];
189 /* The way the module we're reading was specified. */
190 static bool specified_nonint, specified_int;
192 static int module_line, module_column, only_flag;
194 { IO_INPUT, IO_OUTPUT }
197 static gfc_use_rename *gfc_rename_list;
198 static pointer_info *pi_root;
199 static int symbol_number; /* Counter for assigning symbol numbers */
201 /* Tells mio_expr_ref to make symbols for unused equivalence members. */
202 static bool in_load_equiv;
206 /*****************************************************************/
208 /* Pointer/integer conversion. Pointers between structures are stored
209 as integers in the module file. The next couple of subroutines
210 handle this translation for reading and writing. */
212 /* Recursively free the tree of pointer structures. */
215 free_pi_tree (pointer_info *p)
220 if (p->fixup != NULL)
221 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
223 free_pi_tree (p->left);
224 free_pi_tree (p->right);
230 /* Compare pointers when searching by pointer. Used when writing a
234 compare_pointers (void *_sn1, void *_sn2)
236 pointer_info *sn1, *sn2;
238 sn1 = (pointer_info *) _sn1;
239 sn2 = (pointer_info *) _sn2;
241 if (sn1->u.pointer < sn2->u.pointer)
243 if (sn1->u.pointer > sn2->u.pointer)
250 /* Compare integers when searching by integer. Used when reading a
254 compare_integers (void *_sn1, void *_sn2)
256 pointer_info *sn1, *sn2;
258 sn1 = (pointer_info *) _sn1;
259 sn2 = (pointer_info *) _sn2;
261 if (sn1->integer < sn2->integer)
263 if (sn1->integer > sn2->integer)
270 /* Initialize the pointer_info tree. */
279 compare = (iomode == IO_INPUT) ? compare_integers : compare_pointers;
281 /* Pointer 0 is the NULL pointer. */
282 p = gfc_get_pointer_info ();
287 gfc_insert_bbt (&pi_root, p, compare);
289 /* Pointer 1 is the current namespace. */
290 p = gfc_get_pointer_info ();
291 p->u.pointer = gfc_current_ns;
293 p->type = P_NAMESPACE;
295 gfc_insert_bbt (&pi_root, p, compare);
301 /* During module writing, call here with a pointer to something,
302 returning the pointer_info node. */
304 static pointer_info *
305 find_pointer (void *gp)
312 if (p->u.pointer == gp)
314 p = (gp < p->u.pointer) ? p->left : p->right;
321 /* Given a pointer while writing, returns the pointer_info tree node,
322 creating it if it doesn't exist. */
324 static pointer_info *
325 get_pointer (void *gp)
329 p = find_pointer (gp);
333 /* Pointer doesn't have an integer. Give it one. */
334 p = gfc_get_pointer_info ();
337 p->integer = symbol_number++;
339 gfc_insert_bbt (&pi_root, p, compare_pointers);
345 /* Given an integer during reading, find it in the pointer_info tree,
346 creating the node if not found. */
348 static pointer_info *
349 get_integer (int integer)
359 c = compare_integers (&t, p);
363 p = (c < 0) ? p->left : p->right;
369 p = gfc_get_pointer_info ();
370 p->integer = integer;
373 gfc_insert_bbt (&pi_root, p, compare_integers);
379 /* Recursive function to find a pointer within a tree by brute force. */
381 static pointer_info *
382 fp2 (pointer_info *p, const void *target)
389 if (p->u.pointer == target)
392 q = fp2 (p->left, target);
396 return fp2 (p->right, target);
400 /* During reading, find a pointer_info node from the pointer value.
401 This amounts to a brute-force search. */
403 static pointer_info *
404 find_pointer2 (void *p)
406 return fp2 (pi_root, p);
410 /* Resolve any fixups using a known pointer. */
413 resolve_fixups (fixup_t *f, void *gp)
426 /* Call here during module reading when we know what pointer to
427 associate with an integer. Any fixups that exist are resolved at
431 associate_integer_pointer (pointer_info *p, void *gp)
433 if (p->u.pointer != NULL)
434 gfc_internal_error ("associate_integer_pointer(): Already associated");
438 resolve_fixups (p->fixup, gp);
444 /* During module reading, given an integer and a pointer to a pointer,
445 either store the pointer from an already-known value or create a
446 fixup structure in order to store things later. Returns zero if
447 the reference has been actually stored, or nonzero if the reference
448 must be fixed later (ie associate_integer_pointer must be called
449 sometime later. Returns the pointer_info structure. */
451 static pointer_info *
452 add_fixup (int integer, void *gp)
458 p = get_integer (integer);
460 if (p->integer == 0 || p->u.pointer != NULL)
467 f = gfc_getmem (sizeof (fixup_t));
479 /*****************************************************************/
481 /* Parser related subroutines */
483 /* Free the rename list left behind by a USE statement. */
488 gfc_use_rename *next;
490 for (; gfc_rename_list; gfc_rename_list = next)
492 next = gfc_rename_list->next;
493 gfc_free (gfc_rename_list);
498 /* Match a USE statement. */
503 char name[GFC_MAX_SYMBOL_LEN + 1], module_nature[GFC_MAX_SYMBOL_LEN + 1];
504 gfc_use_rename *tail = NULL, *new;
505 interface_type type, type2;
506 gfc_intrinsic_op operator;
509 specified_int = false;
510 specified_nonint = false;
512 if (gfc_match (" , ") == MATCH_YES)
514 if ((m = gfc_match (" %n ::", module_nature)) == MATCH_YES)
516 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: module "
517 "nature in USE statement at %C") == FAILURE)
520 if (strcmp (module_nature, "intrinsic") == 0)
521 specified_int = true;
524 if (strcmp (module_nature, "non_intrinsic") == 0)
525 specified_nonint = true;
528 gfc_error ("Module nature in USE statement at %C shall "
529 "be either INTRINSIC or NON_INTRINSIC");
536 /* Help output a better error message than "Unclassifiable
538 gfc_match (" %n", module_nature);
539 if (strcmp (module_nature, "intrinsic") == 0
540 || strcmp (module_nature, "non_intrinsic") == 0)
541 gfc_error ("\"::\" was expected after module nature at %C "
542 "but was not found");
548 m = gfc_match (" ::");
549 if (m == MATCH_YES &&
550 gfc_notify_std (GFC_STD_F2003, "Fortran 2003: "
551 "\"USE :: module\" at %C") == FAILURE)
556 m = gfc_match ("% ");
562 m = gfc_match_name (module_name);
569 if (gfc_match_eos () == MATCH_YES)
571 if (gfc_match_char (',') != MATCH_YES)
574 if (gfc_match (" only :") == MATCH_YES)
577 if (gfc_match_eos () == MATCH_YES)
582 /* Get a new rename struct and add it to the rename list. */
583 new = gfc_get_use_rename ();
584 new->where = gfc_current_locus;
587 if (gfc_rename_list == NULL)
588 gfc_rename_list = new;
593 /* See what kind of interface we're dealing with. Assume it is
595 new->operator = INTRINSIC_NONE;
596 if (gfc_match_generic_spec (&type, name, &operator) == MATCH_ERROR)
601 case INTERFACE_NAMELESS:
602 gfc_error ("Missing generic specification in USE statement at %C");
605 case INTERFACE_USER_OP:
606 case INTERFACE_GENERIC:
607 m = gfc_match (" =>");
609 if (type == INTERFACE_USER_OP && m == MATCH_YES
610 && (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: Renaming "
611 "operators in USE statements at %C")
615 if (type == INTERFACE_USER_OP)
616 new->operator = INTRINSIC_USER;
621 strcpy (new->use_name, name);
624 strcpy (new->local_name, name);
625 m = gfc_match_generic_spec (&type2, new->use_name, &operator);
630 if (m == MATCH_ERROR)
638 strcpy (new->local_name, name);
640 m = gfc_match_generic_spec (&type2, new->use_name, &operator);
645 if (m == MATCH_ERROR)
649 if (strcmp (new->use_name, module_name) == 0
650 || strcmp (new->local_name, module_name) == 0)
652 gfc_error ("The name '%s' at %C has already been used as "
653 "an external module name.", module_name);
658 case INTERFACE_INTRINSIC_OP:
659 new->operator = operator;
666 if (gfc_match_eos () == MATCH_YES)
668 if (gfc_match_char (',') != MATCH_YES)
675 gfc_syntax_error (ST_USE);
683 /* Given a name and a number, inst, return the inst name
684 under which to load this symbol. Returns NULL if this
685 symbol shouldn't be loaded. If inst is zero, returns
686 the number of instances of this name. If interface is
687 true, a user-defined operator is sought, otherwise only
688 non-operators are sought. */
691 find_use_name_n (const char *name, int *inst, bool interface)
697 for (u = gfc_rename_list; u; u = u->next)
699 if (strcmp (u->use_name, name) != 0
700 || (u->operator == INTRINSIC_USER && !interface)
701 || (u->operator != INTRINSIC_USER && interface))
714 return only_flag ? NULL : name;
718 return (u->local_name[0] != '\0') ? u->local_name : name;
722 /* Given a name, return the name under which to load this symbol.
723 Returns NULL if this symbol shouldn't be loaded. */
726 find_use_name (const char *name, bool interface)
729 return find_use_name_n (name, &i, interface);
733 /* Given a real name, return the number of use names associated with it. */
736 number_use_names (const char *name, bool interface)
740 c = find_use_name_n (name, &i, interface);
745 /* Try to find the operator in the current list. */
747 static gfc_use_rename *
748 find_use_operator (gfc_intrinsic_op operator)
752 for (u = gfc_rename_list; u; u = u->next)
753 if (u->operator == operator)
760 /*****************************************************************/
762 /* The next couple of subroutines maintain a tree used to avoid a
763 brute-force search for a combination of true name and module name.
764 While symtree names, the name that a particular symbol is known by
765 can changed with USE statements, we still have to keep track of the
766 true names to generate the correct reference, and also avoid
767 loading the same real symbol twice in a program unit.
769 When we start reading, the true name tree is built and maintained
770 as symbols are read. The tree is searched as we load new symbols
771 to see if it already exists someplace in the namespace. */
773 typedef struct true_name
775 BBT_HEADER (true_name);
780 static true_name *true_name_root;
783 /* Compare two true_name structures. */
786 compare_true_names (void *_t1, void *_t2)
791 t1 = (true_name *) _t1;
792 t2 = (true_name *) _t2;
794 c = ((t1->sym->module > t2->sym->module)
795 - (t1->sym->module < t2->sym->module));
799 return strcmp (t1->sym->name, t2->sym->name);
803 /* Given a true name, search the true name tree to see if it exists
804 within the main namespace. */
807 find_true_name (const char *name, const char *module)
813 sym.name = gfc_get_string (name);
815 sym.module = gfc_get_string (module);
823 c = compare_true_names ((void *) (&t), (void *) p);
827 p = (c < 0) ? p->left : p->right;
834 /* Given a gfc_symbol pointer that is not in the true name tree, add it. */
837 add_true_name (gfc_symbol *sym)
841 t = gfc_getmem (sizeof (true_name));
844 gfc_insert_bbt (&true_name_root, t, compare_true_names);
848 /* Recursive function to build the initial true name tree by
849 recursively traversing the current namespace. */
852 build_tnt (gfc_symtree *st)
857 build_tnt (st->left);
858 build_tnt (st->right);
860 if (find_true_name (st->n.sym->name, st->n.sym->module) != NULL)
863 add_true_name (st->n.sym);
867 /* Initialize the true name tree with the current namespace. */
870 init_true_name_tree (void)
872 true_name_root = NULL;
873 build_tnt (gfc_current_ns->sym_root);
877 /* Recursively free a true name tree node. */
880 free_true_name (true_name *t)
884 free_true_name (t->left);
885 free_true_name (t->right);
891 /*****************************************************************/
893 /* Module reading and writing. */
897 ATOM_NAME, ATOM_LPAREN, ATOM_RPAREN, ATOM_INTEGER, ATOM_STRING
901 static atom_type last_atom;
904 /* The name buffer must be at least as long as a symbol name. Right
905 now it's not clear how we're going to store numeric constants--
906 probably as a hexadecimal string, since this will allow the exact
907 number to be preserved (this can't be done by a decimal
908 representation). Worry about that later. TODO! */
910 #define MAX_ATOM_SIZE 100
913 static char *atom_string, atom_name[MAX_ATOM_SIZE];
916 /* Report problems with a module. Error reporting is not very
917 elaborate, since this sorts of errors shouldn't really happen.
918 This subroutine never returns. */
920 static void bad_module (const char *) ATTRIBUTE_NORETURN;
923 bad_module (const char *msgid)
930 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
931 module_name, module_line, module_column, msgid);
934 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
935 module_name, module_line, module_column, msgid);
938 gfc_fatal_error ("Module %s at line %d column %d: %s",
939 module_name, module_line, module_column, msgid);
945 /* Set the module's input pointer. */
948 set_module_locus (module_locus *m)
950 module_column = m->column;
951 module_line = m->line;
952 fsetpos (module_fp, &m->pos);
956 /* Get the module's input pointer so that we can restore it later. */
959 get_module_locus (module_locus *m)
961 m->column = module_column;
962 m->line = module_line;
963 fgetpos (module_fp, &m->pos);
967 /* Get the next character in the module, updating our reckoning of
975 c = getc (module_fp);
978 bad_module ("Unexpected EOF");
991 /* Parse a string constant. The delimiter is guaranteed to be a
1001 get_module_locus (&start);
1005 /* See how long the string is. */
1010 bad_module ("Unexpected end of module in string constant");
1028 set_module_locus (&start);
1030 atom_string = p = gfc_getmem (len + 1);
1032 for (; len > 0; len--)
1036 module_char (); /* Guaranteed to be another \'. */
1040 module_char (); /* Terminating \'. */
1041 *p = '\0'; /* C-style string for debug purposes. */
1045 /* Parse a small integer. */
1048 parse_integer (int c)
1056 get_module_locus (&m);
1062 atom_int = 10 * atom_int + c - '0';
1063 if (atom_int > 99999999)
1064 bad_module ("Integer overflow");
1067 set_module_locus (&m);
1085 get_module_locus (&m);
1090 if (!ISALNUM (c) && c != '_' && c != '-')
1094 if (++len > GFC_MAX_SYMBOL_LEN)
1095 bad_module ("Name too long");
1100 fseek (module_fp, -1, SEEK_CUR);
1101 module_column = m.column + len - 1;
1108 /* Read the next atom in the module's input stream. */
1119 while (c == ' ' || c == '\r' || c == '\n');
1144 return ATOM_INTEGER;
1202 bad_module ("Bad name");
1209 /* Peek at the next atom on the input. */
1217 get_module_locus (&m);
1220 if (a == ATOM_STRING)
1221 gfc_free (atom_string);
1223 set_module_locus (&m);
1228 /* Read the next atom from the input, requiring that it be a
1232 require_atom (atom_type type)
1238 get_module_locus (&m);
1246 p = _("Expected name");
1249 p = _("Expected left parenthesis");
1252 p = _("Expected right parenthesis");
1255 p = _("Expected integer");
1258 p = _("Expected string");
1261 gfc_internal_error ("require_atom(): bad atom type required");
1264 set_module_locus (&m);
1270 /* Given a pointer to an mstring array, require that the current input
1271 be one of the strings in the array. We return the enum value. */
1274 find_enum (const mstring *m)
1278 i = gfc_string2code (m, atom_name);
1282 bad_module ("find_enum(): Enum not found");
1288 /**************** Module output subroutines ***************************/
1290 /* Output a character to a module file. */
1293 write_char (char out)
1295 if (putc (out, module_fp) == EOF)
1296 gfc_fatal_error ("Error writing modules file: %s", strerror (errno));
1298 /* Add this to our MD5. */
1299 md5_process_bytes (&out, sizeof (out), &ctx);
1311 /* Write an atom to a module. The line wrapping isn't perfect, but it
1312 should work most of the time. This isn't that big of a deal, since
1313 the file really isn't meant to be read by people anyway. */
1316 write_atom (atom_type atom, const void *v)
1338 i = *((const int *) v);
1340 gfc_internal_error ("write_atom(): Writing negative integer");
1342 sprintf (buffer, "%d", i);
1347 gfc_internal_error ("write_atom(): Trying to write dab atom");
1351 if(p == NULL || *p == '\0')
1356 if (atom != ATOM_RPAREN)
1358 if (module_column + len > 72)
1363 if (last_atom != ATOM_LPAREN && module_column != 1)
1368 if (atom == ATOM_STRING)
1371 while (p != NULL && *p)
1373 if (atom == ATOM_STRING && *p == '\'')
1378 if (atom == ATOM_STRING)
1386 /***************** Mid-level I/O subroutines *****************/
1388 /* These subroutines let their caller read or write atoms without
1389 caring about which of the two is actually happening. This lets a
1390 subroutine concentrate on the actual format of the data being
1393 static void mio_expr (gfc_expr **);
1394 pointer_info *mio_symbol_ref (gfc_symbol **);
1395 pointer_info *mio_interface_rest (gfc_interface **);
1396 static void mio_symtree_ref (gfc_symtree **);
1398 /* Read or write an enumerated value. On writing, we return the input
1399 value for the convenience of callers. We avoid using an integer
1400 pointer because enums are sometimes inside bitfields. */
1403 mio_name (int t, const mstring *m)
1405 if (iomode == IO_OUTPUT)
1406 write_atom (ATOM_NAME, gfc_code2string (m, t));
1409 require_atom (ATOM_NAME);
1416 /* Specialization of mio_name. */
1418 #define DECL_MIO_NAME(TYPE) \
1419 static inline TYPE \
1420 MIO_NAME(TYPE) (TYPE t, const mstring *m) \
1422 return (TYPE) mio_name ((int) t, m); \
1424 #define MIO_NAME(TYPE) mio_name_##TYPE
1429 if (iomode == IO_OUTPUT)
1430 write_atom (ATOM_LPAREN, NULL);
1432 require_atom (ATOM_LPAREN);
1439 if (iomode == IO_OUTPUT)
1440 write_atom (ATOM_RPAREN, NULL);
1442 require_atom (ATOM_RPAREN);
1447 mio_integer (int *ip)
1449 if (iomode == IO_OUTPUT)
1450 write_atom (ATOM_INTEGER, ip);
1453 require_atom (ATOM_INTEGER);
1459 /* Read or write a character pointer that points to a string on the heap. */
1462 mio_allocated_string (const char *s)
1464 if (iomode == IO_OUTPUT)
1466 write_atom (ATOM_STRING, s);
1471 require_atom (ATOM_STRING);
1477 /* Functions for quoting and unquoting strings. */
1480 quote_string (const gfc_char_t *s, const size_t slength)
1482 const gfc_char_t *p;
1486 /* Calculate the length we'll need: a backslash takes two ("\\"),
1487 non-printable characters take 10 ("\Uxxxxxxxx") and others take 1. */
1488 for (p = s, i = 0; i < slength; p++, i++)
1492 else if (!gfc_wide_is_printable (*p))
1498 q = res = gfc_getmem (len + 1);
1499 for (p = s, i = 0; i < slength; p++, i++)
1502 *q++ = '\\', *q++ = '\\';
1503 else if (!gfc_wide_is_printable (*p))
1505 sprintf (q, "\\U%08" HOST_WIDE_INT_PRINT "ux",
1506 (unsigned HOST_WIDE_INT) *p);
1510 *q++ = (unsigned char) *p;
1518 unquote_string (const char *s)
1524 for (p = s, len = 0; *p; p++, len++)
1531 else if (p[1] == 'U')
1532 p += 9; /* That is a "\U????????". */
1534 gfc_internal_error ("unquote_string(): got bad string");
1537 res = gfc_get_wide_string (len + 1);
1538 for (i = 0, p = s; i < len; i++, p++)
1543 res[i] = (unsigned char) *p;
1544 else if (p[1] == '\\')
1546 res[i] = (unsigned char) '\\';
1551 /* We read the 8-digits hexadecimal constant that follows. */
1556 gcc_assert (p[1] == 'U');
1557 for (j = 0; j < 8; j++)
1560 gcc_assert (sscanf (&p[j+2], "%01x", &n) == 1);
1574 /* Read or write a character pointer that points to a wide string on the
1575 heap, performing quoting/unquoting of nonprintable characters using the
1576 form \U???????? (where each ? is a hexadecimal digit).
1577 Length is the length of the string, only known and used in output mode. */
1579 static const gfc_char_t *
1580 mio_allocated_wide_string (const gfc_char_t *s, const size_t length)
1582 if (iomode == IO_OUTPUT)
1584 char *quoted = quote_string (s, length);
1585 write_atom (ATOM_STRING, quoted);
1591 gfc_char_t *unquoted;
1593 require_atom (ATOM_STRING);
1594 unquoted = unquote_string (atom_string);
1595 gfc_free (atom_string);
1601 /* Read or write a string that is in static memory. */
1604 mio_pool_string (const char **stringp)
1606 /* TODO: one could write the string only once, and refer to it via a
1609 /* As a special case we have to deal with a NULL string. This
1610 happens for the 'module' member of 'gfc_symbol's that are not in a
1611 module. We read / write these as the empty string. */
1612 if (iomode == IO_OUTPUT)
1614 const char *p = *stringp == NULL ? "" : *stringp;
1615 write_atom (ATOM_STRING, p);
1619 require_atom (ATOM_STRING);
1620 *stringp = atom_string[0] == '\0' ? NULL : gfc_get_string (atom_string);
1621 gfc_free (atom_string);
1626 /* Read or write a string that is inside of some already-allocated
1630 mio_internal_string (char *string)
1632 if (iomode == IO_OUTPUT)
1633 write_atom (ATOM_STRING, string);
1636 require_atom (ATOM_STRING);
1637 strcpy (string, atom_string);
1638 gfc_free (atom_string);
1644 { AB_ALLOCATABLE, AB_DIMENSION, AB_EXTERNAL, AB_INTRINSIC, AB_OPTIONAL,
1645 AB_POINTER, AB_TARGET, AB_DUMMY, AB_RESULT, AB_DATA,
1646 AB_IN_NAMELIST, AB_IN_COMMON, AB_FUNCTION, AB_SUBROUTINE, AB_SEQUENCE,
1647 AB_ELEMENTAL, AB_PURE, AB_RECURSIVE, AB_GENERIC, AB_ALWAYS_EXPLICIT,
1648 AB_CRAY_POINTER, AB_CRAY_POINTEE, AB_THREADPRIVATE, AB_ALLOC_COMP,
1649 AB_POINTER_COMP, AB_PRIVATE_COMP, AB_VALUE, AB_VOLATILE, AB_PROTECTED,
1650 AB_IS_BIND_C, AB_IS_C_INTEROP, AB_IS_ISO_C, AB_ABSTRACT, AB_ZERO_COMP
1654 static const mstring attr_bits[] =
1656 minit ("ALLOCATABLE", AB_ALLOCATABLE),
1657 minit ("DIMENSION", AB_DIMENSION),
1658 minit ("EXTERNAL", AB_EXTERNAL),
1659 minit ("INTRINSIC", AB_INTRINSIC),
1660 minit ("OPTIONAL", AB_OPTIONAL),
1661 minit ("POINTER", AB_POINTER),
1662 minit ("VOLATILE", AB_VOLATILE),
1663 minit ("TARGET", AB_TARGET),
1664 minit ("THREADPRIVATE", AB_THREADPRIVATE),
1665 minit ("DUMMY", AB_DUMMY),
1666 minit ("RESULT", AB_RESULT),
1667 minit ("DATA", AB_DATA),
1668 minit ("IN_NAMELIST", AB_IN_NAMELIST),
1669 minit ("IN_COMMON", AB_IN_COMMON),
1670 minit ("FUNCTION", AB_FUNCTION),
1671 minit ("SUBROUTINE", AB_SUBROUTINE),
1672 minit ("SEQUENCE", AB_SEQUENCE),
1673 minit ("ELEMENTAL", AB_ELEMENTAL),
1674 minit ("PURE", AB_PURE),
1675 minit ("RECURSIVE", AB_RECURSIVE),
1676 minit ("GENERIC", AB_GENERIC),
1677 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT),
1678 minit ("CRAY_POINTER", AB_CRAY_POINTER),
1679 minit ("CRAY_POINTEE", AB_CRAY_POINTEE),
1680 minit ("IS_BIND_C", AB_IS_BIND_C),
1681 minit ("IS_C_INTEROP", AB_IS_C_INTEROP),
1682 minit ("IS_ISO_C", AB_IS_ISO_C),
1683 minit ("VALUE", AB_VALUE),
1684 minit ("ALLOC_COMP", AB_ALLOC_COMP),
1685 minit ("POINTER_COMP", AB_POINTER_COMP),
1686 minit ("PRIVATE_COMP", AB_PRIVATE_COMP),
1687 minit ("ZERO_COMP", AB_ZERO_COMP),
1688 minit ("PROTECTED", AB_PROTECTED),
1689 minit ("ABSTRACT", AB_ABSTRACT),
1694 /* Specialization of mio_name. */
1695 DECL_MIO_NAME (ab_attribute)
1696 DECL_MIO_NAME (ar_type)
1697 DECL_MIO_NAME (array_type)
1699 DECL_MIO_NAME (expr_t)
1700 DECL_MIO_NAME (gfc_access)
1701 DECL_MIO_NAME (gfc_intrinsic_op)
1702 DECL_MIO_NAME (ifsrc)
1703 DECL_MIO_NAME (save_state)
1704 DECL_MIO_NAME (procedure_type)
1705 DECL_MIO_NAME (ref_type)
1706 DECL_MIO_NAME (sym_flavor)
1707 DECL_MIO_NAME (sym_intent)
1708 #undef DECL_MIO_NAME
1710 /* Symbol attributes are stored in list with the first three elements
1711 being the enumerated fields, while the remaining elements (if any)
1712 indicate the individual attribute bits. The access field is not
1713 saved-- it controls what symbols are exported when a module is
1717 mio_symbol_attribute (symbol_attribute *attr)
1723 attr->flavor = MIO_NAME (sym_flavor) (attr->flavor, flavors);
1724 attr->intent = MIO_NAME (sym_intent) (attr->intent, intents);
1725 attr->proc = MIO_NAME (procedure_type) (attr->proc, procedures);
1726 attr->if_source = MIO_NAME (ifsrc) (attr->if_source, ifsrc_types);
1727 attr->save = MIO_NAME (save_state) (attr->save, save_status);
1729 if (iomode == IO_OUTPUT)
1731 if (attr->allocatable)
1732 MIO_NAME (ab_attribute) (AB_ALLOCATABLE, attr_bits);
1733 if (attr->dimension)
1734 MIO_NAME (ab_attribute) (AB_DIMENSION, attr_bits);
1736 MIO_NAME (ab_attribute) (AB_EXTERNAL, attr_bits);
1737 if (attr->intrinsic)
1738 MIO_NAME (ab_attribute) (AB_INTRINSIC, attr_bits);
1740 MIO_NAME (ab_attribute) (AB_OPTIONAL, attr_bits);
1742 MIO_NAME (ab_attribute) (AB_POINTER, attr_bits);
1743 if (attr->protected)
1744 MIO_NAME (ab_attribute) (AB_PROTECTED, attr_bits);
1746 MIO_NAME (ab_attribute) (AB_VALUE, attr_bits);
1747 if (attr->volatile_)
1748 MIO_NAME (ab_attribute) (AB_VOLATILE, attr_bits);
1750 MIO_NAME (ab_attribute) (AB_TARGET, attr_bits);
1751 if (attr->threadprivate)
1752 MIO_NAME (ab_attribute) (AB_THREADPRIVATE, attr_bits);
1754 MIO_NAME (ab_attribute) (AB_DUMMY, attr_bits);
1756 MIO_NAME (ab_attribute) (AB_RESULT, attr_bits);
1757 /* We deliberately don't preserve the "entry" flag. */
1760 MIO_NAME (ab_attribute) (AB_DATA, attr_bits);
1761 if (attr->in_namelist)
1762 MIO_NAME (ab_attribute) (AB_IN_NAMELIST, attr_bits);
1763 if (attr->in_common)
1764 MIO_NAME (ab_attribute) (AB_IN_COMMON, attr_bits);
1767 MIO_NAME (ab_attribute) (AB_FUNCTION, attr_bits);
1768 if (attr->subroutine)
1769 MIO_NAME (ab_attribute) (AB_SUBROUTINE, attr_bits);
1771 MIO_NAME (ab_attribute) (AB_GENERIC, attr_bits);
1773 MIO_NAME (ab_attribute) (AB_ABSTRACT, attr_bits);
1776 MIO_NAME (ab_attribute) (AB_SEQUENCE, attr_bits);
1777 if (attr->elemental)
1778 MIO_NAME (ab_attribute) (AB_ELEMENTAL, attr_bits);
1780 MIO_NAME (ab_attribute) (AB_PURE, attr_bits);
1781 if (attr->recursive)
1782 MIO_NAME (ab_attribute) (AB_RECURSIVE, attr_bits);
1783 if (attr->always_explicit)
1784 MIO_NAME (ab_attribute) (AB_ALWAYS_EXPLICIT, attr_bits);
1785 if (attr->cray_pointer)
1786 MIO_NAME (ab_attribute) (AB_CRAY_POINTER, attr_bits);
1787 if (attr->cray_pointee)
1788 MIO_NAME (ab_attribute) (AB_CRAY_POINTEE, attr_bits);
1789 if (attr->is_bind_c)
1790 MIO_NAME(ab_attribute) (AB_IS_BIND_C, attr_bits);
1791 if (attr->is_c_interop)
1792 MIO_NAME(ab_attribute) (AB_IS_C_INTEROP, attr_bits);
1794 MIO_NAME(ab_attribute) (AB_IS_ISO_C, attr_bits);
1795 if (attr->alloc_comp)
1796 MIO_NAME (ab_attribute) (AB_ALLOC_COMP, attr_bits);
1797 if (attr->pointer_comp)
1798 MIO_NAME (ab_attribute) (AB_POINTER_COMP, attr_bits);
1799 if (attr->private_comp)
1800 MIO_NAME (ab_attribute) (AB_PRIVATE_COMP, attr_bits);
1801 if (attr->zero_comp)
1802 MIO_NAME (ab_attribute) (AB_ZERO_COMP, attr_bits);
1812 if (t == ATOM_RPAREN)
1815 bad_module ("Expected attribute bit name");
1817 switch ((ab_attribute) find_enum (attr_bits))
1819 case AB_ALLOCATABLE:
1820 attr->allocatable = 1;
1823 attr->dimension = 1;
1829 attr->intrinsic = 1;
1838 attr->protected = 1;
1844 attr->volatile_ = 1;
1849 case AB_THREADPRIVATE:
1850 attr->threadprivate = 1;
1861 case AB_IN_NAMELIST:
1862 attr->in_namelist = 1;
1865 attr->in_common = 1;
1871 attr->subroutine = 1;
1883 attr->elemental = 1;
1889 attr->recursive = 1;
1891 case AB_ALWAYS_EXPLICIT:
1892 attr->always_explicit = 1;
1894 case AB_CRAY_POINTER:
1895 attr->cray_pointer = 1;
1897 case AB_CRAY_POINTEE:
1898 attr->cray_pointee = 1;
1901 attr->is_bind_c = 1;
1903 case AB_IS_C_INTEROP:
1904 attr->is_c_interop = 1;
1910 attr->alloc_comp = 1;
1912 case AB_POINTER_COMP:
1913 attr->pointer_comp = 1;
1915 case AB_PRIVATE_COMP:
1916 attr->private_comp = 1;
1919 attr->zero_comp = 1;
1927 static const mstring bt_types[] = {
1928 minit ("INTEGER", BT_INTEGER),
1929 minit ("REAL", BT_REAL),
1930 minit ("COMPLEX", BT_COMPLEX),
1931 minit ("LOGICAL", BT_LOGICAL),
1932 minit ("CHARACTER", BT_CHARACTER),
1933 minit ("DERIVED", BT_DERIVED),
1934 minit ("PROCEDURE", BT_PROCEDURE),
1935 minit ("UNKNOWN", BT_UNKNOWN),
1936 minit ("VOID", BT_VOID),
1942 mio_charlen (gfc_charlen **clp)
1948 if (iomode == IO_OUTPUT)
1952 mio_expr (&cl->length);
1956 if (peek_atom () != ATOM_RPAREN)
1958 cl = gfc_get_charlen ();
1959 mio_expr (&cl->length);
1963 cl->next = gfc_current_ns->cl_list;
1964 gfc_current_ns->cl_list = cl;
1972 /* See if a name is a generated name. */
1975 check_unique_name (const char *name)
1977 return *name == '@';
1982 mio_typespec (gfc_typespec *ts)
1986 ts->type = MIO_NAME (bt) (ts->type, bt_types);
1988 if (ts->type != BT_DERIVED)
1989 mio_integer (&ts->kind);
1991 mio_symbol_ref (&ts->derived);
1993 /* Add info for C interop and is_iso_c. */
1994 mio_integer (&ts->is_c_interop);
1995 mio_integer (&ts->is_iso_c);
1997 /* If the typespec is for an identifier either from iso_c_binding, or
1998 a constant that was initialized to an identifier from it, use the
1999 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
2001 ts->f90_type = MIO_NAME (bt) (ts->f90_type, bt_types);
2003 ts->f90_type = MIO_NAME (bt) (ts->type, bt_types);
2005 if (ts->type != BT_CHARACTER)
2007 /* ts->cl is only valid for BT_CHARACTER. */
2012 mio_charlen (&ts->cl);
2018 static const mstring array_spec_types[] = {
2019 minit ("EXPLICIT", AS_EXPLICIT),
2020 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE),
2021 minit ("DEFERRED", AS_DEFERRED),
2022 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE),
2028 mio_array_spec (gfc_array_spec **asp)
2035 if (iomode == IO_OUTPUT)
2043 if (peek_atom () == ATOM_RPAREN)
2049 *asp = as = gfc_get_array_spec ();
2052 mio_integer (&as->rank);
2053 as->type = MIO_NAME (array_type) (as->type, array_spec_types);
2055 for (i = 0; i < as->rank; i++)
2057 mio_expr (&as->lower[i]);
2058 mio_expr (&as->upper[i]);
2066 /* Given a pointer to an array reference structure (which lives in a
2067 gfc_ref structure), find the corresponding array specification
2068 structure. Storing the pointer in the ref structure doesn't quite
2069 work when loading from a module. Generating code for an array
2070 reference also needs more information than just the array spec. */
2072 static const mstring array_ref_types[] = {
2073 minit ("FULL", AR_FULL),
2074 minit ("ELEMENT", AR_ELEMENT),
2075 minit ("SECTION", AR_SECTION),
2081 mio_array_ref (gfc_array_ref *ar)
2086 ar->type = MIO_NAME (ar_type) (ar->type, array_ref_types);
2087 mio_integer (&ar->dimen);
2095 for (i = 0; i < ar->dimen; i++)
2096 mio_expr (&ar->start[i]);
2101 for (i = 0; i < ar->dimen; i++)
2103 mio_expr (&ar->start[i]);
2104 mio_expr (&ar->end[i]);
2105 mio_expr (&ar->stride[i]);
2111 gfc_internal_error ("mio_array_ref(): Unknown array ref");
2114 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
2115 we can't call mio_integer directly. Instead loop over each element
2116 and cast it to/from an integer. */
2117 if (iomode == IO_OUTPUT)
2119 for (i = 0; i < ar->dimen; i++)
2121 int tmp = (int)ar->dimen_type[i];
2122 write_atom (ATOM_INTEGER, &tmp);
2127 for (i = 0; i < ar->dimen; i++)
2129 require_atom (ATOM_INTEGER);
2130 ar->dimen_type[i] = atom_int;
2134 if (iomode == IO_INPUT)
2136 ar->where = gfc_current_locus;
2138 for (i = 0; i < ar->dimen; i++)
2139 ar->c_where[i] = gfc_current_locus;
2146 /* Saves or restores a pointer. The pointer is converted back and
2147 forth from an integer. We return the pointer_info pointer so that
2148 the caller can take additional action based on the pointer type. */
2150 static pointer_info *
2151 mio_pointer_ref (void *gp)
2155 if (iomode == IO_OUTPUT)
2157 p = get_pointer (*((char **) gp));
2158 write_atom (ATOM_INTEGER, &p->integer);
2162 require_atom (ATOM_INTEGER);
2163 p = add_fixup (atom_int, gp);
2170 /* Save and load references to components that occur within
2171 expressions. We have to describe these references by a number and
2172 by name. The number is necessary for forward references during
2173 reading, and the name is necessary if the symbol already exists in
2174 the namespace and is not loaded again. */
2177 mio_component_ref (gfc_component **cp, gfc_symbol *sym)
2179 char name[GFC_MAX_SYMBOL_LEN + 1];
2183 p = mio_pointer_ref (cp);
2184 if (p->type == P_UNKNOWN)
2185 p->type = P_COMPONENT;
2187 if (iomode == IO_OUTPUT)
2188 mio_pool_string (&(*cp)->name);
2191 mio_internal_string (name);
2193 /* It can happen that a component reference can be read before the
2194 associated derived type symbol has been loaded. Return now and
2195 wait for a later iteration of load_needed. */
2199 if (sym->components != NULL && p->u.pointer == NULL)
2201 /* Symbol already loaded, so search by name. */
2202 for (q = sym->components; q; q = q->next)
2203 if (strcmp (q->name, name) == 0)
2207 gfc_internal_error ("mio_component_ref(): Component not found");
2209 associate_integer_pointer (p, q);
2212 /* Make sure this symbol will eventually be loaded. */
2213 p = find_pointer2 (sym);
2214 if (p->u.rsym.state == UNUSED)
2215 p->u.rsym.state = NEEDED;
2221 mio_component (gfc_component *c)
2228 if (iomode == IO_OUTPUT)
2230 p = get_pointer (c);
2231 mio_integer (&p->integer);
2236 p = get_integer (n);
2237 associate_integer_pointer (p, c);
2240 if (p->type == P_UNKNOWN)
2241 p->type = P_COMPONENT;
2243 mio_pool_string (&c->name);
2244 mio_typespec (&c->ts);
2245 mio_array_spec (&c->as);
2247 mio_integer (&c->dimension);
2248 mio_integer (&c->pointer);
2249 mio_integer (&c->allocatable);
2250 c->access = MIO_NAME (gfc_access) (c->access, access_types);
2252 mio_expr (&c->initializer);
2258 mio_component_list (gfc_component **cp)
2260 gfc_component *c, *tail;
2264 if (iomode == IO_OUTPUT)
2266 for (c = *cp; c; c = c->next)
2276 if (peek_atom () == ATOM_RPAREN)
2279 c = gfc_get_component ();
2296 mio_actual_arg (gfc_actual_arglist *a)
2299 mio_pool_string (&a->name);
2300 mio_expr (&a->expr);
2306 mio_actual_arglist (gfc_actual_arglist **ap)
2308 gfc_actual_arglist *a, *tail;
2312 if (iomode == IO_OUTPUT)
2314 for (a = *ap; a; a = a->next)
2324 if (peek_atom () != ATOM_LPAREN)
2327 a = gfc_get_actual_arglist ();
2343 /* Read and write formal argument lists. */
2346 mio_formal_arglist (gfc_symbol *sym)
2348 gfc_formal_arglist *f, *tail;
2352 if (iomode == IO_OUTPUT)
2354 for (f = sym->formal; f; f = f->next)
2355 mio_symbol_ref (&f->sym);
2359 sym->formal = tail = NULL;
2361 while (peek_atom () != ATOM_RPAREN)
2363 f = gfc_get_formal_arglist ();
2364 mio_symbol_ref (&f->sym);
2366 if (sym->formal == NULL)
2379 /* Save or restore a reference to a symbol node. */
2382 mio_symbol_ref (gfc_symbol **symp)
2386 p = mio_pointer_ref (symp);
2387 if (p->type == P_UNKNOWN)
2390 if (iomode == IO_OUTPUT)
2392 if (p->u.wsym.state == UNREFERENCED)
2393 p->u.wsym.state = NEEDS_WRITE;
2397 if (p->u.rsym.state == UNUSED)
2398 p->u.rsym.state = NEEDED;
2404 /* Save or restore a reference to a symtree node. */
2407 mio_symtree_ref (gfc_symtree **stp)
2412 if (iomode == IO_OUTPUT)
2413 mio_symbol_ref (&(*stp)->n.sym);
2416 require_atom (ATOM_INTEGER);
2417 p = get_integer (atom_int);
2419 /* An unused equivalence member; make a symbol and a symtree
2421 if (in_load_equiv && p->u.rsym.symtree == NULL)
2423 /* Since this is not used, it must have a unique name. */
2424 p->u.rsym.symtree = gfc_get_unique_symtree (gfc_current_ns);
2426 /* Make the symbol. */
2427 if (p->u.rsym.sym == NULL)
2429 p->u.rsym.sym = gfc_new_symbol (p->u.rsym.true_name,
2431 p->u.rsym.sym->module = gfc_get_string (p->u.rsym.module);
2434 p->u.rsym.symtree->n.sym = p->u.rsym.sym;
2435 p->u.rsym.symtree->n.sym->refs++;
2436 p->u.rsym.referenced = 1;
2438 /* If the symbol is PRIVATE and in COMMON, load_commons will
2439 generate a fixup symbol, which must be associated. */
2441 resolve_fixups (p->fixup, p->u.rsym.sym);
2445 if (p->type == P_UNKNOWN)
2448 if (p->u.rsym.state == UNUSED)
2449 p->u.rsym.state = NEEDED;
2451 if (p->u.rsym.symtree != NULL)
2453 *stp = p->u.rsym.symtree;
2457 f = gfc_getmem (sizeof (fixup_t));
2459 f->next = p->u.rsym.stfixup;
2460 p->u.rsym.stfixup = f;
2462 f->pointer = (void **) stp;
2469 mio_iterator (gfc_iterator **ip)
2475 if (iomode == IO_OUTPUT)
2482 if (peek_atom () == ATOM_RPAREN)
2488 *ip = gfc_get_iterator ();
2493 mio_expr (&iter->var);
2494 mio_expr (&iter->start);
2495 mio_expr (&iter->end);
2496 mio_expr (&iter->step);
2504 mio_constructor (gfc_constructor **cp)
2506 gfc_constructor *c, *tail;
2510 if (iomode == IO_OUTPUT)
2512 for (c = *cp; c; c = c->next)
2515 mio_expr (&c->expr);
2516 mio_iterator (&c->iterator);
2525 while (peek_atom () != ATOM_RPAREN)
2527 c = gfc_get_constructor ();
2537 mio_expr (&c->expr);
2538 mio_iterator (&c->iterator);
2547 static const mstring ref_types[] = {
2548 minit ("ARRAY", REF_ARRAY),
2549 minit ("COMPONENT", REF_COMPONENT),
2550 minit ("SUBSTRING", REF_SUBSTRING),
2556 mio_ref (gfc_ref **rp)
2563 r->type = MIO_NAME (ref_type) (r->type, ref_types);
2568 mio_array_ref (&r->u.ar);
2572 mio_symbol_ref (&r->u.c.sym);
2573 mio_component_ref (&r->u.c.component, r->u.c.sym);
2577 mio_expr (&r->u.ss.start);
2578 mio_expr (&r->u.ss.end);
2579 mio_charlen (&r->u.ss.length);
2588 mio_ref_list (gfc_ref **rp)
2590 gfc_ref *ref, *head, *tail;
2594 if (iomode == IO_OUTPUT)
2596 for (ref = *rp; ref; ref = ref->next)
2603 while (peek_atom () != ATOM_RPAREN)
2606 head = tail = gfc_get_ref ();
2609 tail->next = gfc_get_ref ();
2623 /* Read and write an integer value. */
2626 mio_gmp_integer (mpz_t *integer)
2630 if (iomode == IO_INPUT)
2632 if (parse_atom () != ATOM_STRING)
2633 bad_module ("Expected integer string");
2635 mpz_init (*integer);
2636 if (mpz_set_str (*integer, atom_string, 10))
2637 bad_module ("Error converting integer");
2639 gfc_free (atom_string);
2643 p = mpz_get_str (NULL, 10, *integer);
2644 write_atom (ATOM_STRING, p);
2651 mio_gmp_real (mpfr_t *real)
2656 if (iomode == IO_INPUT)
2658 if (parse_atom () != ATOM_STRING)
2659 bad_module ("Expected real string");
2662 mpfr_set_str (*real, atom_string, 16, GFC_RND_MODE);
2663 gfc_free (atom_string);
2667 p = mpfr_get_str (NULL, &exponent, 16, 0, *real, GFC_RND_MODE);
2669 if (mpfr_nan_p (*real) || mpfr_inf_p (*real))
2671 write_atom (ATOM_STRING, p);
2676 atom_string = gfc_getmem (strlen (p) + 20);
2678 sprintf (atom_string, "0.%s@%ld", p, exponent);
2680 /* Fix negative numbers. */
2681 if (atom_string[2] == '-')
2683 atom_string[0] = '-';
2684 atom_string[1] = '0';
2685 atom_string[2] = '.';
2688 write_atom (ATOM_STRING, atom_string);
2690 gfc_free (atom_string);
2696 /* Save and restore the shape of an array constructor. */
2699 mio_shape (mpz_t **pshape, int rank)
2705 /* A NULL shape is represented by (). */
2708 if (iomode == IO_OUTPUT)
2720 if (t == ATOM_RPAREN)
2727 shape = gfc_get_shape (rank);
2731 for (n = 0; n < rank; n++)
2732 mio_gmp_integer (&shape[n]);
2738 static const mstring expr_types[] = {
2739 minit ("OP", EXPR_OP),
2740 minit ("FUNCTION", EXPR_FUNCTION),
2741 minit ("CONSTANT", EXPR_CONSTANT),
2742 minit ("VARIABLE", EXPR_VARIABLE),
2743 minit ("SUBSTRING", EXPR_SUBSTRING),
2744 minit ("STRUCTURE", EXPR_STRUCTURE),
2745 minit ("ARRAY", EXPR_ARRAY),
2746 minit ("NULL", EXPR_NULL),
2750 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2751 generic operators, not in expressions. INTRINSIC_USER is also
2752 replaced by the correct function name by the time we see it. */
2754 static const mstring intrinsics[] =
2756 minit ("UPLUS", INTRINSIC_UPLUS),
2757 minit ("UMINUS", INTRINSIC_UMINUS),
2758 minit ("PLUS", INTRINSIC_PLUS),
2759 minit ("MINUS", INTRINSIC_MINUS),
2760 minit ("TIMES", INTRINSIC_TIMES),
2761 minit ("DIVIDE", INTRINSIC_DIVIDE),
2762 minit ("POWER", INTRINSIC_POWER),
2763 minit ("CONCAT", INTRINSIC_CONCAT),
2764 minit ("AND", INTRINSIC_AND),
2765 minit ("OR", INTRINSIC_OR),
2766 minit ("EQV", INTRINSIC_EQV),
2767 minit ("NEQV", INTRINSIC_NEQV),
2768 minit ("EQ_SIGN", INTRINSIC_EQ),
2769 minit ("EQ", INTRINSIC_EQ_OS),
2770 minit ("NE_SIGN", INTRINSIC_NE),
2771 minit ("NE", INTRINSIC_NE_OS),
2772 minit ("GT_SIGN", INTRINSIC_GT),
2773 minit ("GT", INTRINSIC_GT_OS),
2774 minit ("GE_SIGN", INTRINSIC_GE),
2775 minit ("GE", INTRINSIC_GE_OS),
2776 minit ("LT_SIGN", INTRINSIC_LT),
2777 minit ("LT", INTRINSIC_LT_OS),
2778 minit ("LE_SIGN", INTRINSIC_LE),
2779 minit ("LE", INTRINSIC_LE_OS),
2780 minit ("NOT", INTRINSIC_NOT),
2781 minit ("PARENTHESES", INTRINSIC_PARENTHESES),
2786 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2789 fix_mio_expr (gfc_expr *e)
2791 gfc_symtree *ns_st = NULL;
2794 if (iomode != IO_OUTPUT)
2799 /* If this is a symtree for a symbol that came from a contained module
2800 namespace, it has a unique name and we should look in the current
2801 namespace to see if the required, non-contained symbol is available
2802 yet. If so, the latter should be written. */
2803 if (e->symtree->n.sym && check_unique_name (e->symtree->name))
2804 ns_st = gfc_find_symtree (gfc_current_ns->sym_root,
2805 e->symtree->n.sym->name);
2807 /* On the other hand, if the existing symbol is the module name or the
2808 new symbol is a dummy argument, do not do the promotion. */
2809 if (ns_st && ns_st->n.sym
2810 && ns_st->n.sym->attr.flavor != FL_MODULE
2811 && !e->symtree->n.sym->attr.dummy)
2814 else if (e->expr_type == EXPR_FUNCTION && e->value.function.name)
2816 /* In some circumstances, a function used in an initialization
2817 expression, in one use associated module, can fail to be
2818 coupled to its symtree when used in a specification
2819 expression in another module. */
2820 fname = e->value.function.esym ? e->value.function.esym->name
2821 : e->value.function.isym->name;
2822 e->symtree = gfc_find_symtree (gfc_current_ns->sym_root, fname);
2827 /* Read and write expressions. The form "()" is allowed to indicate a
2831 mio_expr (gfc_expr **ep)
2839 if (iomode == IO_OUTPUT)
2848 MIO_NAME (expr_t) (e->expr_type, expr_types);
2853 if (t == ATOM_RPAREN)
2860 bad_module ("Expected expression type");
2862 e = *ep = gfc_get_expr ();
2863 e->where = gfc_current_locus;
2864 e->expr_type = (expr_t) find_enum (expr_types);
2867 mio_typespec (&e->ts);
2868 mio_integer (&e->rank);
2872 switch (e->expr_type)
2875 e->value.op.operator
2876 = MIO_NAME (gfc_intrinsic_op) (e->value.op.operator, intrinsics);
2878 switch (e->value.op.operator)
2880 case INTRINSIC_UPLUS:
2881 case INTRINSIC_UMINUS:
2883 case INTRINSIC_PARENTHESES:
2884 mio_expr (&e->value.op.op1);
2887 case INTRINSIC_PLUS:
2888 case INTRINSIC_MINUS:
2889 case INTRINSIC_TIMES:
2890 case INTRINSIC_DIVIDE:
2891 case INTRINSIC_POWER:
2892 case INTRINSIC_CONCAT:
2896 case INTRINSIC_NEQV:
2898 case INTRINSIC_EQ_OS:
2900 case INTRINSIC_NE_OS:
2902 case INTRINSIC_GT_OS:
2904 case INTRINSIC_GE_OS:
2906 case INTRINSIC_LT_OS:
2908 case INTRINSIC_LE_OS:
2909 mio_expr (&e->value.op.op1);
2910 mio_expr (&e->value.op.op2);
2914 bad_module ("Bad operator");
2920 mio_symtree_ref (&e->symtree);
2921 mio_actual_arglist (&e->value.function.actual);
2923 if (iomode == IO_OUTPUT)
2925 e->value.function.name
2926 = mio_allocated_string (e->value.function.name);
2927 flag = e->value.function.esym != NULL;
2928 mio_integer (&flag);
2930 mio_symbol_ref (&e->value.function.esym);
2932 write_atom (ATOM_STRING, e->value.function.isym->name);
2936 require_atom (ATOM_STRING);
2937 e->value.function.name = gfc_get_string (atom_string);
2938 gfc_free (atom_string);
2940 mio_integer (&flag);
2942 mio_symbol_ref (&e->value.function.esym);
2945 require_atom (ATOM_STRING);
2946 e->value.function.isym = gfc_find_function (atom_string);
2947 gfc_free (atom_string);
2954 mio_symtree_ref (&e->symtree);
2955 mio_ref_list (&e->ref);
2958 case EXPR_SUBSTRING:
2959 e->value.character.string
2960 = CONST_CAST (gfc_char_t *,
2961 mio_allocated_wide_string (e->value.character.string,
2962 e->value.character.length));
2963 mio_ref_list (&e->ref);
2966 case EXPR_STRUCTURE:
2968 mio_constructor (&e->value.constructor);
2969 mio_shape (&e->shape, e->rank);
2976 mio_gmp_integer (&e->value.integer);
2980 gfc_set_model_kind (e->ts.kind);
2981 mio_gmp_real (&e->value.real);
2985 gfc_set_model_kind (e->ts.kind);
2986 mio_gmp_real (&e->value.complex.r);
2987 mio_gmp_real (&e->value.complex.i);
2991 mio_integer (&e->value.logical);
2995 mio_integer (&e->value.character.length);
2996 e->value.character.string
2997 = CONST_CAST (gfc_char_t *,
2998 mio_allocated_wide_string (e->value.character.string,
2999 e->value.character.length));
3003 bad_module ("Bad type in constant expression");
3016 /* Read and write namelists. */
3019 mio_namelist (gfc_symbol *sym)
3021 gfc_namelist *n, *m;
3022 const char *check_name;
3026 if (iomode == IO_OUTPUT)
3028 for (n = sym->namelist; n; n = n->next)
3029 mio_symbol_ref (&n->sym);
3033 /* This departure from the standard is flagged as an error.
3034 It does, in fact, work correctly. TODO: Allow it
3036 if (sym->attr.flavor == FL_NAMELIST)
3038 check_name = find_use_name (sym->name, false);
3039 if (check_name && strcmp (check_name, sym->name) != 0)
3040 gfc_error ("Namelist %s cannot be renamed by USE "
3041 "association to %s", sym->name, check_name);
3045 while (peek_atom () != ATOM_RPAREN)
3047 n = gfc_get_namelist ();
3048 mio_symbol_ref (&n->sym);
3050 if (sym->namelist == NULL)
3057 sym->namelist_tail = m;
3064 /* Save/restore lists of gfc_interface stuctures. When loading an
3065 interface, we are really appending to the existing list of
3066 interfaces. Checking for duplicate and ambiguous interfaces has to
3067 be done later when all symbols have been loaded. */
3070 mio_interface_rest (gfc_interface **ip)
3072 gfc_interface *tail, *p;
3073 pointer_info *pi = NULL;
3075 if (iomode == IO_OUTPUT)
3078 for (p = *ip; p; p = p->next)
3079 mio_symbol_ref (&p->sym);
3094 if (peek_atom () == ATOM_RPAREN)
3097 p = gfc_get_interface ();
3098 p->where = gfc_current_locus;
3099 pi = mio_symbol_ref (&p->sym);
3115 /* Save/restore a nameless operator interface. */
3118 mio_interface (gfc_interface **ip)
3121 mio_interface_rest (ip);
3125 /* Save/restore a named operator interface. */
3128 mio_symbol_interface (const char **name, const char **module,
3132 mio_pool_string (name);
3133 mio_pool_string (module);
3134 mio_interface_rest (ip);
3139 mio_namespace_ref (gfc_namespace **nsp)
3144 p = mio_pointer_ref (nsp);
3146 if (p->type == P_UNKNOWN)
3147 p->type = P_NAMESPACE;
3149 if (iomode == IO_INPUT && p->integer != 0)
3151 ns = (gfc_namespace *) p->u.pointer;
3154 ns = gfc_get_namespace (NULL, 0);
3155 associate_integer_pointer (p, ns);
3163 /* Unlike most other routines, the address of the symbol node is already
3164 fixed on input and the name/module has already been filled in. */
3167 mio_symbol (gfc_symbol *sym)
3169 int intmod = INTMOD_NONE;
3171 gfc_formal_arglist *formal;
3175 mio_symbol_attribute (&sym->attr);
3176 mio_typespec (&sym->ts);
3178 /* Contained procedures don't have formal namespaces. Instead we output the
3179 procedure namespace. The will contain the formal arguments. */
3180 if (iomode == IO_OUTPUT)
3182 formal = sym->formal;
3183 while (formal && !formal->sym)
3184 formal = formal->next;
3187 mio_namespace_ref (&formal->sym->ns);
3189 mio_namespace_ref (&sym->formal_ns);
3193 mio_namespace_ref (&sym->formal_ns);
3196 sym->formal_ns->proc_name = sym;
3201 /* Save/restore common block links. */
3202 mio_symbol_ref (&sym->common_next);
3204 mio_formal_arglist (sym);
3206 if (sym->attr.flavor == FL_PARAMETER)
3207 mio_expr (&sym->value);
3209 mio_array_spec (&sym->as);
3211 mio_symbol_ref (&sym->result);
3213 if (sym->attr.cray_pointee)
3214 mio_symbol_ref (&sym->cp_pointer);
3216 /* Note that components are always saved, even if they are supposed
3217 to be private. Component access is checked during searching. */
3219 mio_component_list (&sym->components);
3221 if (sym->components != NULL)
3222 sym->component_access
3223 = MIO_NAME (gfc_access) (sym->component_access, access_types);
3227 /* Add the fields that say whether this is from an intrinsic module,
3228 and if so, what symbol it is within the module. */
3229 /* mio_integer (&(sym->from_intmod)); */
3230 if (iomode == IO_OUTPUT)
3232 intmod = sym->from_intmod;
3233 mio_integer (&intmod);
3237 mio_integer (&intmod);
3238 sym->from_intmod = intmod;
3241 mio_integer (&(sym->intmod_sym_id));
3247 /************************* Top level subroutines *************************/
3249 /* Given a root symtree node and a symbol, try to find a symtree that
3250 references the symbol that is not a unique name. */
3252 static gfc_symtree *
3253 find_symtree_for_symbol (gfc_symtree *st, gfc_symbol *sym)
3255 gfc_symtree *s = NULL;
3260 s = find_symtree_for_symbol (st->right, sym);
3263 s = find_symtree_for_symbol (st->left, sym);
3267 if (st->n.sym == sym && !check_unique_name (st->name))
3274 /* A recursive function to look for a speficic symbol by name and by
3275 module. Whilst several symtrees might point to one symbol, its
3276 is sufficient for the purposes here than one exist. Note that
3277 generic interfaces are distinguished as are symbols that have been
3278 renamed in another module. */
3279 static gfc_symtree *
3280 find_symbol (gfc_symtree *st, const char *name,
3281 const char *module, int generic)
3284 gfc_symtree *retval, *s;
3286 if (st == NULL || st->n.sym == NULL)
3289 c = strcmp (name, st->n.sym->name);
3290 if (c == 0 && st->n.sym->module
3291 && strcmp (module, st->n.sym->module) == 0
3292 && !check_unique_name (st->name))
3294 s = gfc_find_symtree (gfc_current_ns->sym_root, name);
3296 /* Detect symbols that are renamed by use association in another
3297 module by the absence of a symtree and null attr.use_rename,
3298 since the latter is not transmitted in the module file. */
3299 if (((!generic && !st->n.sym->attr.generic)
3300 || (generic && st->n.sym->attr.generic))
3301 && !(s == NULL && !st->n.sym->attr.use_rename))
3305 retval = find_symbol (st->left, name, module, generic);
3308 retval = find_symbol (st->right, name, module, generic);
3314 /* Skip a list between balanced left and right parens. */
3324 switch (parse_atom ())
3335 gfc_free (atom_string);
3347 /* Load operator interfaces from the module. Interfaces are unusual
3348 in that they attach themselves to existing symbols. */
3351 load_operator_interfaces (void)
3354 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
3356 pointer_info *pi = NULL;
3361 while (peek_atom () != ATOM_RPAREN)
3365 mio_internal_string (name);
3366 mio_internal_string (module);
3368 n = number_use_names (name, true);
3371 for (i = 1; i <= n; i++)
3373 /* Decide if we need to load this one or not. */
3374 p = find_use_name_n (name, &i, true);
3378 while (parse_atom () != ATOM_RPAREN);
3384 uop = gfc_get_uop (p);
3385 pi = mio_interface_rest (&uop->operator);
3389 if (gfc_find_uop (p, NULL))
3391 uop = gfc_get_uop (p);
3392 uop->operator = gfc_get_interface ();
3393 uop->operator->where = gfc_current_locus;
3394 add_fixup (pi->integer, &uop->operator->sym);
3403 /* Load interfaces from the module. Interfaces are unusual in that
3404 they attach themselves to existing symbols. */
3407 load_generic_interfaces (void)
3410 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
3412 gfc_interface *generic = NULL;
3417 while (peek_atom () != ATOM_RPAREN)
3421 mio_internal_string (name);
3422 mio_internal_string (module);
3424 n = number_use_names (name, false);
3425 renamed = n ? 1 : 0;
3428 for (i = 1; i <= n; i++)
3431 /* Decide if we need to load this one or not. */
3432 p = find_use_name_n (name, &i, false);
3434 st = find_symbol (gfc_current_ns->sym_root,
3435 name, module_name, 1);
3437 if (!p || gfc_find_symbol (p, NULL, 0, &sym))
3439 /* Skip the specific names for these cases. */
3440 while (i == 1 && parse_atom () != ATOM_RPAREN);
3445 /* If the symbol exists already and is being USEd without being
3446 in an ONLY clause, do not load a new symtree(11.3.2). */
3447 if (!only_flag && st)
3452 /* Make the symbol inaccessible if it has been added by a USE
3453 statement without an ONLY(11.3.2). */
3455 && !st->n.sym->attr.use_only
3456 && !st->n.sym->attr.use_rename
3457 && strcmp (st->n.sym->module, module_name) == 0)
3460 gfc_delete_symtree (&gfc_current_ns->sym_root, name);
3461 st = gfc_get_unique_symtree (gfc_current_ns);
3468 if (strcmp (st->name, p) != 0)
3470 st = gfc_new_symtree (&gfc_current_ns->sym_root, p);
3476 /* Since we haven't found a valid generic interface, we had
3480 gfc_get_symbol (p, NULL, &sym);
3481 sym->name = gfc_get_string (name);
3482 sym->module = gfc_get_string (module_name);
3483 sym->attr.flavor = FL_PROCEDURE;
3484 sym->attr.generic = 1;
3485 sym->attr.use_assoc = 1;
3490 /* Unless sym is a generic interface, this reference
3493 st = gfc_find_symtree (gfc_current_ns->sym_root, p);
3497 if (st && !sym->attr.generic
3499 && strcmp(module, sym->module))
3503 sym->attr.use_only = only_flag;
3504 sym->attr.use_rename = renamed;
3508 mio_interface_rest (&sym->generic);
3509 generic = sym->generic;
3511 else if (!sym->generic)
3513 sym->generic = generic;
3514 sym->attr.generic_copy = 1;
3523 /* Load common blocks. */
3528 char name[GFC_MAX_SYMBOL_LEN + 1];
3533 while (peek_atom () != ATOM_RPAREN)
3537 mio_internal_string (name);
3539 p = gfc_get_common (name, 1);
3541 mio_symbol_ref (&p->head);
3542 mio_integer (&flags);
3546 p->threadprivate = 1;
3549 /* Get whether this was a bind(c) common or not. */
3550 mio_integer (&p->is_bind_c);
3551 /* Get the binding label. */
3552 mio_internal_string (p->binding_label);
3561 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3562 so that unused variables are not loaded and so that the expression can
3568 gfc_equiv *head, *tail, *end, *eq;
3572 in_load_equiv = true;
3574 end = gfc_current_ns->equiv;
3575 while (end != NULL && end->next != NULL)
3578 while (peek_atom () != ATOM_RPAREN) {
3582 while(peek_atom () != ATOM_RPAREN)
3585 head = tail = gfc_get_equiv ();
3588 tail->eq = gfc_get_equiv ();
3592 mio_pool_string (&tail->module);
3593 mio_expr (&tail->expr);
3596 /* Unused equivalence members have a unique name. */
3598 for (eq = head; eq; eq = eq->eq)
3600 if (!check_unique_name (eq->expr->symtree->name))
3609 for (eq = head; eq; eq = head)
3612 gfc_free_expr (eq->expr);
3618 gfc_current_ns->equiv = head;
3629 in_load_equiv = false;
3633 /* Recursive function to traverse the pointer_info tree and load a
3634 needed symbol. We return nonzero if we load a symbol and stop the
3635 traversal, because the act of loading can alter the tree. */
3638 load_needed (pointer_info *p)
3649 rv |= load_needed (p->left);
3650 rv |= load_needed (p->right);
3652 if (p->type != P_SYMBOL || p->u.rsym.state != NEEDED)
3655 p->u.rsym.state = USED;
3657 set_module_locus (&p->u.rsym.where);
3659 sym = p->u.rsym.sym;
3662 q = get_integer (p->u.rsym.ns);
3664 ns = (gfc_namespace *) q->u.pointer;
3667 /* Create an interface namespace if necessary. These are
3668 the namespaces that hold the formal parameters of module
3671 ns = gfc_get_namespace (NULL, 0);
3672 associate_integer_pointer (q, ns);
3675 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
3676 doesn't go pear-shaped if the symbol is used. */
3678 gfc_find_symbol (p->u.rsym.module, gfc_current_ns,
3681 sym = gfc_new_symbol (p->u.rsym.true_name, ns);
3682 sym->module = gfc_get_string (p->u.rsym.module);
3683 strcpy (sym->binding_label, p->u.rsym.binding_label);
3685 associate_integer_pointer (p, sym);
3689 sym->attr.use_assoc = 1;
3691 sym->attr.use_only = 1;
3692 if (p->u.rsym.renamed)
3693 sym->attr.use_rename = 1;
3699 /* Recursive function for cleaning up things after a module has been read. */
3702 read_cleanup (pointer_info *p)
3710 read_cleanup (p->left);
3711 read_cleanup (p->right);
3713 if (p->type == P_SYMBOL && p->u.rsym.state == USED && !p->u.rsym.referenced)
3715 /* Add hidden symbols to the symtree. */
3716 q = get_integer (p->u.rsym.ns);
3717 st = gfc_get_unique_symtree ((gfc_namespace *) q->u.pointer);
3719 st->n.sym = p->u.rsym.sym;
3722 /* Fixup any symtree references. */
3723 p->u.rsym.symtree = st;
3724 resolve_fixups (p->u.rsym.stfixup, st);
3725 p->u.rsym.stfixup = NULL;
3728 /* Free unused symbols. */
3729 if (p->type == P_SYMBOL && p->u.rsym.state == UNUSED)
3730 gfc_free_symbol (p->u.rsym.sym);
3734 /* Read a module file. */
3739 module_locus operator_interfaces, user_operators;
3741 char name[GFC_MAX_SYMBOL_LEN + 1];
3743 int ambiguous, j, nuse, symbol;
3744 pointer_info *info, *q;
3749 get_module_locus (&operator_interfaces); /* Skip these for now. */
3752 get_module_locus (&user_operators);
3756 /* Skip commons and equivalences for now. */
3762 /* Create the fixup nodes for all the symbols. */
3764 while (peek_atom () != ATOM_RPAREN)
3766 require_atom (ATOM_INTEGER);
3767 info = get_integer (atom_int);
3769 info->type = P_SYMBOL;
3770 info->u.rsym.state = UNUSED;
3772 mio_internal_string (info->u.rsym.true_name);
3773 mio_internal_string (info->u.rsym.module);
3774 mio_internal_string (info->u.rsym.binding_label);
3777 require_atom (ATOM_INTEGER);
3778 info->u.rsym.ns = atom_int;
3780 get_module_locus (&info->u.rsym.where);
3783 /* See if the symbol has already been loaded by a previous module.
3784 If so, we reference the existing symbol and prevent it from
3785 being loaded again. This should not happen if the symbol being
3786 read is an index for an assumed shape dummy array (ns != 1). */
3788 sym = find_true_name (info->u.rsym.true_name, info->u.rsym.module);
3791 || (sym->attr.flavor == FL_VARIABLE && info->u.rsym.ns !=1))
3794 info->u.rsym.state = USED;
3795 info->u.rsym.sym = sym;
3797 /* Some symbols do not have a namespace (eg. formal arguments),
3798 so the automatic "unique symtree" mechanism must be suppressed
3799 by marking them as referenced. */
3800 q = get_integer (info->u.rsym.ns);
3801 if (q->u.pointer == NULL)
3803 info->u.rsym.referenced = 1;
3807 /* If possible recycle the symtree that references the symbol.
3808 If a symtree is not found and the module does not import one,
3809 a unique-name symtree is found by read_cleanup. */
3810 st = find_symtree_for_symbol (gfc_current_ns->sym_root, sym);
3813 info->u.rsym.symtree = st;
3814 info->u.rsym.referenced = 1;
3820 /* Parse the symtree lists. This lets us mark which symbols need to
3821 be loaded. Renaming is also done at this point by replacing the
3826 while (peek_atom () != ATOM_RPAREN)
3828 mio_internal_string (name);
3829 mio_integer (&ambiguous);
3830 mio_integer (&symbol);
3832 info = get_integer (symbol);
3834 /* See how many use names there are. If none, go through the start
3835 of the loop at least once. */
3836 nuse = number_use_names (name, false);
3837 info->u.rsym.renamed = nuse ? 1 : 0;
3842 for (j = 1; j <= nuse; j++)
3844 /* Get the jth local name for this symbol. */
3845 p = find_use_name_n (name, &j, false);
3847 if (p == NULL && strcmp (name, module_name) == 0)
3850 /* Skip symtree nodes not in an ONLY clause, unless there
3851 is an existing symtree loaded from another USE statement. */
3854 st = gfc_find_symtree (gfc_current_ns->sym_root, name);
3856 info->u.rsym.symtree = st;
3860 /* If a symbol of the same name and module exists already,
3861 this symbol, which is not in an ONLY clause, must not be
3862 added to the namespace(11.3.2). Note that find_symbol
3863 only returns the first occurrence that it finds. */
3864 if (!only_flag && !info->u.rsym.renamed
3865 && strcmp (name, module_name) != 0
3866 && find_symbol (gfc_current_ns->sym_root, name,
3870 st = gfc_find_symtree (gfc_current_ns->sym_root, p);
3874 /* Check for ambiguous symbols. */
3875 if (st->n.sym != info->u.rsym.sym)
3877 info->u.rsym.symtree = st;
3881 st = gfc_find_symtree (gfc_current_ns->sym_root, name);
3883 /* Delete the symtree if the symbol has been added by a USE
3884 statement without an ONLY(11.3.2). Remember that the rsym
3885 will be the same as the symbol found in the symtree, for
3887 if (st && (only_flag || info->u.rsym.renamed)
3888 && !st->n.sym->attr.use_only
3889 && !st->n.sym->attr.use_rename
3890 && info->u.rsym.sym == st->n.sym)
3891 gfc_delete_symtree (&gfc_current_ns->sym_root, name);
3893 /* Create a symtree node in the current namespace for this
3895 st = check_unique_name (p)
3896 ? gfc_get_unique_symtree (gfc_current_ns)
3897 : gfc_new_symtree (&gfc_current_ns->sym_root, p);
3898 st->ambiguous = ambiguous;
3900 sym = info->u.rsym.sym;
3902 /* Create a symbol node if it doesn't already exist. */
3905 info->u.rsym.sym = gfc_new_symbol (info->u.rsym.true_name,
3907 sym = info->u.rsym.sym;
3908 sym->module = gfc_get_string (info->u.rsym.module);
3910 /* TODO: hmm, can we test this? Do we know it will be
3911 initialized to zeros? */
3912 if (info->u.rsym.binding_label[0] != '\0')
3913 strcpy (sym->binding_label, info->u.rsym.binding_label);
3919 if (strcmp (name, p) != 0)
3920 sym->attr.use_rename = 1;
3922 /* Store the symtree pointing to this symbol. */
3923 info->u.rsym.symtree = st;
3925 if (info->u.rsym.state == UNUSED)
3926 info->u.rsym.state = NEEDED;
3927 info->u.rsym.referenced = 1;
3934 /* Load intrinsic operator interfaces. */
3935 set_module_locus (&operator_interfaces);
3938 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
3940 if (i == INTRINSIC_USER)
3945 u = find_use_operator (i);
3956 mio_interface (&gfc_current_ns->operator[i]);
3961 /* Load generic and user operator interfaces. These must follow the
3962 loading of symtree because otherwise symbols can be marked as
3965 set_module_locus (&user_operators);
3967 load_operator_interfaces ();
3968 load_generic_interfaces ();
3973 /* At this point, we read those symbols that are needed but haven't
3974 been loaded yet. If one symbol requires another, the other gets
3975 marked as NEEDED if its previous state was UNUSED. */
3977 while (load_needed (pi_root));
3979 /* Make sure all elements of the rename-list were found in the module. */
3981 for (u = gfc_rename_list; u; u = u->next)
3986 if (u->operator == INTRINSIC_NONE)
3988 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3989 u->use_name, &u->where, module_name);
3993 if (u->operator == INTRINSIC_USER)
3995 gfc_error ("User operator '%s' referenced at %L not found "
3996 "in module '%s'", u->use_name, &u->where, module_name);
4000 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
4001 "in module '%s'", gfc_op2string (u->operator), &u->where,
4005 gfc_check_interfaces (gfc_current_ns);
4007 /* Clean up symbol nodes that were never loaded, create references
4008 to hidden symbols. */
4010 read_cleanup (pi_root);
4014 /* Given an access type that is specific to an entity and the default
4015 access, return nonzero if the entity is publicly accessible. If the
4016 element is declared as PUBLIC, then it is public; if declared
4017 PRIVATE, then private, and otherwise it is public unless the default
4018 access in this context has been declared PRIVATE. */
4021 gfc_check_access (gfc_access specific_access, gfc_access default_access)
4023 if (specific_access == ACCESS_PUBLIC)
4025 if (specific_access == ACCESS_PRIVATE)
4028 if (gfc_option.flag_module_private)
4029 return default_access == ACCESS_PUBLIC;
4031 return default_access != ACCESS_PRIVATE;
4035 /* A structure to remember which commons we've already written. */
4037 struct written_common
4039 BBT_HEADER(written_common);
4040 const char *name, *label;
4043 static struct written_common *written_commons = NULL;
4045 /* Comparison function used for balancing the binary tree. */
4048 compare_written_commons (void *a1, void *b1)
4050 const char *aname = ((struct written_common *) a1)->name;
4051 const char *alabel = ((struct written_common *) a1)->label;
4052 const char *bname = ((struct written_common *) b1)->name;
4053 const char *blabel = ((struct written_common *) b1)->label;
4054 int c = strcmp (aname, bname);
4056 return (c != 0 ? c : strcmp (alabel, blabel));
4059 /* Free a list of written commons. */
4062 free_written_common (struct written_common *w)
4068 free_written_common (w->left);
4070 free_written_common (w->right);
4075 /* Write a common block to the module -- recursive helper function. */
4078 write_common_0 (gfc_symtree *st)
4084 struct written_common *w;
4085 bool write_me = true;
4090 write_common_0 (st->left);
4092 /* We will write out the binding label, or the name if no label given. */
4093 name = st->n.common->name;
4095 label = p->is_bind_c ? p->binding_label : p->name;
4097 /* Check if we've already output this common. */
4098 w = written_commons;
4101 int c = strcmp (name, w->name);
4102 c = (c != 0 ? c : strcmp (label, w->label));
4106 w = (c < 0) ? w->left : w->right;
4111 /* Write the common to the module. */
4113 mio_pool_string (&name);
4115 mio_symbol_ref (&p->head);
4116 flags = p->saved ? 1 : 0;
4117 if (p->threadprivate)
4119 mio_integer (&flags);
4121 /* Write out whether the common block is bind(c) or not. */
4122 mio_integer (&(p->is_bind_c));
4124 mio_pool_string (&label);
4127 /* Record that we have written this common. */
4128 w = gfc_getmem (sizeof (struct written_common));
4131 gfc_insert_bbt (&written_commons, w, compare_written_commons);
4134 write_common_0 (st->right);
4138 /* Write a common, by initializing the list of written commons, calling
4139 the recursive function write_common_0() and cleaning up afterwards. */
4142 write_common (gfc_symtree *st)
4144 written_commons = NULL;
4145 write_common_0 (st);
4146 free_written_common (written_commons);
4147 written_commons = NULL;
4151 /* Write the blank common block to the module. */
4154 write_blank_common (void)
4156 const char * name = BLANK_COMMON_NAME;
4158 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4159 this, but it hasn't been checked. Just making it so for now. */
4162 if (gfc_current_ns->blank_common.head == NULL)
4167 mio_pool_string (&name);
4169 mio_symbol_ref (&gfc_current_ns->blank_common.head);
4170 saved = gfc_current_ns->blank_common.saved;
4171 mio_integer (&saved);
4173 /* Write out whether the common block is bind(c) or not. */
4174 mio_integer (&is_bind_c);
4176 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4177 it doesn't matter because the label isn't used. */
4178 mio_pool_string (&name);
4184 /* Write equivalences to the module. */
4193 for (eq = gfc_current_ns->equiv; eq; eq = eq->next)
4197 for (e = eq; e; e = e->eq)
4199 if (e->module == NULL)
4200 e->module = gfc_get_string ("%s.eq.%d", module_name, num);
4201 mio_allocated_string (e->module);
4202 mio_expr (&e->expr);
4211 /* Write a symbol to the module. */
4214 write_symbol (int n, gfc_symbol *sym)
4218 if (sym->attr.flavor == FL_UNKNOWN || sym->attr.flavor == FL_LABEL)
4219 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym->name);
4222 mio_pool_string (&sym->name);
4224 mio_pool_string (&sym->module);
4225 if (sym->attr.is_bind_c || sym->attr.is_iso_c)
4227 label = sym->binding_label;
4228 mio_pool_string (&label);
4231 mio_pool_string (&sym->name);
4233 mio_pointer_ref (&sym->ns);
4240 /* Recursive traversal function to write the initial set of symbols to
4241 the module. We check to see if the symbol should be written
4242 according to the access specification. */
4245 write_symbol0 (gfc_symtree *st)
4249 bool dont_write = false;
4254 write_symbol0 (st->left);
4257 if (sym->module == NULL)
4258 sym->module = gfc_get_string (module_name);
4260 if (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
4261 && !sym->attr.subroutine && !sym->attr.function)
4264 if (!gfc_check_access (sym->attr.access, sym->ns->default_access))
4269 p = get_pointer (sym);
4270 if (p->type == P_UNKNOWN)
4273 if (p->u.wsym.state != WRITTEN)
4275 write_symbol (p->integer, sym);
4276 p->u.wsym.state = WRITTEN;
4280 write_symbol0 (st->right);
4284 /* Recursive traversal function to write the secondary set of symbols
4285 to the module file. These are symbols that were not public yet are
4286 needed by the public symbols or another dependent symbol. The act
4287 of writing a symbol can modify the pointer_info tree, so we cease
4288 traversal if we find a symbol to write. We return nonzero if a
4289 symbol was written and pass that information upwards. */
4292 write_symbol1 (pointer_info *p)
4299 result = write_symbol1 (p->left);
4301 if (!(p->type != P_SYMBOL || p->u.wsym.state != NEEDS_WRITE))
4303 p->u.wsym.state = WRITTEN;
4304 write_symbol (p->integer, p->u.wsym.sym);
4308 result |= write_symbol1 (p->right);
4313 /* Write operator interfaces associated with a symbol. */
4316 write_operator (gfc_user_op *uop)
4318 static char nullstring[] = "";
4319 const char *p = nullstring;
4321 if (uop->operator == NULL
4322 || !gfc_check_access (uop->access, uop->ns->default_access))
4325 mio_symbol_interface (&uop->name, &p, &uop->operator);
4329 /* Write generic interfaces from the namespace sym_root. */
4332 write_generic (gfc_symtree *st)
4339 write_generic (st->left);
4340 write_generic (st->right);
4343 if (!sym || check_unique_name (st->name))
4346 if (sym->generic == NULL
4347 || !gfc_check_access (sym->attr.access, sym->ns->default_access))
4350 if (sym->module == NULL)
4351 sym->module = gfc_get_string (module_name);
4353 mio_symbol_interface (&st->name, &sym->module, &sym->generic);
4358 write_symtree (gfc_symtree *st)
4364 if (!gfc_check_access (sym->attr.access, sym->ns->default_access)
4365 || (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
4366 && !sym->attr.subroutine && !sym->attr.function))
4369 if (check_unique_name (st->name))
4372 p = find_pointer (sym);
4374 gfc_internal_error ("write_symtree(): Symbol not written");
4376 mio_pool_string (&st->name);
4377 mio_integer (&st->ambiguous);
4378 mio_integer (&p->integer);
4387 /* Write the operator interfaces. */
4390 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
4392 if (i == INTRINSIC_USER)
4395 mio_interface (gfc_check_access (gfc_current_ns->operator_access[i],
4396 gfc_current_ns->default_access)
4397 ? &gfc_current_ns->operator[i] : NULL);
4405 gfc_traverse_user_op (gfc_current_ns, write_operator);
4411 write_generic (gfc_current_ns->sym_root);
4417 write_blank_common ();
4418 write_common (gfc_current_ns->common_root);
4429 /* Write symbol information. First we traverse all symbols in the
4430 primary namespace, writing those that need to be written.
4431 Sometimes writing one symbol will cause another to need to be
4432 written. A list of these symbols ends up on the write stack, and
4433 we end by popping the bottom of the stack and writing the symbol
4434 until the stack is empty. */
4438 write_symbol0 (gfc_current_ns->sym_root);
4439 while (write_symbol1 (pi_root))
4448 gfc_traverse_symtree (gfc_current_ns->sym_root, write_symtree);
4453 /* Read a MD5 sum from the header of a module file. If the file cannot
4454 be opened, or we have any other error, we return -1. */
4457 read_md5_from_module_file (const char * filename, unsigned char md5[16])
4463 /* Open the file. */
4464 if ((file = fopen (filename, "r")) == NULL)
4467 /* Read two lines. */
4468 if (fgets (buf, sizeof (buf) - 1, file) == NULL
4469 || fgets (buf, sizeof (buf) - 1, file) == NULL)
4475 /* Close the file. */
4478 /* If the header is not what we expect, or is too short, bail out. */
4479 if (strncmp (buf, "MD5:", 4) != 0 || strlen (buf) < 4 + 16)
4482 /* Now, we have a real MD5, read it into the array. */
4483 for (n = 0; n < 16; n++)
4487 if (sscanf (&(buf[4+2*n]), "%02x", &x) != 1)
4497 /* Given module, dump it to disk. If there was an error while
4498 processing the module, dump_flag will be set to zero and we delete
4499 the module file, even if it was already there. */
4502 gfc_dump_module (const char *name, int dump_flag)
4505 char *filename, *filename_tmp, *p;
4508 unsigned char md5_new[16], md5_old[16];
4510 n = strlen (name) + strlen (MODULE_EXTENSION) + 1;
4511 if (gfc_option.module_dir != NULL)
4513 n += strlen (gfc_option.module_dir);
4514 filename = (char *) alloca (n);
4515 strcpy (filename, gfc_option.module_dir);
4516 strcat (filename, name);
4520 filename = (char *) alloca (n);
4521 strcpy (filename, name);
4523 strcat (filename, MODULE_EXTENSION);
4525 /* Name of the temporary file used to write the module. */
4526 filename_tmp = (char *) alloca (n + 1);
4527 strcpy (filename_tmp, filename);
4528 strcat (filename_tmp, "0");
4530 /* There was an error while processing the module. We delete the
4531 module file, even if it was already there. */
4538 /* Write the module to the temporary file. */
4539 module_fp = fopen (filename_tmp, "w");
4540 if (module_fp == NULL)
4541 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
4542 filename_tmp, strerror (errno));
4544 /* Write the header, including space reserved for the MD5 sum. */
4548 *strchr (p, '\n') = '\0';
4550 fprintf (module_fp, "GFORTRAN module created from %s on %s\nMD5:",
4551 gfc_source_file, p);
4552 fgetpos (module_fp, &md5_pos);
4553 fputs ("00000000000000000000000000000000 -- "
4554 "If you edit this, you'll get what you deserve.\n\n", module_fp);
4556 /* Initialize the MD5 context that will be used for output. */
4557 md5_init_ctx (&ctx);
4559 /* Write the module itself. */
4561 strcpy (module_name, name);
4567 free_pi_tree (pi_root);
4572 /* Write the MD5 sum to the header of the module file. */
4573 md5_finish_ctx (&ctx, md5_new);
4574 fsetpos (module_fp, &md5_pos);
4575 for (n = 0; n < 16; n++)
4576 fprintf (module_fp, "%02x", md5_new[n]);
4578 if (fclose (module_fp))
4579 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
4580 filename_tmp, strerror (errno));
4582 /* Read the MD5 from the header of the old module file and compare. */
4583 if (read_md5_from_module_file (filename, md5_old) != 0
4584 || memcmp (md5_old, md5_new, sizeof (md5_old)) != 0)
4586 /* Module file have changed, replace the old one. */
4588 rename (filename_tmp, filename);
4591 unlink (filename_tmp);
4596 sort_iso_c_rename_list (void)
4598 gfc_use_rename *tmp_list = NULL;
4599 gfc_use_rename *curr;
4600 gfc_use_rename *kinds_used[ISOCBINDING_NUMBER] = {NULL};
4604 for (curr = gfc_rename_list; curr; curr = curr->next)
4606 c_kind = get_c_kind (curr->use_name, c_interop_kinds_table);
4607 if (c_kind == ISOCBINDING_INVALID || c_kind == ISOCBINDING_LAST)
4609 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4610 "intrinsic module ISO_C_BINDING.", curr->use_name,
4614 /* Put it in the list. */
4615 kinds_used[c_kind] = curr;
4618 /* Make a new (sorted) rename list. */
4620 while (i < ISOCBINDING_NUMBER && kinds_used[i] == NULL)
4623 if (i < ISOCBINDING_NUMBER)
4625 tmp_list = kinds_used[i];
4629 for (; i < ISOCBINDING_NUMBER; i++)
4630 if (kinds_used[i] != NULL)
4632 curr->next = kinds_used[i];
4638 gfc_rename_list = tmp_list;
4642 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
4643 the current namespace for all named constants, pointer types, and
4644 procedures in the module unless the only clause was used or a rename
4645 list was provided. */
4648 import_iso_c_binding_module (void)
4650 gfc_symbol *mod_sym = NULL;
4651 gfc_symtree *mod_symtree = NULL;
4652 const char *iso_c_module_name = "__iso_c_binding";
4657 /* Look only in the current namespace. */
4658 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, iso_c_module_name);
4660 if (mod_symtree == NULL)
4662 /* symtree doesn't already exist in current namespace. */
4663 gfc_get_sym_tree (iso_c_module_name, gfc_current_ns, &mod_symtree);
4665 if (mod_symtree != NULL)
4666 mod_sym = mod_symtree->n.sym;
4668 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
4669 "create symbol for %s", iso_c_module_name);
4671 mod_sym->attr.flavor = FL_MODULE;
4672 mod_sym->attr.intrinsic = 1;
4673 mod_sym->module = gfc_get_string (iso_c_module_name);
4674 mod_sym->from_intmod = INTMOD_ISO_C_BINDING;
4677 /* Generate the symbols for the named constants representing
4678 the kinds for intrinsic data types. */
4681 /* Sort the rename list because there are dependencies between types
4682 and procedures (e.g., c_loc needs c_ptr). */
4683 sort_iso_c_rename_list ();
4685 for (u = gfc_rename_list; u; u = u->next)
4687 i = get_c_kind (u->use_name, c_interop_kinds_table);
4689 if (i == ISOCBINDING_INVALID || i == ISOCBINDING_LAST)
4691 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4692 "intrinsic module ISO_C_BINDING.", u->use_name,
4697 generate_isocbinding_symbol (iso_c_module_name, i, u->local_name);
4702 for (i = 0; i < ISOCBINDING_NUMBER; i++)
4705 for (u = gfc_rename_list; u; u = u->next)
4707 if (strcmp (c_interop_kinds_table[i].name, u->use_name) == 0)
4709 local_name = u->local_name;
4714 generate_isocbinding_symbol (iso_c_module_name, i, local_name);
4717 for (u = gfc_rename_list; u; u = u->next)
4722 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4723 "module ISO_C_BINDING", u->use_name, &u->where);
4729 /* Add an integer named constant from a given module. */
4732 create_int_parameter (const char *name, int value, const char *modname,
4733 intmod_id module, int id)
4735 gfc_symtree *tmp_symtree;
4738 tmp_symtree = gfc_find_symtree (gfc_current_ns->sym_root, name);
4739 if (tmp_symtree != NULL)
4741 if (strcmp (modname, tmp_symtree->n.sym->module) == 0)
4744 gfc_error ("Symbol '%s' already declared", name);
4747 gfc_get_sym_tree (name, gfc_current_ns, &tmp_symtree);
4748 sym = tmp_symtree->n.sym;
4750 sym->module = gfc_get_string (modname);
4751 sym->attr.flavor = FL_PARAMETER;
4752 sym->ts.type = BT_INTEGER;
4753 sym->ts.kind = gfc_default_integer_kind;
4754 sym->value = gfc_int_expr (value);
4755 sym->attr.use_assoc = 1;
4756 sym->from_intmod = module;
4757 sym->intmod_sym_id = id;
4761 /* USE the ISO_FORTRAN_ENV intrinsic module. */
4764 use_iso_fortran_env_module (void)
4766 static char mod[] = "iso_fortran_env";
4767 const char *local_name;
4769 gfc_symbol *mod_sym;
4770 gfc_symtree *mod_symtree;
4773 intmod_sym symbol[] = {
4774 #define NAMED_INTCST(a,b,c) { a, b, 0 },
4775 #include "iso-fortran-env.def"
4777 { ISOFORTRANENV_INVALID, NULL, -1234 } };
4780 #define NAMED_INTCST(a,b,c) symbol[i++].value = c;
4781 #include "iso-fortran-env.def"
4784 /* Generate the symbol for the module itself. */
4785 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, mod);
4786 if (mod_symtree == NULL)
4788 gfc_get_sym_tree (mod, gfc_current_ns, &mod_symtree);
4789 gcc_assert (mod_symtree);
4790 mod_sym = mod_symtree->n.sym;
4792 mod_sym->attr.flavor = FL_MODULE;
4793 mod_sym->attr.intrinsic = 1;
4794 mod_sym->module = gfc_get_string (mod);
4795 mod_sym->from_intmod = INTMOD_ISO_FORTRAN_ENV;
4798 if (!mod_symtree->n.sym->attr.intrinsic)
4799 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
4800 "non-intrinsic module name used previously", mod);
4802 /* Generate the symbols for the module integer named constants. */
4804 for (u = gfc_rename_list; u; u = u->next)
4806 for (i = 0; symbol[i].name; i++)
4807 if (strcmp (symbol[i].name, u->use_name) == 0)
4810 if (symbol[i].name == NULL)
4812 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4813 "intrinsic module ISO_FORTRAN_ENV", u->use_name,
4818 if ((gfc_option.flag_default_integer || gfc_option.flag_default_real)
4819 && symbol[i].id == ISOFORTRANENV_NUMERIC_STORAGE_SIZE)
4820 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4821 "from intrinsic module ISO_FORTRAN_ENV at %L is "
4822 "incompatible with option %s", &u->where,
4823 gfc_option.flag_default_integer
4824 ? "-fdefault-integer-8" : "-fdefault-real-8");
4826 create_int_parameter (u->local_name[0] ? u->local_name
4828 symbol[i].value, mod, INTMOD_ISO_FORTRAN_ENV,
4833 for (i = 0; symbol[i].name; i++)
4836 for (u = gfc_rename_list; u; u = u->next)
4838 if (strcmp (symbol[i].name, u->use_name) == 0)
4840 local_name = u->local_name;
4846 if ((gfc_option.flag_default_integer || gfc_option.flag_default_real)
4847 && symbol[i].id == ISOFORTRANENV_NUMERIC_STORAGE_SIZE)
4848 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4849 "from intrinsic module ISO_FORTRAN_ENV at %C is "
4850 "incompatible with option %s",
4851 gfc_option.flag_default_integer
4852 ? "-fdefault-integer-8" : "-fdefault-real-8");
4854 create_int_parameter (local_name ? local_name : symbol[i].name,
4855 symbol[i].value, mod, INTMOD_ISO_FORTRAN_ENV,
4859 for (u = gfc_rename_list; u; u = u->next)
4864 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4865 "module ISO_FORTRAN_ENV", u->use_name, &u->where);
4871 /* Process a USE directive. */
4874 gfc_use_module (void)
4879 gfc_symtree *mod_symtree;
4881 filename = (char *) alloca (strlen (module_name) + strlen (MODULE_EXTENSION)
4883 strcpy (filename, module_name);
4884 strcat (filename, MODULE_EXTENSION);
4886 /* First, try to find an non-intrinsic module, unless the USE statement
4887 specified that the module is intrinsic. */
4890 module_fp = gfc_open_included_file (filename, true, true);
4892 /* Then, see if it's an intrinsic one, unless the USE statement
4893 specified that the module is non-intrinsic. */
4894 if (module_fp == NULL && !specified_nonint)
4896 if (strcmp (module_name, "iso_fortran_env") == 0
4897 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: ISO_FORTRAN_ENV "
4898 "intrinsic module at %C") != FAILURE)
4900 use_iso_fortran_env_module ();
4904 if (strcmp (module_name, "iso_c_binding") == 0
4905 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: "
4906 "ISO_C_BINDING module at %C") != FAILURE)
4908 import_iso_c_binding_module();
4912 module_fp = gfc_open_intrinsic_module (filename);
4914 if (module_fp == NULL && specified_int)
4915 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
4919 if (module_fp == NULL)
4920 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
4921 filename, strerror (errno));
4923 /* Check that we haven't already USEd an intrinsic module with the
4926 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, module_name);
4927 if (mod_symtree && mod_symtree->n.sym->attr.intrinsic)
4928 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
4929 "intrinsic module name used previously", module_name);
4936 /* Skip the first two lines of the module, after checking that this is
4937 a gfortran module file. */
4943 bad_module ("Unexpected end of module");
4946 if ((start == 1 && strcmp (atom_name, "GFORTRAN") != 0)
4947 || (start == 2 && strcmp (atom_name, " module") != 0))
4948 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
4955 /* Make sure we're not reading the same module that we may be building. */
4956 for (p = gfc_state_stack; p; p = p->previous)
4957 if (p->state == COMP_MODULE && strcmp (p->sym->name, module_name) == 0)
4958 gfc_fatal_error ("Can't USE the same module we're building!");
4961 init_true_name_tree ();
4965 free_true_name (true_name_root);
4966 true_name_root = NULL;
4968 free_pi_tree (pi_root);
4976 gfc_module_init_2 (void)
4978 last_atom = ATOM_LPAREN;
4983 gfc_module_done_2 (void)