1 /* bb_exit_func.c - dumps all the basic-block statistics linked into
2 the bb_head chain to .d files.
4 Copyright 2000, 2001 Free Software Foundation, Inc.
6 This file is part of GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
23 This code was contributed by:
25 David Mosberger-Tang <David.Mosberger@acm.org> */
32 /* structure emitted by -a */
40 const unsigned long *addresses
;
43 struct bb
*__bb_head
= (struct bb
*) 0;
49 const int version
= GMON_VERSION
;
53 /* GEN_GMON_CNT_FILE should be defined on systems with mcleanup()
54 functions that do not write basic-block to gmon.out. In such
55 cases profiling with "-pg -a" would result in a gmon.out file
56 without basic-block info (because the file written here would be
57 overwritten. Thus, a separate file is generated instead. The
58 two files can easily be combined by specifying them on gprof's
59 command line (and possibly generating a gmon.sum file with "gprof
61 #ifndef GEN_GMON_CNT_FILE
62 # define OUT_NAME "gmon.out"
64 # define OUT_NAME "gmon.cnt"
66 fp
= fopen (OUT_NAME
, "wb");
72 memcpy (&ghdr
.cookie
[0], GMON_MAGIC
, 4);
73 memcpy (&ghdr
.version
, &version
, sizeof (version
));
74 fwrite (&ghdr
, sizeof (ghdr
), 1, fp
);
76 for (ptr
= __bb_head
; ptr
!= 0; ptr
= ptr
->next
)
78 u_int ncounts
= ptr
->ncounts
;
82 tag
= GMON_TAG_BB_COUNT
;
83 fwrite (&tag
, sizeof (tag
), 1, fp
);
84 fwrite (&ncounts
, sizeof (ncounts
), 1, fp
);
86 for (i
= 0; i
< ncounts
; ++i
)
88 fwrite (&ptr
->addresses
[i
], sizeof (ptr
->addresses
[0]), 1, fp
);
89 fwrite (&ptr
->counts
[i
], sizeof (ptr
->counts
[0]), 1, fp
);