1 /* call_graph.c - Create call graphs.
3 Copyright 2000, 2001 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 DEFUN (cg_tally, (from_pc, self_pc, count),
35 bfd_vma from_pc AND bfd_vma self_pc AND unsigned long count)
40 parent = sym_lookup (&symtab, from_pc);
41 child = sym_lookup (&symtab, self_pc);
43 if (child == NULL || parent == NULL)
46 /* If we're doing line-by-line profiling, both the parent and the
47 child will probably point to line symbols instead of function
48 symbols. For the parent this is fine, since this identifies the
49 line number in the calling routing, but the child should always
50 point to a function entry point, so we back up in the symbol
51 table until we find it.
53 For normal profiling, is_func will be set on all symbols, so this
54 code will do nothing. */
55 while (child >= symtab.base && ! child->is_func)
58 if (child < symtab.base)
61 /* Keep arc if it is on INCL_ARCS table or if the INCL_ARCS table
62 is empty and it is not in the EXCL_ARCS table. */
63 if (sym_id_arc_is_present (&syms[INCL_ARCS], parent, child)
64 || (syms[INCL_ARCS].len == 0
65 && !sym_id_arc_is_present (&syms[EXCL_ARCS], parent, child)))
67 child->ncalls += count;
69 printf (_("[cg_tally] arc from %s to %s traversed %lu times\n"),
70 parent->name, child->name, count));
71 arc_add (parent, child, count);
75 /* Read a record from file IFP describing an arc in the function
76 call-graph and the count of how many times the arc has been
77 traversed. FILENAME is the name of file IFP and is provided
78 for formatting error-messages only. */
81 DEFUN (cg_read_rec, (ifp, filename), FILE * ifp AND CONST char *filename)
83 bfd_vma from_pc, self_pc;
86 if (gmon_io_read_vma (ifp, &from_pc)
87 || gmon_io_read_vma (ifp, &self_pc)
88 || gmon_io_read_32 (ifp, &count))
90 fprintf (stderr, _("%s: %s: unexpected end of file\n"),
96 printf ("[cg_read_rec] frompc 0x%lx selfpc 0x%lx count %lu\n",
97 (unsigned long) from_pc, (unsigned long) self_pc,
98 (unsigned long) count));
100 cg_tally (from_pc, self_pc, count);
103 /* Write all the arcs in the call-graph to file OFP. FILENAME is
104 the name of OFP and is provided for formatting error-messages
108 DEFUN (cg_write_arcs, (ofp, filename), FILE * ofp AND const char *filename)
113 for (sym = symtab.base; sym < symtab.limit; sym++)
115 for (arc = sym->cg.children; arc; arc = arc->next_child)
117 if (gmon_io_write_8 (ofp, GMON_TAG_CG_ARC)
118 || gmon_io_write_vma (ofp, arc->parent->addr)
119 || gmon_io_write_vma (ofp, arc->child->addr)
120 || gmon_io_write_32 (ofp, arc->count))
126 printf ("[cg_write_arcs] frompc 0x%lx selfpc 0x%lx count %lu\n",
127 (unsigned long) arc->parent->addr,
128 (unsigned long) arc->child->addr, arc->count));