| /dragonfly/contrib/gcc-8.0/gcc/ |
| HD | ipa-inline-transform.c | 67 update_noncloned_counts (e->callee, num, den); in update_noncloned_counts() 180 if (!e->callee->callers->next_caller in clone_inlined_nodes() 184 && can_remove_node_now_p (e->callee, e) in clone_inlined_nodes() 187 && !master_clone_with_noninline_clones_p (e->callee)) in clone_inlined_nodes() 196 gcc_assert (!e->callee->global.inlined_to); in clone_inlined_nodes() 197 e->callee->remove_from_same_comdat_group (); in clone_inlined_nodes() 198 if (e->callee->definition in clone_inlined_nodes() 199 && inline_account_function_p (e->callee)) in clone_inlined_nodes() 201 gcc_assert (!e->callee->alias); in clone_inlined_nodes() 203 *overall_size -= ipa_fn_summaries->get (e->callee)->size; in clone_inlined_nodes() [all …]
|
| HD | ipa-inline.c | 149 struct cgraph_node *what = e->callee->ultimate_alias_target (); in caller_growth_limits() 233 e->callee->dump_name (), in report_inline_failed_reason() 238 && e->callee->ultimate_alias_target ()->lto_file_data) in report_inline_failed_reason() 242 e->callee->ultimate_alias_target ()->lto_file_data->file_name); in report_inline_failed_reason() 247 target_opts_for_fn (e->callee->ultimate_alias_target ()->decl)); in report_inline_failed_reason() 251 opts_for_fn (e->callee->ultimate_alias_target ()->decl)); in report_inline_failed_reason() 258 sanitize_attrs_match_for_inline_p (const_tree caller, const_tree callee) in sanitize_attrs_match_for_inline_p() argument 260 if (!caller || !callee) in sanitize_attrs_match_for_inline_p() 266 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (callee))) in sanitize_attrs_match_for_inline_p() 270 == sanitize_flags_p (SANITIZE_ADDRESS, callee)) in sanitize_attrs_match_for_inline_p() [all …]
|
| HD | 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() 73 else if (callee->local.redefined_extern_inline) 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() 134 if (callee->lto_file_data && edge->caller->lto_file_data in simple_edge_hints() 135 && edge->caller->lto_file_data != callee->lto_file_data 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() [all …]
|
| HD | cgraph.c | 718 if (e->callee) in cgraph_add_edge_to_call_site_hash() 829 symbol_table::create_edge (cgraph_node *caller, cgraph_node *callee, in create_edge() argument 863 edge->callee = callee; in create_edge() 878 && callee && callee->decl in create_edge() 879 && !gimple_check_call_matching_types (call_stmt, callee->decl, in create_edge() 911 cgraph_node::create_edge (cgraph_node *callee, in create_edge() argument 914 cgraph_edge *edge = symtab->create_edge (this, callee, call_stmt, count, in create_edge() 919 edge->next_caller = callee->callers; in create_edge() 920 if (callee->callers) in create_edge() 921 callee->callers->prev_caller = edge; in create_edge() [all …]
|
| HD | 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 …]
|
| HD | 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. */
|
| HD | 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()
|
| HD | 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() 486 || DECL_FUNCTION_CODE (e->callee->decl) != BUILT_IN_UNREACHABLE) in create_clone() 770 cgraph_node::create_edge_including_clones (cgraph_node *callee, in create_edge_including_clones() argument [all …]
|
| HD | ipa-pure-const.c | 552 tree callee) in special_builtin_state() argument 554 if (DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL) in special_builtin_state() 555 switch (DECL_FUNCTION_CODE (callee)) in special_builtin_state() 1380 if (!e->can_throw_external || TREE_NOTHROW (e->callee->decl)) in ignore_edge_for_nothrow() 1384 cgraph_node *n = e->callee->function_or_virtual_thunk_symbol (&avail, in ignore_edge_for_nothrow() 1388 return opt_for_fn (e->callee->decl, flag_non_call_exceptions) in ignore_edge_for_nothrow() 1389 && !e->callee->binds_to_current_def_p (e->caller); in ignore_edge_for_nothrow() 1402 if (e->callee->function_symbol () == node) in self_recursive_p() 1425 e->callee->function_or_virtual_thunk_symbol (&avail, e->caller); in ignore_edge_for_pure_const() 1509 struct cgraph_node *y = e->callee-> in propagate_pure_const() [all …]
|
| HD | 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() 250 callee->remove_symbol_and_inline_clones (); in redirect_to_unreachable() 266 && (!e->speculative || e->callee)) in edge_set_predicate() 430 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in evaluate_properties_for_edge() local 431 struct ipa_fn_summary *info = ipa_fn_summaries->get (callee); in evaluate_properties_for_edge() 455 callee_pi = IPA_NODE_REF (e->callee); in evaluate_properties_for_edge() 512 evaluate_conditions_for_known_args (callee, inline_p, in evaluate_properties_for_edge() 817 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in dump_ipa_call_summary() local [all …]
|
| HD | 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() 434 symtab_node *body = e->callee->function_symbol (); in remove_unreachable_nodes() 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() [all …]
|
| HD | 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/ |
| HD | ipa-inline.c | 140 struct cgraph_node *what = cgraph_function_or_thunk_node (e->callee, NULL); in caller_growth_limits() 224 xstrdup (cgraph_node_name (e->callee)), e->callee->uid, in report_inline_failed_reason() 241 struct cgraph_node *callee in can_inline_edge_p() local 242 = cgraph_function_or_thunk_node (e->callee, &avail); in can_inline_edge_p() 245 = callee ? DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee->decl) : NULL; in can_inline_edge_p() 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() 254 callee_cfun = DECL_STRUCT_FUNCTION (callee->clone_of->decl); in can_inline_edge_p() 258 if (!callee || !callee->analyzed) in can_inline_edge_p() 263 else if (!inline_summary (callee)->inlinable) in can_inline_edge_p() [all …]
|
| HD | ipa-inline-transform.c | 70 update_noncloned_frequencies (e->callee, freq_scale); in update_noncloned_frequencies() 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() 161 *overall_size -= inline_summary (e->callee)->size; in clone_inlined_nodes() 165 e->callee->local.externally_visible = false; in clone_inlined_nodes() 166 update_noncloned_frequencies (e->callee, e->frequency); in clone_inlined_nodes() 171 n = cgraph_clone_node (e->callee, e->callee->decl, in clone_inlined_nodes() 179 e->callee->global.inlined_to = e->caller->global.inlined_to; in clone_inlined_nodes() [all …]
|
| HD | 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() 305 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL) 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() [all …]
|
| HD | cgraph.c | 892 struct cgraph_node *callee, in cgraph_create_edge_including_clones() argument 903 edge = cgraph_create_edge (orig, callee, stmt, count, freq); in cgraph_create_edge_including_clones() 921 edge = cgraph_create_edge (node, callee, stmt, count, in cgraph_create_edge_including_clones() 945 cgraph_create_edge_1 (struct cgraph_node *caller, struct cgraph_node *callee, in cgraph_create_edge_1() argument 974 edge->callee = callee; in cgraph_create_edge_1() 992 && callee && callee->decl in cgraph_create_edge_1() 993 && !gimple_check_call_matching_types (call_stmt, callee->decl)) in cgraph_create_edge_1() 1009 cgraph_create_edge (struct cgraph_node *caller, struct cgraph_node *callee, in cgraph_create_edge() argument 1012 struct cgraph_edge *edge = cgraph_create_edge_1 (caller, callee, call_stmt, in cgraph_create_edge() 1018 edge->next_caller = callee->callers; in cgraph_create_edge() [all …]
|
| HD | ipa-inline-analysis.c | 719 struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL); in evaluate_properties_for_edge() local 720 struct inline_summary *info = inline_summary (callee); in evaluate_properties_for_edge() 769 *clause_ptr = evaluate_conditions_for_known_args (callee, inline_p, in evaluate_properties_for_edge() 1110 struct cgraph_node *callee = cgraph_function_or_thunk_node (edge->callee, NULL); in dump_inline_edge_summary() local 1114 indent, "", cgraph_node_name (callee), in dump_inline_edge_summary() 1115 callee->uid, in dump_inline_edge_summary() 1123 (int)inline_summary (callee)->size / INLINE_SIZE_SCALE, in dump_inline_edge_summary() 1124 (int)inline_summary (callee)->estimated_stack_size); in dump_inline_edge_summary() 1152 (int)inline_summary (callee)->stack_frame_offset, in dump_inline_edge_summary() 1153 (int)inline_summary (callee)->estimated_self_stack_size, in dump_inline_edge_summary() [all …]
|
| HD | tree-ssa-ccp.c | 2195 tree callee; in optimize_stack_restore() local 2215 callee = gimple_call_fndecl (stmt); in optimize_stack_restore() 2216 if (!callee in optimize_stack_restore() 2217 || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL in optimize_stack_restore() 2219 || DECL_FUNCTION_CODE (callee) == BUILT_IN_ALLOCA in optimize_stack_restore() 2220 || DECL_FUNCTION_CODE (callee) == BUILT_IN_ALLOCA_WITH_ALIGN) in optimize_stack_restore() 2223 if (DECL_FUNCTION_CODE (callee) == BUILT_IN_STACK_RESTORE) in optimize_stack_restore() 2253 callee = gimple_call_fndecl (stack_save); in optimize_stack_restore() 2254 if (callee in optimize_stack_restore() 2255 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL in optimize_stack_restore() [all …]
|
| HD | 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() 398 alloc_size = lookup_attribute ("alloc_size", TYPE_ATTRIBUTES (TREE_TYPE(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() 453 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL) in pass_through_call() 454 switch (DECL_FUNCTION_CODE (callee)) in pass_through_call() [all …]
|
| HD | 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() 1168 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL) 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() 1345 struct cgraph_node *node = cgraph_get_node (callee); 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() [all …]
|
| HD | 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()
|
| HD | ipa-cp.c | 252 struct cgraph_node *callee = cgraph_function_node (cs->callee, NULL); in edge_within_scc() local 254 callee_dfs = (struct ipa_dfs_info *) callee->aux; in edge_within_scc() 1051 struct cgraph_node *callee, *alias_or_thunk; in propagate_constants_accross_call() local 1056 callee = cgraph_function_node (cs->callee, &availability); in propagate_constants_accross_call() 1057 if (!callee->analyzed) in propagate_constants_accross_call() 1059 gcc_checking_assert (cgraph_function_with_gimple_body_p (callee)); 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 1181 callee = cgraph_get_node (target); in devirtualization_time_bonus() [all …]
|
| HD | 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() 862 decl_node = cgraph_function_node (decl_node->callees->callee, NULL); in function_and_variable_visibility() 1066 if (e->callee->local.local && !e->callee->aux) in ipa_profile() 1069 e->callee->aux = (void *)1; in ipa_profile() [all …]
|
| HD | 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() 476 || e->callee->former_clone_of != node->thunk.alias)) in verify_edge_corresponds_to_fndecl() 479 && (node != cgraph_function_or_thunk_node (e->callee, NULL)) in verify_edge_corresponds_to_fndecl() 480 && !clone_of_p (node, e->callee) in verify_edge_corresponds_to_fndecl() 484 || !clone_of_p (cgraph_get_node (node->thunk.alias), e->callee))) in verify_edge_corresponds_to_fndecl() 509 identifier_to_locale (cgraph_node_name (e->callee))); in verify_cgraph_node() 745 debug_tree (e->callee->decl); in verify_cgraph_node() 781 identifier_to_locale (cgraph_node_name (e->callee))); in verify_cgraph_node() 1136 if (!edge->callee->reachable) in cgraph_analyze_functions() [all …]
|
| /dragonfly/contrib/gcc-8.0/gcc/c-family/ |
| HD | c-warn.c | 694 sizeof_pointer_memaccess_warning (location_t *sizeof_arg_loc, tree callee, in sizeof_pointer_memaccess_warning() argument 703 if (TREE_CODE (callee) != FUNCTION_DECL in sizeof_pointer_memaccess_warning() 704 || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL in sizeof_pointer_memaccess_warning() 708 enum built_in_function fncode = DECL_FUNCTION_CODE (callee); 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() 868 "or an explicit length", callee, TREE_TYPE (dest), in sizeof_pointer_memaccess_warning() 884 "remove the addressof?", callee); in sizeof_pointer_memaccess_warning() [all …]
|