cgraph_edge (reference) in projects: netbsd-src

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

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

12 3 4 5 6

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A D	ipa-inline.h	45 int estimate_size_after_inlining (struct cgraph_node , struct cgraph_edge ); 47 bool growth_positive_p (struct cgraph_node , struct cgraph_edge , int); 48 int do_estimate_edge_size (struct cgraph_edge edge); 49 sreal do_estimate_edge_time (struct cgraph_edge edge, sreal nonspec_time = NULL); 50 ipa_hints do_estimate_edge_hints (struct cgraph_edge edge); 61 bool inline_call (struct cgraph_edge , bool, vec<cgraph_edge > , int , bool, 64 void clone_inlined_nodes (struct cgraph_edge e, bool, bool, int ); 73 estimate_edge_size (struct cgraph_edge edge) in estimate_edge_size() 86 estimate_min_edge_growth (struct cgraph_edge edge) in estimate_min_edge_growth() 96 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth() [all …]
H A D	cgraph.cc	325 symbol_table::call_edge_removal_hooks (cgraph_edge e) in call_edge_removal_hooks() 449 symbol_table::call_edge_duplication_hooks (cgraph_edge cs1, cgraph_edge cs2) in call_edge_duplication_hooks() 677 cgraph_edge_hasher::hash (cgraph_edge e) in hash() 697 cgraph_edge_hasher::equal (cgraph_edge x, gimple y) in equal() 705 cgraph_update_edge_in_call_site_hash (cgraph_edge e) in cgraph_update_edge_in_call_site_hash() 715 cgraph_add_edge_to_call_site_hash (cgraph_edge e) in cgraph_add_edge_to_call_site_hash() 721 cgraph_edge *slot = e->caller->call_site_hash->find_slot_with_hash in cgraph_add_edge_to_call_site_hash() 725 gcc_assert (((cgraph_edge )slot)->speculative); in cgraph_add_edge_to_call_site_hash() 739 cgraph_edge 742 cgraph_edge e, e2; in get_edge() [all …]
H A D	cgraph.h	859 struct cgraph_edge; 861 struct cgraph_edge_hasher : ggc_ptr_hash<cgraph_edge> 865 static hashval_t hash (cgraph_edge ); 867 static bool equal (cgraph_edge , gimple ); 957 vec<cgraph_edge > redirect_callers, 966 cgraph_node create_virtual_clone (const vec<cgraph_edge > &redirect_callers, 993 vec<cgraph_edge > redirect_callers, 1024 (vec<cgraph_edge > redirect_callers, 1134 cgraph_edge create_edge (cgraph_node callee, 1141 cgraph_edge create_indirect_edge (gcall call_stmt, int ecf_flags, [all …]
H A D	ipa-inline-transform.cc	65 struct cgraph_edge e; in update_noncloned_counts() 86 can_remove_node_now_p_1 (struct cgraph_node node, struct cgraph_edge e) in can_remove_node_now_p_1() 121 can_remove_node_now_p (struct cgraph_node node, struct cgraph_edge e) in can_remove_node_now_p() 168 clone_inlined_nodes (struct cgraph_edge e, bool duplicate, in clone_inlined_nodes() 172 struct cgraph_edge next; in clone_inlined_nodes() 255 check_speculations_1 (cgraph_node n, vec<cgraph_edge > new_edges, in check_speculations_1() 256 hash_set <cgraph_edge > edge_set) in check_speculations_1() 259 cgraph_edge next; in check_speculations_1() 261 for (cgraph_edge e = n->callees; e; e = next) in check_speculations_1() 270 cgraph_edge::resolve_speculation (e, NULL); in check_speculations_1() [all …]
H A D	cgraphclones.cc	94 cgraph_edge * 95 cgraph_edge::clone (cgraph_node n, gcall call_stmt, unsigned stmt_uid, in clone() 99 cgraph_edge new_edge; in clone() 196 cgraph_edge cs; in duplicate_thunk_for_node() 260 cgraph_edge e = new_thunk->create_edge (node, NULL, new_thunk->count); in duplicate_thunk_for_node() 272 cgraph_edge::redirect_callee_duplicating_thunks (cgraph_node n) in redirect_callee_duplicating_thunks() 287 cgraph_edge e; in expand_all_artificial_thunks() 335 for (cgraph_edge e = n->callees; e; e=e->next_callee) in localize_profile() 341 for (cgraph_edge e = n->indirect_calls; e; e=e->next_callee) in localize_profile() 368 vec<cgraph_edge > redirect_callers, in create_clone() [all …]
H A D	symbol-summary.h	582 virtual void remove (cgraph_edge , T ) {} 585 virtual void duplicate (cgraph_edge , cgraph_edge , T , T ) 698 T* get_create (cgraph_edge edge) 709 T get (cgraph_edge edge) ATTRIBUTE_PURE 717 void remove (cgraph_edge edge) 729 bool exists (cgraph_edge edge) 735 static void symtab_removal (cgraph_edge edge, void data); 738 static void symtab_duplication (cgraph_edge edge1, cgraph_edge edge2, 776 call_summary<T >::symtab_removal (cgraph_edge edge, void data) 784 call_summary<T >::symtab_duplication (cgraph_edge edge1, [all …]
H A D	ipa-inline.cc	123 typedef fibonacci_heap <sreal, cgraph_edge> edge_heap_t; 124 typedef fibonacci_node <sreal, cgraph_edge> edge_heap_node_t; 145 caller_growth_limits (struct cgraph_edge e) in caller_growth_limits() 228 report_inline_failed_reason (struct cgraph_edge e) in report_inline_failed_reason() 321 can_inline_edge_p (struct cgraph_edge e, bool report, in can_inline_edge_p() 456 can_inline_edge_by_limits_p (struct cgraph_edge e, bool report, in can_inline_edge_by_limits_p() 622 can_early_inline_edge_p (struct cgraph_edge e) in can_early_inline_edge_p() 668 struct cgraph_edge e; in num_calls() 681 want_early_inline_function_p (struct cgraph_edge e) in want_early_inline_function_p() 765 compute_uninlined_call_time (struct cgraph_edge edge, in compute_uninlined_call_time() [all …]
H A D	ipa-inline-analysis.cc	101 initialize_inline_failed (struct cgraph_edge e) in initialize_inline_failed() 157 simple_edge_hints (struct cgraph_edge edge) in simple_edge_hints() 183 do_estimate_edge_time (struct cgraph_edge edge, sreal ret_nonspec_time) in do_estimate_edge_time() 297 ipa_remove_from_growth_caches (struct cgraph_edge edge) in ipa_remove_from_growth_caches() 309 do_estimate_edge_size (struct cgraph_edge edge) in do_estimate_edge_size() 343 do_estimate_edge_hints (struct cgraph_edge edge) in do_estimate_edge_hints() 377 struct cgraph_edge edge) in estimate_size_after_inlining() 406 struct cgraph_edge e; in do_estimate_growth_1() 486 int min_size, struct cgraph_edge known_edge) in check_callers() 493 for (cgraph_edge *e = node->callers; e; e = e->next_caller) in check_callers() [all …]
H A D	ipa-utils.cc	81 bool (ignore_edge) (struct cgraph_edge )) in searchc() 83 struct cgraph_edge edge; in searchc() 164 bool (ignore_edge) (struct cgraph_edge )) in ipa_reduced_postorder() 252 ipa_edge_within_scc (struct cgraph_edge cs) in ipa_edge_within_scc() 267 struct cgraph_edge edge; 281 struct cgraph_edge edge; in ipa_reverse_postorder() 381 struct cgraph_edge e; in scale_ipa_profile_for_fn() 527 struct cgraph_edge e, e2; in ipa_merge_profiles() 610 struct cgraph_edge e, *e2; in ipa_merge_profiles() 691 cgraph_edge::resolve_speculation (e, NULL); in ipa_merge_profiles() [all …]
H A D	ipa-prop.h	710 vec<cgraph_edge > cg_edges; 1053 void remove (cgraph_edge edge) in class() 1059 virtual void remove (cgraph_edge cs, ipa_edge_args args); in class() 1061 virtual void duplicate (cgraph_edge src, in class() 1062 cgraph_edge dst, in class() 1128 ipa_edge_args_info_available_for_edge_p (struct cgraph_edge edge) in ipa_edge_args_info_available_for_edge_p() 1153 bool ipa_propagate_indirect_call_infos (struct cgraph_edge cs, 1154 vec<cgraph_edge > new_edges); 1157 tree ipa_get_indirect_edge_target (struct cgraph_edge ie, 1160 tree ipa_get_indirect_edge_target (struct cgraph_edge ie, [all …]
H A D	ipa-cp.cc	142 cgraph_edge cs; 215 void add_source (cgraph_edge cs, ipcp_value src_val, int src_idx, 260 bool add_value (valtype newval, cgraph_edge cs, 673 for (cgraph_edge edge = node->callees; !reason && edge; in determine_versionability() 744 struct cgraph_edge cs; in gather_caller_stats() 882 ignore_edge_p (cgraph_edge e) in ignore_edge_p() 1242 for (cgraph_edge cs = node->callers; cs; cs = cs->next_caller) in count_callers() 1256 cgraph_edge cs = node->callers; in set_single_call_flag() 1275 struct cgraph_edge ie; in initialize_node_lattices() 1565 ipa_context_from_jfunc (ipa_node_params info, cgraph_edge cs, int csidx, in ipa_context_from_jfunc() [all …]
H A D	ipa-fnsummary.h	`314 virtual void duplicate (cgraph_edge src, cgraph_edge dst, 417 void ipa_merge_fn_summary_after_inlining (struct cgraph_edge edge); 424 void evaluate_properties_for_edge (struct cgraph_edge e, 433 void ipa_remove_from_growth_caches (struct cgraph_edge edge); 438 cross_module_call_p (struct cgraph_edge edge) in cross_module_call_p()`
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A D	ipa-inline.h	45 int estimate_size_after_inlining (struct cgraph_node , struct cgraph_edge ); 47 bool growth_positive_p (struct cgraph_node , struct cgraph_edge , int); 48 int do_estimate_edge_size (struct cgraph_edge edge); 49 sreal do_estimate_edge_time (struct cgraph_edge edge, sreal nonspec_time = NULL); 50 ipa_hints do_estimate_edge_hints (struct cgraph_edge edge); 61 bool inline_call (struct cgraph_edge , bool, vec<cgraph_edge > , int , bool, 64 void clone_inlined_nodes (struct cgraph_edge e, bool, bool, int ); 73 estimate_edge_size (struct cgraph_edge edge) in estimate_edge_size() 86 estimate_min_edge_growth (struct cgraph_edge edge) in estimate_min_edge_growth() 96 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth() [all …]
H A D	cgraph.c	322 symbol_table::call_edge_removal_hooks (cgraph_edge e) in call_edge_removal_hooks() 446 symbol_table::call_edge_duplication_hooks (cgraph_edge cs1, cgraph_edge cs2) in call_edge_duplication_hooks() 669 cgraph_edge_hasher::hash (cgraph_edge e) in hash() 689 cgraph_edge_hasher::equal (cgraph_edge x, gimple y) in equal() 697 cgraph_update_edge_in_call_site_hash (cgraph_edge e) in cgraph_update_edge_in_call_site_hash() 707 cgraph_add_edge_to_call_site_hash (cgraph_edge e) in cgraph_add_edge_to_call_site_hash() 713 cgraph_edge *slot = e->caller->call_site_hash->find_slot_with_hash in cgraph_add_edge_to_call_site_hash() 717 gcc_assert (((cgraph_edge )slot)->speculative); in cgraph_add_edge_to_call_site_hash() 731 cgraph_edge 734 cgraph_edge e, e2; in get_edge() [all …]
H A D	cgraph.h	906 struct cgraph_edge; 908 struct cgraph_edge_hasher : ggc_ptr_hash<cgraph_edge> 912 static hashval_t hash (cgraph_edge ); 914 static bool equal (cgraph_edge , gimple ); 1000 vec<cgraph_edge > redirect_callers, 1009 cgraph_node create_virtual_clone (vec<cgraph_edge > redirect_callers, 1036 vec<cgraph_edge > redirect_callers, 1064 (vec<cgraph_edge > redirect_callers, 1182 cgraph_edge create_edge (cgraph_node callee, 1189 cgraph_edge create_indirect_edge (gcall call_stmt, int ecf_flags, [all …]
H A D	ipa-inline-transform.c	61 struct cgraph_edge e; in update_noncloned_counts() 82 can_remove_node_now_p_1 (struct cgraph_node node, struct cgraph_edge e) in can_remove_node_now_p_1() 117 can_remove_node_now_p (struct cgraph_node node, struct cgraph_edge e) in can_remove_node_now_p() 164 clone_inlined_nodes (struct cgraph_edge e, bool duplicate, in clone_inlined_nodes() 168 struct cgraph_edge next; in clone_inlined_nodes() 246 check_speculations_1 (cgraph_node n, vec<cgraph_edge > new_edges, in check_speculations_1() 247 hash_set <cgraph_edge > edge_set) in check_speculations_1() 250 cgraph_edge next; in check_speculations_1() 252 for (cgraph_edge e = n->callees; e; e = next) in check_speculations_1() 261 cgraph_edge::resolve_speculation (e, NULL); in check_speculations_1() [all …]
H A D	cgraphclones.c	92 cgraph_edge * 93 cgraph_edge::clone (cgraph_node n, gcall call_stmt, unsigned stmt_uid, in clone() 97 cgraph_edge new_edge; in clone() 192 cgraph_edge cs; in duplicate_thunk_for_node() 254 cgraph_edge e = new_thunk->create_edge (node, NULL, new_thunk->count); in duplicate_thunk_for_node() 266 cgraph_edge::redirect_callee_duplicating_thunks (cgraph_node n) in redirect_callee_duplicating_thunks() 281 cgraph_edge e; in expand_all_artificial_thunks() 329 for (cgraph_edge e = n->callees; e; e=e->next_callee) in localize_profile() 335 for (cgraph_edge e = n->indirect_calls; e; e=e->next_callee) in localize_profile() 362 vec<cgraph_edge > redirect_callers, in create_clone() [all …]
H A D	symbol-summary.h	546 virtual void remove (cgraph_edge , T ) {} 549 virtual void duplicate (cgraph_edge , cgraph_edge , T , T ) {} 642 T* get_create (cgraph_edge edge) 653 T get (cgraph_edge edge) ATTRIBUTE_PURE 661 void remove (cgraph_edge edge) 673 bool exists (cgraph_edge edge) 679 static void symtab_removal (cgraph_edge edge, void data); 682 static void symtab_duplication (cgraph_edge edge1, cgraph_edge edge2, 720 call_summary<T >::symtab_removal (cgraph_edge edge, void data) 728 call_summary<T >::symtab_duplication (cgraph_edge edge1, [all …]
H A D	ipa-inline.c	123 typedef fibonacci_heap <sreal, cgraph_edge> edge_heap_t; 124 typedef fibonacci_node <sreal, cgraph_edge> edge_heap_node_t; 145 caller_growth_limits (struct cgraph_edge e) in caller_growth_limits() 228 report_inline_failed_reason (struct cgraph_edge e) in report_inline_failed_reason() 310 can_inline_edge_p (struct cgraph_edge e, bool report, 428 can_inline_edge_by_limits_p (struct cgraph_edge e, bool report, 594 can_early_inline_edge_p (struct cgraph_edge e) in can_early_inline_edge_p() 631 struct cgraph_edge e; in num_calls() 644 want_early_inline_function_p (struct cgraph_edge e) in want_early_inline_function_p() 728 compute_uninlined_call_time (struct cgraph_edge edge, in compute_uninlined_call_time() [all …]
H A D	ipa-prop.h	564 vec<cgraph_edge > cg_edges; 873 void remove (cgraph_edge edge) in class() 879 virtual void remove (cgraph_edge cs, ipa_edge_args args); in class() 881 virtual void duplicate (cgraph_edge src, in class() 882 cgraph_edge dst, in class() 958 ipa_edge_args_info_available_for_edge_p (struct cgraph_edge edge) in ipa_edge_args_info_available_for_edge_p() 983 bool ipa_propagate_indirect_call_infos (struct cgraph_edge cs, 984 vec<cgraph_edge > new_edges); 987 tree ipa_get_indirect_edge_target (struct cgraph_edge ie, 992 struct cgraph_edge ipa_make_edge_direct_to_target (struct cgraph_edge *, tree, [all …]
H A D	ipa-inline-analysis.c	101 initialize_inline_failed (struct cgraph_edge e) in initialize_inline_failed() 154 simple_edge_hints (struct cgraph_edge edge) in simple_edge_hints() 180 do_estimate_edge_time (struct cgraph_edge edge, sreal ret_nonspec_time) in do_estimate_edge_time() 293 ipa_remove_from_growth_caches (struct cgraph_edge edge) in ipa_remove_from_growth_caches() 305 do_estimate_edge_size (struct cgraph_edge edge) in do_estimate_edge_size() 344 do_estimate_edge_hints (struct cgraph_edge edge) in do_estimate_edge_hints() 384 struct cgraph_edge edge) in estimate_size_after_inlining() 413 struct cgraph_edge e; in do_estimate_growth_1() 493 int min_size, struct cgraph_edge known_edge) in check_callers() 500 for (cgraph_edge *e = node->callers; e; e = e->next_caller) in check_callers() [all …]
H A D	ipa-utils.c	81 bool (ignore_edge) (struct cgraph_edge )) in searchc() 83 struct cgraph_edge edge; in searchc() 164 bool (ignore_edge) (struct cgraph_edge )) in ipa_reduced_postorder() 252 ipa_edge_within_scc (struct cgraph_edge cs) in ipa_edge_within_scc() 267 struct cgraph_edge edge; 281 struct cgraph_edge edge; in ipa_reverse_postorder() 381 struct cgraph_edge e; in scale_ipa_profile_for_fn() 527 struct cgraph_edge e, e2; in ipa_merge_profiles() 610 struct cgraph_edge e, *e2; in ipa_merge_profiles() 691 cgraph_edge::resolve_speculation (e, NULL); in ipa_merge_profiles() [all …]
H A D	ipa-cp.c	139 cgraph_edge cs; 200 void add_source (cgraph_edge cs, ipcp_value src_val, int src_idx, 229 bool add_value (valtype newval, cgraph_edge cs, 638 for (cgraph_edge edge = node->callees; !reason && edge; in determine_versionability() 691 struct cgraph_edge cs; in gather_caller_stats() 816 ignore_edge_p (cgraph_edge e) in ignore_edge_p() 1176 for (cgraph_edge cs = node->callers; cs; cs = cs->next_caller) in count_callers() 1190 cgraph_edge cs = node->callers; in set_single_call_flag() 1208 struct cgraph_edge ie; in initialize_node_lattices() 1450 ipa_context_from_jfunc (ipa_node_params info, cgraph_edge cs, int csidx, in ipa_context_from_jfunc() [all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A D	supergraph.h	111 supernode get_caller_next_node (cgraph_edge edge) const in get_caller_next_node() 117 call_superedge get_edge_for_call (cgraph_edge edge) const in get_edge_for_call() 123 return_superedge get_edge_for_return (cgraph_edge edge) const in get_edge_for_return() 129 superedge get_intraprocedural_edge_for_call (cgraph_edge edge) const in get_intraprocedural_edge_for_call() 171 cgraph_edge cedge); 173 cgraph_edge cedge); 181 typedef ordered_hash_map<cgraph_edge , supernode > cgraph_edge_to_node_t; 189 typedef ordered_hash_map<cgraph_edge , call_superedge > 193 typedef ordered_hash_map<cgraph_edge , return_superedge > 197 typedef ordered_hash_map<cgraph_edge , superedge > [all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A D	supergraph.h	124 supernode get_caller_next_node (cgraph_edge edge) const in get_caller_next_node() 130 call_superedge get_edge_for_call (cgraph_edge edge) const in get_edge_for_call() 136 return_superedge get_edge_for_return (cgraph_edge edge) const in get_edge_for_return() 142 superedge get_intraprocedural_edge_for_call (cgraph_edge edge) const in get_intraprocedural_edge_for_call() 186 cgraph_edge cedge); 188 cgraph_edge cedge); 196 typedef ordered_hash_map<cgraph_edge , supernode > cgraph_edge_to_node_t; 204 typedef ordered_hash_map<cgraph_edge , call_superedge > 208 typedef ordered_hash_map<cgraph_edge , return_superedge > 212 typedef ordered_hash_map<cgraph_edge , superedge > [all …]

12 3 4 5 6