Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/gcc/
H A Dcgraph.h118 struct cgraph_edge *callees;
119 struct cgraph_edge *callers;
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 *);
272 struct cgraph_edge *cgraph_edge (struct cgraph_node *, tree);
273 void cgraph_set_call_stmt (struct cgraph_edge *, tree);
[all …]
H A 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 *);
H A Dipa-prop.c333 ipa_callsite_param_count (struct cgraph_edge *cs) in ipa_callsite_param_count()
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()
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()
411 ipa_callsite_compute_count (struct cgraph_edge *cs) in ipa_callsite_compute_count()
431 ipa_callsite_compute_param (struct cgraph_edge *cs) in ipa_callsite_compute_param()
536 struct cgraph_edge *cs; in ipa_edges_create()
561 struct cgraph_edge *cs; in ipa_edges_free()
[all …]
H A Dcgraph.c313 struct cgraph_edge *
316 struct cgraph_edge *e, *e2; in cgraph_edge()
376 struct cgraph_edge *
380 struct cgraph_edge *edge = GGC_NEW (struct cgraph_edge); in cgraph_create_edge()
382 struct cgraph_edge *e; in cgraph_create_edge()
496 struct cgraph_edge *e; in cgraph_node_remove_callees()
516 struct cgraph_edge *e; in cgraph_node_remove_callers()
701 struct cgraph_edge *edge; in dump_cgraph_node()
1036 struct cgraph_edge *
1041 struct cgraph_edge *new; in cgraph_clone_edge()
[all …]
H A Dipa-inline.c195 static struct cgraph_edge *
226 struct cgraph_edge *e; in cgraph_estimate_growth()
257 struct cgraph_edge *e; in cgraph_check_inline_limits()
475 struct cgraph_edge *e; in update_callee_keys()
493 struct cgraph_edge *e; in lookup_recursive_calls()
518 struct cgraph_edge *e; in cgraph_find_cycles()
547 struct cgraph_edge *e; in cgraph_flatten_node()
579 struct cgraph_edge *e; in cgraph_decide_recursive_inlining()
700 struct cgraph_edge *e; in cgraph_set_inline_failed()
911 struct cgraph_edge *e; in cgraph_decide_inlining()
[all …]
H A 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()
H A 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()
H A Dcgraphunit.c640 struct cgraph_edge *e; in initialize_inline_failed()
707 struct cgraph_edge *e; in verify_cgraph_node()
799 struct cgraph_edge *e = cgraph_edge (node, stmt); in verify_cgraph_node()
1118 struct cgraph_edge *edge; in cgraph_finalize_compilation_unit()
1205 struct cgraph_edge *e; in cgraph_mark_functions_to_output()
1281 cgraph_inline_p (struct cgraph_edge *e, const char **reason) in cgraph_inline_p()
1769 struct cgraph_edge *e; in update_call_expr()
1792 struct cgraph_edge *e, *new_e; in cgraph_copy_node_for_versioning()
1793 struct cgraph_edge *next_callee; in cgraph_copy_node_for_versioning()
1908 struct cgraph_edge *e; in save_inline_function_body()
H A 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()
H A 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()
H A Dipa-utils.c88 struct cgraph_edge *edge; in searchc()
H A Dipa-reference.c618 struct cgraph_edge *e; in propagate_bits()
688 struct cgraph_edge *e; in merge_callee_local_info()
H A Dipa-pure-const.c658 struct cgraph_edge *e; in static_execute()
H A DChangeLog.tree-ssa3324 * cgraph.h (cgraph_edge): Replace inline_call by inline_failed
4315 (cgraph_edge): New function
4319 * cgraph.h (cgraph_edge): Add call_expr argument; add chain_next.
H A DChangeLog-200517165 (cgraph_edge): Rename expr to stmt.
17178 (expand_call_inline): Pass statement to cgraph_edge and
17836 (cgraph_edge): Add count and loop_nest.
17837 (cgraph_node, cgraph_edge, cgraph_clone_edge, cgraph_clone_node):
30366 * cgraph.h (struct cgraph_edge): Add prev_caller and
H A DChangeLog-200314175 (struct cgraph_edge): Add inline_call.
16527 cgraph_node, cgraph_edge, cgraph_varpool_node, cgraph_nodes, cgraph_n_nodes,
31967 * cgraph.c (cgraph_node, cgraph_edge): Move into cgraph.h
H A DChangeLog-200436748 (cgraph_edge): New function.
36765 (dump_cgraph_node, cgraph_edge, cg4raph_clone_edge, cgraph_clone_node,
47764 * cgraph.h (cgraph_edge): Replace inline_call by inline_failed
H A DChangeLog-20062650 (cgraph_edge, cgraph_set_call_stmt, cgraph_create_edge,