]>
Commit | Line | Data |
---|---|---|
69dcadff | 1 | /* Default language-specific hooks. |
43577e6b | 2 | Copyright 2001, 2002 Free Software Foundation, Inc. |
69dcadff AO |
3 | Contributed by Alexandre Oliva <aoliva@redhat.com> |
4 | ||
54a7b573 | 5 | This file is part of GCC. |
69dcadff | 6 | |
54a7b573 | 7 | GCC is free software; you can redistribute it and/or modify |
69dcadff AO |
8 | it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2, or (at your option) | |
10 | any later version. | |
11 | ||
54a7b573 | 12 | GCC is distributed in the hope that it will be useful, |
69dcadff AO |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
54a7b573 | 18 | along with GCC; see the file COPYING. If not, write to |
69dcadff AO |
19 | the Free Software Foundation, 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
21 | ||
22 | #include "config.h" | |
23 | #include "system.h" | |
4977bab6 ZW |
24 | #include "coretypes.h" |
25 | #include "tm.h" | |
69dcadff AO |
26 | #include "toplev.h" |
27 | #include "tree.h" | |
28 | #include "tree-inline.h" | |
1affb409 JJ |
29 | #include "rtl.h" |
30 | #include "insn-config.h" | |
31 | #include "integrate.h" | |
29ac78d5 | 32 | #include "flags.h" |
59bee412 | 33 | #include "langhooks.h" |
d23c55c2 | 34 | #include "langhooks-def.h" |
59bee412 | 35 | |
77b1a921 | 36 | /* Do nothing; in many cases the default hook. */ |
8ac61af7 | 37 | |
77b1a921 | 38 | void |
d23c55c2 | 39 | lhd_do_nothing () |
77b1a921 NB |
40 | { |
41 | } | |
42 | ||
b03e38e1 | 43 | /* Do nothing (tree). */ |
63e1b1c4 NB |
44 | |
45 | void | |
46 | lhd_do_nothing_t (t) | |
47 | tree t ATTRIBUTE_UNUSED; | |
48 | { | |
49 | } | |
50 | ||
ff45c01e NB |
51 | /* Do nothing (int). */ |
52 | ||
53 | void | |
54 | lhd_do_nothing_i (i) | |
55 | int i ATTRIBUTE_UNUSED; | |
56 | { | |
57 | } | |
58 | ||
b03e38e1 NB |
59 | /* Do nothing (function). */ |
60 | ||
61 | void | |
62 | lhd_do_nothing_f (f) | |
63 | struct function *f ATTRIBUTE_UNUSED; | |
64 | { | |
65 | } | |
66 | ||
ac79cd5a RK |
67 | /* Do nothing (return the tree node passed). */ |
68 | ||
69 | tree | |
70 | lhd_return_tree (t) | |
71 | tree t; | |
72 | { | |
73 | return t; | |
74 | } | |
75 | ||
c88770e9 NB |
76 | /* Do nothing (return NULL_TREE). */ |
77 | ||
78 | tree | |
79 | lhd_return_null_tree (t) | |
80 | tree t ATTRIBUTE_UNUSED; | |
81 | { | |
82 | return NULL_TREE; | |
83 | } | |
84 | ||
4bfec483 NB |
85 | /* The default post options hook. */ |
86 | ||
87 | bool | |
88 | lhd_post_options (pfilename) | |
89 | const char **pfilename ATTRIBUTE_UNUSED; | |
90 | { | |
91 | return false; | |
92 | } | |
93 | ||
5d69f816 NB |
94 | /* Called from by print-tree.c. */ |
95 | ||
96 | void | |
97 | lhd_print_tree_nothing (file, node, indent) | |
98 | FILE *file ATTRIBUTE_UNUSED; | |
99 | tree node ATTRIBUTE_UNUSED; | |
100 | int indent ATTRIBUTE_UNUSED; | |
101 | { | |
ac79cd5a RK |
102 | } |
103 | ||
104 | /* Called from safe_from_p. */ | |
105 | ||
106 | int | |
107 | lhd_safe_from_p (x, exp) | |
f80230c1 RK |
108 | rtx x ATTRIBUTE_UNUSED; |
109 | tree exp ATTRIBUTE_UNUSED; | |
ac79cd5a RK |
110 | { |
111 | return 1; | |
d062a680 JM |
112 | } |
113 | ||
48a7a235 NB |
114 | /* Called from unsafe_for_reeval. */ |
115 | ||
116 | int | |
117 | lhd_unsafe_for_reeval (t) | |
118 | tree t ATTRIBUTE_UNUSED; | |
119 | { | |
120 | return -1; | |
121 | } | |
122 | ||
d062a680 JM |
123 | /* Called from staticp. */ |
124 | ||
125 | int | |
126 | lhd_staticp (exp) | |
990290e8 | 127 | tree exp ATTRIBUTE_UNUSED; |
d062a680 JM |
128 | { |
129 | return 0; | |
5d69f816 NB |
130 | } |
131 | ||
ef4f94ac RH |
132 | /* Called from check_global_declarations. */ |
133 | ||
134 | bool | |
135 | lhd_warn_unused_global_decl (decl) | |
136 | tree decl; | |
137 | { | |
138 | /* This is what used to exist in check_global_declarations. Probably | |
139 | not many of these actually apply to non-C languages. */ | |
140 | ||
141 | if (TREE_CODE (decl) == FUNCTION_DECL && DECL_INLINE (decl)) | |
142 | return false; | |
143 | if (TREE_CODE (decl) == VAR_DECL && TREE_READONLY (decl)) | |
144 | return false; | |
145 | if (DECL_IN_SYSTEM_HEADER (decl)) | |
146 | return false; | |
147 | ||
148 | return true; | |
149 | } | |
150 | ||
599bba86 NB |
151 | /* Set the DECL_ASSEMBLER_NAME for DECL. */ |
152 | void | |
153 | lhd_set_decl_assembler_name (decl) | |
154 | tree decl; | |
155 | { | |
156 | /* The language-independent code should never use the | |
157 | DECL_ASSEMBLER_NAME for lots of DECLs. Only FUNCTION_DECLs and | |
158 | VAR_DECLs for variables with static storage duration need a real | |
159 | DECL_ASSEMBLER_NAME. */ | |
160 | if (TREE_CODE (decl) == FUNCTION_DECL | |
e11e816e KH |
161 | || (TREE_CODE (decl) == VAR_DECL |
162 | && (TREE_STATIC (decl) | |
163 | || DECL_EXTERNAL (decl) | |
599bba86 NB |
164 | || TREE_PUBLIC (decl)))) |
165 | /* By default, assume the name to use in assembly code is the | |
166 | same as that used in the source language. (That's correct | |
167 | for C, and GCC used to set DECL_ASSEMBLER_NAME to the same | |
168 | value as DECL_NAME in build_decl, so this choice provides | |
169 | backwards compatibility with existing front-ends. */ | |
170 | SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl)); | |
171 | else | |
172 | /* Nobody should ever be asking for the DECL_ASSEMBLER_NAME of | |
173 | these DECLs -- unless they're in language-dependent code, in | |
174 | which case set_decl_assembler_name hook should handle things. */ | |
175 | abort (); | |
176 | } | |
177 | ||
57ce46bb TT |
178 | /* By default we always allow bit-field based optimizations. */ |
179 | bool | |
180 | lhd_can_use_bit_fields_p () | |
181 | { | |
182 | return true; | |
183 | } | |
184 | ||
37207ee7 ZW |
185 | /* Provide a default routine to clear the binding stack. This is used |
186 | by languages that don't need to do anything special. */ | |
187 | void | |
d23c55c2 | 188 | lhd_clear_binding_stack () |
37207ee7 | 189 | { |
43577e6b | 190 | while (! (*lang_hooks.decls.global_bindings_p) ()) |
37207ee7 ZW |
191 | poplevel (0, 0, 0); |
192 | } | |
193 | ||
ab393bf1 NB |
194 | /* Type promotion for variable arguments. */ |
195 | tree | |
196 | lhd_type_promotes_to (type) | |
197 | tree type ATTRIBUTE_UNUSED; | |
198 | { | |
199 | abort (); | |
200 | } | |
201 | ||
7a228918 NB |
202 | /* Invalid use of an incomplete type. */ |
203 | void | |
204 | lhd_incomplete_type_error (value, type) | |
205 | tree value ATTRIBUTE_UNUSED, type; | |
206 | { | |
207 | if (TREE_CODE (type) == ERROR_MARK) | |
208 | return; | |
209 | ||
210 | abort (); | |
211 | } | |
212 | ||
37207ee7 ZW |
213 | /* Provide a default routine for alias sets that always returns -1. This |
214 | is used by languages that don't need to do anything special. */ | |
215 | ||
216 | HOST_WIDE_INT | |
d23c55c2 | 217 | lhd_get_alias_set (t) |
37207ee7 ZW |
218 | tree t ATTRIBUTE_UNUSED; |
219 | { | |
220 | return -1; | |
221 | } | |
222 | ||
8ac61af7 RK |
223 | /* Provide a hook routine for alias sets that always returns 0. This is |
224 | used by languages that haven't deal with alias sets yet. */ | |
225 | ||
226 | HOST_WIDE_INT | |
227 | hook_get_alias_set_0 (t) | |
228 | tree t ATTRIBUTE_UNUSED; | |
229 | { | |
230 | return 0; | |
231 | } | |
232 | ||
c9d892a8 NB |
233 | /* This is the default expand_expr function. */ |
234 | ||
235 | rtx | |
236 | lhd_expand_expr (t, r, mm, em) | |
237 | tree t ATTRIBUTE_UNUSED; | |
238 | rtx r ATTRIBUTE_UNUSED; | |
239 | enum machine_mode mm ATTRIBUTE_UNUSED; | |
240 | int em ATTRIBUTE_UNUSED; | |
241 | { | |
242 | abort (); | |
243 | } | |
244 | ||
7afff7cf NB |
245 | /* This is the default decl_printable_name function. */ |
246 | ||
247 | const char * | |
248 | lhd_decl_printable_name (decl, verbosity) | |
249 | tree decl; | |
250 | int verbosity ATTRIBUTE_UNUSED; | |
251 | { | |
252 | return IDENTIFIER_POINTER (DECL_NAME (decl)); | |
253 | } | |
254 | ||
69dcadff AO |
255 | /* lang_hooks.tree_inlining.walk_subtrees is called by walk_tree() |
256 | after handling common cases, but before walking code-specific | |
257 | sub-trees. If this hook is overridden for a language, it should | |
258 | handle language-specific tree codes, as well as language-specific | |
259 | information associated to common tree codes. If a tree node is | |
260 | completely handled within this function, it should set *SUBTREES to | |
261 | 0, so that generic handling isn't attempted. For language-specific | |
262 | tree codes, generic handling would abort(), so make sure it is set | |
cc2902df | 263 | properly. Both SUBTREES and *SUBTREES is guaranteed to be nonzero |
69dcadff AO |
264 | when the function is called. */ |
265 | ||
266 | tree | |
d23c55c2 | 267 | lhd_tree_inlining_walk_subtrees (tp,subtrees,func,data,htab) |
69dcadff AO |
268 | tree *tp ATTRIBUTE_UNUSED; |
269 | int *subtrees ATTRIBUTE_UNUSED; | |
270 | walk_tree_fn func ATTRIBUTE_UNUSED; | |
271 | void *data ATTRIBUTE_UNUSED; | |
272 | void *htab ATTRIBUTE_UNUSED; | |
273 | { | |
274 | return NULL_TREE; | |
275 | } | |
276 | ||
277 | /* lang_hooks.tree_inlining.cannot_inline_tree_fn is called to | |
278 | determine whether there are language-specific reasons for not | |
279 | inlining a given function. */ | |
280 | ||
281 | int | |
d23c55c2 | 282 | lhd_tree_inlining_cannot_inline_tree_fn (fnp) |
6aa77e6c | 283 | tree *fnp; |
69dcadff | 284 | { |
2cb921f4 | 285 | if (flag_really_no_inline |
6aa77e6c AH |
286 | && lookup_attribute ("always_inline", DECL_ATTRIBUTES (*fnp)) == NULL) |
287 | return 1; | |
288 | ||
69dcadff AO |
289 | return 0; |
290 | } | |
291 | ||
292 | /* lang_hooks.tree_inlining.disregard_inline_limits is called to | |
293 | determine whether a function should be considered for inlining even | |
294 | if it would exceed inlining limits. */ | |
295 | ||
296 | int | |
d23c55c2 | 297 | lhd_tree_inlining_disregard_inline_limits (fn) |
6aa77e6c | 298 | tree fn; |
69dcadff | 299 | { |
6aa77e6c AH |
300 | if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)) != NULL) |
301 | return 1; | |
302 | ||
69dcadff AO |
303 | return 0; |
304 | } | |
305 | ||
306 | /* lang_hooks.tree_inlining.add_pending_fn_decls is called before | |
307 | starting to inline a function, to push any language-specific | |
308 | functions that should not be inlined into the current function, | |
309 | into VAFNP. PFN is the top of varray, and should be returned if no | |
310 | functions are pushed into VAFNP. The top of the varray should be | |
311 | returned. */ | |
312 | ||
313 | tree | |
d23c55c2 | 314 | lhd_tree_inlining_add_pending_fn_decls (vafnp, pfn) |
69dcadff AO |
315 | void *vafnp ATTRIBUTE_UNUSED; |
316 | tree pfn; | |
317 | { | |
318 | return pfn; | |
319 | } | |
320 | ||
321 | /* lang_hooks.tree_inlining.tree_chain_matters_p indicates whether the | |
322 | TREE_CHAIN of a language-specific tree node is relevant, i.e., | |
323 | whether it should be walked, copied and preserved across copies. */ | |
324 | ||
325 | int | |
d23c55c2 | 326 | lhd_tree_inlining_tree_chain_matters_p (t) |
69dcadff AO |
327 | tree t ATTRIBUTE_UNUSED; |
328 | { | |
329 | return 0; | |
330 | } | |
331 | ||
332 | /* lang_hooks.tree_inlining.auto_var_in_fn_p is called to determine | |
333 | whether VT is an automatic variable defined in function FT. */ | |
334 | ||
335 | int | |
d23c55c2 | 336 | lhd_tree_inlining_auto_var_in_fn_p (var, fn) |
69dcadff AO |
337 | tree var, fn; |
338 | { | |
339 | return (DECL_P (var) && DECL_CONTEXT (var) == fn | |
340 | && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL) | |
341 | && ! TREE_STATIC (var)) | |
342 | || TREE_CODE (var) == LABEL_DECL | |
343 | || TREE_CODE (var) == RESULT_DECL)); | |
344 | } | |
345 | ||
346 | /* lang_hooks.tree_inlining.copy_res_decl_for_inlining should return a | |
347 | declaration for the result RES of function FN to be inlined into | |
348 | CALLER. NDP points to an integer that should be set in case a new | |
349 | declaration wasn't created (presumably because RES was of aggregate | |
350 | type, such that a TARGET_EXPR is used for the result). TEXPS is a | |
351 | pointer to a varray with the stack of TARGET_EXPRs seen while | |
352 | inlining functions into caller; the top of TEXPS is supposed to | |
353 | match RES. */ | |
354 | ||
355 | tree | |
d23c55c2 | 356 | lhd_tree_inlining_copy_res_decl_for_inlining (res, fn, caller, |
4977bab6 | 357 | dm, ndp, return_slot_addr) |
69dcadff AO |
358 | tree res, fn, caller; |
359 | void *dm ATTRIBUTE_UNUSED; | |
360 | int *ndp ATTRIBUTE_UNUSED; | |
4977bab6 | 361 | tree return_slot_addr ATTRIBUTE_UNUSED; |
69dcadff | 362 | { |
4977bab6 ZW |
363 | if (return_slot_addr) |
364 | return build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (return_slot_addr)), | |
365 | return_slot_addr); | |
366 | else | |
367 | return copy_decl_for_inlining (res, fn, caller); | |
69dcadff AO |
368 | } |
369 | ||
370 | /* lang_hooks.tree_inlining.anon_aggr_type_p determines whether T is a | |
371 | type node representing an anonymous aggregate (union, struct, etc), | |
372 | i.e., one whose members are in the same scope as the union itself. */ | |
373 | ||
374 | int | |
d23c55c2 | 375 | lhd_tree_inlining_anon_aggr_type_p (t) |
69dcadff AO |
376 | tree t ATTRIBUTE_UNUSED; |
377 | { | |
378 | return 0; | |
379 | } | |
380 | ||
742a37d5 JM |
381 | /* lang_hooks.tree_inlining.start_inlining and end_inlining perform any |
382 | language-specific bookkeeping necessary for processing | |
cc2902df | 383 | FN. start_inlining returns nonzero if inlining should proceed, zero if |
742a37d5 JM |
384 | not. |
385 | ||
386 | For instance, the C++ version keeps track of template instantiations to | |
387 | avoid infinite recursion. */ | |
388 | ||
389 | int | |
390 | lhd_tree_inlining_start_inlining (fn) | |
391 | tree fn ATTRIBUTE_UNUSED; | |
392 | { | |
393 | return 1; | |
394 | } | |
395 | ||
396 | void | |
397 | lhd_tree_inlining_end_inlining (fn) | |
398 | tree fn ATTRIBUTE_UNUSED; | |
399 | { | |
400 | } | |
401 | ||
f735a153 JJ |
402 | /* lang_hooks.tree_inlining.convert_parm_for_inlining performs any |
403 | language-specific conversion before assigning VALUE to PARM. */ | |
404 | ||
405 | tree | |
406 | lhd_tree_inlining_convert_parm_for_inlining (parm, value, fndecl) | |
407 | tree parm ATTRIBUTE_UNUSED; | |
408 | tree value; | |
409 | tree fndecl ATTRIBUTE_UNUSED; | |
410 | { | |
411 | return value; | |
412 | } | |
413 | ||
e11e816e | 414 | /* lang_hooks.tree_dump.dump_tree: Dump language-specific parts of tree |
cc2902df | 415 | nodes. Returns nonzero if it does not want the usual dumping of the |
89d684bb BM |
416 | second argument. */ |
417 | ||
2bd3ecad | 418 | bool |
89d684bb BM |
419 | lhd_tree_dump_dump_tree (di, t) |
420 | void *di ATTRIBUTE_UNUSED; | |
421 | tree t ATTRIBUTE_UNUSED; | |
422 | { | |
2bd3ecad | 423 | return false; |
89d684bb BM |
424 | } |
425 | ||
e11e816e | 426 | /* lang_hooks.tree_dump.type_qual: Determine type qualifiers in a |
89d684bb BM |
427 | language-specific way. */ |
428 | ||
429 | int | |
430 | lhd_tree_dump_type_quals (t) | |
431 | tree t; | |
432 | { | |
433 | return TYPE_QUALS (t); | |
434 | } | |
a77a9a18 JM |
435 | |
436 | /* lang_hooks.expr_size: Determine the size of the value of an expression T | |
437 | in a language-specific way. Returns a tree for the size in bytes. */ | |
438 | ||
439 | tree | |
440 | lhd_expr_size (exp) | |
441 | tree exp; | |
442 | { | |
443 | if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'd' | |
444 | && DECL_SIZE_UNIT (exp) != 0) | |
445 | return DECL_SIZE_UNIT (exp); | |
446 | else | |
447 | return size_in_bytes (TREE_TYPE (exp)); | |
448 | } | |
2f51bb1d | 449 | |
d78e771d ZW |
450 | /* lang_hooks.tree_size: Determine the size of a tree with code C, |
451 | which is a language-specific tree code in category 'x'. The | |
452 | default expects never to be called. */ | |
453 | size_t | |
454 | lhd_tree_size (c) | |
455 | enum tree_code c ATTRIBUTE_UNUSED; | |
456 | { | |
457 | abort (); | |
458 | return 0; | |
459 | } | |
460 | ||
e076f71a AH |
461 | /* Return true if decl, which is a function decl, may be called by a |
462 | sibcall. */ | |
463 | ||
464 | bool | |
465 | lhd_decl_ok_for_sibcall (decl) | |
466 | tree decl ATTRIBUTE_UNUSED; | |
467 | { | |
468 | return true; | |
469 | } | |
470 | ||
2f51bb1d | 471 | /* lang_hooks.decls.final_write_globals: perform final processing on |
3dc575ff | 472 | global variables. */ |
2f51bb1d MA |
473 | void |
474 | write_global_declarations () | |
475 | { | |
476 | /* Really define vars that have had only a tentative definition. | |
477 | Really output inline functions that must actually be callable | |
478 | and have not been output so far. */ | |
479 | ||
480 | tree globals = (*lang_hooks.decls.getdecls) (); | |
481 | int len = list_length (globals); | |
482 | tree *vec = (tree *) xmalloc (sizeof (tree) * len); | |
483 | int i; | |
484 | tree decl; | |
485 | ||
486 | /* Process the decls in reverse order--earliest first. | |
487 | Put them into VEC from back to front, then take out from front. */ | |
488 | ||
489 | for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl)) | |
490 | vec[len - i - 1] = decl; | |
491 | ||
492 | wrapup_global_declarations (vec, len); | |
493 | ||
494 | check_global_declarations (vec, len); | |
495 | ||
496 | /* Clean up. */ | |
497 | free (vec); | |
498 | } |