1 /* Calculate branch probabilities, and basic block execution counts.
2 Copyright (C) 1990, 91-94, 96, 97, 1998 Free Software Foundation, Inc.
3 Contributed by James E. Wilson, UC Berkeley/Cygnus Support;
4 based on some ideas from Dain Samples of UC Berkeley.
5 Further mangling by Bob Manson, Cygnus Support.
7 This file is part of GNU CC.
9 GNU CC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GNU CC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GNU CC; see the file COPYING. If not, write to
21 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
23 /* ??? Really should not put insns inside of LIBCALL sequences, when putting
24 insns after a call, should look for the insn setting the retval, and
25 insert the insns after that one. */
27 /* ??? Register allocation should use basic block execution counts to
28 give preference to the most commonly executed blocks. */
30 /* ??? The .da files are not safe. Changing the program after creating .da
31 files or using different options when compiling with -fbranch-probabilities
32 can result the arc data not matching the program. Maybe add instrumented
33 arc count to .bbg file? Maybe check whether PFG matches the .bbg file? */
35 /* ??? Should calculate branch probabilities before instrumenting code, since
36 then we can use arc counts to help decide which arcs to instrument. */
38 /* ??? Rearrange code so that the most frequently executed arcs become from
39 one block to the next block (i.e. a fall through), move seldom executed
40 code outside of loops even at the expense of adding a few branches to
41 achieve this, see Dain Sample's UC Berkeley thesis. */
47 #include "insn-flags.h"
48 #include "insn-config.h"
56 extern char * xmalloc ();
58 /* One of these is dynamically created whenever we identify an arc in the
66 unsigned int count_valid : 1;
67 unsigned int on_tree : 1;
68 unsigned int fake : 1;
69 unsigned int fall_through : 1;
71 struct adj_list *pred_next;
72 struct adj_list *succ_next;
75 #define ARC_TARGET(ARCPTR) (ARCPTR->target)
76 #define ARC_SOURCE(ARCPTR) (ARCPTR->source)
77 #define ARC_COUNT(ARCPTR) (ARCPTR->arc_count)
79 /* Count the number of basic blocks, and create an array of these structures,
80 one for each bb in the function. */
84 struct adj_list *succ;
85 struct adj_list *pred;
89 unsigned int count_valid : 1;
90 unsigned int on_tree : 1;
94 /* Indexed by label number, gives the basic block number containing that
97 static int *label_to_bb;
99 /* Number of valid entries in the label_to_bb array. */
101 static int label_to_bb_size;
103 /* Indexed by block index, holds the basic block graph. */
105 static struct bb_info *bb_graph;
107 /* Name and file pointer of the output file for the basic block graph. */
109 static char *bbg_file_name;
110 static FILE *bbg_file;
112 /* Name and file pointer of the input file for the arc count data. */
114 static char *da_file_name;
115 static FILE *da_file;
117 /* Pointer of the output file for the basic block/line number map. */
118 static FILE *bb_file;
120 /* Last source file name written to bb_file. */
122 static char *last_bb_file_name;
124 /* Indicates whether the next line number note should be output to
125 bb_file or not. Used to eliminate a redundant note after an
126 expanded inline function call. */
128 static int ignore_next_note;
130 /* Used by final, for allocating the proper amount of storage for the
131 instrumented arc execution counts. */
133 int count_instrumented_arcs;
135 /* Number of executions for the return label. */
137 int return_label_execution_count;
139 /* Collect statistics on the performance of this pass for the entire source
142 static int total_num_blocks;
143 static int total_num_arcs;
144 static int total_num_arcs_instrumented;
145 static int total_num_blocks_created;
146 static int total_num_passes;
147 static int total_num_times_called;
148 static int total_hist_br_prob[20];
149 static int total_num_never_executed;
150 static int total_num_branches;
152 /* Forward declarations. */
153 static void init_arc PROTO((struct adj_list *, int, int, rtx));
154 static void find_spanning_tree PROTO((int));
155 static void expand_spanning_tree PROTO((int));
156 static void fill_spanning_tree PROTO((int));
157 static void init_arc_profiler PROTO((void));
158 static void output_arc_profiler PROTO((int, rtx));
160 #ifndef LONG_TYPE_SIZE
161 #define LONG_TYPE_SIZE BITS_PER_WORD
164 /* If non-zero, we need to output a constructor to set up the
165 per-object-file data. */
166 static int need_func_profiler = 0;
169 /* Add arc instrumentation code to the entire insn chain.
171 F is the first insn of the chain.
172 NUM_BLOCKS is the number of basic blocks found in F.
173 DUMP_FILE, if nonzero, is an rtl dump file we can write to. */
176 instrument_arcs (f, num_blocks, dump_file)
182 register struct adj_list *arcptr, *backptr;
184 int num_instr_arcs = 0;
187 /* Instrument the program start. */
188 /* Handle block 0 specially, since it will always be instrumented,
189 but it doesn't have a valid first_insn or branch_insn. We must
190 put the instructions before the NOTE_INSN_FUNCTION_BEG note, so
191 that they don't clobber any of the parameters of the current
193 for (insn = f; insn; insn = NEXT_INSN (insn))
194 if (GET_CODE (insn) == NOTE
195 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
197 insn = PREV_INSN (insn);
198 need_func_profiler = 1;
199 output_arc_profiler (total_num_arcs_instrumented + num_instr_arcs++, insn);
201 for (i = 1; i < num_blocks; i++)
202 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
203 if (! arcptr->on_tree)
206 fprintf (dump_file, "Arc %d to %d instrumented\n", i,
207 ARC_TARGET (arcptr));
209 /* Check to see if this arc is the only exit from its source block,
210 or the only entrance to its target block. In either case,
211 we don't need to create a new block to instrument the arc. */
213 if (bb_graph[i].succ == arcptr && arcptr->succ_next == 0)
215 /* Instrument the source block. */
216 output_arc_profiler (total_num_arcs_instrumented
218 PREV_INSN (bb_graph[i].first_insn));
220 else if (arcptr == bb_graph[ARC_TARGET (arcptr)].pred
221 && arcptr->pred_next == 0)
223 /* Instrument the target block. */
224 output_arc_profiler (total_num_arcs_instrumented
226 PREV_INSN (bb_graph[ARC_TARGET (arcptr)].first_insn));
228 else if (arcptr->fall_through)
230 /* This is a fall-through; put the instrumentation code after
231 the branch that ends this block. */
233 for (backptr = bb_graph[i].succ; backptr;
234 backptr = backptr->succ_next)
235 if (backptr != arcptr)
238 output_arc_profiler (total_num_arcs_instrumented
240 backptr->branch_insn);
244 /* Must emit a new basic block to hold the arc counting code. */
245 enum rtx_code code = GET_CODE (PATTERN (arcptr->branch_insn));
249 /* Create the new basic block right after the branch.
250 Invert the branch so that it jumps past the end of the new
251 block. The new block will consist of the instrumentation
252 code, and a jump to the target of this arc. */
253 int this_is_simplejump = simplejump_p (arcptr->branch_insn);
254 rtx new_label = gen_label_rtx ();
255 rtx old_label, set_src;
256 rtx after = arcptr->branch_insn;
258 /* Simplejumps can't reach here. */
259 if (this_is_simplejump)
262 /* We can't use JUMP_LABEL, because it won't be set if we
263 are compiling without optimization. */
265 set_src = SET_SRC (single_set (arcptr->branch_insn));
266 if (GET_CODE (set_src) == LABEL_REF)
268 else if (GET_CODE (set_src) != IF_THEN_ELSE)
270 else if (XEXP (set_src, 1) == pc_rtx)
271 old_label = XEXP (XEXP (set_src, 2), 0);
273 old_label = XEXP (XEXP (set_src, 1), 0);
275 /* Set the JUMP_LABEL so that redirect_jump will work. */
276 JUMP_LABEL (arcptr->branch_insn) = old_label;
278 /* Add a use for OLD_LABEL that will be needed when we emit
279 the JUMP_INSN below. If we don't do this here,
280 `invert_jump' might delete it for us. We must add two
281 when not optimizing, because the NUSES is zero now,
282 but must be at least two to prevent the label from being
284 LABEL_NUSES (old_label) += 2;
286 /* Emit the insns for the new block in reverse order,
287 since that is most convenient. */
289 if (this_is_simplejump)
291 after = NEXT_INSN (arcptr->branch_insn);
292 if (! redirect_jump (arcptr->branch_insn, new_label))
293 /* Don't know what to do if this branch won't
299 if (! invert_jump (arcptr->branch_insn, new_label))
300 /* Don't know what to do if this branch won't invert. */
303 emit_label_after (new_label, after);
304 LABEL_NUSES (new_label)++;
306 emit_barrier_after (after);
307 emit_jump_insn_after (gen_jump (old_label), after);
308 JUMP_LABEL (NEXT_INSN (after)) = old_label;
310 /* Instrument the source arc. */
311 output_arc_profiler (total_num_arcs_instrumented
314 if (this_is_simplejump)
316 emit_label_after (new_label, after);
317 LABEL_NUSES (new_label)++;
320 else if (code == ADDR_VEC || code == ADDR_DIFF_VEC)
322 /* A table jump. Create a new basic block immediately
323 after the table, by emitting a barrier, a label, a
324 counting note, and a jump to the old label. Put the
325 new label in the table. */
327 rtx new_label = gen_label_rtx ();
328 rtx old_lref, new_lref;
331 /* Must determine the old_label reference, do this
332 by counting the arcs after this one, which will
333 give the index of our label in the table. */
336 for (backptr = arcptr->succ_next; backptr;
337 backptr = backptr->succ_next)
340 old_lref = XVECEXP (PATTERN (arcptr->branch_insn),
341 (code == ADDR_DIFF_VEC), index);
343 /* Emit the insns for the new block in reverse order,
344 since that is most convenient. */
345 emit_jump_insn_after (gen_jump (XEXP (old_lref, 0)),
346 arcptr->branch_insn);
347 JUMP_LABEL (NEXT_INSN (arcptr->branch_insn))
348 = XEXP (old_lref, 0);
350 /* Instrument the source arc. */
351 output_arc_profiler (total_num_arcs_instrumented
353 arcptr->branch_insn);
355 emit_label_after (new_label, arcptr->branch_insn);
356 LABEL_NUSES (NEXT_INSN (arcptr->branch_insn))++;
357 emit_barrier_after (arcptr->branch_insn);
359 /* Fix up the table jump. */
360 new_lref = gen_rtx_LABEL_REF (Pmode, new_label);
361 XVECEXP (PATTERN (arcptr->branch_insn),
362 (code == ADDR_DIFF_VEC), index) = new_lref;
370 "Arc %d to %d needed new basic block\n", i,
371 ARC_TARGET (arcptr));
375 total_num_arcs_instrumented += num_instr_arcs;
376 count_instrumented_arcs = total_num_arcs_instrumented;
378 total_num_blocks_created += num_arcs;
381 fprintf (dump_file, "%d arcs instrumented\n", num_instr_arcs);
382 fprintf (dump_file, "%d extra basic blocks created\n", num_arcs);
386 /* Output STRING to bb_file, surrounded by DELIMITER. */
389 output_gcov_string (string, delimiter)
395 /* Write a delimiter to indicate that a file name follows. */
396 __write_long (delimiter, bb_file, 4);
398 /* Write the string. */
399 temp = strlen (string) + 1;
400 fwrite (string, temp, 1, bb_file);
402 /* Append a few zeros, to align the output to a 4 byte boundary. */
408 c[0] = c[1] = c[2] = c[3] = 0;
409 fwrite (c, sizeof (char), 4 - temp, bb_file);
412 /* Store another delimiter in the .bb file, just to make it easy to find the
413 end of the file name. */
414 __write_long (delimiter, bb_file, 4);
417 /* Return TRUE if this insn must be a tablejump entry insn. This works for
418 the MIPS port, but may give false negatives for some targets. */
421 tablejump_entry_p (insn, label)
424 rtx next = next_active_insn (insn);
425 enum rtx_code code = GET_CODE (PATTERN (next));
427 if (code != ADDR_DIFF_VEC && code != ADDR_VEC)
430 if (PREV_INSN (next) == XEXP (label, 0))
436 /* Instrument and/or analyze program behavior based on program flow graph.
437 In either case, this function builds a flow graph for the function being
438 compiled. The flow graph is stored in BB_GRAPH.
440 When FLAG_PROFILE_ARCS is nonzero, this function instruments the arcs in
441 the flow graph that are needed to reconstruct the dynamic behavior of the
444 When FLAG_BRANCH_PROBABILITIES is nonzero, this function reads auxiliary
445 information from a data file containing arc count information from previous
446 executions of the function being compiled. In this case, the flow graph is
447 annotated with actual execution counts, which are later propagated into the
448 rtl for optimization purposes.
450 Main entry point of this file. */
453 branch_prob (f, dump_file)
458 struct adj_list *arcptr;
459 int num_arcs, changes, passes;
461 int hist_br_prob[20], num_never_executed, num_branches;
462 /* Set to non-zero if we got bad count information. */
465 /* start of a function. */
466 if (flag_test_coverage)
467 output_gcov_string (current_function_name, (long) -2);
469 /* Execute this only if doing arc profiling or branch probabilities. */
470 if (! profile_arc_flag && ! flag_branch_probabilities
471 && ! flag_test_coverage)
474 total_num_times_called++;
476 /* Create an array label_to_bb of ints of size max_label_num. */
477 label_to_bb_size = max_label_num ();
478 label_to_bb = (int *) oballoc (label_to_bb_size * sizeof (int));
479 bzero ((char *) label_to_bb, label_to_bb_size * sizeof (int));
481 /* Scan the insns in the function, count the number of basic blocks
482 present. When a code label is passed, set label_to_bb[label] = bb
485 /* The first block found will be block 1, so that function entry can be
489 register RTX_CODE prev_code = JUMP_INSN;
490 register RTX_CODE code;
493 int block_separator_emitted = 0;
495 ignore_next_note = 0;
497 for (insn = NEXT_INSN (f), i = 0; insn; insn = NEXT_INSN (insn))
499 code = GET_CODE (insn);
503 else if (code == CODE_LABEL)
504 /* This label is part of the next block, but we can't increment
505 block number yet since there might be multiple labels. */
506 label_to_bb[CODE_LABEL_NUMBER (insn)] = i + 1;
507 /* We make NOTE_INSN_SETJMP notes into a block of their own, so that
508 they can be the target of the fake arc for the setjmp call.
509 This avoids creating cycles of fake arcs, which would happen if
510 the block after the setjmp call contained a call insn. */
511 else if ((prev_code == JUMP_INSN || prev_code == CALL_INSN
512 || prev_code == CODE_LABEL || prev_code == BARRIER)
513 && (GET_RTX_CLASS (code) == 'i'
515 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)))
519 /* Emit the block separator if it hasn't already been emitted. */
520 if (flag_test_coverage && ! block_separator_emitted)
522 /* Output a zero to the .bb file to indicate that a new
523 block list is starting. */
524 __write_long (0, bb_file, 4);
526 block_separator_emitted = 0;
528 /* If flag_test_coverage is true, then we must add an entry to the
529 .bb file for every note. */
530 else if (code == NOTE && flag_test_coverage)
532 /* Must ignore the line number notes that immediately follow the
533 end of an inline function to avoid counting it twice. There
534 is a note before the call, and one after the call. */
535 if (NOTE_LINE_NUMBER (insn) == NOTE_REPEATED_LINE_NUMBER)
536 ignore_next_note = 1;
537 else if (NOTE_LINE_NUMBER (insn) > 0)
539 if (ignore_next_note)
540 ignore_next_note = 0;
543 /* Emit a block separator here to ensure that a NOTE
544 immediately following a JUMP_INSN or CALL_INSN will end
545 up in the right basic block list. */
546 if ((prev_code == JUMP_INSN || prev_code == CALL_INSN
547 || prev_code == CODE_LABEL || prev_code == BARRIER)
548 && ! block_separator_emitted)
550 /* Output a zero to the .bb file to indicate that
551 a new block list is starting. */
552 __write_long (0, bb_file, 4);
554 block_separator_emitted = 1;
557 /* If this is a new source file, then output the file's
558 name to the .bb file. */
559 if (! last_bb_file_name
560 || strcmp (NOTE_SOURCE_FILE (insn),
563 if (last_bb_file_name)
564 free (last_bb_file_name);
566 = xmalloc (strlen (NOTE_SOURCE_FILE (insn)) + 1);
567 strcpy (last_bb_file_name, NOTE_SOURCE_FILE (insn));
568 output_gcov_string (NOTE_SOURCE_FILE (insn), (long)-1);
571 /* Output the line number to the .bb file. Must be done
572 after the output_bb_profile_data() call, and after the
573 file name is written, to ensure that it is correctly
575 __write_long (NOTE_LINE_NUMBER (insn), bb_file, 4);
582 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)
583 prev_code = CALL_INSN;
586 /* Allocate last `normal' entry for bb_graph. */
588 /* The last insn was a jump, call, or label. In that case we have
589 a block at the end of the function with no insns. */
590 if (prev_code == JUMP_INSN || prev_code == CALL_INSN
591 || prev_code == CODE_LABEL || prev_code == BARRIER)
595 /* Emit the block separator if it hasn't already been emitted. */
596 if (flag_test_coverage && ! block_separator_emitted)
598 /* Output a zero to the .bb file to indicate that a new
599 block list is starting. */
600 __write_long (0, bb_file, 4);
604 /* Create another block to stand for EXIT, and make all return insns, and
605 the last basic block point here. Add one more to account for block
610 total_num_blocks += num_blocks;
612 fprintf (dump_file, "%d basic blocks\n", num_blocks);
614 /* If we are only doing test coverage here, then return now. */
615 if (! profile_arc_flag && ! flag_branch_probabilities)
618 /* Create and initialize the arrays that will hold bb_graph
619 and execution count info. */
621 bb_graph = (struct bb_info *) alloca (num_blocks * sizeof (struct bb_info));
622 bzero ((char *) bb_graph, (sizeof (struct bb_info) * num_blocks));
625 /* Scan the insns again:
626 - at the entry to each basic block, increment the predecessor count
627 (and successor of previous block) if it is a fall through entry,
628 create adj_list entries for this and the previous block
629 - at each jump insn, increment predecessor/successor counts for
630 target/source basic blocks, add this insn to pred/succ lists.
632 This also cannot be broken out as a separate subroutine
633 because it uses `alloca'. */
635 register RTX_CODE prev_code = JUMP_INSN;
636 register RTX_CODE code;
639 int fall_through = 0;
640 struct adj_list *arcptr;
643 /* Block 0 always falls through to block 1. */
645 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
646 init_arc (arcptr, 0, 1, 0);
647 arcptr->fall_through = 1;
650 /* Add a fake fall through arc from the last block to block 0, to make the
652 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
653 init_arc (arcptr, num_blocks - 1, 0, 0);
657 /* Exit must be one node of the graph, and all exits from the function
658 must point there. When see a return branch, must point the arc to the
661 /* Must start scan with second insn in function as above. */
662 for (insn = NEXT_INSN (f), i = 0; insn; insn = NEXT_INSN (insn))
664 code = GET_CODE (insn);
668 else if (code == CODE_LABEL)
670 /* We make NOTE_INSN_SETJMP notes into a block of their own, so that
671 they can be the target of the fake arc for the setjmp call.
672 This avoids creating cycles of fake arcs, which would happen if
673 the block after the setjmp call ended with a call. */
674 else if ((prev_code == JUMP_INSN || prev_code == CALL_INSN
675 || prev_code == CODE_LABEL || prev_code == BARRIER)
676 && (GET_RTX_CLASS (code) == 'i'
678 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)))
680 /* This is the first insn of the block. */
684 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
685 init_arc (arcptr, i - 1, i, 0);
686 arcptr->fall_through = 1;
691 bb_graph[i].first_insn = insn;
693 else if (code == NOTE)
696 if (code == CALL_INSN)
698 /* In the normal case, the call returns, and this is just like
699 a branch fall through. */
702 /* Setjmp may return more times than called, so to make the graph
703 solvable, add a fake arc from the function entrance to the
706 All other functions may return fewer times than called (if
707 a descendent call longjmp or exit), so to make the graph
708 solvable, add a fake arc to the function exit from the
711 Distinguish the cases by checking for a SETJUMP note.
712 A call_insn can be the last ins of a function, so must check
713 to see if next insn actually exists. */
714 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
716 && GET_CODE (NEXT_INSN (insn)) == NOTE
717 && NOTE_LINE_NUMBER (NEXT_INSN (insn)) == NOTE_INSN_SETJMP)
718 init_arc (arcptr, 0, i+1, insn);
720 init_arc (arcptr, i, num_blocks-1, insn);
724 else if (code == JUMP_INSN)
726 rtx tem, pattern = PATTERN (insn);
729 /* If running without optimization, then jump label won't be valid,
730 so we must search for the destination label in that case.
731 We have to handle tablejumps and returns specially anyways, so
732 we don't check the JUMP_LABEL at all here. */
734 /* ??? This code should be rewritten. We need a more elegant way
735 to find the LABEL_REF. We need a more elegant way to
736 differentiate tablejump entries from computed gotos.
737 We should perhaps reuse code from flow to compute the CFG
738 instead of trying to compute it here.
740 We can't use current_function_has_computed_jump, because that
741 is calculated later by flow. We can't use computed_jump_p,
742 because that returns true for tablejump entry insns for some
743 targets, e.g. HPPA and MIPS. */
745 if (GET_CODE (pattern) == PARALLEL)
747 /* This assumes that PARALLEL jumps with a USE are
748 tablejump entry jumps. The same assumption can be found
749 in computed_jump_p. */
750 /* Make an arc from this jump to the label of the
751 jump table. This will instrument the number of
752 times the switch statement is executed. */
753 if (GET_CODE (XVECEXP (pattern, 0, 1)) == USE)
755 tem = XEXP (XVECEXP (pattern, 0, 1), 0);
756 if (GET_CODE (tem) != LABEL_REF)
758 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (tem, 0))];
760 else if (GET_CODE (XVECEXP (pattern, 0, 0)) == SET
761 && SET_DEST (XVECEXP (pattern, 0, 0)) == pc_rtx)
763 tem = SET_SRC (XVECEXP (pattern, 0, 0));
764 if (GET_CODE (tem) == PLUS
765 && GET_CODE (XEXP (tem, 1)) == LABEL_REF)
768 dest = label_to_bb [CODE_LABEL_NUMBER (XEXP (tem, 0))];
774 else if (GET_CODE (pattern) == ADDR_VEC
775 || GET_CODE (pattern) == ADDR_DIFF_VEC)
777 else if (GET_CODE (pattern) == RETURN)
778 dest = num_blocks - 1;
779 else if (GET_CODE (pattern) != SET)
781 else if ((tem = SET_SRC (pattern))
782 && GET_CODE (tem) == LABEL_REF)
783 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (tem, 0))];
784 /* Recognize HPPA table jump entry. This code is similar to
785 the code above in the PARALLEL case. */
786 else if (GET_CODE (tem) == PLUS
787 && GET_CODE (XEXP (tem, 0)) == MEM
788 && GET_CODE (XEXP (XEXP (tem, 0), 0)) == PLUS
789 && GET_CODE (XEXP (XEXP (XEXP (tem, 0), 0), 0)) == PC
790 && GET_CODE (XEXP (tem, 1)) == LABEL_REF
791 && tablejump_entry_p (insn, XEXP (tem, 1)))
792 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (XEXP (tem, 1), 0))];
793 /* Recognize the MIPS table jump entry. */
794 else if (GET_CODE (tem) == PLUS
795 && GET_CODE (XEXP (tem, 0)) == REG
796 && GET_CODE (XEXP (tem, 1)) == LABEL_REF
797 && tablejump_entry_p (insn, XEXP (tem, 1)))
798 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (XEXP (tem, 1), 0))];
803 /* Must be an IF_THEN_ELSE branch. If it isn't, assume it
804 is a computed goto, which aren't supported yet. */
805 if (GET_CODE (tem) != IF_THEN_ELSE)
806 fatal ("-fprofile-arcs does not support computed gotos");
807 if (XEXP (tem, 1) != pc_rtx)
808 label_ref = XEXP (tem, 1);
810 label_ref = XEXP (tem, 2);
811 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (label_ref, 0))];
816 int diff_vec_p = GET_CODE (tablejump) == ADDR_DIFF_VEC;
817 int len = XVECLEN (tablejump, diff_vec_p);
820 for (k = 0; k < len; k++)
822 rtx tem = XEXP (XVECEXP (tablejump, diff_vec_p, k), 0);
823 dest = label_to_bb[CODE_LABEL_NUMBER (tem)];
825 arcptr = (struct adj_list *) alloca (sizeof(struct adj_list));
826 init_arc (arcptr, i, dest, insn);
833 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
834 init_arc (arcptr, i, dest, insn);
839 /* Determine whether or not this jump will fall through.
840 Unconditional jumps and returns are not always followed by
842 pattern = PATTERN (insn);
843 if (GET_CODE (pattern) == PARALLEL
844 || GET_CODE (pattern) == RETURN)
846 else if (GET_CODE (pattern) == ADDR_VEC
847 || GET_CODE (pattern) == ADDR_DIFF_VEC)
848 /* These aren't actually jump insns, but they never fall
853 if (GET_CODE (pattern) != SET || SET_DEST (pattern) != pc_rtx)
855 if (GET_CODE (SET_SRC (pattern)) != IF_THEN_ELSE)
862 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)
864 /* Make a fake insn to tag our notes on. */
865 bb_graph[i].first_insn = insn
866 = emit_insn_after (gen_rtx_USE (VOIDmode, stack_pointer_rtx),
868 prev_code = CALL_INSN;
872 /* If the code at the end of the function would give a new block, then
875 if (prev_code == JUMP_INSN || prev_code == CALL_INSN
876 || prev_code == CODE_LABEL || prev_code == BARRIER)
880 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
881 init_arc (arcptr, i, i + 1, 0);
882 arcptr->fall_through = 1;
887 /* This may not be a real insn, but that should not cause a problem. */
888 bb_graph[i+1].first_insn = get_last_insn ();
891 /* There is always a fake arc from the last block of the function
892 to the function exit block. */
893 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
894 init_arc (arcptr, num_blocks-2, num_blocks-1, 0);
899 total_num_arcs += num_arcs;
901 fprintf (dump_file, "%d arcs\n", num_arcs);
903 /* Create spanning tree from basic block graph, mark each arc that is
904 on the spanning tree. */
906 /* To reduce the instrumentation cost, make two passes over the tree.
907 First, put as many must-split (crowded and fake) arcs on the tree as
908 possible, then on the second pass fill in the rest of the tree.
909 Note that the spanning tree is considered undirected, so that as many
910 must-split arcs as possible can be put on it.
912 Fallthrough arcs which are crowded should not be chosen on the first
913 pass, since they do not require creating a new basic block. These
914 arcs will have fall_through set. */
916 find_spanning_tree (num_blocks);
918 /* Create a .bbg file from which gcov can reconstruct the basic block
919 graph. First output the number of basic blocks, and then for every
920 arc output the source and target basic block numbers.
921 NOTE: The format of this file must be compatible with gcov. */
923 if (flag_test_coverage)
927 __write_long (num_blocks, bbg_file, 4);
928 __write_long (num_arcs, bbg_file, 4);
930 for (i = 0; i < num_blocks; i++)
933 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
935 __write_long (count, bbg_file, 4);
937 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
944 if (arcptr->fall_through)
947 __write_long (ARC_TARGET (arcptr), bbg_file, 4);
948 __write_long (flag_bits, bbg_file, 4);
952 /* Emit a -1 to separate the list of all arcs from the list of
953 loop back edges that follows. */
954 __write_long (-1, bbg_file, 4);
957 /* For each arc not on the spanning tree, add counting code as rtl. */
959 if (profile_arc_flag)
961 instrument_arcs (f, num_blocks, dump_file);
962 allocate_reg_info (max_reg_num (), FALSE, FALSE);
965 /* Execute the rest only if doing branch probabilities. */
966 if (! flag_branch_probabilities)
969 /* For each arc not on the spanning tree, set its execution count from
972 /* The first count in the .da file is the number of times that the function
973 was entered. This is the exec_count for block zero. */
976 for (i = 0; i < num_blocks; i++)
977 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
978 if (! arcptr->on_tree)
984 __read_long (&value, da_file, 8);
985 ARC_COUNT (arcptr) = value;
988 ARC_COUNT (arcptr) = 0;
989 arcptr->count_valid = 1;
990 bb_graph[i].succ_count--;
991 bb_graph[ARC_TARGET (arcptr)].pred_count--;
995 fprintf (dump_file, "%d arc counts read\n", num_arcs);
997 /* For every block in the file,
998 - if every exit/entrance arc has a known count, then set the block count
999 - if the block count is known, and every exit/entrance arc but one has
1000 a known execution count, then set the count of the remaining arc
1002 As arc counts are set, decrement the succ/pred count, but don't delete
1003 the arc, that way we can easily tell when all arcs are known, or only
1004 one arc is unknown. */
1006 /* The order that the basic blocks are iterated through is important.
1007 Since the code that finds spanning trees starts with block 0, low numbered
1008 arcs are put on the spanning tree in preference to high numbered arcs.
1009 Hence, most instrumented arcs are at the end. Graph solving works much
1010 faster if we propagate numbers from the end to the start.
1012 This takes an average of slightly more than 3 passes. */
1021 for (i = num_blocks - 1; i >= 0; i--)
1023 struct bb_info *binfo = &bb_graph[i];
1024 if (! binfo->count_valid)
1026 if (binfo->succ_count == 0)
1029 for (arcptr = binfo->succ; arcptr;
1030 arcptr = arcptr->succ_next)
1031 total += ARC_COUNT (arcptr);
1032 binfo->exec_count = total;
1033 binfo->count_valid = 1;
1036 else if (binfo->pred_count == 0)
1039 for (arcptr = binfo->pred; arcptr;
1040 arcptr = arcptr->pred_next)
1041 total += ARC_COUNT (arcptr);
1042 binfo->exec_count = total;
1043 binfo->count_valid = 1;
1047 if (binfo->count_valid)
1049 if (binfo->succ_count == 1)
1052 /* One of the counts will be invalid, but it is zero,
1053 so adding it in also doesn't hurt. */
1054 for (arcptr = binfo->succ; arcptr;
1055 arcptr = arcptr->succ_next)
1056 total += ARC_COUNT (arcptr);
1057 /* Calculate count for remaining arc by conservation. */
1058 total = binfo->exec_count - total;
1059 /* Search for the invalid arc, and set its count. */
1060 for (arcptr = binfo->succ; arcptr;
1061 arcptr = arcptr->succ_next)
1062 if (! arcptr->count_valid)
1066 arcptr->count_valid = 1;
1067 ARC_COUNT (arcptr) = total;
1068 binfo->succ_count--;
1070 bb_graph[ARC_TARGET (arcptr)].pred_count--;
1073 if (binfo->pred_count == 1)
1076 /* One of the counts will be invalid, but it is zero,
1077 so adding it in also doesn't hurt. */
1078 for (arcptr = binfo->pred; arcptr;
1079 arcptr = arcptr->pred_next)
1080 total += ARC_COUNT (arcptr);
1081 /* Calculate count for remaining arc by conservation. */
1082 total = binfo->exec_count - total;
1083 /* Search for the invalid arc, and set its count. */
1084 for (arcptr = binfo->pred; arcptr;
1085 arcptr = arcptr->pred_next)
1086 if (! arcptr->count_valid)
1090 arcptr->count_valid = 1;
1091 ARC_COUNT (arcptr) = total;
1092 binfo->pred_count--;
1094 bb_graph[ARC_SOURCE (arcptr)].succ_count--;
1101 total_num_passes += passes;
1103 fprintf (dump_file, "Graph solving took %d passes.\n\n", passes);
1105 /* If the graph has been correctly solved, every block will have a
1106 succ and pred count of zero. */
1107 for (i = 0; i < num_blocks; i++)
1109 struct bb_info *binfo = &bb_graph[i];
1110 if (binfo->succ_count || binfo->pred_count)
1114 /* For every arc, calculate its branch probability and add a reg_note
1115 to the branch insn to indicate this. */
1117 for (i = 0; i < 20; i++)
1118 hist_br_prob[i] = 0;
1119 num_never_executed = 0;
1122 for (i = 0; i < num_blocks; i++)
1124 struct bb_info *binfo = &bb_graph[i];
1126 total = binfo->exec_count;
1127 for (arcptr = binfo->succ; arcptr; arcptr = arcptr->succ_next)
1129 if (arcptr->branch_insn)
1131 /* This calculates the branch probability as an integer between
1132 0 and REG_BR_PROB_BASE, properly rounded to the nearest
1133 integer. Perform the arithmetic in double to avoid
1134 overflowing the range of ints. */
1140 rtx pat = PATTERN (arcptr->branch_insn);
1142 prob = (((double)ARC_COUNT (arcptr) * REG_BR_PROB_BASE)
1143 + (total >> 1)) / total;
1144 if (prob < 0 || prob > REG_BR_PROB_BASE)
1147 fprintf (dump_file, "bad count: prob for %d-%d thought to be %d (forcibly normalized)\n",
1148 ARC_SOURCE (arcptr), ARC_TARGET (arcptr),
1152 prob = REG_BR_PROB_BASE / 2;
1155 /* Match up probability with JUMP pattern. */
1157 if (GET_CODE (pat) == SET
1158 && GET_CODE (SET_SRC (pat)) == IF_THEN_ELSE)
1160 if (ARC_TARGET (arcptr) == ARC_SOURCE (arcptr) + 1)
1162 /* A fall through arc should never have a
1168 /* This is the arc for the taken branch. */
1169 if (GET_CODE (XEXP (SET_SRC (pat), 2)) != PC)
1170 prob = REG_BR_PROB_BASE - prob;
1176 num_never_executed++;
1179 int index = prob * 20 / REG_BR_PROB_BASE;
1182 hist_br_prob[index]++;
1186 REG_NOTES (arcptr->branch_insn)
1187 = gen_rtx_EXPR_LIST (REG_BR_PROB, GEN_INT (prob),
1188 REG_NOTES (arcptr->branch_insn));
1192 /* Add a REG_EXEC_COUNT note to the first instruction of this block. */
1193 if (! binfo->first_insn
1194 || GET_RTX_CLASS (GET_CODE (binfo->first_insn)) != 'i')
1196 /* Block 0 is a fake block representing function entry, and does
1197 not have a real first insn. The second last block might not
1198 begin with a real insn. */
1199 if (i == num_blocks - 1)
1200 return_label_execution_count = total;
1201 else if (i != 0 && i != num_blocks - 2)
1206 REG_NOTES (binfo->first_insn)
1207 = gen_rtx_EXPR_LIST (REG_EXEC_COUNT, GEN_INT (total),
1208 REG_NOTES (binfo->first_insn));
1209 if (i == num_blocks - 1)
1210 return_label_execution_count = total;
1214 /* This should never happen. */
1216 warning ("Arc profiling: some arc counts were bad.");
1220 fprintf (dump_file, "%d branches\n", num_branches);
1221 fprintf (dump_file, "%d branches never executed\n",
1222 num_never_executed);
1224 for (i = 0; i < 10; i++)
1225 fprintf (dump_file, "%d%% branches in range %d-%d%%\n",
1226 (hist_br_prob[i]+hist_br_prob[19-i])*100/num_branches,
1229 total_num_branches += num_branches;
1230 total_num_never_executed += num_never_executed;
1231 for (i = 0; i < 20; i++)
1232 total_hist_br_prob[i] += hist_br_prob[i];
1237 /* Initialize a new arc.
1238 ARCPTR is the empty adj_list this function fills in.
1239 SOURCE is the block number of the source block.
1240 TARGET is the block number of the target block.
1241 INSN is the insn which transfers control from SOURCE to TARGET,
1242 or zero if the transfer is implicit. */
1245 init_arc (arcptr, source, target, insn)
1246 struct adj_list *arcptr;
1250 ARC_TARGET (arcptr) = target;
1251 ARC_SOURCE (arcptr) = source;
1253 ARC_COUNT (arcptr) = 0;
1254 arcptr->count_valid = 0;
1255 arcptr->on_tree = 0;
1257 arcptr->fall_through = 0;
1258 arcptr->branch_insn = insn;
1260 arcptr->succ_next = bb_graph[source].succ;
1261 bb_graph[source].succ = arcptr;
1262 bb_graph[source].succ_count++;
1264 arcptr->pred_next = bb_graph[target].pred;
1265 bb_graph[target].pred = arcptr;
1266 bb_graph[target].pred_count++;
1269 /* This function searches all of the arcs in the program flow graph, and puts
1270 as many bad arcs as possible onto the spanning tree. Bad arcs include
1271 fake arcs (needed for setjmp(), longjmp(), exit()) which MUST be on the
1272 spanning tree as they can't be instrumented. Also, arcs which must be
1273 split when instrumented should be part of the spanning tree if possible. */
1276 find_spanning_tree (num_blocks)
1280 struct adj_list *arcptr;
1281 struct bb_info *binfo = &bb_graph[0];
1283 /* Fake arcs must be part of the spanning tree, and are always safe to put
1284 on the spanning tree. Fake arcs will either be a successor of node 0,
1285 a predecessor of the last node, or from the last node to node 0. */
1287 for (arcptr = bb_graph[0].succ; arcptr; arcptr = arcptr->succ_next)
1290 /* Adding this arc should never cause a cycle. This is a fatal
1291 error if it would. */
1292 if (bb_graph[ARC_TARGET (arcptr)].on_tree && binfo->on_tree)
1296 arcptr->on_tree = 1;
1297 bb_graph[ARC_TARGET (arcptr)].on_tree = 1;
1302 binfo = &bb_graph[num_blocks-1];
1303 for (arcptr = binfo->pred; arcptr; arcptr = arcptr->pred_next)
1306 /* Adding this arc should never cause a cycle. This is a fatal
1307 error if it would. */
1308 if (bb_graph[ARC_SOURCE (arcptr)].on_tree && binfo->on_tree)
1312 arcptr->on_tree = 1;
1313 bb_graph[ARC_SOURCE (arcptr)].on_tree = 1;
1317 /* The only entrace to node zero is a fake arc. */
1318 bb_graph[0].pred->on_tree = 1;
1320 /* Arcs which are crowded at both the source and target should be put on
1321 the spanning tree if possible, except for fall_throuch arcs which never
1322 require adding a new block even if crowded, add arcs with the same source
1323 and dest which must always be instrumented. */
1324 for (i = 0; i < num_blocks; i++)
1326 binfo = &bb_graph[i];
1328 for (arcptr = binfo->succ; arcptr; arcptr = arcptr->succ_next)
1329 if (! ((binfo->succ == arcptr && arcptr->succ_next == 0)
1330 || (bb_graph[ARC_TARGET (arcptr)].pred
1331 && arcptr->pred_next == 0))
1332 && ! arcptr->fall_through
1333 && ARC_TARGET (arcptr) != i)
1335 /* This is a crowded arc at both source and target. Try to put
1336 in on the spanning tree. Can do this if either the source or
1337 target block is not yet on the tree. */
1338 if (! bb_graph[ARC_TARGET (arcptr)].on_tree || ! binfo->on_tree)
1340 arcptr->on_tree = 1;
1341 bb_graph[ARC_TARGET (arcptr)].on_tree = 1;
1347 /* Clear all of the basic block on_tree bits, so that we can use them to
1348 create the spanning tree. */
1349 for (i = 0; i < num_blocks; i++)
1350 bb_graph[i].on_tree = 0;
1352 /* Now fill in the spanning tree until every basic block is on it.
1353 Don't put the 0 to 1 fall through arc on the tree, since it is
1354 always cheap to instrument, so start filling the tree from node 1. */
1356 for (i = 1; i < num_blocks; i++)
1357 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
1358 if (! arcptr->on_tree
1359 && ! bb_graph[ARC_TARGET (arcptr)].on_tree)
1361 fill_spanning_tree (i);
1366 /* Add arcs reached from BLOCK to the spanning tree if they are needed and
1367 not already there. */
1370 fill_spanning_tree (block)
1373 struct adj_list *arcptr;
1375 expand_spanning_tree (block);
1377 for (arcptr = bb_graph[block].succ; arcptr; arcptr = arcptr->succ_next)
1378 if (! arcptr->on_tree
1379 && ! bb_graph[ARC_TARGET (arcptr)].on_tree)
1381 arcptr->on_tree = 1;
1382 fill_spanning_tree (ARC_TARGET (arcptr));
1386 /* When first visit a block, must add all blocks that are already connected
1387 to this block via tree arcs to the spanning tree. */
1390 expand_spanning_tree (block)
1393 struct adj_list *arcptr;
1395 bb_graph[block].on_tree = 1;
1397 for (arcptr = bb_graph[block].succ; arcptr; arcptr = arcptr->succ_next)
1398 if (arcptr->on_tree && ! bb_graph[ARC_TARGET (arcptr)].on_tree)
1399 expand_spanning_tree (ARC_TARGET (arcptr));
1401 for (arcptr = bb_graph[block].pred;
1402 arcptr; arcptr = arcptr->pred_next)
1403 if (arcptr->on_tree && ! bb_graph[ARC_SOURCE (arcptr)].on_tree)
1404 expand_spanning_tree (ARC_SOURCE (arcptr));
1407 /* Perform file-level initialization for branch-prob processing. */
1410 init_branch_prob (filename)
1416 if (flag_test_coverage)
1418 /* Open an output file for the basic block/line number map. */
1419 int len = strlen (filename);
1420 char *data_file = (char *) alloca (len + 4);
1421 strcpy (data_file, filename);
1422 strip_off_ending (data_file, len);
1423 strcat (data_file, ".bb");
1424 if ((bb_file = fopen (data_file, "w")) == 0)
1425 pfatal_with_name (data_file);
1427 /* Open an output file for the program flow graph. */
1428 len = strlen (filename);
1429 bbg_file_name = (char *) alloca (len + 5);
1430 strcpy (bbg_file_name, filename);
1431 strip_off_ending (bbg_file_name, len);
1432 strcat (bbg_file_name, ".bbg");
1433 if ((bbg_file = fopen (bbg_file_name, "w")) == 0)
1434 pfatal_with_name (bbg_file_name);
1436 /* Initialize to zero, to ensure that the first file name will be
1437 written to the .bb file. */
1438 last_bb_file_name = 0;
1441 if (flag_branch_probabilities)
1443 len = strlen (filename);
1444 da_file_name = (char *) alloca (len + 4);
1445 strcpy (da_file_name, filename);
1446 strip_off_ending (da_file_name, len);
1447 strcat (da_file_name, ".da");
1448 if ((da_file = fopen (da_file_name, "r")) == 0)
1449 warning ("file %s not found, execution counts assumed to be zero.",
1452 /* The first word in the .da file gives the number of instrumented arcs,
1453 which is not needed for our purposes. */
1456 __read_long (&len, da_file, 8);
1459 if (profile_arc_flag)
1460 init_arc_profiler ();
1462 total_num_blocks = 0;
1464 total_num_arcs_instrumented = 0;
1465 total_num_blocks_created = 0;
1466 total_num_passes = 0;
1467 total_num_times_called = 0;
1468 total_num_branches = 0;
1469 total_num_never_executed = 0;
1470 for (i = 0; i < 20; i++)
1471 total_hist_br_prob[i] = 0;
1474 /* Performs file-level cleanup after branch-prob processing
1478 end_branch_prob (dump_file)
1481 if (flag_test_coverage)
1487 if (flag_branch_probabilities)
1492 /* This seems slightly dangerous, as it presumes the EOF
1493 flag will not be set until an attempt is made to read
1494 past the end of the file. */
1496 warning (".da file contents exhausted too early\n");
1497 /* Should be at end of file now. */
1498 if (__read_long (&temp, da_file, 8) == 0)
1499 warning (".da file contents not exhausted\n");
1506 fprintf (dump_file, "\n");
1507 fprintf (dump_file, "Total number of blocks: %d\n", total_num_blocks);
1508 fprintf (dump_file, "Total number of arcs: %d\n", total_num_arcs);
1509 fprintf (dump_file, "Total number of instrumented arcs: %d\n",
1510 total_num_arcs_instrumented);
1511 fprintf (dump_file, "Total number of blocks created: %d\n",
1512 total_num_blocks_created);
1513 fprintf (dump_file, "Total number of graph solution passes: %d\n",
1515 if (total_num_times_called != 0)
1516 fprintf (dump_file, "Average number of graph solution passes: %d\n",
1517 (total_num_passes + (total_num_times_called >> 1))
1518 / total_num_times_called);
1519 fprintf (dump_file, "Total number of branches: %d\n", total_num_branches);
1520 fprintf (dump_file, "Total number of branches never executed: %d\n",
1521 total_num_never_executed);
1522 if (total_num_branches)
1526 for (i = 0; i < 10; i++)
1527 fprintf (dump_file, "%d%% branches in range %d-%d%%\n",
1528 (total_hist_br_prob[i] + total_hist_br_prob[19-i]) * 100
1529 / total_num_branches, 5*i, 5*i+5);
1534 /* The label used by the arc profiling code. */
1536 static rtx profiler_label;
1538 /* Initialize the profiler_label. */
1541 init_arc_profiler ()
1543 /* Generate and save a copy of this so it can be shared. */
1544 char *name = xmalloc (20);
1545 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
1546 profiler_label = gen_rtx_SYMBOL_REF (Pmode, name);
1549 /* Output instructions as RTL to increment the arc execution count. */
1552 output_arc_profiler (arcno, insert_after)
1556 rtx profiler_target_addr
1558 ? gen_rtx_CONST (Pmode,
1559 gen_rtx_PLUS (Pmode, profiler_label,
1560 GEN_INT (LONG_TYPE_SIZE / BITS_PER_UNIT * arcno)))
1562 enum machine_mode mode = mode_for_size (LONG_TYPE_SIZE, MODE_INT, 0);
1563 rtx profiler_reg = gen_reg_rtx (mode);
1564 rtx address_reg = gen_reg_rtx (Pmode);
1565 rtx mem_ref, add_ref;
1568 /* In this case, reload can use explicitly mentioned hard registers for
1569 reloads. It is not safe to output profiling code between a call
1570 and the instruction that copies the result to a pseudo-reg. This
1571 is because reload may allocate one of the profiling code pseudo-regs
1572 to the return value reg, thus clobbering the return value. So we
1573 must check for calls here, and emit the profiling code after the
1574 instruction that uses the return value, if any.
1576 ??? The code here performs the same tests that reload does so hopefully
1577 all the bases are covered. */
1579 if (SMALL_REGISTER_CLASSES
1580 && GET_CODE (insert_after) == CALL_INSN
1581 && (GET_CODE (PATTERN (insert_after)) == SET
1582 || (GET_CODE (PATTERN (insert_after)) == PARALLEL
1583 && GET_CODE (XVECEXP (PATTERN (insert_after), 0, 0)) == SET)))
1586 rtx next_insert_after = next_nonnote_insn (insert_after);
1588 /* The first insn after the call may be a stack pop, skip it. */
1589 if (next_insert_after
1590 && GET_CODE (next_insert_after) == INSN
1591 && GET_CODE (PATTERN (next_insert_after)) == SET
1592 && SET_DEST (PATTERN (next_insert_after)) == stack_pointer_rtx)
1593 next_insert_after = next_nonnote_insn (next_insert_after);
1595 if (next_insert_after
1596 && GET_CODE (next_insert_after) == INSN)
1598 if (GET_CODE (PATTERN (insert_after)) == SET)
1599 return_reg = SET_DEST (PATTERN (insert_after));
1601 return_reg = SET_DEST (XVECEXP (PATTERN (insert_after), 0, 0));
1603 /* Now, NEXT_INSERT_AFTER may be an instruction that uses the
1604 return value. However, it could also be something else,
1605 like a CODE_LABEL, so check that the code is INSN. */
1606 if (next_insert_after != 0
1607 && GET_RTX_CLASS (GET_CODE (next_insert_after)) == 'i'
1608 && reg_referenced_p (return_reg, PATTERN (next_insert_after)))
1609 insert_after = next_insert_after;
1615 emit_move_insn (address_reg, profiler_target_addr);
1616 mem_ref = gen_rtx_MEM (mode, address_reg);
1617 emit_move_insn (profiler_reg, mem_ref);
1619 add_ref = gen_rtx_PLUS (mode, profiler_reg, GEN_INT (1));
1620 emit_move_insn (profiler_reg, add_ref);
1622 /* This is the same rtx as above, but it is not legal to share this rtx. */
1623 mem_ref = gen_rtx_MEM (mode, address_reg);
1624 emit_move_insn (mem_ref, profiler_reg);
1626 sequence = gen_sequence ();
1628 emit_insn_after (sequence, insert_after);
1631 /* Output code for a constructor that will invoke __bb_init_func, if
1632 this has not already been done. */
1635 output_func_start_profiler ()
1637 tree fnname, fndecl;
1638 char *name, *cfnname;
1640 enum machine_mode mode = mode_for_size (LONG_TYPE_SIZE, MODE_INT, 0);
1641 int save_flag_inline_functions = flag_inline_functions;
1643 /* It's either already been output, or we don't need it because we're
1644 not doing profile-arcs. */
1645 if (! need_func_profiler)
1648 need_func_profiler = 0;
1650 /* Synthesize a constructor function to invoke __bb_init_func with a
1651 pointer to this object file's profile block. */
1654 /* Try and make a unique name given the "file function name".
1656 And no, I don't like this either. */
1658 fnname = get_file_function_name ('I');
1659 cfnname = IDENTIFIER_POINTER (fnname);
1660 name = xmalloc (strlen (cfnname) + 5);
1661 sprintf (name, "%sGCOV",cfnname);
1662 fnname = get_identifier (name);
1665 fndecl = build_decl (FUNCTION_DECL, fnname,
1666 build_function_type (void_type_node, NULL_TREE));
1667 DECL_EXTERNAL (fndecl) = 0;
1668 TREE_PUBLIC (fndecl) = 1;
1669 DECL_ASSEMBLER_NAME (fndecl) = fnname;
1670 DECL_RESULT (fndecl) = build_decl (RESULT_DECL, NULL_TREE, void_type_node);
1671 current_function_decl = fndecl;
1673 make_function_rtl (fndecl);
1674 init_function_start (fndecl, input_filename, lineno);
1675 expand_function_start (fndecl, 0);
1677 /* Actually generate the code to call __bb_init_func. */
1678 name = xmalloc (20);
1679 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 0);
1680 table_address = force_reg (Pmode, gen_rtx_SYMBOL_REF (Pmode, name));
1681 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, "__bb_init_func"), 0,
1682 mode, 1, table_address, Pmode);
1684 expand_function_end (input_filename, lineno, 0);
1687 /* Since fndecl isn't in the list of globals, it would never be emitted
1688 when it's considered to be 'safe' for inlining, so turn off
1689 flag_inline_functions. */
1690 flag_inline_functions = 0;
1692 rest_of_compilation (fndecl);
1694 /* Reset flag_inline_functions to its original value. */
1695 flag_inline_functions = save_flag_inline_functions;
1698 fflush (asm_out_file);
1699 current_function_decl = NULL_TREE;
1701 assemble_constructor (IDENTIFIER_POINTER (DECL_NAME (fndecl)));