diff options
author | Jan Hubicka <hubicka@ucw.cz> | 2017-06-04 20:55:08 +0200 |
---|---|---|
committer | Jan Hubicka <hubicka@gcc.gnu.org> | 2017-06-04 18:55:08 +0000 |
commit | 3995f3a2207fbde0c31341d79bf49563d681ca9a (patch) | |
tree | 51458cb1039eb15cb224e5b7de48d9e17703b737 /gcc/profile.c | |
parent | a7e8f816bd09adc24013b5fd3a43128778f6581b (diff) | |
download | gcc-3995f3a2207fbde0c31341d79bf49563d681ca9a.zip gcc-3995f3a2207fbde0c31341d79bf49563d681ca9a.tar.gz gcc-3995f3a2207fbde0c31341d79bf49563d681ca9a.tar.bz2 |
i386.c (make_resolver_func): Update.
2017-05-23 Jan Hubicka <hubicka@ucw.cz>
* config/i386/i386.c (make_resolver_func): Update.
* Makefile.in: Add profile-count.h and profile-count.o
* auto-profile.c (afdo_indirect_call): Update to new API.
(afdo_set_bb_count): Update.
(afdo_propagate_edge): Update.
(afdo_propagate_circuit): Update.
(afdo_calculate_branch_prob): Update.
(afdo_annotate_cfg): Update.
* basic-block.h: Include profile-count.h
(struct edge_def): Turn count to profile_count.
(struct basic_block_def): Likewie.
(REG_BR_PROB_BASE): Move to profile-count.h
(RDIV): Move to profile-count.h
* bb-reorder.c (max_entry_count): Turn to profile_count.
(find_traces): Update.
(rotate_loop):Update.
(connect_traces):Update.
(sanitize_hot_paths):Update.
* bt-load.c (migrate_btr_defs): Update.
* cfg.c (RDIV): Remove.
(init_flow): Use alloc_block.
(alloc_block): Uninitialize count.
(unchecked_make_edge): Uninitialize count.
(check_bb_profile): Update.
(dump_edge_info): Update.
(dump_bb_info): Update.
(update_bb_profile_for_threading): Update.
(scale_bbs_frequencies_int): Update.
(scale_bbs_frequencies_gcov_type): Update.
(scale_bbs_frequencies_profile_count): New.
* cfg.h (update_bb_profile_for_threading): Update.
(scale_bbs_frequencies_profile_count): Declare.
* cfgbuild.c (compute_outgoing_frequencies): Update.
(find_many_sub_basic_blocks): Update.
* cfgcleanup.c (try_forward_edges): Update.
(try_crossjump_to_edge): Update.
* cfgexpand.c (expand_gimple_tailcall): Update.
(construct_exit_block): Update.
* cfghooks.c (verify_flow_info): Update.
(dump_bb_for_graph): Update.
(split_edge): Update.
(make_forwarder_block): Update.
(duplicate_block): Update.
(account_profile_record): Update.
* cfgloop.c (find_subloop_latch_edge_by_profile): Update.
(get_estimated_loop_iterations): Update.
* cfgloopanal.c (expected_loop_iterations_unbounded): Update.
(single_likely_exit): Update.
* cfgloopmanip.c (scale_loop_profile): Update.
(loopify): Update.
(set_zero_probability): Update.
(lv_adjust_loop_entry_edge): Update.
* cfgrtl.c (force_nonfallthru_and_redirect): Update.
(purge_dead_edges): Update.
(rtl_account_profile_record): Update.
* cgraph.c (cgraph_node::create): Uninitialize count.
(symbol_table::create_edge): Uninitialize count.
(cgraph_update_edges_for_call_stmt_node): Update.
(cgraph_edge::dump_edge_flags): Update.
(cgraph_node::dump): Update.
(cgraph_edge::maybe_hot_p): Update.
* cgraph.h: Include profile-count.h
(create_clone), create_edge, create_indirect_edge): Update.
(cgraph_node): Turn count to profile_count.
(cgraph_edge0: Likewise.
(make_speculative, clone): Update.
(create_edge): Update.
(init_lowered_empty_function): Update.
* cgraphclones.c (cgraph_edge::clone): Update.
(duplicate_thunk_for_node): Update.
(cgraph_node::create_clone): Update.
* cgraphunit.c (cgraph_node::analyze): Update.
(cgraph_node::expand_thunk): Update.
* final.c (dump_basic_block_info): Update.
* gimple-streamer-in.c (input_bb): Update.
* gimple-streamer-out.c (output_bb): Update.
* graphite.c (print_global_statistics): Update.
(print_graphite_scop_statistics): Update.
* hsa-brig.c: Include basic-block.h.
* hsa-dump.c: Include basic-block.h.
* hsa-gen.c (T sum_slice): Update.
(convert_switch_statements):Update.
* hsa-regalloc.c: Include basic-block.h.
* ipa-chkp.c (chkp_produce_thunks): Update.
* ipa-cp.c (struct caller_statistics): Update.
(init_caller_stats): Update.
(gather_caller_stats): Update.
(ipcp_cloning_candidate_p): Update.
(good_cloning_opportunity_p): Update.
(get_info_about_necessary_edges): Update.
(dump_profile_updates): Update.
(update_profiling_info): Update.
(update_specialized_profile): Update.
(perhaps_add_new_callers): Update.
(decide_about_value): Update.
(ipa_cp_c_finalize): Update.
* ipa-devirt.c (struct odr_type_warn_count): Update.
(struct decl_warn_count): Update.
(struct final_warning_record): Update.
(possible_polymorphic_call_targets): Update.
(ipa_devirt): Update.
* ipa-fnsummary.c (redirect_to_unreachable): Update.
* ipa-icf.c (sem_function::merge): Update.
* ipa-inline-analysis.c (do_estimate_edge_time): Update.
* ipa-inline.c (compute_uninlined_call_time): Update.
(compute_inlined_call_time): Update.
(want_inline_small_function_p): Update.
(want_inline_self_recursive_call_p): Update.
(edge_badness): Update.
(lookup_recursive_calls): Update.
(recursive_inlining): Update.
(inline_small_functions): Update.
(dump_overall_stats): Update.
(dump_inline_stats): Update.
* ipa-profile.c (ipa_profile_generate_summary): Update.
(ipa_propagate_frequency): Update.
(ipa_profile): Update.
* ipa-prop.c (ipa_make_edge_direct_to_target): Update.
* ipa-utils.c (ipa_merge_profiles): Update.
* loop-doloop.c (doloop_modify): Update.
* loop-unroll.c (report_unroll): Update.
(unroll_loop_runtime_iterations): Update.
* lto-cgraph.c (lto_output_edge): Update.
(lto_output_node): Update.
(input_node): Update.
(input_edge): Update.
(merge_profile_summaries): Update.
* lto-streamer-in.c (input_cfg): Update.
* lto-streamer-out.c (output_cfg): Update.
* mcf.c (create_fixup_graph): Update.
(adjust_cfg_counts): Update.
(sum_edge_counts): Update.
* modulo-sched.c (sms_schedule): Update.
* postreload-gcse.c (eliminate_partially_redundant_load): Update.
* predict.c (maybe_hot_count_p): Update.
(probably_never_executed): Update.
(dump_prediction): Update.
(combine_predictions_for_bb): Update.
(propagate_freq): Update.
(handle_missing_profiles): Update.
(counts_to_freqs): Update.
(rebuild_frequencies): Update.
(force_edge_cold): Update.
* predict.h: Include profile-count.h
(maybe_hot_count_p, counts_to_freqs): UPdate.
* print-rtl-function.c: Do not include cfg.h
* print-rtl.c: Include basic-block.h
* profile-count.c: New file.
* profile-count.h: New file.
* profile.c (is_edge_inconsistent): Update.
(correct_negative_edge_counts): Update.
(is_inconsistent): Update.
(set_bb_counts): Update.
(read_profile_edge_counts): Update.
(compute_frequency_overlap): Update.
(compute_branch_probabilities): Update; Initialize and deinitialize
gcov_count tables.
(branch_prob): Update.
* profile.h (bb_gcov_counts, edge_gcov_counts): New.
(edge_gcov_count): New.
(bb_gcov_count): New.
* shrink-wrap.c (try_shrink_wrapping): Update.
* tracer.c (better_p): Update.
* trans-mem.c (expand_transaction): Update.
(ipa_tm_insert_irr_call): Update.
(ipa_tm_insert_gettmclone_call): Update.
* tree-call-cdce.c: Update.
* tree-cfg.c (gimple_duplicate_sese_region): Update.
(gimple_duplicate_sese_tail): Update.
(gimple_account_profile_record): Update.
(execute_fixup_cfg): Update.
* tree-inline.c (copy_bb): Update.
(copy_edges_for_bb): Update.
(initialize_cfun): Update.
(freqs_to_counts): Update.
(copy_cfg_body): Update.
(expand_call_inline): Update.
* tree-ssa-ifcombine.c (update_profile_after_ifcombine): Update.
* tree-ssa-loop-ivcanon.c (unloop_loops): Update.
(try_unroll_loop_completely): Update.
(try_peel_loop): Update.
* tree-ssa-loop-manip.c (tree_transform_and_unroll_loop): Update.
* tree-ssa-loop-niter.c (estimate_numbers_of_iterations_loop): Update.
* tree-ssa-loop-split.c (connect_loops): Update.
* tree-ssa-loop-unswitch.c (hoist_guard): Update.
* tree-ssa-reassoc.c (branch_fixup): Update.
* tree-ssa-tail-merge.c (replace_block_by): Update.
* tree-ssa-threadupdate.c (create_block_for_threading): Update.
(compute_path_counts): Update.
(update_profile): Update.
(recompute_probabilities): Update.
(update_joiner_offpath_counts): Update.
(estimated_freqs_path): Update.
(freqs_to_counts_path): Update.
(clear_counts_path): Update.
(ssa_fix_duplicate_block_edges): Update.
(duplicate_thread_path): Update.
* tree-switch-conversion.c (case_bit_test_cmp): Update.
(struct switch_conv_info): Update.
* tree-tailcall.c (decrease_profile): Update.
* tree-vect-loop-manip.c (slpeel_add_loop_guard): Update.
* tree-vect-loop.c (scale_profile_for_vect_loop): Update.
* value-prof.c (check_counter): Update.
(gimple_divmod_fixed_value): Update.
(gimple_mod_pow2): Update.
(gimple_mod_subtract): Update.
(gimple_ic_transform): Update.
(gimple_stringop_fixed_value): Update.
* value-prof.h (gimple_ic): Update.
* gcc.dg/tree-ssa/attr-hotcold-2.c: Update template.
From-SVN: r248863
Diffstat (limited to 'gcc/profile.c')
-rw-r--r-- | gcc/profile.c | 104 |
1 files changed, 63 insertions, 41 deletions
diff --git a/gcc/profile.c b/gcc/profile.c index 3346af4..aca5c67 100644 --- a/gcc/profile.c +++ b/gcc/profile.c @@ -67,6 +67,10 @@ along with GCC; see the file COPYING3. If not see #include "profile.h" +/* Map from BBs/edges to gcov counters. */ +vec<gcov_type> bb_gcov_counts; +hash_map<edge,gcov_type> edge_gcov_counts; + struct bb_profile_info { unsigned int count_valid : 1; @@ -303,7 +307,7 @@ is_edge_inconsistent (vec<edge, va_gc> *edges) { if (!EDGE_INFO (e)->ignore) { - if (e->count < 0 + if (edge_gcov_count (e) < 0 && (!(e->flags & EDGE_FAKE) || !block_ends_with_call_p (e->src))) { @@ -311,7 +315,7 @@ is_edge_inconsistent (vec<edge, va_gc> *edges) { fprintf (dump_file, "Edge %i->%i is inconsistent, count%" PRId64, - e->src->index, e->dest->index, e->count); + e->src->index, e->dest->index, edge_gcov_count (e)); dump_bb (dump_file, e->src, 0, TDF_DETAILS); dump_bb (dump_file, e->dest, 0, TDF_DETAILS); } @@ -333,8 +337,8 @@ correct_negative_edge_counts (void) { FOR_EACH_EDGE (e, ei, bb->succs) { - if (e->count < 0) - e->count = 0; + if (edge_gcov_count (e) < 0) + edge_gcov_count (e) = 0; } } } @@ -354,32 +358,32 @@ is_inconsistent (void) inconsistent |= is_edge_inconsistent (bb->succs); if (!dump_file && inconsistent) return true; - if (bb->count < 0) + if (bb_gcov_count (bb) < 0) { if (dump_file) { fprintf (dump_file, "BB %i count is negative " "%" PRId64, bb->index, - bb->count); + bb_gcov_count (bb)); dump_bb (dump_file, bb, 0, TDF_DETAILS); } inconsistent = true; } - if (bb->count != sum_edge_counts (bb->preds)) + if (bb_gcov_count (bb) != sum_edge_counts (bb->preds)) { if (dump_file) { fprintf (dump_file, "BB %i count does not match sum of incoming edges " "%" PRId64" should be %" PRId64, bb->index, - bb->count, + bb_gcov_count (bb), sum_edge_counts (bb->preds)); dump_bb (dump_file, bb, 0, TDF_DETAILS); } inconsistent = true; } - if (bb->count != sum_edge_counts (bb->succs) && + if (bb_gcov_count (bb) != sum_edge_counts (bb->succs) && ! (find_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun)) != NULL && block_ends_with_call_p (bb))) { @@ -388,7 +392,7 @@ is_inconsistent (void) fprintf (dump_file, "BB %i count does not match sum of outgoing edges " "%" PRId64" should be %" PRId64, bb->index, - bb->count, + bb_gcov_count (bb), sum_edge_counts (bb->succs)); dump_bb (dump_file, bb, 0, TDF_DETAILS); } @@ -408,8 +412,8 @@ set_bb_counts (void) basic_block bb; FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) { - bb->count = sum_edge_counts (bb->succs); - gcc_assert (bb->count >= 0); + bb_gcov_count (bb) = sum_edge_counts (bb->succs); + gcc_assert (bb_gcov_count (bb) >= 0); } } @@ -436,8 +440,8 @@ read_profile_edge_counts (gcov_type *exec_counts) num_edges++; if (exec_counts) { - e->count = exec_counts[exec_counts_pos++]; - if (e->count > profile_info->sum_max) + edge_gcov_count (e) = exec_counts[exec_counts_pos++]; + if (edge_gcov_count (e) > profile_info->sum_max) { if (flag_profile_correction) { @@ -454,7 +458,7 @@ read_profile_edge_counts (gcov_type *exec_counts) } } else - e->count = 0; + edge_gcov_count (e) = 0; EDGE_INFO (e)->count_valid = 1; BB_INFO (bb)->succ_count--; @@ -464,7 +468,7 @@ read_profile_edge_counts (gcov_type *exec_counts) fprintf (dump_file, "\nRead edge from %i to %i, count:", bb->index, e->dest->index); fprintf (dump_file, "%" PRId64, - (int64_t) e->count); + (int64_t) edge_gcov_count (e)); } } } @@ -491,7 +495,7 @@ compute_frequency_overlap (void) FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) { - count_total += bb->count; + count_total += bb_gcov_count (bb); freq_total += bb->frequency; } @@ -499,7 +503,7 @@ compute_frequency_overlap (void) return 0; FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) - overlap += MIN (bb->count * OVERLAP_BASE / count_total, + overlap += MIN (bb_gcov_count (bb) * OVERLAP_BASE / count_total, bb->frequency * OVERLAP_BASE / freq_total); return overlap; @@ -527,6 +531,8 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) if (!profile_info) return; + bb_gcov_counts.safe_grow_cleared (last_basic_block_for_fn (cfun)); + if (profile_info->sum_all < profile_info->sum_max) { error ("corrupted profile info: sum_all is smaller than sum_max"); @@ -592,8 +598,8 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) gcov_type total = 0; FOR_EACH_EDGE (e, ei, bb->succs) - total += e->count; - bb->count = total; + total += edge_gcov_count (e); + bb_gcov_count (bb) = total; bi->count_valid = 1; changes = 1; } @@ -604,8 +610,8 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) gcov_type total = 0; FOR_EACH_EDGE (e, ei, bb->preds) - total += e->count; - bb->count = total; + total += edge_gcov_count (e); + bb_gcov_count (bb) = total; bi->count_valid = 1; changes = 1; } @@ -621,7 +627,7 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) /* One of the counts will be invalid, but it is zero, so adding it in also doesn't hurt. */ FOR_EACH_EDGE (e, ei, bb->succs) - total += e->count; + total += edge_gcov_count (e); /* Search for the invalid edge, and set its count. */ FOR_EACH_EDGE (e, ei, bb->succs) @@ -629,11 +635,11 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) break; /* Calculate count for remaining edge by conservation. */ - total = bb->count - total; + total = bb_gcov_count (bb) - total; gcc_assert (e); EDGE_INFO (e)->count_valid = 1; - e->count = total; + edge_gcov_count (e) = total; bi->succ_count--; BB_INFO (e->dest)->pred_count--; @@ -648,7 +654,7 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) /* One of the counts will be invalid, but it is zero, so adding it in also doesn't hurt. */ FOR_EACH_EDGE (e, ei, bb->preds) - total += e->count; + total += edge_gcov_count (e); /* Search for the invalid edge, and set its count. */ FOR_EACH_EDGE (e, ei, bb->preds) @@ -656,11 +662,11 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) break; /* Calculate count for remaining edge by conservation. */ - total = bb->count - total + e->count; + total = bb_gcov_count (bb) - total + edge_gcov_count (e); gcc_assert (e); EDGE_INFO (e)->count_valid = 1; - e->count = total; + edge_gcov_count (e) = total; bi->pred_count--; BB_INFO (e->src)->succ_count--; @@ -727,11 +733,11 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) edge e; edge_iterator ei; - if (bb->count < 0) + if (bb_gcov_count (bb) < 0) { error ("corrupted profile info: number of iterations for basic block %d thought to be %i", - bb->index, (int)bb->count); - bb->count = 0; + bb->index, (int)bb_gcov_count (bb)); + bb_gcov_count (bb) = 0; } FOR_EACH_EDGE (e, ei, bb->succs) { @@ -740,26 +746,29 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) edge from the entry, since extra edge from the exit is already present. We get negative frequency from the entry point. */ - if ((e->count < 0 + if ((edge_gcov_count (e) < 0 && e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)) - || (e->count > bb->count + || (edge_gcov_count (e) > bb_gcov_count (bb) && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))) { if (block_ends_with_call_p (bb)) - e->count = e->count < 0 ? 0 : bb->count; + edge_gcov_count (e) = edge_gcov_count (e) < 0 + ? 0 : bb_gcov_count (bb); } - if (e->count < 0 || e->count > bb->count) + if (edge_gcov_count (e) < 0 + || edge_gcov_count (e) > bb_gcov_count (bb)) { error ("corrupted profile info: number of executions for edge %d-%d thought to be %i", e->src->index, e->dest->index, - (int)e->count); - e->count = bb->count / 2; + (int)edge_gcov_count (e)); + edge_gcov_count (e) = bb_gcov_count (bb) / 2; } } - if (bb->count) + if (bb_gcov_count (bb)) { FOR_EACH_EDGE (e, ei, bb->succs) - e->probability = GCOV_COMPUTE_SCALE (e->count, bb->count); + e->probability = GCOV_COMPUTE_SCALE (edge_gcov_count (e), + bb_gcov_count (bb)); if (bb->index >= NUM_FIXED_BLOCKS && block_ends_with_condjump_p (bb) && EDGE_COUNT (bb->succs) >= 2) @@ -816,6 +825,19 @@ compute_branch_probabilities (unsigned cfg_checksum, unsigned lineno_checksum) num_branches++; } } + + FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) + { + edge e; + edge_iterator ei; + + bb->count = profile_count::from_gcov_type (bb_gcov_count (bb)); + FOR_EACH_EDGE (e, ei, bb->succs) + e->count = profile_count::from_gcov_type (edge_gcov_count (e)); + } + bb_gcov_counts.release (); + edge_gcov_counts.empty (); + counts_to_freqs (); if (dump_file) @@ -1125,7 +1147,7 @@ branch_prob (void) for (i = 0 ; i < num_edges ; i++) { edge e = INDEX_EDGE (el, i); - e->count = 0; + edge_gcov_count (e) = 0; /* Mark edges we've replaced by fake edges above as ignored. */ if ((e->flags & (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL)) @@ -1323,7 +1345,7 @@ branch_prob (void) /* At this moment we have precise loop iteration count estimates. Record them to loop structure before the profile gets out of date. */ FOR_EACH_LOOP (loop, 0) - if (loop->header->count) + if (loop->header->count > 0) { gcov_type nit = expected_loop_iterations_unbounded (loop); widest_int bound = gcov_type_to_wide_int (nit); |