/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | ipa-inline-transform.c | 198 if (e->callee->definition in clone_inlined_nodes() 201 gcc_assert (!e->callee->alias); in clone_inlined_nodes() 207 e->callee->externally_visible = false; in clone_inlined_nodes() 208 update_noncloned_counts (e->callee, e->count, e->callee->count); in clone_inlined_nodes() 217 n = e->callee->create_clone (e->callee->decl, in clone_inlined_nodes() 299 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in inline_call() local 422 if (e->callee != callee) in inline_call() 425 e->redirect_callee (callee); in inline_call() 426 while (alias && alias != callee) in inline_call() 453 check_speculations (e->callee); in inline_call() [all …]
|
H A D | ipa-inline.c | 322 cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller); variable 367 callee->decl)) 414 cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller); variable 417 = callee ? DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee->decl) : NULL; 558 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in can_early_inline_edge_p() local 608 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in want_early_inline_function_p() local 744 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in want_inline_small_function_p() local 1025 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in edge_badness() local 1399 && (callee = e->callee->ultimate_alias_target (&avail, e->caller)) in update_callee_keys() 1946 callee = edge->callee->ultimate_alias_target (); in inline_small_functions() [all …]
|
H A D | ipa-inline-analysis.c | 64 struct cgraph_node *callee = e->callee; in initialize_inline_failed() local 71 else if (!callee->definition) in initialize_inline_failed() 127 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in simple_edge_hints() local 130 == ipa_fn_summaries->get (callee)->scc_no in simple_edge_hints() 136 && !callee->merged_comdat && !callee->icf_merged) in simple_edge_hints() 155 struct cgraph_node *callee; in do_estimate_edge_time() local 163 callee = edge->callee->ultimate_alias_target (); in do_estimate_edge_time() 214 struct cgraph_node *callee; in do_estimate_edge_size() local 230 callee = edge->callee->ultimate_alias_target (); in do_estimate_edge_size() 255 struct cgraph_node *callee; in do_estimate_edge_hints() local [all …]
|
H A D | cgraph.c | 718 if (e->callee) in cgraph_add_edge_to_call_site_hash() 863 edge->callee = callee; in create_edge() 878 && callee && callee->decl in create_edge() 920 if (callee->callers) in create_edge() 926 callee->callers = edge; in create_edge() 1253 edge->set_callee (callee); in make_direct() 1609 cgraph_node *callee = e->callee; in cgraph_update_edges_for_call_stmt_node() local 1610 while (callee) in cgraph_update_edges_for_call_stmt_node() 1618 callee = callee->clone_of; in cgraph_update_edges_for_call_stmt_node() 2805 || (callee in maybe_hot_p() [all …]
|
H A D | tree-ssa-dce.c | 226 tree callee = gimple_call_fndecl (stmt); in mark_stmt_if_obviously_necessary() local 227 if (callee != NULL_TREE in mark_stmt_if_obviously_necessary() 228 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL) in mark_stmt_if_obviously_necessary() 229 switch (DECL_FUNCTION_CODE (callee)) in mark_stmt_if_obviously_necessary() 567 tree callee = gimple_call_fndecl (def_stmt); in mark_all_reaching_defs_necessary_1() local 568 if (callee != NULL_TREE in mark_all_reaching_defs_necessary_1() 569 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL) in mark_all_reaching_defs_necessary_1() 570 switch (DECL_FUNCTION_CODE (callee)) in mark_all_reaching_defs_necessary_1() 828 tree callee = gimple_call_fndecl (stmt); in propagate_necessity() local 834 if (callee != NULL_TREE in propagate_necessity() [all …]
|
H A D | cif-code.def | 90 /* Caller and callee disagree on the arguments. */ 94 /* Caller and callee disagree on the arguments. */ 106 /* Ths edge represents an indirect edge with a yet-undetermined callee . */ 108 N_("indirect function call with a yet undetermined callee")) 114 /* We can't inline if the callee can throw non-call exceptions but the 127 /* We can't inline because the callee refers to comdat-local symbols. */ 129 N_("callee refers to comdat-local symbols")) 131 /* We can't inline because of mismatched caller/callee attributes. */
|
H A D | ipa-utils.c | 100 struct cgraph_node *w = edge->callee->ultimate_alias_target (&avail); in searchc() 257 struct cgraph_node *callee = cs->callee->function_symbol (); in ipa_edge_within_scc() local 259 callee_dfs = (struct ipa_dfs_info *) callee->aux; in ipa_edge_within_scc() 324 (edge->callee->function_symbol ()->decl)) in ipa_reverse_postorder() 629 if (DECL_ASSEMBLER_NAME (direct2->callee->decl) in ipa_merge_profiles() 630 != DECL_ASSEMBLER_NAME (direct->callee->decl)) in ipa_merge_profiles() 634 direct->redirect_callee (direct2->callee); in ipa_merge_profiles() 661 e->make_speculative (direct->callee, direct->count); in ipa_merge_profiles()
|
H A D | cgraphclones.c | 105 cgraph_node *callee = cgraph_node::get (decl); in clone() local 106 gcc_checking_assert (callee); in clone() 107 new_edge = n->create_edge (callee, call_stmt, prof_count); in clone() 119 new_edge = n->create_edge (callee, call_stmt, prof_count); in clone() 266 thunk_of = thunk->callees->callee->ultimate_alias_target (); in duplicate_thunk_for_node() 346 cgraph_node *orig_to = callee->ultimate_alias_target (); in redirect_callee_duplicating_thunks() 484 if (!e->callee in create_clone() 485 || DECL_BUILT_IN_CLASS (e->callee->decl) != BUILT_IN_NORMAL in create_clone() 770 cgraph_node::create_edge_including_clones (cgraph_node *callee, in create_edge_including_clones() argument 780 edge = create_edge (callee, stmt, count); in create_edge_including_clones() [all …]
|
H A D | ipa-pure-const.c | 552 tree callee) in special_builtin_state() argument 555 switch (DECL_FUNCTION_CODE (callee)) in special_builtin_state() 1402 if (e->callee->function_symbol () == node) in self_recursive_p() 1509 struct cgraph_node *y = e->callee-> in propagate_pure_const() 1518 e->callee->dump_name ()); in propagate_pure_const() 1647 struct cgraph_node *y = e->callee-> in propagate_pure_const() 1817 struct cgraph_node *y = e->callee-> in propagate_nothrow() 1831 && !e->callee->binds_to_current_def_p (w))))) in propagate_nothrow() 1952 callees.safe_push (cs->callee); in propagate_malloc() 1958 cgraph_node *callee = callees[j]; in propagate_malloc() local [all …]
|
H A D | ipa-fnsummary.c | 234 struct cgraph_node *callee = !e->inline_failed ? e->callee : NULL; in redirect_to_unreachable() local 240 else if (!e->callee) in redirect_to_unreachable() 249 if (callee) in redirect_to_unreachable() 430 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in evaluate_properties_for_edge() local 817 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in dump_ipa_call_summary() local 823 indent, "", callee->name (), callee->order, in dump_ipa_call_summary() 2486 tree cdecl = e->callee->decl; in compute_fn_summary() 2548 struct cgraph_node *callee; in estimate_edge_devirt_benefit() local 2570 if (!callee || !callee->definition) in estimate_edge_devirt_benefit() 2572 callee = callee->function_symbol (&avail); in estimate_edge_devirt_benefit() [all …]
|
H A D | ipa.c | 74 if (e->callee->global.inlined_to) in update_inlined_to_pointer() 76 e->callee->global.inlined_to = inlined_to; in update_inlined_to_pointer() 77 update_inlined_to_pointer (e->callee, inlined_to); in update_inlined_to_pointer() 435 if (e->callee->definition in remove_unreachable_nodes() 436 && !e->callee->in_other_partition in remove_unreachable_nodes() 438 || !DECL_EXTERNAL (e->callee->decl) in remove_unreachable_nodes() 439 || e->callee->alias in remove_unreachable_nodes() 449 if (DECL_EXTERNAL (e->callee->decl) in remove_unreachable_nodes() 450 && e->callee->alias in remove_unreachable_nodes() 453 reachable.add (e->callee); in remove_unreachable_nodes() [all …]
|
H A D | ipa-profile.c | 334 && !(edge->callee->count.ipa () == profile_count::zero ()) in ipa_propagate_frequency_1() 382 && contains_hot_call_p (e->callee)) in contains_hot_call_p() 712 if (e->callee->local.local && !e->callee->aux) in ipa_profile() 715 e->callee->aux = (void *)1; in ipa_profile() 731 if (e->callee->local.local && !e->callee->aux) in ipa_profile() 734 e->callee->aux = (void *)1; in ipa_profile()
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | ipa-inline.c | 224 xstrdup (cgraph_node_name (e->callee)), e->callee->uid, in report_inline_failed_reason() 248 = callee ? DECL_STRUCT_FUNCTION (callee->decl) : NULL; in can_inline_edge_p() 253 if (!callee_cfun && callee && callee->clone_of) in can_inline_edge_p() 258 if (!callee || !callee->analyzed) in can_inline_edge_p() 307 callee->decl)) in can_inline_edge_p() 427 xstrdup (cgraph_node_name (callee)), callee->uid, in want_early_inline_function_p() 438 xstrdup (cgraph_node_name (callee)), callee->uid, in want_early_inline_function_p() 448 xstrdup (cgraph_node_name (callee)), callee->uid, in want_early_inline_function_p() 1067 && (callee = cgraph_function_or_thunk_node (e->callee, &avail)) in update_callee_keys() 1430 callee = cgraph_function_or_thunk_node (edge->callee, NULL); in inline_small_functions() [all …]
|
H A D | ipa-inline-transform.c | 144 if (!e->callee->callers->next_caller in clone_inlined_nodes() 148 && can_remove_node_now_p (e->callee, e)) in clone_inlined_nodes() 157 gcc_assert (!e->callee->global.inlined_to); in clone_inlined_nodes() 158 if (e->callee->analyzed && !DECL_EXTERNAL (e->callee->decl)) in clone_inlined_nodes() 171 n = cgraph_clone_node (e->callee, e->callee->decl, in clone_inlined_nodes() 181 e->callee->global.inlined_to = e->caller; in clone_inlined_nodes() 204 struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL); in inline_call() local 209 gcc_assert (!callee->global.inlined_to); in inline_call() 212 DECL_POSSIBLY_INLINED (callee->decl) = true; in inline_call() 220 if (e->callee != callee) in inline_call() [all …]
|
H A D | tree-ssa-dce.c | 303 tree callee = gimple_call_fndecl (stmt); in mark_stmt_if_obviously_necessary() local 304 if (callee != NULL_TREE in mark_stmt_if_obviously_necessary() 306 switch (DECL_FUNCTION_CODE (callee)) in mark_stmt_if_obviously_necessary() 646 tree callee = gimple_call_fndecl (def_stmt); in mark_all_reaching_defs_necessary_1() local 647 if (callee != NULL_TREE in mark_all_reaching_defs_necessary_1() 648 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL) in mark_all_reaching_defs_necessary_1() 649 switch (DECL_FUNCTION_CODE (callee)) in mark_all_reaching_defs_necessary_1() 891 tree callee = gimple_call_fndecl (stmt); in propagate_necessity() local 897 if (callee != NULL_TREE in propagate_necessity() 898 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL in propagate_necessity() [all …]
|
H A D | cgraph.c | 974 edge->callee = callee; in cgraph_create_edge_1() 992 && callee && callee->decl in cgraph_create_edge_1() 1019 if (callee->callers) in cgraph_create_edge() 1025 callee->callers = edge; in cgraph_create_edge() 1148 e->callee = n; in cgraph_set_edge_callee() 1231 if (new_call && e->callee) in cgraph_update_edges_for_call_stmt_node() 1233 struct cgraph_node *callee = e->callee; in cgraph_update_edges_for_call_stmt_node() local 1234 while (callee) in cgraph_update_edges_for_call_stmt_node() 1236 if (callee->decl == new_call in cgraph_update_edges_for_call_stmt_node() 1239 callee = callee->clone_of; in cgraph_update_edges_for_call_stmt_node() [all …]
|
H A D | ipa-inline-analysis.c | 719 struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL); in evaluate_properties_for_edge() local 1110 struct cgraph_node *callee = cgraph_function_or_thunk_node (edge->callee, NULL); in dump_inline_edge_summary() local 1115 callee->uid, in dump_inline_edge_summary() 1240 struct cgraph_node *callee = e->callee; in initialize_inline_failed() local 1244 else if (!callee->analyzed) in initialize_inline_failed() 2224 struct cgraph_node *callee; in estimate_edge_devirt_benefit() 2229 if (!callee || !callee->analyzed) in estimate_edge_devirt_benefit() 2719 struct cgraph_node *callee; in do_estimate_edge_time() local 2725 callee = cgraph_function_or_thunk_node (edge->callee, NULL); in do_estimate_edge_time() 2766 struct cgraph_node *callee; in do_estimate_edge_growth() local [all …]
|
H A D | tree-ssa-ccp.c | 2195 tree callee; in optimize_stack_restore() local 2216 if (!callee in optimize_stack_restore() 2254 if (callee in optimize_stack_restore() 2280 tree callee, lhs, rhs, cfun_va_list; in optimize_stdarg_builtin() local 2287 callee = gimple_call_fndecl (call); in optimize_stdarg_builtin() 2294 switch (DECL_FUNCTION_CODE (callee)) in optimize_stdarg_builtin() 2364 tree callee, result; in execute_fold_all_builtins() local 2374 callee = gimple_call_fndecl (stmt); in execute_fold_all_builtins() 2375 if (!callee || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL) in execute_fold_all_builtins() 2457 callee = gimple_call_fndecl (stmt); in execute_fold_all_builtins() [all …]
|
H A D | tree-object-size.c | 388 tree callee, bytes = NULL_TREE; in alloc_object_size() local 394 callee = gimple_call_fndecl (call); in alloc_object_size() 395 if (!callee) in alloc_object_size() 408 if (DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL) in alloc_object_size() 409 switch (DECL_FUNCTION_CODE (callee)) in alloc_object_size() 450 tree callee = gimple_call_fndecl (call); in pass_through_call() local 452 if (callee in pass_through_call() 454 switch (DECL_FUNCTION_CODE (callee)) in pass_through_call() 1210 tree callee, result; in compute_object_sizes() local 1216 callee = gimple_call_fndecl (call); in compute_object_sizes() [all …]
|
H A D | tree-ssa-alias.c | 1136 tree base, callee; in ref_maybe_used_by_call_p_1() local 1162 callee = gimple_call_fndecl (call); in ref_maybe_used_by_call_p_1() 1167 if (callee != NULL_TREE in ref_maybe_used_by_call_p_1() 1169 switch (DECL_FUNCTION_CODE (callee)) in ref_maybe_used_by_call_p_1() 1341 if (callee != NULL_TREE in ref_maybe_used_by_call_p_1() 1473 tree callee; in call_may_clobber_ref_p_1() local 1504 callee = gimple_call_fndecl (call); in call_may_clobber_ref_p_1() 1509 if (callee != NULL_TREE in call_may_clobber_ref_p_1() 1684 if (callee != NULL_TREE in call_may_clobber_ref_p_1() 1819 if (callee != NULL_TREE in stmt_kills_ref_p_1() [all …]
|
H A D | tree-stdarg.c | 670 tree callee, ap; in execute_optimize_stdarg() local 675 callee = gimple_call_fndecl (stmt); in execute_optimize_stdarg() 676 if (!callee in execute_optimize_stdarg() 677 || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL) in execute_optimize_stdarg() 680 switch (DECL_FUNCTION_CODE (callee)) in execute_optimize_stdarg() 831 tree callee = gimple_call_fndecl (stmt); in execute_optimize_stdarg() local 833 if (callee in execute_optimize_stdarg() 834 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL in execute_optimize_stdarg() 835 && (DECL_FUNCTION_CODE (callee) == BUILT_IN_VA_START in execute_optimize_stdarg() 836 || DECL_FUNCTION_CODE (callee) == BUILT_IN_VA_END)) in execute_optimize_stdarg()
|
H A D | ipa-cp.c | 252 struct cgraph_node *callee = cgraph_function_node (cs->callee, NULL); in edge_within_scc() local 1056 callee = cgraph_function_node (cs->callee, &availability); in propagate_constants_accross_call() 1057 if (!callee->analyzed) in propagate_constants_accross_call() 1060 callee_info = IPA_NODE_REF (callee); in propagate_constants_accross_call() 1069 alias_or_thunk = cs->callee; in propagate_constants_accross_call() 1171 struct cgraph_node *callee; in devirtualization_time_bonus() local 1182 if (!callee || !callee->analyzed) in devirtualization_time_bonus() 2345 struct cgraph_node *callee; in spread_undeadness() local 2348 callee = cgraph_function_node (cs->callee, NULL); in spread_undeadness() 2349 info = IPA_NODE_REF (callee); in spread_undeadness() [all …]
|
H A D | ipa.c | 44 if (e->callee->global.inlined_to) in update_inlined_to_pointer() 46 e->callee->global.inlined_to = inlined_to; in update_inlined_to_pointer() 47 update_inlined_to_pointer (e->callee, inlined_to); in update_inlined_to_pointer() 250 if (!e->callee->reachable in cgraph_remove_unreachable_nodes() 253 || !DECL_EXTERNAL (e->callee->decl) in cgraph_remove_unreachable_nodes() 255 e->callee->reachable = true; in cgraph_remove_unreachable_nodes() 256 enqueue_cgraph_node (e->callee, &first); in cgraph_remove_unreachable_nodes() 1066 if (e->callee->local.local && !e->callee->aux) in ipa_profile() 1069 e->callee->aux = (void *)1; in ipa_profile() 1083 if (e->callee->local.local && !e->callee->aux) in ipa_profile() [all …]
|
H A D | cgraphunit.c | 464 if (!decl || e->callee->global.inlined_to) in verify_edge_corresponds_to_fndecl() 474 if ((e->callee->former_clone_of != node->decl in verify_edge_corresponds_to_fndecl() 480 && !clone_of_p (node, e->callee) in verify_edge_corresponds_to_fndecl() 745 debug_tree (e->callee->decl); in verify_cgraph_node() 1136 if (!edge->callee->reachable) in cgraph_analyze_functions() 1137 cgraph_mark_reachable_node (edge->callee); in cgraph_analyze_functions() 2479 || decl == e->callee->decl) in cgraph_redirect_edge_call_stmt_to_callee() 2494 xstrdup (cgraph_node_name (e->callee)), e->callee->uid); in cgraph_redirect_edge_call_stmt_to_callee() 2496 if (e->callee->clone.combined_args_to_skip) in cgraph_redirect_edge_call_stmt_to_callee() 2500 e->callee->clone.combined_args_to_skip); in cgraph_redirect_edge_call_stmt_to_callee() [all …]
|
/dragonfly/contrib/gcc-8.0/gcc/c-family/ |
H A D | c-warn.c | 703 if (TREE_CODE (callee) != FUNCTION_DECL in sizeof_pointer_memaccess_warning() 814 callee); in sizeof_pointer_memaccess_warning() 844 "remove the addressof?", callee); in sizeof_pointer_memaccess_warning() 851 "provide an explicit length?", callee); in sizeof_pointer_memaccess_warning() 856 "dereference it?", callee); in sizeof_pointer_memaccess_warning() 884 "remove the addressof?", callee); in sizeof_pointer_memaccess_warning() 896 "dereference it?", callee); in sizeof_pointer_memaccess_warning() 924 "remove the addressof?", callee); in sizeof_pointer_memaccess_warning() 936 "dereference it?", callee); in sizeof_pointer_memaccess_warning() 964 "remove the addressof?", callee); in sizeof_pointer_memaccess_warning() [all …]
|