1 /* Tree lowering pass. This pass gimplifies the tree representation built
2 by the C-based front ends. The structure of gimplified, or
3 language-independent, trees is dictated by the grammar described in this
5 Copyright (C) 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010
6 Free Software Foundation, Inc.
7 Lowering of expressions contributed by Sebastian Pop <s.pop@laposte.net>
8 Re-written to support lowering of whole function trees, documentation
9 and miscellaneous cleanups by Diego Novillo <dnovillo@redhat.com>
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it under
14 the terms of the GNU General Public License as published by the Free
15 Software Foundation; either version 3, or (at your option) any later
18 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
19 WARRANTY; without even the implied warranty of MERCHANTABILITY or
20 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
34 #include "basic-block.h"
35 #include "tree-inline.h"
36 #include "diagnostic-core.h"
37 #include "langhooks.h"
38 #include "langhooks-def.h"
41 #include "tree-dump.h"
42 #include "c-pretty-print.h"
46 /* The gimplification pass converts the language-dependent trees
47 (ld-trees) emitted by the parser into language-independent trees
48 (li-trees) that are the target of SSA analysis and transformations.
50 Language-independent trees are based on the SIMPLE intermediate
51 representation used in the McCAT compiler framework:
53 "Designing the McCAT Compiler Based on a Family of Structured
54 Intermediate Representations,"
55 L. Hendren, C. Donawa, M. Emami, G. Gao, Justiani, and B. Sridharan,
56 Proceedings of the 5th International Workshop on Languages and
57 Compilers for Parallel Computing, no. 757 in Lecture Notes in
58 Computer Science, New Haven, Connecticut, pp. 406-420,
59 Springer-Verlag, August 3-5, 1992.
61 http://www-acaps.cs.mcgill.ca/info/McCAT/McCAT.html
63 Basically, we walk down gimplifying the nodes that we encounter. As we
64 walk back up, we check that they fit our constraints, and copy them
65 into temporaries if not. */
67 /* Gimplification of statement trees. */
69 /* Convert the tree representation of FNDECL from C frontend trees to
73 c_genericize (tree fndecl
)
77 struct cgraph_node
*cgn
;
79 /* Dump the C-specific tree IR. */
80 dump_orig
= dump_begin (TDI_original
, &local_dump_flags
);
83 fprintf (dump_orig
, "\n;; Function %s",
84 lang_hooks
.decl_printable_name (fndecl
, 2));
85 fprintf (dump_orig
, " (%s)\n",
86 (!DECL_ASSEMBLER_NAME_SET_P (fndecl
) ? "null"
87 : IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
))));
88 fprintf (dump_orig
, ";; enabled by -%s\n", dump_flag_name (TDI_original
));
89 fprintf (dump_orig
, "\n");
91 if (local_dump_flags
& TDF_RAW
)
92 dump_node (DECL_SAVED_TREE (fndecl
),
93 TDF_SLIM
| local_dump_flags
, dump_orig
);
95 print_c_tree (dump_orig
, DECL_SAVED_TREE (fndecl
));
96 fprintf (dump_orig
, "\n");
98 dump_end (TDI_original
, dump_orig
);
101 /* Dump all nested functions now. */
102 cgn
= cgraph_node (fndecl
);
103 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
104 c_genericize (cgn
->decl
);
108 add_block_to_enclosing (tree block
)
113 VEC(gimple
, heap
) *stack
= gimple_bind_expr_stack ();
115 for (i
= 0; VEC_iterate (gimple
, stack
, i
, bind
); i
++)
116 if (gimple_bind_block (bind
))
119 enclosing
= gimple_bind_block (bind
);
120 BLOCK_SUBBLOCKS (enclosing
) = chainon (BLOCK_SUBBLOCKS (enclosing
), block
);
123 /* Genericize a scope by creating a new BIND_EXPR.
124 BLOCK is either a BLOCK representing the scope or a chain of _DECLs.
125 In the latter case, we need to create a new BLOCK and add it to the
126 BLOCK_SUBBLOCKS of the enclosing block.
127 BODY is a chain of C _STMT nodes for the contents of the scope, to be
131 c_build_bind_expr (location_t loc
, tree block
, tree body
)
135 if (block
== NULL_TREE
)
137 else if (TREE_CODE (block
) == BLOCK
)
138 decls
= BLOCK_VARS (block
);
142 if (DECL_ARTIFICIAL (decls
))
146 block
= make_node (BLOCK
);
147 BLOCK_VARS (block
) = decls
;
148 add_block_to_enclosing (block
);
153 body
= build_empty_stmt (loc
);
156 bind
= build3 (BIND_EXPR
, void_type_node
, decls
, body
, block
);
157 TREE_SIDE_EFFECTS (bind
) = 1;
158 SET_EXPR_LOCATION (bind
, loc
);
166 /* Gimplification of expression trees. */
168 /* Do C-specific gimplification on *EXPR_P. PRE_P and POST_P are as in
172 c_gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p ATTRIBUTE_UNUSED
,
173 gimple_seq
*post_p ATTRIBUTE_UNUSED
)
175 enum tree_code code
= TREE_CODE (*expr_p
);
177 /* This is handled mostly by gimplify.c, but we have to deal with
178 not warning about int x = x; as it is a GCC extension to turn off
179 this warning but only if warn_init_self is zero. */
180 if (code
== DECL_EXPR
181 && TREE_CODE (DECL_EXPR_DECL (*expr_p
)) == VAR_DECL
182 && !DECL_EXTERNAL (DECL_EXPR_DECL (*expr_p
))
183 && !TREE_STATIC (DECL_EXPR_DECL (*expr_p
))
184 && (DECL_INITIAL (DECL_EXPR_DECL (*expr_p
)) == DECL_EXPR_DECL (*expr_p
))
186 TREE_NO_WARNING (DECL_EXPR_DECL (*expr_p
)) = 1;