Home
last modified time | relevance | path

Searched refs:cgraph_edge (Results 1 – 13 of 13) sorted by relevance

/openbsd/src/gnu/gcc/gcc/
Dcgraph.h118 struct cgraph_edge *callees;
119 struct cgraph_edge *callers;
138 htab_t GTY((param_is (struct cgraph_edge))) call_site_hash;
175 struct cgraph_edge GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller")))
179 struct cgraph_edge *prev_caller;
180 struct cgraph_edge *next_caller;
181 struct cgraph_edge *prev_callee;
182 struct cgraph_edge *next_callee;
194 typedef struct cgraph_edge *cgraph_edge_p;
264 void cgraph_remove_edge (struct cgraph_edge *);
[all …]
Dipa-prop.h170 int ipa_callsite_param_count (struct cgraph_edge *);
171 void ipa_callsite_param_count_set (struct cgraph_edge *, int);
172 struct ipa_jump_func *ipa_callsite_param (struct cgraph_edge *, int);
173 struct cgraph_node *ipa_callsite_callee (struct cgraph_edge *);
174 void ipa_callsite_compute_param (struct cgraph_edge *);
175 void ipa_callsite_compute_count (struct cgraph_edge *);
Dipa-prop.c333 ipa_callsite_param_count (struct cgraph_edge *cs) in ipa_callsite_param_count()
340 ipa_callsite_param_count_set (struct cgraph_edge *cs, int i) in ipa_callsite_param_count_set()
348 ipa_callsite_param (struct cgraph_edge *cs, int i) in ipa_callsite_param()
355 ipa_callsite_callee (struct cgraph_edge *cs) in ipa_callsite_callee()
363 ipa_callsite_param_set_type (struct cgraph_edge *cs, int i, in ipa_callsite_param_set_type()
372 ipa_callsite_param_set_info_type_formal (struct cgraph_edge *cs, int i, in ipa_callsite_param_set_info_type_formal()
381 ipa_callsite_param_set_info_type (struct cgraph_edge *cs, int i, tree info_type1) in ipa_callsite_param_set_info_type()
388 ipa_callsite_param_map_create (struct cgraph_edge *cs) in ipa_callsite_param_map_create()
396 ipa_callsite_tree (struct cgraph_edge *cs) in ipa_callsite_tree()
403 ipa_callsite_caller (struct cgraph_edge *cs) in ipa_callsite_caller()
[all …]
Dcgraph.c104 static inline void cgraph_edge_remove_caller (struct cgraph_edge *e);
105 static inline void cgraph_edge_remove_callee (struct cgraph_edge *e);
301 return htab_hash_pointer (((struct cgraph_edge *) x)->call_stmt); in edge_hash()
309 return ((struct cgraph_edge *) x)->call_stmt == y; in edge_eq()
313 struct cgraph_edge *
314 cgraph_edge (struct cgraph_node *node, tree call_stmt) in cgraph_edge() function
316 struct cgraph_edge *e, *e2; in cgraph_edge()
353 cgraph_set_call_stmt (struct cgraph_edge *e, tree new_stmt) in cgraph_set_call_stmt()
376 struct cgraph_edge *
380 struct cgraph_edge *edge = GGC_NEW (struct cgraph_edge); in cgraph_create_edge()
[all …]
Dipa-inline.c116 cgraph_clone_inlined_nodes (struct cgraph_edge *e, bool duplicate, bool update_original) in cgraph_clone_inlined_nodes()
156 cgraph_mark_inline_edge (struct cgraph_edge *e, bool update_original) in cgraph_mark_inline_edge()
195 static struct cgraph_edge *
196 cgraph_mark_inline (struct cgraph_edge *edge) in cgraph_mark_inline()
200 struct cgraph_edge *e, *next; in cgraph_mark_inline()
226 struct cgraph_edge *e; in cgraph_estimate_growth()
257 struct cgraph_edge *e; in cgraph_check_inline_limits()
363 cgraph_maybe_hot_edge_p (struct cgraph_edge *edge) in cgraph_maybe_hot_edge_p()
384 cgraph_edge_badness (struct cgraph_edge *edge) in cgraph_edge_badness()
422 struct cgraph_edge *edge; in update_caller_keys()
[all …]
Dipa.c36 struct cgraph_edge *edge, last; in cgraph_postorder()
130 struct cgraph_edge *e; in cgraph_remove_unreachable_nodes()
174 struct cgraph_edge *e; in cgraph_remove_unreachable_nodes()
Dipa-cp.c497 struct cgraph_edge *cs; in ipcp_method_compute_scale()
517 struct cgraph_edge *cs; in ipcp_init_stage()
579 struct cgraph_edge *cs; in ipcp_propagate_stage()
641 struct cgraph_edge *cs; in ipcp_callsite_param_print()
714 struct cgraph_edge *cs; in ipcp_profile_cs_count_print()
889 ipcp_redirect (struct cgraph_edge *cs) in ipcp_redirect()
923 struct cgraph_edge *cs; in ipcp_update_callgraph()
976 struct cgraph_edge *cs; in ipcp_update_profiling()
1010 struct cgraph_edge *cs; in ipcp_insert_stage()
Dtree-optimize.c384 struct cgraph_edge *e; in update_inlined_to_pointers()
431 struct cgraph_edge *e; in tree_rest_of_compilation()
446 struct cgraph_edge *e; in tree_rest_of_compilation()
Dcgraphunit.c626 struct cgraph_edge *e; in initialize_inline_failed()
693 struct cgraph_edge *e; in verify_cgraph_node()
785 struct cgraph_edge *e = cgraph_edge (node, stmt); in verify_cgraph_node()
1104 struct cgraph_edge *edge; in cgraph_finalize_compilation_unit()
1191 struct cgraph_edge *e; in cgraph_mark_functions_to_output()
1267 cgraph_inline_p (struct cgraph_edge *e, const char **reason) in cgraph_inline_p()
1755 struct cgraph_edge *e; in update_call_expr()
1778 struct cgraph_edge *e, *new_e; in cgraph_copy_node_for_versioning()
1779 struct cgraph_edge *next_callee; in cgraph_copy_node_for_versioning()
1894 struct cgraph_edge *e; in save_inline_function_body()
Dipa-utils.c88 struct cgraph_edge *edge; in searchc()
Dtree-inline.c724 struct cgraph_edge *edge; in copy_bb()
729 edge = cgraph_edge (id->src_node, orig_stmt); in copy_bb()
740 edge = cgraph_edge (node, orig_stmt); in copy_bb()
747 edge = cgraph_edge (id->dst_node, orig_stmt); in copy_bb()
1928 struct cgraph_edge *cg_edge; in expand_call_inline()
1978 cg_edge = cgraph_edge (id->dst_node, stmt); in expand_call_inline()
2264 struct cgraph_edge *e; in optimize_inline_calls()
Dipa-reference.c618 struct cgraph_edge *e; in propagate_bits()
688 struct cgraph_edge *e; in merge_callee_local_info()
Dipa-pure-const.c657 struct cgraph_edge *e; in static_execute()