Back to index

cell-binutils  2.17cvs20070401
Classes | Defines | Functions | Variables
cg_dfn.c File Reference
#include "libiberty.h"
#include "gprof.h"
#include "search_list.h"
#include "source.h"
#include "symtab.h"
#include "cg_arcs.h"
#include "cg_dfn.h"
#include "utils.h"

Go to the source code of this file.

Classes

struct  DFN_Stack

Defines

#define DFN_INCR_DEPTH   (128)

Functions

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 *)
void cg_dfn (Sym *parent)

Variables

DFN_Stackdfn_stack = NULL
int dfn_maxdepth = 0
int dfn_depth = 0
int dfn_counter = DFN_NAN

Class Documentation

struct DFN_Stack

Definition at line 40 of file cg_dfn.c.

Collaboration diagram for DFN_Stack:
Class Members
int cycle_top
Sym * sym

Define Documentation

#define DFN_INCR_DEPTH   (128)

Definition at line 38 of file cg_dfn.c.


Function Documentation

void cg_dfn ( Sym parent)

Definition at line 271 of file cg_dfn.c.

{
  Arc *arc;

  DBG (DFNDEBUG, printf ("[dfn] dfn( ");
       print_name (parent);
       printf (")\n"));
  /*
   * If we're already numbered, no need to look any further:
   */
  if (is_numbered (parent))
    {
      return;
    }
  /*
   * If we're already busy, must be a cycle:
   */
  if (is_busy (parent))
    {
      find_cycle (parent);
      return;
    }
  pre_visit (parent);
  /*
   * Recursively visit children:
   */
  for (arc = parent->cg.children; arc; arc = arc->next_child)
    {
      cg_dfn (arc->child);
    }
  post_visit (parent);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void find_cycle ( Sym child) [static]

Definition at line 90 of file cg_dfn.c.

{
  Sym *head = 0;
  Sym *tail;
  int cycle_top;
  int index;

  for (cycle_top = dfn_depth; cycle_top > 0; --cycle_top)
    {
      head = dfn_stack[cycle_top].sym;
      if (child == head)
       {
         break;
       }
      if (child->cg.cyc.head != child && child->cg.cyc.head == head)
       {
         break;
       }
    }
  if (cycle_top <= 0)
    {
      fprintf (stderr, "[find_cycle] couldn't find head of cycle\n");
      done (1);
    }
#ifdef DEBUG
  if (debug_level & DFNDEBUG)
    {
      printf ("[find_cycle] dfn_depth %d cycle_top %d ",
             dfn_depth, cycle_top);
      if (head)
       {
         print_name (head);
       }
      else
       {
         printf ("<unknown>");
       }
      printf ("\n");
    }
#endif
  if (cycle_top == dfn_depth)
    {
      /*
       * This is previous function, e.g. this calls itself.  Sort of
       * boring.
       *
       * Since we are taking out self-cycles elsewhere no need for
       * the special case, here.
       */
      DBG (DFNDEBUG,
          printf ("[find_cycle] ");
          print_name (child);
          printf ("\n"));
    }
  else
    {
      /*
       * Glom intervening functions that aren't already glommed into
       * this cycle.  Things have been glommed when their cyclehead
       * field points to the head of the cycle they are glommed
       * into.
       */
      for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next)
       {
         /* void: chase down to tail of things already glommed */
         DBG (DFNDEBUG,
              printf ("[find_cycle] tail ");
              print_name (tail);
              printf ("\n"));
       }
      /*
       * If what we think is the top of the cycle has a cyclehead
       * field, then it's not really the head of the cycle, which is
       * really what we want.
       */
      if (head->cg.cyc.head != head)
       {
         head = head->cg.cyc.head;
         DBG (DFNDEBUG, printf ("[find_cycle] new cyclehead ");
              print_name (head);
              printf ("\n"));
       }
      for (index = cycle_top + 1; index <= dfn_depth; ++index)
       {
         child = dfn_stack[index].sym;
         if (child->cg.cyc.head == child)
           {
             /*
              * Not yet glommed anywhere, glom it and fix any
              * children it has glommed.
              */
             tail->cg.cyc.next = child;
             child->cg.cyc.head = head;
             DBG (DFNDEBUG, printf ("[find_cycle] glomming ");
                 print_name (child);
                 printf (" onto ");
                 print_name (head);
                 printf ("\n"));
             for (tail = child; tail->cg.cyc.next; tail = tail->cg.cyc.next)
              {
                tail->cg.cyc.next->cg.cyc.head = head;
                DBG (DFNDEBUG, printf ("[find_cycle] and its tail ");
                     print_name (tail->cg.cyc.next);
                     printf (" onto ");
                     print_name (head);
                     printf ("\n"));
              }
           }
         else if (child->cg.cyc.head != head /* firewall */ )
           {
             fprintf (stderr, "[find_cycle] glommed, but not to head\n");
             done (1);
           }
       }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static bfd_boolean is_busy ( Sym child) [static]

Definition at line 73 of file cg_dfn.c.

{
  if (child->cg.top_order == DFN_NAN)
    {
      return FALSE;
    }
  return TRUE;
}

Here is the caller graph for this function:

static bfd_boolean is_numbered ( Sym child) [static]

Definition at line 63 of file cg_dfn.c.

{
  return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
}

Here is the caller graph for this function:

static void post_visit ( Sym parent) [static]

Definition at line 237 of file cg_dfn.c.

{
  Sym *member;

  DBG (DFNDEBUG, printf ("[post_visit]\t%d: ", dfn_depth);
       print_name (parent);
       printf ("\n"));
  /*
   * Number functions and things in their cycles unless the function
   * is itself part of a cycle:
   */
  if (parent->cg.cyc.head == parent)
    {
      ++dfn_counter;
      for (member = parent; member; member = member->cg.cyc.next)
       {
         member->cg.top_order = dfn_counter;
         DBG (DFNDEBUG, printf ("[post_visit]\t\tmember ");
              print_name (member);
              printf ("-> cg.top_order = %d\n", dfn_counter));
       }
    }
  else
    {
      DBG (DFNDEBUG, printf ("[post_visit]\t\tis part of a cycle\n"));
    }
  --dfn_depth;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void pre_visit ( Sym parent) [static]

Definition at line 213 of file cg_dfn.c.

{
  ++dfn_depth;

  if (dfn_depth >= dfn_maxdepth)
    {
      dfn_maxdepth += DFN_INCR_DEPTH;
      dfn_stack = xrealloc (dfn_stack, dfn_maxdepth * sizeof *dfn_stack);
    }

  dfn_stack[dfn_depth].sym = parent;
  dfn_stack[dfn_depth].cycle_top = dfn_depth;
  parent->cg.top_order = DFN_BUSY;
  DBG (DFNDEBUG, printf ("[pre_visit]\t\t%d:", dfn_depth);
       print_name (parent);
       printf ("\n"));
}

Here is the call graph for this function:

Here is the caller graph for this function:


Variable Documentation

Definition at line 56 of file cg_dfn.c.

Definition at line 55 of file cg_dfn.c.

Definition at line 54 of file cg_dfn.c.

Definition at line 53 of file cg_dfn.c.