Check in tree-dce enh to trunk
[official-gcc.git] / gcc / fortran / f95-lang.c
blob58e31279156b83cf0edab9c78afcc5fa3cdbb01b
1 /* gfortran backend interface
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
3 Free Software Foundation, Inc.
4 Contributed by Paul Brook.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* f95-lang.c-- GCC backend interface stuff */
24 /* declare required prototypes: */
26 #include "config.h"
27 #include "system.h"
28 #include "ansidecl.h"
29 #include "system.h"
30 #include "coretypes.h"
31 #include "tree.h"
32 #include "tree-gimple.h"
33 #include "flags.h"
34 #include "langhooks.h"
35 #include "langhooks-def.h"
36 #include "timevar.h"
37 #include "tm.h"
38 #include "function.h"
39 #include "ggc.h"
40 #include "toplev.h"
41 #include "target.h"
42 #include "debug.h"
43 #include "diagnostic.h"
44 #include "tree-dump.h"
45 #include "cgraph.h"
47 #include "gfortran.h"
48 #include "trans.h"
49 #include "trans-types.h"
50 #include "trans-const.h"
52 /* Language-dependent contents of an identifier. */
54 struct lang_identifier
55 GTY(())
57 struct tree_identifier common;
60 /* The resulting tree type. */
62 union lang_tree_node
63 GTY((desc ("TREE_CODE (&%h.generic) == IDENTIFIER_NODE"),
64 chain_next ("(union lang_tree_node *)GENERIC_NEXT (&%h.generic)")))
67 union tree_node GTY((tag ("0"),
68 desc ("tree_node_structure (&%h)"))) generic;
69 struct lang_identifier GTY((tag ("1"))) identifier;
72 /* Save and restore the variables in this file and elsewhere
73 that keep track of the progress of compilation of the current function.
74 Used for nested functions. */
76 struct language_function
77 GTY(())
79 /* struct gfc_language_function base; */
80 struct binding_level *binding_level;
83 /* We don't have a lex/yacc lexer/parser, but toplev expects these to
84 exist anyway. */
85 void yyerror (const char *str);
86 int yylex (void);
88 static void gfc_init_decl_processing (void);
89 static void gfc_init_builtin_functions (void);
91 /* Each front end provides its own. */
92 static bool gfc_init (void);
93 static void gfc_finish (void);
94 static void gfc_print_identifier (FILE *, tree, int);
95 static bool gfc_mark_addressable (tree);
96 void do_function_end (void);
97 int global_bindings_p (void);
98 static void clear_binding_stack (void);
99 static void gfc_be_parse_file (int);
100 static alias_set_type gfc_get_alias_set (tree);
102 #undef LANG_HOOKS_NAME
103 #undef LANG_HOOKS_INIT
104 #undef LANG_HOOKS_FINISH
105 #undef LANG_HOOKS_INIT_OPTIONS
106 #undef LANG_HOOKS_HANDLE_OPTION
107 #undef LANG_HOOKS_POST_OPTIONS
108 #undef LANG_HOOKS_PRINT_IDENTIFIER
109 #undef LANG_HOOKS_PARSE_FILE
110 #undef LANG_HOOKS_MARK_ADDRESSABLE
111 #undef LANG_HOOKS_TYPE_FOR_MODE
112 #undef LANG_HOOKS_TYPE_FOR_SIZE
113 #undef LANG_HOOKS_GET_ALIAS_SET
114 #undef LANG_HOOKS_OMP_PRIVATIZE_BY_REFERENCE
115 #undef LANG_HOOKS_OMP_PREDETERMINED_SHARING
116 #undef LANG_HOOKS_OMP_CLAUSE_DEFAULT_CTOR
117 #undef LANG_HOOKS_OMP_DISREGARD_VALUE_EXPR
118 #undef LANG_HOOKS_OMP_PRIVATE_DEBUG_CLAUSE
119 #undef LANG_HOOKS_OMP_FIRSTPRIVATIZE_TYPE_SIZES
120 #undef LANG_HOOKS_BUILTIN_FUNCTION
121 #undef LANG_HOOKS_GET_ARRAY_DESCR_INFO
123 /* Define lang hooks. */
124 #define LANG_HOOKS_NAME "GNU Fortran"
125 #define LANG_HOOKS_INIT gfc_init
126 #define LANG_HOOKS_FINISH gfc_finish
127 #define LANG_HOOKS_INIT_OPTIONS gfc_init_options
128 #define LANG_HOOKS_HANDLE_OPTION gfc_handle_option
129 #define LANG_HOOKS_POST_OPTIONS gfc_post_options
130 #define LANG_HOOKS_PRINT_IDENTIFIER gfc_print_identifier
131 #define LANG_HOOKS_PARSE_FILE gfc_be_parse_file
132 #define LANG_HOOKS_MARK_ADDRESSABLE gfc_mark_addressable
133 #define LANG_HOOKS_TYPE_FOR_MODE gfc_type_for_mode
134 #define LANG_HOOKS_TYPE_FOR_SIZE gfc_type_for_size
135 #define LANG_HOOKS_GET_ALIAS_SET gfc_get_alias_set
136 #define LANG_HOOKS_OMP_PRIVATIZE_BY_REFERENCE gfc_omp_privatize_by_reference
137 #define LANG_HOOKS_OMP_PREDETERMINED_SHARING gfc_omp_predetermined_sharing
138 #define LANG_HOOKS_OMP_CLAUSE_DEFAULT_CTOR gfc_omp_clause_default_ctor
139 #define LANG_HOOKS_OMP_DISREGARD_VALUE_EXPR gfc_omp_disregard_value_expr
140 #define LANG_HOOKS_OMP_PRIVATE_DEBUG_CLAUSE gfc_omp_private_debug_clause
141 #define LANG_HOOKS_OMP_FIRSTPRIVATIZE_TYPE_SIZES \
142 gfc_omp_firstprivatize_type_sizes
143 #define LANG_HOOKS_BUILTIN_FUNCTION gfc_builtin_function
144 #define LANG_HOOKS_GET_ARRAY_DESCR_INFO gfc_get_array_descr_info
146 const struct lang_hooks lang_hooks = LANG_HOOKS_INITIALIZER;
148 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
149 that have names. Here so we can clear out their names' definitions
150 at the end of the function. */
152 /* Tree code classes. */
154 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
156 const enum tree_code_class tree_code_type[] = {
157 #include "tree.def"
159 #undef DEFTREECODE
161 /* Table indexed by tree code giving number of expression
162 operands beyond the fixed part of the node structure.
163 Not used for types or decls. */
165 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
167 const unsigned char tree_code_length[] = {
168 #include "tree.def"
170 #undef DEFTREECODE
172 /* Names of tree components.
173 Used for printing out the tree and error messages. */
174 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
176 const char *const tree_code_name[] = {
177 #include "tree.def"
179 #undef DEFTREECODE
182 #define NULL_BINDING_LEVEL (struct binding_level *) NULL
184 /* A chain of binding_level structures awaiting reuse. */
186 static GTY(()) struct binding_level *free_binding_level;
188 /* The elements of `ridpointers' are identifier nodes
189 for the reserved type names and storage classes.
190 It is indexed by a RID_... value. */
191 tree *ridpointers = NULL;
193 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
194 or validate its data type for an `if' or `while' statement or ?..: exp.
196 This preparation consists of taking the ordinary
197 representation of an expression expr and producing a valid tree
198 boolean expression describing whether expr is nonzero. We could
199 simply always do build_binary_op (NE_EXPR, expr, boolean_false_node, 1),
200 but we optimize comparisons, &&, ||, and !.
202 The resulting type should always be `boolean_type_node'.
203 This is much simpler than the corresponding C version because we have a
204 distinct boolean type. */
206 tree
207 gfc_truthvalue_conversion (tree expr)
209 switch (TREE_CODE (TREE_TYPE (expr)))
211 case BOOLEAN_TYPE:
212 if (TREE_TYPE (expr) == boolean_type_node)
213 return expr;
214 else if (COMPARISON_CLASS_P (expr))
216 TREE_TYPE (expr) = boolean_type_node;
217 return expr;
219 else if (TREE_CODE (expr) == NOP_EXPR)
220 return fold_build1 (NOP_EXPR,
221 boolean_type_node, TREE_OPERAND (expr, 0));
222 else
223 return fold_build1 (NOP_EXPR, boolean_type_node, expr);
225 case INTEGER_TYPE:
226 if (TREE_CODE (expr) == INTEGER_CST)
227 return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
228 else
229 return fold_build2 (NE_EXPR, boolean_type_node, expr,
230 build_int_cst (TREE_TYPE (expr), 0));
232 default:
233 internal_error ("Unexpected type in truthvalue_conversion");
238 static void
239 gfc_create_decls (void)
241 /* GCC builtins. */
242 gfc_init_builtin_functions ();
244 /* Runtime/IO library functions. */
245 gfc_build_builtin_function_decls ();
247 gfc_init_constants ();
251 static void
252 gfc_be_parse_file (int set_yydebug ATTRIBUTE_UNUSED)
254 int errors;
255 int warnings;
257 gfc_create_decls ();
258 gfc_parse_file ();
259 gfc_generate_constructors ();
261 cgraph_finalize_compilation_unit ();
262 cgraph_optimize ();
264 /* Tell the frontent about any errors. */
265 gfc_get_errors (&warnings, &errors);
266 errorcount += errors;
267 warningcount += warnings;
269 clear_binding_stack ();
273 /* Initialize everything. */
275 static bool
276 gfc_init (void)
278 linemap_add (line_table, LC_ENTER, false, gfc_source_file, 1);
279 linemap_add (line_table, LC_RENAME, false, "<built-in>", 0);
281 /* First initialize the backend. */
282 gfc_init_decl_processing ();
283 gfc_static_ctors = NULL_TREE;
285 /* Then the frontend. */
286 gfc_init_1 ();
288 if (gfc_new_file () != SUCCESS)
289 fatal_error ("can't open input file: %s", gfc_source_file);
290 return true;
294 static void
295 gfc_finish (void)
297 gfc_done_1 ();
298 gfc_release_include_path ();
299 return;
302 static void
303 gfc_print_identifier (FILE * file ATTRIBUTE_UNUSED,
304 tree node ATTRIBUTE_UNUSED,
305 int indent ATTRIBUTE_UNUSED)
307 return;
311 /* These functions and variables deal with binding contours. We only
312 need these functions for the list of PARM_DECLs, but we leave the
313 functions more general; these are a simplified version of the
314 functions from GNAT. */
316 /* For each binding contour we allocate a binding_level structure which
317 records the entities defined or declared in that contour. Contours
318 include:
320 the global one
321 one for each subprogram definition
322 one for each compound statement (declare block)
324 Binding contours are used to create GCC tree BLOCK nodes. */
326 struct binding_level
327 GTY(())
329 /* A chain of ..._DECL nodes for all variables, constants, functions,
330 parameters and type declarations. These ..._DECL nodes are chained
331 through the TREE_CHAIN field. Note that these ..._DECL nodes are stored
332 in the reverse of the order supplied to be compatible with the
333 back-end. */
334 tree names;
335 /* For each level (except the global one), a chain of BLOCK nodes for all
336 the levels that were entered and exited one level down from this one. */
337 tree blocks;
338 /* The binding level containing this one (the enclosing binding level). */
339 struct binding_level *level_chain;
342 /* The binding level currently in effect. */
343 static GTY(()) struct binding_level *current_binding_level = NULL;
345 /* The outermost binding level. This binding level is created when the
346 compiler is started and it will exist through the entire compilation. */
347 static GTY(()) struct binding_level *global_binding_level;
349 /* Binding level structures are initialized by copying this one. */
350 static struct binding_level clear_binding_level = { NULL, NULL, NULL };
353 /* Return nonzero if we are currently in the global binding level. */
356 global_bindings_p (void)
358 return current_binding_level == global_binding_level ? -1 : 0;
361 tree
362 getdecls (void)
364 return current_binding_level->names;
367 /* Enter a new binding level. The input parameter is ignored, but has to be
368 specified for back-end compatibility. */
370 void
371 pushlevel (int ignore ATTRIBUTE_UNUSED)
373 struct binding_level *newlevel
374 = (struct binding_level *) ggc_alloc (sizeof (struct binding_level));
376 *newlevel = clear_binding_level;
378 /* Add this level to the front of the chain (stack) of levels that are
379 active. */
380 newlevel->level_chain = current_binding_level;
381 current_binding_level = newlevel;
384 /* Exit a binding level.
385 Pop the level off, and restore the state of the identifier-decl mappings
386 that were in effect when this level was entered.
388 If KEEP is nonzero, this level had explicit declarations, so
389 and create a "block" (a BLOCK node) for the level
390 to record its declarations and subblocks for symbol table output.
392 If FUNCTIONBODY is nonzero, this level is the body of a function,
393 so create a block as if KEEP were set and also clear out all
394 label names.
396 If REVERSE is nonzero, reverse the order of decls before putting
397 them into the BLOCK. */
399 tree
400 poplevel (int keep, int reverse, int functionbody)
402 /* Points to a BLOCK tree node. This is the BLOCK node constructed for the
403 binding level that we are about to exit and which is returned by this
404 routine. */
405 tree block_node = NULL_TREE;
406 tree decl_chain;
407 tree subblock_chain = current_binding_level->blocks;
408 tree subblock_node;
410 /* Reverse the list of XXXX_DECL nodes if desired. Note that the ..._DECL
411 nodes chained through the `names' field of current_binding_level are in
412 reverse order except for PARM_DECL node, which are explicitly stored in
413 the right order. */
414 decl_chain = (reverse) ? nreverse (current_binding_level->names)
415 : current_binding_level->names;
417 /* If there were any declarations in the current binding level, or if this
418 binding level is a function body, or if there are any nested blocks then
419 create a BLOCK node to record them for the life of this function. */
420 if (keep || functionbody)
421 block_node = build_block (keep ? decl_chain : 0, subblock_chain, 0, 0);
423 /* Record the BLOCK node just built as the subblock its enclosing scope. */
424 for (subblock_node = subblock_chain; subblock_node;
425 subblock_node = TREE_CHAIN (subblock_node))
426 BLOCK_SUPERCONTEXT (subblock_node) = block_node;
428 /* Clear out the meanings of the local variables of this level. */
430 for (subblock_node = decl_chain; subblock_node;
431 subblock_node = TREE_CHAIN (subblock_node))
432 if (DECL_NAME (subblock_node) != 0)
433 /* If the identifier was used or addressed via a local extern decl,
434 don't forget that fact. */
435 if (DECL_EXTERNAL (subblock_node))
437 if (TREE_USED (subblock_node))
438 TREE_USED (DECL_NAME (subblock_node)) = 1;
439 if (TREE_ADDRESSABLE (subblock_node))
440 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (subblock_node)) = 1;
443 /* Pop the current level. */
444 current_binding_level = current_binding_level->level_chain;
446 if (functionbody)
448 /* This is the top level block of a function. The ..._DECL chain stored
449 in BLOCK_VARS are the function's parameters (PARM_DECL nodes). Don't
450 leave them in the BLOCK because they are found in the FUNCTION_DECL
451 instead. */
452 DECL_INITIAL (current_function_decl) = block_node;
453 BLOCK_VARS (block_node) = 0;
455 else if (block_node)
457 current_binding_level->blocks
458 = chainon (current_binding_level->blocks, block_node);
461 /* If we did not make a block for the level just exited, any blocks made for
462 inner levels (since they cannot be recorded as subblocks in that level)
463 must be carried forward so they will later become subblocks of something
464 else. */
465 else if (subblock_chain)
466 current_binding_level->blocks
467 = chainon (current_binding_level->blocks, subblock_chain);
468 if (block_node)
469 TREE_USED (block_node) = 1;
471 return block_node;
475 /* Records a ..._DECL node DECL as belonging to the current lexical scope.
476 Returns the ..._DECL node. */
478 tree
479 pushdecl (tree decl)
481 /* External objects aren't nested, other objects may be. */
482 if ((DECL_EXTERNAL (decl)) || (decl == current_function_decl))
483 DECL_CONTEXT (decl) = 0;
484 else
485 DECL_CONTEXT (decl) = current_function_decl;
487 /* Put the declaration on the list. The list of declarations is in reverse
488 order. The list will be reversed later if necessary. This needs to be
489 this way for compatibility with the back-end. */
491 TREE_CHAIN (decl) = current_binding_level->names;
492 current_binding_level->names = decl;
494 /* For the declaration of a type, set its name if it is not already set. */
496 if (TREE_CODE (decl) == TYPE_DECL && TYPE_NAME (TREE_TYPE (decl)) == 0)
498 if (DECL_SOURCE_LINE (decl) == 0)
499 TYPE_NAME (TREE_TYPE (decl)) = decl;
500 else
501 TYPE_NAME (TREE_TYPE (decl)) = DECL_NAME (decl);
504 return decl;
508 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL. */
510 tree
511 pushdecl_top_level (tree x)
513 tree t;
514 struct binding_level *b = current_binding_level;
516 current_binding_level = global_binding_level;
517 t = pushdecl (x);
518 current_binding_level = b;
519 return t;
523 /* Clear the binding stack. */
524 static void
525 clear_binding_stack (void)
527 while (!global_bindings_p ())
528 poplevel (0, 0, 0);
532 #ifndef CHAR_TYPE_SIZE
533 #define CHAR_TYPE_SIZE BITS_PER_UNIT
534 #endif
536 #ifndef INT_TYPE_SIZE
537 #define INT_TYPE_SIZE BITS_PER_WORD
538 #endif
540 #undef SIZE_TYPE
541 #define SIZE_TYPE "long unsigned int"
543 /* Create tree nodes for the basic scalar types of Fortran 95,
544 and some nodes representing standard constants (0, 1, (void *) 0).
545 Initialize the global binding level.
546 Make definitions for built-in primitive functions. */
547 static void
548 gfc_init_decl_processing (void)
550 current_function_decl = NULL;
551 current_binding_level = NULL_BINDING_LEVEL;
552 free_binding_level = NULL_BINDING_LEVEL;
554 /* Make the binding_level structure for global names. We move all
555 variables that are in a COMMON block to this binding level. */
556 pushlevel (0);
557 global_binding_level = current_binding_level;
559 /* Build common tree nodes. char_type_node is unsigned because we
560 only use it for actual characters, not for INTEGER(1). Also, we
561 want double_type_node to actually have double precision. */
562 build_common_tree_nodes (false, false);
563 /* x86_64 minw32 has a sizetype of "unsigned long long", most other hosts
564 have a sizetype of "unsigned long". Therefore choose the correct size
565 in mostly target independent way. */
566 if (TYPE_MODE (long_unsigned_type_node) == ptr_mode)
567 set_sizetype (long_unsigned_type_node);
568 else if (TYPE_MODE (long_long_unsigned_type_node) == ptr_mode)
569 set_sizetype (long_long_unsigned_type_node);
570 else
571 set_sizetype (long_unsigned_type_node);
572 build_common_tree_nodes_2 (0);
573 void_list_node = build_tree_list (NULL_TREE, void_type_node);
575 /* Set up F95 type nodes. */
576 gfc_init_kinds ();
577 gfc_init_types ();
581 /* Mark EXP saying that we need to be able to take the
582 address of it; it should not be allocated in a register.
583 In Fortran 95 this is only the case for variables with
584 the TARGET attribute, but we implement it here for a
585 likely future Cray pointer extension.
586 Value is 1 if successful. */
587 /* TODO: Check/fix mark_addressable. */
589 bool
590 gfc_mark_addressable (tree exp)
592 register tree x = exp;
593 while (1)
594 switch (TREE_CODE (x))
596 case COMPONENT_REF:
597 case ADDR_EXPR:
598 case ARRAY_REF:
599 case REALPART_EXPR:
600 case IMAGPART_EXPR:
601 x = TREE_OPERAND (x, 0);
602 break;
604 case CONSTRUCTOR:
605 TREE_ADDRESSABLE (x) = 1;
606 return true;
608 case VAR_DECL:
609 case CONST_DECL:
610 case PARM_DECL:
611 case RESULT_DECL:
612 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x) && DECL_NONLOCAL (x))
614 if (TREE_PUBLIC (x))
616 error ("global register variable %qs used in nested function",
617 IDENTIFIER_POINTER (DECL_NAME (x)));
618 return false;
620 pedwarn ("register variable %qs used in nested function",
621 IDENTIFIER_POINTER (DECL_NAME (x)));
623 else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
625 if (TREE_PUBLIC (x))
627 error ("address of global register variable %qs requested",
628 IDENTIFIER_POINTER (DECL_NAME (x)));
629 return true;
632 #if 0
633 /* If we are making this addressable due to its having
634 volatile components, give a different error message. Also
635 handle the case of an unnamed parameter by not trying
636 to give the name. */
638 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x)))
640 error ("cannot put object with volatile field into register");
641 return false;
643 #endif
645 pedwarn ("address of register variable %qs requested",
646 IDENTIFIER_POINTER (DECL_NAME (x)));
649 /* drops in */
650 case FUNCTION_DECL:
651 TREE_ADDRESSABLE (x) = 1;
653 default:
654 return true;
659 /* Return the typed-based alias set for T, which may be an expression
660 or a type. Return -1 if we don't do anything special. */
662 static alias_set_type
663 gfc_get_alias_set (tree t)
665 tree u;
667 /* Permit type-punning when accessing an EQUIVALENCEd variable or
668 mixed type entry master's return value. */
669 for (u = t; handled_component_p (u); u = TREE_OPERAND (u, 0))
670 if (TREE_CODE (u) == COMPONENT_REF
671 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
672 return 0;
674 return -1;
678 /* press the big red button - garbage (ggc) collection is on */
680 int ggc_p = 1;
682 /* Builtin function initialization. */
684 tree
685 gfc_builtin_function (tree decl)
687 make_decl_rtl (decl);
688 pushdecl (decl);
689 return decl;
693 static void
694 gfc_define_builtin (const char *name,
695 tree type,
696 int code,
697 const char *library_name,
698 bool const_p)
700 tree decl;
702 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
703 library_name, NULL_TREE);
704 if (const_p)
705 TREE_READONLY (decl) = 1;
707 built_in_decls[code] = decl;
708 implicit_built_in_decls[code] = decl;
712 #define DO_DEFINE_MATH_BUILTIN(code, name, argtype, tbase) \
713 gfc_define_builtin ("__builtin_" name "l", tbase##longdouble[argtype], \
714 BUILT_IN_ ## code ## L, name "l", true); \
715 gfc_define_builtin ("__builtin_" name, tbase##double[argtype], \
716 BUILT_IN_ ## code, name, true); \
717 gfc_define_builtin ("__builtin_" name "f", tbase##float[argtype], \
718 BUILT_IN_ ## code ## F, name "f", true);
720 #define DEFINE_MATH_BUILTIN(code, name, argtype) \
721 DO_DEFINE_MATH_BUILTIN (code, name, argtype, mfunc_)
723 #define DEFINE_MATH_BUILTIN_C(code, name, argtype) \
724 DO_DEFINE_MATH_BUILTIN (code, name, argtype, mfunc_) \
725 DO_DEFINE_MATH_BUILTIN (C##code, "c" name, argtype, mfunc_c)
728 /* Create function types for builtin functions. */
730 static void
731 build_builtin_fntypes (tree *fntype, tree type)
733 tree tmp;
735 /* type (*) (type) */
736 tmp = tree_cons (NULL_TREE, type, void_list_node);
737 fntype[0] = build_function_type (type, tmp);
738 /* type (*) (type, type) */
739 tmp = tree_cons (NULL_TREE, type, tmp);
740 fntype[1] = build_function_type (type, tmp);
741 /* type (*) (int, type) */
742 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
743 tmp = tree_cons (NULL_TREE, type, tmp);
744 fntype[2] = build_function_type (type, tmp);
745 /* type (*) (void) */
746 fntype[3] = build_function_type (type, void_list_node);
747 /* type (*) (type, &int) */
748 tmp = tree_cons (NULL_TREE, type, void_list_node);
749 tmp = tree_cons (NULL_TREE, build_pointer_type (integer_type_node), tmp);
750 fntype[4] = build_function_type (type, tmp);
751 /* type (*) (type, int) */
752 tmp = tree_cons (NULL_TREE, type, void_list_node);
753 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
754 fntype[5] = build_function_type (type, tmp);
758 static tree
759 builtin_type_for_size (int size, bool unsignedp)
761 tree type = lang_hooks.types.type_for_size (size, unsignedp);
762 return type ? type : error_mark_node;
765 /* Initialization of builtin function nodes. */
767 static void
768 gfc_init_builtin_functions (void)
770 enum builtin_type
772 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
773 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
774 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
775 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
776 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
777 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
778 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
779 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
780 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
781 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
782 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
783 #include "types.def"
784 #undef DEF_PRIMITIVE_TYPE
785 #undef DEF_FUNCTION_TYPE_0
786 #undef DEF_FUNCTION_TYPE_1
787 #undef DEF_FUNCTION_TYPE_2
788 #undef DEF_FUNCTION_TYPE_3
789 #undef DEF_FUNCTION_TYPE_4
790 #undef DEF_FUNCTION_TYPE_5
791 #undef DEF_FUNCTION_TYPE_6
792 #undef DEF_FUNCTION_TYPE_7
793 #undef DEF_FUNCTION_TYPE_VAR_0
794 #undef DEF_POINTER_TYPE
795 BT_LAST
797 typedef enum builtin_type builtin_type;
798 enum
800 /* So far we need just these 2 attribute types. */
801 ATTR_NOTHROW_LIST,
802 ATTR_CONST_NOTHROW_LIST
805 tree mfunc_float[6];
806 tree mfunc_double[6];
807 tree mfunc_longdouble[6];
808 tree mfunc_cfloat[6];
809 tree mfunc_cdouble[6];
810 tree mfunc_clongdouble[6];
811 tree func_cfloat_float, func_float_cfloat;
812 tree func_cdouble_double, func_double_cdouble;
813 tree func_clongdouble_longdouble, func_longdouble_clongdouble;
814 tree func_float_floatp_floatp;
815 tree func_double_doublep_doublep;
816 tree func_longdouble_longdoublep_longdoublep;
817 tree ftype, ptype;
818 tree tmp, type;
819 tree builtin_types[(int) BT_LAST + 1];
821 build_builtin_fntypes (mfunc_float, float_type_node);
822 build_builtin_fntypes (mfunc_double, double_type_node);
823 build_builtin_fntypes (mfunc_longdouble, long_double_type_node);
824 build_builtin_fntypes (mfunc_cfloat, complex_float_type_node);
825 build_builtin_fntypes (mfunc_cdouble, complex_double_type_node);
826 build_builtin_fntypes (mfunc_clongdouble, complex_long_double_type_node);
828 tmp = tree_cons (NULL_TREE, complex_float_type_node, void_list_node);
829 func_cfloat_float = build_function_type (float_type_node, tmp);
831 tmp = tree_cons (NULL_TREE, float_type_node, void_list_node);
832 func_float_cfloat = build_function_type (complex_float_type_node, tmp);
834 tmp = tree_cons (NULL_TREE, complex_double_type_node, void_list_node);
835 func_cdouble_double = build_function_type (double_type_node, tmp);
837 tmp = tree_cons (NULL_TREE, double_type_node, void_list_node);
838 func_double_cdouble = build_function_type (complex_double_type_node, tmp);
840 tmp = tree_cons (NULL_TREE, complex_long_double_type_node, void_list_node);
841 func_clongdouble_longdouble =
842 build_function_type (long_double_type_node, tmp);
844 tmp = tree_cons (NULL_TREE, long_double_type_node, void_list_node);
845 func_longdouble_clongdouble =
846 build_function_type (complex_long_double_type_node, tmp);
848 ptype = build_pointer_type (float_type_node);
849 tmp = tree_cons (NULL_TREE, float_type_node,
850 tree_cons (NULL_TREE, ptype,
851 tree_cons (NULL_TREE, ptype, void_list_node)));
852 func_float_floatp_floatp =
853 build_function_type (void_type_node, tmp);
855 ptype = build_pointer_type (double_type_node);
856 tmp = tree_cons (NULL_TREE, double_type_node,
857 tree_cons (NULL_TREE, ptype,
858 tree_cons (NULL_TREE, ptype, void_list_node)));
859 func_double_doublep_doublep =
860 build_function_type (void_type_node, tmp);
862 ptype = build_pointer_type (long_double_type_node);
863 tmp = tree_cons (NULL_TREE, long_double_type_node,
864 tree_cons (NULL_TREE, ptype,
865 tree_cons (NULL_TREE, ptype, void_list_node)));
866 func_longdouble_longdoublep_longdoublep =
867 build_function_type (void_type_node, tmp);
869 #include "mathbuiltins.def"
871 /* We define these separately as the fortran versions have different
872 semantics (they return an integer type) */
873 gfc_define_builtin ("__builtin_roundl", mfunc_longdouble[0],
874 BUILT_IN_ROUNDL, "roundl", true);
875 gfc_define_builtin ("__builtin_round", mfunc_double[0],
876 BUILT_IN_ROUND, "round", true);
877 gfc_define_builtin ("__builtin_roundf", mfunc_float[0],
878 BUILT_IN_ROUNDF, "roundf", true);
880 gfc_define_builtin ("__builtin_truncl", mfunc_longdouble[0],
881 BUILT_IN_TRUNCL, "truncl", true);
882 gfc_define_builtin ("__builtin_trunc", mfunc_double[0],
883 BUILT_IN_TRUNC, "trunc", true);
884 gfc_define_builtin ("__builtin_truncf", mfunc_float[0],
885 BUILT_IN_TRUNCF, "truncf", true);
887 gfc_define_builtin ("__builtin_cabsl", func_clongdouble_longdouble,
888 BUILT_IN_CABSL, "cabsl", true);
889 gfc_define_builtin ("__builtin_cabs", func_cdouble_double,
890 BUILT_IN_CABS, "cabs", true);
891 gfc_define_builtin ("__builtin_cabsf", func_cfloat_float,
892 BUILT_IN_CABSF, "cabsf", true);
894 gfc_define_builtin ("__builtin_copysignl", mfunc_longdouble[1],
895 BUILT_IN_COPYSIGNL, "copysignl", true);
896 gfc_define_builtin ("__builtin_copysign", mfunc_double[1],
897 BUILT_IN_COPYSIGN, "copysign", true);
898 gfc_define_builtin ("__builtin_copysignf", mfunc_float[1],
899 BUILT_IN_COPYSIGNF, "copysignf", true);
901 gfc_define_builtin ("__builtin_nextafterl", mfunc_longdouble[1],
902 BUILT_IN_NEXTAFTERL, "nextafterl", true);
903 gfc_define_builtin ("__builtin_nextafter", mfunc_double[1],
904 BUILT_IN_NEXTAFTER, "nextafter", true);
905 gfc_define_builtin ("__builtin_nextafterf", mfunc_float[1],
906 BUILT_IN_NEXTAFTERF, "nextafterf", true);
908 gfc_define_builtin ("__builtin_frexpl", mfunc_longdouble[4],
909 BUILT_IN_FREXPL, "frexpl", false);
910 gfc_define_builtin ("__builtin_frexp", mfunc_double[4],
911 BUILT_IN_FREXP, "frexp", false);
912 gfc_define_builtin ("__builtin_frexpf", mfunc_float[4],
913 BUILT_IN_FREXPF, "frexpf", false);
915 gfc_define_builtin ("__builtin_fabsl", mfunc_longdouble[0],
916 BUILT_IN_FABSL, "fabsl", true);
917 gfc_define_builtin ("__builtin_fabs", mfunc_double[0],
918 BUILT_IN_FABS, "fabs", true);
919 gfc_define_builtin ("__builtin_fabsf", mfunc_float[0],
920 BUILT_IN_FABSF, "fabsf", true);
922 gfc_define_builtin ("__builtin_scalbnl", mfunc_longdouble[5],
923 BUILT_IN_SCALBNL, "scalbnl", true);
924 gfc_define_builtin ("__builtin_scalbn", mfunc_double[5],
925 BUILT_IN_SCALBN, "scalbn", true);
926 gfc_define_builtin ("__builtin_scalbnf", mfunc_float[5],
927 BUILT_IN_SCALBNF, "scalbnf", true);
929 gfc_define_builtin ("__builtin_fmodl", mfunc_longdouble[1],
930 BUILT_IN_FMODL, "fmodl", true);
931 gfc_define_builtin ("__builtin_fmod", mfunc_double[1],
932 BUILT_IN_FMOD, "fmod", true);
933 gfc_define_builtin ("__builtin_fmodf", mfunc_float[1],
934 BUILT_IN_FMODF, "fmodf", true);
936 gfc_define_builtin ("__builtin_infl", mfunc_longdouble[3],
937 BUILT_IN_INFL, "__builtin_infl", true);
938 gfc_define_builtin ("__builtin_inf", mfunc_double[3],
939 BUILT_IN_INF, "__builtin_inf", true);
940 gfc_define_builtin ("__builtin_inff", mfunc_float[3],
941 BUILT_IN_INFF, "__builtin_inff", true);
943 /* lround{f,,l} and llround{f,,l} */
944 type = tree_cons (NULL_TREE, float_type_node, void_list_node);
945 tmp = build_function_type (long_integer_type_node, type);
946 gfc_define_builtin ("__builtin_lroundf", tmp, BUILT_IN_LROUNDF,
947 "lroundf", true);
948 tmp = build_function_type (long_long_integer_type_node, type);
949 gfc_define_builtin ("__builtin_llroundf", tmp, BUILT_IN_LLROUNDF,
950 "llroundf", true);
952 type = tree_cons (NULL_TREE, double_type_node, void_list_node);
953 tmp = build_function_type (long_integer_type_node, type);
954 gfc_define_builtin ("__builtin_lround", tmp, BUILT_IN_LROUND,
955 "lround", true);
956 tmp = build_function_type (long_long_integer_type_node, type);
957 gfc_define_builtin ("__builtin_llround", tmp, BUILT_IN_LLROUND,
958 "llround", true);
960 type = tree_cons (NULL_TREE, long_double_type_node, void_list_node);
961 tmp = build_function_type (long_integer_type_node, type);
962 gfc_define_builtin ("__builtin_lroundl", tmp, BUILT_IN_LROUNDL,
963 "lroundl", true);
964 tmp = build_function_type (long_long_integer_type_node, type);
965 gfc_define_builtin ("__builtin_llroundl", tmp, BUILT_IN_LLROUNDL,
966 "llroundl", true);
968 /* These are used to implement the ** operator. */
969 gfc_define_builtin ("__builtin_powl", mfunc_longdouble[1],
970 BUILT_IN_POWL, "powl", true);
971 gfc_define_builtin ("__builtin_pow", mfunc_double[1],
972 BUILT_IN_POW, "pow", true);
973 gfc_define_builtin ("__builtin_powf", mfunc_float[1],
974 BUILT_IN_POWF, "powf", true);
975 gfc_define_builtin ("__builtin_cpowl", mfunc_clongdouble[1],
976 BUILT_IN_CPOWL, "cpowl", true);
977 gfc_define_builtin ("__builtin_cpow", mfunc_cdouble[1],
978 BUILT_IN_CPOW, "cpow", true);
979 gfc_define_builtin ("__builtin_cpowf", mfunc_cfloat[1],
980 BUILT_IN_CPOWF, "cpowf", true);
981 gfc_define_builtin ("__builtin_powil", mfunc_longdouble[2],
982 BUILT_IN_POWIL, "powil", true);
983 gfc_define_builtin ("__builtin_powi", mfunc_double[2],
984 BUILT_IN_POWI, "powi", true);
985 gfc_define_builtin ("__builtin_powif", mfunc_float[2],
986 BUILT_IN_POWIF, "powif", true);
989 if (TARGET_C99_FUNCTIONS)
991 gfc_define_builtin ("__builtin_cbrtl", mfunc_longdouble[0],
992 BUILT_IN_CBRTL, "cbrtl", true);
993 gfc_define_builtin ("__builtin_cbrt", mfunc_double[0],
994 BUILT_IN_CBRT, "cbrt", true);
995 gfc_define_builtin ("__builtin_cbrtf", mfunc_float[0],
996 BUILT_IN_CBRTF, "cbrtf", true);
997 gfc_define_builtin ("__builtin_cexpil", func_longdouble_clongdouble,
998 BUILT_IN_CEXPIL, "cexpil", true);
999 gfc_define_builtin ("__builtin_cexpi", func_double_cdouble,
1000 BUILT_IN_CEXPI, "cexpi", true);
1001 gfc_define_builtin ("__builtin_cexpif", func_float_cfloat,
1002 BUILT_IN_CEXPIF, "cexpif", true);
1005 if (TARGET_HAS_SINCOS)
1007 gfc_define_builtin ("__builtin_sincosl",
1008 func_longdouble_longdoublep_longdoublep,
1009 BUILT_IN_SINCOSL, "sincosl", false);
1010 gfc_define_builtin ("__builtin_sincos", func_double_doublep_doublep,
1011 BUILT_IN_SINCOS, "sincos", false);
1012 gfc_define_builtin ("__builtin_sincosf", func_float_floatp_floatp,
1013 BUILT_IN_SINCOSF, "sincosf", false);
1016 /* Other builtin functions we use. */
1018 tmp = tree_cons (NULL_TREE, long_integer_type_node, void_list_node);
1019 tmp = tree_cons (NULL_TREE, long_integer_type_node, tmp);
1020 ftype = build_function_type (long_integer_type_node, tmp);
1021 gfc_define_builtin ("__builtin_expect", ftype, BUILT_IN_EXPECT,
1022 "__builtin_expect", true);
1024 tmp = tree_cons (NULL_TREE, pvoid_type_node, void_list_node);
1025 ftype = build_function_type (void_type_node, tmp);
1026 gfc_define_builtin ("__builtin_free", ftype, BUILT_IN_FREE,
1027 "free", false);
1029 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
1030 ftype = build_function_type (pvoid_type_node, tmp);
1031 gfc_define_builtin ("__builtin_malloc", ftype, BUILT_IN_MALLOC,
1032 "malloc", false);
1033 DECL_IS_MALLOC (built_in_decls[BUILT_IN_MALLOC]) = 1;
1035 tmp = tree_cons (NULL_TREE, pvoid_type_node, void_list_node);
1036 tmp = tree_cons (NULL_TREE, size_type_node, tmp);
1037 ftype = build_function_type (pvoid_type_node, tmp);
1038 gfc_define_builtin ("__builtin_realloc", ftype, BUILT_IN_REALLOC,
1039 "realloc", false);
1041 tmp = tree_cons (NULL_TREE, void_type_node, void_list_node);
1042 ftype = build_function_type (integer_type_node, tmp);
1043 gfc_define_builtin ("__builtin_isnan", ftype, BUILT_IN_ISNAN,
1044 "__builtin_isnan", true);
1046 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
1047 builtin_types[(int) ENUM] = VALUE;
1048 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
1049 builtin_types[(int) ENUM] \
1050 = build_function_type (builtin_types[(int) RETURN], \
1051 void_list_node);
1052 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
1053 builtin_types[(int) ENUM] \
1054 = build_function_type (builtin_types[(int) RETURN], \
1055 tree_cons (NULL_TREE, \
1056 builtin_types[(int) ARG1], \
1057 void_list_node));
1058 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
1059 builtin_types[(int) ENUM] \
1060 = build_function_type \
1061 (builtin_types[(int) RETURN], \
1062 tree_cons (NULL_TREE, \
1063 builtin_types[(int) ARG1], \
1064 tree_cons (NULL_TREE, \
1065 builtin_types[(int) ARG2], \
1066 void_list_node)));
1067 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
1068 builtin_types[(int) ENUM] \
1069 = build_function_type \
1070 (builtin_types[(int) RETURN], \
1071 tree_cons (NULL_TREE, \
1072 builtin_types[(int) ARG1], \
1073 tree_cons (NULL_TREE, \
1074 builtin_types[(int) ARG2], \
1075 tree_cons (NULL_TREE, \
1076 builtin_types[(int) ARG3], \
1077 void_list_node))));
1078 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
1079 builtin_types[(int) ENUM] \
1080 = build_function_type \
1081 (builtin_types[(int) RETURN], \
1082 tree_cons (NULL_TREE, \
1083 builtin_types[(int) ARG1], \
1084 tree_cons (NULL_TREE, \
1085 builtin_types[(int) ARG2], \
1086 tree_cons \
1087 (NULL_TREE, \
1088 builtin_types[(int) ARG3], \
1089 tree_cons (NULL_TREE, \
1090 builtin_types[(int) ARG4], \
1091 void_list_node)))));
1092 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
1093 builtin_types[(int) ENUM] \
1094 = build_function_type \
1095 (builtin_types[(int) RETURN], \
1096 tree_cons (NULL_TREE, \
1097 builtin_types[(int) ARG1], \
1098 tree_cons (NULL_TREE, \
1099 builtin_types[(int) ARG2], \
1100 tree_cons \
1101 (NULL_TREE, \
1102 builtin_types[(int) ARG3], \
1103 tree_cons (NULL_TREE, \
1104 builtin_types[(int) ARG4], \
1105 tree_cons (NULL_TREE, \
1106 builtin_types[(int) ARG5],\
1107 void_list_node))))));
1108 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
1109 ARG6) \
1110 builtin_types[(int) ENUM] \
1111 = build_function_type \
1112 (builtin_types[(int) RETURN], \
1113 tree_cons (NULL_TREE, \
1114 builtin_types[(int) ARG1], \
1115 tree_cons (NULL_TREE, \
1116 builtin_types[(int) ARG2], \
1117 tree_cons \
1118 (NULL_TREE, \
1119 builtin_types[(int) ARG3], \
1120 tree_cons \
1121 (NULL_TREE, \
1122 builtin_types[(int) ARG4], \
1123 tree_cons (NULL_TREE, \
1124 builtin_types[(int) ARG5], \
1125 tree_cons (NULL_TREE, \
1126 builtin_types[(int) ARG6],\
1127 void_list_node)))))));
1128 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
1129 ARG6, ARG7) \
1130 builtin_types[(int) ENUM] \
1131 = build_function_type \
1132 (builtin_types[(int) RETURN], \
1133 tree_cons (NULL_TREE, \
1134 builtin_types[(int) ARG1], \
1135 tree_cons (NULL_TREE, \
1136 builtin_types[(int) ARG2], \
1137 tree_cons \
1138 (NULL_TREE, \
1139 builtin_types[(int) ARG3], \
1140 tree_cons \
1141 (NULL_TREE, \
1142 builtin_types[(int) ARG4], \
1143 tree_cons (NULL_TREE, \
1144 builtin_types[(int) ARG5], \
1145 tree_cons (NULL_TREE, \
1146 builtin_types[(int) ARG6],\
1147 tree_cons (NULL_TREE, \
1148 builtin_types[(int) ARG6], \
1149 void_list_node))))))));
1150 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
1151 builtin_types[(int) ENUM] \
1152 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
1153 #define DEF_POINTER_TYPE(ENUM, TYPE) \
1154 builtin_types[(int) ENUM] \
1155 = build_pointer_type (builtin_types[(int) TYPE]);
1156 #include "types.def"
1157 #undef DEF_PRIMITIVE_TYPE
1158 #undef DEF_FUNCTION_TYPE_1
1159 #undef DEF_FUNCTION_TYPE_2
1160 #undef DEF_FUNCTION_TYPE_3
1161 #undef DEF_FUNCTION_TYPE_4
1162 #undef DEF_FUNCTION_TYPE_5
1163 #undef DEF_FUNCTION_TYPE_6
1164 #undef DEF_FUNCTION_TYPE_VAR_0
1165 #undef DEF_POINTER_TYPE
1166 builtin_types[(int) BT_LAST] = NULL_TREE;
1168 /* Initialize synchronization builtins. */
1169 #undef DEF_SYNC_BUILTIN
1170 #define DEF_SYNC_BUILTIN(code, name, type, attr) \
1171 gfc_define_builtin (name, builtin_types[type], code, name, \
1172 attr == ATTR_CONST_NOTHROW_LIST);
1173 #include "../sync-builtins.def"
1174 #undef DEF_SYNC_BUILTIN
1176 if (gfc_option.flag_openmp || flag_tree_parallelize_loops)
1178 #undef DEF_GOMP_BUILTIN
1179 #define DEF_GOMP_BUILTIN(code, name, type, attr) \
1180 gfc_define_builtin ("__builtin_" name, builtin_types[type], \
1181 code, name, attr == ATTR_CONST_NOTHROW_LIST);
1182 #include "../omp-builtins.def"
1183 #undef DEF_GOMP_BUILTIN
1186 gfc_define_builtin ("__builtin_trap", builtin_types[BT_FN_VOID],
1187 BUILT_IN_TRAP, NULL, false);
1188 TREE_THIS_VOLATILE (built_in_decls[BUILT_IN_TRAP]) = 1;
1190 gfc_define_builtin ("__emutls_get_address",
1191 builtin_types[BT_FN_PTR_PTR], BUILT_IN_EMUTLS_GET_ADDRESS,
1192 "__emutls_get_address", true);
1193 gfc_define_builtin ("__emutls_register_common",
1194 builtin_types[BT_FN_VOID_PTR_WORD_WORD_PTR],
1195 BUILT_IN_EMUTLS_REGISTER_COMMON,
1196 "__emutls_register_common", false);
1198 build_common_builtin_nodes ();
1199 targetm.init_builtins ();
1202 #undef DEFINE_MATH_BUILTIN_C
1203 #undef DEFINE_MATH_BUILTIN
1205 #include "gt-fortran-f95-lang.h"
1206 #include "gtype-fortran.h"