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
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 /* Read or write a string that is in static memory. */
1480 mio_pool_string (const char **stringp)
1482 /* TODO: one could write the string only once, and refer to it via a
1485 /* As a special case we have to deal with a NULL string. This
1486 happens for the 'module' member of 'gfc_symbol's that are not in a
1487 module. We read / write these as the empty string. */
1488 if (iomode == IO_OUTPUT)
1490 const char *p = *stringp == NULL ? "" : *stringp;
1491 write_atom (ATOM_STRING, p);
1495 require_atom (ATOM_STRING);
1496 *stringp = atom_string[0] == '\0' ? NULL : gfc_get_string (atom_string);
1497 gfc_free (atom_string);
1502 /* Read or write a string that is inside of some already-allocated
1506 mio_internal_string (char *string)
1508 if (iomode == IO_OUTPUT)
1509 write_atom (ATOM_STRING, string);
1512 require_atom (ATOM_STRING);
1513 strcpy (string, atom_string);
1514 gfc_free (atom_string);
1520 { AB_ALLOCATABLE, AB_DIMENSION, AB_EXTERNAL, AB_INTRINSIC, AB_OPTIONAL,
1521 AB_POINTER, AB_TARGET, AB_DUMMY, AB_RESULT, AB_DATA,
1522 AB_IN_NAMELIST, AB_IN_COMMON, AB_FUNCTION, AB_SUBROUTINE, AB_SEQUENCE,
1523 AB_ELEMENTAL, AB_PURE, AB_RECURSIVE, AB_GENERIC, AB_ALWAYS_EXPLICIT,
1524 AB_CRAY_POINTER, AB_CRAY_POINTEE, AB_THREADPRIVATE, AB_ALLOC_COMP,
1525 AB_POINTER_COMP, AB_PRIVATE_COMP, AB_VALUE, AB_VOLATILE, AB_PROTECTED,
1526 AB_IS_BIND_C, AB_IS_C_INTEROP, AB_IS_ISO_C, AB_ABSTRACT, AB_ZERO_COMP
1530 static const mstring attr_bits[] =
1532 minit ("ALLOCATABLE", AB_ALLOCATABLE),
1533 minit ("DIMENSION", AB_DIMENSION),
1534 minit ("EXTERNAL", AB_EXTERNAL),
1535 minit ("INTRINSIC", AB_INTRINSIC),
1536 minit ("OPTIONAL", AB_OPTIONAL),
1537 minit ("POINTER", AB_POINTER),
1538 minit ("VOLATILE", AB_VOLATILE),
1539 minit ("TARGET", AB_TARGET),
1540 minit ("THREADPRIVATE", AB_THREADPRIVATE),
1541 minit ("DUMMY", AB_DUMMY),
1542 minit ("RESULT", AB_RESULT),
1543 minit ("DATA", AB_DATA),
1544 minit ("IN_NAMELIST", AB_IN_NAMELIST),
1545 minit ("IN_COMMON", AB_IN_COMMON),
1546 minit ("FUNCTION", AB_FUNCTION),
1547 minit ("SUBROUTINE", AB_SUBROUTINE),
1548 minit ("SEQUENCE", AB_SEQUENCE),
1549 minit ("ELEMENTAL", AB_ELEMENTAL),
1550 minit ("PURE", AB_PURE),
1551 minit ("RECURSIVE", AB_RECURSIVE),
1552 minit ("GENERIC", AB_GENERIC),
1553 minit ("ALWAYS_EXPLICIT", AB_ALWAYS_EXPLICIT),
1554 minit ("CRAY_POINTER", AB_CRAY_POINTER),
1555 minit ("CRAY_POINTEE", AB_CRAY_POINTEE),
1556 minit ("IS_BIND_C", AB_IS_BIND_C),
1557 minit ("IS_C_INTEROP", AB_IS_C_INTEROP),
1558 minit ("IS_ISO_C", AB_IS_ISO_C),
1559 minit ("VALUE", AB_VALUE),
1560 minit ("ALLOC_COMP", AB_ALLOC_COMP),
1561 minit ("POINTER_COMP", AB_POINTER_COMP),
1562 minit ("PRIVATE_COMP", AB_PRIVATE_COMP),
1563 minit ("ZERO_COMP", AB_ZERO_COMP),
1564 minit ("PROTECTED", AB_PROTECTED),
1565 minit ("ABSTRACT", AB_ABSTRACT),
1570 /* Specialization of mio_name. */
1571 DECL_MIO_NAME (ab_attribute)
1572 DECL_MIO_NAME (ar_type)
1573 DECL_MIO_NAME (array_type)
1575 DECL_MIO_NAME (expr_t)
1576 DECL_MIO_NAME (gfc_access)
1577 DECL_MIO_NAME (gfc_intrinsic_op)
1578 DECL_MIO_NAME (ifsrc)
1579 DECL_MIO_NAME (save_state)
1580 DECL_MIO_NAME (procedure_type)
1581 DECL_MIO_NAME (ref_type)
1582 DECL_MIO_NAME (sym_flavor)
1583 DECL_MIO_NAME (sym_intent)
1584 #undef DECL_MIO_NAME
1586 /* Symbol attributes are stored in list with the first three elements
1587 being the enumerated fields, while the remaining elements (if any)
1588 indicate the individual attribute bits. The access field is not
1589 saved-- it controls what symbols are exported when a module is
1593 mio_symbol_attribute (symbol_attribute *attr)
1599 attr->flavor = MIO_NAME (sym_flavor) (attr->flavor, flavors);
1600 attr->intent = MIO_NAME (sym_intent) (attr->intent, intents);
1601 attr->proc = MIO_NAME (procedure_type) (attr->proc, procedures);
1602 attr->if_source = MIO_NAME (ifsrc) (attr->if_source, ifsrc_types);
1603 attr->save = MIO_NAME (save_state) (attr->save, save_status);
1605 if (iomode == IO_OUTPUT)
1607 if (attr->allocatable)
1608 MIO_NAME (ab_attribute) (AB_ALLOCATABLE, attr_bits);
1609 if (attr->dimension)
1610 MIO_NAME (ab_attribute) (AB_DIMENSION, attr_bits);
1612 MIO_NAME (ab_attribute) (AB_EXTERNAL, attr_bits);
1613 if (attr->intrinsic)
1614 MIO_NAME (ab_attribute) (AB_INTRINSIC, attr_bits);
1616 MIO_NAME (ab_attribute) (AB_OPTIONAL, attr_bits);
1618 MIO_NAME (ab_attribute) (AB_POINTER, attr_bits);
1619 if (attr->protected)
1620 MIO_NAME (ab_attribute) (AB_PROTECTED, attr_bits);
1622 MIO_NAME (ab_attribute) (AB_VALUE, attr_bits);
1623 if (attr->volatile_)
1624 MIO_NAME (ab_attribute) (AB_VOLATILE, attr_bits);
1626 MIO_NAME (ab_attribute) (AB_TARGET, attr_bits);
1627 if (attr->threadprivate)
1628 MIO_NAME (ab_attribute) (AB_THREADPRIVATE, attr_bits);
1630 MIO_NAME (ab_attribute) (AB_DUMMY, attr_bits);
1632 MIO_NAME (ab_attribute) (AB_RESULT, attr_bits);
1633 /* We deliberately don't preserve the "entry" flag. */
1636 MIO_NAME (ab_attribute) (AB_DATA, attr_bits);
1637 if (attr->in_namelist)
1638 MIO_NAME (ab_attribute) (AB_IN_NAMELIST, attr_bits);
1639 if (attr->in_common)
1640 MIO_NAME (ab_attribute) (AB_IN_COMMON, attr_bits);
1643 MIO_NAME (ab_attribute) (AB_FUNCTION, attr_bits);
1644 if (attr->subroutine)
1645 MIO_NAME (ab_attribute) (AB_SUBROUTINE, attr_bits);
1647 MIO_NAME (ab_attribute) (AB_GENERIC, attr_bits);
1649 MIO_NAME (ab_attribute) (AB_ABSTRACT, attr_bits);
1652 MIO_NAME (ab_attribute) (AB_SEQUENCE, attr_bits);
1653 if (attr->elemental)
1654 MIO_NAME (ab_attribute) (AB_ELEMENTAL, attr_bits);
1656 MIO_NAME (ab_attribute) (AB_PURE, attr_bits);
1657 if (attr->recursive)
1658 MIO_NAME (ab_attribute) (AB_RECURSIVE, attr_bits);
1659 if (attr->always_explicit)
1660 MIO_NAME (ab_attribute) (AB_ALWAYS_EXPLICIT, attr_bits);
1661 if (attr->cray_pointer)
1662 MIO_NAME (ab_attribute) (AB_CRAY_POINTER, attr_bits);
1663 if (attr->cray_pointee)
1664 MIO_NAME (ab_attribute) (AB_CRAY_POINTEE, attr_bits);
1665 if (attr->is_bind_c)
1666 MIO_NAME(ab_attribute) (AB_IS_BIND_C, attr_bits);
1667 if (attr->is_c_interop)
1668 MIO_NAME(ab_attribute) (AB_IS_C_INTEROP, attr_bits);
1670 MIO_NAME(ab_attribute) (AB_IS_ISO_C, attr_bits);
1671 if (attr->alloc_comp)
1672 MIO_NAME (ab_attribute) (AB_ALLOC_COMP, attr_bits);
1673 if (attr->pointer_comp)
1674 MIO_NAME (ab_attribute) (AB_POINTER_COMP, attr_bits);
1675 if (attr->private_comp)
1676 MIO_NAME (ab_attribute) (AB_PRIVATE_COMP, attr_bits);
1677 if (attr->zero_comp)
1678 MIO_NAME (ab_attribute) (AB_ZERO_COMP, attr_bits);
1688 if (t == ATOM_RPAREN)
1691 bad_module ("Expected attribute bit name");
1693 switch ((ab_attribute) find_enum (attr_bits))
1695 case AB_ALLOCATABLE:
1696 attr->allocatable = 1;
1699 attr->dimension = 1;
1705 attr->intrinsic = 1;
1714 attr->protected = 1;
1720 attr->volatile_ = 1;
1725 case AB_THREADPRIVATE:
1726 attr->threadprivate = 1;
1737 case AB_IN_NAMELIST:
1738 attr->in_namelist = 1;
1741 attr->in_common = 1;
1747 attr->subroutine = 1;
1759 attr->elemental = 1;
1765 attr->recursive = 1;
1767 case AB_ALWAYS_EXPLICIT:
1768 attr->always_explicit = 1;
1770 case AB_CRAY_POINTER:
1771 attr->cray_pointer = 1;
1773 case AB_CRAY_POINTEE:
1774 attr->cray_pointee = 1;
1777 attr->is_bind_c = 1;
1779 case AB_IS_C_INTEROP:
1780 attr->is_c_interop = 1;
1786 attr->alloc_comp = 1;
1788 case AB_POINTER_COMP:
1789 attr->pointer_comp = 1;
1791 case AB_PRIVATE_COMP:
1792 attr->private_comp = 1;
1795 attr->zero_comp = 1;
1803 static const mstring bt_types[] = {
1804 minit ("INTEGER", BT_INTEGER),
1805 minit ("REAL", BT_REAL),
1806 minit ("COMPLEX", BT_COMPLEX),
1807 minit ("LOGICAL", BT_LOGICAL),
1808 minit ("CHARACTER", BT_CHARACTER),
1809 minit ("DERIVED", BT_DERIVED),
1810 minit ("PROCEDURE", BT_PROCEDURE),
1811 minit ("UNKNOWN", BT_UNKNOWN),
1812 minit ("VOID", BT_VOID),
1818 mio_charlen (gfc_charlen **clp)
1824 if (iomode == IO_OUTPUT)
1828 mio_expr (&cl->length);
1832 if (peek_atom () != ATOM_RPAREN)
1834 cl = gfc_get_charlen ();
1835 mio_expr (&cl->length);
1839 cl->next = gfc_current_ns->cl_list;
1840 gfc_current_ns->cl_list = cl;
1848 /* See if a name is a generated name. */
1851 check_unique_name (const char *name)
1853 return *name == '@';
1858 mio_typespec (gfc_typespec *ts)
1862 ts->type = MIO_NAME (bt) (ts->type, bt_types);
1864 if (ts->type != BT_DERIVED)
1865 mio_integer (&ts->kind);
1867 mio_symbol_ref (&ts->derived);
1869 /* Add info for C interop and is_iso_c. */
1870 mio_integer (&ts->is_c_interop);
1871 mio_integer (&ts->is_iso_c);
1873 /* If the typespec is for an identifier either from iso_c_binding, or
1874 a constant that was initialized to an identifier from it, use the
1875 f90_type. Otherwise, use the ts->type, since it shouldn't matter. */
1877 ts->f90_type = MIO_NAME (bt) (ts->f90_type, bt_types);
1879 ts->f90_type = MIO_NAME (bt) (ts->type, bt_types);
1881 if (ts->type != BT_CHARACTER)
1883 /* ts->cl is only valid for BT_CHARACTER. */
1888 mio_charlen (&ts->cl);
1894 static const mstring array_spec_types[] = {
1895 minit ("EXPLICIT", AS_EXPLICIT),
1896 minit ("ASSUMED_SHAPE", AS_ASSUMED_SHAPE),
1897 minit ("DEFERRED", AS_DEFERRED),
1898 minit ("ASSUMED_SIZE", AS_ASSUMED_SIZE),
1904 mio_array_spec (gfc_array_spec **asp)
1911 if (iomode == IO_OUTPUT)
1919 if (peek_atom () == ATOM_RPAREN)
1925 *asp = as = gfc_get_array_spec ();
1928 mio_integer (&as->rank);
1929 as->type = MIO_NAME (array_type) (as->type, array_spec_types);
1931 for (i = 0; i < as->rank; i++)
1933 mio_expr (&as->lower[i]);
1934 mio_expr (&as->upper[i]);
1942 /* Given a pointer to an array reference structure (which lives in a
1943 gfc_ref structure), find the corresponding array specification
1944 structure. Storing the pointer in the ref structure doesn't quite
1945 work when loading from a module. Generating code for an array
1946 reference also needs more information than just the array spec. */
1948 static const mstring array_ref_types[] = {
1949 minit ("FULL", AR_FULL),
1950 minit ("ELEMENT", AR_ELEMENT),
1951 minit ("SECTION", AR_SECTION),
1957 mio_array_ref (gfc_array_ref *ar)
1962 ar->type = MIO_NAME (ar_type) (ar->type, array_ref_types);
1963 mio_integer (&ar->dimen);
1971 for (i = 0; i < ar->dimen; i++)
1972 mio_expr (&ar->start[i]);
1977 for (i = 0; i < ar->dimen; i++)
1979 mio_expr (&ar->start[i]);
1980 mio_expr (&ar->end[i]);
1981 mio_expr (&ar->stride[i]);
1987 gfc_internal_error ("mio_array_ref(): Unknown array ref");
1990 /* Unfortunately, ar->dimen_type is an anonymous enumerated type so
1991 we can't call mio_integer directly. Instead loop over each element
1992 and cast it to/from an integer. */
1993 if (iomode == IO_OUTPUT)
1995 for (i = 0; i < ar->dimen; i++)
1997 int tmp = (int)ar->dimen_type[i];
1998 write_atom (ATOM_INTEGER, &tmp);
2003 for (i = 0; i < ar->dimen; i++)
2005 require_atom (ATOM_INTEGER);
2006 ar->dimen_type[i] = atom_int;
2010 if (iomode == IO_INPUT)
2012 ar->where = gfc_current_locus;
2014 for (i = 0; i < ar->dimen; i++)
2015 ar->c_where[i] = gfc_current_locus;
2022 /* Saves or restores a pointer. The pointer is converted back and
2023 forth from an integer. We return the pointer_info pointer so that
2024 the caller can take additional action based on the pointer type. */
2026 static pointer_info *
2027 mio_pointer_ref (void *gp)
2031 if (iomode == IO_OUTPUT)
2033 p = get_pointer (*((char **) gp));
2034 write_atom (ATOM_INTEGER, &p->integer);
2038 require_atom (ATOM_INTEGER);
2039 p = add_fixup (atom_int, gp);
2046 /* Save and load references to components that occur within
2047 expressions. We have to describe these references by a number and
2048 by name. The number is necessary for forward references during
2049 reading, and the name is necessary if the symbol already exists in
2050 the namespace and is not loaded again. */
2053 mio_component_ref (gfc_component **cp, gfc_symbol *sym)
2055 char name[GFC_MAX_SYMBOL_LEN + 1];
2059 p = mio_pointer_ref (cp);
2060 if (p->type == P_UNKNOWN)
2061 p->type = P_COMPONENT;
2063 if (iomode == IO_OUTPUT)
2064 mio_pool_string (&(*cp)->name);
2067 mio_internal_string (name);
2069 /* It can happen that a component reference can be read before the
2070 associated derived type symbol has been loaded. Return now and
2071 wait for a later iteration of load_needed. */
2075 if (sym->components != NULL && p->u.pointer == NULL)
2077 /* Symbol already loaded, so search by name. */
2078 for (q = sym->components; q; q = q->next)
2079 if (strcmp (q->name, name) == 0)
2083 gfc_internal_error ("mio_component_ref(): Component not found");
2085 associate_integer_pointer (p, q);
2088 /* Make sure this symbol will eventually be loaded. */
2089 p = find_pointer2 (sym);
2090 if (p->u.rsym.state == UNUSED)
2091 p->u.rsym.state = NEEDED;
2097 mio_component (gfc_component *c)
2104 if (iomode == IO_OUTPUT)
2106 p = get_pointer (c);
2107 mio_integer (&p->integer);
2112 p = get_integer (n);
2113 associate_integer_pointer (p, c);
2116 if (p->type == P_UNKNOWN)
2117 p->type = P_COMPONENT;
2119 mio_pool_string (&c->name);
2120 mio_typespec (&c->ts);
2121 mio_array_spec (&c->as);
2123 mio_integer (&c->dimension);
2124 mio_integer (&c->pointer);
2125 mio_integer (&c->allocatable);
2126 c->access = MIO_NAME (gfc_access) (c->access, access_types);
2128 mio_expr (&c->initializer);
2134 mio_component_list (gfc_component **cp)
2136 gfc_component *c, *tail;
2140 if (iomode == IO_OUTPUT)
2142 for (c = *cp; c; c = c->next)
2152 if (peek_atom () == ATOM_RPAREN)
2155 c = gfc_get_component ();
2172 mio_actual_arg (gfc_actual_arglist *a)
2175 mio_pool_string (&a->name);
2176 mio_expr (&a->expr);
2182 mio_actual_arglist (gfc_actual_arglist **ap)
2184 gfc_actual_arglist *a, *tail;
2188 if (iomode == IO_OUTPUT)
2190 for (a = *ap; a; a = a->next)
2200 if (peek_atom () != ATOM_LPAREN)
2203 a = gfc_get_actual_arglist ();
2219 /* Read and write formal argument lists. */
2222 mio_formal_arglist (gfc_symbol *sym)
2224 gfc_formal_arglist *f, *tail;
2228 if (iomode == IO_OUTPUT)
2230 for (f = sym->formal; f; f = f->next)
2231 mio_symbol_ref (&f->sym);
2235 sym->formal = tail = NULL;
2237 while (peek_atom () != ATOM_RPAREN)
2239 f = gfc_get_formal_arglist ();
2240 mio_symbol_ref (&f->sym);
2242 if (sym->formal == NULL)
2255 /* Save or restore a reference to a symbol node. */
2258 mio_symbol_ref (gfc_symbol **symp)
2262 p = mio_pointer_ref (symp);
2263 if (p->type == P_UNKNOWN)
2266 if (iomode == IO_OUTPUT)
2268 if (p->u.wsym.state == UNREFERENCED)
2269 p->u.wsym.state = NEEDS_WRITE;
2273 if (p->u.rsym.state == UNUSED)
2274 p->u.rsym.state = NEEDED;
2280 /* Save or restore a reference to a symtree node. */
2283 mio_symtree_ref (gfc_symtree **stp)
2288 if (iomode == IO_OUTPUT)
2289 mio_symbol_ref (&(*stp)->n.sym);
2292 require_atom (ATOM_INTEGER);
2293 p = get_integer (atom_int);
2295 /* An unused equivalence member; make a symbol and a symtree
2297 if (in_load_equiv && p->u.rsym.symtree == NULL)
2299 /* Since this is not used, it must have a unique name. */
2300 p->u.rsym.symtree = gfc_get_unique_symtree (gfc_current_ns);
2302 /* Make the symbol. */
2303 if (p->u.rsym.sym == NULL)
2305 p->u.rsym.sym = gfc_new_symbol (p->u.rsym.true_name,
2307 p->u.rsym.sym->module = gfc_get_string (p->u.rsym.module);
2310 p->u.rsym.symtree->n.sym = p->u.rsym.sym;
2311 p->u.rsym.symtree->n.sym->refs++;
2312 p->u.rsym.referenced = 1;
2315 if (p->type == P_UNKNOWN)
2318 if (p->u.rsym.state == UNUSED)
2319 p->u.rsym.state = NEEDED;
2321 if (p->u.rsym.symtree != NULL)
2323 *stp = p->u.rsym.symtree;
2327 f = gfc_getmem (sizeof (fixup_t));
2329 f->next = p->u.rsym.stfixup;
2330 p->u.rsym.stfixup = f;
2332 f->pointer = (void **) stp;
2339 mio_iterator (gfc_iterator **ip)
2345 if (iomode == IO_OUTPUT)
2352 if (peek_atom () == ATOM_RPAREN)
2358 *ip = gfc_get_iterator ();
2363 mio_expr (&iter->var);
2364 mio_expr (&iter->start);
2365 mio_expr (&iter->end);
2366 mio_expr (&iter->step);
2374 mio_constructor (gfc_constructor **cp)
2376 gfc_constructor *c, *tail;
2380 if (iomode == IO_OUTPUT)
2382 for (c = *cp; c; c = c->next)
2385 mio_expr (&c->expr);
2386 mio_iterator (&c->iterator);
2395 while (peek_atom () != ATOM_RPAREN)
2397 c = gfc_get_constructor ();
2407 mio_expr (&c->expr);
2408 mio_iterator (&c->iterator);
2417 static const mstring ref_types[] = {
2418 minit ("ARRAY", REF_ARRAY),
2419 minit ("COMPONENT", REF_COMPONENT),
2420 minit ("SUBSTRING", REF_SUBSTRING),
2426 mio_ref (gfc_ref **rp)
2433 r->type = MIO_NAME (ref_type) (r->type, ref_types);
2438 mio_array_ref (&r->u.ar);
2442 mio_symbol_ref (&r->u.c.sym);
2443 mio_component_ref (&r->u.c.component, r->u.c.sym);
2447 mio_expr (&r->u.ss.start);
2448 mio_expr (&r->u.ss.end);
2449 mio_charlen (&r->u.ss.length);
2458 mio_ref_list (gfc_ref **rp)
2460 gfc_ref *ref, *head, *tail;
2464 if (iomode == IO_OUTPUT)
2466 for (ref = *rp; ref; ref = ref->next)
2473 while (peek_atom () != ATOM_RPAREN)
2476 head = tail = gfc_get_ref ();
2479 tail->next = gfc_get_ref ();
2493 /* Read and write an integer value. */
2496 mio_gmp_integer (mpz_t *integer)
2500 if (iomode == IO_INPUT)
2502 if (parse_atom () != ATOM_STRING)
2503 bad_module ("Expected integer string");
2505 mpz_init (*integer);
2506 if (mpz_set_str (*integer, atom_string, 10))
2507 bad_module ("Error converting integer");
2509 gfc_free (atom_string);
2513 p = mpz_get_str (NULL, 10, *integer);
2514 write_atom (ATOM_STRING, p);
2521 mio_gmp_real (mpfr_t *real)
2526 if (iomode == IO_INPUT)
2528 if (parse_atom () != ATOM_STRING)
2529 bad_module ("Expected real string");
2532 mpfr_set_str (*real, atom_string, 16, GFC_RND_MODE);
2533 gfc_free (atom_string);
2537 p = mpfr_get_str (NULL, &exponent, 16, 0, *real, GFC_RND_MODE);
2539 if (mpfr_nan_p (*real) || mpfr_inf_p (*real))
2541 write_atom (ATOM_STRING, p);
2546 atom_string = gfc_getmem (strlen (p) + 20);
2548 sprintf (atom_string, "0.%s@%ld", p, exponent);
2550 /* Fix negative numbers. */
2551 if (atom_string[2] == '-')
2553 atom_string[0] = '-';
2554 atom_string[1] = '0';
2555 atom_string[2] = '.';
2558 write_atom (ATOM_STRING, atom_string);
2560 gfc_free (atom_string);
2566 /* Save and restore the shape of an array constructor. */
2569 mio_shape (mpz_t **pshape, int rank)
2575 /* A NULL shape is represented by (). */
2578 if (iomode == IO_OUTPUT)
2590 if (t == ATOM_RPAREN)
2597 shape = gfc_get_shape (rank);
2601 for (n = 0; n < rank; n++)
2602 mio_gmp_integer (&shape[n]);
2608 static const mstring expr_types[] = {
2609 minit ("OP", EXPR_OP),
2610 minit ("FUNCTION", EXPR_FUNCTION),
2611 minit ("CONSTANT", EXPR_CONSTANT),
2612 minit ("VARIABLE", EXPR_VARIABLE),
2613 minit ("SUBSTRING", EXPR_SUBSTRING),
2614 minit ("STRUCTURE", EXPR_STRUCTURE),
2615 minit ("ARRAY", EXPR_ARRAY),
2616 minit ("NULL", EXPR_NULL),
2620 /* INTRINSIC_ASSIGN is missing because it is used as an index for
2621 generic operators, not in expressions. INTRINSIC_USER is also
2622 replaced by the correct function name by the time we see it. */
2624 static const mstring intrinsics[] =
2626 minit ("UPLUS", INTRINSIC_UPLUS),
2627 minit ("UMINUS", INTRINSIC_UMINUS),
2628 minit ("PLUS", INTRINSIC_PLUS),
2629 minit ("MINUS", INTRINSIC_MINUS),
2630 minit ("TIMES", INTRINSIC_TIMES),
2631 minit ("DIVIDE", INTRINSIC_DIVIDE),
2632 minit ("POWER", INTRINSIC_POWER),
2633 minit ("CONCAT", INTRINSIC_CONCAT),
2634 minit ("AND", INTRINSIC_AND),
2635 minit ("OR", INTRINSIC_OR),
2636 minit ("EQV", INTRINSIC_EQV),
2637 minit ("NEQV", INTRINSIC_NEQV),
2638 minit ("EQ_SIGN", INTRINSIC_EQ),
2639 minit ("EQ", INTRINSIC_EQ_OS),
2640 minit ("NE_SIGN", INTRINSIC_NE),
2641 minit ("NE", INTRINSIC_NE_OS),
2642 minit ("GT_SIGN", INTRINSIC_GT),
2643 minit ("GT", INTRINSIC_GT_OS),
2644 minit ("GE_SIGN", INTRINSIC_GE),
2645 minit ("GE", INTRINSIC_GE_OS),
2646 minit ("LT_SIGN", INTRINSIC_LT),
2647 minit ("LT", INTRINSIC_LT_OS),
2648 minit ("LE_SIGN", INTRINSIC_LE),
2649 minit ("LE", INTRINSIC_LE_OS),
2650 minit ("NOT", INTRINSIC_NOT),
2651 minit ("PARENTHESES", INTRINSIC_PARENTHESES),
2656 /* Remedy a couple of situations where the gfc_expr's can be defective. */
2659 fix_mio_expr (gfc_expr *e)
2661 gfc_symtree *ns_st = NULL;
2664 if (iomode != IO_OUTPUT)
2669 /* If this is a symtree for a symbol that came from a contained module
2670 namespace, it has a unique name and we should look in the current
2671 namespace to see if the required, non-contained symbol is available
2672 yet. If so, the latter should be written. */
2673 if (e->symtree->n.sym && check_unique_name (e->symtree->name))
2674 ns_st = gfc_find_symtree (gfc_current_ns->sym_root,
2675 e->symtree->n.sym->name);
2677 /* On the other hand, if the existing symbol is the module name or the
2678 new symbol is a dummy argument, do not do the promotion. */
2679 if (ns_st && ns_st->n.sym
2680 && ns_st->n.sym->attr.flavor != FL_MODULE
2681 && !e->symtree->n.sym->attr.dummy)
2684 else if (e->expr_type == EXPR_FUNCTION && e->value.function.name)
2686 /* In some circumstances, a function used in an initialization
2687 expression, in one use associated module, can fail to be
2688 coupled to its symtree when used in a specification
2689 expression in another module. */
2690 fname = e->value.function.esym ? e->value.function.esym->name
2691 : e->value.function.isym->name;
2692 e->symtree = gfc_find_symtree (gfc_current_ns->sym_root, fname);
2697 /* Read and write expressions. The form "()" is allowed to indicate a
2701 mio_expr (gfc_expr **ep)
2709 if (iomode == IO_OUTPUT)
2718 MIO_NAME (expr_t) (e->expr_type, expr_types);
2723 if (t == ATOM_RPAREN)
2730 bad_module ("Expected expression type");
2732 e = *ep = gfc_get_expr ();
2733 e->where = gfc_current_locus;
2734 e->expr_type = (expr_t) find_enum (expr_types);
2737 mio_typespec (&e->ts);
2738 mio_integer (&e->rank);
2742 switch (e->expr_type)
2745 e->value.op.operator
2746 = MIO_NAME (gfc_intrinsic_op) (e->value.op.operator, intrinsics);
2748 switch (e->value.op.operator)
2750 case INTRINSIC_UPLUS:
2751 case INTRINSIC_UMINUS:
2753 case INTRINSIC_PARENTHESES:
2754 mio_expr (&e->value.op.op1);
2757 case INTRINSIC_PLUS:
2758 case INTRINSIC_MINUS:
2759 case INTRINSIC_TIMES:
2760 case INTRINSIC_DIVIDE:
2761 case INTRINSIC_POWER:
2762 case INTRINSIC_CONCAT:
2766 case INTRINSIC_NEQV:
2768 case INTRINSIC_EQ_OS:
2770 case INTRINSIC_NE_OS:
2772 case INTRINSIC_GT_OS:
2774 case INTRINSIC_GE_OS:
2776 case INTRINSIC_LT_OS:
2778 case INTRINSIC_LE_OS:
2779 mio_expr (&e->value.op.op1);
2780 mio_expr (&e->value.op.op2);
2784 bad_module ("Bad operator");
2790 mio_symtree_ref (&e->symtree);
2791 mio_actual_arglist (&e->value.function.actual);
2793 if (iomode == IO_OUTPUT)
2795 e->value.function.name
2796 = mio_allocated_string (e->value.function.name);
2797 flag = e->value.function.esym != NULL;
2798 mio_integer (&flag);
2800 mio_symbol_ref (&e->value.function.esym);
2802 write_atom (ATOM_STRING, e->value.function.isym->name);
2806 require_atom (ATOM_STRING);
2807 e->value.function.name = gfc_get_string (atom_string);
2808 gfc_free (atom_string);
2810 mio_integer (&flag);
2812 mio_symbol_ref (&e->value.function.esym);
2815 require_atom (ATOM_STRING);
2816 e->value.function.isym = gfc_find_function (atom_string);
2817 gfc_free (atom_string);
2824 mio_symtree_ref (&e->symtree);
2825 mio_ref_list (&e->ref);
2828 case EXPR_SUBSTRING:
2829 e->value.character.string
2830 = CONST_CAST (char *, mio_allocated_string (e->value.character.string));
2831 mio_ref_list (&e->ref);
2834 case EXPR_STRUCTURE:
2836 mio_constructor (&e->value.constructor);
2837 mio_shape (&e->shape, e->rank);
2844 mio_gmp_integer (&e->value.integer);
2848 gfc_set_model_kind (e->ts.kind);
2849 mio_gmp_real (&e->value.real);
2853 gfc_set_model_kind (e->ts.kind);
2854 mio_gmp_real (&e->value.complex.r);
2855 mio_gmp_real (&e->value.complex.i);
2859 mio_integer (&e->value.logical);
2863 mio_integer (&e->value.character.length);
2864 e->value.character.string
2865 = CONST_CAST (char *, mio_allocated_string (e->value.character.string));
2869 bad_module ("Bad type in constant expression");
2882 /* Read and write namelists. */
2885 mio_namelist (gfc_symbol *sym)
2887 gfc_namelist *n, *m;
2888 const char *check_name;
2892 if (iomode == IO_OUTPUT)
2894 for (n = sym->namelist; n; n = n->next)
2895 mio_symbol_ref (&n->sym);
2899 /* This departure from the standard is flagged as an error.
2900 It does, in fact, work correctly. TODO: Allow it
2902 if (sym->attr.flavor == FL_NAMELIST)
2904 check_name = find_use_name (sym->name, false);
2905 if (check_name && strcmp (check_name, sym->name) != 0)
2906 gfc_error ("Namelist %s cannot be renamed by USE "
2907 "association to %s", sym->name, check_name);
2911 while (peek_atom () != ATOM_RPAREN)
2913 n = gfc_get_namelist ();
2914 mio_symbol_ref (&n->sym);
2916 if (sym->namelist == NULL)
2923 sym->namelist_tail = m;
2930 /* Save/restore lists of gfc_interface stuctures. When loading an
2931 interface, we are really appending to the existing list of
2932 interfaces. Checking for duplicate and ambiguous interfaces has to
2933 be done later when all symbols have been loaded. */
2936 mio_interface_rest (gfc_interface **ip)
2938 gfc_interface *tail, *p;
2939 pointer_info *pi = NULL;
2941 if (iomode == IO_OUTPUT)
2944 for (p = *ip; p; p = p->next)
2945 mio_symbol_ref (&p->sym);
2960 if (peek_atom () == ATOM_RPAREN)
2963 p = gfc_get_interface ();
2964 p->where = gfc_current_locus;
2965 pi = mio_symbol_ref (&p->sym);
2981 /* Save/restore a nameless operator interface. */
2984 mio_interface (gfc_interface **ip)
2987 mio_interface_rest (ip);
2991 /* Save/restore a named operator interface. */
2994 mio_symbol_interface (const char **name, const char **module,
2998 mio_pool_string (name);
2999 mio_pool_string (module);
3000 mio_interface_rest (ip);
3005 mio_namespace_ref (gfc_namespace **nsp)
3010 p = mio_pointer_ref (nsp);
3012 if (p->type == P_UNKNOWN)
3013 p->type = P_NAMESPACE;
3015 if (iomode == IO_INPUT && p->integer != 0)
3017 ns = (gfc_namespace *) p->u.pointer;
3020 ns = gfc_get_namespace (NULL, 0);
3021 associate_integer_pointer (p, ns);
3029 /* Unlike most other routines, the address of the symbol node is already
3030 fixed on input and the name/module has already been filled in. */
3033 mio_symbol (gfc_symbol *sym)
3035 int intmod = INTMOD_NONE;
3037 gfc_formal_arglist *formal;
3041 mio_symbol_attribute (&sym->attr);
3042 mio_typespec (&sym->ts);
3044 /* Contained procedures don't have formal namespaces. Instead we output the
3045 procedure namespace. The will contain the formal arguments. */
3046 if (iomode == IO_OUTPUT)
3048 formal = sym->formal;
3049 while (formal && !formal->sym)
3050 formal = formal->next;
3053 mio_namespace_ref (&formal->sym->ns);
3055 mio_namespace_ref (&sym->formal_ns);
3059 mio_namespace_ref (&sym->formal_ns);
3062 sym->formal_ns->proc_name = sym;
3067 /* Save/restore common block links. */
3068 mio_symbol_ref (&sym->common_next);
3070 mio_formal_arglist (sym);
3072 if (sym->attr.flavor == FL_PARAMETER)
3073 mio_expr (&sym->value);
3075 mio_array_spec (&sym->as);
3077 mio_symbol_ref (&sym->result);
3079 if (sym->attr.cray_pointee)
3080 mio_symbol_ref (&sym->cp_pointer);
3082 /* Note that components are always saved, even if they are supposed
3083 to be private. Component access is checked during searching. */
3085 mio_component_list (&sym->components);
3087 if (sym->components != NULL)
3088 sym->component_access
3089 = MIO_NAME (gfc_access) (sym->component_access, access_types);
3093 /* Add the fields that say whether this is from an intrinsic module,
3094 and if so, what symbol it is within the module. */
3095 /* mio_integer (&(sym->from_intmod)); */
3096 if (iomode == IO_OUTPUT)
3098 intmod = sym->from_intmod;
3099 mio_integer (&intmod);
3103 mio_integer (&intmod);
3104 sym->from_intmod = intmod;
3107 mio_integer (&(sym->intmod_sym_id));
3113 /************************* Top level subroutines *************************/
3115 /* Given a root symtree node and a symbol, try to find a symtree that
3116 references the symbol that is not a unique name. */
3118 static gfc_symtree *
3119 find_symtree_for_symbol (gfc_symtree *st, gfc_symbol *sym)
3121 gfc_symtree *s = NULL;
3126 s = find_symtree_for_symbol (st->right, sym);
3129 s = find_symtree_for_symbol (st->left, sym);
3133 if (st->n.sym == sym && !check_unique_name (st->name))
3140 /* A recursive function to look for a speficic symbol by name and by
3141 module. Whilst several symtrees might point to one symbol, its
3142 is sufficient for the purposes here than one exist. Note that
3143 generic interfaces are distinguished. */
3144 static gfc_symtree *
3145 find_symbol (gfc_symtree *st, const char *name,
3146 const char *module, int generic)
3149 gfc_symtree *retval;
3151 if (st == NULL || st->n.sym == NULL)
3154 c = strcmp (name, st->n.sym->name);
3155 if (c == 0 && st->n.sym->module
3156 && strcmp (module, st->n.sym->module) == 0
3157 && !check_unique_name (st->name))
3159 if ((!generic && !st->n.sym->attr.generic)
3160 || (generic && st->n.sym->attr.generic))
3164 retval = find_symbol (st->left, name, module, generic);
3167 retval = find_symbol (st->right, name, module, generic);
3173 /* Skip a list between balanced left and right parens. */
3183 switch (parse_atom ())
3194 gfc_free (atom_string);
3206 /* Load operator interfaces from the module. Interfaces are unusual
3207 in that they attach themselves to existing symbols. */
3210 load_operator_interfaces (void)
3213 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
3215 pointer_info *pi = NULL;
3220 while (peek_atom () != ATOM_RPAREN)
3224 mio_internal_string (name);
3225 mio_internal_string (module);
3227 n = number_use_names (name, true);
3230 for (i = 1; i <= n; i++)
3232 /* Decide if we need to load this one or not. */
3233 p = find_use_name_n (name, &i, true);
3237 while (parse_atom () != ATOM_RPAREN);
3243 uop = gfc_get_uop (p);
3244 pi = mio_interface_rest (&uop->operator);
3248 if (gfc_find_uop (p, NULL))
3250 uop = gfc_get_uop (p);
3251 uop->operator = gfc_get_interface ();
3252 uop->operator->where = gfc_current_locus;
3253 add_fixup (pi->integer, &uop->operator->sym);
3262 /* Load interfaces from the module. Interfaces are unusual in that
3263 they attach themselves to existing symbols. */
3266 load_generic_interfaces (void)
3269 char name[GFC_MAX_SYMBOL_LEN + 1], module[GFC_MAX_SYMBOL_LEN + 1];
3271 gfc_interface *generic = NULL;
3276 while (peek_atom () != ATOM_RPAREN)
3280 mio_internal_string (name);
3281 mio_internal_string (module);
3283 n = number_use_names (name, false);
3284 renamed = n ? 1 : 0;
3287 for (i = 1; i <= n; i++)
3290 /* Decide if we need to load this one or not. */
3291 p = find_use_name_n (name, &i, false);
3293 st = find_symbol (gfc_current_ns->sym_root,
3294 name, module_name, 1);
3296 if (!p || gfc_find_symbol (p, NULL, 0, &sym))
3298 /* Skip the specific names for these cases. */
3299 while (i == 1 && parse_atom () != ATOM_RPAREN);
3304 /* If the symbol exists already and is being USEd without being
3305 in an ONLY clause, do not load a new symtree(11.3.2). */
3306 if (!only_flag && st)
3311 /* Make symtree inaccessible by renaming if the symbol has
3312 been added by a USE statement without an ONLY(11.3.2). */
3314 && !st->n.sym->attr.use_only
3315 && !st->n.sym->attr.use_rename
3316 && strcmp (st->n.sym->module, module_name) == 0)
3317 st->name = gfc_get_string ("hidden.%s", name);
3321 if (strcmp (st->name, p) != 0)
3323 st = gfc_new_symtree (&gfc_current_ns->sym_root, p);
3329 /* Since we haven't found a valid generic interface, we had
3333 gfc_get_symbol (p, NULL, &sym);
3334 sym->name = gfc_get_string (name);
3335 sym->module = gfc_get_string (module_name);
3336 sym->attr.flavor = FL_PROCEDURE;
3337 sym->attr.generic = 1;
3338 sym->attr.use_assoc = 1;
3343 /* Unless sym is a generic interface, this reference
3346 st = gfc_find_symtree (gfc_current_ns->sym_root, p);
3350 if (st && !sym->attr.generic
3352 && strcmp(module, sym->module))
3356 sym->attr.use_only = only_flag;
3357 sym->attr.use_rename = renamed;
3361 mio_interface_rest (&sym->generic);
3362 generic = sym->generic;
3364 else if (!sym->generic)
3366 sym->generic = generic;
3367 sym->attr.generic_copy = 1;
3376 /* Load common blocks. */
3381 char name[GFC_MAX_SYMBOL_LEN + 1];
3386 while (peek_atom () != ATOM_RPAREN)
3390 mio_internal_string (name);
3392 p = gfc_get_common (name, 1);
3394 mio_symbol_ref (&p->head);
3395 mio_integer (&flags);
3399 p->threadprivate = 1;
3402 /* Get whether this was a bind(c) common or not. */
3403 mio_integer (&p->is_bind_c);
3404 /* Get the binding label. */
3405 mio_internal_string (p->binding_label);
3414 /* Load equivalences. The flag in_load_equiv informs mio_expr_ref of this
3415 so that unused variables are not loaded and so that the expression can
3421 gfc_equiv *head, *tail, *end, *eq;
3425 in_load_equiv = true;
3427 end = gfc_current_ns->equiv;
3428 while (end != NULL && end->next != NULL)
3431 while (peek_atom () != ATOM_RPAREN) {
3435 while(peek_atom () != ATOM_RPAREN)
3438 head = tail = gfc_get_equiv ();
3441 tail->eq = gfc_get_equiv ();
3445 mio_pool_string (&tail->module);
3446 mio_expr (&tail->expr);
3449 /* Unused equivalence members have a unique name. */
3451 for (eq = head; eq; eq = eq->eq)
3453 if (!check_unique_name (eq->expr->symtree->name))
3462 for (eq = head; eq; eq = head)
3465 gfc_free_expr (eq->expr);
3471 gfc_current_ns->equiv = head;
3482 in_load_equiv = false;
3486 /* Recursive function to traverse the pointer_info tree and load a
3487 needed symbol. We return nonzero if we load a symbol and stop the
3488 traversal, because the act of loading can alter the tree. */
3491 load_needed (pointer_info *p)
3502 rv |= load_needed (p->left);
3503 rv |= load_needed (p->right);
3505 if (p->type != P_SYMBOL || p->u.rsym.state != NEEDED)
3508 p->u.rsym.state = USED;
3510 set_module_locus (&p->u.rsym.where);
3512 sym = p->u.rsym.sym;
3515 q = get_integer (p->u.rsym.ns);
3517 ns = (gfc_namespace *) q->u.pointer;
3520 /* Create an interface namespace if necessary. These are
3521 the namespaces that hold the formal parameters of module
3524 ns = gfc_get_namespace (NULL, 0);
3525 associate_integer_pointer (q, ns);
3528 /* Use the module sym as 'proc_name' so that gfc_get_symbol_decl
3529 doesn't go pear-shaped if the symbol is used. */
3531 gfc_find_symbol (p->u.rsym.module, gfc_current_ns,
3534 sym = gfc_new_symbol (p->u.rsym.true_name, ns);
3535 sym->module = gfc_get_string (p->u.rsym.module);
3536 strcpy (sym->binding_label, p->u.rsym.binding_label);
3538 associate_integer_pointer (p, sym);
3542 sym->attr.use_assoc = 1;
3544 sym->attr.use_only = 1;
3545 if (p->u.rsym.renamed)
3546 sym->attr.use_rename = 1;
3552 /* Recursive function for cleaning up things after a module has been read. */
3555 read_cleanup (pointer_info *p)
3563 read_cleanup (p->left);
3564 read_cleanup (p->right);
3566 if (p->type == P_SYMBOL && p->u.rsym.state == USED && !p->u.rsym.referenced)
3568 /* Add hidden symbols to the symtree. */
3569 q = get_integer (p->u.rsym.ns);
3570 st = gfc_get_unique_symtree ((gfc_namespace *) q->u.pointer);
3572 st->n.sym = p->u.rsym.sym;
3575 /* Fixup any symtree references. */
3576 p->u.rsym.symtree = st;
3577 resolve_fixups (p->u.rsym.stfixup, st);
3578 p->u.rsym.stfixup = NULL;
3581 /* Free unused symbols. */
3582 if (p->type == P_SYMBOL && p->u.rsym.state == UNUSED)
3583 gfc_free_symbol (p->u.rsym.sym);
3587 /* Read a module file. */
3592 module_locus operator_interfaces, user_operators;
3594 char name[GFC_MAX_SYMBOL_LEN + 1];
3596 int ambiguous, j, nuse, symbol;
3597 pointer_info *info, *q;
3602 get_module_locus (&operator_interfaces); /* Skip these for now. */
3605 get_module_locus (&user_operators);
3609 /* Skip commons and equivalences for now. */
3615 /* Create the fixup nodes for all the symbols. */
3617 while (peek_atom () != ATOM_RPAREN)
3619 require_atom (ATOM_INTEGER);
3620 info = get_integer (atom_int);
3622 info->type = P_SYMBOL;
3623 info->u.rsym.state = UNUSED;
3625 mio_internal_string (info->u.rsym.true_name);
3626 mio_internal_string (info->u.rsym.module);
3627 mio_internal_string (info->u.rsym.binding_label);
3630 require_atom (ATOM_INTEGER);
3631 info->u.rsym.ns = atom_int;
3633 get_module_locus (&info->u.rsym.where);
3636 /* See if the symbol has already been loaded by a previous module.
3637 If so, we reference the existing symbol and prevent it from
3638 being loaded again. This should not happen if the symbol being
3639 read is an index for an assumed shape dummy array (ns != 1). */
3641 sym = find_true_name (info->u.rsym.true_name, info->u.rsym.module);
3644 || (sym->attr.flavor == FL_VARIABLE && info->u.rsym.ns !=1))
3647 info->u.rsym.state = USED;
3648 info->u.rsym.sym = sym;
3650 /* Some symbols do not have a namespace (eg. formal arguments),
3651 so the automatic "unique symtree" mechanism must be suppressed
3652 by marking them as referenced. */
3653 q = get_integer (info->u.rsym.ns);
3654 if (q->u.pointer == NULL)
3656 info->u.rsym.referenced = 1;
3660 /* If possible recycle the symtree that references the symbol.
3661 If a symtree is not found and the module does not import one,
3662 a unique-name symtree is found by read_cleanup. */
3663 st = find_symtree_for_symbol (gfc_current_ns->sym_root, sym);
3666 info->u.rsym.symtree = st;
3667 info->u.rsym.referenced = 1;
3673 /* Parse the symtree lists. This lets us mark which symbols need to
3674 be loaded. Renaming is also done at this point by replacing the
3679 while (peek_atom () != ATOM_RPAREN)
3681 mio_internal_string (name);
3682 mio_integer (&ambiguous);
3683 mio_integer (&symbol);
3685 info = get_integer (symbol);
3687 /* See how many use names there are. If none, go through the start
3688 of the loop at least once. */
3689 nuse = number_use_names (name, false);
3690 info->u.rsym.renamed = nuse ? 1 : 0;
3695 for (j = 1; j <= nuse; j++)
3697 /* Get the jth local name for this symbol. */
3698 p = find_use_name_n (name, &j, false);
3700 if (p == NULL && strcmp (name, module_name) == 0)
3703 /* Skip symtree nodes not in an ONLY clause, unless there
3704 is an existing symtree loaded from another USE statement. */
3707 st = gfc_find_symtree (gfc_current_ns->sym_root, name);
3709 info->u.rsym.symtree = st;
3713 /* If a symbol of the same name and module exists already,
3714 this symbol, which is not in an ONLY clause, must not be
3715 added to the namespace(11.3.2). Note that find_symbol
3716 only returns the first occurrence that it finds. */
3717 if (!only_flag && !info->u.rsym.renamed
3718 && strcmp (name, module_name) != 0
3719 && find_symbol (gfc_current_ns->sym_root, name,
3723 st = gfc_find_symtree (gfc_current_ns->sym_root, p);
3727 /* Check for ambiguous symbols. */
3728 if (st->n.sym != info->u.rsym.sym)
3730 info->u.rsym.symtree = st;
3734 st = gfc_find_symtree (gfc_current_ns->sym_root, name);
3736 /* Make symtree inaccessible by renaming if the symbol has
3737 been added by a USE statement without an ONLY(11.3.2). */
3738 if (st && (only_flag || info->u.rsym.renamed)
3739 && !st->n.sym->attr.use_only
3740 && !st->n.sym->attr.use_rename
3741 && st->n.sym->module
3742 && strcmp (st->n.sym->module, module_name) == 0)
3743 st->name = gfc_get_string ("hidden.%s", name);
3745 /* Create a symtree node in the current namespace for this
3747 st = check_unique_name (p)
3748 ? gfc_get_unique_symtree (gfc_current_ns)
3749 : gfc_new_symtree (&gfc_current_ns->sym_root, p);
3751 st->ambiguous = ambiguous;
3753 sym = info->u.rsym.sym;
3755 /* Create a symbol node if it doesn't already exist. */
3758 info->u.rsym.sym = gfc_new_symbol (info->u.rsym.true_name,
3760 sym = info->u.rsym.sym;
3761 sym->module = gfc_get_string (info->u.rsym.module);
3763 /* TODO: hmm, can we test this? Do we know it will be
3764 initialized to zeros? */
3765 if (info->u.rsym.binding_label[0] != '\0')
3766 strcpy (sym->binding_label, info->u.rsym.binding_label);
3772 /* Store the symtree pointing to this symbol. */
3773 info->u.rsym.symtree = st;
3775 if (info->u.rsym.state == UNUSED)
3776 info->u.rsym.state = NEEDED;
3777 info->u.rsym.referenced = 1;
3784 /* Load intrinsic operator interfaces. */
3785 set_module_locus (&operator_interfaces);
3788 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
3790 if (i == INTRINSIC_USER)
3795 u = find_use_operator (i);
3806 mio_interface (&gfc_current_ns->operator[i]);
3811 /* Load generic and user operator interfaces. These must follow the
3812 loading of symtree because otherwise symbols can be marked as
3815 set_module_locus (&user_operators);
3817 load_operator_interfaces ();
3818 load_generic_interfaces ();
3823 /* At this point, we read those symbols that are needed but haven't
3824 been loaded yet. If one symbol requires another, the other gets
3825 marked as NEEDED if its previous state was UNUSED. */
3827 while (load_needed (pi_root));
3829 /* Make sure all elements of the rename-list were found in the module. */
3831 for (u = gfc_rename_list; u; u = u->next)
3836 if (u->operator == INTRINSIC_NONE)
3838 gfc_error ("Symbol '%s' referenced at %L not found in module '%s'",
3839 u->use_name, &u->where, module_name);
3843 if (u->operator == INTRINSIC_USER)
3845 gfc_error ("User operator '%s' referenced at %L not found "
3846 "in module '%s'", u->use_name, &u->where, module_name);
3850 gfc_error ("Intrinsic operator '%s' referenced at %L not found "
3851 "in module '%s'", gfc_op2string (u->operator), &u->where,
3855 gfc_check_interfaces (gfc_current_ns);
3857 /* Clean up symbol nodes that were never loaded, create references
3858 to hidden symbols. */
3860 read_cleanup (pi_root);
3864 /* Given an access type that is specific to an entity and the default
3865 access, return nonzero if the entity is publicly accessible. If the
3866 element is declared as PUBLIC, then it is public; if declared
3867 PRIVATE, then private, and otherwise it is public unless the default
3868 access in this context has been declared PRIVATE. */
3871 gfc_check_access (gfc_access specific_access, gfc_access default_access)
3873 if (specific_access == ACCESS_PUBLIC)
3875 if (specific_access == ACCESS_PRIVATE)
3878 if (gfc_option.flag_module_private)
3879 return default_access == ACCESS_PUBLIC;
3881 return default_access != ACCESS_PRIVATE;
3885 /* A structure to remember which commons we've already written. */
3887 struct written_common
3889 BBT_HEADER(written_common);
3890 const char *name, *label;
3893 static struct written_common *written_commons = NULL;
3895 /* Comparison function used for balancing the binary tree. */
3898 compare_written_commons (void *a1, void *b1)
3900 const char *aname = ((struct written_common *) a1)->name;
3901 const char *alabel = ((struct written_common *) a1)->label;
3902 const char *bname = ((struct written_common *) b1)->name;
3903 const char *blabel = ((struct written_common *) b1)->label;
3904 int c = strcmp (aname, bname);
3906 return (c != 0 ? c : strcmp (alabel, blabel));
3909 /* Free a list of written commons. */
3912 free_written_common (struct written_common *w)
3918 free_written_common (w->left);
3920 free_written_common (w->right);
3925 /* Write a common block to the module -- recursive helper function. */
3928 write_common_0 (gfc_symtree *st)
3934 struct written_common *w;
3935 bool write_me = true;
3940 write_common_0 (st->left);
3942 /* We will write out the binding label, or the name if no label given. */
3943 name = st->n.common->name;
3945 label = p->is_bind_c ? p->binding_label : p->name;
3947 /* Check if we've already output this common. */
3948 w = written_commons;
3951 int c = strcmp (name, w->name);
3952 c = (c != 0 ? c : strcmp (label, w->label));
3956 w = (c < 0) ? w->left : w->right;
3961 /* Write the common to the module. */
3963 mio_pool_string (&name);
3965 mio_symbol_ref (&p->head);
3966 flags = p->saved ? 1 : 0;
3967 if (p->threadprivate)
3969 mio_integer (&flags);
3971 /* Write out whether the common block is bind(c) or not. */
3972 mio_integer (&(p->is_bind_c));
3974 mio_pool_string (&label);
3977 /* Record that we have written this common. */
3978 w = gfc_getmem (sizeof (struct written_common));
3981 gfc_insert_bbt (&written_commons, w, compare_written_commons);
3984 write_common_0 (st->right);
3988 /* Write a common, by initializing the list of written commons, calling
3989 the recursive function write_common_0() and cleaning up afterwards. */
3992 write_common (gfc_symtree *st)
3994 written_commons = NULL;
3995 write_common_0 (st);
3996 free_written_common (written_commons);
3997 written_commons = NULL;
4001 /* Write the blank common block to the module. */
4004 write_blank_common (void)
4006 const char * name = BLANK_COMMON_NAME;
4008 /* TODO: Blank commons are not bind(c). The F2003 standard probably says
4009 this, but it hasn't been checked. Just making it so for now. */
4012 if (gfc_current_ns->blank_common.head == NULL)
4017 mio_pool_string (&name);
4019 mio_symbol_ref (&gfc_current_ns->blank_common.head);
4020 saved = gfc_current_ns->blank_common.saved;
4021 mio_integer (&saved);
4023 /* Write out whether the common block is bind(c) or not. */
4024 mio_integer (&is_bind_c);
4026 /* Write out the binding label, which is BLANK_COMMON_NAME, though
4027 it doesn't matter because the label isn't used. */
4028 mio_pool_string (&name);
4034 /* Write equivalences to the module. */
4043 for (eq = gfc_current_ns->equiv; eq; eq = eq->next)
4047 for (e = eq; e; e = e->eq)
4049 if (e->module == NULL)
4050 e->module = gfc_get_string ("%s.eq.%d", module_name, num);
4051 mio_allocated_string (e->module);
4052 mio_expr (&e->expr);
4061 /* Write a symbol to the module. */
4064 write_symbol (int n, gfc_symbol *sym)
4068 if (sym->attr.flavor == FL_UNKNOWN || sym->attr.flavor == FL_LABEL)
4069 gfc_internal_error ("write_symbol(): bad module symbol '%s'", sym->name);
4072 mio_pool_string (&sym->name);
4074 mio_pool_string (&sym->module);
4075 if (sym->attr.is_bind_c || sym->attr.is_iso_c)
4077 label = sym->binding_label;
4078 mio_pool_string (&label);
4081 mio_pool_string (&sym->name);
4083 mio_pointer_ref (&sym->ns);
4090 /* Recursive traversal function to write the initial set of symbols to
4091 the module. We check to see if the symbol should be written
4092 according to the access specification. */
4095 write_symbol0 (gfc_symtree *st)
4099 bool dont_write = false;
4104 write_symbol0 (st->left);
4107 if (sym->module == NULL)
4108 sym->module = gfc_get_string (module_name);
4110 if (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
4111 && !sym->attr.subroutine && !sym->attr.function)
4114 if (!gfc_check_access (sym->attr.access, sym->ns->default_access))
4119 p = get_pointer (sym);
4120 if (p->type == P_UNKNOWN)
4123 if (p->u.wsym.state != WRITTEN)
4125 write_symbol (p->integer, sym);
4126 p->u.wsym.state = WRITTEN;
4130 write_symbol0 (st->right);
4134 /* Recursive traversal function to write the secondary set of symbols
4135 to the module file. These are symbols that were not public yet are
4136 needed by the public symbols or another dependent symbol. The act
4137 of writing a symbol can modify the pointer_info tree, so we cease
4138 traversal if we find a symbol to write. We return nonzero if a
4139 symbol was written and pass that information upwards. */
4142 write_symbol1 (pointer_info *p)
4149 result = write_symbol1 (p->left);
4151 if (!(p->type != P_SYMBOL || p->u.wsym.state != NEEDS_WRITE))
4153 p->u.wsym.state = WRITTEN;
4154 write_symbol (p->integer, p->u.wsym.sym);
4158 result |= write_symbol1 (p->right);
4163 /* Write operator interfaces associated with a symbol. */
4166 write_operator (gfc_user_op *uop)
4168 static char nullstring[] = "";
4169 const char *p = nullstring;
4171 if (uop->operator == NULL
4172 || !gfc_check_access (uop->access, uop->ns->default_access))
4175 mio_symbol_interface (&uop->name, &p, &uop->operator);
4179 /* Write generic interfaces from the namespace sym_root. */
4182 write_generic (gfc_symtree *st)
4189 write_generic (st->left);
4190 write_generic (st->right);
4193 if (!sym || check_unique_name (st->name))
4196 if (sym->generic == NULL
4197 || !gfc_check_access (sym->attr.access, sym->ns->default_access))
4200 if (sym->module == NULL)
4201 sym->module = gfc_get_string (module_name);
4203 mio_symbol_interface (&st->name, &sym->module, &sym->generic);
4208 write_symtree (gfc_symtree *st)
4214 if (!gfc_check_access (sym->attr.access, sym->ns->default_access)
4215 || (sym->attr.flavor == FL_PROCEDURE && sym->attr.generic
4216 && !sym->attr.subroutine && !sym->attr.function))
4219 if (check_unique_name (st->name))
4222 p = find_pointer (sym);
4224 gfc_internal_error ("write_symtree(): Symbol not written");
4226 mio_pool_string (&st->name);
4227 mio_integer (&st->ambiguous);
4228 mio_integer (&p->integer);
4237 /* Write the operator interfaces. */
4240 for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
4242 if (i == INTRINSIC_USER)
4245 mio_interface (gfc_check_access (gfc_current_ns->operator_access[i],
4246 gfc_current_ns->default_access)
4247 ? &gfc_current_ns->operator[i] : NULL);
4255 gfc_traverse_user_op (gfc_current_ns, write_operator);
4261 write_generic (gfc_current_ns->sym_root);
4267 write_blank_common ();
4268 write_common (gfc_current_ns->common_root);
4279 /* Write symbol information. First we traverse all symbols in the
4280 primary namespace, writing those that need to be written.
4281 Sometimes writing one symbol will cause another to need to be
4282 written. A list of these symbols ends up on the write stack, and
4283 we end by popping the bottom of the stack and writing the symbol
4284 until the stack is empty. */
4288 write_symbol0 (gfc_current_ns->sym_root);
4289 while (write_symbol1 (pi_root))
4298 gfc_traverse_symtree (gfc_current_ns->sym_root, write_symtree);
4303 /* Read a MD5 sum from the header of a module file. If the file cannot
4304 be opened, or we have any other error, we return -1. */
4307 read_md5_from_module_file (const char * filename, unsigned char md5[16])
4313 /* Open the file. */
4314 if ((file = fopen (filename, "r")) == NULL)
4317 /* Read two lines. */
4318 if (fgets (buf, sizeof (buf) - 1, file) == NULL
4319 || fgets (buf, sizeof (buf) - 1, file) == NULL)
4325 /* Close the file. */
4328 /* If the header is not what we expect, or is too short, bail out. */
4329 if (strncmp (buf, "MD5:", 4) != 0 || strlen (buf) < 4 + 16)
4332 /* Now, we have a real MD5, read it into the array. */
4333 for (n = 0; n < 16; n++)
4337 if (sscanf (&(buf[4+2*n]), "%02x", &x) != 1)
4347 /* Given module, dump it to disk. If there was an error while
4348 processing the module, dump_flag will be set to zero and we delete
4349 the module file, even if it was already there. */
4352 gfc_dump_module (const char *name, int dump_flag)
4355 char *filename, *filename_tmp, *p;
4358 unsigned char md5_new[16], md5_old[16];
4360 n = strlen (name) + strlen (MODULE_EXTENSION) + 1;
4361 if (gfc_option.module_dir != NULL)
4363 n += strlen (gfc_option.module_dir);
4364 filename = (char *) alloca (n);
4365 strcpy (filename, gfc_option.module_dir);
4366 strcat (filename, name);
4370 filename = (char *) alloca (n);
4371 strcpy (filename, name);
4373 strcat (filename, MODULE_EXTENSION);
4375 /* Name of the temporary file used to write the module. */
4376 filename_tmp = (char *) alloca (n + 1);
4377 strcpy (filename_tmp, filename);
4378 strcat (filename_tmp, "0");
4380 /* There was an error while processing the module. We delete the
4381 module file, even if it was already there. */
4388 /* Write the module to the temporary file. */
4389 module_fp = fopen (filename_tmp, "w");
4390 if (module_fp == NULL)
4391 gfc_fatal_error ("Can't open module file '%s' for writing at %C: %s",
4392 filename_tmp, strerror (errno));
4394 /* Write the header, including space reserved for the MD5 sum. */
4398 *strchr (p, '\n') = '\0';
4400 fprintf (module_fp, "GFORTRAN module created from %s on %s\nMD5:",
4401 gfc_source_file, p);
4402 fgetpos (module_fp, &md5_pos);
4403 fputs ("00000000000000000000000000000000 -- "
4404 "If you edit this, you'll get what you deserve.\n\n", module_fp);
4406 /* Initialize the MD5 context that will be used for output. */
4407 md5_init_ctx (&ctx);
4409 /* Write the module itself. */
4411 strcpy (module_name, name);
4417 free_pi_tree (pi_root);
4422 /* Write the MD5 sum to the header of the module file. */
4423 md5_finish_ctx (&ctx, md5_new);
4424 fsetpos (module_fp, &md5_pos);
4425 for (n = 0; n < 16; n++)
4426 fprintf (module_fp, "%02x", md5_new[n]);
4428 if (fclose (module_fp))
4429 gfc_fatal_error ("Error writing module file '%s' for writing: %s",
4430 filename_tmp, strerror (errno));
4432 /* Read the MD5 from the header of the old module file and compare. */
4433 if (read_md5_from_module_file (filename, md5_old) != 0
4434 || memcmp (md5_old, md5_new, sizeof (md5_old)) != 0)
4436 /* Module file have changed, replace the old one. */
4438 rename (filename_tmp, filename);
4441 unlink (filename_tmp);
4446 sort_iso_c_rename_list (void)
4448 gfc_use_rename *tmp_list = NULL;
4449 gfc_use_rename *curr;
4450 gfc_use_rename *kinds_used[ISOCBINDING_NUMBER] = {NULL};
4454 for (curr = gfc_rename_list; curr; curr = curr->next)
4456 c_kind = get_c_kind (curr->use_name, c_interop_kinds_table);
4457 if (c_kind == ISOCBINDING_INVALID || c_kind == ISOCBINDING_LAST)
4459 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4460 "intrinsic module ISO_C_BINDING.", curr->use_name,
4464 /* Put it in the list. */
4465 kinds_used[c_kind] = curr;
4468 /* Make a new (sorted) rename list. */
4470 while (i < ISOCBINDING_NUMBER && kinds_used[i] == NULL)
4473 if (i < ISOCBINDING_NUMBER)
4475 tmp_list = kinds_used[i];
4479 for (; i < ISOCBINDING_NUMBER; i++)
4480 if (kinds_used[i] != NULL)
4482 curr->next = kinds_used[i];
4488 gfc_rename_list = tmp_list;
4492 /* Import the intrinsic ISO_C_BINDING module, generating symbols in
4493 the current namespace for all named constants, pointer types, and
4494 procedures in the module unless the only clause was used or a rename
4495 list was provided. */
4498 import_iso_c_binding_module (void)
4500 gfc_symbol *mod_sym = NULL;
4501 gfc_symtree *mod_symtree = NULL;
4502 const char *iso_c_module_name = "__iso_c_binding";
4507 /* Look only in the current namespace. */
4508 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, iso_c_module_name);
4510 if (mod_symtree == NULL)
4512 /* symtree doesn't already exist in current namespace. */
4513 gfc_get_sym_tree (iso_c_module_name, gfc_current_ns, &mod_symtree);
4515 if (mod_symtree != NULL)
4516 mod_sym = mod_symtree->n.sym;
4518 gfc_internal_error ("import_iso_c_binding_module(): Unable to "
4519 "create symbol for %s", iso_c_module_name);
4521 mod_sym->attr.flavor = FL_MODULE;
4522 mod_sym->attr.intrinsic = 1;
4523 mod_sym->module = gfc_get_string (iso_c_module_name);
4524 mod_sym->from_intmod = INTMOD_ISO_C_BINDING;
4527 /* Generate the symbols for the named constants representing
4528 the kinds for intrinsic data types. */
4531 /* Sort the rename list because there are dependencies between types
4532 and procedures (e.g., c_loc needs c_ptr). */
4533 sort_iso_c_rename_list ();
4535 for (u = gfc_rename_list; u; u = u->next)
4537 i = get_c_kind (u->use_name, c_interop_kinds_table);
4539 if (i == ISOCBINDING_INVALID || i == ISOCBINDING_LAST)
4541 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4542 "intrinsic module ISO_C_BINDING.", u->use_name,
4547 generate_isocbinding_symbol (iso_c_module_name, i, u->local_name);
4552 for (i = 0; i < ISOCBINDING_NUMBER; i++)
4555 for (u = gfc_rename_list; u; u = u->next)
4557 if (strcmp (c_interop_kinds_table[i].name, u->use_name) == 0)
4559 local_name = u->local_name;
4564 generate_isocbinding_symbol (iso_c_module_name, i, local_name);
4567 for (u = gfc_rename_list; u; u = u->next)
4572 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4573 "module ISO_C_BINDING", u->use_name, &u->where);
4579 /* Add an integer named constant from a given module. */
4582 create_int_parameter (const char *name, int value, const char *modname,
4583 intmod_id module, int id)
4585 gfc_symtree *tmp_symtree;
4588 tmp_symtree = gfc_find_symtree (gfc_current_ns->sym_root, name);
4589 if (tmp_symtree != NULL)
4591 if (strcmp (modname, tmp_symtree->n.sym->module) == 0)
4594 gfc_error ("Symbol '%s' already declared", name);
4597 gfc_get_sym_tree (name, gfc_current_ns, &tmp_symtree);
4598 sym = tmp_symtree->n.sym;
4600 sym->module = gfc_get_string (modname);
4601 sym->attr.flavor = FL_PARAMETER;
4602 sym->ts.type = BT_INTEGER;
4603 sym->ts.kind = gfc_default_integer_kind;
4604 sym->value = gfc_int_expr (value);
4605 sym->attr.use_assoc = 1;
4606 sym->from_intmod = module;
4607 sym->intmod_sym_id = id;
4611 /* USE the ISO_FORTRAN_ENV intrinsic module. */
4614 use_iso_fortran_env_module (void)
4616 static char mod[] = "iso_fortran_env";
4617 const char *local_name;
4619 gfc_symbol *mod_sym;
4620 gfc_symtree *mod_symtree;
4623 intmod_sym symbol[] = {
4624 #define NAMED_INTCST(a,b,c) { a, b, 0 },
4625 #include "iso-fortran-env.def"
4627 { ISOFORTRANENV_INVALID, NULL, -1234 } };
4630 #define NAMED_INTCST(a,b,c) symbol[i++].value = c;
4631 #include "iso-fortran-env.def"
4634 /* Generate the symbol for the module itself. */
4635 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, mod);
4636 if (mod_symtree == NULL)
4638 gfc_get_sym_tree (mod, gfc_current_ns, &mod_symtree);
4639 gcc_assert (mod_symtree);
4640 mod_sym = mod_symtree->n.sym;
4642 mod_sym->attr.flavor = FL_MODULE;
4643 mod_sym->attr.intrinsic = 1;
4644 mod_sym->module = gfc_get_string (mod);
4645 mod_sym->from_intmod = INTMOD_ISO_FORTRAN_ENV;
4648 if (!mod_symtree->n.sym->attr.intrinsic)
4649 gfc_error ("Use of intrinsic module '%s' at %C conflicts with "
4650 "non-intrinsic module name used previously", mod);
4652 /* Generate the symbols for the module integer named constants. */
4654 for (u = gfc_rename_list; u; u = u->next)
4656 for (i = 0; symbol[i].name; i++)
4657 if (strcmp (symbol[i].name, u->use_name) == 0)
4660 if (symbol[i].name == NULL)
4662 gfc_error ("Symbol '%s' referenced at %L does not exist in "
4663 "intrinsic module ISO_FORTRAN_ENV", u->use_name,
4668 if ((gfc_option.flag_default_integer || gfc_option.flag_default_real)
4669 && symbol[i].id == ISOFORTRANENV_NUMERIC_STORAGE_SIZE)
4670 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4671 "from intrinsic module ISO_FORTRAN_ENV at %L is "
4672 "incompatible with option %s", &u->where,
4673 gfc_option.flag_default_integer
4674 ? "-fdefault-integer-8" : "-fdefault-real-8");
4676 create_int_parameter (u->local_name[0] ? u->local_name
4678 symbol[i].value, mod, INTMOD_ISO_FORTRAN_ENV,
4683 for (i = 0; symbol[i].name; i++)
4686 for (u = gfc_rename_list; u; u = u->next)
4688 if (strcmp (symbol[i].name, u->use_name) == 0)
4690 local_name = u->local_name;
4696 if ((gfc_option.flag_default_integer || gfc_option.flag_default_real)
4697 && symbol[i].id == ISOFORTRANENV_NUMERIC_STORAGE_SIZE)
4698 gfc_warning_now ("Use of the NUMERIC_STORAGE_SIZE named constant "
4699 "from intrinsic module ISO_FORTRAN_ENV at %C is "
4700 "incompatible with option %s",
4701 gfc_option.flag_default_integer
4702 ? "-fdefault-integer-8" : "-fdefault-real-8");
4704 create_int_parameter (local_name ? local_name : symbol[i].name,
4705 symbol[i].value, mod, INTMOD_ISO_FORTRAN_ENV,
4709 for (u = gfc_rename_list; u; u = u->next)
4714 gfc_error ("Symbol '%s' referenced at %L not found in intrinsic "
4715 "module ISO_FORTRAN_ENV", u->use_name, &u->where);
4721 /* Process a USE directive. */
4724 gfc_use_module (void)
4729 gfc_symtree *mod_symtree;
4731 filename = (char *) alloca (strlen (module_name) + strlen (MODULE_EXTENSION)
4733 strcpy (filename, module_name);
4734 strcat (filename, MODULE_EXTENSION);
4736 /* First, try to find an non-intrinsic module, unless the USE statement
4737 specified that the module is intrinsic. */
4740 module_fp = gfc_open_included_file (filename, true, true);
4742 /* Then, see if it's an intrinsic one, unless the USE statement
4743 specified that the module is non-intrinsic. */
4744 if (module_fp == NULL && !specified_nonint)
4746 if (strcmp (module_name, "iso_fortran_env") == 0
4747 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: ISO_FORTRAN_ENV "
4748 "intrinsic module at %C") != FAILURE)
4750 use_iso_fortran_env_module ();
4754 if (strcmp (module_name, "iso_c_binding") == 0
4755 && gfc_notify_std (GFC_STD_F2003, "Fortran 2003: "
4756 "ISO_C_BINDING module at %C") != FAILURE)
4758 import_iso_c_binding_module();
4762 module_fp = gfc_open_intrinsic_module (filename);
4764 if (module_fp == NULL && specified_int)
4765 gfc_fatal_error ("Can't find an intrinsic module named '%s' at %C",
4769 if (module_fp == NULL)
4770 gfc_fatal_error ("Can't open module file '%s' for reading at %C: %s",
4771 filename, strerror (errno));
4773 /* Check that we haven't already USEd an intrinsic module with the
4776 mod_symtree = gfc_find_symtree (gfc_current_ns->sym_root, module_name);
4777 if (mod_symtree && mod_symtree->n.sym->attr.intrinsic)
4778 gfc_error ("Use of non-intrinsic module '%s' at %C conflicts with "
4779 "intrinsic module name used previously", module_name);
4786 /* Skip the first two lines of the module, after checking that this is
4787 a gfortran module file. */
4793 bad_module ("Unexpected end of module");
4796 if ((start == 1 && strcmp (atom_name, "GFORTRAN") != 0)
4797 || (start == 2 && strcmp (atom_name, " module") != 0))
4798 gfc_fatal_error ("File '%s' opened at %C is not a GFORTRAN module "
4805 /* Make sure we're not reading the same module that we may be building. */
4806 for (p = gfc_state_stack; p; p = p->previous)
4807 if (p->state == COMP_MODULE && strcmp (p->sym->name, module_name) == 0)
4808 gfc_fatal_error ("Can't USE the same module we're building!");
4811 init_true_name_tree ();
4815 free_true_name (true_name_root);
4816 true_name_root = NULL;
4818 free_pi_tree (pi_root);
4826 gfc_module_init_2 (void)
4828 last_atom = ATOM_LPAREN;
4833 gfc_module_done_2 (void)