1 /* Procedure integration for GCC.
2 Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
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
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 COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
33 #include "insn-config.h"
37 #include "integrate.h"
46 #include "langhooks.h"
47 #include "tree-pass.h"
50 /* Round to the next highest integer that meets the alignment. */
51 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
54 /* Private type used by {get/has}_hard_reg_initial_val. */
55 typedef struct initial_value_pair
GTY(()) {
59 typedef struct initial_value_struct
GTY(()) {
62 initial_value_pair
* GTY ((length ("%h.num_entries"))) entries
;
63 } initial_value_struct
;
65 static void set_block_origin_self (tree
);
66 static void set_block_abstract_flags (tree
, int);
69 /* Return false if the function FNDECL cannot be inlined on account of its
70 attributes, true otherwise. */
72 function_attribute_inlinable_p (const_tree fndecl
)
74 if (targetm
.attribute_table
)
78 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
80 const_tree name
= TREE_PURPOSE (a
);
83 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
84 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
85 return targetm
.function_attribute_inlinable_p (fndecl
);
92 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
93 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
94 that it points to the node itself, thus indicating that the node is its
95 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
96 the given node is NULL, recursively descend the decl/block tree which
97 it is the root of, and for each other ..._DECL or BLOCK node contained
98 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
99 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
100 values to point to themselves. */
103 set_block_origin_self (tree stmt
)
105 if (BLOCK_ABSTRACT_ORIGIN (stmt
) == NULL_TREE
)
107 BLOCK_ABSTRACT_ORIGIN (stmt
) = stmt
;
112 for (local_decl
= BLOCK_VARS (stmt
);
113 local_decl
!= NULL_TREE
;
114 local_decl
= TREE_CHAIN (local_decl
))
115 set_decl_origin_self (local_decl
); /* Potential recursion. */
121 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
122 subblock
!= NULL_TREE
;
123 subblock
= BLOCK_CHAIN (subblock
))
124 set_block_origin_self (subblock
); /* Recurse. */
129 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
130 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
131 node to so that it points to the node itself, thus indicating that the
132 node represents its own (abstract) origin. Additionally, if the
133 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
134 the decl/block tree of which the given node is the root of, and for
135 each other ..._DECL or BLOCK node contained therein whose
136 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
137 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
138 point to themselves. */
141 set_decl_origin_self (tree decl
)
143 if (DECL_ABSTRACT_ORIGIN (decl
) == NULL_TREE
)
145 DECL_ABSTRACT_ORIGIN (decl
) = decl
;
146 if (TREE_CODE (decl
) == FUNCTION_DECL
)
150 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
151 DECL_ABSTRACT_ORIGIN (arg
) = arg
;
152 if (DECL_INITIAL (decl
) != NULL_TREE
153 && DECL_INITIAL (decl
) != error_mark_node
)
154 set_block_origin_self (DECL_INITIAL (decl
));
159 /* Given a pointer to some BLOCK node, and a boolean value to set the
160 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
161 the given block, and for all local decls and all local sub-blocks
162 (recursively) which are contained therein. */
165 set_block_abstract_flags (tree stmt
, int setting
)
170 BLOCK_ABSTRACT (stmt
) = setting
;
172 for (local_decl
= BLOCK_VARS (stmt
);
173 local_decl
!= NULL_TREE
;
174 local_decl
= TREE_CHAIN (local_decl
))
175 set_decl_abstract_flags (local_decl
, setting
);
177 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
178 subblock
!= NULL_TREE
;
179 subblock
= BLOCK_CHAIN (subblock
))
180 set_block_abstract_flags (subblock
, setting
);
183 /* Given a pointer to some ..._DECL node, and a boolean value to set the
184 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
185 given decl, and (in the case where the decl is a FUNCTION_DECL) also
186 set the abstract flags for all of the parameters, local vars, local
187 blocks and sub-blocks (recursively) to the same setting. */
190 set_decl_abstract_flags (tree decl
, int setting
)
192 DECL_ABSTRACT (decl
) = setting
;
193 if (TREE_CODE (decl
) == FUNCTION_DECL
)
197 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
198 DECL_ABSTRACT (arg
) = setting
;
199 if (DECL_INITIAL (decl
) != NULL_TREE
200 && DECL_INITIAL (decl
) != error_mark_node
)
201 set_block_abstract_flags (DECL_INITIAL (decl
), setting
);
205 /* Functions to keep track of the values hard regs had at the start of
209 get_hard_reg_initial_reg (struct function
*fun
, rtx reg
)
211 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
217 for (i
= 0; i
< ivs
->num_entries
; i
++)
218 if (rtx_equal_p (ivs
->entries
[i
].pseudo
, reg
))
219 return ivs
->entries
[i
].hard_reg
;
224 /* Make sure that there's a pseudo register of mode MODE that stores the
225 initial value of hard register REGNO. Return an rtx for such a pseudo. */
228 get_hard_reg_initial_val (enum machine_mode mode
, unsigned int regno
)
230 struct initial_value_struct
*ivs
;
233 rv
= has_hard_reg_initial_val (mode
, regno
);
237 ivs
= cfun
->hard_reg_initial_vals
;
240 ivs
= ggc_alloc (sizeof (initial_value_struct
));
241 ivs
->num_entries
= 0;
242 ivs
->max_entries
= 5;
243 ivs
->entries
= ggc_alloc (5 * sizeof (initial_value_pair
));
244 cfun
->hard_reg_initial_vals
= ivs
;
247 if (ivs
->num_entries
>= ivs
->max_entries
)
249 ivs
->max_entries
+= 5;
250 ivs
->entries
= ggc_realloc (ivs
->entries
,
252 * sizeof (initial_value_pair
));
255 ivs
->entries
[ivs
->num_entries
].hard_reg
= gen_rtx_REG (mode
, regno
);
256 ivs
->entries
[ivs
->num_entries
].pseudo
= gen_reg_rtx (mode
);
258 return ivs
->entries
[ivs
->num_entries
++].pseudo
;
261 /* See if get_hard_reg_initial_val has been used to create a pseudo
262 for the initial value of hard register REGNO in mode MODE. Return
263 the associated pseudo if so, otherwise return NULL. */
266 has_hard_reg_initial_val (enum machine_mode mode
, unsigned int regno
)
268 struct initial_value_struct
*ivs
;
271 ivs
= cfun
->hard_reg_initial_vals
;
273 for (i
= 0; i
< ivs
->num_entries
; i
++)
274 if (GET_MODE (ivs
->entries
[i
].hard_reg
) == mode
275 && REGNO (ivs
->entries
[i
].hard_reg
) == regno
)
276 return ivs
->entries
[i
].pseudo
;
282 emit_initial_value_sets (void)
284 struct initial_value_struct
*ivs
= cfun
->hard_reg_initial_vals
;
292 for (i
= 0; i
< ivs
->num_entries
; i
++)
293 emit_move_insn (ivs
->entries
[i
].pseudo
, ivs
->entries
[i
].hard_reg
);
297 emit_insn_at_entry (seq
);
301 struct rtl_opt_pass pass_initial_value_sets
=
305 "initvals", /* name */
307 emit_initial_value_sets
, /* execute */
310 0, /* static_pass_number */
312 0, /* properties_required */
313 0, /* properties_provided */
314 0, /* properties_destroyed */
315 0, /* todo_flags_start */
316 TODO_dump_func
/* todo_flags_finish */
320 /* If the backend knows where to allocate pseudos for hard
321 register initial values, register these allocations now. */
323 allocate_initial_values (rtx
*reg_equiv_memory_loc
)
325 if (targetm
.allocate_initial_value
)
327 struct initial_value_struct
*ivs
= cfun
->hard_reg_initial_vals
;
333 for (i
= 0; i
< ivs
->num_entries
; i
++)
335 int regno
= REGNO (ivs
->entries
[i
].pseudo
);
336 rtx x
= targetm
.allocate_initial_value (ivs
->entries
[i
].hard_reg
);
338 if (x
&& REG_N_SETS (REGNO (ivs
->entries
[i
].pseudo
)) <= 1)
341 reg_equiv_memory_loc
[regno
] = x
;
347 gcc_assert (REG_P (x
));
348 new_regno
= REGNO (x
);
349 reg_renumber
[regno
] = new_regno
;
350 /* Poke the regno right into regno_reg_rtx so that even
351 fixed regs are accepted. */
352 SET_REGNO (ivs
->entries
[i
].pseudo
, new_regno
);
353 /* Update global register liveness information. */
356 if (REGNO_REG_SET_P(df_get_live_in (bb
), regno
))
357 SET_REGNO_REG_SET (df_get_live_in (bb
), new_regno
);
358 if (REGNO_REG_SET_P(df_get_live_out (bb
), regno
))
359 SET_REGNO_REG_SET (df_get_live_out (bb
), new_regno
);
367 #include "gt-integrate.h"