diff options
Diffstat (limited to 'gprof/cg_dfn.c')
| -rw-r--r-- | gprof/cg_dfn.c | 28 |
1 files changed, 11 insertions, 17 deletions
diff --git a/gprof/cg_dfn.c b/gprof/cg_dfn.c index 5c8b5ec..50be4be 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; |