58/* One of these is dynamically created whenever we identify an arc in the
59 function. */
60
61struct adj_list
62{
63 int source;
64 int target;
65 int arc_count;
66 unsigned int count_valid : 1;
67 unsigned int on_tree : 1;
68 unsigned int fake : 1;
69 unsigned int fall_through : 1;
70 rtx branch_insn;
71 struct adj_list *pred_next;
72 struct adj_list *succ_next;
73};
74
75#define ARC_TARGET(ARCPTR) (ARCPTR->target)
76#define ARC_SOURCE(ARCPTR) (ARCPTR->source)
77#define ARC_COUNT(ARCPTR) (ARCPTR->arc_count)
78
79/* Count the number of basic blocks, and create an array of these structures,
80 one for each bb in the function. */
81
82struct bb_info
83{
84 struct adj_list *succ;
85 struct adj_list *pred;
86 int succ_count;
87 int pred_count;
88 int exec_count;
89 unsigned int count_valid : 1;
90 unsigned int on_tree : 1;
91 rtx first_insn;
92};
93
94/* Indexed by label number, gives the basic block number containing that
95 label. */
96
97static int *label_to_bb;
98
99/* Number of valid entries in the label_to_bb array. */
100
101static int label_to_bb_size;
102
103/* Indexed by block index, holds the basic block graph. */
104
105static struct bb_info *bb_graph;
106
107/* Name and file pointer of the output file for the basic block graph. */
108
109static char *bbg_file_name;
110static FILE *bbg_file;
111
112/* Name and file pointer of the input file for the arc count data. */
113
114static char *da_file_name;
115static FILE *da_file;
116
117/* Pointer of the output file for the basic block/line number map. */
118static FILE *bb_file;
119
120/* Last source file name written to bb_file. */
121
122static char *last_bb_file_name;
123
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. */
127
128static int ignore_next_note;
129
130/* Used by final, for allocating the proper amount of storage for the
131 instrumented arc execution counts. */
132
133int count_instrumented_arcs;
134
135/* Number of executions for the return label. */
136
137int return_label_execution_count;
138
139/* Collect statistics on the performance of this pass for the entire source
140 file. */
141
142static int total_num_blocks;
143static int total_num_arcs;
144static int total_num_arcs_instrumented;
145static int total_num_blocks_created;
146static int total_num_passes;
147static int total_num_times_called;
148static int total_hist_br_prob[20];
149static int total_num_never_executed;
150static int total_num_branches;
151
152/* Forward declarations. */
153static void init_arc PROTO((struct adj_list *, int, int, rtx));
154static void find_spanning_tree PROTO((int));
155static void expand_spanning_tree PROTO((int));
156static void fill_spanning_tree PROTO((int));
157static void init_arc_profiler PROTO((void));
158static void output_arc_profiler PROTO((int, rtx));
159
160#ifndef LONG_TYPE_SIZE
161#define LONG_TYPE_SIZE BITS_PER_WORD
162#endif
163
164/* If non-zero, we need to output a constructor to set up the
165 per-object-file data. */
166static int need_func_profiler = 0;
167
168
169/* Add arc instrumentation code to the entire insn chain.
170
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. */
174
175static void
176instrument_arcs (f, num_blocks, dump_file)
177 rtx f;
178 int num_blocks;
179 FILE *dump_file;
180{
181 register int i;
182 register struct adj_list *arcptr, *backptr;
183 int num_arcs = 0;
184 int num_instr_arcs = 0;
185 rtx insn;
186
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
192 function. */
193 for (insn = f; insn; insn = NEXT_INSN (insn))
194 if (GET_CODE (insn) == NOTE
195 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
196 break;
197 insn = PREV_INSN (insn);
198 need_func_profiler = 1;
199 output_arc_profiler (total_num_arcs_instrumented + num_instr_arcs++, insn);
200
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)
204 {
205 if (dump_file)
206 fprintf (dump_file, "Arc %d to %d instrumented\n", i,
207 ARC_TARGET (arcptr));
208
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. */
212
213 if (bb_graph[i].succ == arcptr && arcptr->succ_next == 0)
214 {
215 /* Instrument the source block. */
216 output_arc_profiler (total_num_arcs_instrumented
217 + num_instr_arcs++,
218 PREV_INSN (bb_graph[i].first_insn));
219 }
220 else if (arcptr == bb_graph[ARC_TARGET (arcptr)].pred
221 && arcptr->pred_next == 0)
222 {
223 /* Instrument the target block. */
224 output_arc_profiler (total_num_arcs_instrumented
225 + num_instr_arcs++,
226 PREV_INSN (bb_graph[ARC_TARGET (arcptr)].first_insn));
227 }
228 else if (arcptr->fall_through)
229 {
230 /* This is a fall-through; put the instrumentation code after
231 the branch that ends this block. */
232
233 for (backptr = bb_graph[i].succ; backptr;
234 backptr = backptr->succ_next)
235 if (backptr != arcptr)
236 break;
237
238 output_arc_profiler (total_num_arcs_instrumented
239 + num_instr_arcs++,
240 backptr->branch_insn);
241 }
242 else
243 {
244 /* Must emit a new basic block to hold the arc counting code. */
245 enum rtx_code code = GET_CODE (PATTERN (arcptr->branch_insn));
246
247 if (code == SET)
248 {
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;
257
258 /* Simplejumps can't reach here. */
259 if (this_is_simplejump)
260 abort ();
261
262 /* We can't use JUMP_LABEL, because it won't be set if we
263 are compiling without optimization. */
264
265 set_src = SET_SRC (single_set (arcptr->branch_insn));
266 if (GET_CODE (set_src) == LABEL_REF)
267 old_label = set_src;
268 else if (GET_CODE (set_src) != IF_THEN_ELSE)
269 abort ();
270 else if (XEXP (set_src, 1) == pc_rtx)
271 old_label = XEXP (XEXP (set_src, 2), 0);
272 else
273 old_label = XEXP (XEXP (set_src, 1), 0);
274
275 /* Set the JUMP_LABEL so that redirect_jump will work. */
276 JUMP_LABEL (arcptr->branch_insn) = old_label;
277
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
283 deleted. */
284 LABEL_NUSES (old_label) += 2;
285
286 /* Emit the insns for the new block in reverse order,
287 since that is most convenient. */
288
289 if (this_is_simplejump)
290 {
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
294 redirect. */
295 abort ();
296 }
297 else
298 {
299 if (! invert_jump (arcptr->branch_insn, new_label))
300 /* Don't know what to do if this branch won't invert. */
301 abort ();
302
303 emit_label_after (new_label, after);
304 LABEL_NUSES (new_label)++;
305 }
306 emit_barrier_after (after);
307 emit_jump_insn_after (gen_jump (old_label), after);
308 JUMP_LABEL (NEXT_INSN (after)) = old_label;
309
310 /* Instrument the source arc. */
311 output_arc_profiler (total_num_arcs_instrumented
312 + num_instr_arcs++,
313 after);
314 if (this_is_simplejump)
315 {
316 emit_label_after (new_label, after);
317 LABEL_NUSES (new_label)++;
318 }
319 }
320 else if (code == ADDR_VEC || code == ADDR_DIFF_VEC)
321 {
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. */
326
327 rtx new_label = gen_label_rtx ();
328 rtx old_lref, new_lref;
329 int index;
330
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. */
334
335 index = 0;
336 for (backptr = arcptr->succ_next; backptr;
337 backptr = backptr->succ_next)
338 index++;
339
340 old_lref = XVECEXP (PATTERN (arcptr->branch_insn),
341 (code == ADDR_DIFF_VEC), index);
342
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);
349
350 /* Instrument the source arc. */
351 output_arc_profiler (total_num_arcs_instrumented
352 + num_instr_arcs++,
353 arcptr->branch_insn);
354
355 emit_label_after (new_label, arcptr->branch_insn);
356 LABEL_NUSES (NEXT_INSN (arcptr->branch_insn))++;
357 emit_barrier_after (arcptr->branch_insn);
358
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;
363 }
364 else
365 abort ();
366
367 num_arcs += 1;
368 if (dump_file)
369 fprintf (dump_file,
370 "Arc %d to %d needed new basic block\n", i,
371 ARC_TARGET (arcptr));
372 }
373 }
374
375 total_num_arcs_instrumented += num_instr_arcs;
376 count_instrumented_arcs = total_num_arcs_instrumented;
377
378 total_num_blocks_created += num_arcs;
379 if (dump_file)
380 {
381 fprintf (dump_file, "%d arcs instrumented\n", num_instr_arcs);
382 fprintf (dump_file, "%d extra basic blocks created\n", num_arcs);
383 }
384}
385
386/* Output STRING to bb_file, surrounded by DELIMITER. */
387
388static void
389output_gcov_string (string, delimiter)
390 char *string;
391 long delimiter;
392{
393 long temp;
394
395 /* Write a delimiter to indicate that a file name follows. */
396 __write_long (delimiter, bb_file, 4);
397
398 /* Write the string. */
399 temp = strlen (string) + 1;
400 fwrite (string, temp, 1, bb_file);
401
402 /* Append a few zeros, to align the output to a 4 byte boundary. */
403 temp = temp & 0x3;
404 if (temp)
405 {
406 char c[4];
407
408 c[0] = c[1] = c[2] = c[3] = 0;
409 fwrite (c, sizeof (char), 4 - temp, bb_file);
410 }
411
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);
415}
416
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. */
419
420int
421tablejump_entry_p (insn, label)
422 rtx insn, label;
423{
424 rtx next = next_active_insn (insn);
425 enum rtx_code code = GET_CODE (PATTERN (next));
426
427 if (code != ADDR_DIFF_VEC && code != ADDR_VEC)
428 return 0;
429
430 if (PREV_INSN (next) == XEXP (label, 0))
431 return 1;
432
433 return 0;
434}
435
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.
439
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
442 flow graph.
443
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.
449
450 Main entry point of this file. */
451
452void
453branch_prob (f, dump_file)
454 rtx f;
455 FILE *dump_file;
456{
457 int i, num_blocks;
458 struct adj_list *arcptr;
459 int num_arcs, changes, passes;
460 int total, prob;
461 int hist_br_prob[20], num_never_executed, num_branches;
462 /* Set to non-zero if we got bad count information. */
463 int bad_counts = 0;
464
465 /* start of a function. */
466 if (flag_test_coverage)
467 output_gcov_string (current_function_name, (long) -2);
468
469 /* Execute this only if doing arc profiling or branch probabilities. */
470 if (! profile_arc_flag && ! flag_branch_probabilities
471 && ! flag_test_coverage)
472 abort ();
473
474 total_num_times_called++;
475
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));
480
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
483 number. */
484
485 /* The first block found will be block 1, so that function entry can be
486 block 0. */
487
488 {
489 register RTX_CODE prev_code = JUMP_INSN;
490 register RTX_CODE code;
491 register rtx insn;
492 register int i;
493 int block_separator_emitted = 0;
494
495 ignore_next_note = 0;
496
497 for (insn = NEXT_INSN (f), i = 0; insn; insn = NEXT_INSN (insn))
498 {
499 code = GET_CODE (insn);
500
501 if (code == BARRIER)
502 ;
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'
514 || (code == NOTE
515 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)))
516 {
517 i += 1;
518
519 /* Emit the block separator if it hasn't already been emitted. */
520 if (flag_test_coverage && ! block_separator_emitted)
521 {
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);
525 }
526 block_separator_emitted = 0;
527 }
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)
531 {
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)
538 {
539 if (ignore_next_note)
540 ignore_next_note = 0;
541 else
542 {
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)
549 {
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);
553
554 block_separator_emitted = 1;
555 }
556
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),
561 last_bb_file_name))
562 {
563 if (last_bb_file_name)
564 free (last_bb_file_name);
565 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);
569 }
570
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
574 handled by gcov. */
575 __write_long (NOTE_LINE_NUMBER (insn), bb_file, 4);
576 }
577 }
578 }
579
580 if (code != NOTE)
581 prev_code = code;
582 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)
583 prev_code = CALL_INSN;
584 }
585
586 /* Allocate last `normal' entry for bb_graph. */
587
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)
592 {
593 i++;
594
595 /* Emit the block separator if it hasn't already been emitted. */
596 if (flag_test_coverage && ! block_separator_emitted)
597 {
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);
601 }
602 }
603
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
606 zero. */
607 num_blocks = i + 2;
608 }
609
610 total_num_blocks += num_blocks;
611 if (dump_file)
612 fprintf (dump_file, "%d basic blocks\n", num_blocks);
613
614 /* If we are only doing test coverage here, then return now. */
615 if (! profile_arc_flag && ! flag_branch_probabilities)
616 return;
617
618 /* Create and initialize the arrays that will hold bb_graph
619 and execution count info. */
620
621 bb_graph = (struct bb_info *) alloca (num_blocks * sizeof (struct bb_info));
622 bzero ((char *) bb_graph, (sizeof (struct bb_info) * num_blocks));
623
624 {
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.
631
632 This also cannot be broken out as a separate subroutine
633 because it uses `alloca'. */
634
635 register RTX_CODE prev_code = JUMP_INSN;
636 register RTX_CODE code;
637 register rtx insn;
638 register int i;
639 int fall_through = 0;
640 struct adj_list *arcptr;
641 int dest = 0;
642
643 /* Block 0 always falls through to block 1. */
644 num_arcs = 0;
645 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
646 init_arc (arcptr, 0, 1, 0);
647 arcptr->fall_through = 1;
648 num_arcs++;
649
650 /* Add a fake fall through arc from the last block to block 0, to make the
651 graph complete. */
652 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
653 init_arc (arcptr, num_blocks - 1, 0, 0);
654 arcptr->fake = 1;
655 num_arcs++;
656
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
659 exit node. */
660
661 /* Must start scan with second insn in function as above. */
662 for (insn = NEXT_INSN (f), i = 0; insn; insn = NEXT_INSN (insn))
663 {
664 code = GET_CODE (insn);
665
666 if (code == BARRIER)
667 fall_through = 0;
668 else if (code == CODE_LABEL)
669 ;
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'
677 || (code == NOTE
678 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)))
679 {
680 /* This is the first insn of the block. */
681 i += 1;
682 if (fall_through)
683 {
684 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
685 init_arc (arcptr, i - 1, i, 0);
686 arcptr->fall_through = 1;
687
688 num_arcs++;
689 }
690 fall_through = 1;
691 bb_graph[i].first_insn = insn;
692 }
693 else if (code == NOTE)
694 {;}
695
696 if (code == CALL_INSN)
697 {
698 /* In the normal case, the call returns, and this is just like
699 a branch fall through. */
700 fall_through = 1;
701
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
704 next block.
705
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
709 current block.
710
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));
715 if (NEXT_INSN (insn)
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);
719 else
720 init_arc (arcptr, i, num_blocks-1, insn);
721 arcptr->fake = 1;
722 num_arcs++;
723 }
724 else if (code == JUMP_INSN)
725 {
726 rtx tem, pattern = PATTERN (insn);
727 rtx tablejump = 0;
728
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. */
733
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.
739
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. */
744
745 if (GET_CODE (pattern) == PARALLEL)
746 {
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)
754 {
755 tem = XEXP (XVECEXP (pattern, 0, 1), 0);
756 if (GET_CODE (tem) != LABEL_REF)
757 abort ();
758 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (tem, 0))];
759 }
760 else if (GET_CODE (XVECEXP (pattern, 0, 0)) == SET
761 && SET_DEST (XVECEXP (pattern, 0, 0)) == pc_rtx)
762 {
763 tem = SET_SRC (XVECEXP (pattern, 0, 0));
764 if (GET_CODE (tem) == PLUS
765 && GET_CODE (XEXP (tem, 1)) == LABEL_REF)
766 {
767 tem = XEXP (tem, 1);
768 dest = label_to_bb [CODE_LABEL_NUMBER (XEXP (tem, 0))];
769 }
770 }
771 else
772 abort ();
773 }
774 else if (GET_CODE (pattern) == ADDR_VEC
775 || GET_CODE (pattern) == ADDR_DIFF_VEC)
776 tablejump = pattern;
777 else if (GET_CODE (pattern) == RETURN)
778 dest = num_blocks - 1;
779 else if (GET_CODE (pattern) != SET)
780 abort ();
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))];
799 else
800 {
801 rtx label_ref;
802
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);
809 else
810 label_ref = XEXP (tem, 2);
811 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (label_ref, 0))];
812 }
813
814 if (tablejump)
815 {
816 int diff_vec_p = GET_CODE (tablejump) == ADDR_DIFF_VEC;
817 int len = XVECLEN (tablejump, diff_vec_p);
818 int k;
819
820 for (k = 0; k < len; k++)
821 {
822 rtx tem = XEXP (XVECEXP (tablejump, diff_vec_p, k), 0);
823 dest = label_to_bb[CODE_LABEL_NUMBER (tem)];
824
825 arcptr = (struct adj_list *) alloca (sizeof(struct adj_list));
826 init_arc (arcptr, i, dest, insn);
827
828 num_arcs++;
829 }
830 }
831 else
832 {
833 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
834 init_arc (arcptr, i, dest, insn);
835
836 num_arcs++;
837 }
838
839 /* Determine whether or not this jump will fall through.
840 Unconditional jumps and returns are not always followed by
841 barriers. */
842 pattern = PATTERN (insn);
843 if (GET_CODE (pattern) == PARALLEL
844 || GET_CODE (pattern) == RETURN)
845 fall_through = 0;
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
849 through, so... */
850 fall_through = 0;
851 else
852 {
853 if (GET_CODE (pattern) != SET || SET_DEST (pattern) != pc_rtx)
854 abort ();
855 if (GET_CODE (SET_SRC (pattern)) != IF_THEN_ELSE)
856 fall_through = 0;
857 }
858 }
859
860 if (code != NOTE)
861 prev_code = code;
862 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)
863 {
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),
867 insn);
868 prev_code = CALL_INSN;
869 }
870 }
871
872 /* If the code at the end of the function would give a new block, then
873 do the following. */
874
875 if (prev_code == JUMP_INSN || prev_code == CALL_INSN
876 || prev_code == CODE_LABEL || prev_code == BARRIER)
877 {
878 if (fall_through)
879 {
880 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
881 init_arc (arcptr, i, i + 1, 0);
882 arcptr->fall_through = 1;
883
884 num_arcs++;
885 }
886
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 ();
889 }
890
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);
895 arcptr->fake = 1;
896 num_arcs++;
897 }
898
899 total_num_arcs += num_arcs;
900 if (dump_file)
901 fprintf (dump_file, "%d arcs\n", num_arcs);
902
903 /* Create spanning tree from basic block graph, mark each arc that is
904 on the spanning tree. */
905
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.
911
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. */
915
916 find_spanning_tree (num_blocks);
917
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. */
922
923 if (flag_test_coverage)
924 {
925 int flag_bits;
926
927 __write_long (num_blocks, bbg_file, 4);
928 __write_long (num_arcs, bbg_file, 4);
929
930 for (i = 0; i < num_blocks; i++)
931 {
932 long count = 0;
933 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
934 count++;
935 __write_long (count, bbg_file, 4);
936
937 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
938 {
939 flag_bits = 0;
940 if (arcptr->on_tree)
941 flag_bits |= 0x1;
942 if (arcptr->fake)
943 flag_bits |= 0x2;
944 if (arcptr->fall_through)
945 flag_bits |= 0x4;
946
947 __write_long (ARC_TARGET (arcptr), bbg_file, 4);
948 __write_long (flag_bits, bbg_file, 4);
949 }
950 }
951
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);
955 }
956
957 /* For each arc not on the spanning tree, add counting code as rtl. */
958
959 if (profile_arc_flag)
960 {
961 instrument_arcs (f, num_blocks, dump_file);
962 allocate_reg_info (max_reg_num (), FALSE, FALSE);
963 }
964
965 /* Execute the rest only if doing branch probabilities. */
966 if (! flag_branch_probabilities)
967 return;
968
969 /* For each arc not on the spanning tree, set its execution count from
970 the .da file. */
971
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. */
974
975 num_arcs = 0;
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)
979 {
980 num_arcs++;
981 if (da_file)
982 {
983 long value;
984 __read_long (&value, da_file, 8);
985 ARC_COUNT (arcptr) = value;
986 }
987 else
988 ARC_COUNT (arcptr) = 0;
989 arcptr->count_valid = 1;
990 bb_graph[i].succ_count--;
991 bb_graph[ARC_TARGET (arcptr)].pred_count--;
992 }
993
994 if (dump_file)
995 fprintf (dump_file, "%d arc counts read\n", num_arcs);
996
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
1001
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. */
1005
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.
1011
1012 This takes an average of slightly more than 3 passes. */
1013
1014 changes = 1;
1015 passes = 0;
1016 while (changes)
1017 {
1018 passes++;
1019 changes = 0;
1020
1021 for (i = num_blocks - 1; i >= 0; i--)
1022 {
1023 struct bb_info *binfo = &bb_graph[i];
1024 if (! binfo->count_valid)
1025 {
1026 if (binfo->succ_count == 0)
1027 {
1028 total = 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;
1034 changes = 1;
1035 }
1036 else if (binfo->pred_count == 0)
1037 {
1038 total = 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;
1044 changes = 1;
1045 }
1046 }
1047 if (binfo->count_valid)
1048 {
1049 if (binfo->succ_count == 1)
1050 {
1051 total = 0;
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)
1063 break;
1064 if (! arcptr)
1065 abort ();
1066 arcptr->count_valid = 1;
1067 ARC_COUNT (arcptr) = total;
1068 binfo->succ_count--;
1069
1070 bb_graph[ARC_TARGET (arcptr)].pred_count--;
1071 changes = 1;
1072 }
1073 if (binfo->pred_count == 1)
1074 {
1075 total = 0;
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)
1087 break;
1088 if (! arcptr)
1089 abort ();
1090 arcptr->count_valid = 1;
1091 ARC_COUNT (arcptr) = total;
1092 binfo->pred_count--;
1093
1094 bb_graph[ARC_SOURCE (arcptr)].succ_count--;
1095 changes = 1;
1096 }
1097 }
1098 }
1099 }
1100
1101 total_num_passes += passes;
1102 if (dump_file)
1103 fprintf (dump_file, "Graph solving took %d passes.\n\n", passes);
1104
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++)
1108 {
1109 struct bb_info *binfo = &bb_graph[i];
1110 if (binfo->succ_count || binfo->pred_count)
1111 abort ();
1112 }
1113
1114 /* For every arc, calculate its branch probability and add a reg_note
1115 to the branch insn to indicate this. */
1116
1117 for (i = 0; i < 20; i++)
1118 hist_br_prob[i] = 0;
1119 num_never_executed = 0;
1120 num_branches = 0;
1121
1122 for (i = 0; i < num_blocks; i++)
1123 {
1124 struct bb_info *binfo = &bb_graph[i];
1125
1126 total = binfo->exec_count;
1127 for (arcptr = binfo->succ; arcptr; arcptr = arcptr->succ_next)
1128 {
1129 if (arcptr->branch_insn)
1130 {
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. */
1135
1136 if (total == 0)
1137 prob = -1;
1138 else
1139 {
1140 rtx pat = PATTERN (arcptr->branch_insn);
1141
1142 prob = (((double)ARC_COUNT (arcptr) * REG_BR_PROB_BASE)
1143 + (total >> 1)) / total;
1144 if (prob < 0 || prob > REG_BR_PROB_BASE)
1145 {
1146 if (dump_file)
1147 fprintf (dump_file, "bad count: prob for %d-%d thought to be %d (forcibly normalized)\n",
1148 ARC_SOURCE (arcptr), ARC_TARGET (arcptr),
1149 prob);
1150
1151 bad_counts = 1;
1152 prob = REG_BR_PROB_BASE / 2;
1153 }
1154
1155 /* Match up probability with JUMP pattern. */
1156
1157 if (GET_CODE (pat) == SET
1158 && GET_CODE (SET_SRC (pat)) == IF_THEN_ELSE)
1159 {
1160 if (ARC_TARGET (arcptr) == ARC_SOURCE (arcptr) + 1)
1161 {
1162 /* A fall through arc should never have a
1163 branch insn. */
1164 abort ();
1165 }
1166 else
1167 {
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;
1171 }
1172 }
1173 }
1174
1175 if (prob == -1)
1176 num_never_executed++;
1177 else
1178 {
1179 int index = prob * 20 / REG_BR_PROB_BASE;
1180 if (index == 20)
1181 index = 19;
1182 hist_br_prob[index]++;
1183 }
1184 num_branches++;
1185
1186 REG_NOTES (arcptr->branch_insn)
1187 = gen_rtx_EXPR_LIST (REG_BR_PROB, GEN_INT (prob),
1188 REG_NOTES (arcptr->branch_insn));
1189 }
1190 }
1191
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')
1195 {
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)
1202 abort ();
1203 }
1204 else
1205 {
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;
1211 }
1212 }
1213
1214 /* This should never happen. */
1215 if (bad_counts)
1216 warning ("Arc profiling: some arc counts were bad.");
1217
1218 if (dump_file)
1219 {
1220 fprintf (dump_file, "%d branches\n", num_branches);
1221 fprintf (dump_file, "%d branches never executed\n",
1222 num_never_executed);
1223 if (num_branches)
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,
1227 5*i, 5*i+5);
1228
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];
1233 }
1234
1235}
1236
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. */
1243
1244static void
1245init_arc (arcptr, source, target, insn)
1246 struct adj_list *arcptr;
1247 int source, target;
1248 rtx insn;
1249{
1250 ARC_TARGET (arcptr) = target;
1251 ARC_SOURCE (arcptr) = source;
1252
1253 ARC_COUNT (arcptr) = 0;
1254 arcptr->count_valid = 0;
1255 arcptr->on_tree = 0;
1256 arcptr->fake = 0;
1257 arcptr->fall_through = 0;
1258 arcptr->branch_insn = insn;
1259
1260 arcptr->succ_next = bb_graph[source].succ;
1261 bb_graph[source].succ = arcptr;
1262 bb_graph[source].succ_count++;
1263
1264 arcptr->pred_next = bb_graph[target].pred;
1265 bb_graph[target].pred = arcptr;
1266 bb_graph[target].pred_count++;
1267}
1268
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. */
1274
1275static void
1276find_spanning_tree (num_blocks)
1277 int num_blocks;
1278{
1279 int i;
1280 struct adj_list *arcptr;
1281 struct bb_info *binfo = &bb_graph[0];
1282
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. */
1286
1287 for (arcptr = bb_graph[0].succ; arcptr; arcptr = arcptr->succ_next)
1288 if (arcptr->fake)
1289 {
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)
1293 abort();
1294 else
1295 {
1296 arcptr->on_tree = 1;
1297 bb_graph[ARC_TARGET (arcptr)].on_tree = 1;
1298 binfo->on_tree = 1;
1299 }
1300 }
1301
1302 binfo = &bb_graph[num_blocks-1];
1303 for (arcptr = binfo->pred; arcptr; arcptr = arcptr->pred_next)
1304 if (arcptr->fake)
1305 {
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)
1309 abort();
1310 else
1311 {
1312 arcptr->on_tree = 1;
1313 bb_graph[ARC_SOURCE (arcptr)].on_tree = 1;
1314 binfo->on_tree = 1;
1315 }
1316 }
1317 /* The only entrace to node zero is a fake arc. */
1318 bb_graph[0].pred->on_tree = 1;
1319
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++)
1325 {
1326 binfo = &bb_graph[i];
1327
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)
1334 {
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)
1339 {
1340 arcptr->on_tree = 1;
1341 bb_graph[ARC_TARGET (arcptr)].on_tree = 1;
1342 binfo->on_tree = 1;
1343 }
1344 }
1345 }
1346
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;
1351
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. */
1355
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)
1360 {
1361 fill_spanning_tree (i);
1362 break;
1363 }
1364}
1365
1366/* Add arcs reached from BLOCK to the spanning tree if they are needed and
1367 not already there. */
1368
1369static void
1370fill_spanning_tree (block)
1371 int block;
1372{
1373 struct adj_list *arcptr;
1374
1375 expand_spanning_tree (block);
1376
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)
1380 {
1381 arcptr->on_tree = 1;
1382 fill_spanning_tree (ARC_TARGET (arcptr));
1383 }
1384}
1385
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. */
1388
1389static void
1390expand_spanning_tree (block)
1391 int block;
1392{
1393 struct adj_list *arcptr;
1394
1395 bb_graph[block].on_tree = 1;
1396
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));
1400
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));
1405}
1406
1407/* Perform file-level initialization for branch-prob processing. */
1408
1409void
1410init_branch_prob (filename)
| 57/* One of these is dynamically created whenever we identify an arc in the
58 function. */
59
60struct adj_list
61{
62 int source;
63 int target;
64 int arc_count;
65 unsigned int count_valid : 1;
66 unsigned int on_tree : 1;
67 unsigned int fake : 1;
68 unsigned int fall_through : 1;
69 rtx branch_insn;
70 struct adj_list *pred_next;
71 struct adj_list *succ_next;
72};
73
74#define ARC_TARGET(ARCPTR) (ARCPTR->target)
75#define ARC_SOURCE(ARCPTR) (ARCPTR->source)
76#define ARC_COUNT(ARCPTR) (ARCPTR->arc_count)
77
78/* Count the number of basic blocks, and create an array of these structures,
79 one for each bb in the function. */
80
81struct bb_info
82{
83 struct adj_list *succ;
84 struct adj_list *pred;
85 int succ_count;
86 int pred_count;
87 int exec_count;
88 unsigned int count_valid : 1;
89 unsigned int on_tree : 1;
90 rtx first_insn;
91};
92
93/* Indexed by label number, gives the basic block number containing that
94 label. */
95
96static int *label_to_bb;
97
98/* Number of valid entries in the label_to_bb array. */
99
100static int label_to_bb_size;
101
102/* Indexed by block index, holds the basic block graph. */
103
104static struct bb_info *bb_graph;
105
106/* Name and file pointer of the output file for the basic block graph. */
107
108static char *bbg_file_name;
109static FILE *bbg_file;
110
111/* Name and file pointer of the input file for the arc count data. */
112
113static char *da_file_name;
114static FILE *da_file;
115
116/* Pointer of the output file for the basic block/line number map. */
117static FILE *bb_file;
118
119/* Last source file name written to bb_file. */
120
121static char *last_bb_file_name;
122
123/* Indicates whether the next line number note should be output to
124 bb_file or not. Used to eliminate a redundant note after an
125 expanded inline function call. */
126
127static int ignore_next_note;
128
129/* Used by final, for allocating the proper amount of storage for the
130 instrumented arc execution counts. */
131
132int count_instrumented_arcs;
133
134/* Number of executions for the return label. */
135
136int return_label_execution_count;
137
138/* Collect statistics on the performance of this pass for the entire source
139 file. */
140
141static int total_num_blocks;
142static int total_num_arcs;
143static int total_num_arcs_instrumented;
144static int total_num_blocks_created;
145static int total_num_passes;
146static int total_num_times_called;
147static int total_hist_br_prob[20];
148static int total_num_never_executed;
149static int total_num_branches;
150
151/* Forward declarations. */
152static void init_arc PROTO((struct adj_list *, int, int, rtx));
153static void find_spanning_tree PROTO((int));
154static void expand_spanning_tree PROTO((int));
155static void fill_spanning_tree PROTO((int));
156static void init_arc_profiler PROTO((void));
157static void output_arc_profiler PROTO((int, rtx));
158
159#ifndef LONG_TYPE_SIZE
160#define LONG_TYPE_SIZE BITS_PER_WORD
161#endif
162
163/* If non-zero, we need to output a constructor to set up the
164 per-object-file data. */
165static int need_func_profiler = 0;
166
167
168/* Add arc instrumentation code to the entire insn chain.
169
170 F is the first insn of the chain.
171 NUM_BLOCKS is the number of basic blocks found in F.
172 DUMP_FILE, if nonzero, is an rtl dump file we can write to. */
173
174static void
175instrument_arcs (f, num_blocks, dump_file)
176 rtx f;
177 int num_blocks;
178 FILE *dump_file;
179{
180 register int i;
181 register struct adj_list *arcptr, *backptr;
182 int num_arcs = 0;
183 int num_instr_arcs = 0;
184 rtx insn;
185
186 /* Instrument the program start. */
187 /* Handle block 0 specially, since it will always be instrumented,
188 but it doesn't have a valid first_insn or branch_insn. We must
189 put the instructions before the NOTE_INSN_FUNCTION_BEG note, so
190 that they don't clobber any of the parameters of the current
191 function. */
192 for (insn = f; insn; insn = NEXT_INSN (insn))
193 if (GET_CODE (insn) == NOTE
194 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
195 break;
196 insn = PREV_INSN (insn);
197 need_func_profiler = 1;
198 output_arc_profiler (total_num_arcs_instrumented + num_instr_arcs++, insn);
199
200 for (i = 1; i < num_blocks; i++)
201 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
202 if (! arcptr->on_tree)
203 {
204 if (dump_file)
205 fprintf (dump_file, "Arc %d to %d instrumented\n", i,
206 ARC_TARGET (arcptr));
207
208 /* Check to see if this arc is the only exit from its source block,
209 or the only entrance to its target block. In either case,
210 we don't need to create a new block to instrument the arc. */
211
212 if (bb_graph[i].succ == arcptr && arcptr->succ_next == 0)
213 {
214 /* Instrument the source block. */
215 output_arc_profiler (total_num_arcs_instrumented
216 + num_instr_arcs++,
217 PREV_INSN (bb_graph[i].first_insn));
218 }
219 else if (arcptr == bb_graph[ARC_TARGET (arcptr)].pred
220 && arcptr->pred_next == 0)
221 {
222 /* Instrument the target block. */
223 output_arc_profiler (total_num_arcs_instrumented
224 + num_instr_arcs++,
225 PREV_INSN (bb_graph[ARC_TARGET (arcptr)].first_insn));
226 }
227 else if (arcptr->fall_through)
228 {
229 /* This is a fall-through; put the instrumentation code after
230 the branch that ends this block. */
231
232 for (backptr = bb_graph[i].succ; backptr;
233 backptr = backptr->succ_next)
234 if (backptr != arcptr)
235 break;
236
237 output_arc_profiler (total_num_arcs_instrumented
238 + num_instr_arcs++,
239 backptr->branch_insn);
240 }
241 else
242 {
243 /* Must emit a new basic block to hold the arc counting code. */
244 enum rtx_code code = GET_CODE (PATTERN (arcptr->branch_insn));
245
246 if (code == SET)
247 {
248 /* Create the new basic block right after the branch.
249 Invert the branch so that it jumps past the end of the new
250 block. The new block will consist of the instrumentation
251 code, and a jump to the target of this arc. */
252 int this_is_simplejump = simplejump_p (arcptr->branch_insn);
253 rtx new_label = gen_label_rtx ();
254 rtx old_label, set_src;
255 rtx after = arcptr->branch_insn;
256
257 /* Simplejumps can't reach here. */
258 if (this_is_simplejump)
259 abort ();
260
261 /* We can't use JUMP_LABEL, because it won't be set if we
262 are compiling without optimization. */
263
264 set_src = SET_SRC (single_set (arcptr->branch_insn));
265 if (GET_CODE (set_src) == LABEL_REF)
266 old_label = set_src;
267 else if (GET_CODE (set_src) != IF_THEN_ELSE)
268 abort ();
269 else if (XEXP (set_src, 1) == pc_rtx)
270 old_label = XEXP (XEXP (set_src, 2), 0);
271 else
272 old_label = XEXP (XEXP (set_src, 1), 0);
273
274 /* Set the JUMP_LABEL so that redirect_jump will work. */
275 JUMP_LABEL (arcptr->branch_insn) = old_label;
276
277 /* Add a use for OLD_LABEL that will be needed when we emit
278 the JUMP_INSN below. If we don't do this here,
279 `invert_jump' might delete it for us. We must add two
280 when not optimizing, because the NUSES is zero now,
281 but must be at least two to prevent the label from being
282 deleted. */
283 LABEL_NUSES (old_label) += 2;
284
285 /* Emit the insns for the new block in reverse order,
286 since that is most convenient. */
287
288 if (this_is_simplejump)
289 {
290 after = NEXT_INSN (arcptr->branch_insn);
291 if (! redirect_jump (arcptr->branch_insn, new_label))
292 /* Don't know what to do if this branch won't
293 redirect. */
294 abort ();
295 }
296 else
297 {
298 if (! invert_jump (arcptr->branch_insn, new_label))
299 /* Don't know what to do if this branch won't invert. */
300 abort ();
301
302 emit_label_after (new_label, after);
303 LABEL_NUSES (new_label)++;
304 }
305 emit_barrier_after (after);
306 emit_jump_insn_after (gen_jump (old_label), after);
307 JUMP_LABEL (NEXT_INSN (after)) = old_label;
308
309 /* Instrument the source arc. */
310 output_arc_profiler (total_num_arcs_instrumented
311 + num_instr_arcs++,
312 after);
313 if (this_is_simplejump)
314 {
315 emit_label_after (new_label, after);
316 LABEL_NUSES (new_label)++;
317 }
318 }
319 else if (code == ADDR_VEC || code == ADDR_DIFF_VEC)
320 {
321 /* A table jump. Create a new basic block immediately
322 after the table, by emitting a barrier, a label, a
323 counting note, and a jump to the old label. Put the
324 new label in the table. */
325
326 rtx new_label = gen_label_rtx ();
327 rtx old_lref, new_lref;
328 int index;
329
330 /* Must determine the old_label reference, do this
331 by counting the arcs after this one, which will
332 give the index of our label in the table. */
333
334 index = 0;
335 for (backptr = arcptr->succ_next; backptr;
336 backptr = backptr->succ_next)
337 index++;
338
339 old_lref = XVECEXP (PATTERN (arcptr->branch_insn),
340 (code == ADDR_DIFF_VEC), index);
341
342 /* Emit the insns for the new block in reverse order,
343 since that is most convenient. */
344 emit_jump_insn_after (gen_jump (XEXP (old_lref, 0)),
345 arcptr->branch_insn);
346 JUMP_LABEL (NEXT_INSN (arcptr->branch_insn))
347 = XEXP (old_lref, 0);
348
349 /* Instrument the source arc. */
350 output_arc_profiler (total_num_arcs_instrumented
351 + num_instr_arcs++,
352 arcptr->branch_insn);
353
354 emit_label_after (new_label, arcptr->branch_insn);
355 LABEL_NUSES (NEXT_INSN (arcptr->branch_insn))++;
356 emit_barrier_after (arcptr->branch_insn);
357
358 /* Fix up the table jump. */
359 new_lref = gen_rtx_LABEL_REF (Pmode, new_label);
360 XVECEXP (PATTERN (arcptr->branch_insn),
361 (code == ADDR_DIFF_VEC), index) = new_lref;
362 }
363 else
364 abort ();
365
366 num_arcs += 1;
367 if (dump_file)
368 fprintf (dump_file,
369 "Arc %d to %d needed new basic block\n", i,
370 ARC_TARGET (arcptr));
371 }
372 }
373
374 total_num_arcs_instrumented += num_instr_arcs;
375 count_instrumented_arcs = total_num_arcs_instrumented;
376
377 total_num_blocks_created += num_arcs;
378 if (dump_file)
379 {
380 fprintf (dump_file, "%d arcs instrumented\n", num_instr_arcs);
381 fprintf (dump_file, "%d extra basic blocks created\n", num_arcs);
382 }
383}
384
385/* Output STRING to bb_file, surrounded by DELIMITER. */
386
387static void
388output_gcov_string (string, delimiter)
389 char *string;
390 long delimiter;
391{
392 long temp;
393
394 /* Write a delimiter to indicate that a file name follows. */
395 __write_long (delimiter, bb_file, 4);
396
397 /* Write the string. */
398 temp = strlen (string) + 1;
399 fwrite (string, temp, 1, bb_file);
400
401 /* Append a few zeros, to align the output to a 4 byte boundary. */
402 temp = temp & 0x3;
403 if (temp)
404 {
405 char c[4];
406
407 c[0] = c[1] = c[2] = c[3] = 0;
408 fwrite (c, sizeof (char), 4 - temp, bb_file);
409 }
410
411 /* Store another delimiter in the .bb file, just to make it easy to find the
412 end of the file name. */
413 __write_long (delimiter, bb_file, 4);
414}
415
416/* Return TRUE if this insn must be a tablejump entry insn. This works for
417 the MIPS port, but may give false negatives for some targets. */
418
419int
420tablejump_entry_p (insn, label)
421 rtx insn, label;
422{
423 rtx next = next_active_insn (insn);
424 enum rtx_code code = GET_CODE (PATTERN (next));
425
426 if (code != ADDR_DIFF_VEC && code != ADDR_VEC)
427 return 0;
428
429 if (PREV_INSN (next) == XEXP (label, 0))
430 return 1;
431
432 return 0;
433}
434
435/* Instrument and/or analyze program behavior based on program flow graph.
436 In either case, this function builds a flow graph for the function being
437 compiled. The flow graph is stored in BB_GRAPH.
438
439 When FLAG_PROFILE_ARCS is nonzero, this function instruments the arcs in
440 the flow graph that are needed to reconstruct the dynamic behavior of the
441 flow graph.
442
443 When FLAG_BRANCH_PROBABILITIES is nonzero, this function reads auxiliary
444 information from a data file containing arc count information from previous
445 executions of the function being compiled. In this case, the flow graph is
446 annotated with actual execution counts, which are later propagated into the
447 rtl for optimization purposes.
448
449 Main entry point of this file. */
450
451void
452branch_prob (f, dump_file)
453 rtx f;
454 FILE *dump_file;
455{
456 int i, num_blocks;
457 struct adj_list *arcptr;
458 int num_arcs, changes, passes;
459 int total, prob;
460 int hist_br_prob[20], num_never_executed, num_branches;
461 /* Set to non-zero if we got bad count information. */
462 int bad_counts = 0;
463
464 /* start of a function. */
465 if (flag_test_coverage)
466 output_gcov_string (current_function_name, (long) -2);
467
468 /* Execute this only if doing arc profiling or branch probabilities. */
469 if (! profile_arc_flag && ! flag_branch_probabilities
470 && ! flag_test_coverage)
471 abort ();
472
473 total_num_times_called++;
474
475 /* Create an array label_to_bb of ints of size max_label_num. */
476 label_to_bb_size = max_label_num ();
477 label_to_bb = (int *) oballoc (label_to_bb_size * sizeof (int));
478 bzero ((char *) label_to_bb, label_to_bb_size * sizeof (int));
479
480 /* Scan the insns in the function, count the number of basic blocks
481 present. When a code label is passed, set label_to_bb[label] = bb
482 number. */
483
484 /* The first block found will be block 1, so that function entry can be
485 block 0. */
486
487 {
488 register RTX_CODE prev_code = JUMP_INSN;
489 register RTX_CODE code;
490 register rtx insn;
491 register int i;
492 int block_separator_emitted = 0;
493
494 ignore_next_note = 0;
495
496 for (insn = NEXT_INSN (f), i = 0; insn; insn = NEXT_INSN (insn))
497 {
498 code = GET_CODE (insn);
499
500 if (code == BARRIER)
501 ;
502 else if (code == CODE_LABEL)
503 /* This label is part of the next block, but we can't increment
504 block number yet since there might be multiple labels. */
505 label_to_bb[CODE_LABEL_NUMBER (insn)] = i + 1;
506 /* We make NOTE_INSN_SETJMP notes into a block of their own, so that
507 they can be the target of the fake arc for the setjmp call.
508 This avoids creating cycles of fake arcs, which would happen if
509 the block after the setjmp call contained a call insn. */
510 else if ((prev_code == JUMP_INSN || prev_code == CALL_INSN
511 || prev_code == CODE_LABEL || prev_code == BARRIER)
512 && (GET_RTX_CLASS (code) == 'i'
513 || (code == NOTE
514 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)))
515 {
516 i += 1;
517
518 /* Emit the block separator if it hasn't already been emitted. */
519 if (flag_test_coverage && ! block_separator_emitted)
520 {
521 /* Output a zero to the .bb file to indicate that a new
522 block list is starting. */
523 __write_long (0, bb_file, 4);
524 }
525 block_separator_emitted = 0;
526 }
527 /* If flag_test_coverage is true, then we must add an entry to the
528 .bb file for every note. */
529 else if (code == NOTE && flag_test_coverage)
530 {
531 /* Must ignore the line number notes that immediately follow the
532 end of an inline function to avoid counting it twice. There
533 is a note before the call, and one after the call. */
534 if (NOTE_LINE_NUMBER (insn) == NOTE_REPEATED_LINE_NUMBER)
535 ignore_next_note = 1;
536 else if (NOTE_LINE_NUMBER (insn) > 0)
537 {
538 if (ignore_next_note)
539 ignore_next_note = 0;
540 else
541 {
542 /* Emit a block separator here to ensure that a NOTE
543 immediately following a JUMP_INSN or CALL_INSN will end
544 up in the right basic block list. */
545 if ((prev_code == JUMP_INSN || prev_code == CALL_INSN
546 || prev_code == CODE_LABEL || prev_code == BARRIER)
547 && ! block_separator_emitted)
548 {
549 /* Output a zero to the .bb file to indicate that
550 a new block list is starting. */
551 __write_long (0, bb_file, 4);
552
553 block_separator_emitted = 1;
554 }
555
556 /* If this is a new source file, then output the file's
557 name to the .bb file. */
558 if (! last_bb_file_name
559 || strcmp (NOTE_SOURCE_FILE (insn),
560 last_bb_file_name))
561 {
562 if (last_bb_file_name)
563 free (last_bb_file_name);
564 last_bb_file_name
565 = xmalloc (strlen (NOTE_SOURCE_FILE (insn)) + 1);
566 strcpy (last_bb_file_name, NOTE_SOURCE_FILE (insn));
567 output_gcov_string (NOTE_SOURCE_FILE (insn), (long)-1);
568 }
569
570 /* Output the line number to the .bb file. Must be done
571 after the output_bb_profile_data() call, and after the
572 file name is written, to ensure that it is correctly
573 handled by gcov. */
574 __write_long (NOTE_LINE_NUMBER (insn), bb_file, 4);
575 }
576 }
577 }
578
579 if (code != NOTE)
580 prev_code = code;
581 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)
582 prev_code = CALL_INSN;
583 }
584
585 /* Allocate last `normal' entry for bb_graph. */
586
587 /* The last insn was a jump, call, or label. In that case we have
588 a block at the end of the function with no insns. */
589 if (prev_code == JUMP_INSN || prev_code == CALL_INSN
590 || prev_code == CODE_LABEL || prev_code == BARRIER)
591 {
592 i++;
593
594 /* Emit the block separator if it hasn't already been emitted. */
595 if (flag_test_coverage && ! block_separator_emitted)
596 {
597 /* Output a zero to the .bb file to indicate that a new
598 block list is starting. */
599 __write_long (0, bb_file, 4);
600 }
601 }
602
603 /* Create another block to stand for EXIT, and make all return insns, and
604 the last basic block point here. Add one more to account for block
605 zero. */
606 num_blocks = i + 2;
607 }
608
609 total_num_blocks += num_blocks;
610 if (dump_file)
611 fprintf (dump_file, "%d basic blocks\n", num_blocks);
612
613 /* If we are only doing test coverage here, then return now. */
614 if (! profile_arc_flag && ! flag_branch_probabilities)
615 return;
616
617 /* Create and initialize the arrays that will hold bb_graph
618 and execution count info. */
619
620 bb_graph = (struct bb_info *) alloca (num_blocks * sizeof (struct bb_info));
621 bzero ((char *) bb_graph, (sizeof (struct bb_info) * num_blocks));
622
623 {
624 /* Scan the insns again:
625 - at the entry to each basic block, increment the predecessor count
626 (and successor of previous block) if it is a fall through entry,
627 create adj_list entries for this and the previous block
628 - at each jump insn, increment predecessor/successor counts for
629 target/source basic blocks, add this insn to pred/succ lists.
630
631 This also cannot be broken out as a separate subroutine
632 because it uses `alloca'. */
633
634 register RTX_CODE prev_code = JUMP_INSN;
635 register RTX_CODE code;
636 register rtx insn;
637 register int i;
638 int fall_through = 0;
639 struct adj_list *arcptr;
640 int dest = 0;
641
642 /* Block 0 always falls through to block 1. */
643 num_arcs = 0;
644 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
645 init_arc (arcptr, 0, 1, 0);
646 arcptr->fall_through = 1;
647 num_arcs++;
648
649 /* Add a fake fall through arc from the last block to block 0, to make the
650 graph complete. */
651 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
652 init_arc (arcptr, num_blocks - 1, 0, 0);
653 arcptr->fake = 1;
654 num_arcs++;
655
656 /* Exit must be one node of the graph, and all exits from the function
657 must point there. When see a return branch, must point the arc to the
658 exit node. */
659
660 /* Must start scan with second insn in function as above. */
661 for (insn = NEXT_INSN (f), i = 0; insn; insn = NEXT_INSN (insn))
662 {
663 code = GET_CODE (insn);
664
665 if (code == BARRIER)
666 fall_through = 0;
667 else if (code == CODE_LABEL)
668 ;
669 /* We make NOTE_INSN_SETJMP notes into a block of their own, so that
670 they can be the target of the fake arc for the setjmp call.
671 This avoids creating cycles of fake arcs, which would happen if
672 the block after the setjmp call ended with a call. */
673 else if ((prev_code == JUMP_INSN || prev_code == CALL_INSN
674 || prev_code == CODE_LABEL || prev_code == BARRIER)
675 && (GET_RTX_CLASS (code) == 'i'
676 || (code == NOTE
677 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)))
678 {
679 /* This is the first insn of the block. */
680 i += 1;
681 if (fall_through)
682 {
683 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
684 init_arc (arcptr, i - 1, i, 0);
685 arcptr->fall_through = 1;
686
687 num_arcs++;
688 }
689 fall_through = 1;
690 bb_graph[i].first_insn = insn;
691 }
692 else if (code == NOTE)
693 {;}
694
695 if (code == CALL_INSN)
696 {
697 /* In the normal case, the call returns, and this is just like
698 a branch fall through. */
699 fall_through = 1;
700
701 /* Setjmp may return more times than called, so to make the graph
702 solvable, add a fake arc from the function entrance to the
703 next block.
704
705 All other functions may return fewer times than called (if
706 a descendent call longjmp or exit), so to make the graph
707 solvable, add a fake arc to the function exit from the
708 current block.
709
710 Distinguish the cases by checking for a SETJUMP note.
711 A call_insn can be the last ins of a function, so must check
712 to see if next insn actually exists. */
713 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
714 if (NEXT_INSN (insn)
715 && GET_CODE (NEXT_INSN (insn)) == NOTE
716 && NOTE_LINE_NUMBER (NEXT_INSN (insn)) == NOTE_INSN_SETJMP)
717 init_arc (arcptr, 0, i+1, insn);
718 else
719 init_arc (arcptr, i, num_blocks-1, insn);
720 arcptr->fake = 1;
721 num_arcs++;
722 }
723 else if (code == JUMP_INSN)
724 {
725 rtx tem, pattern = PATTERN (insn);
726 rtx tablejump = 0;
727
728 /* If running without optimization, then jump label won't be valid,
729 so we must search for the destination label in that case.
730 We have to handle tablejumps and returns specially anyways, so
731 we don't check the JUMP_LABEL at all here. */
732
733 /* ??? This code should be rewritten. We need a more elegant way
734 to find the LABEL_REF. We need a more elegant way to
735 differentiate tablejump entries from computed gotos.
736 We should perhaps reuse code from flow to compute the CFG
737 instead of trying to compute it here.
738
739 We can't use current_function_has_computed_jump, because that
740 is calculated later by flow. We can't use computed_jump_p,
741 because that returns true for tablejump entry insns for some
742 targets, e.g. HPPA and MIPS. */
743
744 if (GET_CODE (pattern) == PARALLEL)
745 {
746 /* This assumes that PARALLEL jumps with a USE are
747 tablejump entry jumps. The same assumption can be found
748 in computed_jump_p. */
749 /* Make an arc from this jump to the label of the
750 jump table. This will instrument the number of
751 times the switch statement is executed. */
752 if (GET_CODE (XVECEXP (pattern, 0, 1)) == USE)
753 {
754 tem = XEXP (XVECEXP (pattern, 0, 1), 0);
755 if (GET_CODE (tem) != LABEL_REF)
756 abort ();
757 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (tem, 0))];
758 }
759 else if (GET_CODE (XVECEXP (pattern, 0, 0)) == SET
760 && SET_DEST (XVECEXP (pattern, 0, 0)) == pc_rtx)
761 {
762 tem = SET_SRC (XVECEXP (pattern, 0, 0));
763 if (GET_CODE (tem) == PLUS
764 && GET_CODE (XEXP (tem, 1)) == LABEL_REF)
765 {
766 tem = XEXP (tem, 1);
767 dest = label_to_bb [CODE_LABEL_NUMBER (XEXP (tem, 0))];
768 }
769 }
770 else
771 abort ();
772 }
773 else if (GET_CODE (pattern) == ADDR_VEC
774 || GET_CODE (pattern) == ADDR_DIFF_VEC)
775 tablejump = pattern;
776 else if (GET_CODE (pattern) == RETURN)
777 dest = num_blocks - 1;
778 else if (GET_CODE (pattern) != SET)
779 abort ();
780 else if ((tem = SET_SRC (pattern))
781 && GET_CODE (tem) == LABEL_REF)
782 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (tem, 0))];
783 /* Recognize HPPA table jump entry. This code is similar to
784 the code above in the PARALLEL case. */
785 else if (GET_CODE (tem) == PLUS
786 && GET_CODE (XEXP (tem, 0)) == MEM
787 && GET_CODE (XEXP (XEXP (tem, 0), 0)) == PLUS
788 && GET_CODE (XEXP (XEXP (XEXP (tem, 0), 0), 0)) == PC
789 && GET_CODE (XEXP (tem, 1)) == LABEL_REF
790 && tablejump_entry_p (insn, XEXP (tem, 1)))
791 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (XEXP (tem, 1), 0))];
792 /* Recognize the MIPS table jump entry. */
793 else if (GET_CODE (tem) == PLUS
794 && GET_CODE (XEXP (tem, 0)) == REG
795 && GET_CODE (XEXP (tem, 1)) == LABEL_REF
796 && tablejump_entry_p (insn, XEXP (tem, 1)))
797 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (XEXP (tem, 1), 0))];
798 else
799 {
800 rtx label_ref;
801
802 /* Must be an IF_THEN_ELSE branch. If it isn't, assume it
803 is a computed goto, which aren't supported yet. */
804 if (GET_CODE (tem) != IF_THEN_ELSE)
805 fatal ("-fprofile-arcs does not support computed gotos");
806 if (XEXP (tem, 1) != pc_rtx)
807 label_ref = XEXP (tem, 1);
808 else
809 label_ref = XEXP (tem, 2);
810 dest = label_to_bb[CODE_LABEL_NUMBER (XEXP (label_ref, 0))];
811 }
812
813 if (tablejump)
814 {
815 int diff_vec_p = GET_CODE (tablejump) == ADDR_DIFF_VEC;
816 int len = XVECLEN (tablejump, diff_vec_p);
817 int k;
818
819 for (k = 0; k < len; k++)
820 {
821 rtx tem = XEXP (XVECEXP (tablejump, diff_vec_p, k), 0);
822 dest = label_to_bb[CODE_LABEL_NUMBER (tem)];
823
824 arcptr = (struct adj_list *) alloca (sizeof(struct adj_list));
825 init_arc (arcptr, i, dest, insn);
826
827 num_arcs++;
828 }
829 }
830 else
831 {
832 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
833 init_arc (arcptr, i, dest, insn);
834
835 num_arcs++;
836 }
837
838 /* Determine whether or not this jump will fall through.
839 Unconditional jumps and returns are not always followed by
840 barriers. */
841 pattern = PATTERN (insn);
842 if (GET_CODE (pattern) == PARALLEL
843 || GET_CODE (pattern) == RETURN)
844 fall_through = 0;
845 else if (GET_CODE (pattern) == ADDR_VEC
846 || GET_CODE (pattern) == ADDR_DIFF_VEC)
847 /* These aren't actually jump insns, but they never fall
848 through, so... */
849 fall_through = 0;
850 else
851 {
852 if (GET_CODE (pattern) != SET || SET_DEST (pattern) != pc_rtx)
853 abort ();
854 if (GET_CODE (SET_SRC (pattern)) != IF_THEN_ELSE)
855 fall_through = 0;
856 }
857 }
858
859 if (code != NOTE)
860 prev_code = code;
861 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_SETJMP)
862 {
863 /* Make a fake insn to tag our notes on. */
864 bb_graph[i].first_insn = insn
865 = emit_insn_after (gen_rtx_USE (VOIDmode, stack_pointer_rtx),
866 insn);
867 prev_code = CALL_INSN;
868 }
869 }
870
871 /* If the code at the end of the function would give a new block, then
872 do the following. */
873
874 if (prev_code == JUMP_INSN || prev_code == CALL_INSN
875 || prev_code == CODE_LABEL || prev_code == BARRIER)
876 {
877 if (fall_through)
878 {
879 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
880 init_arc (arcptr, i, i + 1, 0);
881 arcptr->fall_through = 1;
882
883 num_arcs++;
884 }
885
886 /* This may not be a real insn, but that should not cause a problem. */
887 bb_graph[i+1].first_insn = get_last_insn ();
888 }
889
890 /* There is always a fake arc from the last block of the function
891 to the function exit block. */
892 arcptr = (struct adj_list *) alloca (sizeof (struct adj_list));
893 init_arc (arcptr, num_blocks-2, num_blocks-1, 0);
894 arcptr->fake = 1;
895 num_arcs++;
896 }
897
898 total_num_arcs += num_arcs;
899 if (dump_file)
900 fprintf (dump_file, "%d arcs\n", num_arcs);
901
902 /* Create spanning tree from basic block graph, mark each arc that is
903 on the spanning tree. */
904
905 /* To reduce the instrumentation cost, make two passes over the tree.
906 First, put as many must-split (crowded and fake) arcs on the tree as
907 possible, then on the second pass fill in the rest of the tree.
908 Note that the spanning tree is considered undirected, so that as many
909 must-split arcs as possible can be put on it.
910
911 Fallthrough arcs which are crowded should not be chosen on the first
912 pass, since they do not require creating a new basic block. These
913 arcs will have fall_through set. */
914
915 find_spanning_tree (num_blocks);
916
917 /* Create a .bbg file from which gcov can reconstruct the basic block
918 graph. First output the number of basic blocks, and then for every
919 arc output the source and target basic block numbers.
920 NOTE: The format of this file must be compatible with gcov. */
921
922 if (flag_test_coverage)
923 {
924 int flag_bits;
925
926 __write_long (num_blocks, bbg_file, 4);
927 __write_long (num_arcs, bbg_file, 4);
928
929 for (i = 0; i < num_blocks; i++)
930 {
931 long count = 0;
932 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
933 count++;
934 __write_long (count, bbg_file, 4);
935
936 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
937 {
938 flag_bits = 0;
939 if (arcptr->on_tree)
940 flag_bits |= 0x1;
941 if (arcptr->fake)
942 flag_bits |= 0x2;
943 if (arcptr->fall_through)
944 flag_bits |= 0x4;
945
946 __write_long (ARC_TARGET (arcptr), bbg_file, 4);
947 __write_long (flag_bits, bbg_file, 4);
948 }
949 }
950
951 /* Emit a -1 to separate the list of all arcs from the list of
952 loop back edges that follows. */
953 __write_long (-1, bbg_file, 4);
954 }
955
956 /* For each arc not on the spanning tree, add counting code as rtl. */
957
958 if (profile_arc_flag)
959 {
960 instrument_arcs (f, num_blocks, dump_file);
961 allocate_reg_info (max_reg_num (), FALSE, FALSE);
962 }
963
964 /* Execute the rest only if doing branch probabilities. */
965 if (! flag_branch_probabilities)
966 return;
967
968 /* For each arc not on the spanning tree, set its execution count from
969 the .da file. */
970
971 /* The first count in the .da file is the number of times that the function
972 was entered. This is the exec_count for block zero. */
973
974 num_arcs = 0;
975 for (i = 0; i < num_blocks; i++)
976 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
977 if (! arcptr->on_tree)
978 {
979 num_arcs++;
980 if (da_file)
981 {
982 long value;
983 __read_long (&value, da_file, 8);
984 ARC_COUNT (arcptr) = value;
985 }
986 else
987 ARC_COUNT (arcptr) = 0;
988 arcptr->count_valid = 1;
989 bb_graph[i].succ_count--;
990 bb_graph[ARC_TARGET (arcptr)].pred_count--;
991 }
992
993 if (dump_file)
994 fprintf (dump_file, "%d arc counts read\n", num_arcs);
995
996 /* For every block in the file,
997 - if every exit/entrance arc has a known count, then set the block count
998 - if the block count is known, and every exit/entrance arc but one has
999 a known execution count, then set the count of the remaining arc
1000
1001 As arc counts are set, decrement the succ/pred count, but don't delete
1002 the arc, that way we can easily tell when all arcs are known, or only
1003 one arc is unknown. */
1004
1005 /* The order that the basic blocks are iterated through is important.
1006 Since the code that finds spanning trees starts with block 0, low numbered
1007 arcs are put on the spanning tree in preference to high numbered arcs.
1008 Hence, most instrumented arcs are at the end. Graph solving works much
1009 faster if we propagate numbers from the end to the start.
1010
1011 This takes an average of slightly more than 3 passes. */
1012
1013 changes = 1;
1014 passes = 0;
1015 while (changes)
1016 {
1017 passes++;
1018 changes = 0;
1019
1020 for (i = num_blocks - 1; i >= 0; i--)
1021 {
1022 struct bb_info *binfo = &bb_graph[i];
1023 if (! binfo->count_valid)
1024 {
1025 if (binfo->succ_count == 0)
1026 {
1027 total = 0;
1028 for (arcptr = binfo->succ; arcptr;
1029 arcptr = arcptr->succ_next)
1030 total += ARC_COUNT (arcptr);
1031 binfo->exec_count = total;
1032 binfo->count_valid = 1;
1033 changes = 1;
1034 }
1035 else if (binfo->pred_count == 0)
1036 {
1037 total = 0;
1038 for (arcptr = binfo->pred; arcptr;
1039 arcptr = arcptr->pred_next)
1040 total += ARC_COUNT (arcptr);
1041 binfo->exec_count = total;
1042 binfo->count_valid = 1;
1043 changes = 1;
1044 }
1045 }
1046 if (binfo->count_valid)
1047 {
1048 if (binfo->succ_count == 1)
1049 {
1050 total = 0;
1051 /* One of the counts will be invalid, but it is zero,
1052 so adding it in also doesn't hurt. */
1053 for (arcptr = binfo->succ; arcptr;
1054 arcptr = arcptr->succ_next)
1055 total += ARC_COUNT (arcptr);
1056 /* Calculate count for remaining arc by conservation. */
1057 total = binfo->exec_count - total;
1058 /* Search for the invalid arc, and set its count. */
1059 for (arcptr = binfo->succ; arcptr;
1060 arcptr = arcptr->succ_next)
1061 if (! arcptr->count_valid)
1062 break;
1063 if (! arcptr)
1064 abort ();
1065 arcptr->count_valid = 1;
1066 ARC_COUNT (arcptr) = total;
1067 binfo->succ_count--;
1068
1069 bb_graph[ARC_TARGET (arcptr)].pred_count--;
1070 changes = 1;
1071 }
1072 if (binfo->pred_count == 1)
1073 {
1074 total = 0;
1075 /* One of the counts will be invalid, but it is zero,
1076 so adding it in also doesn't hurt. */
1077 for (arcptr = binfo->pred; arcptr;
1078 arcptr = arcptr->pred_next)
1079 total += ARC_COUNT (arcptr);
1080 /* Calculate count for remaining arc by conservation. */
1081 total = binfo->exec_count - total;
1082 /* Search for the invalid arc, and set its count. */
1083 for (arcptr = binfo->pred; arcptr;
1084 arcptr = arcptr->pred_next)
1085 if (! arcptr->count_valid)
1086 break;
1087 if (! arcptr)
1088 abort ();
1089 arcptr->count_valid = 1;
1090 ARC_COUNT (arcptr) = total;
1091 binfo->pred_count--;
1092
1093 bb_graph[ARC_SOURCE (arcptr)].succ_count--;
1094 changes = 1;
1095 }
1096 }
1097 }
1098 }
1099
1100 total_num_passes += passes;
1101 if (dump_file)
1102 fprintf (dump_file, "Graph solving took %d passes.\n\n", passes);
1103
1104 /* If the graph has been correctly solved, every block will have a
1105 succ and pred count of zero. */
1106 for (i = 0; i < num_blocks; i++)
1107 {
1108 struct bb_info *binfo = &bb_graph[i];
1109 if (binfo->succ_count || binfo->pred_count)
1110 abort ();
1111 }
1112
1113 /* For every arc, calculate its branch probability and add a reg_note
1114 to the branch insn to indicate this. */
1115
1116 for (i = 0; i < 20; i++)
1117 hist_br_prob[i] = 0;
1118 num_never_executed = 0;
1119 num_branches = 0;
1120
1121 for (i = 0; i < num_blocks; i++)
1122 {
1123 struct bb_info *binfo = &bb_graph[i];
1124
1125 total = binfo->exec_count;
1126 for (arcptr = binfo->succ; arcptr; arcptr = arcptr->succ_next)
1127 {
1128 if (arcptr->branch_insn)
1129 {
1130 /* This calculates the branch probability as an integer between
1131 0 and REG_BR_PROB_BASE, properly rounded to the nearest
1132 integer. Perform the arithmetic in double to avoid
1133 overflowing the range of ints. */
1134
1135 if (total == 0)
1136 prob = -1;
1137 else
1138 {
1139 rtx pat = PATTERN (arcptr->branch_insn);
1140
1141 prob = (((double)ARC_COUNT (arcptr) * REG_BR_PROB_BASE)
1142 + (total >> 1)) / total;
1143 if (prob < 0 || prob > REG_BR_PROB_BASE)
1144 {
1145 if (dump_file)
1146 fprintf (dump_file, "bad count: prob for %d-%d thought to be %d (forcibly normalized)\n",
1147 ARC_SOURCE (arcptr), ARC_TARGET (arcptr),
1148 prob);
1149
1150 bad_counts = 1;
1151 prob = REG_BR_PROB_BASE / 2;
1152 }
1153
1154 /* Match up probability with JUMP pattern. */
1155
1156 if (GET_CODE (pat) == SET
1157 && GET_CODE (SET_SRC (pat)) == IF_THEN_ELSE)
1158 {
1159 if (ARC_TARGET (arcptr) == ARC_SOURCE (arcptr) + 1)
1160 {
1161 /* A fall through arc should never have a
1162 branch insn. */
1163 abort ();
1164 }
1165 else
1166 {
1167 /* This is the arc for the taken branch. */
1168 if (GET_CODE (XEXP (SET_SRC (pat), 2)) != PC)
1169 prob = REG_BR_PROB_BASE - prob;
1170 }
1171 }
1172 }
1173
1174 if (prob == -1)
1175 num_never_executed++;
1176 else
1177 {
1178 int index = prob * 20 / REG_BR_PROB_BASE;
1179 if (index == 20)
1180 index = 19;
1181 hist_br_prob[index]++;
1182 }
1183 num_branches++;
1184
1185 REG_NOTES (arcptr->branch_insn)
1186 = gen_rtx_EXPR_LIST (REG_BR_PROB, GEN_INT (prob),
1187 REG_NOTES (arcptr->branch_insn));
1188 }
1189 }
1190
1191 /* Add a REG_EXEC_COUNT note to the first instruction of this block. */
1192 if (! binfo->first_insn
1193 || GET_RTX_CLASS (GET_CODE (binfo->first_insn)) != 'i')
1194 {
1195 /* Block 0 is a fake block representing function entry, and does
1196 not have a real first insn. The second last block might not
1197 begin with a real insn. */
1198 if (i == num_blocks - 1)
1199 return_label_execution_count = total;
1200 else if (i != 0 && i != num_blocks - 2)
1201 abort ();
1202 }
1203 else
1204 {
1205 REG_NOTES (binfo->first_insn)
1206 = gen_rtx_EXPR_LIST (REG_EXEC_COUNT, GEN_INT (total),
1207 REG_NOTES (binfo->first_insn));
1208 if (i == num_blocks - 1)
1209 return_label_execution_count = total;
1210 }
1211 }
1212
1213 /* This should never happen. */
1214 if (bad_counts)
1215 warning ("Arc profiling: some arc counts were bad.");
1216
1217 if (dump_file)
1218 {
1219 fprintf (dump_file, "%d branches\n", num_branches);
1220 fprintf (dump_file, "%d branches never executed\n",
1221 num_never_executed);
1222 if (num_branches)
1223 for (i = 0; i < 10; i++)
1224 fprintf (dump_file, "%d%% branches in range %d-%d%%\n",
1225 (hist_br_prob[i]+hist_br_prob[19-i])*100/num_branches,
1226 5*i, 5*i+5);
1227
1228 total_num_branches += num_branches;
1229 total_num_never_executed += num_never_executed;
1230 for (i = 0; i < 20; i++)
1231 total_hist_br_prob[i] += hist_br_prob[i];
1232 }
1233
1234}
1235
1236/* Initialize a new arc.
1237 ARCPTR is the empty adj_list this function fills in.
1238 SOURCE is the block number of the source block.
1239 TARGET is the block number of the target block.
1240 INSN is the insn which transfers control from SOURCE to TARGET,
1241 or zero if the transfer is implicit. */
1242
1243static void
1244init_arc (arcptr, source, target, insn)
1245 struct adj_list *arcptr;
1246 int source, target;
1247 rtx insn;
1248{
1249 ARC_TARGET (arcptr) = target;
1250 ARC_SOURCE (arcptr) = source;
1251
1252 ARC_COUNT (arcptr) = 0;
1253 arcptr->count_valid = 0;
1254 arcptr->on_tree = 0;
1255 arcptr->fake = 0;
1256 arcptr->fall_through = 0;
1257 arcptr->branch_insn = insn;
1258
1259 arcptr->succ_next = bb_graph[source].succ;
1260 bb_graph[source].succ = arcptr;
1261 bb_graph[source].succ_count++;
1262
1263 arcptr->pred_next = bb_graph[target].pred;
1264 bb_graph[target].pred = arcptr;
1265 bb_graph[target].pred_count++;
1266}
1267
1268/* This function searches all of the arcs in the program flow graph, and puts
1269 as many bad arcs as possible onto the spanning tree. Bad arcs include
1270 fake arcs (needed for setjmp(), longjmp(), exit()) which MUST be on the
1271 spanning tree as they can't be instrumented. Also, arcs which must be
1272 split when instrumented should be part of the spanning tree if possible. */
1273
1274static void
1275find_spanning_tree (num_blocks)
1276 int num_blocks;
1277{
1278 int i;
1279 struct adj_list *arcptr;
1280 struct bb_info *binfo = &bb_graph[0];
1281
1282 /* Fake arcs must be part of the spanning tree, and are always safe to put
1283 on the spanning tree. Fake arcs will either be a successor of node 0,
1284 a predecessor of the last node, or from the last node to node 0. */
1285
1286 for (arcptr = bb_graph[0].succ; arcptr; arcptr = arcptr->succ_next)
1287 if (arcptr->fake)
1288 {
1289 /* Adding this arc should never cause a cycle. This is a fatal
1290 error if it would. */
1291 if (bb_graph[ARC_TARGET (arcptr)].on_tree && binfo->on_tree)
1292 abort();
1293 else
1294 {
1295 arcptr->on_tree = 1;
1296 bb_graph[ARC_TARGET (arcptr)].on_tree = 1;
1297 binfo->on_tree = 1;
1298 }
1299 }
1300
1301 binfo = &bb_graph[num_blocks-1];
1302 for (arcptr = binfo->pred; arcptr; arcptr = arcptr->pred_next)
1303 if (arcptr->fake)
1304 {
1305 /* Adding this arc should never cause a cycle. This is a fatal
1306 error if it would. */
1307 if (bb_graph[ARC_SOURCE (arcptr)].on_tree && binfo->on_tree)
1308 abort();
1309 else
1310 {
1311 arcptr->on_tree = 1;
1312 bb_graph[ARC_SOURCE (arcptr)].on_tree = 1;
1313 binfo->on_tree = 1;
1314 }
1315 }
1316 /* The only entrace to node zero is a fake arc. */
1317 bb_graph[0].pred->on_tree = 1;
1318
1319 /* Arcs which are crowded at both the source and target should be put on
1320 the spanning tree if possible, except for fall_throuch arcs which never
1321 require adding a new block even if crowded, add arcs with the same source
1322 and dest which must always be instrumented. */
1323 for (i = 0; i < num_blocks; i++)
1324 {
1325 binfo = &bb_graph[i];
1326
1327 for (arcptr = binfo->succ; arcptr; arcptr = arcptr->succ_next)
1328 if (! ((binfo->succ == arcptr && arcptr->succ_next == 0)
1329 || (bb_graph[ARC_TARGET (arcptr)].pred
1330 && arcptr->pred_next == 0))
1331 && ! arcptr->fall_through
1332 && ARC_TARGET (arcptr) != i)
1333 {
1334 /* This is a crowded arc at both source and target. Try to put
1335 in on the spanning tree. Can do this if either the source or
1336 target block is not yet on the tree. */
1337 if (! bb_graph[ARC_TARGET (arcptr)].on_tree || ! binfo->on_tree)
1338 {
1339 arcptr->on_tree = 1;
1340 bb_graph[ARC_TARGET (arcptr)].on_tree = 1;
1341 binfo->on_tree = 1;
1342 }
1343 }
1344 }
1345
1346 /* Clear all of the basic block on_tree bits, so that we can use them to
1347 create the spanning tree. */
1348 for (i = 0; i < num_blocks; i++)
1349 bb_graph[i].on_tree = 0;
1350
1351 /* Now fill in the spanning tree until every basic block is on it.
1352 Don't put the 0 to 1 fall through arc on the tree, since it is
1353 always cheap to instrument, so start filling the tree from node 1. */
1354
1355 for (i = 1; i < num_blocks; i++)
1356 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
1357 if (! arcptr->on_tree
1358 && ! bb_graph[ARC_TARGET (arcptr)].on_tree)
1359 {
1360 fill_spanning_tree (i);
1361 break;
1362 }
1363}
1364
1365/* Add arcs reached from BLOCK to the spanning tree if they are needed and
1366 not already there. */
1367
1368static void
1369fill_spanning_tree (block)
1370 int block;
1371{
1372 struct adj_list *arcptr;
1373
1374 expand_spanning_tree (block);
1375
1376 for (arcptr = bb_graph[block].succ; arcptr; arcptr = arcptr->succ_next)
1377 if (! arcptr->on_tree
1378 && ! bb_graph[ARC_TARGET (arcptr)].on_tree)
1379 {
1380 arcptr->on_tree = 1;
1381 fill_spanning_tree (ARC_TARGET (arcptr));
1382 }
1383}
1384
1385/* When first visit a block, must add all blocks that are already connected
1386 to this block via tree arcs to the spanning tree. */
1387
1388static void
1389expand_spanning_tree (block)
1390 int block;
1391{
1392 struct adj_list *arcptr;
1393
1394 bb_graph[block].on_tree = 1;
1395
1396 for (arcptr = bb_graph[block].succ; arcptr; arcptr = arcptr->succ_next)
1397 if (arcptr->on_tree && ! bb_graph[ARC_TARGET (arcptr)].on_tree)
1398 expand_spanning_tree (ARC_TARGET (arcptr));
1399
1400 for (arcptr = bb_graph[block].pred;
1401 arcptr; arcptr = arcptr->pred_next)
1402 if (arcptr->on_tree && ! bb_graph[ARC_SOURCE (arcptr)].on_tree)
1403 expand_spanning_tree (ARC_SOURCE (arcptr));
1404}
1405
1406/* Perform file-level initialization for branch-prob processing. */
1407
1408void
1409init_branch_prob (filename)
|
1412{
1413 long len;
1414 int i;
1415
1416 if (flag_test_coverage)
1417 {
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);
1426
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);
1435
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;
1439 }
1440
1441 if (flag_branch_probabilities)
1442 {
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.",
1450 da_file_name);
1451
1452 /* The first word in the .da file gives the number of instrumented arcs,
1453 which is not needed for our purposes. */
1454
1455 if (da_file)
1456 __read_long (&len, da_file, 8);
1457 }
1458
1459 if (profile_arc_flag)
1460 init_arc_profiler ();
1461
1462 total_num_blocks = 0;
1463 total_num_arcs = 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;
1472}
1473
1474/* Performs file-level cleanup after branch-prob processing
1475 is completed. */
1476
1477void
1478end_branch_prob (dump_file)
1479 FILE *dump_file;
1480{
1481 if (flag_test_coverage)
1482 {
1483 fclose (bb_file);
1484 fclose (bbg_file);
1485 }
1486
1487 if (flag_branch_probabilities)
1488 {
1489 if (da_file)
1490 {
1491 long temp;
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. */
1495 if (feof (da_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");
1500 fclose (da_file);
1501 }
1502 }
1503
1504 if (dump_file)
1505 {
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",
1514 total_num_passes);
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)
1523 {
1524 int i;
1525
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);
1530 }
1531 }
1532}
1533
1534/* The label used by the arc profiling code. */
1535
1536static rtx profiler_label;
1537
1538/* Initialize the profiler_label. */
1539
1540static void
1541init_arc_profiler ()
1542{
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);
1547}
1548
1549/* Output instructions as RTL to increment the arc execution count. */
1550
1551static void
1552output_arc_profiler (arcno, insert_after)
1553 int arcno;
1554 rtx insert_after;
1555{
1556 rtx profiler_target_addr
1557 = (arcno
1558 ? gen_rtx_CONST (Pmode,
1559 gen_rtx_PLUS (Pmode, profiler_label,
1560 GEN_INT (LONG_TYPE_SIZE / BITS_PER_UNIT * arcno)))
1561 : profiler_label);
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;
1566 rtx sequence;
1567
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.
1575
1576 ??? The code here performs the same tests that reload does so hopefully
1577 all the bases are covered. */
1578
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)))
1584 {
1585 rtx return_reg;
1586 rtx next_insert_after = next_nonnote_insn (insert_after);
1587
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);
1594
1595 if (next_insert_after
1596 && GET_CODE (next_insert_after) == INSN)
1597 {
1598 if (GET_CODE (PATTERN (insert_after)) == SET)
1599 return_reg = SET_DEST (PATTERN (insert_after));
1600 else
1601 return_reg = SET_DEST (XVECEXP (PATTERN (insert_after), 0, 0));
1602
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;
1610 }
1611 }
1612
1613 start_sequence ();
1614
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);
1618
1619 add_ref = gen_rtx_PLUS (mode, profiler_reg, GEN_INT (1));
1620 emit_move_insn (profiler_reg, add_ref);
1621
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);
1625
1626 sequence = gen_sequence ();
1627 end_sequence ();
1628 emit_insn_after (sequence, insert_after);
1629}
1630
1631/* Output code for a constructor that will invoke __bb_init_func, if
1632 this has not already been done. */
1633
1634void
1635output_func_start_profiler ()
1636{
1637 tree fnname, fndecl;
1638 char *name, *cfnname;
1639 rtx table_address;
1640 enum machine_mode mode = mode_for_size (LONG_TYPE_SIZE, MODE_INT, 0);
1641 int save_flag_inline_functions = flag_inline_functions;
1642
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)
1646 return;
1647
1648 need_func_profiler = 0;
1649
1650 /* Synthesize a constructor function to invoke __bb_init_func with a
1651 pointer to this object file's profile block. */
1652 start_sequence ();
1653
1654 /* Try and make a unique name given the "file function name".
1655
1656 And no, I don't like this either. */
1657
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);
1663 free (name);
1664
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);
| 1411{
1412 long len;
1413 int i;
1414
1415 if (flag_test_coverage)
1416 {
1417 /* Open an output file for the basic block/line number map. */
1418 int len = strlen (filename);
1419 char *data_file = (char *) alloca (len + 4);
1420 strcpy (data_file, filename);
1421 strip_off_ending (data_file, len);
1422 strcat (data_file, ".bb");
1423 if ((bb_file = fopen (data_file, "w")) == 0)
1424 pfatal_with_name (data_file);
1425
1426 /* Open an output file for the program flow graph. */
1427 len = strlen (filename);
1428 bbg_file_name = (char *) alloca (len + 5);
1429 strcpy (bbg_file_name, filename);
1430 strip_off_ending (bbg_file_name, len);
1431 strcat (bbg_file_name, ".bbg");
1432 if ((bbg_file = fopen (bbg_file_name, "w")) == 0)
1433 pfatal_with_name (bbg_file_name);
1434
1435 /* Initialize to zero, to ensure that the first file name will be
1436 written to the .bb file. */
1437 last_bb_file_name = 0;
1438 }
1439
1440 if (flag_branch_probabilities)
1441 {
1442 len = strlen (filename);
1443 da_file_name = (char *) alloca (len + 4);
1444 strcpy (da_file_name, filename);
1445 strip_off_ending (da_file_name, len);
1446 strcat (da_file_name, ".da");
1447 if ((da_file = fopen (da_file_name, "r")) == 0)
1448 warning ("file %s not found, execution counts assumed to be zero.",
1449 da_file_name);
1450
1451 /* The first word in the .da file gives the number of instrumented arcs,
1452 which is not needed for our purposes. */
1453
1454 if (da_file)
1455 __read_long (&len, da_file, 8);
1456 }
1457
1458 if (profile_arc_flag)
1459 init_arc_profiler ();
1460
1461 total_num_blocks = 0;
1462 total_num_arcs = 0;
1463 total_num_arcs_instrumented = 0;
1464 total_num_blocks_created = 0;
1465 total_num_passes = 0;
1466 total_num_times_called = 0;
1467 total_num_branches = 0;
1468 total_num_never_executed = 0;
1469 for (i = 0; i < 20; i++)
1470 total_hist_br_prob[i] = 0;
1471}
1472
1473/* Performs file-level cleanup after branch-prob processing
1474 is completed. */
1475
1476void
1477end_branch_prob (dump_file)
1478 FILE *dump_file;
1479{
1480 if (flag_test_coverage)
1481 {
1482 fclose (bb_file);
1483 fclose (bbg_file);
1484 }
1485
1486 if (flag_branch_probabilities)
1487 {
1488 if (da_file)
1489 {
1490 long temp;
1491 /* This seems slightly dangerous, as it presumes the EOF
1492 flag will not be set until an attempt is made to read
1493 past the end of the file. */
1494 if (feof (da_file))
1495 warning (".da file contents exhausted too early\n");
1496 /* Should be at end of file now. */
1497 if (__read_long (&temp, da_file, 8) == 0)
1498 warning (".da file contents not exhausted\n");
1499 fclose (da_file);
1500 }
1501 }
1502
1503 if (dump_file)
1504 {
1505 fprintf (dump_file, "\n");
1506 fprintf (dump_file, "Total number of blocks: %d\n", total_num_blocks);
1507 fprintf (dump_file, "Total number of arcs: %d\n", total_num_arcs);
1508 fprintf (dump_file, "Total number of instrumented arcs: %d\n",
1509 total_num_arcs_instrumented);
1510 fprintf (dump_file, "Total number of blocks created: %d\n",
1511 total_num_blocks_created);
1512 fprintf (dump_file, "Total number of graph solution passes: %d\n",
1513 total_num_passes);
1514 if (total_num_times_called != 0)
1515 fprintf (dump_file, "Average number of graph solution passes: %d\n",
1516 (total_num_passes + (total_num_times_called >> 1))
1517 / total_num_times_called);
1518 fprintf (dump_file, "Total number of branches: %d\n", total_num_branches);
1519 fprintf (dump_file, "Total number of branches never executed: %d\n",
1520 total_num_never_executed);
1521 if (total_num_branches)
1522 {
1523 int i;
1524
1525 for (i = 0; i < 10; i++)
1526 fprintf (dump_file, "%d%% branches in range %d-%d%%\n",
1527 (total_hist_br_prob[i] + total_hist_br_prob[19-i]) * 100
1528 / total_num_branches, 5*i, 5*i+5);
1529 }
1530 }
1531}
1532
1533/* The label used by the arc profiling code. */
1534
1535static rtx profiler_label;
1536
1537/* Initialize the profiler_label. */
1538
1539static void
1540init_arc_profiler ()
1541{
1542 /* Generate and save a copy of this so it can be shared. */
1543 char *name = xmalloc (20);
1544 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
1545 profiler_label = gen_rtx_SYMBOL_REF (Pmode, name);
1546}
1547
1548/* Output instructions as RTL to increment the arc execution count. */
1549
1550static void
1551output_arc_profiler (arcno, insert_after)
1552 int arcno;
1553 rtx insert_after;
1554{
1555 rtx profiler_target_addr
1556 = (arcno
1557 ? gen_rtx_CONST (Pmode,
1558 gen_rtx_PLUS (Pmode, profiler_label,
1559 GEN_INT (LONG_TYPE_SIZE / BITS_PER_UNIT * arcno)))
1560 : profiler_label);
1561 enum machine_mode mode = mode_for_size (LONG_TYPE_SIZE, MODE_INT, 0);
1562 rtx profiler_reg = gen_reg_rtx (mode);
1563 rtx address_reg = gen_reg_rtx (Pmode);
1564 rtx mem_ref, add_ref;
1565 rtx sequence;
1566
1567 /* In this case, reload can use explicitly mentioned hard registers for
1568 reloads. It is not safe to output profiling code between a call
1569 and the instruction that copies the result to a pseudo-reg. This
1570 is because reload may allocate one of the profiling code pseudo-regs
1571 to the return value reg, thus clobbering the return value. So we
1572 must check for calls here, and emit the profiling code after the
1573 instruction that uses the return value, if any.
1574
1575 ??? The code here performs the same tests that reload does so hopefully
1576 all the bases are covered. */
1577
1578 if (SMALL_REGISTER_CLASSES
1579 && GET_CODE (insert_after) == CALL_INSN
1580 && (GET_CODE (PATTERN (insert_after)) == SET
1581 || (GET_CODE (PATTERN (insert_after)) == PARALLEL
1582 && GET_CODE (XVECEXP (PATTERN (insert_after), 0, 0)) == SET)))
1583 {
1584 rtx return_reg;
1585 rtx next_insert_after = next_nonnote_insn (insert_after);
1586
1587 /* The first insn after the call may be a stack pop, skip it. */
1588 if (next_insert_after
1589 && GET_CODE (next_insert_after) == INSN
1590 && GET_CODE (PATTERN (next_insert_after)) == SET
1591 && SET_DEST (PATTERN (next_insert_after)) == stack_pointer_rtx)
1592 next_insert_after = next_nonnote_insn (next_insert_after);
1593
1594 if (next_insert_after
1595 && GET_CODE (next_insert_after) == INSN)
1596 {
1597 if (GET_CODE (PATTERN (insert_after)) == SET)
1598 return_reg = SET_DEST (PATTERN (insert_after));
1599 else
1600 return_reg = SET_DEST (XVECEXP (PATTERN (insert_after), 0, 0));
1601
1602 /* Now, NEXT_INSERT_AFTER may be an instruction that uses the
1603 return value. However, it could also be something else,
1604 like a CODE_LABEL, so check that the code is INSN. */
1605 if (next_insert_after != 0
1606 && GET_RTX_CLASS (GET_CODE (next_insert_after)) == 'i'
1607 && reg_referenced_p (return_reg, PATTERN (next_insert_after)))
1608 insert_after = next_insert_after;
1609 }
1610 }
1611
1612 start_sequence ();
1613
1614 emit_move_insn (address_reg, profiler_target_addr);
1615 mem_ref = gen_rtx_MEM (mode, address_reg);
1616 emit_move_insn (profiler_reg, mem_ref);
1617
1618 add_ref = gen_rtx_PLUS (mode, profiler_reg, GEN_INT (1));
1619 emit_move_insn (profiler_reg, add_ref);
1620
1621 /* This is the same rtx as above, but it is not legal to share this rtx. */
1622 mem_ref = gen_rtx_MEM (mode, address_reg);
1623 emit_move_insn (mem_ref, profiler_reg);
1624
1625 sequence = gen_sequence ();
1626 end_sequence ();
1627 emit_insn_after (sequence, insert_after);
1628}
1629
1630/* Output code for a constructor that will invoke __bb_init_func, if
1631 this has not already been done. */
1632
1633void
1634output_func_start_profiler ()
1635{
1636 tree fnname, fndecl;
1637 char *name, *cfnname;
1638 rtx table_address;
1639 enum machine_mode mode = mode_for_size (LONG_TYPE_SIZE, MODE_INT, 0);
1640 int save_flag_inline_functions = flag_inline_functions;
1641
1642 /* It's either already been output, or we don't need it because we're
1643 not doing profile-arcs. */
1644 if (! need_func_profiler)
1645 return;
1646
1647 need_func_profiler = 0;
1648
1649 /* Synthesize a constructor function to invoke __bb_init_func with a
1650 pointer to this object file's profile block. */
1651 start_sequence ();
1652
1653 /* Try and make a unique name given the "file function name".
1654
1655 And no, I don't like this either. */
1656
1657 fnname = get_file_function_name ('I');
1658 cfnname = IDENTIFIER_POINTER (fnname);
1659 name = xmalloc (strlen (cfnname) + 5);
1660 sprintf (name, "%sGCOV",cfnname);
1661 fnname = get_identifier (name);
1662 free (name);
1663
1664 fndecl = build_decl (FUNCTION_DECL, fnname,
1665 build_function_type (void_type_node, NULL_TREE));
1666 DECL_EXTERNAL (fndecl) = 0;
1667 TREE_PUBLIC (fndecl) = 1;
1668 DECL_ASSEMBLER_NAME (fndecl) = fnname;
1669 DECL_RESULT (fndecl) = build_decl (RESULT_DECL, NULL_TREE, void_type_node);
|