1 /* call_graph.c - Create call graphs. 2 3 Copyright (C) 1999-2014 Free Software Foundation, Inc. 4 5 This file is part of GNU Binutils. 6 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 3 of the License, or 10 (at your option) any later version. 11 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. 16 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., 51 Franklin Street - Fifth Floor, Boston, MA 20 02110-1301, USA. */ 21 22 #include "gprof.h" 24 #include "search_list.h" 25 #include "source.h" 26 #include "symtab.h" 27 #include "cg_arcs.h" 28 #include "call_graph.h" 29 #include "corefile.h" 30 #include "gmon_io.h" 31 #include "gmon_out.h" 32 #include "sym_ids.h" 33 34 void 35 cg_tally (bfd_vma from_pc, bfd_vma self_pc, unsigned long count) 36 { 37 Sym *parent; 38 Sym *child; 39 40 parent = sym_lookup (&symtab, from_pc); 41 child = sym_lookup (&symtab, self_pc); 42 43 if (child == NULL || parent == NULL) 44 return; 45 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. 52 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) 56 --child; 57 58 if (child < symtab.base) 59 return; 60 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))) 66 { 67 child->ncalls += count; 68 DBG (TALLYDEBUG, 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); 72 } 73 } 74 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. */ 79 80 void 81 cg_read_rec (FILE *ifp, const char *filename) 82 { 83 bfd_vma from_pc, self_pc; 84 unsigned int count; 85 86 if (gmon_io_read_vma (ifp, &from_pc) 87 || gmon_io_read_vma (ifp, &self_pc) 88 || gmon_io_read_32 (ifp, &count)) 89 { 90 fprintf (stderr, _("%s: %s: unexpected end of file\n"), 91 whoami, filename); 92 done (1); 93 } 94 95 DBG (SAMPLEDEBUG, 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)); 99 /* Add this arc: */ 100 cg_tally (from_pc, self_pc, count); 101 } 102 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 105 only. */ 106 107 void 108 cg_write_arcs (FILE *ofp, const char *filename) 109 { 110 Arc *arc; 111 Sym *sym; 112 113 for (sym = symtab.base; sym < symtab.limit; sym++) 114 { 115 for (arc = sym->cg.children; arc; arc = arc->next_child) 116 { 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)) 121 { 122 perror (filename); 123 done (1); 124 } 125 DBG (SAMPLEDEBUG, 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)); 129 } 130 } 131 } 132
