1 /* Calculate branch probabilities, and basic block execution counts.
2 Copyright (C) 1990, 1991, 1992, 1993, 1994, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
4 Contributed by James E. Wilson, UC Berkeley/Cygnus Support;
5 based on some ideas from Dain Samples of UC Berkeley.
6 Further mangling by Bob Manson, Cygnus Support.
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 2, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING. If not, write to the Free
22 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
25 /* Generate basic block profile instrumentation and auxiliary files.
26 Profile generation is optimized, so that not all arcs in the basic
27 block graph need instrumenting. First, the BB graph is closed with
28 one entry (function start), and one exit (function exit). Any
29 ABNORMAL_EDGE cannot be instrumented (because there is no control
30 path to place the code). We close the graph by inserting fake
31 EDGE_FAKE edges to the EXIT_BLOCK, from the sources of abnormal
32 edges that do not go to the exit_block. We ignore such abnormal
33 edges. Naturally these fake edges are never directly traversed,
34 and so *cannot* be directly instrumented. Some other graph
35 massaging is done. To optimize the instrumentation we generate the
36 BB minimal span tree, only edges that are not on the span tree
37 (plus the entry point) need instrumenting. From that information
38 all other edge counts can be deduced. By construction all fake
39 edges must be on the spanning tree. We also attempt to place
40 EDGE_CRITICAL edges on the spanning tree.
42 The auxiliary file generated is <dumpbase>.bbg. The format is
43 described in full in gcov-io.h. */
45 /* ??? Register allocation should use basic block execution counts to
46 give preference to the most commonly executed blocks. */
48 /* ??? Should calculate branch probabilities before instrumenting code, since
49 then we can use arc counts to help decide which arcs to instrument. */
53 #include "coretypes.h"
64 /* Additional information about the edges we need. */
66 unsigned int count_valid : 1;
68 /* Is on the spanning tree. */
69 unsigned int on_tree : 1;
71 /* Pretend this edge does not exist (it is abnormal and we've
72 inserted a fake to compensate). */
73 unsigned int ignore : 1;
77 unsigned int count_valid : 1;
79 /* Number of successor and predecessor edges. */
84 /* Counts information for a function. */
85 typedef struct counts_entry
96 gcov_type max_counter;
97 gcov_type max_counter_sum;
100 struct counts_entry *chain;
104 #define EDGE_INFO(e) ((struct edge_info *) (e)->aux)
105 #define BB_INFO(b) ((struct bb_info *) (b)->aux)
107 /* Keep all basic block indexes nonnegative in the gcov output. Index 0
108 is used for entry block, last block exit block. */
109 #define BB_TO_GCOV_INDEX(bb) ((bb) == ENTRY_BLOCK_PTR ? 0 \
110 : ((bb) == EXIT_BLOCK_PTR \
111 ? last_basic_block + 1 : (bb)->index + 1))
113 /* Collect statistics on the performance of this pass for the entire source
116 static int total_num_blocks;
117 static int total_num_edges;
118 static int total_num_edges_ignored;
119 static int total_num_edges_instrumented;
120 static int total_num_blocks_created;
121 static int total_num_passes;
122 static int total_num_times_called;
123 static int total_hist_br_prob[20];
124 static int total_num_never_executed;
125 static int total_num_branches;
127 /* Forward declarations. */
128 static void find_spanning_tree PARAMS ((struct edge_list *));
129 static rtx gen_edge_profiler PARAMS ((int));
130 static void instrument_edges PARAMS ((struct edge_list *));
131 static void compute_branch_probabilities PARAMS ((void));
132 static gcov_type * get_exec_counts PARAMS ((void));
133 static basic_block find_group PARAMS ((basic_block));
134 static void union_groups PARAMS ((basic_block, basic_block));
137 /* Add edge instrumentation code to the entire insn chain.
139 F is the first insn of the chain.
140 NUM_BLOCKS is the number of basic blocks found in F. */
143 instrument_edges (el)
144 struct edge_list *el;
146 int num_instr_edges = 0;
147 int num_edges = NUM_EDGES (el);
149 remove_fake_edges ();
151 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
156 struct edge_info *inf = EDGE_INFO (e);
157 if (!inf->ignore && !inf->on_tree)
159 if (e->flags & EDGE_ABNORMAL)
162 fprintf (rtl_dump_file, "Edge %d to %d instrumented%s\n",
163 e->src->index, e->dest->index,
164 EDGE_CRITICAL_P (e) ? " (and split)" : "");
165 insert_insn_on_edge (
166 gen_edge_profiler (num_instr_edges++), e);
167 rebuild_jump_labels (e->insns);
173 total_num_blocks_created += num_edges;
175 fprintf (rtl_dump_file, "%d edges instrumented\n", num_instr_edges);
179 /* Computes hybrid profile for all matching entries in da_file.
180 Sets max_counter_in_program as a side effect. */
185 unsigned num_edges = 0;
189 /* Count the edges to be (possibly) instrumented. */
190 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
193 for (e = bb->succ; e; e = e->succ_next)
194 if (!EDGE_INFO (e)->ignore && !EDGE_INFO (e)->on_tree)
198 counts = get_coverage_counts (GCOV_TAG_ARC_COUNTS, num_edges);
204 fprintf(rtl_dump_file, "Merged %i profiles with maximal count %i.\n",
205 profile_info.count_profiles_merged,
206 (int)profile_info.max_counter_in_program);
213 /* Compute the branch probabilities for the various branches.
214 Annotate them accordingly. */
217 compute_branch_probabilities ()
224 int hist_br_prob[20];
225 int num_never_executed;
227 gcov_type *exec_counts = get_exec_counts ();
228 int exec_counts_pos = 0;
230 /* Attach extra info block to each bb. */
232 alloc_aux_for_blocks (sizeof (struct bb_info));
233 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
237 for (e = bb->succ; e; e = e->succ_next)
238 if (!EDGE_INFO (e)->ignore)
239 BB_INFO (bb)->succ_count++;
240 for (e = bb->pred; e; e = e->pred_next)
241 if (!EDGE_INFO (e)->ignore)
242 BB_INFO (bb)->pred_count++;
245 /* Avoid predicting entry on exit nodes. */
246 BB_INFO (EXIT_BLOCK_PTR)->succ_count = 2;
247 BB_INFO (ENTRY_BLOCK_PTR)->pred_count = 2;
249 /* For each edge not on the spanning tree, set its execution count from
252 /* The first count in the .da file is the number of times that the function
253 was entered. This is the exec_count for block zero. */
255 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
258 for (e = bb->succ; e; e = e->succ_next)
259 if (!EDGE_INFO (e)->ignore && !EDGE_INFO (e)->on_tree)
264 e->count = exec_counts[exec_counts_pos++];
269 EDGE_INFO (e)->count_valid = 1;
270 BB_INFO (bb)->succ_count--;
271 BB_INFO (e->dest)->pred_count--;
274 fprintf (rtl_dump_file, "\nRead edge from %i to %i, count:",
275 bb->index, e->dest->index);
276 fprintf (rtl_dump_file, HOST_WIDEST_INT_PRINT_DEC,
277 (HOST_WIDEST_INT) e->count);
283 fprintf (rtl_dump_file, "\n%d edge counts read\n", num_edges);
285 /* For every block in the file,
286 - if every exit/entrance edge has a known count, then set the block count
287 - if the block count is known, and every exit/entrance edge but one has
288 a known execution count, then set the count of the remaining edge
290 As edge counts are set, decrement the succ/pred count, but don't delete
291 the edge, that way we can easily tell when all edges are known, or only
292 one edge is unknown. */
294 /* The order that the basic blocks are iterated through is important.
295 Since the code that finds spanning trees starts with block 0, low numbered
296 edges are put on the spanning tree in preference to high numbered edges.
297 Hence, most instrumented edges are at the end. Graph solving works much
298 faster if we propagate numbers from the end to the start.
300 This takes an average of slightly more than 3 passes. */
308 FOR_BB_BETWEEN (bb, EXIT_BLOCK_PTR, NULL, prev_bb)
310 struct bb_info *bi = BB_INFO (bb);
311 if (! bi->count_valid)
313 if (bi->succ_count == 0)
318 for (e = bb->succ; e; e = e->succ_next)
324 else if (bi->pred_count == 0)
329 for (e = bb->pred; e; e = e->pred_next)
338 if (bi->succ_count == 1)
343 /* One of the counts will be invalid, but it is zero,
344 so adding it in also doesn't hurt. */
345 for (e = bb->succ; e; e = e->succ_next)
348 /* Seedgeh for the invalid edge, and set its count. */
349 for (e = bb->succ; e; e = e->succ_next)
350 if (! EDGE_INFO (e)->count_valid && ! EDGE_INFO (e)->ignore)
353 /* Calculate count for remaining edge by conservation. */
354 total = bb->count - total;
358 EDGE_INFO (e)->count_valid = 1;
362 BB_INFO (e->dest)->pred_count--;
365 if (bi->pred_count == 1)
370 /* One of the counts will be invalid, but it is zero,
371 so adding it in also doesn't hurt. */
372 for (e = bb->pred; e; e = e->pred_next)
375 /* Seedgeh for the invalid edge, and set its count. */
376 for (e = bb->pred; e; e = e->pred_next)
377 if (! EDGE_INFO (e)->count_valid && ! EDGE_INFO (e)->ignore)
380 /* Calculate count for remaining edge by conservation. */
381 total = bb->count - total + e->count;
385 EDGE_INFO (e)->count_valid = 1;
389 BB_INFO (e->src)->succ_count--;
396 dump_flow_info (rtl_dump_file);
398 total_num_passes += passes;
400 fprintf (rtl_dump_file, "Graph solving took %d passes.\n\n", passes);
402 /* If the graph has been correctly solved, every block will have a
403 succ and pred count of zero. */
406 if (BB_INFO (bb)->succ_count || BB_INFO (bb)->pred_count)
410 /* For every edge, calculate its branch probability and add a reg_note
411 to the branch insn to indicate this. */
413 for (i = 0; i < 20; i++)
415 num_never_executed = 0;
418 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
425 error ("corrupted profile info: number of iterations for basic block %d thought to be %i",
426 bb->index, (int)bb->count);
429 for (e = bb->succ; e; e = e->succ_next)
431 /* Function may return twice in the cased the called fucntion is
432 setjmp or calls fork, but we can't represent this by extra
433 edge from the entry, since extra edge from the exit is
434 already present. We get negative frequency from the entry
437 && e->dest == EXIT_BLOCK_PTR)
438 || (e->count > bb->count
439 && e->dest != EXIT_BLOCK_PTR))
443 while (GET_CODE (insn) != CALL_INSN
445 && keep_with_call_p (insn))
446 insn = PREV_INSN (insn);
447 if (GET_CODE (insn) == CALL_INSN)
448 e->count = e->count < 0 ? 0 : bb->count;
450 if (e->count < 0 || e->count > bb->count)
452 error ("corrupted profile info: number of executions for edge %d-%d thought to be %i",
453 e->src->index, e->dest->index,
455 e->count = bb->count / 2;
460 for (e = bb->succ; e; e = e->succ_next)
461 e->probability = (e->count * REG_BR_PROB_BASE + bb->count / 2) / bb->count;
463 && any_condjump_p (bb->end)
464 && bb->succ->succ_next)
470 /* Find the branch edge. It is possible that we do have fake
472 for (e = bb->succ; e->flags & (EDGE_FAKE | EDGE_FALLTHRU);
474 continue; /* Loop body has been intentionally left blank. */
476 prob = e->probability;
477 index = prob * 20 / REG_BR_PROB_BASE;
481 hist_br_prob[index]++;
483 note = find_reg_note (bb->end, REG_BR_PROB, 0);
484 /* There may be already note put by some other pass, such
485 as builtin_expect expander. */
487 XEXP (note, 0) = GEN_INT (prob);
490 = gen_rtx_EXPR_LIST (REG_BR_PROB, GEN_INT (prob),
491 REG_NOTES (bb->end));
495 /* Otherwise distribute the probabilities evenly so we get sane
496 sum. Use simple heuristics that if there are normal edges,
497 give all abnormals frequency of 0, otherwise distribute the
498 frequency over abnormals (this is the case of noreturn
504 for (e = bb->succ; e; e = e->succ_next)
505 if (!(e->flags & (EDGE_COMPLEX | EDGE_FAKE)))
509 for (e = bb->succ; e; e = e->succ_next)
510 if (!(e->flags & (EDGE_COMPLEX | EDGE_FAKE)))
511 e->probability = REG_BR_PROB_BASE / total;
517 for (e = bb->succ; e; e = e->succ_next)
519 for (e = bb->succ; e; e = e->succ_next)
520 e->probability = REG_BR_PROB_BASE / total;
523 && any_condjump_p (bb->end)
524 && bb->succ->succ_next)
525 num_branches++, num_never_executed;
531 fprintf (rtl_dump_file, "%d branches\n", num_branches);
532 fprintf (rtl_dump_file, "%d branches never executed\n",
535 for (i = 0; i < 10; i++)
536 fprintf (rtl_dump_file, "%d%% branches in range %d-%d%%\n",
537 (hist_br_prob[i] + hist_br_prob[19-i]) * 100 / num_branches,
540 total_num_branches += num_branches;
541 total_num_never_executed += num_never_executed;
542 for (i = 0; i < 20; i++)
543 total_hist_br_prob[i] += hist_br_prob[i];
545 fputc ('\n', rtl_dump_file);
546 fputc ('\n', rtl_dump_file);
549 free_aux_for_blocks ();
550 find_counters_section (GCOV_TAG_ARC_COUNTS)->present = 1;
553 /* Instrument and/or analyze program behavior based on program flow graph.
554 In either case, this function builds a flow graph for the function being
555 compiled. The flow graph is stored in BB_GRAPH.
557 When FLAG_PROFILE_ARCS is nonzero, this function instruments the edges in
558 the flow graph that are needed to reconstruct the dynamic behavior of the
561 When FLAG_BRANCH_PROBABILITIES is nonzero, this function reads auxiliary
562 information from a data file containing edge count information from previous
563 executions of the function being compiled. In this case, the flow graph is
564 annotated with actual execution counts, which are later propagated into the
565 rtl for optimization purposes.
567 Main entry point of this file. */
574 unsigned num_edges, ignored_edges;
575 struct edge_list *el;
577 total_num_times_called++;
579 flow_call_edges_add (NULL);
580 add_noreturn_fake_exit_edges ();
582 /* We can't handle cyclic regions constructed using abnormal edges.
583 To avoid these we replace every source of abnormal edge by a fake
584 edge from entry node and every destination by fake edge to exit.
585 This keeps graph acyclic and our calculation exact for all normal
586 edges except for exit and entrance ones.
588 We also add fake exit edges for each call and asm statement in the
589 basic, since it may not return. */
593 int need_exit_edge = 0, need_entry_edge = 0;
594 int have_exit_edge = 0, have_entry_edge = 0;
597 /* Functions returning multiple times are not handled by extra edges.
598 Instead we simply allow negative counts on edges from exit to the
599 block past call and corresponding probabilities. We can't go
600 with the extra edges because that would result in flowgraph that
601 needs to have fake edges outside the spanning tree. */
603 for (e = bb->succ; e; e = e->succ_next)
605 if ((e->flags & (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL))
606 && e->dest != EXIT_BLOCK_PTR)
608 if (e->dest == EXIT_BLOCK_PTR)
611 for (e = bb->pred; e; e = e->pred_next)
613 if ((e->flags & (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL))
614 && e->src != ENTRY_BLOCK_PTR)
616 if (e->src == ENTRY_BLOCK_PTR)
620 if (need_exit_edge && !have_exit_edge)
623 fprintf (rtl_dump_file, "Adding fake exit edge to bb %i\n",
625 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
627 if (need_entry_edge && !have_entry_edge)
630 fprintf (rtl_dump_file, "Adding fake entry edge to bb %i\n",
632 make_edge (ENTRY_BLOCK_PTR, bb, EDGE_FAKE);
636 el = create_edge_list ();
637 num_edges = NUM_EDGES (el);
638 alloc_aux_for_edges (sizeof (struct edge_info));
640 /* The basic blocks are expected to be numbered sequentially. */
644 for (i = 0 ; i < num_edges ; i++)
646 edge e = INDEX_EDGE (el, i);
649 /* Mark edges we've replaced by fake edges above as ignored. */
650 if ((e->flags & (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL))
651 && e->src != ENTRY_BLOCK_PTR && e->dest != EXIT_BLOCK_PTR)
653 EDGE_INFO (e)->ignore = 1;
658 #ifdef ENABLE_CHECKING
662 /* Create spanning tree from basic block graph, mark each edge that is
663 on the spanning tree. We insert as many abnormal and critical edges
664 as possible to minimize number of edge splits necessary. */
666 find_spanning_tree (el);
668 /* Fake edges that are not on the tree will not be instrumented, so
669 mark them ignored. */
670 for (i = 0; i < num_edges; i++)
672 edge e = INDEX_EDGE (el, i);
673 struct edge_info *inf = EDGE_INFO (e);
674 if ((e->flags & EDGE_FAKE) && !inf->ignore && !inf->on_tree)
681 total_num_blocks += n_basic_blocks + 2;
683 fprintf (rtl_dump_file, "%d basic blocks\n", n_basic_blocks);
685 total_num_edges += num_edges;
687 fprintf (rtl_dump_file, "%d edges\n", num_edges);
689 total_num_edges_ignored += ignored_edges;
691 fprintf (rtl_dump_file, "%d ignored edges\n", ignored_edges);
693 /* Write the .bbg data from which gcov can reconstruct the basic block
694 graph. First output the number of basic blocks, and then for every
695 edge output the source and target basic block numbers.
696 NOTE: The format of this file must be compatible with gcov. */
698 if (coverage_begin_output ())
702 /* Basic block flags */
703 offset = gcov_write_tag (GCOV_TAG_BLOCKS);
704 for (i = 0; i != (unsigned) (n_basic_blocks + 2); i++)
705 gcov_write_unsigned (0);
706 gcov_write_length (offset);
709 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
713 offset = gcov_write_tag (GCOV_TAG_ARCS);
714 gcov_write_unsigned (BB_TO_GCOV_INDEX (bb));
716 for (e = bb->succ; e; e = e->succ_next)
718 struct edge_info *i = EDGE_INFO (e);
721 unsigned flag_bits = 0;
724 flag_bits |= GCOV_ARC_ON_TREE;
725 if (e->flags & EDGE_FAKE)
726 flag_bits |= GCOV_ARC_FAKE;
727 if (e->flags & EDGE_FALLTHRU)
728 flag_bits |= GCOV_ARC_FALLTHROUGH;
730 gcov_write_unsigned (BB_TO_GCOV_INDEX (e->dest));
731 gcov_write_unsigned (flag_bits);
735 gcov_write_length (offset);
739 /* Output line number information about each basic block for GCOV
741 if (coverage_begin_output ())
743 char const *prev_file_name = NULL;
749 int ignore_next_note = 0;
753 /* We are looking for line number notes. Search backward
754 before basic block to find correct ones. */
755 insn = prev_nonnote_insn (insn);
759 insn = NEXT_INSN (insn);
761 while (insn != bb->end)
763 if (GET_CODE (insn) == NOTE)
765 /* Must ignore the line number notes that
766 immediately follow the end of an inline function
767 to avoid counting it twice. There is a note
768 before the call, and one after the call. */
769 if (NOTE_LINE_NUMBER (insn)
770 == NOTE_INSN_REPEATED_LINE_NUMBER)
771 ignore_next_note = 1;
772 else if (NOTE_LINE_NUMBER (insn) <= 0)
774 else if (ignore_next_note)
775 ignore_next_note = 0;
780 offset = gcov_write_tag (GCOV_TAG_LINES);
781 gcov_write_unsigned (BB_TO_GCOV_INDEX (bb));
784 /* If this is a new source file, then output the
785 file's name to the .bb file. */
787 || strcmp (NOTE_SOURCE_FILE (insn),
790 prev_file_name = NOTE_SOURCE_FILE (insn);
791 gcov_write_unsigned (0);
792 gcov_write_string (prev_file_name);
794 gcov_write_unsigned (NOTE_LINE_NUMBER (insn));
797 insn = NEXT_INSN (insn);
802 /* A file of NULL indicates the end of run. */
803 gcov_write_unsigned (0);
804 gcov_write_string (NULL);
805 gcov_write_length (offset);
810 if (flag_branch_probabilities)
811 compute_branch_probabilities ();
813 /* For each edge not on the spanning tree, add counting code as rtl. */
815 if (cfun->arc_profile && profile_arc_flag)
817 instrument_edges (el);
819 /* Commit changes done by instrumentation. */
820 commit_edge_insertions_watch_calls ();
821 allocate_reg_info (max_reg_num (), FALSE, FALSE);
824 remove_fake_edges ();
825 free_aux_for_edges ();
826 /* Re-merge split basic blocks and the mess introduced by
827 insert_insn_on_edge. */
828 cleanup_cfg (profile_arc_flag ? CLEANUP_EXPENSIVE : 0);
830 dump_flow_info (rtl_dump_file);
835 /* Union find algorithm implementation for the basic blocks using
842 basic_block group = bb, bb1;
844 while ((basic_block) group->aux != group)
845 group = (basic_block) group->aux;
848 while ((basic_block) bb->aux != group)
850 bb1 = (basic_block) bb->aux;
851 bb->aux = (void *) group;
858 union_groups (bb1, bb2)
859 basic_block bb1, bb2;
861 basic_block bb1g = find_group (bb1);
862 basic_block bb2g = find_group (bb2);
864 /* ??? I don't have a place for the rank field. OK. Lets go w/o it,
865 this code is unlikely going to be performance problem anyway. */
872 /* This function searches all of the edges in the program flow graph, and puts
873 as many bad edges as possible onto the spanning tree. Bad edges include
874 abnormals edges, which can't be instrumented at the moment. Since it is
875 possible for fake edges to form a cycle, we will have to develop some
876 better way in the future. Also put critical edges to the tree, since they
877 are more expensive to instrument. */
880 find_spanning_tree (el)
881 struct edge_list *el;
884 int num_edges = NUM_EDGES (el);
887 /* We use aux field for standard union-find algorithm. */
888 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
891 /* Add fake edge exit to entry we can't instrument. */
892 union_groups (EXIT_BLOCK_PTR, ENTRY_BLOCK_PTR);
894 /* First add all abnormal edges to the tree unless they form a cycle. Also
895 add all edges to EXIT_BLOCK_PTR to avoid inserting profiling code behind
896 setting return value from function. */
897 for (i = 0; i < num_edges; i++)
899 edge e = INDEX_EDGE (el, i);
900 if (((e->flags & (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_FAKE))
901 || e->dest == EXIT_BLOCK_PTR
903 && !EDGE_INFO (e)->ignore
904 && (find_group (e->src) != find_group (e->dest)))
907 fprintf (rtl_dump_file, "Abnormal edge %d to %d put to tree\n",
908 e->src->index, e->dest->index);
909 EDGE_INFO (e)->on_tree = 1;
910 union_groups (e->src, e->dest);
914 /* Now insert all critical edges to the tree unless they form a cycle. */
915 for (i = 0; i < num_edges; i++)
917 edge e = INDEX_EDGE (el, i);
918 if ((EDGE_CRITICAL_P (e))
919 && !EDGE_INFO (e)->ignore
920 && (find_group (e->src) != find_group (e->dest)))
923 fprintf (rtl_dump_file, "Critical edge %d to %d put to tree\n",
924 e->src->index, e->dest->index);
925 EDGE_INFO (e)->on_tree = 1;
926 union_groups (e->src, e->dest);
930 /* And now the rest. */
931 for (i = 0; i < num_edges; i++)
933 edge e = INDEX_EDGE (el, i);
934 if (find_group (e->src) != find_group (e->dest)
935 && !EDGE_INFO (e)->ignore)
938 fprintf (rtl_dump_file, "Normal edge %d to %d put to tree\n",
939 e->src->index, e->dest->index);
940 EDGE_INFO (e)->on_tree = 1;
941 union_groups (e->src, e->dest);
945 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
949 /* Perform file-level initialization for branch-prob processing. */
956 total_num_blocks = 0;
958 total_num_edges_ignored = 0;
959 total_num_edges_instrumented = 0;
960 total_num_blocks_created = 0;
961 total_num_passes = 0;
962 total_num_times_called = 0;
963 total_num_branches = 0;
964 total_num_never_executed = 0;
965 for (i = 0; i < 20; i++)
966 total_hist_br_prob[i] = 0;
969 /* Performs file-level cleanup after branch-prob processing
977 fprintf (rtl_dump_file, "\n");
978 fprintf (rtl_dump_file, "Total number of blocks: %d\n",
980 fprintf (rtl_dump_file, "Total number of edges: %d\n", total_num_edges);
981 fprintf (rtl_dump_file, "Total number of ignored edges: %d\n",
982 total_num_edges_ignored);
983 fprintf (rtl_dump_file, "Total number of instrumented edges: %d\n",
984 total_num_edges_instrumented);
985 fprintf (rtl_dump_file, "Total number of blocks created: %d\n",
986 total_num_blocks_created);
987 fprintf (rtl_dump_file, "Total number of graph solution passes: %d\n",
989 if (total_num_times_called != 0)
990 fprintf (rtl_dump_file, "Average number of graph solution passes: %d\n",
991 (total_num_passes + (total_num_times_called >> 1))
992 / total_num_times_called);
993 fprintf (rtl_dump_file, "Total number of branches: %d\n",
995 fprintf (rtl_dump_file, "Total number of branches never executed: %d\n",
996 total_num_never_executed);
997 if (total_num_branches)
1001 for (i = 0; i < 10; i++)
1002 fprintf (rtl_dump_file, "%d%% branches in range %d-%d%%\n",
1003 (total_hist_br_prob[i] + total_hist_br_prob[19-i]) * 100
1004 / total_num_branches, 5*i, 5*i+5);
1010 /* Output instructions as RTL to increment the edge execution count. */
1013 gen_edge_profiler (edgeno)
1016 rtx ref = coverage_counter_ref (GCOV_TAG_ARC_COUNTS, edgeno);
1018 enum machine_mode mode = GET_MODE (ref);
1022 ref = validize_mem (ref);
1024 tmp = expand_simple_binop (mode, PLUS, ref, const1_rtx,
1025 ref, 0, OPTAB_WIDEN);
1028 emit_move_insn (copy_rtx (ref), tmp);
1030 sequence = get_insns ();