#include "tree-pass.h"
#include "timevar.h"
#include "value-prof.h"
+#include "ggc.h"
+static GTY(()) tree gcov_type_node;
+static GTY(()) tree tree_interval_profiler_fn;
+static GTY(()) tree tree_pow2_profiler_fn;
+static GTY(()) tree tree_one_value_profiler_fn;
\f
/* Do initialization work for the edge profiler. */
static void
tree_init_edge_profiler (void)
{
+ tree interval_profiler_fn_type;
+ tree pow2_profiler_fn_type;
+ tree one_value_profiler_fn_type;
+ tree gcov_type_ptr;
+
+ if (!gcov_type_node)
+ {
+ gcov_type_node = get_gcov_type ();
+ gcov_type_ptr = build_pointer_type (gcov_type_node);
+
+ /* void (*) (gcov_type *, gcov_type, int, unsigned) */
+ interval_profiler_fn_type
+ = build_function_type_list (void_type_node,
+ gcov_type_ptr, gcov_type_node,
+ integer_type_node,
+ unsigned_type_node, NULL_TREE);
+ tree_interval_profiler_fn
+ = build_fn_decl ("__gcov_interval_profiler",
+ interval_profiler_fn_type);
+
+ /* void (*) (gcov_type *, gcov_type) */
+ pow2_profiler_fn_type
+ = build_function_type_list (void_type_node,
+ gcov_type_ptr, gcov_type_node,
+ NULL_TREE);
+ tree_pow2_profiler_fn = build_fn_decl ("__gcov_pow2_profiler",
+ pow2_profiler_fn_type);
+
+ /* void (*) (gcov_type *, gcov_type) */
+ one_value_profiler_fn_type
+ = build_function_type_list (void_type_node,
+ gcov_type_ptr, gcov_type_node,
+ NULL_TREE);
+ tree_one_value_profiler_fn
+ = build_fn_decl ("__gcov_one_value_profiler",
+ one_value_profiler_fn_type);
+ }
}
/* Output instructions as GIMPLE trees to increment the edge
static void
tree_gen_edge_profiler (int edgeno, edge e)
{
- tree gcov_type_node = get_gcov_type ();
tree tmp1 = create_tmp_var (gcov_type_node, "PROF");
tree tmp2 = create_tmp_var (gcov_type_node, "PROF");
tree ref = tree_coverage_counter_ref (GCOV_COUNTER_ARCS, edgeno);
bsi_insert_on_edge (e, stmt3);
}
+/* Emits code to get VALUE to instrument at BSI, and returns the
+ variable containing the value. */
+
+static tree
+prepare_instrumented_value (block_stmt_iterator *bsi,
+ histogram_value value)
+{
+ tree val = value->hvalue.tree.value;
+ return force_gimple_operand_bsi (bsi, fold_convert (gcov_type_node, val),
+ true, NULL_TREE);
+}
+
/* Output instructions as GIMPLE trees to increment the interval histogram
counter. VALUE is the expression whose value is profiled. TAG is the
tag of the section for counters, BASE is offset of the counter position. */
static void
tree_gen_interval_profiler (histogram_value value, unsigned tag, unsigned base)
{
- tree op, op1, op2, op1copy, op2copy;
- tree tmp1, tmp2, tmp3, val, index;
- tree label_decl2, label_decl3, label_decl4, label_decl5, label_decl6;
- edge e12, e23, e34, e45, e56;
- tree label2, label3, label4, label5, label6;
- tree stmt1, stmt2, stmt3, stmt4;
- /* Initializations are to prevent bogus uninitialized warnings. */
- tree bb1end = NULL_TREE, bb2end = NULL_TREE, bb3end = NULL_TREE;
- tree bb4end = NULL_TREE, bb5end = NULL_TREE;
- tree ref = tree_coverage_counter_ref (tag, base), ref2;
- basic_block bb2, bb3, bb4, bb5, bb6;
tree stmt = value->hvalue.tree.stmt;
block_stmt_iterator bsi = bsi_for_stmt (stmt);
- basic_block bb = bb_for_stmt (stmt);
- tree gcov_type_node = get_gcov_type ();
- tree optype;
-
- op = stmt;
- if (TREE_CODE (stmt) == RETURN_EXPR
- && TREE_OPERAND (stmt, 0)
- && TREE_CODE (TREE_OPERAND (stmt, 0)) == MODIFY_EXPR)
- op = TREE_OPERAND (stmt, 0);
- /* op == MODIFY_EXPR */
- op = TREE_OPERAND (op, 1);
- /* op == TRUNC_DIV or TRUNC_MOD */
- op1 = TREE_OPERAND (op, 0);
- op2 = TREE_OPERAND (op, 1);
- optype = TREE_TYPE (op);
-
- /* Blocks:
- Original = 1
- For 2nd compare = 2
- Normal case, neither more nor less = 3
- More = 4
- Less = 5
- End = 6 */
- label_decl2 = create_artificial_label ();
- label_decl3 = create_artificial_label ();
- label_decl4 = create_artificial_label ();
- label_decl5 = create_artificial_label ();
- label_decl6 = create_artificial_label ();
-
- /* Do not evaluate op1 or op2 more than once. Probably
- volatile loads are the only things that could cause
- a problem, but this is harmless in any case. */
- op1copy = create_tmp_var (optype, "PROF");
- op2copy = create_tmp_var (optype, "PROF");
- stmt1 = build2 (MODIFY_EXPR, optype, op1copy, op1);
- stmt2 = build2 (MODIFY_EXPR, optype, op2copy, op2);
- TREE_OPERAND (op, 0) = op1copy;
- TREE_OPERAND (op, 1) = op2copy;
-
- val = create_tmp_var (optype, "PROF");
- stmt3 = build2 (MODIFY_EXPR, optype, val,
- build2 (TRUNC_DIV_EXPR, optype, op1copy, op2copy));
- stmt4 = build2 (MODIFY_EXPR, optype, val,
- build2 (MINUS_EXPR, optype, val,
- build_int_cst (optype, value->hdata.intvl.int_start)));
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt4, BSI_SAME_STMT);
-
- index = create_tmp_var (gcov_type_node, "PROF");
-
- /* Check for too big. */
- stmt1 = build3 (COND_EXPR, void_type_node,
- build2 (GE_EXPR, boolean_type_node, val,
- build_int_cst (optype, value->hdata.intvl.steps)),
- build1 (GOTO_EXPR, void_type_node, label_decl4),
- build1 (GOTO_EXPR, void_type_node, label_decl2));
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bb1end = stmt1;
-
- /* Check for too small. */
- label2 = build1 (LABEL_EXPR, void_type_node, label_decl2);
- bsi_insert_before (&bsi, label2, BSI_SAME_STMT);
- stmt1 = build3 (COND_EXPR, void_type_node,
- build2 (LT_EXPR, boolean_type_node, val, integer_zero_node),
- build1 (GOTO_EXPR, void_type_node, label_decl5),
- build1 (GOTO_EXPR, void_type_node, label_decl3));
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bb2end = stmt1;
-
- /* Normal case, within range. */
- label3 = build1 (LABEL_EXPR, void_type_node, label_decl3);
- bsi_insert_before (&bsi, label3, BSI_SAME_STMT);
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, index,
- build1 (NOP_EXPR, gcov_type_node, val));
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bb3end = stmt1;
-
- /* Too big */
- label4 = build1 (LABEL_EXPR, void_type_node, label_decl4);
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, index,
- build_int_cst (gcov_type_node, value->hdata.intvl.steps));
- bsi_insert_before (&bsi, label4, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bb4end = stmt1;
-
- /* Too small */
- label5 = build1 (LABEL_EXPR, void_type_node, label_decl5);
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, index,
- build_int_cst (gcov_type_node,
- value->hdata.intvl.steps + 1));
- bsi_insert_before (&bsi, label5, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bb5end = stmt1;
-
- /* Increment appropriate counter. */
- label6 = build1 (LABEL_EXPR, void_type_node, label_decl6);
- bsi_insert_before (&bsi, label6, BSI_SAME_STMT);
-
- tmp1 = create_tmp_var (gcov_type_node, "PROF");
- tmp2 = create_tmp_var (gcov_type_node, "PROF");
- tmp3 = create_tmp_var (gcov_type_node, "PROF");
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, tmp1,
- build2 (PLUS_EXPR, gcov_type_node, index,
- TREE_OPERAND (ref, 1)));
- TREE_OPERAND (ref, 1) = tmp1;
- /* Make a copy to avoid sharing complaints. */
- ref2 = build4 (ARRAY_REF, TREE_TYPE (ref), TREE_OPERAND (ref, 0),
- TREE_OPERAND (ref, 1), TREE_OPERAND (ref, 2),
- TREE_OPERAND (ref, 3));
-
- stmt2 = build2 (MODIFY_EXPR, gcov_type_node, tmp2, ref);
- stmt3 = build2 (MODIFY_EXPR, gcov_type_node, tmp3,
- build2 (PLUS_EXPR, gcov_type_node, tmp2, integer_one_node));
- stmt4 = build2 (MODIFY_EXPR, gcov_type_node, ref2, tmp3);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt4, BSI_SAME_STMT);
-
- /* Now fix up the CFG. */
- /* 1->2,4; 2->3,5; 3->6; 4->6; 5->6 */
- e12 = split_block (bb, bb1end);
- bb2 = e12->dest;
- e23 = split_block (bb2, bb2end);
- bb3 = e23->dest;
- e34 = split_block (bb3, bb3end);
- bb4 = e34->dest;
- e45 = split_block (bb4, bb4end);
- bb5 = e45->dest;
- e56 = split_block (bb5, bb5end);
- bb6 = e56->dest;
-
- e12->flags &= ~EDGE_FALLTHRU;
- e12->flags |= EDGE_FALSE_VALUE;
- make_edge (bb, bb4, EDGE_TRUE_VALUE);
- e23->flags &= ~EDGE_FALLTHRU;
- e23->flags |= EDGE_FALSE_VALUE;
- make_edge (bb2, bb5, EDGE_TRUE_VALUE);
- remove_edge (e34);
- make_edge (bb3, bb6, EDGE_FALLTHRU);
- remove_edge (e45);
- make_edge (bb4, bb6, EDGE_FALLTHRU);
+ tree ref = tree_coverage_counter_ref (tag, base), ref_ptr;
+ tree args, call, val;
+ tree start = build_int_cst_type (integer_type_node, value->hdata.intvl.int_start);
+ tree steps = build_int_cst_type (unsigned_type_node, value->hdata.intvl.steps);
+
+ ref_ptr = force_gimple_operand_bsi (&bsi,
+ build_addr (ref),
+ true, NULL_TREE);
+ val = prepare_instrumented_value (&bsi, value);
+ args = tree_cons (NULL_TREE, ref_ptr,
+ tree_cons (NULL_TREE, val,
+ tree_cons (NULL_TREE, start,
+ tree_cons (NULL_TREE, steps,
+ NULL_TREE))));
+ call = build_function_call_expr (tree_interval_profiler_fn, args);
+ bsi_insert_before (&bsi, call, BSI_SAME_STMT);
}
/* Output instructions as GIMPLE trees to increment the power of two histogram
static void
tree_gen_pow2_profiler (histogram_value value, unsigned tag, unsigned base)
{
- tree op;
- tree tmp1, tmp2, tmp3;
- tree index, denom;
- tree label_decl1 = create_artificial_label ();
- tree label_decl2 = create_artificial_label ();
- tree label_decl3 = create_artificial_label ();
- tree label1, label2, label3;
- tree stmt1, stmt2, stmt3, stmt4;
- tree bb1end, bb2end, bb3end;
- tree ref = tree_coverage_counter_ref (tag, base), ref2;
- basic_block bb2, bb3, bb4;
tree stmt = value->hvalue.tree.stmt;
block_stmt_iterator bsi = bsi_for_stmt (stmt);
- basic_block bb = bb_for_stmt (stmt);
- tree gcov_type_node = get_gcov_type ();
- tree optype, optypesigned, optypeunsigned;
-
- op = stmt;
- if (TREE_CODE (stmt) == RETURN_EXPR
- && TREE_OPERAND (stmt, 0)
- && TREE_CODE (TREE_OPERAND (stmt, 0)) == MODIFY_EXPR)
- op = TREE_OPERAND (stmt, 0);
- /* op == MODIFY_EXPR */
- op = TREE_OPERAND (op, 1);
- /* op == TRUNC_DIV or TRUNC_MOD */
- op = TREE_OPERAND (op, 1);
- /* op == denominator */
- optype = TREE_TYPE (op);
- if (TYPE_UNSIGNED (optype))
- {
- /* Right shift must be unsigned. */
- optypeunsigned = optype;
- optypesigned = build_distinct_type_copy (optype);
- TYPE_UNSIGNED (optypesigned) = false;
- }
- else
- {
- /* Compare to zero must be signed. */
- optypesigned = optype;
- optypeunsigned = build_distinct_type_copy (optype);
- TYPE_UNSIGNED (optypeunsigned) = true;
- }
-
- /* Set up variables and check if denominator is negative when considered
- as signed. */
- index = create_tmp_var (gcov_type_node, "PROF");
- denom = create_tmp_var (optype, "PROF");
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, index, integer_zero_node);
- stmt2 = build2 (MODIFY_EXPR, optype, denom, op);
- if (optypesigned == optype)
- {
- tmp1 = denom;
- stmt3 = NULL_TREE;
- }
- else
- {
- tmp1 = create_tmp_var (optypesigned, "PROF");
- stmt3 = build2 (MODIFY_EXPR, optypesigned, tmp1,
- build1 (NOP_EXPR, optypesigned, denom));
- }
- stmt4 = build3 (COND_EXPR, void_type_node,
- build2 (LE_EXPR, boolean_type_node, tmp1, integer_zero_node),
- build1 (GOTO_EXPR, void_type_node, label_decl3),
- build1 (GOTO_EXPR, void_type_node, label_decl1));
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- if (stmt3)
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt4, BSI_SAME_STMT);
- bb1end = stmt4;
-
- /* Nonnegative. Check if denominator is power of 2. */
- label1 = build1 (LABEL_EXPR, void_type_node, label_decl1);
- tmp1 = create_tmp_var (optype, "PROF");
- tmp2 = create_tmp_var (optype, "PROF");
- stmt1 = build2 (MODIFY_EXPR, optype, tmp1,
- build2 (PLUS_EXPR, optype, denom, integer_minus_one_node));
- stmt2 = build2 (MODIFY_EXPR, optype, tmp2,
- build2 (BIT_AND_EXPR, optype, tmp1, denom));
- stmt3 = build3 (COND_EXPR, void_type_node,
- build2 (NE_EXPR, boolean_type_node, tmp2, integer_zero_node),
- build1 (GOTO_EXPR, void_type_node, label_decl3),
- build1 (GOTO_EXPR, void_type_node, label_decl2));
- bsi_insert_before (&bsi, label1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bb2end = stmt3;
-
- /* Loop. Increment index, shift denominator, repeat if denominator nonzero. */
- label2 = build1 (LABEL_EXPR, void_type_node, label_decl2);
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, index,
- build2 (PLUS_EXPR, gcov_type_node, index, integer_one_node));
- if (optypeunsigned == optype)
- {
- tmp1 = denom;
- stmt2 = NULL_TREE;
- }
- else
- {
- tmp1 = create_tmp_var (optypeunsigned, "PROF");
- stmt2 = build2 (MODIFY_EXPR, optypeunsigned, tmp1,
- build1 (NOP_EXPR, optypeunsigned, denom));
- }
- stmt3 = build2 (MODIFY_EXPR, optype, denom,
- build2 (RSHIFT_EXPR, optype, tmp1, integer_one_node));
- stmt4 = build3 (COND_EXPR, void_type_node,
- build2 (NE_EXPR, boolean_type_node, denom, integer_zero_node),
- build1 (GOTO_EXPR, void_type_node, label_decl2),
- build1 (GOTO_EXPR, void_type_node, label_decl3));
- bsi_insert_before (&bsi, label2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- if (stmt2)
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt4, BSI_SAME_STMT);
- bb3end = stmt4;
-
- /* Increment the appropriate counter. */
- label3 = build1 (LABEL_EXPR, void_type_node, label_decl3);
- tmp1 = create_tmp_var (gcov_type_node, "PROF");
- tmp2 = create_tmp_var (gcov_type_node, "PROF");
- tmp3 = create_tmp_var (gcov_type_node, "PROF");
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, tmp1,
- build2 (PLUS_EXPR, gcov_type_node,
- index, TREE_OPERAND (ref, 1)));
- TREE_OPERAND (ref, 1) = tmp1;
- /* Make a copy to avoid sharing complaints. */
- ref2 = build4 (ARRAY_REF, TREE_TYPE (ref), TREE_OPERAND (ref, 0),
- TREE_OPERAND (ref, 1), TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
- stmt2 = build2 (MODIFY_EXPR, gcov_type_node, tmp2, ref);
- stmt3 = build2 (MODIFY_EXPR, gcov_type_node, tmp3,
- build2 (PLUS_EXPR, gcov_type_node, tmp2, integer_one_node));
- stmt4 = build2 (MODIFY_EXPR, gcov_type_node, ref2, tmp3);
- bsi_insert_before (&bsi, label3, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt4, BSI_SAME_STMT);
-
- /* Now fix up the CFG. */
- bb2 = (split_block (bb, bb1end))->dest;
- bb3 = (split_block (bb2, bb2end))->dest;
- bb4 = (split_block (bb3, bb3end))->dest;
-
- EDGE_SUCC (bb, 0)->flags &= ~EDGE_FALLTHRU;
- EDGE_SUCC (bb, 0)->flags |= EDGE_FALSE_VALUE;
- make_edge (bb, bb4, EDGE_TRUE_VALUE);
-
- EDGE_SUCC (bb2, 0)->flags &= ~EDGE_FALLTHRU;
- EDGE_SUCC (bb2, 0)->flags |= EDGE_FALSE_VALUE;
- make_edge (bb2, bb4, EDGE_TRUE_VALUE);
-
- EDGE_SUCC (bb3, 0)->flags &= ~EDGE_FALLTHRU;
- EDGE_SUCC (bb3, 0)->flags |= EDGE_FALSE_VALUE;
- make_edge (bb3, bb3, EDGE_TRUE_VALUE);
+ tree ref = tree_coverage_counter_ref (tag, base), ref_ptr;
+ tree args, call, val;
+
+ ref_ptr = force_gimple_operand_bsi (&bsi,
+ build_addr (ref),
+ true, NULL_TREE);
+ val = prepare_instrumented_value (&bsi, value);
+ args = tree_cons (NULL_TREE, ref_ptr,
+ tree_cons (NULL_TREE, val,
+ NULL_TREE));
+ call = build_function_call_expr (tree_pow2_profiler_fn, args);
+ bsi_insert_before (&bsi, call, BSI_SAME_STMT);
}
/* Output instructions as GIMPLE trees for code to find the most common value.
static void
tree_gen_one_value_profiler (histogram_value value, unsigned tag, unsigned base)
{
- tree op;
- tree tmp1, tmp2, tmp3;
- tree label_decl1 = create_artificial_label ();
- tree label_decl2 = create_artificial_label ();
- tree label_decl3 = create_artificial_label ();
- tree label_decl4 = create_artificial_label ();
- tree label_decl5 = create_artificial_label ();
- tree label1, label2, label3, label4, label5;
- tree stmt1, stmt2, stmt3, stmt4;
- tree bb1end, bb2end, bb3end, bb4end, bb5end;
- tree ref1 = tree_coverage_counter_ref (tag, base);
- tree ref2 = tree_coverage_counter_ref (tag, base + 1);
- tree ref3 = tree_coverage_counter_ref (tag, base + 2);
- basic_block bb2, bb3, bb4, bb5, bb6;
tree stmt = value->hvalue.tree.stmt;
block_stmt_iterator bsi = bsi_for_stmt (stmt);
- basic_block bb = bb_for_stmt (stmt);
- tree gcov_type_node = get_gcov_type ();
- tree optype;
-
- op = stmt;
- if (TREE_CODE (stmt) == RETURN_EXPR
- && TREE_OPERAND (stmt, 0)
- && TREE_CODE (TREE_OPERAND (stmt, 0)) == MODIFY_EXPR)
- op = TREE_OPERAND (stmt, 0);
- /* op == MODIFY_EXPR */
- op = TREE_OPERAND (op, 1);
- /* op == TRUNC_DIV or TRUNC_MOD */
- op = TREE_OPERAND (op, 1);
- /* op == denominator */
- optype = TREE_TYPE (op);
-
- /* Check if the stored value matches. */
- tmp1 = create_tmp_var (gcov_type_node, "PROF");
- tmp2 = create_tmp_var (optype, "PROF");
- tmp3 = create_tmp_var (optype, "PROF");
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, tmp1, ref1);
- stmt2 = build2 (MODIFY_EXPR, optype, tmp2,
- build1 (NOP_EXPR, optype, tmp1));
- stmt3 = build2 (MODIFY_EXPR, optype, tmp3, op);
- stmt4 = build3 (COND_EXPR, void_type_node,
- build2 (EQ_EXPR, boolean_type_node, tmp2, tmp3),
- build1 (GOTO_EXPR, void_type_node, label_decl4),
- build1 (GOTO_EXPR, void_type_node, label_decl1));
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt4, BSI_SAME_STMT);
- bb1end = stmt4;
-
- /* Does not match; check whether the counter is zero. */
- label1 = build1 (LABEL_EXPR, void_type_node, label_decl1);
- tmp1 = create_tmp_var (gcov_type_node, "PROF");
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, tmp1, ref2);
- stmt2 = build3 (COND_EXPR, void_type_node,
- build2 (EQ_EXPR, boolean_type_node, tmp1, integer_zero_node),
- build1 (GOTO_EXPR, void_type_node, label_decl3),
- build1 (GOTO_EXPR, void_type_node, label_decl2));
- bsi_insert_before (&bsi, label1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bb2end = stmt2;
-
- /* Counter is not zero yet, decrement. */
- label2 = build1 (LABEL_EXPR, void_type_node, label_decl2);
- tmp1 = create_tmp_var (gcov_type_node, "PROF");
- tmp2 = create_tmp_var (gcov_type_node, "PROF");
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, tmp1, ref2);
- stmt2 = build2 (MODIFY_EXPR, gcov_type_node, tmp2,
- build (MINUS_EXPR, gcov_type_node, tmp1, integer_one_node));
- stmt3 = build2 (MODIFY_EXPR, gcov_type_node, ref2, tmp2);
- bsi_insert_before (&bsi, label2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bb3end = stmt3;
-
- /* Counter was zero, store new value. */
- label3 = build1 (LABEL_EXPR, void_type_node, label_decl3);
- tmp1 = create_tmp_var (optype, "PROF");
- tmp2 = create_tmp_var (gcov_type_node, "PROF");
- stmt1 = build2 (MODIFY_EXPR, optype, tmp1, op);
- stmt2 = build2 (MODIFY_EXPR, gcov_type_node, tmp2,
- build1 (NOP_EXPR, gcov_type_node, tmp1));
- stmt3 = build2 (MODIFY_EXPR, gcov_type_node, ref1, tmp2);
- bsi_insert_before (&bsi, label3, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bb4end = stmt3;
- /* (fall through) */
-
- /* Increment counter. */
- label4 = build1 (LABEL_EXPR, void_type_node, label_decl4);
- tmp1 = create_tmp_var (gcov_type_node, "PROF");
- tmp2 = create_tmp_var (gcov_type_node, "PROF");
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, tmp1, ref2);
- stmt2 = build2 (MODIFY_EXPR, gcov_type_node, tmp2,
- build (PLUS_EXPR, gcov_type_node, tmp1, integer_one_node));
- stmt3 = build2 (MODIFY_EXPR, gcov_type_node, ref2, tmp2);
- bsi_insert_before (&bsi, label4, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
- bb5end = stmt3;
-
- /* Increment the counter of all executions; this seems redundant given
- that we have counts for edges in cfg, but it may happen that some
- optimization will change the counts for the block (either because
- it is unable to update them correctly, or because it will duplicate
- the block or its part). */
- label5 = build1 (LABEL_EXPR, void_type_node, label_decl5);
- tmp1 = create_tmp_var (gcov_type_node, "PROF");
- tmp2 = create_tmp_var (gcov_type_node, "PROF");
- stmt1 = build2 (MODIFY_EXPR, gcov_type_node, tmp1, ref3);
- stmt2 = build2 (MODIFY_EXPR, gcov_type_node, tmp2,
- build (PLUS_EXPR, gcov_type_node, tmp1, integer_one_node));
- stmt3 = build2 (MODIFY_EXPR, gcov_type_node, ref3, tmp2);
- bsi_insert_before (&bsi, label5, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt2, BSI_SAME_STMT);
- bsi_insert_before (&bsi, stmt3, BSI_SAME_STMT);
-
- /* Now fix up the CFG. */
- bb2 = (split_block (bb, bb1end))->dest;
- bb3 = (split_block (bb2, bb2end))->dest;
- bb4 = (split_block (bb3, bb3end))->dest;
- bb5 = (split_block (bb4, bb4end))->dest;
- bb6 = (split_block (bb5, bb5end))->dest;
-
- EDGE_SUCC (bb, 0)->flags &= ~EDGE_FALLTHRU;
- EDGE_SUCC (bb, 0)->flags |= EDGE_FALSE_VALUE;
- make_edge (bb, bb5, EDGE_TRUE_VALUE);
-
- EDGE_SUCC (bb2, 0)->flags &= ~EDGE_FALLTHRU;
- EDGE_SUCC (bb2, 0)->flags |= EDGE_FALSE_VALUE;
- make_edge (bb2, bb4, EDGE_TRUE_VALUE);
-
- remove_edge (EDGE_SUCC (bb3, 0));
- make_edge (bb3, bb6, EDGE_FALLTHRU);
+ tree ref = tree_coverage_counter_ref (tag, base), ref_ptr;
+ tree args, call, val;
+
+ ref_ptr = force_gimple_operand_bsi (&bsi,
+ build_addr (ref),
+ true, NULL_TREE);
+ val = prepare_instrumented_value (&bsi, value);
+ args = tree_cons (NULL_TREE, ref_ptr,
+ tree_cons (NULL_TREE, val,
+ NULL_TREE));
+ call = build_function_call_expr (tree_one_value_profiler_fn, args);
+ bsi_insert_before (&bsi, call, BSI_SAME_STMT);
}
/* Output instructions as GIMPLE trees for code to find the most common value
tree_gen_const_delta_profiler,/* gen_const_delta_profiler */
tree_profile_dump_file /* profile_dump_file */
};
+
+#include "gt-tree-profile.h"
#ifdef HAVE_prefetch
static bool speculative_prefetching_transform (rtx);
#endif
-static void tree_divmod_values_to_profile (tree, histogram_values *);
-static void tree_values_to_profile (tree, histogram_values *);
static tree tree_divmod_fixed_value (tree, tree, tree, tree,
tree, int, gcov_type, gcov_type);
static tree tree_mod_pow2 (tree, tree, tree, tree, int, gcov_type, gcov_type);
hist->hvalue.rtl.mode = mode;
hist->hvalue.rtl.insn = insn;
hist->type = HIST_TYPE_POW2;
- hist->hdata.pow2.may_be_other = 1;
VEC_safe_push (histogram_value, heap, *values, hist);
}
fprintf (dump_file,
"Pow2 counter for insn %d.\n",
INSN_UID ((rtx)hist->hvalue.rtl.insn));
- hist->n_counters
- = GET_MODE_BITSIZE (hist->hvalue.rtl.mode)
- + (hist->hdata.pow2.may_be_other ? 1 : 0);
+ hist->n_counters = 2;
break;
case HIST_TYPE_SINGLE_VALUE:
enum machine_mode mode;
gcov_type wrong_values, count;
edge e;
- int i, all, prob;
+ int all, prob;
set = single_set (insn);
if (!set)
histogram = XEXP (XEXP (histogram, 0), 1);
value = XEXP (histogram, 0);
histogram = XEXP (histogram, 1);
- wrong_values =INTVAL (XEXP (histogram, 0));
+ wrong_values = INTVAL (XEXP (histogram, 0));
histogram = XEXP (histogram, 1);
-
- count = 0;
- for (i = 0; i < GET_MODE_BITSIZE (mode); i++)
- {
- count += INTVAL (XEXP (histogram, 0));
- histogram = XEXP (histogram, 1);
- }
+ count = INTVAL (XEXP (histogram, 0));
if (!rtx_equal_p (op2, value))
return false;
gcov_type count, wrong_values, all;
tree modify, op, op1, op2, result, value;
int prob;
- unsigned int i;
modify = stmt;
if (TREE_CODE (stmt) == RETURN_EXPR
value = histogram->hvalue.tree.value;
wrong_values = histogram->hvalue.tree.counters[0];
- count = 0;
- for (i = 1; i <= TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (stmt))); i++)
- count += histogram->hvalue.tree.counters[i];
+ count = histogram->hvalue.tree.counters[1];
/* We require that we hit a power of 2 at least half of all evaluations. */
if (simple_cst_equal (op2, value) != 1 || count < wrong_values)
wrong_values += histogram->hvalue.tree.counters[i+1];
all += wrong_values;
- /* Sanity check. */
- if (simple_cst_equal (op2, value) != 1)
- return false;
-
/* We require that we use just subtractions in at least 50% of all
evaluations. */
count = 0;
gcc_assert (!ir_type ());
}
\f
-/* Find values inside INSN for that we want to measure histograms for
+/* Find values inside STMT for that we want to measure histograms for
division/modulo optimization. */
static void
tree_divmod_values_to_profile (tree stmt, histogram_values *values)
{
- tree op, op1, op2;
+ tree assign, lhs, rhs, divisor, op0, type;
histogram_value hist;
- op = stmt;
- if (TREE_CODE (stmt) == RETURN_EXPR
- && TREE_OPERAND (stmt, 0)
- && TREE_CODE (TREE_OPERAND (stmt, 0)) == MODIFY_EXPR)
- op = TREE_OPERAND (stmt, 0);
+ if (TREE_CODE (stmt) == RETURN_EXPR)
+ assign = TREE_OPERAND (stmt, 0);
+ else
+ assign = stmt;
- if (TREE_CODE (op) != MODIFY_EXPR)
+ if (!assign
+ || TREE_CODE (assign) != MODIFY_EXPR)
return;
- if (!INTEGRAL_TYPE_P (TREE_TYPE (op)))
+ lhs = TREE_OPERAND (assign, 0);
+ type = TREE_TYPE (lhs);
+ if (!INTEGRAL_TYPE_P (type))
return;
- op = TREE_OPERAND (op, 1);
- switch (TREE_CODE (op))
+
+ rhs = TREE_OPERAND (assign, 1);
+ switch (TREE_CODE (rhs))
{
case TRUNC_DIV_EXPR:
case TRUNC_MOD_EXPR:
- op1 = TREE_OPERAND (op, 0);
- op2 = TREE_OPERAND (op, 1);
+ divisor = TREE_OPERAND (rhs, 1);
+ op0 = TREE_OPERAND (rhs, 0);
VEC_reserve (histogram_value, heap, *values, 3);
-
- /* Check for a special case where the divisor is power(s) of 2.
- This is more aggressive than the RTL version, under the
- assumption that later phases will reduce / or % by power of 2
- to something clever most of the time. Signed or unsigned. */
- if (TREE_CODE (op2) != INTEGER_CST)
+
+ if (is_gimple_reg (divisor))
{
+ /* Check for a special case where the divisor is power(s) of 2.
+ This is more aggressive than the RTL version, under the
+ assumption that later phases will reduce / or % by power of 2
+ to something clever most of the time. Signed or unsigned. */
hist = ggc_alloc (sizeof (*hist));
- hist->hvalue.tree.value = op2;
+ hist->hvalue.tree.value = divisor;
hist->hvalue.tree.stmt = stmt;
hist->type = HIST_TYPE_POW2;
- hist->hdata.pow2.may_be_other = 1;
VEC_quick_push (histogram_value, *values, hist);
- }
- /* Check for the case where the divisor is the same value most
- of the time. */
- if (TREE_CODE (op2) != INTEGER_CST)
- {
+ /* Check for the case where the divisor is the same value most
+ of the time. */
hist = ggc_alloc (sizeof (*hist));
- hist->hvalue.tree.value = op2;
+ hist->hvalue.tree.value = divisor;
hist->hvalue.tree.stmt = stmt;
hist->type = HIST_TYPE_SINGLE_VALUE;
VEC_quick_push (histogram_value, *values, hist);
/* For mod, check whether it is not often a noop (or replaceable by
a few subtractions). */
- if (TREE_CODE (op) == TRUNC_MOD_EXPR && TYPE_UNSIGNED (TREE_TYPE (op)))
+ if (TREE_CODE (rhs) == TRUNC_MOD_EXPR
+ && TYPE_UNSIGNED (type))
{
hist = ggc_alloc (sizeof (*hist));
hist->hvalue.tree.stmt = stmt;
- hist->hvalue.tree.value = op2;
+ hist->hvalue.tree.value
+ = build2 (TRUNC_DIV_EXPR, type, op0, divisor);
hist->type = HIST_TYPE_INTERVAL;
hist->hdata.intvl.int_start = 0;
hist->hdata.intvl.steps = 2;
}
}
-/* Find values inside INSN for that we want to measure histograms and adds
- them to list VALUES (increasing the record of its length in N_VALUES). */
+/* Find values inside STMT for that we want to measure histograms and adds
+ them to list VALUES. */
+
static void
tree_values_to_profile (tree stmt, histogram_values *values)
{
{
basic_block bb;
block_stmt_iterator bsi;
- tree stmt;
- unsigned int i;
+ unsigned i;
histogram_value hist;
-
+
*values = NULL;
FOR_EACH_BB (bb)
for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
- {
- tree stmt = bsi_stmt (bsi);
- tree_values_to_profile (stmt, values);
- }
+ tree_values_to_profile (bsi_stmt (bsi), values);
static_values = *values;
for (i = 0; VEC_iterate (histogram_value, *values, i, hist); i++)
case HIST_TYPE_POW2:
if (dump_file)
{
- fprintf (dump_file, "Pow2 counter for insn ");
+ fprintf (dump_file, "Pow2 counter for tree ");
print_generic_expr (dump_file, hist->hvalue.tree.stmt, TDF_SLIM);
fprintf (dump_file, ".\n");
}
- stmt = hist->hvalue.tree.stmt;
- hist->n_counters
- = TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (stmt)))
- + (hist->hdata.pow2.may_be_other ? 1 : 0);
+ hist->n_counters = 2;
break;
case HIST_TYPE_SINGLE_VALUE:
if (dump_file)
{
- fprintf (dump_file, "Single value counter for insn ");
+ fprintf (dump_file, "Single value counter for tree ");
print_generic_expr (dump_file, hist->hvalue.tree.stmt, TDF_SLIM);
fprintf (dump_file, ".\n");
}
case HIST_TYPE_CONST_DELTA:
if (dump_file)
{
- fprintf (dump_file, "Constant delta counter for insn ");
+ fprintf (dump_file, "Constant delta counter for tree ");
print_generic_expr (dump_file, hist->hvalue.tree.stmt, TDF_SLIM);
fprintf (dump_file, ".\n");
}
projects / gcc.git / commitdiff