1 /* gfortran backend interface
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006
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 2, or (at your option) any later
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
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
23 /* f95-lang.c-- GCC backend interface stuff */
25 /* declare required prototypes: */
31 #include "coretypes.h"
33 #include "tree-gimple.h"
35 #include "langhooks.h"
36 #include "langhooks-def.h"
44 #include "diagnostic.h"
45 #include "tree-dump.h"
50 #include "trans-types.h"
51 #include "trans-const.h"
53 /* Language-dependent contents of an identifier. */
55 struct lang_identifier
58 struct tree_identifier common;
61 /* The resulting tree type. */
64 GTY((desc ("TREE_CODE (&%h.generic) == IDENTIFIER_NODE"),
65 chain_next ("(union lang_tree_node *)TREE_CHAIN (&%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
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
85 void yyerror (const char *str);
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 void insert_block (tree);
99 static void gfc_clear_binding_stack (void);
100 static void gfc_be_parse_file (int);
101 static void gfc_expand_function (tree);
102 static HOST_WIDE_INT gfc_get_alias_set (tree);
104 #undef LANG_HOOKS_NAME
105 #undef LANG_HOOKS_INIT
106 #undef LANG_HOOKS_FINISH
107 #undef LANG_HOOKS_INIT_OPTIONS
108 #undef LANG_HOOKS_HANDLE_OPTION
109 #undef LANG_HOOKS_POST_OPTIONS
110 #undef LANG_HOOKS_PRINT_IDENTIFIER
111 #undef LANG_HOOKS_PARSE_FILE
112 #undef LANG_HOOKS_MARK_ADDRESSABLE
113 #undef LANG_HOOKS_TYPE_FOR_MODE
114 #undef LANG_HOOKS_TYPE_FOR_SIZE
115 #undef LANG_HOOKS_UNSIGNED_TYPE
116 #undef LANG_HOOKS_SIGNED_TYPE
117 #undef LANG_HOOKS_SIGNED_OR_UNSIGNED_TYPE
118 #undef LANG_HOOKS_CALLGRAPH_EXPAND_FUNCTION
119 #undef LANG_HOOKS_CLEAR_BINDING_STACK
120 #undef LANG_HOOKS_GET_ALIAS_SET
121 #undef LANG_HOOKS_OMP_PRIVATIZE_BY_REFERENCE
122 #undef LANG_HOOKS_OMP_PREDETERMINED_SHARING
123 #undef LANG_HOOKS_OMP_CLAUSE_DEFAULT_CTOR
124 #undef LANG_HOOKS_OMP_DISREGARD_VALUE_EXPR
125 #undef LANG_HOOKS_OMP_PRIVATE_DEBUG_CLAUSE
126 #undef LANG_HOOKS_OMP_FIRSTPRIVATIZE_TYPE_SIZES
127 #undef LANG_HOOKS_BUILTIN_FUNCTION
129 /* Define lang hooks. */
130 #define LANG_HOOKS_NAME "GNU F95"
131 #define LANG_HOOKS_INIT gfc_init
132 #define LANG_HOOKS_FINISH gfc_finish
133 #define LANG_HOOKS_INIT_OPTIONS gfc_init_options
134 #define LANG_HOOKS_HANDLE_OPTION gfc_handle_option
135 #define LANG_HOOKS_POST_OPTIONS gfc_post_options
136 #define LANG_HOOKS_PRINT_IDENTIFIER gfc_print_identifier
137 #define LANG_HOOKS_PARSE_FILE gfc_be_parse_file
138 #define LANG_HOOKS_MARK_ADDRESSABLE gfc_mark_addressable
139 #define LANG_HOOKS_TYPE_FOR_MODE gfc_type_for_mode
140 #define LANG_HOOKS_TYPE_FOR_SIZE gfc_type_for_size
141 #define LANG_HOOKS_UNSIGNED_TYPE gfc_unsigned_type
142 #define LANG_HOOKS_SIGNED_TYPE gfc_signed_type
143 #define LANG_HOOKS_SIGNED_OR_UNSIGNED_TYPE gfc_signed_or_unsigned_type
144 #define LANG_HOOKS_CALLGRAPH_EXPAND_FUNCTION gfc_expand_function
145 #define LANG_HOOKS_CLEAR_BINDING_STACK gfc_clear_binding_stack
146 #define LANG_HOOKS_GET_ALIAS_SET gfc_get_alias_set
147 #define LANG_HOOKS_OMP_PRIVATIZE_BY_REFERENCE gfc_omp_privatize_by_reference
148 #define LANG_HOOKS_OMP_PREDETERMINED_SHARING gfc_omp_predetermined_sharing
149 #define LANG_HOOKS_OMP_CLAUSE_DEFAULT_CTOR gfc_omp_clause_default_ctor
150 #define LANG_HOOKS_OMP_DISREGARD_VALUE_EXPR gfc_omp_disregard_value_expr
151 #define LANG_HOOKS_OMP_PRIVATE_DEBUG_CLAUSE gfc_omp_private_debug_clause
152 #define LANG_HOOKS_OMP_FIRSTPRIVATIZE_TYPE_SIZES \
153 gfc_omp_firstprivatize_type_sizes
154 #define LANG_HOOKS_BUILTIN_FUNCTION gfc_builtin_function
156 const struct lang_hooks lang_hooks = LANG_HOOKS_INITIALIZER;
158 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
159 that have names. Here so we can clear out their names' definitions
160 at the end of the function. */
162 /* Tree code classes. */
164 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
166 const enum tree_code_class tree_code_type[] = {
171 /* Table indexed by tree code giving number of expression
172 operands beyond the fixed part of the node structure.
173 Not used for types or decls. */
175 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
177 const unsigned char tree_code_length[] = {
182 /* Names of tree components.
183 Used for printing out the tree and error messages. */
184 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
186 const char *const tree_code_name[] = {
192 #define NULL_BINDING_LEVEL (struct binding_level *) NULL
194 /* A chain of binding_level structures awaiting reuse. */
196 static GTY(()) struct binding_level *free_binding_level;
198 /* The elements of `ridpointers' are identifier nodes
199 for the reserved type names and storage classes.
200 It is indexed by a RID_... value. */
201 tree *ridpointers = NULL;
203 /* language-specific flags. */
206 gfc_expand_function (tree fndecl)
210 if (DECL_INITIAL (fndecl)
211 && BLOCK_SUBBLOCKS (DECL_INITIAL (fndecl)))
213 /* Local static equivalenced variables are never seen by
214 check_global_declarations, so we need to output debug
217 t = BLOCK_SUBBLOCKS (DECL_INITIAL (fndecl));
218 for (t = BLOCK_VARS (t); t; t = TREE_CHAIN (t))
219 if (TREE_CODE (t) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (t)
222 tree expr = DECL_VALUE_EXPR (t);
224 if (TREE_CODE (expr) == COMPONENT_REF
225 && TREE_CODE (TREE_OPERAND (expr, 0)) == VAR_DECL
226 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
228 && cgraph_varpool_node (TREE_OPERAND (expr, 0))->needed
229 && errorcount == 0 && sorrycount == 0)
231 timevar_push (TV_SYMOUT);
232 (*debug_hooks->global_decl) (t);
233 timevar_pop (TV_SYMOUT);
238 tree_rest_of_compilation (fndecl);
242 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
243 or validate its data type for an `if' or `while' statement or ?..: exp.
245 This preparation consists of taking the ordinary
246 representation of an expression expr and producing a valid tree
247 boolean expression describing whether expr is nonzero. We could
248 simply always do build_binary_op (NE_EXPR, expr, boolean_false_node, 1),
249 but we optimize comparisons, &&, ||, and !.
251 The resulting type should always be `boolean_type_node'.
252 This is much simpler than the corresponding C version because we have a
253 distinct boolean type. */
256 gfc_truthvalue_conversion (tree expr)
258 switch (TREE_CODE (TREE_TYPE (expr)))
261 if (TREE_TYPE (expr) == boolean_type_node)
263 else if (COMPARISON_CLASS_P (expr))
265 TREE_TYPE (expr) = boolean_type_node;
268 else if (TREE_CODE (expr) == NOP_EXPR)
269 return build1 (NOP_EXPR, boolean_type_node,
270 TREE_OPERAND (expr, 0));
272 return build1 (NOP_EXPR, boolean_type_node, expr);
275 if (TREE_CODE (expr) == INTEGER_CST)
276 return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
278 return build2 (NE_EXPR, boolean_type_node, expr,
279 build_int_cst (TREE_TYPE (expr), 0));
282 internal_error ("Unexpected type in truthvalue_conversion");
287 gfc_create_decls (void)
290 gfc_init_builtin_functions ();
292 /* Runtime/IO library functions. */
293 gfc_build_builtin_function_decls ();
295 gfc_init_constants ();
299 gfc_be_parse_file (int set_yydebug ATTRIBUTE_UNUSED)
306 gfc_generate_constructors ();
308 cgraph_finalize_compilation_unit ();
311 /* Tell the frontent about any errors. */
312 gfc_get_errors (&warnings, &errors);
313 errorcount += errors;
314 warningcount += warnings;
317 /* Initialize everything. */
322 #ifdef USE_MAPPED_LOCATION
323 linemap_add (&line_table, LC_ENTER, false, gfc_source_file, 1);
324 linemap_add (&line_table, LC_RENAME, false, "<built-in>", 0);
327 /* First initialize the backend. */
328 gfc_init_decl_processing ();
329 gfc_static_ctors = NULL_TREE;
331 /* Then the frontend. */
334 if (gfc_new_file () != SUCCESS)
335 fatal_error ("can't open input file: %s", gfc_source_file);
344 gfc_release_include_path ();
349 gfc_print_identifier (FILE * file ATTRIBUTE_UNUSED,
350 tree node ATTRIBUTE_UNUSED,
351 int indent ATTRIBUTE_UNUSED)
357 /* These functions and variables deal with binding contours. We only
358 need these functions for the list of PARM_DECLs, but we leave the
359 functions more general; these are a simplified version of the
360 functions from GNAT. */
362 /* For each binding contour we allocate a binding_level structure which records
363 the entities defined or declared in that contour. Contours include:
366 one for each subprogram definition
367 one for each compound statement (declare block)
369 Binding contours are used to create GCC tree BLOCK nodes. */
374 /* A chain of ..._DECL nodes for all variables, constants, functions,
375 parameters and type declarations. These ..._DECL nodes are chained
376 through the TREE_CHAIN field. Note that these ..._DECL nodes are stored
377 in the reverse of the order supplied to be compatible with the
380 /* For each level (except the global one), a chain of BLOCK nodes for all
381 the levels that were entered and exited one level down from this one. */
383 /* The binding level containing this one (the enclosing binding level). */
384 struct binding_level *level_chain;
387 /* The binding level currently in effect. */
388 static GTY(()) struct binding_level *current_binding_level = NULL;
390 /* The outermost binding level. This binding level is created when the
391 compiler is started and it will exist through the entire compilation. */
392 static GTY(()) struct binding_level *global_binding_level;
394 /* Binding level structures are initialized by copying this one. */
395 static struct binding_level clear_binding_level = { NULL, NULL, NULL };
397 /* Return nonzero if we are currently in the global binding level. */
400 global_bindings_p (void)
402 return current_binding_level == global_binding_level ? -1 : 0;
408 return current_binding_level->names;
411 /* Enter a new binding level. The input parameter is ignored, but has to be
412 specified for back-end compatibility. */
415 pushlevel (int ignore ATTRIBUTE_UNUSED)
417 struct binding_level *newlevel
418 = (struct binding_level *) ggc_alloc (sizeof (struct binding_level));
420 *newlevel = clear_binding_level;
422 /* Add this level to the front of the chain (stack) of levels that are
424 newlevel->level_chain = current_binding_level;
425 current_binding_level = newlevel;
428 /* Exit a binding level.
429 Pop the level off, and restore the state of the identifier-decl mappings
430 that were in effect when this level was entered.
432 If KEEP is nonzero, this level had explicit declarations, so
433 and create a "block" (a BLOCK node) for the level
434 to record its declarations and subblocks for symbol table output.
436 If FUNCTIONBODY is nonzero, this level is the body of a function,
437 so create a block as if KEEP were set and also clear out all
440 If REVERSE is nonzero, reverse the order of decls before putting
441 them into the BLOCK. */
444 poplevel (int keep, int reverse, int functionbody)
446 /* Points to a BLOCK tree node. This is the BLOCK node constructed for the
447 binding level that we are about to exit and which is returned by this
449 tree block_node = NULL_TREE;
451 tree subblock_chain = current_binding_level->blocks;
454 /* Reverse the list of XXXX_DECL nodes if desired. Note that the ..._DECL
455 nodes chained through the `names' field of current_binding_level are in
456 reverse order except for PARM_DECL node, which are explicitly stored in
458 decl_chain = (reverse) ? nreverse (current_binding_level->names)
459 : current_binding_level->names;
461 /* If there were any declarations in the current binding level, or if this
462 binding level is a function body, or if there are any nested blocks then
463 create a BLOCK node to record them for the life of this function. */
464 if (keep || functionbody)
465 block_node = build_block (keep ? decl_chain : 0, subblock_chain, 0, 0);
467 /* Record the BLOCK node just built as the subblock its enclosing scope. */
468 for (subblock_node = subblock_chain; subblock_node;
469 subblock_node = TREE_CHAIN (subblock_node))
470 BLOCK_SUPERCONTEXT (subblock_node) = block_node;
472 /* Clear out the meanings of the local variables of this level. */
474 for (subblock_node = decl_chain; subblock_node;
475 subblock_node = TREE_CHAIN (subblock_node))
476 if (DECL_NAME (subblock_node) != 0)
477 /* If the identifier was used or addressed via a local extern decl,
478 don't forget that fact. */
479 if (DECL_EXTERNAL (subblock_node))
481 if (TREE_USED (subblock_node))
482 TREE_USED (DECL_NAME (subblock_node)) = 1;
483 if (TREE_ADDRESSABLE (subblock_node))
484 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (subblock_node)) = 1;
487 /* Pop the current level. */
488 current_binding_level = current_binding_level->level_chain;
492 /* This is the top level block of a function. The ..._DECL chain stored
493 in BLOCK_VARS are the function's parameters (PARM_DECL nodes). Don't
494 leave them in the BLOCK because they are found in the FUNCTION_DECL
496 DECL_INITIAL (current_function_decl) = block_node;
497 BLOCK_VARS (block_node) = 0;
501 current_binding_level->blocks
502 = chainon (current_binding_level->blocks, block_node);
505 /* If we did not make a block for the level just exited, any blocks made for
506 inner levels (since they cannot be recorded as subblocks in that level)
507 must be carried forward so they will later become subblocks of something
509 else if (subblock_chain)
510 current_binding_level->blocks
511 = chainon (current_binding_level->blocks, subblock_chain);
513 TREE_USED (block_node) = 1;
518 /* Insert BLOCK at the end of the list of subblocks of the
519 current binding level. This is used when a BIND_EXPR is expanded,
520 to handle the BLOCK node inside the BIND_EXPR. */
523 insert_block (tree block)
525 TREE_USED (block) = 1;
526 current_binding_level->blocks
527 = chainon (current_binding_level->blocks, block);
530 /* Records a ..._DECL node DECL as belonging to the current lexical scope.
531 Returns the ..._DECL node. */
536 /* External objects aren't nested, other objects may be. */
537 if ((DECL_EXTERNAL (decl)) || (decl == current_function_decl))
538 DECL_CONTEXT (decl) = 0;
540 DECL_CONTEXT (decl) = current_function_decl;
542 /* Put the declaration on the list. The list of declarations is in reverse
543 order. The list will be reversed later if necessary. This needs to be
544 this way for compatibility with the back-end. */
546 TREE_CHAIN (decl) = current_binding_level->names;
547 current_binding_level->names = decl;
549 /* For the declaration of a type, set its name if it is not already set. */
551 if (TREE_CODE (decl) == TYPE_DECL && TYPE_NAME (TREE_TYPE (decl)) == 0)
553 if (DECL_SOURCE_LINE (decl) == 0)
554 TYPE_NAME (TREE_TYPE (decl)) = decl;
556 TYPE_NAME (TREE_TYPE (decl)) = DECL_NAME (decl);
563 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL. */
566 pushdecl_top_level (tree x)
569 struct binding_level *b = current_binding_level;
571 current_binding_level = global_binding_level;
573 current_binding_level = b;
578 /* Clear the binding stack. */
580 gfc_clear_binding_stack (void)
582 while (!global_bindings_p ())
587 #ifndef CHAR_TYPE_SIZE
588 #define CHAR_TYPE_SIZE BITS_PER_UNIT
591 #ifndef INT_TYPE_SIZE
592 #define INT_TYPE_SIZE BITS_PER_WORD
596 #define SIZE_TYPE "long unsigned int"
598 /* Create tree nodes for the basic scalar types of Fortran 95,
599 and some nodes representing standard constants (0, 1, (void *) 0).
600 Initialize the global binding level.
601 Make definitions for built-in primitive functions. */
603 gfc_init_decl_processing (void)
605 current_function_decl = NULL;
606 current_binding_level = NULL_BINDING_LEVEL;
607 free_binding_level = NULL_BINDING_LEVEL;
609 /* Make the binding_level structure for global names. We move all
610 variables that are in a COMMON block to this binding level. */
612 global_binding_level = current_binding_level;
614 /* Build common tree nodes. char_type_node is unsigned because we
615 only use it for actual characters, not for INTEGER(1). Also, we
616 want double_type_node to actually have double precision. */
617 build_common_tree_nodes (false, false);
618 set_sizetype (long_unsigned_type_node);
619 build_common_tree_nodes_2 (0);
620 void_list_node = build_tree_list (NULL_TREE, void_type_node);
622 /* Set up F95 type nodes. */
627 /* Mark EXP saying that we need to be able to take the
628 address of it; it should not be allocated in a register.
629 In Fortran 95 this is only the case for variables with
630 the TARGET attribute, but we implement it here for a
631 likely future Cray pointer extension.
632 Value is 1 if successful. */
633 /* TODO: Check/fix mark_addressable. */
635 gfc_mark_addressable (tree exp)
637 register tree x = exp;
639 switch (TREE_CODE (x))
646 x = TREE_OPERAND (x, 0);
650 TREE_ADDRESSABLE (x) = 1;
657 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x) && DECL_NONLOCAL (x))
662 ("global register variable %qs used in nested function",
663 IDENTIFIER_POINTER (DECL_NAME (x)));
666 pedwarn ("register variable %qs used in nested function",
667 IDENTIFIER_POINTER (DECL_NAME (x)));
669 else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
673 error ("address of global register variable %qs requested",
674 IDENTIFIER_POINTER (DECL_NAME (x)));
679 /* If we are making this addressable due to its having
680 volatile components, give a different error message. Also
681 handle the case of an unnamed parameter by not trying
684 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x)))
686 error ("cannot put object with volatile field into register");
691 pedwarn ("address of register variable %qs requested",
692 IDENTIFIER_POINTER (DECL_NAME (x)));
697 TREE_ADDRESSABLE (x) = 1;
704 /* Return the typed-based alias set for T, which may be an expression
705 or a type. Return -1 if we don't do anything special. */
708 gfc_get_alias_set (tree t)
712 /* Permit type-punning when accessing an EQUIVALENCEd variable or
713 mixed type entry master's return value. */
714 for (u = t; handled_component_p (u); u = TREE_OPERAND (u, 0))
715 if (TREE_CODE (u) == COMPONENT_REF
716 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
722 /* press the big red button - garbage (ggc) collection is on */
726 /* Builtin function initialization. */
729 gfc_builtin_function (tree decl)
731 make_decl_rtl (decl);
738 gfc_define_builtin (const char * name,
741 const char * library_name,
746 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
747 library_name, NULL_TREE);
749 TREE_READONLY (decl) = 1;
751 built_in_decls[code] = decl;
752 implicit_built_in_decls[code] = decl;
756 #define DO_DEFINE_MATH_BUILTIN(code, name, argtype, tbase) \
757 gfc_define_builtin ("__builtin_" name "l", tbase##longdouble[argtype], \
758 BUILT_IN_ ## code ## L, name "l", true); \
759 gfc_define_builtin ("__builtin_" name, tbase##double[argtype], \
760 BUILT_IN_ ## code, name, true); \
761 gfc_define_builtin ("__builtin_" name "f", tbase##float[argtype], \
762 BUILT_IN_ ## code ## F, name "f", true);
764 #define DEFINE_MATH_BUILTIN(code, name, argtype) \
765 DO_DEFINE_MATH_BUILTIN (code, name, argtype, mfunc_)
767 #define DEFINE_MATH_BUILTIN_C(code, name, argtype) \
768 DO_DEFINE_MATH_BUILTIN (code, name, argtype, mfunc_) \
769 DO_DEFINE_MATH_BUILTIN (C##code, "c" name, argtype, mfunc_c)
772 /* Create function types for builtin functions. */
775 build_builtin_fntypes (tree * fntype, tree type)
779 /* type (*) (type) */
780 tmp = tree_cons (NULL_TREE, type, void_list_node);
781 fntype[0] = build_function_type (type, tmp);
782 /* type (*) (type, type) */
783 tmp = tree_cons (NULL_TREE, type, tmp);
784 fntype[1] = build_function_type (type, tmp);
785 /* type (*) (int, type) */
786 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
787 tmp = tree_cons (NULL_TREE, type, tmp);
788 fntype[2] = build_function_type (type, tmp);
792 builtin_type_for_size (int size, bool unsignedp)
794 tree type = lang_hooks.types.type_for_size (size, unsignedp);
795 return type ? type : error_mark_node;
798 /* Initialization of builtin function nodes. */
801 gfc_init_builtin_functions (void)
805 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
806 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
807 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
808 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
809 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
810 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
811 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
812 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
813 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
814 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
815 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
817 #undef DEF_PRIMITIVE_TYPE
818 #undef DEF_FUNCTION_TYPE_0
819 #undef DEF_FUNCTION_TYPE_1
820 #undef DEF_FUNCTION_TYPE_2
821 #undef DEF_FUNCTION_TYPE_3
822 #undef DEF_FUNCTION_TYPE_4
823 #undef DEF_FUNCTION_TYPE_5
824 #undef DEF_FUNCTION_TYPE_6
825 #undef DEF_FUNCTION_TYPE_7
826 #undef DEF_FUNCTION_TYPE_VAR_0
827 #undef DEF_POINTER_TYPE
830 typedef enum builtin_type builtin_type;
833 /* So far we need just these 2 attribute types. */
835 ATTR_CONST_NOTHROW_LIST
839 tree mfunc_double[3];
840 tree mfunc_longdouble[3];
841 tree mfunc_cfloat[3];
842 tree mfunc_cdouble[3];
843 tree mfunc_clongdouble[3];
844 tree func_cfloat_float;
845 tree func_cdouble_double;
846 tree func_clongdouble_longdouble;
849 tree builtin_types[(int) BT_LAST + 1];
851 build_builtin_fntypes (mfunc_float, float_type_node);
852 build_builtin_fntypes (mfunc_double, double_type_node);
853 build_builtin_fntypes (mfunc_longdouble, long_double_type_node);
854 build_builtin_fntypes (mfunc_cfloat, complex_float_type_node);
855 build_builtin_fntypes (mfunc_cdouble, complex_double_type_node);
856 build_builtin_fntypes (mfunc_clongdouble, complex_long_double_type_node);
858 tmp = tree_cons (NULL_TREE, complex_float_type_node, void_list_node);
859 func_cfloat_float = build_function_type (float_type_node, tmp);
861 tmp = tree_cons (NULL_TREE, complex_double_type_node, void_list_node);
862 func_cdouble_double = build_function_type (double_type_node, tmp);
864 tmp = tree_cons (NULL_TREE, complex_long_double_type_node, void_list_node);
865 func_clongdouble_longdouble =
866 build_function_type (long_double_type_node, tmp);
868 #include "mathbuiltins.def"
870 /* We define these separately as the fortran versions have different
871 semantics (they return an integer type) */
872 gfc_define_builtin ("__builtin_roundl", mfunc_longdouble[0],
873 BUILT_IN_ROUNDL, "roundl", true);
874 gfc_define_builtin ("__builtin_round", mfunc_double[0],
875 BUILT_IN_ROUND, "round", true);
876 gfc_define_builtin ("__builtin_roundf", mfunc_float[0],
877 BUILT_IN_ROUNDF, "roundf", true);
879 gfc_define_builtin ("__builtin_truncl", mfunc_longdouble[0],
880 BUILT_IN_TRUNCL, "truncl", true);
881 gfc_define_builtin ("__builtin_trunc", mfunc_double[0],
882 BUILT_IN_TRUNC, "trunc", true);
883 gfc_define_builtin ("__builtin_truncf", mfunc_float[0],
884 BUILT_IN_TRUNCF, "truncf", true);
886 gfc_define_builtin ("__builtin_cabsl", func_clongdouble_longdouble,
887 BUILT_IN_CABSL, "cabsl", true);
888 gfc_define_builtin ("__builtin_cabs", func_cdouble_double,
889 BUILT_IN_CABS, "cabs", true);
890 gfc_define_builtin ("__builtin_cabsf", func_cfloat_float,
891 BUILT_IN_CABSF, "cabsf", true);
893 gfc_define_builtin ("__builtin_copysignl", mfunc_longdouble[1],
894 BUILT_IN_COPYSIGNL, "copysignl", true);
895 gfc_define_builtin ("__builtin_copysign", mfunc_double[1],
896 BUILT_IN_COPYSIGN, "copysign", true);
897 gfc_define_builtin ("__builtin_copysignf", mfunc_float[1],
898 BUILT_IN_COPYSIGNF, "copysignf", true);
900 gfc_define_builtin ("__builtin_fmodl", mfunc_longdouble[1],
901 BUILT_IN_FMODL, "fmodl", true);
902 gfc_define_builtin ("__builtin_fmod", mfunc_double[1],
903 BUILT_IN_FMOD, "fmod", true);
904 gfc_define_builtin ("__builtin_fmodf", mfunc_float[1],
905 BUILT_IN_FMODF, "fmodf", true);
907 /* These are used to implement the ** operator. */
908 gfc_define_builtin ("__builtin_powl", mfunc_longdouble[1],
909 BUILT_IN_POWL, "powl", true);
910 gfc_define_builtin ("__builtin_pow", mfunc_double[1],
911 BUILT_IN_POW, "pow", true);
912 gfc_define_builtin ("__builtin_powf", mfunc_float[1],
913 BUILT_IN_POWF, "powf", true);
915 /* Other builtin functions we use. */
917 tmp = tree_cons (NULL_TREE, long_integer_type_node, void_list_node);
918 tmp = tree_cons (NULL_TREE, long_integer_type_node, tmp);
919 ftype = build_function_type (long_integer_type_node, tmp);
920 gfc_define_builtin ("__builtin_expect", ftype, BUILT_IN_EXPECT,
921 "__builtin_expect", true);
923 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
924 builtin_types[(int) ENUM] = VALUE;
925 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
926 builtin_types[(int) ENUM] \
927 = build_function_type (builtin_types[(int) RETURN], \
929 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
930 builtin_types[(int) ENUM] \
931 = build_function_type (builtin_types[(int) RETURN], \
932 tree_cons (NULL_TREE, \
933 builtin_types[(int) ARG1], \
935 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
936 builtin_types[(int) ENUM] \
937 = build_function_type \
938 (builtin_types[(int) RETURN], \
939 tree_cons (NULL_TREE, \
940 builtin_types[(int) ARG1], \
941 tree_cons (NULL_TREE, \
942 builtin_types[(int) ARG2], \
944 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
945 builtin_types[(int) ENUM] \
946 = build_function_type \
947 (builtin_types[(int) RETURN], \
948 tree_cons (NULL_TREE, \
949 builtin_types[(int) ARG1], \
950 tree_cons (NULL_TREE, \
951 builtin_types[(int) ARG2], \
952 tree_cons (NULL_TREE, \
953 builtin_types[(int) ARG3], \
955 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
956 builtin_types[(int) ENUM] \
957 = build_function_type \
958 (builtin_types[(int) RETURN], \
959 tree_cons (NULL_TREE, \
960 builtin_types[(int) ARG1], \
961 tree_cons (NULL_TREE, \
962 builtin_types[(int) ARG2], \
965 builtin_types[(int) ARG3], \
966 tree_cons (NULL_TREE, \
967 builtin_types[(int) ARG4], \
969 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
970 builtin_types[(int) ENUM] \
971 = build_function_type \
972 (builtin_types[(int) RETURN], \
973 tree_cons (NULL_TREE, \
974 builtin_types[(int) ARG1], \
975 tree_cons (NULL_TREE, \
976 builtin_types[(int) ARG2], \
979 builtin_types[(int) ARG3], \
980 tree_cons (NULL_TREE, \
981 builtin_types[(int) ARG4], \
982 tree_cons (NULL_TREE, \
983 builtin_types[(int) ARG5],\
984 void_list_node))))));
985 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
987 builtin_types[(int) ENUM] \
988 = build_function_type \
989 (builtin_types[(int) RETURN], \
990 tree_cons (NULL_TREE, \
991 builtin_types[(int) ARG1], \
992 tree_cons (NULL_TREE, \
993 builtin_types[(int) ARG2], \
996 builtin_types[(int) ARG3], \
999 builtin_types[(int) ARG4], \
1000 tree_cons (NULL_TREE, \
1001 builtin_types[(int) ARG5], \
1002 tree_cons (NULL_TREE, \
1003 builtin_types[(int) ARG6],\
1004 void_list_node)))))));
1005 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
1007 builtin_types[(int) ENUM] \
1008 = build_function_type \
1009 (builtin_types[(int) RETURN], \
1010 tree_cons (NULL_TREE, \
1011 builtin_types[(int) ARG1], \
1012 tree_cons (NULL_TREE, \
1013 builtin_types[(int) ARG2], \
1016 builtin_types[(int) ARG3], \
1019 builtin_types[(int) ARG4], \
1020 tree_cons (NULL_TREE, \
1021 builtin_types[(int) ARG5], \
1022 tree_cons (NULL_TREE, \
1023 builtin_types[(int) ARG6],\
1024 tree_cons (NULL_TREE, \
1025 builtin_types[(int) ARG6], \
1026 void_list_node))))))));
1027 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
1028 builtin_types[(int) ENUM] \
1029 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
1030 #define DEF_POINTER_TYPE(ENUM, TYPE) \
1031 builtin_types[(int) ENUM] \
1032 = build_pointer_type (builtin_types[(int) TYPE]);
1033 #include "types.def"
1034 #undef DEF_PRIMITIVE_TYPE
1035 #undef DEF_FUNCTION_TYPE_1
1036 #undef DEF_FUNCTION_TYPE_2
1037 #undef DEF_FUNCTION_TYPE_3
1038 #undef DEF_FUNCTION_TYPE_4
1039 #undef DEF_FUNCTION_TYPE_5
1040 #undef DEF_FUNCTION_TYPE_6
1041 #undef DEF_FUNCTION_TYPE_VAR_0
1042 #undef DEF_POINTER_TYPE
1043 builtin_types[(int) BT_LAST] = NULL_TREE;
1045 /* Initialize synchronization builtins. */
1046 #undef DEF_SYNC_BUILTIN
1047 #define DEF_SYNC_BUILTIN(code, name, type, attr) \
1048 gfc_define_builtin (name, builtin_types[type], code, name, \
1049 attr == ATTR_CONST_NOTHROW_LIST);
1050 #include "../sync-builtins.def"
1051 #undef DEF_SYNC_BUILTIN
1053 if (gfc_option.flag_openmp)
1055 #undef DEF_GOMP_BUILTIN
1056 #define DEF_GOMP_BUILTIN(code, name, type, attr) \
1057 gfc_define_builtin ("__builtin_" name, builtin_types[type], \
1058 code, name, attr == ATTR_CONST_NOTHROW_LIST);
1059 #include "../omp-builtins.def"
1060 #undef DEF_GOMP_BUILTIN
1063 gfc_define_builtin ("__builtin_trap", builtin_types[BT_FN_VOID],
1064 BUILT_IN_TRAP, NULL, false);
1065 TREE_THIS_VOLATILE (built_in_decls[BUILT_IN_TRAP]) = 1;
1067 build_common_builtin_nodes ();
1068 targetm.init_builtins ();
1071 #undef DEFINE_MATH_BUILTIN_C
1072 #undef DEFINE_MATH_BUILTIN
1074 #include "gt-fortran-f95-lang.h"
1075 #include "gtype-fortran.h"