summaryrefslogtreecommitdiff
path: root/gprof/cg_dfn.c
diff options
context:
space:
mode:
authorBen Elliston <bje@au.ibm.com>2004-05-26 04:55:55 +0000
committerBen Elliston <bje@au.ibm.com>2004-05-26 04:55:55 +0000
commit76e4b983275992c538d57478b11d9862e8d11257 (patch)
tree483568c2f582a49db5967d879d6228c97eb3cf26 /gprof/cg_dfn.c
parent624da7d0176d1e16f5f3e16d3b00cf55c4a4cf96 (diff)
downloadbinutils-redhat-76e4b983275992c538d57478b11d9862e8d11257.tar.gz
* alpha.c, basic_blocks.c, basic_blocks.h, bb_exit_func.c,gprof-post-ansify-2004-05-26
call_graph.c, call_graph.h, cg_arcs.c, cg_arcs.h, cg_dfn.c, cg_dfn.h, cg_print.c, cg_print.h, corefile.c, corefile.h, gmon_io.c, gmon_io.h, gprof.c, gprof.h, hertz.h, hist.c, hist.h, i386.c, mips.c, search_list.c, search_list.h, source.c, source.h, sparc.c, sym_ids.c, sym_ids.h, symtab.c, symtab.h, tahoe.c, utils.c, utils.h, vax.c, gen-c-prog.awk: Convert K&R C to ANSI C.
Diffstat (limited to 'gprof/cg_dfn.c')
-rw-r--r--gprof/cg_dfn.c28
1 files changed, 11 insertions, 17 deletions
diff --git a/gprof/cg_dfn.c b/gprof/cg_dfn.c
index 5c8b5ec745..50be4be0b9 100644
--- a/gprof/cg_dfn.c
+++ b/gprof/cg_dfn.c
@@ -44,11 +44,11 @@ typedef struct
}
DFN_Stack;
-static bfd_boolean is_numbered PARAMS ((Sym *));
-static bfd_boolean is_busy PARAMS ((Sym *));
-static void find_cycle PARAMS ((Sym *));
-static void pre_visit PARAMS ((Sym *));
-static void post_visit PARAMS ((Sym *));
+static bfd_boolean is_numbered (Sym *);
+static bfd_boolean is_busy (Sym *);
+static void find_cycle (Sym *);
+static void pre_visit (Sym *);
+static void post_visit (Sym *);
DFN_Stack *dfn_stack = NULL;
int dfn_maxdepth = 0;
@@ -60,8 +60,7 @@ int dfn_counter = DFN_NAN;
* Is CHILD already numbered?
*/
static bfd_boolean
-is_numbered (child)
- Sym *child;
+is_numbered (Sym *child)
{
return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
}
@@ -71,8 +70,7 @@ is_numbered (child)
* Is CHILD already busy?
*/
static bfd_boolean
-is_busy (child)
- Sym *child;
+is_busy (Sym *child)
{
if (child->cg.top_order == DFN_NAN)
{
@@ -89,8 +87,7 @@ is_busy (child)
* depth-first number).
*/
static void
-find_cycle (child)
- Sym *child;
+find_cycle (Sym *child)
{
Sym *head = 0;
Sym *tail;
@@ -213,8 +210,7 @@ find_cycle (child)
* the stack and mark it busy.
*/
static void
-pre_visit (parent)
- Sym *parent;
+pre_visit (Sym *parent)
{
++dfn_depth;
@@ -238,8 +234,7 @@ pre_visit (parent)
* and number functions if PARENT is head of a cycle.
*/
static void
-post_visit (parent)
- Sym *parent;
+post_visit (Sym *parent)
{
Sym *member;
@@ -273,8 +268,7 @@ post_visit (parent)
* Given this PARENT, depth first number its children.
*/
void
-cg_dfn (parent)
- Sym *parent;
+cg_dfn (Sym *parent)
{
Arc *arc;