1 #ifndef GCC_COMMON_H_INCLUDED
2 #define GCC_COMMON_H_INCLUDED
5 #if BUILDING_GCC_VERSION >= 6000
6 #include "gcc-plugin.h"
10 #include "plugin-version.h"
13 #include "coretypes.h"
19 #include "tree-inline.h"
24 #include "hard-reg-set.h"
29 #include "basic-block.h"
34 #if BUILDING_GCC_VERSION < 10000
38 #if BUILDING_GCC_VERSION <= 4009
39 #include "pointer-set.h"
44 #if BUILDING_GCC_VERSION >= 7000
50 #include "langhooks.h"
55 #if BUILDING_GCC_VERSION == 4005
59 #if BUILDING_GCC_VERSION >= 4007
60 #include "tree-pretty-print.h"
61 #include "gimple-pretty-print.h"
64 #if BUILDING_GCC_VERSION >= 4006
65 #include "c-family/c-common.h"
70 #if BUILDING_GCC_VERSION <= 4008
71 #include "tree-flow.h"
73 #include "tree-cfgcleanup.h"
74 #include "tree-ssa-operands.h"
75 #include "tree-into-ssa.h"
78 #if BUILDING_GCC_VERSION >= 4008
82 #include "diagnostic.h"
83 #include "tree-dump.h"
84 #include "tree-pass.h"
86 #include "ipa-utils.h"
88 #if BUILDING_GCC_VERSION >= 4009
91 #include "stor-layout.h"
92 #include "internal-fn.h"
93 #include "gimple-expr.h"
94 #include "gimple-fold.h"
96 #include "tree-ssa-alias.h"
98 #include "stringpool.h"
99 #if BUILDING_GCC_VERSION >= 7000
100 #include "tree-vrp.h"
102 #include "tree-ssanames.h"
103 #include "print-tree.h"
106 #include "gimplify.h"
111 #if BUILDING_GCC_VERSION >= 4009
112 #include "tree-ssa-operands.h"
113 #include "tree-phinodes.h"
114 #include "tree-cfg.h"
115 #include "gimple-iterator.h"
116 #include "gimple-ssa.h"
117 #include "ssa-iterators.h"
120 #if BUILDING_GCC_VERSION >= 5000
121 #include "builtins.h"
124 /* #include "expr.h" where are you... */
125 extern rtx emit_move_insn(rtx x, rtx y);
127 /* missing from basic_block.h... */
128 extern void debug_dominance_info(enum cdi_direction dir);
129 extern void debug_dominance_tree(enum cdi_direction dir, basic_block root);
131 #if BUILDING_GCC_VERSION == 4006
132 extern void debug_gimple_stmt(gimple);
133 extern void debug_gimple_seq(gimple_seq);
134 extern void print_gimple_seq(FILE *, gimple_seq, int, int);
135 extern void print_gimple_stmt(FILE *, gimple, int, int);
136 extern void print_gimple_expr(FILE *, gimple, int, int);
137 extern void dump_gimple_stmt(pretty_printer *, gimple, int, int);
141 #define __unused __attribute__((__unused__))
144 #define __visible __attribute__((visibility("default")))
147 #define DECL_NAME_POINTER(node) IDENTIFIER_POINTER(DECL_NAME(node))
148 #define DECL_NAME_LENGTH(node) IDENTIFIER_LENGTH(DECL_NAME(node))
149 #define TYPE_NAME_POINTER(node) IDENTIFIER_POINTER(TYPE_NAME(node))
150 #define TYPE_NAME_LENGTH(node) IDENTIFIER_LENGTH(TYPE_NAME(node))
152 /* should come from c-tree.h if only it were installed for gcc 4.5... */
153 #define C_TYPE_FIELDS_READONLY(TYPE) TREE_LANG_FLAG_1(TYPE)
155 #if BUILDING_GCC_VERSION == 4005
156 #define FOR_EACH_LOCAL_DECL(FUN, I, D) \
157 for (tree vars = (FUN)->local_decls, (I) = 0; \
158 vars && ((D) = TREE_VALUE(vars)); \
159 vars = TREE_CHAIN(vars), (I)++)
160 #define DECL_CHAIN(NODE) (TREE_CHAIN(DECL_MINIMAL_CHECK(NODE)))
161 #define FOR_EACH_VEC_ELT(T, V, I, P) \
162 for (I = 0; VEC_iterate(T, (V), (I), (P)); ++(I))
163 #define TODO_rebuild_cgraph_edges 0
164 #define SCOPE_FILE_SCOPE_P(EXP) (!(EXP))
170 typedef struct varpool_node *varpool_node_ptr;
172 static inline bool gimple_call_builtin_p(gimple stmt, enum built_in_function code)
176 if (!is_gimple_call(stmt))
178 fndecl = gimple_call_fndecl(stmt);
179 if (!fndecl || DECL_BUILT_IN_CLASS(fndecl) != BUILT_IN_NORMAL)
181 return DECL_FUNCTION_CODE(fndecl) == code;
184 static inline bool is_simple_builtin(tree decl)
186 if (decl && DECL_BUILT_IN_CLASS(decl) != BUILT_IN_NORMAL)
189 switch (DECL_FUNCTION_CODE(decl)) {
190 /* Builtins that expand to constants. */
191 case BUILT_IN_CONSTANT_P:
192 case BUILT_IN_EXPECT:
193 case BUILT_IN_OBJECT_SIZE:
194 case BUILT_IN_UNREACHABLE:
195 /* Simple register moves or loads from stack. */
196 case BUILT_IN_RETURN_ADDRESS:
197 case BUILT_IN_EXTRACT_RETURN_ADDR:
198 case BUILT_IN_FROB_RETURN_ADDR:
199 case BUILT_IN_RETURN:
200 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
201 case BUILT_IN_FRAME_ADDRESS:
202 case BUILT_IN_VA_END:
203 case BUILT_IN_STACK_SAVE:
204 case BUILT_IN_STACK_RESTORE:
205 /* Exception state returns or moves registers around. */
206 case BUILT_IN_EH_FILTER:
207 case BUILT_IN_EH_POINTER:
208 case BUILT_IN_EH_COPY_VALUES:
216 static inline void add_local_decl(struct function *fun, tree d)
218 gcc_assert(TREE_CODE(d) == VAR_DECL);
219 fun->local_decls = tree_cons(NULL_TREE, d, fun->local_decls);
223 #if BUILDING_GCC_VERSION <= 4006
224 #define ANY_RETURN_P(rtx) (GET_CODE(rtx) == RETURN)
225 #define C_DECL_REGISTER(EXP) DECL_LANG_FLAG_4(EXP)
226 #define EDGE_PRESERVE 0ULL
227 #define HOST_WIDE_INT_PRINT_HEX_PURE "%" HOST_WIDE_INT_PRINT "x"
228 #define flag_fat_lto_objects true
230 #define get_random_seed(noinit) ({ \
231 unsigned HOST_WIDE_INT seed; \
232 sscanf(get_random_seed(noinit), "%" HOST_WIDE_INT_PRINT "x", &seed); \
235 #define int_const_binop(code, arg1, arg2) \
236 int_const_binop((code), (arg1), (arg2), 0)
238 static inline bool gimple_clobber_p(gimple s __unused)
243 static inline bool gimple_asm_clobbers_memory_p(const_gimple stmt)
247 for (i = 0; i < gimple_asm_nclobbers(stmt); i++) {
248 tree op = gimple_asm_clobber_op(stmt, i);
250 if (!strcmp(TREE_STRING_POINTER(TREE_VALUE(op)), "memory"))
257 static inline tree builtin_decl_implicit(enum built_in_function fncode)
259 return implicit_built_in_decls[fncode];
262 static inline int ipa_reverse_postorder(struct cgraph_node **order)
264 return cgraph_postorder(order);
267 static inline struct cgraph_node *cgraph_create_node(tree decl)
269 return cgraph_node(decl);
272 static inline struct cgraph_node *cgraph_get_create_node(tree decl)
274 struct cgraph_node *node = cgraph_get_node(decl);
276 return node ? node : cgraph_node(decl);
279 static inline bool cgraph_function_with_gimple_body_p(struct cgraph_node *node)
281 return node->analyzed && !node->thunk.thunk_p && !node->alias;
284 static inline struct cgraph_node *cgraph_first_function_with_gimple_body(void)
286 struct cgraph_node *node;
288 for (node = cgraph_nodes; node; node = node->next)
289 if (cgraph_function_with_gimple_body_p(node))
294 static inline struct cgraph_node *cgraph_next_function_with_gimple_body(struct cgraph_node *node)
296 for (node = node->next; node; node = node->next)
297 if (cgraph_function_with_gimple_body_p(node))
302 static inline bool cgraph_for_node_and_aliases(cgraph_node_ptr node, bool (*callback)(cgraph_node_ptr, void *), void *data, bool include_overwritable)
304 cgraph_node_ptr alias;
306 if (callback(node, data))
309 for (alias = node->same_body; alias; alias = alias->next) {
310 if (include_overwritable || cgraph_function_body_availability(alias) > AVAIL_OVERWRITABLE)
311 if (cgraph_for_node_and_aliases(alias, callback, data, include_overwritable))
318 #define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \
319 for ((node) = cgraph_first_function_with_gimple_body(); (node); \
320 (node) = cgraph_next_function_with_gimple_body(node))
322 static inline void varpool_add_new_variable(tree decl)
324 varpool_finalize_decl(decl);
328 #if BUILDING_GCC_VERSION <= 4007
329 #define FOR_EACH_FUNCTION(node) \
330 for (node = cgraph_nodes; node; node = node->next)
331 #define FOR_EACH_VARIABLE(node) \
332 for (node = varpool_nodes; node; node = node->next)
334 #define NODE_SYMBOL(node) (node)
335 #define NODE_DECL(node) (node)->decl
336 #define INSN_LOCATION(INSN) RTL_LOCATION(INSN)
339 static inline int bb_loop_depth(const_basic_block bb)
341 return bb->loop_father ? loop_depth(bb->loop_father) : 0;
344 static inline bool gimple_store_p(gimple gs)
346 tree lhs = gimple_get_lhs(gs);
348 return lhs && !is_gimple_reg(lhs);
351 static inline void gimple_init_singleton(gimple g __unused)
356 #if BUILDING_GCC_VERSION == 4007 || BUILDING_GCC_VERSION == 4008
357 static inline struct cgraph_node *cgraph_alias_target(struct cgraph_node *n)
359 return cgraph_alias_aliased_node(n);
363 #if BUILDING_GCC_VERSION >= 4007 && BUILDING_GCC_VERSION <= 4009
364 #define cgraph_create_edge(caller, callee, call_stmt, count, freq, nest) \
365 cgraph_create_edge((caller), (callee), (call_stmt), (count), (freq))
366 #define cgraph_create_edge_including_clones(caller, callee, old_call_stmt, call_stmt, count, freq, nest, reason) \
367 cgraph_create_edge_including_clones((caller), (callee), (old_call_stmt), (call_stmt), (count), (freq), (reason))
370 #if BUILDING_GCC_VERSION <= 4008
371 #define ENTRY_BLOCK_PTR_FOR_FN(FN) ENTRY_BLOCK_PTR_FOR_FUNCTION(FN)
372 #define EXIT_BLOCK_PTR_FOR_FN(FN) EXIT_BLOCK_PTR_FOR_FUNCTION(FN)
373 #define basic_block_info_for_fn(FN) ((FN)->cfg->x_basic_block_info)
374 #define n_basic_blocks_for_fn(FN) ((FN)->cfg->x_n_basic_blocks)
375 #define n_edges_for_fn(FN) ((FN)->cfg->x_n_edges)
376 #define last_basic_block_for_fn(FN) ((FN)->cfg->x_last_basic_block)
377 #define label_to_block_map_for_fn(FN) ((FN)->cfg->x_label_to_block_map)
378 #define profile_status_for_fn(FN) ((FN)->cfg->x_profile_status)
379 #define BASIC_BLOCK_FOR_FN(FN, N) BASIC_BLOCK_FOR_FUNCTION((FN), (N))
380 #define NODE_IMPLICIT_ALIAS(node) (node)->same_body_alias
381 #define VAR_P(NODE) (TREE_CODE(NODE) == VAR_DECL)
383 static inline bool tree_fits_shwi_p(const_tree t)
385 if (t == NULL_TREE || TREE_CODE(t) != INTEGER_CST)
388 if (TREE_INT_CST_HIGH(t) == 0 && (HOST_WIDE_INT)TREE_INT_CST_LOW(t) >= 0)
391 if (TREE_INT_CST_HIGH(t) == -1 && (HOST_WIDE_INT)TREE_INT_CST_LOW(t) < 0 && !TYPE_UNSIGNED(TREE_TYPE(t)))
397 static inline bool tree_fits_uhwi_p(const_tree t)
399 if (t == NULL_TREE || TREE_CODE(t) != INTEGER_CST)
402 return TREE_INT_CST_HIGH(t) == 0;
405 static inline HOST_WIDE_INT tree_to_shwi(const_tree t)
407 gcc_assert(tree_fits_shwi_p(t));
408 return TREE_INT_CST_LOW(t);
411 static inline unsigned HOST_WIDE_INT tree_to_uhwi(const_tree t)
413 gcc_assert(tree_fits_uhwi_p(t));
414 return TREE_INT_CST_LOW(t);
417 static inline const char *get_tree_code_name(enum tree_code code)
419 gcc_assert(code < MAX_TREE_CODES);
420 return tree_code_name[code];
423 #define ipa_remove_stmt_references(cnode, stmt)
425 typedef union gimple_statement_d gasm;
426 typedef union gimple_statement_d gassign;
427 typedef union gimple_statement_d gcall;
428 typedef union gimple_statement_d gcond;
429 typedef union gimple_statement_d gdebug;
430 typedef union gimple_statement_d ggoto;
431 typedef union gimple_statement_d gphi;
432 typedef union gimple_statement_d greturn;
434 static inline gasm *as_a_gasm(gimple stmt)
439 static inline const gasm *as_a_const_gasm(const_gimple stmt)
444 static inline gassign *as_a_gassign(gimple stmt)
449 static inline const gassign *as_a_const_gassign(const_gimple stmt)
454 static inline gcall *as_a_gcall(gimple stmt)
459 static inline const gcall *as_a_const_gcall(const_gimple stmt)
464 static inline gcond *as_a_gcond(gimple stmt)
469 static inline const gcond *as_a_const_gcond(const_gimple stmt)
474 static inline gdebug *as_a_gdebug(gimple stmt)
479 static inline const gdebug *as_a_const_gdebug(const_gimple stmt)
484 static inline ggoto *as_a_ggoto(gimple stmt)
489 static inline const ggoto *as_a_const_ggoto(const_gimple stmt)
494 static inline gphi *as_a_gphi(gimple stmt)
499 static inline const gphi *as_a_const_gphi(const_gimple stmt)
504 static inline greturn *as_a_greturn(gimple stmt)
509 static inline const greturn *as_a_const_greturn(const_gimple stmt)
515 #if BUILDING_GCC_VERSION == 4008
516 #define NODE_SYMBOL(node) (&(node)->symbol)
517 #define NODE_DECL(node) (node)->symbol.decl
520 #if BUILDING_GCC_VERSION >= 4008
521 #define add_referenced_var(var)
522 #define mark_sym_for_renaming(var)
523 #define varpool_mark_needed_node(node)
524 #define create_var_ann(var)
525 #define TODO_dump_func 0
526 #define TODO_dump_cgraph 0
529 #if BUILDING_GCC_VERSION <= 4009
530 #define TODO_verify_il 0
531 #define AVAIL_INTERPOSABLE AVAIL_OVERWRITABLE
533 #define section_name_prefix LTO_SECTION_NAME_PREFIX
534 #define fatal_error(loc, gmsgid, ...) fatal_error((gmsgid), __VA_ARGS__)
536 typedef struct rtx_def rtx_insn;
538 static inline const char *get_decl_section_name(const_tree decl)
540 if (DECL_SECTION_NAME(decl) == NULL_TREE)
543 return TREE_STRING_POINTER(DECL_SECTION_NAME(decl));
546 static inline void set_decl_section_name(tree node, const char *value)
549 DECL_SECTION_NAME(node) = build_string(strlen(value) + 1, value);
551 DECL_SECTION_NAME(node) = NULL;
555 #if BUILDING_GCC_VERSION == 4009
556 typedef struct gimple_statement_asm gasm;
557 typedef struct gimple_statement_base gassign;
558 typedef struct gimple_statement_call gcall;
559 typedef struct gimple_statement_base gcond;
560 typedef struct gimple_statement_base gdebug;
561 typedef struct gimple_statement_base ggoto;
562 typedef struct gimple_statement_phi gphi;
563 typedef struct gimple_statement_base greturn;
565 static inline gasm *as_a_gasm(gimple stmt)
567 return as_a<gasm>(stmt);
570 static inline const gasm *as_a_const_gasm(const_gimple stmt)
572 return as_a<const gasm>(stmt);
575 static inline gassign *as_a_gassign(gimple stmt)
580 static inline const gassign *as_a_const_gassign(const_gimple stmt)
585 static inline gcall *as_a_gcall(gimple stmt)
587 return as_a<gcall>(stmt);
590 static inline const gcall *as_a_const_gcall(const_gimple stmt)
592 return as_a<const gcall>(stmt);
595 static inline gcond *as_a_gcond(gimple stmt)
600 static inline const gcond *as_a_const_gcond(const_gimple stmt)
605 static inline gdebug *as_a_gdebug(gimple stmt)
610 static inline const gdebug *as_a_const_gdebug(const_gimple stmt)
615 static inline ggoto *as_a_ggoto(gimple stmt)
620 static inline const ggoto *as_a_const_ggoto(const_gimple stmt)
625 static inline gphi *as_a_gphi(gimple stmt)
627 return as_a<gphi>(stmt);
630 static inline const gphi *as_a_const_gphi(const_gimple stmt)
632 return as_a<const gphi>(stmt);
635 static inline greturn *as_a_greturn(gimple stmt)
640 static inline const greturn *as_a_const_greturn(const_gimple stmt)
646 #if BUILDING_GCC_VERSION >= 4009
647 #define TODO_ggc_collect 0
648 #define NODE_SYMBOL(node) (node)
649 #define NODE_DECL(node) (node)->decl
650 #define cgraph_node_name(node) (node)->name()
651 #define NODE_IMPLICIT_ALIAS(node) (node)->cpp_implicit_alias
654 #if BUILDING_GCC_VERSION >= 5000 && BUILDING_GCC_VERSION < 6000
658 inline bool is_a_helper<const gassign *>::test(const_gimple gs)
660 return gs->code == GIMPLE_ASSIGN;
664 #if BUILDING_GCC_VERSION >= 5000
665 #define TODO_verify_ssa TODO_verify_il
666 #define TODO_verify_flow TODO_verify_il
667 #define TODO_verify_stmts TODO_verify_il
668 #define TODO_verify_rtl_sharing TODO_verify_il
670 #define INSN_DELETED_P(insn) (insn)->deleted()
672 static inline const char *get_decl_section_name(const_tree decl)
674 return DECL_SECTION_NAME(decl);
677 /* symtab/cgraph related */
678 #define debug_cgraph_node(node) (node)->debug()
679 #define cgraph_get_node(decl) cgraph_node::get(decl)
680 #define cgraph_get_create_node(decl) cgraph_node::get_create(decl)
681 #define cgraph_create_node(decl) cgraph_node::create(decl)
682 #define cgraph_n_nodes symtab->cgraph_count
683 #define cgraph_max_uid symtab->cgraph_max_uid
684 #define varpool_get_node(decl) varpool_node::get(decl)
685 #define dump_varpool_node(file, node) (node)->dump(file)
687 #define cgraph_create_edge(caller, callee, call_stmt, count, freq, nest) \
688 (caller)->create_edge((callee), (call_stmt), (count), (freq))
689 #define cgraph_create_edge_including_clones(caller, callee, old_call_stmt, call_stmt, count, freq, nest, reason) \
690 (caller)->create_edge_including_clones((callee), (old_call_stmt), (call_stmt), (count), (freq), (reason))
692 typedef struct cgraph_node *cgraph_node_ptr;
693 typedef struct cgraph_edge *cgraph_edge_p;
694 typedef struct varpool_node *varpool_node_ptr;
696 static inline void change_decl_assembler_name(tree decl, tree name)
698 symtab->change_decl_assembler_name(decl, name);
701 static inline void varpool_finalize_decl(tree decl)
703 varpool_node::finalize_decl(decl);
706 static inline void varpool_add_new_variable(tree decl)
708 varpool_node::add(decl);
711 static inline unsigned int rebuild_cgraph_edges(void)
713 return cgraph_edge::rebuild_edges();
716 static inline cgraph_node_ptr cgraph_function_node(cgraph_node_ptr node, enum availability *availability)
718 return node->function_symbol(availability);
721 static inline cgraph_node_ptr cgraph_function_or_thunk_node(cgraph_node_ptr node, enum availability *availability = NULL)
723 return node->ultimate_alias_target(availability);
726 static inline bool cgraph_only_called_directly_p(cgraph_node_ptr node)
728 return node->only_called_directly_p();
731 static inline enum availability cgraph_function_body_availability(cgraph_node_ptr node)
733 return node->get_availability();
736 static inline cgraph_node_ptr cgraph_alias_target(cgraph_node_ptr node)
738 return node->get_alias_target();
741 static inline bool cgraph_for_node_and_aliases(cgraph_node_ptr node, bool (*callback)(cgraph_node_ptr, void *), void *data, bool include_overwritable)
743 return node->call_for_symbol_thunks_and_aliases(callback, data, include_overwritable);
746 static inline struct cgraph_node_hook_list *cgraph_add_function_insertion_hook(cgraph_node_hook hook, void *data)
748 return symtab->add_cgraph_insertion_hook(hook, data);
751 static inline void cgraph_remove_function_insertion_hook(struct cgraph_node_hook_list *entry)
753 symtab->remove_cgraph_insertion_hook(entry);
756 static inline struct cgraph_node_hook_list *cgraph_add_node_removal_hook(cgraph_node_hook hook, void *data)
758 return symtab->add_cgraph_removal_hook(hook, data);
761 static inline void cgraph_remove_node_removal_hook(struct cgraph_node_hook_list *entry)
763 symtab->remove_cgraph_removal_hook(entry);
766 static inline struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook(cgraph_2node_hook hook, void *data)
768 return symtab->add_cgraph_duplication_hook(hook, data);
771 static inline void cgraph_remove_node_duplication_hook(struct cgraph_2node_hook_list *entry)
773 symtab->remove_cgraph_duplication_hook(entry);
776 static inline void cgraph_call_node_duplication_hooks(cgraph_node_ptr node, cgraph_node_ptr node2)
778 symtab->call_cgraph_duplication_hooks(node, node2);
781 static inline void cgraph_call_edge_duplication_hooks(cgraph_edge *cs1, cgraph_edge *cs2)
783 symtab->call_edge_duplication_hooks(cs1, cs2);
786 #if BUILDING_GCC_VERSION >= 6000
787 typedef gimple *gimple_ptr;
788 typedef const gimple *const_gimple_ptr;
789 #define gimple gimple_ptr
790 #define const_gimple const_gimple_ptr
791 #undef CONST_CAST_GIMPLE
792 #define CONST_CAST_GIMPLE(X) CONST_CAST(gimple, (X))
796 static inline gimple gimple_build_assign_with_ops(enum tree_code subcode, tree lhs, tree op1, tree op2 MEM_STAT_DECL)
798 return gimple_build_assign(lhs, subcode, op1, op2 PASS_MEM_STAT);
801 #if BUILDING_GCC_VERSION < 10000
804 inline bool is_a_helper<const ggoto *>::test(const_gimple gs)
806 return gs->code == GIMPLE_GOTO;
811 inline bool is_a_helper<const greturn *>::test(const_gimple gs)
813 return gs->code == GIMPLE_RETURN;
817 static inline gasm *as_a_gasm(gimple stmt)
819 return as_a<gasm *>(stmt);
822 static inline const gasm *as_a_const_gasm(const_gimple stmt)
824 return as_a<const gasm *>(stmt);
827 static inline gassign *as_a_gassign(gimple stmt)
829 return as_a<gassign *>(stmt);
832 static inline const gassign *as_a_const_gassign(const_gimple stmt)
834 return as_a<const gassign *>(stmt);
837 static inline gcall *as_a_gcall(gimple stmt)
839 return as_a<gcall *>(stmt);
842 static inline const gcall *as_a_const_gcall(const_gimple stmt)
844 return as_a<const gcall *>(stmt);
847 static inline ggoto *as_a_ggoto(gimple stmt)
849 return as_a<ggoto *>(stmt);
852 static inline const ggoto *as_a_const_ggoto(const_gimple stmt)
854 return as_a<const ggoto *>(stmt);
857 static inline gphi *as_a_gphi(gimple stmt)
859 return as_a<gphi *>(stmt);
862 static inline const gphi *as_a_const_gphi(const_gimple stmt)
864 return as_a<const gphi *>(stmt);
867 static inline greturn *as_a_greturn(gimple stmt)
869 return as_a<greturn *>(stmt);
872 static inline const greturn *as_a_const_greturn(const_gimple stmt)
874 return as_a<const greturn *>(stmt);
877 /* IPA/LTO related */
878 #define ipa_ref_list_referring_iterate(L, I, P) \
879 (L)->referring.iterate((I), &(P))
880 #define ipa_ref_list_reference_iterate(L, I, P) \
881 (L)->reference.iterate((I), &(P))
883 static inline cgraph_node_ptr ipa_ref_referring_node(struct ipa_ref *ref)
885 return dyn_cast<cgraph_node_ptr>(ref->referring);
888 static inline void ipa_remove_stmt_references(symtab_node *referring_node, gimple stmt)
890 referring_node->remove_stmt_references(stmt);
894 #if BUILDING_GCC_VERSION < 6000
895 #define get_inner_reference(exp, pbitsize, pbitpos, poffset, pmode, punsignedp, preversep, pvolatilep, keep_aligning) \
896 get_inner_reference(exp, pbitsize, pbitpos, poffset, pmode, punsignedp, pvolatilep, keep_aligning)
897 #define gen_rtx_set(ARG0, ARG1) gen_rtx_SET(VOIDmode, (ARG0), (ARG1))
900 #if BUILDING_GCC_VERSION >= 6000
901 #define gen_rtx_set(ARG0, ARG1) gen_rtx_SET((ARG0), (ARG1))
905 static inline void debug_tree(const_tree t)
907 debug_tree(CONST_CAST_TREE(t));
910 static inline void debug_gimple_stmt(const_gimple s)
912 debug_gimple_stmt(CONST_CAST_GIMPLE(s));
915 #define debug_tree(t) debug_tree(CONST_CAST_TREE(t))
916 #define debug_gimple_stmt(s) debug_gimple_stmt(CONST_CAST_GIMPLE(s))
919 #if BUILDING_GCC_VERSION >= 7000
920 #define get_inner_reference(exp, pbitsize, pbitpos, poffset, pmode, punsignedp, preversep, pvolatilep, keep_aligning) \
921 get_inner_reference(exp, pbitsize, pbitpos, poffset, pmode, punsignedp, preversep, pvolatilep)