1 /* Transformations based on profile information for values.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
27 #include "hard-reg-set.h"
28 #include "basic-block.h"
29 #include "value-prof.h"
32 #include "insn-config.h"
37 #include "tree-flow.h"
38 #include "tree-flow-inline.h"
39 #include "diagnostic.h"
40 #include "tree-pretty-print.h"
41 #include "gimple-pretty-print.h"
47 #include "tree-pass.h"
48 #include "pointer-set.h"
50 static struct value_prof_hooks *value_prof_hooks;
52 /* In this file value profile based optimizations are placed. Currently the
53 following optimizations are implemented (for more detailed descriptions
54 see comments at value_profile_transformations):
56 1) Division/modulo specialization. Provided that we can determine that the
57 operands of the division have some special properties, we may use it to
58 produce more effective code.
59 2) Speculative prefetching. If we are able to determine that the difference
60 between addresses accessed by a memory reference is usually constant, we
61 may add the prefetch instructions.
62 FIXME: This transformation was removed together with RTL based value
65 3) Indirect/virtual call specialization. If we can determine most
66 common function callee in indirect/virtual call. We can use this
67 information to improve code effectiveness (especially info for
70 Every such optimization should add its requirements for profiled values to
71 insn_values_to_profile function. This function is called from branch_prob
72 in profile.c and the requested values are instrumented by it in the first
73 compilation with -fprofile-arcs. The optimization may then read the
74 gathered data in the second compilation with -fbranch-probabilities.
76 The measured data is pointed to from the histograms
77 field of the statement annotation of the instrumented insns. It is
78 kept as a linked list of struct histogram_value_t's, which contain the
79 same information as above. */
82 static tree gimple_divmod_fixed_value (gimple, tree, int, gcov_type, gcov_type);
83 static tree gimple_mod_pow2 (gimple, int, gcov_type, gcov_type);
84 static tree gimple_mod_subtract (gimple, int, int, int, gcov_type, gcov_type,
86 static bool gimple_divmod_fixed_value_transform (gimple_stmt_iterator *);
87 static bool gimple_mod_pow2_value_transform (gimple_stmt_iterator *);
88 static bool gimple_mod_subtract_transform (gimple_stmt_iterator *);
89 static bool gimple_stringops_transform (gimple_stmt_iterator *);
90 static bool gimple_ic_transform (gimple);
92 /* Allocate histogram value. */
94 static histogram_value
95 gimple_alloc_histogram_value (struct function *fun ATTRIBUTE_UNUSED,
96 enum hist_type type, gimple stmt, tree value)
98 histogram_value hist = (histogram_value) xcalloc (1, sizeof (*hist));
99 hist->hvalue.value = value;
100 hist->hvalue.stmt = stmt;
105 /* Hash value for histogram. */
108 histogram_hash (const void *x)
110 return htab_hash_pointer (((const_histogram_value)x)->hvalue.stmt);
113 /* Return nonzero if decl_id of die_struct X is the same as UID of decl *Y. */
116 histogram_eq (const void *x, const void *y)
118 return ((const_histogram_value) x)->hvalue.stmt == (const_gimple) y;
121 /* Set histogram for STMT. */
124 set_histogram_value (struct function *fun, gimple stmt, histogram_value hist)
127 if (!hist && !VALUE_HISTOGRAMS (fun))
129 if (!VALUE_HISTOGRAMS (fun))
130 VALUE_HISTOGRAMS (fun) = htab_create (1, histogram_hash,
132 loc = htab_find_slot_with_hash (VALUE_HISTOGRAMS (fun), stmt,
133 htab_hash_pointer (stmt),
134 hist ? INSERT : NO_INSERT);
138 htab_clear_slot (VALUE_HISTOGRAMS (fun), loc);
144 /* Get histogram list for STMT. */
147 gimple_histogram_value (struct function *fun, gimple stmt)
149 if (!VALUE_HISTOGRAMS (fun))
151 return (histogram_value) htab_find_with_hash (VALUE_HISTOGRAMS (fun), stmt,
152 htab_hash_pointer (stmt));
155 /* Add histogram for STMT. */
158 gimple_add_histogram_value (struct function *fun, gimple stmt,
159 histogram_value hist)
161 hist->hvalue.next = gimple_histogram_value (fun, stmt);
162 set_histogram_value (fun, stmt, hist);
166 /* Remove histogram HIST from STMT's histogram list. */
169 gimple_remove_histogram_value (struct function *fun, gimple stmt,
170 histogram_value hist)
172 histogram_value hist2 = gimple_histogram_value (fun, stmt);
175 set_histogram_value (fun, stmt, hist->hvalue.next);
179 while (hist2->hvalue.next != hist)
180 hist2 = hist2->hvalue.next;
181 hist2->hvalue.next = hist->hvalue.next;
183 free (hist->hvalue.counters);
184 #ifdef ENABLE_CHECKING
185 memset (hist, 0xab, sizeof (*hist));
191 /* Lookup histogram of type TYPE in the STMT. */
194 gimple_histogram_value_of_type (struct function *fun, gimple stmt,
197 histogram_value hist;
198 for (hist = gimple_histogram_value (fun, stmt); hist;
199 hist = hist->hvalue.next)
200 if (hist->type == type)
205 /* Dump information about HIST to DUMP_FILE. */
208 dump_histogram_value (FILE *dump_file, histogram_value hist)
212 case HIST_TYPE_INTERVAL:
213 fprintf (dump_file, "Interval counter range %d -- %d",
214 hist->hdata.intvl.int_start,
215 (hist->hdata.intvl.int_start
216 + hist->hdata.intvl.steps - 1));
217 if (hist->hvalue.counters)
220 fprintf(dump_file, " [");
221 for (i = 0; i < hist->hdata.intvl.steps; i++)
222 fprintf (dump_file, " %d:"HOST_WIDEST_INT_PRINT_DEC,
223 hist->hdata.intvl.int_start + i,
224 (HOST_WIDEST_INT) hist->hvalue.counters[i]);
225 fprintf (dump_file, " ] outside range:"HOST_WIDEST_INT_PRINT_DEC,
226 (HOST_WIDEST_INT) hist->hvalue.counters[i]);
228 fprintf (dump_file, ".\n");
232 fprintf (dump_file, "Pow2 counter ");
233 if (hist->hvalue.counters)
235 fprintf (dump_file, "pow2:"HOST_WIDEST_INT_PRINT_DEC
236 " nonpow2:"HOST_WIDEST_INT_PRINT_DEC,
237 (HOST_WIDEST_INT) hist->hvalue.counters[0],
238 (HOST_WIDEST_INT) hist->hvalue.counters[1]);
240 fprintf (dump_file, ".\n");
243 case HIST_TYPE_SINGLE_VALUE:
244 fprintf (dump_file, "Single value ");
245 if (hist->hvalue.counters)
247 fprintf (dump_file, "value:"HOST_WIDEST_INT_PRINT_DEC
248 " match:"HOST_WIDEST_INT_PRINT_DEC
249 " wrong:"HOST_WIDEST_INT_PRINT_DEC,
250 (HOST_WIDEST_INT) hist->hvalue.counters[0],
251 (HOST_WIDEST_INT) hist->hvalue.counters[1],
252 (HOST_WIDEST_INT) hist->hvalue.counters[2]);
254 fprintf (dump_file, ".\n");
257 case HIST_TYPE_AVERAGE:
258 fprintf (dump_file, "Average value ");
259 if (hist->hvalue.counters)
261 fprintf (dump_file, "sum:"HOST_WIDEST_INT_PRINT_DEC
262 " times:"HOST_WIDEST_INT_PRINT_DEC,
263 (HOST_WIDEST_INT) hist->hvalue.counters[0],
264 (HOST_WIDEST_INT) hist->hvalue.counters[1]);
266 fprintf (dump_file, ".\n");
270 fprintf (dump_file, "IOR value ");
271 if (hist->hvalue.counters)
273 fprintf (dump_file, "ior:"HOST_WIDEST_INT_PRINT_DEC,
274 (HOST_WIDEST_INT) hist->hvalue.counters[0]);
276 fprintf (dump_file, ".\n");
279 case HIST_TYPE_CONST_DELTA:
280 fprintf (dump_file, "Constant delta ");
281 if (hist->hvalue.counters)
283 fprintf (dump_file, "value:"HOST_WIDEST_INT_PRINT_DEC
284 " match:"HOST_WIDEST_INT_PRINT_DEC
285 " wrong:"HOST_WIDEST_INT_PRINT_DEC,
286 (HOST_WIDEST_INT) hist->hvalue.counters[0],
287 (HOST_WIDEST_INT) hist->hvalue.counters[1],
288 (HOST_WIDEST_INT) hist->hvalue.counters[2]);
290 fprintf (dump_file, ".\n");
292 case HIST_TYPE_INDIR_CALL:
293 fprintf (dump_file, "Indirect call ");
294 if (hist->hvalue.counters)
296 fprintf (dump_file, "value:"HOST_WIDEST_INT_PRINT_DEC
297 " match:"HOST_WIDEST_INT_PRINT_DEC
298 " all:"HOST_WIDEST_INT_PRINT_DEC,
299 (HOST_WIDEST_INT) hist->hvalue.counters[0],
300 (HOST_WIDEST_INT) hist->hvalue.counters[1],
301 (HOST_WIDEST_INT) hist->hvalue.counters[2]);
303 fprintf (dump_file, ".\n");
308 /* Dump all histograms attached to STMT to DUMP_FILE. */
311 dump_histograms_for_stmt (struct function *fun, FILE *dump_file, gimple stmt)
313 histogram_value hist;
314 for (hist = gimple_histogram_value (fun, stmt); hist; hist = hist->hvalue.next)
315 dump_histogram_value (dump_file, hist);
318 /* Remove all histograms associated with STMT. */
321 gimple_remove_stmt_histograms (struct function *fun, gimple stmt)
324 while ((val = gimple_histogram_value (fun, stmt)) != NULL)
325 gimple_remove_histogram_value (fun, stmt, val);
328 /* Duplicate all histograms associates with OSTMT to STMT. */
331 gimple_duplicate_stmt_histograms (struct function *fun, gimple stmt,
332 struct function *ofun, gimple ostmt)
335 for (val = gimple_histogram_value (ofun, ostmt); val != NULL; val = val->hvalue.next)
337 histogram_value new_val = gimple_alloc_histogram_value (fun, val->type, NULL, NULL);
338 memcpy (new_val, val, sizeof (*val));
339 new_val->hvalue.stmt = stmt;
340 new_val->hvalue.counters = XNEWVAR (gcov_type, sizeof (*new_val->hvalue.counters) * new_val->n_counters);
341 memcpy (new_val->hvalue.counters, val->hvalue.counters, sizeof (*new_val->hvalue.counters) * new_val->n_counters);
342 gimple_add_histogram_value (fun, stmt, new_val);
347 /* Move all histograms associated with OSTMT to STMT. */
350 gimple_move_stmt_histograms (struct function *fun, gimple stmt, gimple ostmt)
352 histogram_value val = gimple_histogram_value (fun, ostmt);
355 /* The following three statements can't be reordered,
356 because histogram hashtab relies on stmt field value
357 for finding the exact slot. */
358 set_histogram_value (fun, ostmt, NULL);
359 for (; val != NULL; val = val->hvalue.next)
360 val->hvalue.stmt = stmt;
361 set_histogram_value (fun, stmt, val);
365 static bool error_found = false;
367 /* Helper function for verify_histograms. For each histogram reachable via htab
368 walk verify that it was reached via statement walk. */
371 visit_hist (void **slot, void *data)
373 struct pointer_set_t *visited = (struct pointer_set_t *) data;
374 histogram_value hist = *(histogram_value *) slot;
375 if (!pointer_set_contains (visited, hist))
377 error ("dead histogram");
378 dump_histogram_value (stderr, hist);
379 debug_gimple_stmt (hist->hvalue.stmt);
386 /* Verify sanity of the histograms. */
389 verify_histograms (void)
392 gimple_stmt_iterator gsi;
393 histogram_value hist;
394 struct pointer_set_t *visited_hists;
397 visited_hists = pointer_set_create ();
399 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
401 gimple stmt = gsi_stmt (gsi);
403 for (hist = gimple_histogram_value (cfun, stmt); hist;
404 hist = hist->hvalue.next)
406 if (hist->hvalue.stmt != stmt)
408 error ("Histogram value statement does not correspond to "
409 "the statement it is associated with");
410 debug_gimple_stmt (stmt);
411 dump_histogram_value (stderr, hist);
414 pointer_set_insert (visited_hists, hist);
417 if (VALUE_HISTOGRAMS (cfun))
418 htab_traverse (VALUE_HISTOGRAMS (cfun), visit_hist, visited_hists);
419 pointer_set_destroy (visited_hists);
421 internal_error ("verify_histograms failed");
424 /* Helper function for verify_histograms. For each histogram reachable via htab
425 walk verify that it was reached via statement walk. */
428 free_hist (void **slot, void *data ATTRIBUTE_UNUSED)
430 histogram_value hist = *(histogram_value *) slot;
431 free (hist->hvalue.counters);
432 #ifdef ENABLE_CHECKING
433 memset (hist, 0xab, sizeof (*hist));
440 free_histograms (void)
442 if (VALUE_HISTOGRAMS (cfun))
444 htab_traverse (VALUE_HISTOGRAMS (cfun), free_hist, NULL);
445 htab_delete (VALUE_HISTOGRAMS (cfun));
446 VALUE_HISTOGRAMS (cfun) = NULL;
451 /* The overall number of invocations of the counter should match
452 execution count of basic block. Report it as error rather than
453 internal error as it might mean that user has misused the profile
457 check_counter (gimple stmt, const char * name,
458 gcov_type *count, gcov_type *all, gcov_type bb_count)
460 if (*all != bb_count || *count > *all)
463 locus = (stmt != NULL)
464 ? gimple_location (stmt)
465 : DECL_SOURCE_LOCATION (current_function_decl);
466 if (flag_profile_correction)
468 inform (locus, "correcting inconsistent value profile: "
469 "%s profiler overall count (%d) does not match BB count "
470 "(%d)", name, (int)*all, (int)bb_count);
478 error_at (locus, "corrupted value profile: %s "
479 "profiler overall count (%d) does not match BB count (%d)",
480 name, (int)*all, (int)bb_count);
489 /* GIMPLE based transformations. */
492 gimple_value_profile_transformations (void)
495 gimple_stmt_iterator gsi;
496 bool changed = false;
500 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
502 gimple stmt = gsi_stmt (gsi);
503 histogram_value th = gimple_histogram_value (cfun, stmt);
509 fprintf (dump_file, "Trying transformations on stmt ");
510 print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
511 dump_histograms_for_stmt (cfun, dump_file, stmt);
514 /* Transformations: */
515 /* The order of things in this conditional controls which
516 transformation is used when more than one is applicable. */
517 /* It is expected that any code added by the transformations
518 will be added before the current statement, and that the
519 current statement remain valid (although possibly
520 modified) upon return. */
521 if (flag_value_profile_transformations
522 && (gimple_mod_subtract_transform (&gsi)
523 || gimple_divmod_fixed_value_transform (&gsi)
524 || gimple_mod_pow2_value_transform (&gsi)
525 || gimple_stringops_transform (&gsi)
526 || gimple_ic_transform (stmt)))
528 stmt = gsi_stmt (gsi);
530 /* Original statement may no longer be in the same block. */
531 if (bb != gimple_bb (stmt))
533 bb = gimple_bb (stmt);
534 gsi = gsi_for_stmt (stmt);
549 /* Generate code for transformation 1 (with parent gimple assignment
550 STMT and probability of taking the optimal path PROB, which is
551 equivalent to COUNT/ALL within roundoff error). This generates the
552 result into a temp and returns the temp; it does not replace or
553 alter the original STMT. */
556 gimple_divmod_fixed_value (gimple stmt, tree value, int prob, gcov_type count,
559 gimple stmt1, stmt2, stmt3;
560 tree tmp0, tmp1, tmp2, tmpv;
561 gimple bb1end, bb2end, bb3end;
562 basic_block bb, bb2, bb3, bb4;
563 tree optype, op1, op2;
564 edge e12, e13, e23, e24, e34;
565 gimple_stmt_iterator gsi;
567 gcc_assert (is_gimple_assign (stmt)
568 && (gimple_assign_rhs_code (stmt) == TRUNC_DIV_EXPR
569 || gimple_assign_rhs_code (stmt) == TRUNC_MOD_EXPR));
571 optype = TREE_TYPE (gimple_assign_lhs (stmt));
572 op1 = gimple_assign_rhs1 (stmt);
573 op2 = gimple_assign_rhs2 (stmt);
575 bb = gimple_bb (stmt);
576 gsi = gsi_for_stmt (stmt);
578 tmpv = create_tmp_reg (optype, "PROF");
579 tmp0 = make_ssa_name (tmpv, NULL);
580 tmp1 = make_ssa_name (tmpv, NULL);
581 stmt1 = gimple_build_assign (tmp0, fold_convert (optype, value));
582 SSA_NAME_DEF_STMT (tmp0) = stmt1;
583 stmt2 = gimple_build_assign (tmp1, op2);
584 SSA_NAME_DEF_STMT (tmp1) = stmt2;
585 stmt3 = gimple_build_cond (NE_EXPR, tmp1, tmp0, NULL_TREE, NULL_TREE);
586 gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
587 gsi_insert_before (&gsi, stmt2, GSI_SAME_STMT);
588 gsi_insert_before (&gsi, stmt3, GSI_SAME_STMT);
591 tmp2 = make_rename_temp (optype, "PROF");
592 stmt1 = gimple_build_assign_with_ops (gimple_assign_rhs_code (stmt), tmp2,
594 gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
597 stmt1 = gimple_build_assign_with_ops (gimple_assign_rhs_code (stmt), tmp2,
599 gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
603 /* Edge e23 connects bb2 to bb3, etc. */
604 e12 = split_block (bb, bb1end);
607 e23 = split_block (bb2, bb2end);
609 bb3->count = all - count;
610 e34 = split_block (bb3, bb3end);
614 e12->flags &= ~EDGE_FALLTHRU;
615 e12->flags |= EDGE_FALSE_VALUE;
616 e12->probability = prob;
619 e13 = make_edge (bb, bb3, EDGE_TRUE_VALUE);
620 e13->probability = REG_BR_PROB_BASE - prob;
621 e13->count = all - count;
625 e24 = make_edge (bb2, bb4, EDGE_FALLTHRU);
626 e24->probability = REG_BR_PROB_BASE;
629 e34->probability = REG_BR_PROB_BASE;
630 e34->count = all - count;
636 /* Do transform 1) on INSN if applicable. */
639 gimple_divmod_fixed_value_transform (gimple_stmt_iterator *si)
641 histogram_value histogram;
643 gcov_type val, count, all;
644 tree result, value, tree_val;
648 stmt = gsi_stmt (*si);
649 if (gimple_code (stmt) != GIMPLE_ASSIGN)
652 if (!INTEGRAL_TYPE_P (TREE_TYPE (gimple_assign_lhs (stmt))))
655 code = gimple_assign_rhs_code (stmt);
657 if (code != TRUNC_DIV_EXPR && code != TRUNC_MOD_EXPR)
660 histogram = gimple_histogram_value_of_type (cfun, stmt,
661 HIST_TYPE_SINGLE_VALUE);
665 value = histogram->hvalue.value;
666 val = histogram->hvalue.counters[0];
667 count = histogram->hvalue.counters[1];
668 all = histogram->hvalue.counters[2];
669 gimple_remove_histogram_value (cfun, stmt, histogram);
671 /* We require that count is at least half of all; this means
672 that for the transformation to fire the value must be constant
673 at least 50% of time (and 75% gives the guarantee of usage). */
674 if (simple_cst_equal (gimple_assign_rhs2 (stmt), value) != 1
676 || optimize_bb_for_size_p (gimple_bb (stmt)))
679 if (check_counter (stmt, "value", &count, &all, gimple_bb (stmt)->count))
682 /* Compute probability of taking the optimal path. */
684 prob = (count * REG_BR_PROB_BASE + all / 2) / all;
688 tree_val = build_int_cst_wide (get_gcov_type (),
689 (unsigned HOST_WIDE_INT) val,
690 val >> (HOST_BITS_PER_WIDE_INT - 1) >> 1);
691 result = gimple_divmod_fixed_value (stmt, tree_val, prob, count, all);
695 fprintf (dump_file, "Div/mod by constant ");
696 print_generic_expr (dump_file, value, TDF_SLIM);
697 fprintf (dump_file, "=");
698 print_generic_expr (dump_file, tree_val, TDF_SLIM);
699 fprintf (dump_file, " transformation on insn ");
700 print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
703 gimple_assign_set_rhs_from_tree (si, result);
704 update_stmt (gsi_stmt (*si));
709 /* Generate code for transformation 2 (with parent gimple assign STMT and
710 probability of taking the optimal path PROB, which is equivalent to COUNT/ALL
711 within roundoff error). This generates the result into a temp and returns
712 the temp; it does not replace or alter the original STMT. */
714 gimple_mod_pow2 (gimple stmt, int prob, gcov_type count, gcov_type all)
716 gimple stmt1, stmt2, stmt3, stmt4;
717 tree tmp2, tmp3, tmpv;
718 gimple bb1end, bb2end, bb3end;
719 basic_block bb, bb2, bb3, bb4;
720 tree optype, op1, op2;
721 edge e12, e13, e23, e24, e34;
722 gimple_stmt_iterator gsi;
725 gcc_assert (is_gimple_assign (stmt)
726 && gimple_assign_rhs_code (stmt) == TRUNC_MOD_EXPR);
728 optype = TREE_TYPE (gimple_assign_lhs (stmt));
729 op1 = gimple_assign_rhs1 (stmt);
730 op2 = gimple_assign_rhs2 (stmt);
732 bb = gimple_bb (stmt);
733 gsi = gsi_for_stmt (stmt);
735 result = make_rename_temp (optype, "PROF");
736 tmpv = create_tmp_var (optype, "PROF");
737 tmp2 = make_ssa_name (tmpv, NULL);
738 tmp3 = make_ssa_name (tmpv, NULL);
739 stmt2 = gimple_build_assign_with_ops (PLUS_EXPR, tmp2, op2,
740 build_int_cst (optype, -1));
741 SSA_NAME_DEF_STMT (tmp2) = stmt2;
742 stmt3 = gimple_build_assign_with_ops (BIT_AND_EXPR, tmp3, tmp2, op2);
743 SSA_NAME_DEF_STMT (tmp3) = stmt3;
744 stmt4 = gimple_build_cond (NE_EXPR, tmp3, build_int_cst (optype, 0),
745 NULL_TREE, NULL_TREE);
746 gsi_insert_before (&gsi, stmt2, GSI_SAME_STMT);
747 gsi_insert_before (&gsi, stmt3, GSI_SAME_STMT);
748 gsi_insert_before (&gsi, stmt4, GSI_SAME_STMT);
751 /* tmp2 == op2-1 inherited from previous block. */
752 stmt1 = gimple_build_assign_with_ops (BIT_AND_EXPR, result, op1, tmp2);
753 gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
756 stmt1 = gimple_build_assign_with_ops (gimple_assign_rhs_code (stmt), result,
758 gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
762 /* Edge e23 connects bb2 to bb3, etc. */
763 e12 = split_block (bb, bb1end);
766 e23 = split_block (bb2, bb2end);
768 bb3->count = all - count;
769 e34 = split_block (bb3, bb3end);
773 e12->flags &= ~EDGE_FALLTHRU;
774 e12->flags |= EDGE_FALSE_VALUE;
775 e12->probability = prob;
778 e13 = make_edge (bb, bb3, EDGE_TRUE_VALUE);
779 e13->probability = REG_BR_PROB_BASE - prob;
780 e13->count = all - count;
784 e24 = make_edge (bb2, bb4, EDGE_FALLTHRU);
785 e24->probability = REG_BR_PROB_BASE;
788 e34->probability = REG_BR_PROB_BASE;
789 e34->count = all - count;
794 /* Do transform 2) on INSN if applicable. */
796 gimple_mod_pow2_value_transform (gimple_stmt_iterator *si)
798 histogram_value histogram;
800 gcov_type count, wrong_values, all;
801 tree lhs_type, result, value;
805 stmt = gsi_stmt (*si);
806 if (gimple_code (stmt) != GIMPLE_ASSIGN)
809 lhs_type = TREE_TYPE (gimple_assign_lhs (stmt));
810 if (!INTEGRAL_TYPE_P (lhs_type))
813 code = gimple_assign_rhs_code (stmt);
815 if (code != TRUNC_MOD_EXPR || !TYPE_UNSIGNED (lhs_type))
818 histogram = gimple_histogram_value_of_type (cfun, stmt, HIST_TYPE_POW2);
822 value = histogram->hvalue.value;
823 wrong_values = histogram->hvalue.counters[0];
824 count = histogram->hvalue.counters[1];
826 gimple_remove_histogram_value (cfun, stmt, histogram);
828 /* We require that we hit a power of 2 at least half of all evaluations. */
829 if (simple_cst_equal (gimple_assign_rhs2 (stmt), value) != 1
830 || count < wrong_values
831 || optimize_bb_for_size_p (gimple_bb (stmt)))
836 fprintf (dump_file, "Mod power of 2 transformation on insn ");
837 print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
840 /* Compute probability of taking the optimal path. */
841 all = count + wrong_values;
843 if (check_counter (stmt, "pow2", &count, &all, gimple_bb (stmt)->count))
847 prob = (count * REG_BR_PROB_BASE + all / 2) / all;
851 result = gimple_mod_pow2 (stmt, prob, count, all);
853 gimple_assign_set_rhs_from_tree (si, result);
854 update_stmt (gsi_stmt (*si));
859 /* Generate code for transformations 3 and 4 (with parent gimple assign STMT, and
860 NCOUNTS the number of cases to support. Currently only NCOUNTS==0 or 1 is
861 supported and this is built into this interface. The probabilities of taking
862 the optimal paths are PROB1 and PROB2, which are equivalent to COUNT1/ALL and
863 COUNT2/ALL respectively within roundoff error). This generates the
864 result into a temp and returns the temp; it does not replace or alter
865 the original STMT. */
866 /* FIXME: Generalize the interface to handle NCOUNTS > 1. */
869 gimple_mod_subtract (gimple stmt, int prob1, int prob2, int ncounts,
870 gcov_type count1, gcov_type count2, gcov_type all)
872 gimple stmt1, stmt2, stmt3;
874 gimple bb1end, bb2end = NULL, bb3end;
875 basic_block bb, bb2, bb3, bb4;
876 tree optype, op1, op2;
877 edge e12, e23 = 0, e24, e34, e14;
878 gimple_stmt_iterator gsi;
881 gcc_assert (is_gimple_assign (stmt)
882 && gimple_assign_rhs_code (stmt) == TRUNC_MOD_EXPR);
884 optype = TREE_TYPE (gimple_assign_lhs (stmt));
885 op1 = gimple_assign_rhs1 (stmt);
886 op2 = gimple_assign_rhs2 (stmt);
888 bb = gimple_bb (stmt);
889 gsi = gsi_for_stmt (stmt);
891 result = make_rename_temp (optype, "PROF");
892 tmp1 = make_ssa_name (create_tmp_var (optype, "PROF"), NULL);
893 stmt1 = gimple_build_assign (result, op1);
894 stmt2 = gimple_build_assign (tmp1, op2);
895 SSA_NAME_DEF_STMT (tmp1) = stmt2;
896 stmt3 = gimple_build_cond (LT_EXPR, result, tmp1, NULL_TREE, NULL_TREE);
897 gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
898 gsi_insert_before (&gsi, stmt2, GSI_SAME_STMT);
899 gsi_insert_before (&gsi, stmt3, GSI_SAME_STMT);
902 if (ncounts) /* Assumed to be 0 or 1 */
904 stmt1 = gimple_build_assign_with_ops (MINUS_EXPR, result, result, tmp1);
905 stmt2 = gimple_build_cond (LT_EXPR, result, tmp1, NULL_TREE, NULL_TREE);
906 gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
907 gsi_insert_before (&gsi, stmt2, GSI_SAME_STMT);
912 stmt1 = gimple_build_assign_with_ops (gimple_assign_rhs_code (stmt), result,
914 gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
918 /* Edge e23 connects bb2 to bb3, etc. */
919 /* However block 3 is optional; if it is not there, references
920 to 3 really refer to block 2. */
921 e12 = split_block (bb, bb1end);
923 bb2->count = all - count1;
925 if (ncounts) /* Assumed to be 0 or 1. */
927 e23 = split_block (bb2, bb2end);
929 bb3->count = all - count1 - count2;
932 e34 = split_block (ncounts ? bb3 : bb2, bb3end);
936 e12->flags &= ~EDGE_FALLTHRU;
937 e12->flags |= EDGE_FALSE_VALUE;
938 e12->probability = REG_BR_PROB_BASE - prob1;
939 e12->count = all - count1;
941 e14 = make_edge (bb, bb4, EDGE_TRUE_VALUE);
942 e14->probability = prob1;
945 if (ncounts) /* Assumed to be 0 or 1. */
947 e23->flags &= ~EDGE_FALLTHRU;
948 e23->flags |= EDGE_FALSE_VALUE;
949 e23->count = all - count1 - count2;
950 e23->probability = REG_BR_PROB_BASE - prob2;
952 e24 = make_edge (bb2, bb4, EDGE_TRUE_VALUE);
953 e24->probability = prob2;
957 e34->probability = REG_BR_PROB_BASE;
958 e34->count = all - count1 - count2;
964 /* Do transforms 3) and 4) on the statement pointed-to by SI if applicable. */
967 gimple_mod_subtract_transform (gimple_stmt_iterator *si)
969 histogram_value histogram;
971 gcov_type count, wrong_values, all;
972 tree lhs_type, result;
973 gcov_type prob1, prob2;
974 unsigned int i, steps;
975 gcov_type count1, count2;
978 stmt = gsi_stmt (*si);
979 if (gimple_code (stmt) != GIMPLE_ASSIGN)
982 lhs_type = TREE_TYPE (gimple_assign_lhs (stmt));
983 if (!INTEGRAL_TYPE_P (lhs_type))
986 code = gimple_assign_rhs_code (stmt);
988 if (code != TRUNC_MOD_EXPR || !TYPE_UNSIGNED (lhs_type))
991 histogram = gimple_histogram_value_of_type (cfun, stmt, HIST_TYPE_INTERVAL);
997 for (i = 0; i < histogram->hdata.intvl.steps; i++)
998 all += histogram->hvalue.counters[i];
1000 wrong_values += histogram->hvalue.counters[i];
1001 wrong_values += histogram->hvalue.counters[i+1];
1002 steps = histogram->hdata.intvl.steps;
1003 all += wrong_values;
1004 count1 = histogram->hvalue.counters[0];
1005 count2 = histogram->hvalue.counters[1];
1007 /* Compute probability of taking the optimal path. */
1008 if (check_counter (stmt, "interval", &count1, &all, gimple_bb (stmt)->count))
1010 gimple_remove_histogram_value (cfun, stmt, histogram);
1014 if (flag_profile_correction && count1 + count2 > all)
1015 all = count1 + count2;
1017 gcc_assert (count1 + count2 <= all);
1019 /* We require that we use just subtractions in at least 50% of all
1022 for (i = 0; i < histogram->hdata.intvl.steps; i++)
1024 count += histogram->hvalue.counters[i];
1025 if (count * 2 >= all)
1029 || optimize_bb_for_size_p (gimple_bb (stmt)))
1032 gimple_remove_histogram_value (cfun, stmt, histogram);
1035 fprintf (dump_file, "Mod subtract transformation on insn ");
1036 print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
1039 /* Compute probability of taking the optimal path(s). */
1042 prob1 = (count1 * REG_BR_PROB_BASE + all / 2) / all;
1043 prob2 = (count2 * REG_BR_PROB_BASE + all / 2) / all;
1050 /* In practice, "steps" is always 2. This interface reflects this,
1051 and will need to be changed if "steps" can change. */
1052 result = gimple_mod_subtract (stmt, prob1, prob2, i, count1, count2, all);
1054 gimple_assign_set_rhs_from_tree (si, result);
1055 update_stmt (gsi_stmt (*si));
1060 static struct cgraph_node** pid_map = NULL;
1062 /* Initialize map of pids (pid -> cgraph node) */
1067 struct cgraph_node *n;
1069 if (pid_map != NULL)
1072 pid_map = XCNEWVEC (struct cgraph_node*, cgraph_max_pid);
1074 for (n = cgraph_nodes; n; n = n->next)
1077 pid_map [n->pid] = n;
1081 /* Return cgraph node for function with pid */
1083 static inline struct cgraph_node*
1084 find_func_by_pid (int pid)
1088 return pid_map [pid];
1091 /* Do transformation
1093 if (actual_callee_address == address_of_most_common_function/method)
1100 gimple_ic (gimple icall_stmt, struct cgraph_node *direct_call,
1101 int prob, gcov_type count, gcov_type all)
1103 gimple dcall_stmt, load_stmt, cond_stmt;
1104 tree tmp0, tmp1, tmpv, tmp;
1105 basic_block cond_bb, dcall_bb, icall_bb, join_bb;
1106 tree optype = build_pointer_type (void_type_node);
1107 edge e_cd, e_ci, e_di, e_dj, e_ij;
1108 gimple_stmt_iterator gsi;
1111 cond_bb = gimple_bb (icall_stmt);
1112 gsi = gsi_for_stmt (icall_stmt);
1114 tmpv = create_tmp_reg (optype, "PROF");
1115 tmp0 = make_ssa_name (tmpv, NULL);
1116 tmp1 = make_ssa_name (tmpv, NULL);
1117 tmp = unshare_expr (gimple_call_fn (icall_stmt));
1118 load_stmt = gimple_build_assign (tmp0, tmp);
1119 SSA_NAME_DEF_STMT (tmp0) = load_stmt;
1120 gsi_insert_before (&gsi, load_stmt, GSI_SAME_STMT);
1122 tmp = fold_convert (optype, build_addr (direct_call->decl,
1123 current_function_decl));
1124 load_stmt = gimple_build_assign (tmp1, tmp);
1125 SSA_NAME_DEF_STMT (tmp1) = load_stmt;
1126 gsi_insert_before (&gsi, load_stmt, GSI_SAME_STMT);
1128 cond_stmt = gimple_build_cond (EQ_EXPR, tmp1, tmp0, NULL_TREE, NULL_TREE);
1129 gsi_insert_before (&gsi, cond_stmt, GSI_SAME_STMT);
1131 gimple_set_vdef (icall_stmt, NULL_TREE);
1132 gimple_set_vuse (icall_stmt, NULL_TREE);
1133 update_stmt (icall_stmt);
1134 dcall_stmt = gimple_copy (icall_stmt);
1135 gimple_call_set_fndecl (dcall_stmt, direct_call->decl);
1136 gsi_insert_before (&gsi, dcall_stmt, GSI_SAME_STMT);
1139 /* Edge e_cd connects cond_bb to dcall_bb, etc; note the first letters. */
1140 e_cd = split_block (cond_bb, cond_stmt);
1141 dcall_bb = e_cd->dest;
1142 dcall_bb->count = count;
1144 e_di = split_block (dcall_bb, dcall_stmt);
1145 icall_bb = e_di->dest;
1146 icall_bb->count = all - count;
1148 e_ij = split_block (icall_bb, icall_stmt);
1149 join_bb = e_ij->dest;
1150 join_bb->count = all;
1152 e_cd->flags = (e_cd->flags & ~EDGE_FALLTHRU) | EDGE_TRUE_VALUE;
1153 e_cd->probability = prob;
1154 e_cd->count = count;
1156 e_ci = make_edge (cond_bb, icall_bb, EDGE_FALSE_VALUE);
1157 e_ci->probability = REG_BR_PROB_BASE - prob;
1158 e_ci->count = all - count;
1162 e_dj = make_edge (dcall_bb, join_bb, EDGE_FALLTHRU);
1163 e_dj->probability = REG_BR_PROB_BASE;
1164 e_dj->count = count;
1166 e_ij->probability = REG_BR_PROB_BASE;
1167 e_ij->count = all - count;
1169 /* Insert PHI node for the call result if necessary. */
1170 if (gimple_call_lhs (icall_stmt)
1171 && TREE_CODE (gimple_call_lhs (icall_stmt)) == SSA_NAME)
1173 tree result = gimple_call_lhs (icall_stmt);
1174 gimple phi = create_phi_node (result, join_bb);
1175 SSA_NAME_DEF_STMT (result) = phi;
1176 gimple_call_set_lhs (icall_stmt,
1177 make_ssa_name (SSA_NAME_VAR (result), icall_stmt));
1178 add_phi_arg (phi, gimple_call_lhs (icall_stmt), e_ij, UNKNOWN_LOCATION);
1179 gimple_call_set_lhs (dcall_stmt,
1180 make_ssa_name (SSA_NAME_VAR (result), dcall_stmt));
1181 add_phi_arg (phi, gimple_call_lhs (dcall_stmt), e_dj, UNKNOWN_LOCATION);
1185 lp_nr = lookup_stmt_eh_lp (icall_stmt);
1188 if (stmt_could_throw_p (dcall_stmt))
1190 add_stmt_to_eh_lp (dcall_stmt, lp_nr);
1191 make_eh_edges (dcall_stmt);
1194 gcc_assert (stmt_could_throw_p (icall_stmt));
1195 make_eh_edges (icall_stmt);
1197 /* The old EH edges are sill on the join BB, purge them. */
1198 gimple_purge_dead_eh_edges (join_bb);
1205 For every checked indirect/virtual call determine if most common pid of
1206 function/class method has probability more than 50%. If yes modify code of
1211 gimple_ic_transform (gimple stmt)
1213 histogram_value histogram;
1214 gcov_type val, count, all, bb_all;
1218 struct cgraph_node *direct_call;
1220 if (gimple_code (stmt) != GIMPLE_CALL)
1223 callee = gimple_call_fn (stmt);
1225 if (TREE_CODE (callee) == FUNCTION_DECL)
1228 histogram = gimple_histogram_value_of_type (cfun, stmt, HIST_TYPE_INDIR_CALL);
1232 val = histogram->hvalue.counters [0];
1233 count = histogram->hvalue.counters [1];
1234 all = histogram->hvalue.counters [2];
1235 gimple_remove_histogram_value (cfun, stmt, histogram);
1237 if (4 * count <= 3 * all)
1240 bb_all = gimple_bb (stmt)->count;
1241 /* The order of CHECK_COUNTER calls is important -
1242 since check_counter can correct the third parameter
1243 and we want to make count <= all <= bb_all. */
1244 if ( check_counter (stmt, "ic", &all, &bb_all, bb_all)
1245 || check_counter (stmt, "ic", &count, &all, all))
1249 prob = (count * REG_BR_PROB_BASE + all / 2) / all;
1252 direct_call = find_func_by_pid ((int)val);
1254 if (direct_call == NULL)
1257 modify = gimple_ic (stmt, direct_call, prob, count, all);
1261 fprintf (dump_file, "Indirect call -> direct call ");
1262 print_generic_expr (dump_file, gimple_call_fn (stmt), TDF_SLIM);
1263 fprintf (dump_file, "=> ");
1264 print_generic_expr (dump_file, direct_call->decl, TDF_SLIM);
1265 fprintf (dump_file, " transformation on insn ");
1266 print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
1267 fprintf (dump_file, " to ");
1268 print_gimple_stmt (dump_file, modify, 0, TDF_SLIM);
1269 fprintf (dump_file, "hist->count "HOST_WIDEST_INT_PRINT_DEC
1270 " hist->all "HOST_WIDEST_INT_PRINT_DEC"\n", count, all);
1276 /* Return true if the stringop CALL with FNDECL shall be profiled.
1277 SIZE_ARG be set to the argument index for the size of the string
1281 interesting_stringop_to_profile_p (tree fndecl, gimple call, int *size_arg)
1283 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
1285 if (fcode != BUILT_IN_MEMCPY && fcode != BUILT_IN_MEMPCPY
1286 && fcode != BUILT_IN_MEMSET && fcode != BUILT_IN_BZERO)
1291 case BUILT_IN_MEMCPY:
1292 case BUILT_IN_MEMPCPY:
1294 return validate_gimple_arglist (call, POINTER_TYPE, POINTER_TYPE,
1295 INTEGER_TYPE, VOID_TYPE);
1296 case BUILT_IN_MEMSET:
1298 return validate_gimple_arglist (call, POINTER_TYPE, INTEGER_TYPE,
1299 INTEGER_TYPE, VOID_TYPE);
1300 case BUILT_IN_BZERO:
1302 return validate_gimple_arglist (call, POINTER_TYPE, INTEGER_TYPE,
1309 /* Convert stringop (..., vcall_size)
1311 if (vcall_size == icall_size)
1312 stringop (..., icall_size);
1314 stringop (..., vcall_size);
1315 assuming we'll propagate a true constant into ICALL_SIZE later. */
1318 gimple_stringop_fixed_value (gimple vcall_stmt, tree icall_size, int prob,
1319 gcov_type count, gcov_type all)
1321 gimple tmp_stmt, cond_stmt, icall_stmt;
1322 tree tmp0, tmp1, tmpv, vcall_size, optype;
1323 basic_block cond_bb, icall_bb, vcall_bb, join_bb;
1324 edge e_ci, e_cv, e_iv, e_ij, e_vj;
1325 gimple_stmt_iterator gsi;
1329 fndecl = gimple_call_fndecl (vcall_stmt);
1330 if (!interesting_stringop_to_profile_p (fndecl, vcall_stmt, &size_arg))
1333 cond_bb = gimple_bb (vcall_stmt);
1334 gsi = gsi_for_stmt (vcall_stmt);
1336 vcall_size = gimple_call_arg (vcall_stmt, size_arg);
1337 optype = TREE_TYPE (vcall_size);
1339 tmpv = create_tmp_var (optype, "PROF");
1340 tmp0 = make_ssa_name (tmpv, NULL);
1341 tmp1 = make_ssa_name (tmpv, NULL);
1342 tmp_stmt = gimple_build_assign (tmp0, fold_convert (optype, icall_size));
1343 SSA_NAME_DEF_STMT (tmp0) = tmp_stmt;
1344 gsi_insert_before (&gsi, tmp_stmt, GSI_SAME_STMT);
1346 tmp_stmt = gimple_build_assign (tmp1, vcall_size);
1347 SSA_NAME_DEF_STMT (tmp1) = tmp_stmt;
1348 gsi_insert_before (&gsi, tmp_stmt, GSI_SAME_STMT);
1350 cond_stmt = gimple_build_cond (EQ_EXPR, tmp1, tmp0, NULL_TREE, NULL_TREE);
1351 gsi_insert_before (&gsi, cond_stmt, GSI_SAME_STMT);
1353 gimple_set_vdef (vcall_stmt, NULL);
1354 gimple_set_vuse (vcall_stmt, NULL);
1355 update_stmt (vcall_stmt);
1356 icall_stmt = gimple_copy (vcall_stmt);
1357 gimple_call_set_arg (icall_stmt, size_arg, icall_size);
1358 gsi_insert_before (&gsi, icall_stmt, GSI_SAME_STMT);
1361 /* Edge e_ci connects cond_bb to icall_bb, etc. */
1362 e_ci = split_block (cond_bb, cond_stmt);
1363 icall_bb = e_ci->dest;
1364 icall_bb->count = count;
1366 e_iv = split_block (icall_bb, icall_stmt);
1367 vcall_bb = e_iv->dest;
1368 vcall_bb->count = all - count;
1370 e_vj = split_block (vcall_bb, vcall_stmt);
1371 join_bb = e_vj->dest;
1372 join_bb->count = all;
1374 e_ci->flags = (e_ci->flags & ~EDGE_FALLTHRU) | EDGE_TRUE_VALUE;
1375 e_ci->probability = prob;
1376 e_ci->count = count;
1378 e_cv = make_edge (cond_bb, vcall_bb, EDGE_FALSE_VALUE);
1379 e_cv->probability = REG_BR_PROB_BASE - prob;
1380 e_cv->count = all - count;
1384 e_ij = make_edge (icall_bb, join_bb, EDGE_FALLTHRU);
1385 e_ij->probability = REG_BR_PROB_BASE;
1386 e_ij->count = count;
1388 e_vj->probability = REG_BR_PROB_BASE;
1389 e_vj->count = all - count;
1391 /* Because these are all string op builtins, they're all nothrow. */
1392 gcc_assert (!stmt_could_throw_p (vcall_stmt));
1393 gcc_assert (!stmt_could_throw_p (icall_stmt));
1396 /* Find values inside STMT for that we want to measure histograms for
1397 division/modulo optimization. */
1399 gimple_stringops_transform (gimple_stmt_iterator *gsi)
1401 gimple stmt = gsi_stmt (*gsi);
1404 enum built_in_function fcode;
1405 histogram_value histogram;
1406 gcov_type count, all, val;
1408 unsigned int dest_align, src_align;
1413 if (gimple_code (stmt) != GIMPLE_CALL)
1415 fndecl = gimple_call_fndecl (stmt);
1418 fcode = DECL_FUNCTION_CODE (fndecl);
1419 if (!interesting_stringop_to_profile_p (fndecl, stmt, &size_arg))
1422 blck_size = gimple_call_arg (stmt, size_arg);
1423 if (TREE_CODE (blck_size) == INTEGER_CST)
1426 histogram = gimple_histogram_value_of_type (cfun, stmt, HIST_TYPE_SINGLE_VALUE);
1429 val = histogram->hvalue.counters[0];
1430 count = histogram->hvalue.counters[1];
1431 all = histogram->hvalue.counters[2];
1432 gimple_remove_histogram_value (cfun, stmt, histogram);
1433 /* We require that count is at least half of all; this means
1434 that for the transformation to fire the value must be constant
1435 at least 80% of time. */
1436 if ((6 * count / 5) < all || optimize_bb_for_size_p (gimple_bb (stmt)))
1438 if (check_counter (stmt, "value", &count, &all, gimple_bb (stmt)->count))
1441 prob = (count * REG_BR_PROB_BASE + all / 2) / all;
1444 dest = gimple_call_arg (stmt, 0);
1445 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
1448 case BUILT_IN_MEMCPY:
1449 case BUILT_IN_MEMPCPY:
1450 src = gimple_call_arg (stmt, 1);
1451 src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
1452 if (!can_move_by_pieces (val, MIN (dest_align, src_align)))
1455 case BUILT_IN_MEMSET:
1456 if (!can_store_by_pieces (val, builtin_memset_read_str,
1457 gimple_call_arg (stmt, 1),
1461 case BUILT_IN_BZERO:
1462 if (!can_store_by_pieces (val, builtin_memset_read_str,
1470 tree_val = build_int_cst_wide (get_gcov_type (),
1471 (unsigned HOST_WIDE_INT) val,
1472 val >> (HOST_BITS_PER_WIDE_INT - 1) >> 1);
1475 fprintf (dump_file, "Single value %i stringop transformation on ",
1477 print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
1479 gimple_stringop_fixed_value (stmt, tree_val, prob, count, all);
1485 stringop_block_profile (gimple stmt, unsigned int *expected_align,
1486 HOST_WIDE_INT *expected_size)
1488 histogram_value histogram;
1489 histogram = gimple_histogram_value_of_type (cfun, stmt, HIST_TYPE_AVERAGE);
1491 *expected_size = -1;
1492 else if (!histogram->hvalue.counters[1])
1494 *expected_size = -1;
1495 gimple_remove_histogram_value (cfun, stmt, histogram);
1500 size = ((histogram->hvalue.counters[0]
1501 + histogram->hvalue.counters[1] / 2)
1502 / histogram->hvalue.counters[1]);
1503 /* Even if we can hold bigger value in SIZE, INT_MAX
1504 is safe "infinity" for code generation strategies. */
1507 *expected_size = size;
1508 gimple_remove_histogram_value (cfun, stmt, histogram);
1510 histogram = gimple_histogram_value_of_type (cfun, stmt, HIST_TYPE_IOR);
1512 *expected_align = 0;
1513 else if (!histogram->hvalue.counters[0])
1515 gimple_remove_histogram_value (cfun, stmt, histogram);
1516 *expected_align = 0;
1523 count = histogram->hvalue.counters[0];
1525 while (!(count & alignment)
1526 && (alignment * 2 * BITS_PER_UNIT))
1528 *expected_align = alignment * BITS_PER_UNIT;
1529 gimple_remove_histogram_value (cfun, stmt, histogram);
1533 struct value_prof_hooks {
1534 /* Find list of values for which we want to measure histograms. */
1535 void (*find_values_to_profile) (histogram_values *);
1537 /* Identify and exploit properties of values that are hard to analyze
1538 statically. See value-prof.c for more detail. */
1539 bool (*value_profile_transformations) (void);
1542 /* Find values inside STMT for that we want to measure histograms for
1543 division/modulo optimization. */
1545 gimple_divmod_values_to_profile (gimple stmt, histogram_values *values)
1547 tree lhs, divisor, op0, type;
1548 histogram_value hist;
1550 if (gimple_code (stmt) != GIMPLE_ASSIGN)
1553 lhs = gimple_assign_lhs (stmt);
1554 type = TREE_TYPE (lhs);
1555 if (!INTEGRAL_TYPE_P (type))
1558 switch (gimple_assign_rhs_code (stmt))
1560 case TRUNC_DIV_EXPR:
1561 case TRUNC_MOD_EXPR:
1562 divisor = gimple_assign_rhs2 (stmt);
1563 op0 = gimple_assign_rhs1 (stmt);
1565 VEC_reserve (histogram_value, heap, *values, 3);
1567 if (is_gimple_reg (divisor))
1568 /* Check for the case where the divisor is the same value most
1570 VEC_quick_push (histogram_value, *values,
1571 gimple_alloc_histogram_value (cfun,
1572 HIST_TYPE_SINGLE_VALUE,
1575 /* For mod, check whether it is not often a noop (or replaceable by
1576 a few subtractions). */
1577 if (gimple_assign_rhs_code (stmt) == TRUNC_MOD_EXPR
1578 && TYPE_UNSIGNED (type))
1581 /* Check for a special case where the divisor is power of 2. */
1582 VEC_quick_push (histogram_value, *values,
1583 gimple_alloc_histogram_value (cfun, HIST_TYPE_POW2,
1586 val = build2 (TRUNC_DIV_EXPR, type, op0, divisor);
1587 hist = gimple_alloc_histogram_value (cfun, HIST_TYPE_INTERVAL,
1589 hist->hdata.intvl.int_start = 0;
1590 hist->hdata.intvl.steps = 2;
1591 VEC_quick_push (histogram_value, *values, hist);
1600 /* Find calls inside STMT for that we want to measure histograms for
1601 indirect/virtual call optimization. */
1604 gimple_indirect_call_to_profile (gimple stmt, histogram_values *values)
1608 if (gimple_code (stmt) != GIMPLE_CALL
1609 || gimple_call_fndecl (stmt) != NULL_TREE)
1612 callee = gimple_call_fn (stmt);
1614 VEC_reserve (histogram_value, heap, *values, 3);
1616 VEC_quick_push (histogram_value, *values,
1617 gimple_alloc_histogram_value (cfun, HIST_TYPE_INDIR_CALL,
1623 /* Find values inside STMT for that we want to measure histograms for
1624 string operations. */
1626 gimple_stringops_values_to_profile (gimple stmt, histogram_values *values)
1633 if (gimple_code (stmt) != GIMPLE_CALL)
1635 fndecl = gimple_call_fndecl (stmt);
1639 if (!interesting_stringop_to_profile_p (fndecl, stmt, &size_arg))
1642 dest = gimple_call_arg (stmt, 0);
1643 blck_size = gimple_call_arg (stmt, size_arg);
1645 if (TREE_CODE (blck_size) != INTEGER_CST)
1647 VEC_safe_push (histogram_value, heap, *values,
1648 gimple_alloc_histogram_value (cfun, HIST_TYPE_SINGLE_VALUE,
1650 VEC_safe_push (histogram_value, heap, *values,
1651 gimple_alloc_histogram_value (cfun, HIST_TYPE_AVERAGE,
1654 if (TREE_CODE (blck_size) != INTEGER_CST)
1655 VEC_safe_push (histogram_value, heap, *values,
1656 gimple_alloc_histogram_value (cfun, HIST_TYPE_IOR,
1660 /* Find values inside STMT for that we want to measure histograms and adds
1661 them to list VALUES. */
1664 gimple_values_to_profile (gimple stmt, histogram_values *values)
1666 if (flag_value_profile_transformations)
1668 gimple_divmod_values_to_profile (stmt, values);
1669 gimple_stringops_values_to_profile (stmt, values);
1670 gimple_indirect_call_to_profile (stmt, values);
1675 gimple_find_values_to_profile (histogram_values *values)
1678 gimple_stmt_iterator gsi;
1680 histogram_value hist = NULL;
1684 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1685 gimple_values_to_profile (gsi_stmt (gsi), values);
1687 FOR_EACH_VEC_ELT (histogram_value, *values, i, hist)
1691 case HIST_TYPE_INTERVAL:
1692 hist->n_counters = hist->hdata.intvl.steps + 2;
1695 case HIST_TYPE_POW2:
1696 hist->n_counters = 2;
1699 case HIST_TYPE_SINGLE_VALUE:
1700 hist->n_counters = 3;
1703 case HIST_TYPE_CONST_DELTA:
1704 hist->n_counters = 4;
1707 case HIST_TYPE_INDIR_CALL:
1708 hist->n_counters = 3;
1711 case HIST_TYPE_AVERAGE:
1712 hist->n_counters = 2;
1716 hist->n_counters = 1;
1724 fprintf (dump_file, "Stmt ");
1725 print_gimple_stmt (dump_file, hist->hvalue.stmt, 0, TDF_SLIM);
1726 dump_histogram_value (dump_file, hist);
1731 static struct value_prof_hooks gimple_value_prof_hooks = {
1732 gimple_find_values_to_profile,
1733 gimple_value_profile_transformations
1737 gimple_register_value_prof_hooks (void)
1739 gcc_assert (current_ir_type () == IR_GIMPLE);
1740 value_prof_hooks = &gimple_value_prof_hooks;
1743 /* IR-independent entry points. */
1745 find_values_to_profile (histogram_values *values)
1747 (value_prof_hooks->find_values_to_profile) (values);
1751 value_profile_transformations (void)
1753 return (value_prof_hooks->value_profile_transformations) ();