/*
- * Copyright (c) 1983 Regents of the University of California.
- * All rights reserved.
+ * Copyright (c) 1983, 1993, 2001
+ * The Regents of the University of California. All rights reserved.
*
- * Redistribution and use in source and binary forms are permitted
- * provided that: (1) source distributions retain this entire copyright
- * notice and comment, and (2) distributions including binaries display
- * the following acknowledgement: ``This product includes software
- * developed by the University of California, Berkeley and its contributors''
- * in the documentation or other materials provided with the distribution
- * and in all advertising materials mentioning features or use of this
- * software. Neither the name of the University nor the names of its
- * contributors may be used to endorse or promote products derived
- * from this software without specific prior written permission.
- * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in the
+ * documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the University nor the names of its contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
*/
-#include "libiberty.h"
#include "gprof.h"
+#include "libiberty.h"
+#include "search_list.h"
+#include "source.h"
+#include "symtab.h"
#include "call_graph.h"
#include "cg_arcs.h"
#include "cg_dfn.h"
#include "utils.h"
#include "sym_ids.h"
+static int cmp_topo (const PTR, const PTR);
+static void propagate_time (Sym *);
+static void cycle_time (void);
+static void cycle_link (void);
+static void inherit_flags (Sym *);
+static void propagate_flags (Sym **);
+static int cmp_total (const PTR, const PTR);
+
Sym *cycle_header;
-int num_cycles;
+unsigned int num_cycles;
+Arc **arcs;
+unsigned int numarcs;
/*
* Return TRUE iff PARENT has an arc to covers the address
* range covered by CHILD.
*/
Arc *
-DEFUN (arc_lookup, (parent, child), Sym * parent AND Sym * child)
+arc_lookup (Sym *parent, Sym *child)
{
Arc *arc;
{
printf ("[arc_lookup] parent == 0 || child == 0\n");
return 0;
- } /* if */
+ }
DBG (LOOKUPDEBUG, printf ("[arc_lookup] parent %s child %s\n",
parent->name, child->name));
for (arc = parent->cg.children; arc; arc = arc->next_child)
&& child->end_addr <= arc->child->end_addr)
{
return arc;
- } /* if */
- } /* for */
+ }
+ }
return 0;
-} /* arc_lookup */
+}
/*
* Add (or just increment) an arc:
*/
void
-DEFUN (arc_add, (parent, child, count),
- Sym * parent AND Sym * child AND int count)
+arc_add (Sym *parent, Sym *child, unsigned long count)
{
- Arc *arc;
+ static unsigned int maxarcs = 0;
+ Arc *arc, **newarcs;
- DBG (TALLYDEBUG, printf ("[arc_add] %d arcs from %s to %s\n",
+ DBG (TALLYDEBUG, printf ("[arc_add] %lu arcs from %s to %s\n",
count, parent->name, child->name));
arc = arc_lookup (parent, child);
if (arc)
/*
* A hit: just increment the count.
*/
- DBG (TALLYDEBUG, printf ("[tally] hit %d += %d\n",
+ DBG (TALLYDEBUG, printf ("[tally] hit %lu += %lu\n",
arc->count, count));
arc->count += count;
return;
- } /* if */
+ }
arc = (Arc *) xmalloc (sizeof (*arc));
+ memset (arc, 0, sizeof (*arc));
arc->parent = parent;
arc->child = child;
arc->count = count;
+ /* If this isn't an arc for a recursive call to parent, then add it
+ to the array of arcs. */
+ if (parent != child)
+ {
+ /* If we've exhausted space in our current array, get a new one
+ and copy the contents. We might want to throttle the doubling
+ factor one day. */
+ if (numarcs == maxarcs)
+ {
+ /* Determine how much space we want to allocate. */
+ if (maxarcs == 0)
+ maxarcs = 1;
+ maxarcs *= 2;
+
+ /* Allocate the new array. */
+ newarcs = (Arc **)xmalloc(sizeof (Arc *) * maxarcs);
+
+ /* Copy the old array's contents into the new array. */
+ memcpy (newarcs, arcs, numarcs * sizeof (Arc *));
+
+ /* Free up the old array. */
+ free (arcs);
+
+ /* And make the new array be the current array. */
+ arcs = newarcs;
+ }
+
+ /* Place this arc in the arc array. */
+ arcs[numarcs++] = arc;
+ }
+
/* prepend this child to the children of this parent: */
arc->next_child = parent->cg.children;
parent->cg.children = arc;
/* prepend this parent to the parents of this child: */
arc->next_parent = child->cg.parents;
child->cg.parents = arc;
-} /* arc_add */
+}
static int
-DEFUN (cmp_topo, (lp, rp), const PTR lp AND const PTR rp)
+cmp_topo (const PTR lp, const PTR rp)
{
const Sym *left = *(const Sym **) lp;
const Sym *right = *(const Sym **) rp;
return left->cg.top_order - right->cg.top_order;
-} /* cmp_topo */
+}
static void
-DEFUN (propagate_time, (parent), Sym * parent)
+propagate_time (Sym *parent)
{
Arc *arc;
Sym *child;
if (parent->cg.prop.fract == 0.0)
{
return;
- } /* if */
+ }
/* gather time from children of this parent: */
if (arc->count == 0 || child == parent || child->cg.prop.fract == 0)
{
continue;
- } /* if */
+ }
if (child->cg.cyc.head != child)
{
if (parent->cg.cyc.num == child->cg.cyc.num)
{
continue;
- } /* if */
+ }
if (parent->cg.top_order <= child->cg.top_order)
{
fprintf (stderr, "[propagate] toporder botches\n");
- } /* if */
+ }
child = child->cg.cyc.head;
}
else
{
fprintf (stderr, "[propagate] toporder botches\n");
continue;
- } /* if */
- } /* if */
+ }
+ }
if (child->ncalls == 0)
{
continue;
- } /* if */
+ }
/* distribute time for this arc: */
arc->time = child->hist.time * (((double) arc->count)
{
parent->cg.cyc.head->cg.child_time += share;
parent->cg.cyc.head->cg.prop.child += prop_share;
- } /* if */
+ }
DBG (PROPDEBUG,
printf ("[prop_time] child \t");
print_name (child);
- printf (" with %f %f %d/%d\n", child->hist.time,
+ printf (" with %f %f %lu/%lu\n", child->hist.time,
child->cg.child_time, arc->count, child->ncalls);
printf ("[prop_time] parent\t");
print_name (parent);
printf ("\n[prop_time] share %f\n", share));
- } /* for */
-} /* propagate_time */
+ }
+}
/*
* its members.
*/
static void
-DEFUN_VOID (cycle_time)
+cycle_time (void)
{
Sym *member, *cyc;
* that were excluded with -E.
*/
continue;
- } /* if */
+ }
cyc->hist.time += member->hist.time;
- } /* for */
+ }
cyc->cg.prop.self = cyc->cg.prop.fract * cyc->hist.time;
- } /* for */
-} /* cycle_time */
+ }
+}
static void
-DEFUN_VOID (cycle_link)
+cycle_link (void)
{
Sym *sym, *cyc, *member;
Arc *arc;
if (sym->cg.cyc.head == sym && sym->cg.cyc.next)
{
++num_cycles;
- } /* if */
- } /* for */
+ }
+ }
/*
* cycle_header is indexed by cycle number: i.e. it is origin 1,
if (!(sym->cg.cyc.head == sym && sym->cg.cyc.next != 0))
{
continue;
- } /* if */
+ }
++num;
++cyc;
sym_init (cyc);
{
member->cg.cyc.num = num;
member->cg.cyc.head = cyc;
- } /* for */
+ }
/*
* Count calls from outside the cycle and those among cycle
if (arc->parent == member)
{
continue;
- } /* if */
+ }
if (arc->parent->cg.cyc.num == num)
{
cyc->cg.self_calls += arc->count;
else
{
cyc->ncalls += arc->count;
- } /* if */
- } /* for */
- } /* for */
- } /* for */
-} /* cycle_link */
+ }
+ }
+ }
+ }
+}
/*
* fractions from parents.
*/
static void
-DEFUN (inherit_flags, (child), Sym * child)
+inherit_flags (Sym *child)
{
Sym *head, *parent, *member;
Arc *arc;
if (child == parent)
{
continue;
- } /* if */
+ }
child->cg.print_flag |= parent->cg.print_flag;
/*
* If the child was never actually called (e.g., this arc
* is static (and all others are, too)) no time propagates
* along this arc.
*/
- if (child->ncalls)
+ if (child->ncalls != 0)
{
child->cg.prop.fract += parent->cg.prop.fract
* (((double) arc->count) / ((double) child->ncalls));
- } /* if */
- } /* for */
+ }
+ }
}
else
{
if (arc->parent->cg.cyc.head == head)
{
continue;
- } /* if */
+ }
parent = arc->parent;
head->cg.print_flag |= parent->cg.print_flag;
/*
* arc is static (and all others are, too)) no time
* propagates along this arc.
*/
- if (head->ncalls)
+ if (head->ncalls != 0)
{
head->cg.prop.fract += parent->cg.prop.fract
* (((double) arc->count) / ((double) head->ncalls));
- } /* if */
- } /* for */
- } /* for */
+ }
+ }
+ }
for (member = head; member; member = member->cg.cyc.next)
{
member->cg.print_flag = head->cg.print_flag;
member->cg.prop.fract = head->cg.prop.fract;
- } /* for */
- } /* if */
-} /* inherit_flags */
+ }
+ }
+}
/*
* and while we're here, sum time for functions.
*/
static void
-DEFUN (propagate_flags, (symbols), Sym ** symbols)
+propagate_flags (Sym **symbols)
{
- int index;
+ int sym_index;
Sym *old_head, *child;
old_head = 0;
- for (index = symtab.len - 1; index >= 0; --index)
+ for (sym_index = symtab.len - 1; sym_index >= 0; --sym_index)
{
- child = symbols[index];
+ child = symbols[sym_index];
/*
* If we haven't done this function or cycle, inherit things
* from parent. This way, we are linear in the number of arcs
{
old_head = child->cg.cyc.head;
inherit_flags (child);
- } /* if */
+ }
DBG (PROPDEBUG,
printf ("[prop_flags] ");
print_name (child);
&& !sym_lookup (&syms[EXCL_GRAPH], child->addr)))
{
child->cg.print_flag = TRUE;
- } /* if */
+ }
}
else
{
&& sym_lookup (&syms[EXCL_GRAPH], child->addr))
{
child->cg.print_flag = FALSE;
- } /* if */
- } /* if */
+ }
+ }
if (child->cg.prop.fract == 0.0)
{
/*
&& !sym_lookup (&syms[EXCL_TIME], child->addr)))
{
child->cg.prop.fract = 1.0;
- } /* if */
+ }
}
else
{
&& sym_lookup (&syms[EXCL_TIME], child->addr))
{
child->cg.prop.fract = 0.0;
- } /* if */
- } /* if */
+ }
+ }
child->cg.prop.self = child->hist.time * child->cg.prop.fract;
print_time += child->cg.prop.self;
DBG (PROPDEBUG,
child->cg.print_flag, child->cg.prop.fract);
printf ("[prop_flags] time %f propself %f print_time %f\n",
child->hist.time, child->cg.prop.self, print_time));
- } /* if */
-} /* propagate_flags */
+ }
+}
/*
* first. All else being equal, compare by names.
*/
static int
-DEFUN (cmp_total, (lp, rp), const PTR lp AND const PTR rp)
+cmp_total (const PTR lp, const PTR rp)
{
const Sym *left = *(const Sym **) lp;
const Sym *right = *(const Sym **) rp;
if (diff < 0.0)
{
return 1;
- } /* if */
+ }
if (diff > 0.0)
{
return -1;
- } /* if */
+ }
if (!left->name && left->cg.cyc.num != 0)
{
return -1;
- } /* if */
+ }
if (!right->name && right->cg.cyc.num != 0)
{
return 1;
- } /* if */
+ }
if (!left->name)
{
return -1;
- } /* if */
+ }
if (!right->name)
{
return 1;
- } /* if */
+ }
if (left->name[0] != '_' && right->name[0] == '_')
{
return -1;
- } /* if */
+ }
if (left->name[0] == '_' && right->name[0] != '_')
{
return 1;
- } /* if */
+ }
if (left->ncalls > right->ncalls)
{
return -1;
- } /* if */
+ }
if (left->ncalls < right->ncalls)
{
return 1;
- } /* if */
+ }
return strcmp (left->name, right->name);
-} /* cmp_total */
+}
-/*
- * Topologically sort the graph (collapsing cycles), and propagates
- * time bottom up and flags top down.
- */
+/* Topologically sort the graph (collapsing cycles), and propagates
+ time bottom up and flags top down. */
+
Sym **
-DEFUN_VOID (cg_assemble)
+cg_assemble (void)
{
Sym *parent, **time_sorted_syms, **top_sorted_syms;
- long index;
+ unsigned int sym_index;
Arc *arc;
- extern void find_call PARAMS ((Sym * parent,
- bfd_vma p_lowpc, bfd_vma p_highpc));
- /*
- * initialize various things:
- * zero out child times.
- * count self-recursive calls.
- * indicate that nothing is on cycles.
- */
+
+ /* Initialize various things:
+ Zero out child times.
+ Count self-recursive calls.
+ Indicate that nothing is on cycles. */
for (parent = symtab.base; parent < symtab.limit; parent++)
{
parent->cg.child_time = 0.0;
else
{
parent->cg.self_calls = 0;
- } /* if */
+ }
parent->cg.prop.fract = 0.0;
parent->cg.prop.self = 0.0;
parent->cg.prop.child = 0.0;
parent->cg.cyc.head = parent;
parent->cg.cyc.next = 0;
if (ignore_direct_calls)
- {
- find_call (parent, parent->addr, (parent + 1)->addr);
- } /* if */
- } /* for */
- /*
- * Topologically order things. If any node is unnumbered, number
- * it and any of its descendents.
- */
+ find_call (parent, parent->addr, (parent + 1)->addr);
+ }
+
+ /* Topologically order things. If any node is unnumbered, number
+ it and any of its descendents. */
for (parent = symtab.base; parent < symtab.limit; parent++)
{
if (parent->cg.top_order == DFN_NAN)
- {
- cg_dfn (parent);
- } /* if */
- } /* for */
+ cg_dfn (parent);
+ }
- /* link together nodes on the same cycle: */
+ /* Link together nodes on the same cycle. */
cycle_link ();
- /* sort the symbol table in reverse topological order: */
+ /* Sort the symbol table in reverse topological order. */
top_sorted_syms = (Sym **) xmalloc (symtab.len * sizeof (Sym *));
- for (index = 0; index < symtab.len; ++index)
- {
- top_sorted_syms[index] = &symtab.base[index];
- } /* for */
+ for (sym_index = 0; sym_index < symtab.len; ++sym_index)
+ top_sorted_syms[sym_index] = &symtab.base[sym_index];
+
qsort (top_sorted_syms, symtab.len, sizeof (Sym *), cmp_topo);
DBG (DFNDEBUG,
printf ("[cg_assemble] topological sort listing\n");
- for (index = 0; index < symtab.len; ++index)
- {
- printf ("[cg_assemble] ");
- printf ("%d:", top_sorted_syms[index]->cg.top_order);
- print_name (top_sorted_syms[index]);
- printf ("\n");
- } /* for */
+ for (sym_index = 0; sym_index < symtab.len; ++sym_index)
+ {
+ printf ("[cg_assemble] ");
+ printf ("%d:", top_sorted_syms[sym_index]->cg.top_order);
+ print_name (top_sorted_syms[sym_index]);
+ printf ("\n");
+ }
);
- /*
- * Starting from the topological top, propagate print flags to
- * children. also, calculate propagation fractions. this happens
- * before time propagation since time propagation uses the
- * fractions.
- */
+
+ /* Starting from the topological top, propagate print flags to
+ children. also, calculate propagation fractions. this happens
+ before time propagation since time propagation uses the
+ fractions. */
propagate_flags (top_sorted_syms);
- /*
- * Starting from the topological bottom, propogate children times
- * up to parents.
- */
+ /* Starting from the topological bottom, propagate children times
+ up to parents. */
cycle_time ();
- for (index = 0; index < symtab.len; ++index)
- {
- propagate_time (top_sorted_syms[index]);
- } /* for */
+ for (sym_index = 0; sym_index < symtab.len; ++sym_index)
+ propagate_time (top_sorted_syms[sym_index]);
free (top_sorted_syms);
- /*
- * Now, sort by CG.PROP.SELF + CG.PROP.CHILD. Sorting both the regular
- * function names and cycle headers.
- */
+ /* Now, sort by CG.PROP.SELF + CG.PROP.CHILD. Sorting both the regular
+ function names and cycle headers. */
time_sorted_syms = (Sym **) xmalloc ((symtab.len + num_cycles) * sizeof (Sym *));
- for (index = 0; index < symtab.len; index++)
- {
- time_sorted_syms[index] = &symtab.base[index];
- } /* if */
- for (index = 1; index <= num_cycles; index++)
- {
- time_sorted_syms[symtab.len + index - 1] = &cycle_header[index];
- } /* for */
+ for (sym_index = 0; sym_index < symtab.len; sym_index++)
+ time_sorted_syms[sym_index] = &symtab.base[sym_index];
+
+ for (sym_index = 1; sym_index <= num_cycles; sym_index++)
+ time_sorted_syms[symtab.len + sym_index - 1] = &cycle_header[sym_index];
+
qsort (time_sorted_syms, symtab.len + num_cycles, sizeof (Sym *),
cmp_total);
- for (index = 0; index < symtab.len + num_cycles; index++)
- {
- time_sorted_syms[index]->cg.index = index + 1;
- } /* for */
- return time_sorted_syms;
-} /* cg_assemble */
-/*** end of cg_arcs.c ***/
+ for (sym_index = 0; sym_index < symtab.len + num_cycles; sym_index++)
+ time_sorted_syms[sym_index]->cg.index = sym_index + 1;
+
+ return time_sorted_syms;
+}
projects / deliverable / binutils-gdb.git / blobdiff