1
/* call_graph.c - Create call graphs.
3
Copyright 2000, 2001, 2002 Free Software Foundation, Inc.
5
This file is part of GNU Binutils.
7
This program is free software; you can redistribute it and/or modify
8
it under the terms of the GNU General Public License as published by
9
the Free Software Foundation; either version 2 of the License, or
10
(at your option) any later version.
12
This program is distributed in the hope that it will be useful,
13
but WITHOUT ANY WARRANTY; without even the implied warranty of
14
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15
GNU General Public License for more details.
17
You should have received a copy of the GNU General Public License
18
along with this program; if not, write to the Free Software
19
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
23
#include "search_list.h"
27
#include "call_graph.h"
34
cg_tally (from_pc, self_pc, count)
42
parent = sym_lookup (&symtab, from_pc);
43
child = sym_lookup (&symtab, self_pc);
45
if (child == NULL || parent == NULL)
48
/* If we're doing line-by-line profiling, both the parent and the
49
child will probably point to line symbols instead of function
50
symbols. For the parent this is fine, since this identifies the
51
line number in the calling routing, but the child should always
52
point to a function entry point, so we back up in the symbol
53
table until we find it.
55
For normal profiling, is_func will be set on all symbols, so this
56
code will do nothing. */
57
while (child >= symtab.base && ! child->is_func)
60
if (child < symtab.base)
63
/* Keep arc if it is on INCL_ARCS table or if the INCL_ARCS table
64
is empty and it is not in the EXCL_ARCS table. */
65
if (sym_id_arc_is_present (&syms[INCL_ARCS], parent, child)
66
|| (syms[INCL_ARCS].len == 0
67
&& !sym_id_arc_is_present (&syms[EXCL_ARCS], parent, child)))
69
child->ncalls += count;
71
printf (_("[cg_tally] arc from %s to %s traversed %lu times\n"),
72
parent->name, child->name, count));
73
arc_add (parent, child, count);
77
/* Read a record from file IFP describing an arc in the function
78
call-graph and the count of how many times the arc has been
79
traversed. FILENAME is the name of file IFP and is provided
80
for formatting error-messages only. */
83
cg_read_rec (ifp, filename)
87
bfd_vma from_pc, self_pc;
90
if (gmon_io_read_vma (ifp, &from_pc)
91
|| gmon_io_read_vma (ifp, &self_pc)
92
|| gmon_io_read_32 (ifp, &count))
94
fprintf (stderr, _("%s: %s: unexpected end of file\n"),
100
printf ("[cg_read_rec] frompc 0x%lx selfpc 0x%lx count %lu\n",
101
(unsigned long) from_pc, (unsigned long) self_pc,
102
(unsigned long) count));
104
cg_tally (from_pc, self_pc, count);
107
/* Write all the arcs in the call-graph to file OFP. FILENAME is
108
the name of OFP and is provided for formatting error-messages
112
cg_write_arcs (ofp, filename)
114
const char *filename;
119
for (sym = symtab.base; sym < symtab.limit; sym++)
121
for (arc = sym->cg.children; arc; arc = arc->next_child)
123
if (gmon_io_write_8 (ofp, GMON_TAG_CG_ARC)
124
|| gmon_io_write_vma (ofp, arc->parent->addr)
125
|| gmon_io_write_vma (ofp, arc->child->addr)
126
|| gmon_io_write_32 (ofp, arc->count))
132
printf ("[cg_write_arcs] frompc 0x%lx selfpc 0x%lx count %lu\n",
133
(unsigned long) arc->parent->addr,
134
(unsigned long) arc->child->addr, arc->count));