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 Free
4 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 2, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to the Free
21 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 /* The syntax of gfortran modules resembles that of lisp lists, ie a
25 sequence of atoms, which can be left or right parenthesis, names,
26 integers or strings. Parenthesis are always matched which allows
27 us to skip over sections at high speed without having to know
28 anything about the internal structure of the lists. A "name" is
29 usually a fortran 95 identifier, but can also start with '@' in
30 order to reference a hidden symbol.
32 The first line of a module is an informational message about what
33 created the module, the file it came from and when it was created.
34 The second line is a warning for people not to edit the module.
35 The rest of the module looks like:
37 ( ( <Interface info for UPLUS> )
38 ( <Interface info for UMINUS> )
41 ( ( <name of operator interface> <module of op interface> <i/f1> ... )
44 ( ( <name of generic interface> <module of generic interface> <i/f1> ... )
47 ( ( <common name> <symbol> <saved flag>)
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 */
76 #define MODULE_EXTENSION ".mod"
79 /* Structure that describes a position within a module file. */
91 P_UNKNOWN = 0, P_OTHER, P_NAMESPACE, P_COMPONENT, P_SYMBOL
95 /* The fixup structure lists pointers to pointers that have to
96 be updated when a pointer value becomes known. */
98 typedef struct fixup_t
101 struct fixup_t *next;
106 /* Structure for holding extra info needed for pointers being read. */
108 typedef struct pointer_info
110 BBT_HEADER (pointer_info);
114 /* The first component of each member of the union is the pointer
121 void *pointer; /* Member for doing pointer searches. */
126 char true_name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
128 { UNUSED, NEEDED, USED }
133 gfc_symtree *symtree;
141 { UNREFERENCED = 0, NEEDS_WRITE, WRITTEN }
151 #define gfc_get_pointer_info() gfc_getmem(sizeof(pointer_info))
154 /* Lists of rename info for the USE statement. */
156 typedef struct gfc_use_rename
158 char local_name[GFC_MAX_SYMBOL_LEN + 1], use_name[GFC_MAX_SYMBOL_LEN + 1];
159 struct gfc_use_rename *next;
161 gfc_intrinsic_op operator;
166 #define gfc_get_use_rename() gfc_getmem(sizeof(gfc_use_rename))
168 /* Local variables */
170 /* The FILE for the module we're reading or writing. */
171 static FILE *module_fp;
173 /* The name of the module we're reading (USE'ing) or writing. */
174 static char module_name[GFC_MAX_SYMBOL_LEN + 1];
176 /* The way the module we're reading was specified. */
177 static bool specified_nonint, specified_int;
179 static int module_line, module_column, only_flag;
181 { IO_INPUT, IO_OUTPUT }
184 static gfc_use_rename *gfc_rename_list;
185 static pointer_info *pi_root;
186 static int symbol_number; /* Counter for assigning symbol numbers */
188 /* Tells mio_expr_ref not to load unused equivalence members. */
189 static bool in_load_equiv;
193 /*****************************************************************/
195 /* Pointer/integer conversion. Pointers between structures are stored
196 as integers in the module file. The next couple of subroutines
197 handle this translation for reading and writing. */
199 /* Recursively free the tree of pointer structures. */
202 free_pi_tree (pointer_info * p)
207 if (p->fixup != NULL)
208 gfc_internal_error ("free_pi_tree(): Unresolved fixup");
210 free_pi_tree (p->left);
211 free_pi_tree (p->right);
217 /* Compare pointers when searching by pointer. Used when writing a
221 compare_pointers (void * _sn1, void * _sn2)
223 pointer_info *sn1, *sn2;
225 sn1 = (pointer_info *) _sn1;
226 sn2 = (pointer_info *) _sn2;
228 if (sn1->u.pointer < sn2->u.pointer)
230 if (sn1->u.pointer > sn2->u.pointer)
237 /* Compare integers when searching by integer. Used when reading a
241 compare_integers (void * _sn1, void * _sn2)
243 pointer_info *sn1, *sn2;
245 sn1 = (pointer_info *) _sn1;
246 sn2 = (pointer_info *) _sn2;
248 if (sn1->integer < sn2->integer)
250 if (sn1->integer > sn2->integer)
257 /* Initialize the pointer_info tree. */
266 compare = (iomode == IO_INPUT) ? compare_integers : compare_pointers;
268 /* Pointer 0 is the NULL pointer. */
269 p = gfc_get_pointer_info ();
274 gfc_insert_bbt (&pi_root, p, compare);
276 /* Pointer 1 is the current namespace. */
277 p = gfc_get_pointer_info ();
278 p->u.pointer = gfc_current_ns;
280 p->type = P_NAMESPACE;
282 gfc_insert_bbt (&pi_root, p, compare);
288 /* During module writing, call here with a pointer to something,
289 returning the pointer_info node. */
291 static pointer_info *
292 find_pointer (void *gp)
299 if (p->u.pointer == gp)
301 p = (gp < p->u.pointer) ? p->left : p->right;
308 /* Given a pointer while writing, returns the pointer_info tree node,
309 creating it if it doesn't exist. */
311 static pointer_info *
312 get_pointer (void *gp)
316 p = find_pointer (gp);
320 /* Pointer doesn't have an integer. Give it one. */
321 p = gfc_get_pointer_info ();
324 p->integer = symbol_number++;
326 gfc_insert_bbt (&pi_root, p, compare_pointers);
332 /* Given an integer during reading, find it in the pointer_info tree,
333 creating the node if not found. */
335 static pointer_info *
336 get_integer (int integer)
346 c = compare_integers (&t, p);
350 p = (c < 0) ? p->left : p->right;
356 p = gfc_get_pointer_info ();
357 p->integer = integer;
360 gfc_insert_bbt (&pi_root, p, compare_integers);
366 /* Recursive function to find a pointer within a tree by brute force. */
368 static pointer_info *
369 fp2 (pointer_info * p, const void *target)
376 if (p->u.pointer == target)
379 q = fp2 (p->left, target);
383 return fp2 (p->right, target);
387 /* During reading, find a pointer_info node from the pointer value.
388 This amounts to a brute-force search. */
390 static pointer_info *
391 find_pointer2 (void *p)
394 return fp2 (pi_root, p);
398 /* Resolve any fixups using a known pointer. */
400 resolve_fixups (fixup_t *f, void * gp)
412 /* Call here during module reading when we know what pointer to
413 associate with an integer. Any fixups that exist are resolved at
417 associate_integer_pointer (pointer_info * p, void *gp)
419 if (p->u.pointer != NULL)
420 gfc_internal_error ("associate_integer_pointer(): Already associated");
424 resolve_fixups (p->fixup, gp);
430 /* During module reading, given an integer and a pointer to a pointer,
431 either store the pointer from an already-known value or create a
432 fixup structure in order to store things later. Returns zero if
433 the reference has been actually stored, or nonzero if the reference
434 must be fixed later (ie associate_integer_pointer must be called
435 sometime later. Returns the pointer_info structure. */
437 static pointer_info *
438 add_fixup (int integer, void *gp)
444 p = get_integer (integer);
446 if (p->integer == 0 || p->u.pointer != NULL)
453 f = gfc_getmem (sizeof (fixup_t));
465 /*****************************************************************/
467 /* Parser related subroutines */
469 /* Free the rename list left behind by a USE statement. */
474 gfc_use_rename *next;
476 for (; gfc_rename_list; gfc_rename_list = next)
478 next = gfc_rename_list->next;
479 gfc_free (gfc_rename_list);
484 /* Match a USE statement. */
489 char name[GFC_MAX_SYMBOL_LEN + 1], module_nature[GFC_MAX_SYMBOL_LEN + 1];
490 gfc_use_rename *tail = NULL, *new;
492 gfc_intrinsic_op operator;
495 specified_int = false;
496 specified_nonint = false;
498 if (gfc_match (" , ") == MATCH_YES)
500 if ((m = gfc_match (" %n ::", module_nature)) == MATCH_YES)
502 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: module "
503 "nature in USE statement at %C") == FAILURE)
506 if (strcmp (module_nature, "intrinsic") == 0)
507 specified_int = true;
510 if (strcmp (module_nature, "non_intrinsic") == 0)
511 specified_nonint = true;
514 gfc_error ("Module nature in USE statement at %C shall "
515 "be either INTRINSIC or NON_INTRINSIC");
522 /* Help output a better error message than "Unclassifiable
524 gfc_match (" %n", module_nature);
525 if (strcmp (module_nature, "intrinsic") == 0
526 || strcmp (module_nature, "non_intrinsic") == 0)
527 gfc_error ("\"::\" was expected after module nature at %C "
528 "but was not found");
534 m = gfc_match (" ::");
535 if (m == MATCH_YES &&
536 gfc_notify_std (GFC_STD_F2003, "Fortran 2003: "
537 "\"USE :: module\" at %C") == FAILURE)
542 m = gfc_match ("% ");
548 m = gfc_match_name (module_name);
555 if (gfc_match_eos () == MATCH_YES)
557 if (gfc_match_char (',') != MATCH_YES)
560 if (gfc_match (" only :") == MATCH_YES)
563 if (gfc_match_eos () == MATCH_YES)
568 /* Get a new rename struct and add it to the rename list. */
569 new = gfc_get_use_rename ();
570 new->where = gfc_current_locus;
573 if (gfc_rename_list == NULL)
574 gfc_rename_list = new;
579 /* See what kind of interface we're dealing with. Assume it is
581 new->operator = INTRINSIC_NONE;
582 if (gfc_match_generic_spec (&type, name, &operator) == MATCH_ERROR)
587 case INTERFACE_NAMELESS:
588 gfc_error ("Missing generic specification in USE statement at %C");
591 case INTERFACE_GENERIC:
592 m = gfc_match (" =>");
597 strcpy (new->use_name, name);
600 strcpy (new->local_name, name);
602 m = gfc_match_name (new->use_name);
605 if (m == MATCH_ERROR)
613 strcpy (new->local_name, name);
615 m = gfc_match_name (new->use_name);
618 if (m == MATCH_ERROR)
624 case INTERFACE_USER_OP:
625 strcpy (new->use_name, name);
628 case INTERFACE_INTRINSIC_OP:
629 new->operator = operator;
633 if (gfc_match_eos () == MATCH_YES)
635 if (gfc_match_char (',') != MATCH_YES)
642 gfc_syntax_error (ST_USE);
650 /* Given a name and a number, inst, return the inst name
651 under which to load this symbol. Returns NULL if this
652 symbol shouldn't be loaded. If inst is zero, returns
653 the number of instances of this name. */
656 find_use_name_n (const char *name, int *inst)
662 for (u = gfc_rename_list; u; u = u->next)
664 if (strcmp (u->use_name, name) != 0)
677 return only_flag ? NULL : name;
681 return (u->local_name[0] != '\0') ? u->local_name : name;
684 /* Given a name, return the name under which to load this symbol.
685 Returns NULL if this symbol shouldn't be loaded. */
688 find_use_name (const char *name)
691 return find_use_name_n (name, &i);
694 /* Given a real name, return the number of use names associated
698 number_use_names (const char *name)
702 c = find_use_name_n (name, &i);
707 /* Try to find the operator in the current list. */
709 static gfc_use_rename *
710 find_use_operator (gfc_intrinsic_op operator)
714 for (u = gfc_rename_list; u; u = u->next)
715 if (u->operator == operator)
722 /*****************************************************************/
724 /* The next couple of subroutines maintain a tree used to avoid a
725 brute-force search for a combination of true name and module name.
726 While symtree names, the name that a particular symbol is known by
727 can changed with USE statements, we still have to keep track of the
728 true names to generate the correct reference, and also avoid
729 loading the same real symbol twice in a program unit.
731 When we start reading, the true name tree is built and maintained
732 as symbols are read. The tree is searched as we load new symbols
733 to see if it already exists someplace in the namespace. */
735 typedef struct true_name
737 BBT_HEADER (true_name);
742 static true_name *true_name_root;
745 /* Compare two true_name structures. */
748 compare_true_names (void * _t1, void * _t2)
753 t1 = (true_name *) _t1;
754 t2 = (true_name *) _t2;
756 c = ((t1->sym->module > t2->sym->module)
757 - (t1->sym->module < t2->sym->module));
761 return strcmp (t1->sym->name, t2->sym->name);
765 /* Given a true name, search the true name tree to see if it exists
766 within the main namespace. */
769 find_true_name (const char *name, const char *module)
775 sym.name = gfc_get_string (name);
777 sym.module = gfc_get_string (module);
785 c = compare_true_names ((void *)(&t), (void *) p);
789 p = (c < 0) ? p->left : p->right;
796 /* Given a gfc_symbol pointer that is not in the true name tree, add
800 add_true_name (gfc_symbol * sym)
804 t = gfc_getmem (sizeof (true_name));
807 gfc_insert_bbt (&true_name_root, t, compare_true_names);
811 /* Recursive function to build the initial true name tree by
812 recursively traversing the current namespace. */
815 build_tnt (gfc_symtree * st)
821 build_tnt (st->left);
822 build_tnt (st->right);
824 if (find_true_name (st->n.sym->name, st->n.sym->module) != NULL)
827 add_true_name (st->n.sym);
831 /* Initialize the true name tree with the current namespace. */
834 init_true_name_tree (void)
836 true_name_root = NULL;
838 build_tnt (gfc_current_ns->sym_root);
842 /* Recursively free a true name tree node. */
845 free_true_name (true_name * t)
850 free_true_name (t->left);
851 free_true_name (t->right);
857 /*****************************************************************/
859 /* Module reading and writing. */
863 ATOM_NAME, ATOM_LPAREN, ATOM_RPAREN, ATOM_INTEGER, ATOM_STRING
867 static atom_type last_atom;
870 /* The name buffer must be at least as long as a symbol name. Right
871 now it's not clear how we're going to store numeric constants--
872 probably as a hexadecimal string, since this will allow the exact
873 number to be preserved (this can't be done by a decimal
874 representation). Worry about that later. TODO! */
876 #define MAX_ATOM_SIZE 100
879 static char *atom_string, atom_name[MAX_ATOM_SIZE];
882 /* Report problems with a module. Error reporting is not very
883 elaborate, since this sorts of errors shouldn't really happen.
884 This subroutine never returns. */
886 static void bad_module (const char *) ATTRIBUTE_NORETURN;
889 bad_module (const char *msgid)
896 gfc_fatal_error ("Reading module %s at line %d column %d: %s",
897 module_name, module_line, module_column, msgid);
900 gfc_fatal_error ("Writing module %s at line %d column %d: %s",
901 module_name, module_line, module_column, msgid);
904 gfc_fatal_error ("Module %s at line %d column %d: %s",
905 module_name, module_line, module_column, msgid);
911 /* Set the module's input pointer. */
914 set_module_locus (module_locus * m)
917 module_column = m->column;
918 module_line = m->line;
919 fsetpos (module_fp, &m->pos);
923 /* Get the module's input pointer so that we can restore it later. */
926 get_module_locus (module_locus * m)
929 m->column = module_column;
930 m->line = module_line;
931 fgetpos (module_fp, &m->pos);
935 /* Get the next character in the module, updating our reckoning of
943 c = fgetc (module_fp);
946 bad_module ("Unexpected EOF");
959 /* Parse a string constant. The delimiter is guaranteed to be a
969 get_module_locus (&start);
973 /* See how long the string is */
978 bad_module ("Unexpected end of module in string constant");
996 set_module_locus (&start);
998 atom_string = p = gfc_getmem (len + 1);
1000 for (; len > 0; len--)
1004 module_char (); /* Guaranteed to be another \' */
1008 module_char (); /* Terminating \' */
1009 *p = '\0'; /* C-style string for debug purposes */
1013 /* Parse a small integer. */
1016 parse_integer (int c)
1024 get_module_locus (&m);
1030 atom_int = 10 * atom_int + c - '0';
1031 if (atom_int > 99999999)
1032 bad_module ("Integer overflow");
1035 set_module_locus (&m);
1053 get_module_locus (&m);
1058 if (!ISALNUM (c) && c != '_' && c != '-')
1062 if (++len > GFC_MAX_SYMBOL_LEN)
1063 bad_module ("Name too long");
1068 fseek (module_fp, -1, SEEK_CUR);
1069 module_column = m.column + len - 1;
1076 /* Read the next atom in the module's input stream. */
1087 while (c == ' ' || c == '\n');
1112 return ATOM_INTEGER;
1170 bad_module ("Bad name");
1177 /* Peek at the next atom on the input. */
1185 get_module_locus (&m);
1188 if (a == ATOM_STRING)
1189 gfc_free (atom_string);
1191 set_module_locus (&m);
1196 /* Read the next atom from the input, requiring that it be a
1200 require_atom (atom_type type)
1206 get_module_locus (&m);
1214 p = _("Expected name");
1217 p = _("Expected left parenthesis");
1220 p = _("Expected right parenthesis");
1223 p = _("Expected integer");
1226 p = _("Expected string");
1229 gfc_internal_error ("require_atom(): bad atom type required");
1232 set_module_locus (&m);
1238 /* Given a pointer to an mstring array, require that the current input
1239 be one of the strings in the array. We return the enum value. */
1242 find_enum (const mstring * m)
1246 i = gfc_string2code (m, atom_name);
1250 bad_module ("find_enum(): Enum not found");
1256 /**************** Module output subroutines ***************************/
1258 /* Output a character to a module file. */
1261 write_char (char out)
1264 if (fputc (out, module_fp) == EOF)
1265 gfc_fatal_error ("Error writing modules file: %s", strerror (errno));
1277 /* Write an atom to a module. The line wrapping isn't perfect, but it
1278 should work most of the time. This isn't that big of a deal, since
1279 the file really isn't meant to be read by people anyway. */
1282 write_atom (atom_type atom, const void *v)
1304 i = *((const int *) v);
1306 gfc_internal_error ("write_atom(): Writing negative integer");
1308 sprintf (buffer, "%d", i);
1313 gfc_internal_error ("write_atom(): Trying to write dab atom");
1319 if (atom != ATOM_RPAREN)
1321 if (module_column + len > 72)
1326 if (last_atom != ATOM_LPAREN && module_column != 1)
1331 if (atom == ATOM_STRING)
1336 if (atom == ATOM_STRING && *p == '\'')
1341 if (atom == ATOM_STRING)
1349 /***************** Mid-level I/O subroutines *****************/
1351 /* These subroutines let their caller read or write atoms without
1352 caring about which of the two is actually happening. This lets a
1353 subroutine concentrate on the actual format of the data being
1356 static void mio_expr (gfc_expr **);
1357 static void mio_symbol_ref (gfc_symbol **);
1358 static void mio_symtree_ref (gfc_symtree **);
1360 /* Read or write an enumerated value. On writing, we return the input
1361 value for the convenience of callers. We avoid using an integer
1362 pointer because enums are sometimes inside bitfields. */
1365 mio_name (int t, const mstring * m)
1368 if (iomode == IO_OUTPUT)
1369 write_atom (ATOM_NAME, gfc_code2string (m, t));
1372 require_atom (ATOM_NAME);
1379 /* Specialization of mio_name. */
1381 #define DECL_MIO_NAME(TYPE) \
1382 static inline TYPE \
1383 MIO_NAME(TYPE) (TYPE t, const mstring * m) \
1385 return (TYPE)mio_name ((int)t, m); \
1387 #define MIO_NAME(TYPE) mio_name_##TYPE
1393 if (iomode == IO_OUTPUT)
1394 write_atom (ATOM_LPAREN, NULL);
1396 require_atom (ATOM_LPAREN);
1404 if (iomode == IO_OUTPUT)
1405 write_atom (ATOM_RPAREN, NULL);
1407 require_atom (ATOM_RPAREN);
1412 mio_integer (int *ip)
1415 if (iomode == IO_OUTPUT)
1416 write_atom (ATOM_INTEGER, ip);
1419 require_atom (ATOM_INTEGER);
1425 /* Read or write a character pointer that points to a string on the
1429 mio_allocated_string (const char *s)
1431 if (iomode == IO_OUTPUT)
1433 write_atom (ATOM_STRING, s);
1438 require_atom (ATOM_STRING);
1444 /* Read or write a string that is in static memory. */
1447 mio_pool_string (const char **stringp)
1449 /* TODO: one could write the string only once, and refer to it via a
1452 /* As a special case we have to deal with a NULL string. This
1453 happens for the 'module' member of 'gfc_symbol's that are not in a
1454 module. We read / write these as the empty string. */
1455 if (iomode == IO_OUTPUT)
1457 const char *p = *stringp == NULL ? "" : *stringp;
1458 write_atom (ATOM_STRING, p);
1462 require_atom (ATOM_STRING);
1463 *stringp = atom_string[0] == '\0' ? NULL : gfc_get_string (atom_string);
1464 gfc_free (atom_string);
1469 /* Read or write a string that is inside of some already-allocated
1473 mio_internal_string (char *string)
1476 if (iomode == IO_OUTPUT)
1477 write_atom (ATOM_STRING, string);
1480 require_atom (ATOM_STRING);
1481 strcpy (string, atom_string);
1482 gfc_free (atom_string);
1489 { AB_ALLOCATABLE, AB_DIMENSION, AB_EXTERNAL, AB_INTRINSIC, AB_OPTIONAL,
1490 AB_POINTER, AB_SAVE, AB_TARGET, AB_DUMMY, AB_RESULT, AB_DATA,
1491 AB_IN_NAMELIST, AB_IN_COMMON, AB_FUNCTION, AB_SUBROUTINE, AB_SEQUENCE,
1492 AB_ELEMENTAL, AB_PURE, AB_RECURSIVE, AB_GENERIC, AB_ALWAYS_EXPLICIT,
1493 AB_CRAY_POINTER, AB_CRAY_POINTEE, AB_THREADPRIVATE, AB_ALLOC_COMP,
1494 AB_VALUE, AB_VOLATILE
1498 static const mstring attr_bits[] =
1500 minit ("ALLOCATABLE", AB_ALLOCATABLE),
1501 minit ("DIMENSION", AB_DIMENSION),
1502 minit ("EXTERNAL", AB_EXTERNAL),
1503 minit ("INTRINSIC", AB_INTRINSIC),
1504 minit ("OPTIONAL", AB_OPTIONAL),
1505 minit ("POINTER", AB_POINTER),
1506 minit ("SAVE", AB_SAVE),
1507 minit ("VALUE", AB_VALUE),
1508 minit ("VOLATILE", AB_VOLATILE),
1509 minit ("TARGET", AB_TARGET),
1510 minit ("THREADPRIVATE", AB_THREADPRIVATE),
1511 minit ("DUMMY", AB_DUMMY),
1512 minit ("RESULT", AB_RESULT),
1513 minit ("DATA", AB_DATA),
1514 minit ("IN_NAMELIST", AB_IN_NAMELIST),
1515 minit ("IN_COMMON", AB_IN_COMMON),
1516 minit ("FUNCTION", AB_FUNCTION),
1517 minit ("SUBROUTINE", AB_SUBROUTINE),
1518 minit ("SEQUENCE", AB_SEQUENCE),
1519 minit ("ELEMENTAL", AB_ELEMENTAL),
1520 minit ("PURE", AB_PURE),
1521 minit ("RECURSIVE", AB_RECURSIVE),
1522 minit ("GENERIC", AB_GENERIC),
1523 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT),
1524 minit ("CRAY_POINTER", AB_CRAY_POINTER),
1525 minit ("CRAY_POINTEE", AB_CRAY_POINTEE),
1526 minit ("ALLOC_COMP", AB_ALLOC_COMP),
1530 /* Specialization of mio_name. */
1531 DECL_MIO_NAME(ab_attribute)
1532 DECL_MIO_NAME(ar_type)
1533 DECL_MIO_NAME(array_type)
1535 DECL_MIO_NAME(expr_t)
1536 DECL_MIO_NAME(gfc_access)
1537 DECL_MIO_NAME(gfc_intrinsic_op)
1538 DECL_MIO_NAME(ifsrc)
1539 DECL_MIO_NAME(procedure_type)
1540 DECL_MIO_NAME(ref_type)
1541 DECL_MIO_NAME(sym_flavor)
1542 DECL_MIO_NAME(sym_intent)
1543 #undef DECL_MIO_NAME
1545 /* Symbol attributes are stored in list with the first three elements
1546 being the enumerated fields, while the remaining elements (if any)
1547 indicate the individual attribute bits. The access field is not
1548 saved-- it controls what symbols are exported when a module is
1552 mio_symbol_attribute (symbol_attribute * attr)
1558 attr->flavor = MIO_NAME(sym_flavor) (attr->flavor, flavors);
1559 attr->intent = MIO_NAME(sym_intent) (attr->intent, intents);
1560 attr->proc = MIO_NAME(procedure_type) (attr->proc, procedures);
1561 attr->if_source = MIO_NAME(ifsrc) (attr->if_source, ifsrc_types);
1563 if (iomode == IO_OUTPUT)
1565 if (attr->allocatable)
1566 MIO_NAME(ab_attribute) (AB_ALLOCATABLE, attr_bits);
1567 if (attr->dimension)
1568 MIO_NAME(ab_attribute) (AB_DIMENSION, attr_bits);
1570 MIO_NAME(ab_attribute) (AB_EXTERNAL, attr_bits);
1571 if (attr->intrinsic)
1572 MIO_NAME(ab_attribute) (AB_INTRINSIC, attr_bits);
1574 MIO_NAME(ab_attribute) (AB_OPTIONAL, attr_bits);
1576 MIO_NAME(ab_attribute) (AB_POINTER, attr_bits);
1578 MIO_NAME(ab_attribute) (AB_SAVE, attr_bits);
1580 MIO_NAME(ab_attribute) (AB_VALUE, attr_bits);
1581 if (attr->volatile_)
1582 MIO_NAME(ab_attribute) (AB_VOLATILE, attr_bits);
1584 MIO_NAME(ab_attribute) (AB_TARGET, attr_bits);
1585 if (attr->threadprivate)
1586 MIO_NAME(ab_attribute) (AB_THREADPRIVATE, attr_bits);
1588 MIO_NAME(ab_attribute) (AB_DUMMY, attr_bits);
1590 MIO_NAME(ab_attribute) (AB_RESULT, attr_bits);
1591 /* We deliberately don't preserve the "entry" flag. */
1594 MIO_NAME(ab_attribute) (AB_DATA, attr_bits);
1595 if (attr->in_namelist)
1596 MIO_NAME(ab_attribute) (AB_IN_NAMELIST, attr_bits);
1597 if (attr->in_common)
1598 MIO_NAME(ab_attribute) (AB_IN_COMMON, attr_bits);
1601 MIO_NAME(ab_attribute) (AB_FUNCTION, attr_bits);
1602 if (attr->subroutine)
1603 MIO_NAME(ab_attribute) (AB_SUBROUTINE, attr_bits);
1605 MIO_NAME(ab_attribute) (AB_GENERIC, attr_bits);
1608 MIO_NAME(ab_attribute) (AB_SEQUENCE, attr_bits);
1609 if (attr->elemental)
1610 MIO_NAME(ab_attribute) (AB_ELEMENTAL, attr_bits);
1612 MIO_NAME(ab_attribute) (AB_PURE, attr_bits);
1613 if (attr->recursive)
1614 MIO_NAME(ab_attribute) (AB_RECURSIVE, attr_bits);
1615 if (attr->always_explicit)
1616 MIO_NAME(ab_attribute) (AB_ALWAYS_EXPLICIT, attr_bits);
1617 if (attr->cray_pointer)
1618 MIO_NAME(ab_attribute) (AB_CRAY_POINTER, attr_bits);
1619 if (attr->cray_pointee)
1620 MIO_NAME(ab_attribute) (AB_CRAY_POINTEE, attr_bits);
1621 if (attr->alloc_comp)
1622 MIO_NAME(ab_attribute) (AB_ALLOC_COMP, attr_bits);
1633 if (t == ATOM_RPAREN)
1636 bad_module ("Expected attribute bit name");
1638 switch ((ab_attribute) find_enum (attr_bits))
1640 case AB_ALLOCATABLE:
1641 attr->allocatable = 1;
1644 attr->dimension = 1;
1650 attr->intrinsic = 1;
1665 attr->volatile_ = 1;
1670 case AB_THREADPRIVATE:
1671 attr->threadprivate = 1;
1682 case AB_IN_NAMELIST:
1683 attr->in_namelist = 1;
1686 attr->in_common = 1;
1692 attr->subroutine = 1;
1701 attr->elemental = 1;
1707 attr->recursive = 1;
1709 case AB_ALWAYS_EXPLICIT:
1710 attr->always_explicit = 1;
1712 case AB_CRAY_POINTER:
1713 attr->cray_pointer = 1;
1715 case AB_CRAY_POINTEE:
1716 attr->cray_pointee = 1;
1719 attr->alloc_comp = 1;
1727 static const mstring bt_types[] = {
1728 minit ("INTEGER", BT_INTEGER),
1729 minit ("REAL", BT_REAL),
1730 minit ("COMPLEX", BT_COMPLEX),
1731 minit ("LOGICAL", BT_LOGICAL),
1732 minit ("CHARACTER", BT_CHARACTER),
1733 minit ("DERIVED", BT_DERIVED),
1734 minit ("PROCEDURE", BT_PROCEDURE),
1735 minit ("UNKNOWN", BT_UNKNOWN),
1741 mio_charlen (gfc_charlen ** clp)
1747 if (iomode == IO_OUTPUT)
1751 mio_expr (&cl->length);
1756 if (peek_atom () != ATOM_RPAREN)
1758 cl = gfc_get_charlen ();
1759 mio_expr (&cl->length);
1763 cl->next = gfc_current_ns->cl_list;
1764 gfc_current_ns->cl_list = cl;
1772 /* Return a symtree node with a name that is guaranteed to be unique
1773 within the namespace and corresponds to an illegal fortran name. */
1775 static gfc_symtree *
1776 get_unique_symtree (gfc_namespace * ns)
1778 char name[GFC_MAX_SYMBOL_LEN + 1];
1779 static int serial = 0;
1781 sprintf (name, "@%d", serial++);
1782 return gfc_new_symtree (&ns->sym_root, name);
1786 /* See if a name is a generated name. */
1789 check_unique_name (const char *name)
1792 return *name == '@';
1797 mio_typespec (gfc_typespec * ts)
1802 ts->type = MIO_NAME(bt) (ts->type, bt_types);
1804 if (ts->type != BT_DERIVED)
1805 mio_integer (&ts->kind);
1807 mio_symbol_ref (&ts->derived);
1809 mio_charlen (&ts->cl);
1815 static const mstring array_spec_types[] = {
1816 minit ("EXPLICIT", AS_EXPLICIT),
1817 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE),
1818 minit ("DEFERRED", AS_DEFERRED),
1819 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE),
1825 mio_array_spec (gfc_array_spec ** asp)
1832 if (iomode == IO_OUTPUT)
1840 if (peek_atom () == ATOM_RPAREN)
1846 *asp = as = gfc_get_array_spec ();
1849 mio_integer (&as->rank);
1850 as->type = MIO_NAME(array_type) (as->type, array_spec_types);
1852 for (i = 0; i < as->rank; i++)
1854 mio_expr (&as->lower[i]);
1855 mio_expr (&as->upper[i]);
1863 /* Given a pointer to an array reference structure (which lives in a
1864 gfc_ref structure), find the corresponding array specification
1865 structure. Storing the pointer in the ref structure doesn't quite
1866 work when loading from a module. Generating code for an array
1867 reference also needs more information than just the array spec. */
1869 static const mstring array_ref_types[] = {
1870 minit ("FULL", AR_FULL),
1871 minit ("ELEMENT", AR_ELEMENT),
1872 minit ("SECTION", AR_SECTION),
1877 mio_array_ref (gfc_array_ref * ar)
1882 ar->type = MIO_NAME(ar_type) (ar->type, array_ref_types);
1883 mio_integer (&ar->dimen);
1891 for (i = 0; i < ar->dimen; i++)
1892 mio_expr (&ar->start[i]);
1897 for (i = 0; i < ar->dimen; i++)
1899 mio_expr (&ar->start[i]);
1900 mio_expr (&ar->end[i]);
1901 mio_expr (&ar->stride[i]);
1907 gfc_internal_error ("mio_array_ref(): Unknown array ref");
1910 for (i = 0; i < ar->dimen; i++)
1911 mio_integer ((int *) &ar->dimen_type[i]);
1913 if (iomode == IO_INPUT)
1915 ar->where = gfc_current_locus;
1917 for (i = 0; i < ar->dimen; i++)
1918 ar->c_where[i] = gfc_current_locus;
1925 /* Saves or restores a pointer. The pointer is converted back and
1926 forth from an integer. We return the pointer_info pointer so that
1927 the caller can take additional action based on the pointer type. */
1929 static pointer_info *
1930 mio_pointer_ref (void *gp)
1934 if (iomode == IO_OUTPUT)
1936 p = get_pointer (*((char **) gp));
1937 write_atom (ATOM_INTEGER, &p->integer);
1941 require_atom (ATOM_INTEGER);
1942 p = add_fixup (atom_int, gp);
1949 /* Save and load references to components that occur within
1950 expressions. We have to describe these references by a number and
1951 by name. The number is necessary for forward references during
1952 reading, and the name is necessary if the symbol already exists in
1953 the namespace and is not loaded again. */
1956 mio_component_ref (gfc_component ** cp, gfc_symbol * sym)
1958 char name[GFC_MAX_SYMBOL_LEN + 1];
1962 p = mio_pointer_ref (cp);
1963 if (p->type == P_UNKNOWN)
1964 p->type = P_COMPONENT;
1966 if (iomode == IO_OUTPUT)
1967 mio_pool_string (&(*cp)->name);
1970 mio_internal_string (name);
1972 /* It can happen that a component reference can be read before the
1973 associated derived type symbol has been loaded. Return now and
1974 wait for a later iteration of load_needed. */
1978 if (sym->components != NULL && p->u.pointer == NULL)
1980 /* Symbol already loaded, so search by name. */
1981 for (q = sym->components; q; q = q->next)
1982 if (strcmp (q->name, name) == 0)
1986 gfc_internal_error ("mio_component_ref(): Component not found");
1988 associate_integer_pointer (p, q);
1991 /* Make sure this symbol will eventually be loaded. */
1992 p = find_pointer2 (sym);
1993 if (p->u.rsym.state == UNUSED)
1994 p->u.rsym.state = NEEDED;
2000 mio_component (gfc_component * c)
2007 if (iomode == IO_OUTPUT)
2009 p = get_pointer (c);
2010 mio_integer (&p->integer);
2015 p = get_integer (n);
2016 associate_integer_pointer (p, c);
2019 if (p->type == P_UNKNOWN)
2020 p->type = P_COMPONENT;
2022 mio_pool_string (&c->name);
2023 mio_typespec (&c->ts);
2024 mio_array_spec (&c->as);
2026 mio_integer (&c->dimension);
2027 mio_integer (&c->pointer);
2028 mio_integer (&c->allocatable);
2030 mio_expr (&c->initializer);
2036 mio_component_list (gfc_component ** cp)
2038 gfc_component *c, *tail;
2042 if (iomode == IO_OUTPUT)
2044 for (c = *cp; c; c = c->next)
2055 if (peek_atom () == ATOM_RPAREN)
2058 c = gfc_get_component ();
2075 mio_actual_arg (gfc_actual_arglist * a)
2079 mio_pool_string (&a->name);
2080 mio_expr (&a->expr);
2086 mio_actual_arglist (gfc_actual_arglist ** ap)
2088 gfc_actual_arglist *a, *tail;
2092 if (iomode == IO_OUTPUT)
2094 for (a = *ap; a; a = a->next)
2104 if (peek_atom () != ATOM_LPAREN)
2107 a = gfc_get_actual_arglist ();
2123 /* Read and write formal argument lists. */
2126 mio_formal_arglist (gfc_symbol * sym)
2128 gfc_formal_arglist *f, *tail;
2132 if (iomode == IO_OUTPUT)
2134 for (f = sym->formal; f; f = f->next)
2135 mio_symbol_ref (&f->sym);
2140 sym->formal = tail = NULL;
2142 while (peek_atom () != ATOM_RPAREN)
2144 f = gfc_get_formal_arglist ();
2145 mio_symbol_ref (&f->sym);
2147 if (sym->formal == NULL)
2160 /* Save or restore a reference to a symbol node. */
2163 mio_symbol_ref (gfc_symbol ** symp)
2167 p = mio_pointer_ref (symp);
2168 if (p->type == P_UNKNOWN)
2171 if (iomode == IO_OUTPUT)
2173 if (p->u.wsym.state == UNREFERENCED)
2174 p->u.wsym.state = NEEDS_WRITE;
2178 if (p->u.rsym.state == UNUSED)
2179 p->u.rsym.state = NEEDED;
2184 /* Save or restore a reference to a symtree node. */
2187 mio_symtree_ref (gfc_symtree ** stp)
2191 gfc_symtree * ns_st = NULL;
2193 if (iomode == IO_OUTPUT)
2195 /* If this is a symtree for a symbol that came from a contained module
2196 namespace, it has a unique name and we should look in the current
2197 namespace to see if the required, non-contained symbol is available
2198 yet. If so, the latter should be written. */
2199 if ((*stp)->n.sym && check_unique_name((*stp)->name))
2200 ns_st = gfc_find_symtree (gfc_current_ns->sym_root,
2201 (*stp)->n.sym->name);
2203 /* On the other hand, if the existing symbol is the module name or the
2204 new symbol is a dummy argument, do not do the promotion. */
2205 if (ns_st && ns_st->n.sym
2206 && ns_st->n.sym->attr.flavor != FL_MODULE
2207 && !(*stp)->n.sym->attr.dummy)
2208 mio_symbol_ref (&ns_st->n.sym);
2210 mio_symbol_ref (&(*stp)->n.sym);
2214 require_atom (ATOM_INTEGER);
2215 p = get_integer (atom_int);
2217 /* An unused equivalence member; bail out. */
2218 if (in_load_equiv && p->u.rsym.symtree == NULL)
2221 if (p->type == P_UNKNOWN)
2224 if (p->u.rsym.state == UNUSED)
2225 p->u.rsym.state = NEEDED;
2227 if (p->u.rsym.symtree != NULL)
2229 *stp = p->u.rsym.symtree;
2233 f = gfc_getmem (sizeof (fixup_t));
2235 f->next = p->u.rsym.stfixup;
2236 p->u.rsym.stfixup = f;
2238 f->pointer = (void **)stp;
2244 mio_iterator (gfc_iterator ** ip)
2250 if (iomode == IO_OUTPUT)
2257 if (peek_atom () == ATOM_RPAREN)
2263 *ip = gfc_get_iterator ();
2268 mio_expr (&iter->var);
2269 mio_expr (&iter->start);
2270 mio_expr (&iter->end);
2271 mio_expr (&iter->step);
2280 mio_constructor (gfc_constructor ** cp)
2282 gfc_constructor *c, *tail;
2286 if (iomode == IO_OUTPUT)
2288 for (c = *cp; c; c = c->next)
2291 mio_expr (&c->expr);
2292 mio_iterator (&c->iterator);
2302 while (peek_atom () != ATOM_RPAREN)
2304 c = gfc_get_constructor ();
2314 mio_expr (&c->expr);
2315 mio_iterator (&c->iterator);
2325 static const mstring ref_types[] = {
2326 minit ("ARRAY", REF_ARRAY),
2327 minit ("COMPONENT", REF_COMPONENT),
2328 minit ("SUBSTRING", REF_SUBSTRING),
2334 mio_ref (gfc_ref ** rp)
2341 r->type = MIO_NAME(ref_type) (r->type, ref_types);
2346 mio_array_ref (&r->u.ar);
2350 mio_symbol_ref (&r->u.c.sym);
2351 mio_component_ref (&r->u.c.component, r->u.c.sym);
2355 mio_expr (&r->u.ss.start);
2356 mio_expr (&r->u.ss.end);
2357 mio_charlen (&r->u.ss.length);
2366 mio_ref_list (gfc_ref ** rp)
2368 gfc_ref *ref, *head, *tail;
2372 if (iomode == IO_OUTPUT)
2374 for (ref = *rp; ref; ref = ref->next)
2381 while (peek_atom () != ATOM_RPAREN)
2384 head = tail = gfc_get_ref ();
2387 tail->next = gfc_get_ref ();
2401 /* Read and write an integer value. */
2404 mio_gmp_integer (mpz_t * integer)
2408 if (iomode == IO_INPUT)
2410 if (parse_atom () != ATOM_STRING)
2411 bad_module ("Expected integer string");
2413 mpz_init (*integer);
2414 if (mpz_set_str (*integer, atom_string, 10))
2415 bad_module ("Error converting integer");
2417 gfc_free (atom_string);
2422 p = mpz_get_str (NULL, 10, *integer);
2423 write_atom (ATOM_STRING, p);
2430 mio_gmp_real (mpfr_t * real)
2435 if (iomode == IO_INPUT)
2437 if (parse_atom () != ATOM_STRING)
2438 bad_module ("Expected real string");
2441 mpfr_set_str (*real, atom_string, 16, GFC_RND_MODE);
2442 gfc_free (atom_string);
2447 p = mpfr_get_str (NULL, &exponent, 16, 0, *real, GFC_RND_MODE);
2448 atom_string = gfc_getmem (strlen (p) + 20);
2450 sprintf (atom_string, "0.%s@%ld", p, exponent);
2452 /* Fix negative numbers. */
2453 if (atom_string[2] == '-')
2455 atom_string[0] = '-';
2456 atom_string[1] = '0';
2457 atom_string[2] = '.';
2460 write_atom (ATOM_STRING, atom_string);
2462 gfc_free (atom_string);
2468 /* Save and restore the shape of an array constructor. */
2471 mio_shape (mpz_t ** pshape, int rank)
2477 /* A NULL shape is represented by (). */
2480 if (iomode == IO_OUTPUT)
2492 if (t == ATOM_RPAREN)
2499 shape = gfc_get_shape (rank);
2503 for (n = 0; n < rank; n++)
2504 mio_gmp_integer (&shape[n]);
2510 static const mstring expr_types[] = {
2511 minit ("OP", EXPR_OP),
2512 minit ("FUNCTION", EXPR_FUNCTION),
2513 minit ("CONSTANT", EXPR_CONSTANT),
2514 minit ("VARIABLE", EXPR_VARIABLE),
2515 minit ("SUBSTRING", EXPR_SUBSTRING),
2516 minit ("STRUCTURE", EXPR_STRUCTURE),
2517 minit ("ARRAY", EXPR_ARRAY),
2518 minit ("NULL", EXPR_NULL),
2522 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2523 generic operators, not in expressions. INTRINSIC_USER is also
2524 replaced by the correct function name by the time we see it. */
2526 static const mstring intrinsics[] =
2528 minit ("UPLUS", INTRINSIC_UPLUS),
2529 minit ("UMINUS", INTRINSIC_UMINUS),
2530 minit ("PLUS", INTRINSIC_PLUS),
2531 minit ("MINUS", INTRINSIC_MINUS),
2532 minit ("TIMES", INTRINSIC_TIMES),
2533 minit ("DIVIDE", INTRINSIC_DIVIDE),
2534 minit ("POWER", INTRINSIC_POWER),
2535 minit ("CONCAT", INTRINSIC_CONCAT),
2536 minit ("AND", INTRINSIC_AND),
2537 minit ("OR", INTRINSIC_OR),
2538 minit ("EQV", INTRINSIC_EQV),
2539 minit ("NEQV", INTRINSIC_NEQV),
2540 minit ("EQ", INTRINSIC_EQ),
2541 minit ("NE", INTRINSIC_NE),
2542 minit ("GT", INTRINSIC_GT),
2543 minit ("GE", INTRINSIC_GE),
2544 minit ("LT", INTRINSIC_LT),
2545 minit ("LE", INTRINSIC_LE),
2546 minit ("NOT", INTRINSIC_NOT),
2547 minit ("PARENTHESES", INTRINSIC_PARENTHESES),
2551 /* Read and write expressions. The form "()" is allowed to indicate a
2555 mio_expr (gfc_expr ** ep)
2563 if (iomode == IO_OUTPUT)
2572 MIO_NAME(expr_t) (e->expr_type, expr_types);
2578 if (t == ATOM_RPAREN)
2585 bad_module ("Expected expression type");
2587 e = *ep = gfc_get_expr ();
2588 e->where = gfc_current_locus;
2589 e->expr_type = (expr_t) find_enum (expr_types);
2592 mio_typespec (&e->ts);
2593 mio_integer (&e->rank);
2595 switch (e->expr_type)
2598 e->value.op.operator
2599 = MIO_NAME(gfc_intrinsic_op) (e->value.op.operator, intrinsics);
2601 switch (e->value.op.operator)
2603 case INTRINSIC_UPLUS:
2604 case INTRINSIC_UMINUS:
2606 case INTRINSIC_PARENTHESES:
2607 mio_expr (&e->value.op.op1);
2610 case INTRINSIC_PLUS:
2611 case INTRINSIC_MINUS:
2612 case INTRINSIC_TIMES:
2613 case INTRINSIC_DIVIDE:
2614 case INTRINSIC_POWER:
2615 case INTRINSIC_CONCAT:
2619 case INTRINSIC_NEQV:
2626 mio_expr (&e->value.op.op1);
2627 mio_expr (&e->value.op.op2);
2631 bad_module ("Bad operator");
2637 mio_symtree_ref (&e->symtree);
2638 mio_actual_arglist (&e->value.function.actual);
2640 if (iomode == IO_OUTPUT)
2642 e->value.function.name
2643 = mio_allocated_string (e->value.function.name);
2644 flag = e->value.function.esym != NULL;
2645 mio_integer (&flag);
2647 mio_symbol_ref (&e->value.function.esym);
2649 write_atom (ATOM_STRING, e->value.function.isym->name);
2654 require_atom (ATOM_STRING);
2655 e->value.function.name = gfc_get_string (atom_string);
2656 gfc_free (atom_string);
2658 mio_integer (&flag);
2660 mio_symbol_ref (&e->value.function.esym);
2663 require_atom (ATOM_STRING);
2664 e->value.function.isym = gfc_find_function (atom_string);
2665 gfc_free (atom_string);
2672 mio_symtree_ref (&e->symtree);
2673 mio_ref_list (&e->ref);
2676 case EXPR_SUBSTRING:
2677 e->value.character.string = (char *)
2678 mio_allocated_string (e->value.character.string);
2679 mio_ref_list (&e->ref);
2682 case EXPR_STRUCTURE:
2684 mio_constructor (&e->value.constructor);
2685 mio_shape (&e->shape, e->rank);
2692 mio_gmp_integer (&e->value.integer);
2696 gfc_set_model_kind (e->ts.kind);
2697 mio_gmp_real (&e->value.real);
2701 gfc_set_model_kind (e->ts.kind);
2702 mio_gmp_real (&e->value.complex.r);
2703 mio_gmp_real (&e->value.complex.i);
2707 mio_integer (&e->value.logical);
2711 mio_integer (&e->value.character.length);
2712 e->value.character.string = (char *)
2713 mio_allocated_string (e->value.character.string);
2717 bad_module ("Bad type in constant expression");
2730 /* Read and write namelists */
2733 mio_namelist (gfc_symbol * sym)
2735 gfc_namelist *n, *m;
2736 const char *check_name;
2740 if (iomode == IO_OUTPUT)
2742 for (n = sym->namelist; n; n = n->next)
2743 mio_symbol_ref (&n->sym);
2747 /* This departure from the standard is flagged as an error.
2748 It does, in fact, work correctly. TODO: Allow it
2750 if (sym->attr.flavor == FL_NAMELIST)
2752 check_name = find_use_name (sym->name);
2753 if (check_name && strcmp (check_name, sym->name) != 0)
2754 gfc_error("Namelist %s cannot be renamed by USE"
2755 " association to %s",
2756 sym->name, check_name);
2760 while (peek_atom () != ATOM_RPAREN)
2762 n = gfc_get_namelist ();
2763 mio_symbol_ref (&n->sym);
2765 if (sym->namelist == NULL)
2772 sym->namelist_tail = m;
2779 /* Save/restore lists of gfc_interface stuctures. When loading an
2780 interface, we are really appending to the existing list of
2781 interfaces. Checking for duplicate and ambiguous interfaces has to
2782 be done later when all symbols have been loaded. */
2785 mio_interface_rest (gfc_interface ** ip)
2787 gfc_interface *tail, *p;
2789 if (iomode == IO_OUTPUT)
2792 for (p = *ip; p; p = p->next)
2793 mio_symbol_ref (&p->sym);
2809 if (peek_atom () == ATOM_RPAREN)
2812 p = gfc_get_interface ();
2813 p->where = gfc_current_locus;
2814 mio_symbol_ref (&p->sym);
2829 /* Save/restore a nameless operator interface. */
2832 mio_interface (gfc_interface ** ip)
2836 mio_interface_rest (ip);
2840 /* Save/restore a named operator interface. */
2843 mio_symbol_interface (const char **name, const char **module,
2844 gfc_interface ** ip)
2849 mio_pool_string (name);
2850 mio_pool_string (module);
2852 mio_interface_rest (ip);
2857 mio_namespace_ref (gfc_namespace ** nsp)
2862 p = mio_pointer_ref (nsp);
2864 if (p->type == P_UNKNOWN)
2865 p->type = P_NAMESPACE;
2867 if (iomode == IO_INPUT && p->integer != 0)
2869 ns = (gfc_namespace *)p->u.pointer;
2872 ns = gfc_get_namespace (NULL, 0);
2873 associate_integer_pointer (p, ns);
2881 /* Unlike most other routines, the address of the symbol node is
2882 already fixed on input and the name/module has already been filled
2886 mio_symbol (gfc_symbol * sym)
2888 gfc_formal_arglist *formal;
2892 mio_symbol_attribute (&sym->attr);
2893 mio_typespec (&sym->ts);
2895 /* Contained procedures don't have formal namespaces. Instead we output the
2896 procedure namespace. The will contain the formal arguments. */
2897 if (iomode == IO_OUTPUT)
2899 formal = sym->formal;
2900 while (formal && !formal->sym)
2901 formal = formal->next;
2904 mio_namespace_ref (&formal->sym->ns);
2906 mio_namespace_ref (&sym->formal_ns);
2910 mio_namespace_ref (&sym->formal_ns);
2913 sym->formal_ns->proc_name = sym;
2918 /* Save/restore common block links */
2919 mio_symbol_ref (&sym->common_next);
2921 mio_formal_arglist (sym);
2923 if (sym->attr.flavor == FL_PARAMETER)
2924 mio_expr (&sym->value);
2926 mio_array_spec (&sym->as);
2928 mio_symbol_ref (&sym->result);
2930 if (sym->attr.cray_pointee)
2931 mio_symbol_ref (&sym->cp_pointer);
2933 /* Note that components are always saved, even if they are supposed
2934 to be private. Component access is checked during searching. */
2936 mio_component_list (&sym->components);
2938 if (sym->components != NULL)
2939 sym->component_access =
2940 MIO_NAME(gfc_access) (sym->component_access, access_types);
2947 /************************* Top level subroutines *************************/
2949 /* Skip a list between balanced left and right parens. */
2959 switch (parse_atom ())
2970 gfc_free (atom_string);
2982 /* Load operator interfaces from the module. Interfaces are unusual
2983 in that they attach themselves to existing symbols. */
2986 load_operator_interfaces (void)
2989 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
2994 while (peek_atom () != ATOM_RPAREN)
2998 mio_internal_string (name);
2999 mio_internal_string (module);
3001 /* Decide if we need to load this one or not. */
3002 p = find_use_name (name);
3005 while (parse_atom () != ATOM_RPAREN);
3009 uop = gfc_get_uop (p);
3010 mio_interface_rest (&uop->operator);
3018 /* Load interfaces from the module. Interfaces are unusual in that
3019 they attach themselves to existing symbols. */
3022 load_generic_interfaces (void)
3025 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
3027 gfc_interface *generic = NULL;
3032 while (peek_atom () != ATOM_RPAREN)
3036 mio_internal_string (name);
3037 mio_internal_string (module);
3039 n = number_use_names (name);
3042 for (i = 1; i <= n; i++)
3044 /* Decide if we need to load this one or not. */
3045 p = find_use_name_n (name, &i);
3047 if (p == NULL || gfc_find_symbol (p, NULL, 0, &sym))
3049 while (parse_atom () != ATOM_RPAREN);
3055 gfc_get_symbol (p, NULL, &sym);
3057 sym->attr.flavor = FL_PROCEDURE;
3058 sym->attr.generic = 1;
3059 sym->attr.use_assoc = 1;
3063 mio_interface_rest (&sym->generic);
3064 generic = sym->generic;
3068 sym->generic = generic;
3069 sym->attr.generic_copy = 1;
3078 /* Load common blocks. */
3083 char name[GFC_MAX_SYMBOL_LEN+1];
3088 while (peek_atom () != ATOM_RPAREN)
3092 mio_internal_string (name);
3094 p = gfc_get_common (name, 1);
3096 mio_symbol_ref (&p->head);
3097 mio_integer (&flags);
3101 p->threadprivate = 1;
3110 /* load_equiv()-- Load equivalences. The flag in_load_equiv informs
3111 mio_expr_ref of this so that unused variables are not loaded and
3112 so that the expression can be safely freed.*/
3117 gfc_equiv *head, *tail, *end, *eq;
3121 in_load_equiv = true;
3123 end = gfc_current_ns->equiv;
3124 while(end != NULL && end->next != NULL)
3127 while(peek_atom() != ATOM_RPAREN) {
3131 while(peek_atom() != ATOM_RPAREN)
3134 head = tail = gfc_get_equiv();
3137 tail->eq = gfc_get_equiv();
3141 mio_pool_string(&tail->module);
3142 mio_expr(&tail->expr);
3145 /* Unused variables have no symtree. */
3147 for (eq = head; eq; eq = eq->eq)
3149 if (!eq->expr->symtree)
3158 for (eq = head; eq; eq = head)
3161 gfc_free_expr (eq->expr);
3167 gfc_current_ns->equiv = head;
3178 in_load_equiv = false;
3181 /* Recursive function to traverse the pointer_info tree and load a
3182 needed symbol. We return nonzero if we load a symbol and stop the
3183 traversal, because the act of loading can alter the tree. */
3186 load_needed (pointer_info * p)
3197 rv |= load_needed (p->left);
3198 rv |= load_needed (p->right);
3200 if (p->type != P_SYMBOL || p->u.rsym.state != NEEDED)
3203 p->u.rsym.state = USED;
3205 set_module_locus (&p->u.rsym.where);
3207 sym = p->u.rsym.sym;
3210 q = get_integer (p->u.rsym.ns);
3212 ns = (gfc_namespace *) q->u.pointer;
3215 /* Create an interface namespace if necessary. These are
3216 the namespaces that hold the formal parameters of module
3219 ns = gfc_get_namespace (NULL, 0);
3220 associate_integer_pointer (q, ns);
3223 sym = gfc_new_symbol (p->u.rsym.true_name, ns);
3224 sym->module = gfc_get_string (p->u.rsym.module);
3226 associate_integer_pointer (p, sym);
3230 sym->attr.use_assoc = 1;
3236 /* Recursive function for cleaning up things after a module has been
3240 read_cleanup (pointer_info * p)
3248 read_cleanup (p->left);
3249 read_cleanup (p->right);
3251 if (p->type == P_SYMBOL && p->u.rsym.state == USED && !p->u.rsym.referenced)
3253 /* Add hidden symbols to the symtree. */
3254 q = get_integer (p->u.rsym.ns);
3255 st = get_unique_symtree ((gfc_namespace *) q->u.pointer);
3257 st->n.sym = p->u.rsym.sym;
3260 /* Fixup any symtree references. */
3261 p->u.rsym.symtree = st;
3262 resolve_fixups (p->u.rsym.stfixup, st);
3263 p->u.rsym.stfixup = NULL;
3266 /* Free unused symbols. */
3267 if (p->type == P_SYMBOL && p->u.rsym.state == UNUSED)
3268 gfc_free_symbol (p->u.rsym.sym);
3272 /* Read a module file. */
3277 module_locus operator_interfaces, user_operators;
3279 char name[GFC_MAX_SYMBOL_LEN + 1];
3281 int ambiguous, j, nuse, symbol;
3287 get_module_locus (&operator_interfaces); /* Skip these for now */
3290 get_module_locus (&user_operators);
3294 /* Skip commons and equivalences for now. */
3300 /* Create the fixup nodes for all the symbols. */
3302 while (peek_atom () != ATOM_RPAREN)
3304 require_atom (ATOM_INTEGER);
3305 info = get_integer (atom_int);
3307 info->type = P_SYMBOL;
3308 info->u.rsym.state = UNUSED;
3310 mio_internal_string (info->u.rsym.true_name);
3311 mio_internal_string (info->u.rsym.module);
3313 require_atom (ATOM_INTEGER);
3314 info->u.rsym.ns = atom_int;
3316 get_module_locus (&info->u.rsym.where);
3319 /* See if the symbol has already been loaded by a previous module.
3320 If so, we reference the existing symbol and prevent it from
3321 being loaded again. This should not happen if the symbol being
3322 read is an index for an assumed shape dummy array (ns != 1). */
3324 sym = find_true_name (info->u.rsym.true_name, info->u.rsym.module);
3327 || (sym->attr.flavor == FL_VARIABLE
3328 && info->u.rsym.ns !=1))
3331 info->u.rsym.state = USED;
3332 info->u.rsym.referenced = 1;
3333 info->u.rsym.sym = sym;
3338 /* Parse the symtree lists. This lets us mark which symbols need to
3339 be loaded. Renaming is also done at this point by replacing the
3344 while (peek_atom () != ATOM_RPAREN)
3346 mio_internal_string (name);
3347 mio_integer (&ambiguous);
3348 mio_integer (&symbol);
3350 info = get_integer (symbol);
3352 /* See how many use names there are. If none, go through the start
3353 of the loop at least once. */
3354 nuse = number_use_names (name);
3358 for (j = 1; j <= nuse; j++)
3360 /* Get the jth local name for this symbol. */
3361 p = find_use_name_n (name, &j);
3363 /* Skip symtree nodes not in an ONLY clause. */
3367 /* Check for ambiguous symbols. */
3368 st = gfc_find_symtree (gfc_current_ns->sym_root, p);
3372 if (st->n.sym != info->u.rsym.sym)
3374 info->u.rsym.symtree = st;
3378 /* Create a symtree node in the current namespace for this symbol. */
3379 st = check_unique_name (p) ? get_unique_symtree (gfc_current_ns) :
3380 gfc_new_symtree (&gfc_current_ns->sym_root, p);
3382 st->ambiguous = ambiguous;
3384 sym = info->u.rsym.sym;
3386 /* Create a symbol node if it doesn't already exist. */
3389 sym = info->u.rsym.sym =
3390 gfc_new_symbol (info->u.rsym.true_name,
3393 sym->module = gfc_get_string (info->u.rsym.module);
3399 /* Store the symtree pointing to this symbol. */
3400 info->u.rsym.symtree = st;
3402 if (info->u.rsym.state == UNUSED)
3403 info->u.rsym.state = NEEDED;
3404 info->u.rsym.referenced = 1;
3411 /* Load intrinsic operator interfaces. */
3412 set_module_locus (&operator_interfaces);
3415 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
3417 if (i == INTRINSIC_USER)
3422 u = find_use_operator (i);
3433 mio_interface (&gfc_current_ns->operator[i]);
3438 /* Load generic and user operator interfaces. These must follow the
3439 loading of symtree because otherwise symbols can be marked as
3442 set_module_locus (&user_operators);
3444 load_operator_interfaces ();
3445 load_generic_interfaces ();
3450 /* At this point, we read those symbols that are needed but haven't
3451 been loaded yet. If one symbol requires another, the other gets
3452 marked as NEEDED if its previous state was UNUSED. */
3454 while (load_needed (pi_root));
3456 /* Make sure all elements of the rename-list were found in the
3459 for (u = gfc_rename_list; u; u = u->next)
3464 if (u->operator == INTRINSIC_NONE)
3466 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3467 u->use_name, &u->where, module_name);
3471 if (u->operator == INTRINSIC_USER)
3474 ("User operator '%s' referenced at %L not found in module '%s'",
3475 u->use_name, &u->where, module_name);
3480 ("Intrinsic operator '%s' referenced at %L not found in module "
3481 "'%s'", gfc_op2string (u->operator), &u->where, module_name);
3484 gfc_check_interfaces (gfc_current_ns);
3486 /* Clean up symbol nodes that were never loaded, create references
3487 to hidden symbols. */
3489 read_cleanup (pi_root);
3493 /* Given an access type that is specific to an entity and the default
3494 access, return nonzero if the entity is publicly accessible. If the
3495 element is declared as PUBLIC, then it is public; if declared
3496 PRIVATE, then private, and otherwise it is public unless the default
3497 access in this context has been declared PRIVATE. */
3500 gfc_check_access (gfc_access specific_access, gfc_access default_access)
3503 if (specific_access == ACCESS_PUBLIC)
3505 if (specific_access == ACCESS_PRIVATE)
3508 return default_access != ACCESS_PRIVATE;
3512 /* Write a common block to the module */
3515 write_common (gfc_symtree *st)
3524 write_common(st->left);
3525 write_common(st->right);
3529 /* Write the unmangled name. */
3530 name = st->n.common->name;
3532 mio_pool_string(&name);
3535 mio_symbol_ref(&p->head);
3536 flags = p->saved ? 1 : 0;
3537 if (p->threadprivate) flags |= 2;
3538 mio_integer(&flags);
3543 /* Write the blank common block to the module */
3546 write_blank_common (void)
3548 const char * name = BLANK_COMMON_NAME;
3551 if (gfc_current_ns->blank_common.head == NULL)
3556 mio_pool_string(&name);
3558 mio_symbol_ref(&gfc_current_ns->blank_common.head);
3559 saved = gfc_current_ns->blank_common.saved;
3560 mio_integer(&saved);
3565 /* Write equivalences to the module. */
3574 for(eq=gfc_current_ns->equiv; eq; eq=eq->next)
3578 for(e=eq; e; e=e->eq)
3580 if (e->module == NULL)
3581 e->module = gfc_get_string("%s.eq.%d", module_name, num);
3582 mio_allocated_string(e->module);
3591 /* Write a symbol to the module. */
3594 write_symbol (int n, gfc_symbol * sym)
3597 if (sym->attr.flavor == FL_UNKNOWN || sym->attr.flavor == FL_LABEL)
3598 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym->name);
3601 mio_pool_string (&sym->name);
3603 mio_pool_string (&sym->module);
3604 mio_pointer_ref (&sym->ns);
3611 /* Recursive traversal function to write the initial set of symbols to
3612 the module. We check to see if the symbol should be written
3613 according to the access specification. */
3616 write_symbol0 (gfc_symtree * st)
3624 write_symbol0 (st->left);
3625 write_symbol0 (st->right);
3628 if (sym->module == NULL)
3629 sym->module = gfc_get_string (module_name);
3631 if (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
3632 && !sym->attr.subroutine && !sym->attr.function)
3635 if (!gfc_check_access (sym->attr.access, sym->ns->default_access))
3638 p = get_pointer (sym);
3639 if (p->type == P_UNKNOWN)
3642 if (p->u.wsym.state == WRITTEN)
3645 write_symbol (p->integer, sym);
3646 p->u.wsym.state = WRITTEN;
3652 /* Recursive traversal function to write the secondary set of symbols
3653 to the module file. These are symbols that were not public yet are
3654 needed by the public symbols or another dependent symbol. The act
3655 of writing a symbol can modify the pointer_info tree, so we cease
3656 traversal if we find a symbol to write. We return nonzero if a
3657 symbol was written and pass that information upwards. */
3660 write_symbol1 (pointer_info * p)
3666 if (write_symbol1 (p->left))
3668 if (write_symbol1 (p->right))
3671 if (p->type != P_SYMBOL || p->u.wsym.state != NEEDS_WRITE)
3674 p->u.wsym.state = WRITTEN;
3675 write_symbol (p->integer, p->u.wsym.sym);
3681 /* Write operator interfaces associated with a symbol. */
3684 write_operator (gfc_user_op * uop)
3686 static char nullstring[] = "";
3687 const char *p = nullstring;
3689 if (uop->operator == NULL
3690 || !gfc_check_access (uop->access, uop->ns->default_access))
3693 mio_symbol_interface (&uop->name, &p, &uop->operator);
3697 /* Write generic interfaces associated with a symbol. */
3700 write_generic (gfc_symbol * sym)
3703 if (sym->generic == NULL
3704 || !gfc_check_access (sym->attr.access, sym->ns->default_access))
3707 mio_symbol_interface (&sym->name, &sym->module, &sym->generic);
3712 write_symtree (gfc_symtree * st)
3718 if (!gfc_check_access (sym->attr.access, sym->ns->default_access)
3719 || (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
3720 && !sym->attr.subroutine && !sym->attr.function))
3723 if (check_unique_name (st->name))
3726 p = find_pointer (sym);
3728 gfc_internal_error ("write_symtree(): Symbol not written");
3730 mio_pool_string (&st->name);
3731 mio_integer (&st->ambiguous);
3732 mio_integer (&p->integer);
3741 /* Write the operator interfaces. */
3744 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
3746 if (i == INTRINSIC_USER)
3749 mio_interface (gfc_check_access (gfc_current_ns->operator_access[i],
3750 gfc_current_ns->default_access)
3751 ? &gfc_current_ns->operator[i] : NULL);
3759 gfc_traverse_user_op (gfc_current_ns, write_operator);
3765 gfc_traverse_ns (gfc_current_ns, write_generic);
3771 write_blank_common ();
3772 write_common (gfc_current_ns->common_root);
3780 write_char('\n'); write_char('\n');
3782 /* Write symbol information. First we traverse all symbols in the
3783 primary namespace, writing those that need to be written.
3784 Sometimes writing one symbol will cause another to need to be
3785 written. A list of these symbols ends up on the write stack, and
3786 we end by popping the bottom of the stack and writing the symbol
3787 until the stack is empty. */
3791 write_symbol0 (gfc_current_ns->sym_root);
3792 while (write_symbol1 (pi_root));
3800 gfc_traverse_symtree (gfc_current_ns->sym_root, write_symtree);
3805 /* Given module, dump it to disk. If there was an error while
3806 processing the module, dump_flag will be set to zero and we delete
3807 the module file, even if it was already there. */
3810 gfc_dump_module (const char *name, int dump_flag)
3816 n = strlen (name) + strlen (MODULE_EXTENSION) + 1;
3817 if (gfc_option.module_dir != NULL)
3819 filename = (char *) alloca (n + strlen (gfc_option.module_dir));
3820 strcpy (filename, gfc_option.module_dir);
3821 strcat (filename, name);
3825 filename = (char *) alloca (n);
3826 strcpy (filename, name);
3828 strcat (filename, MODULE_EXTENSION);
3836 module_fp = fopen (filename, "w");
3837 if (module_fp == NULL)
3838 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
3839 filename, strerror (errno));
3844 *strchr (p, '\n') = '\0';
3846 fprintf (module_fp, "GFORTRAN module created from %s on %s\n",
3847 gfc_source_file, p);
3848 fputs ("If you edit this, you'll get what you deserve.\n\n", module_fp);
3851 strcpy (module_name, name);
3857 free_pi_tree (pi_root);
3862 if (fclose (module_fp))
3863 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
3864 filename, strerror (errno));
3868 /* Add an integer named constant from a given module. */
3870 create_int_parameter (const char *name, int value, const char *modname)
3872 gfc_symtree * tmp_symtree;
3875 tmp_symtree = gfc_find_symtree (gfc_current_ns->sym_root, name);
3876 if (tmp_symtree != NULL)
3878 if (strcmp (modname, tmp_symtree->n.sym->module) == 0)
3881 gfc_error ("Symbol '%s' already declared", name);
3884 gfc_get_sym_tree (name, gfc_current_ns, &tmp_symtree);
3885 sym = tmp_symtree->n.sym;
3887 sym->module = gfc_get_string (modname);
3888 sym->attr.flavor = FL_PARAMETER;
3889 sym->ts.type = BT_INTEGER;
3890 sym->ts.kind = gfc_default_integer_kind;
3891 sym->value = gfc_int_expr (value);
3892 sym->attr.use_assoc = 1;
3895 /* USE the ISO_FORTRAN_ENV intrinsic module. */
3897 use_iso_fortran_env_module (void)
3899 static char mod[] = "iso_fortran_env";
3900 const char *local_name;
3902 gfc_symbol *mod_sym;
3903 gfc_symtree *mod_symtree;
3906 mstring symbol[] = {
3907 #define NAMED_INTCST(a,b,c) minit(b,0),
3908 #include "iso-fortran-env.def"
3910 minit (NULL, -1234) };
3913 #define NAMED_INTCST(a,b,c) symbol[i++].tag = c;
3914 #include "iso-fortran-env.def"
3917 /* Generate the symbol for the module itself. */
3918 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, mod);
3919 if (mod_symtree == NULL)
3921 gfc_get_sym_tree (mod, gfc_current_ns, &mod_symtree);
3922 gcc_assert (mod_symtree);
3923 mod_sym = mod_symtree->n.sym;
3925 mod_sym->attr.flavor = FL_MODULE;
3926 mod_sym->attr.intrinsic = 1;
3927 mod_sym->module = gfc_get_string (mod);
3930 if (!mod_symtree->n.sym->attr.intrinsic)
3931 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
3932 "non-intrinsic module name used previously", mod);
3934 /* Generate the symbols for the module integer named constants. */
3936 for (u = gfc_rename_list; u; u = u->next)
3938 for (i = 0; symbol[i].string; i++)
3939 if (strcmp (symbol[i].string, u->use_name) == 0)
3942 if (symbol[i].string == NULL)
3944 gfc_error ("Symbol '%s' referenced at %L does not exist in "
3945 "intrinsic module ISO_FORTRAN_ENV", u->use_name,
3950 if ((gfc_option.flag_default_integer || gfc_option.flag_default_real)
3951 && strcmp (symbol[i].string, "numeric_storage_size") == 0)
3952 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
3953 "from intrinsic module ISO_FORTRAN_ENV at %L is "
3954 "incompatible with option %s", &u->where,
3955 gfc_option.flag_default_integer
3956 ? "-fdefault-integer-8" : "-fdefault-real-8");
3958 create_int_parameter (u->local_name[0] ? u->local_name
3960 symbol[i].tag, mod);
3964 for (i = 0; symbol[i].string; i++)
3967 for (u = gfc_rename_list; u; u = u->next)
3969 if (strcmp (symbol[i].string, u->use_name) == 0)
3971 local_name = u->local_name;
3977 if ((gfc_option.flag_default_integer || gfc_option.flag_default_real)
3978 && strcmp (symbol[i].string, "numeric_storage_size") == 0)
3979 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
3980 "from intrinsic module ISO_FORTRAN_ENV at %C is "
3981 "incompatible with option %s",
3982 gfc_option.flag_default_integer
3983 ? "-fdefault-integer-8" : "-fdefault-real-8");
3985 create_int_parameter (local_name ? local_name : symbol[i].string,
3986 symbol[i].tag, mod);
3989 for (u = gfc_rename_list; u; u = u->next)
3994 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
3995 "module ISO_FORTRAN_ENV", u->use_name, &u->where);
4000 /* Process a USE directive. */
4003 gfc_use_module (void)
4008 gfc_symtree *mod_symtree;
4010 filename = (char *) alloca(strlen(module_name) + strlen(MODULE_EXTENSION)
4012 strcpy (filename, module_name);
4013 strcat (filename, MODULE_EXTENSION);
4015 /* First, try to find an non-intrinsic module, unless the USE statement
4016 specified that the module is intrinsic. */
4019 module_fp = gfc_open_included_file (filename, true, true);
4021 /* Then, see if it's an intrinsic one, unless the USE statement
4022 specified that the module is non-intrinsic. */
4023 if (module_fp == NULL && !specified_nonint)
4025 if (strcmp (module_name, "iso_fortran_env") == 0
4026 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: "
4027 "ISO_FORTRAN_ENV intrinsic module at %C") != FAILURE)
4029 use_iso_fortran_env_module ();
4033 module_fp = gfc_open_intrinsic_module (filename);
4035 if (module_fp == NULL && specified_int)
4036 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
4040 if (module_fp == NULL)
4041 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
4042 filename, strerror (errno));
4044 /* Check that we haven't already USEd an intrinsic module with the
4047 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, module_name);
4048 if (mod_symtree && mod_symtree->n.sym->attr.intrinsic)
4049 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
4050 "intrinsic module name used previously", module_name);
4057 /* Skip the first two lines of the module, after checking that this is
4058 a gfortran module file. */
4064 bad_module ("Unexpected end of module");
4067 if ((start == 1 && strcmp (atom_name, "GFORTRAN") != 0)
4068 || (start == 2 && strcmp (atom_name, " module") != 0))
4069 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
4076 /* Make sure we're not reading the same module that we may be building. */
4077 for (p = gfc_state_stack; p; p = p->previous)
4078 if (p->state == COMP_MODULE && strcmp (p->sym->name, module_name) == 0)
4079 gfc_fatal_error ("Can't USE the same module we're building!");
4082 init_true_name_tree ();
4086 free_true_name (true_name_root);
4087 true_name_root = NULL;
4089 free_pi_tree (pi_root);
4097 gfc_module_init_2 (void)
4100 last_atom = ATOM_LPAREN;
4105 gfc_module_done_2 (void)