mtrBasic.c File Reference

#include "misc/util/util_hack.h"
#include "mtrInt.h"

Include dependency graph for mtrBasic.c:

Go to the source code of this file.

Functions
MtrNode *	Mtr_AllocNode (void)
void	Mtr_DeallocNode (MtrNode *node)
MtrNode *	Mtr_InitTree (void)
void	Mtr_FreeTree (MtrNode *node)
MtrNode *	Mtr_CopyTree (MtrNode *node, int expansion)
void	Mtr_MakeFirstChild (MtrNode *parent, MtrNode *child)
void	Mtr_MakeLastChild (MtrNode *parent, MtrNode *child)
MtrNode *	Mtr_CreateFirstChild (MtrNode *parent)
MtrNode *	Mtr_CreateLastChild (MtrNode *parent)
void	Mtr_MakeNextSibling (MtrNode *first, MtrNode *second)
void	Mtr_PrintTree (MtrNode *node)

Function Documentation

Mtr_AllocNode()

MtrNode * Mtr_AllocNode

(

void

)

AutomaticStart AutomaticEnd Function********************************************************************

Synopsis [Allocates new tree node.]

Description [Allocates new tree node. Returns pointer to node.]

SideEffects [None]

SeeAlso [Mtr_DeallocNode]

Definition at line 118 of file mtrBasic.c.

{
    MtrNode *node;
 
    node = ABC_ALLOC(MtrNode,1);
    return node;
 
} /* Mtr_AllocNode */

Here is the caller graph for this function:

Mtr_CopyTree()

MtrNode * Mtr_CopyTree	(	MtrNode *	node,
		int	expansion )

Function********************************************************************

Synopsis [Makes a copy of tree.]

Description [Makes a copy of tree. If parameter expansion is greater than 1, it will expand the tree by that factor. It is an error for expansion to be less than 1. Returns a pointer to the copy if successful; NULL otherwise.]

SideEffects [None]

SeeAlso [Mtr_InitTree]

Definition at line 215 of file mtrBasic.c.

{
    MtrNode *copy;
 
    if (node == NULL) return(NULL);
    if (expansion < 1) return(NULL);
    copy = Mtr_AllocNode();
    if (copy == NULL) return(NULL);
    copy->parent = copy->elder = copy->child = copy->younger = NULL;
    if (node->child != NULL) {
        copy->child = Mtr_CopyTree(node->child, expansion);
        if (copy->child == NULL) {
            Mtr_DeallocNode(copy);
            return(NULL);
        }
    }
    if (node->younger != NULL) {
        copy->younger = Mtr_CopyTree(node->younger, expansion);
        if (copy->younger == NULL) {
            Mtr_FreeTree(copy);
            return(NULL);
        }
    }
    copy->flags = node->flags;
    copy->low = node->low * expansion;
    copy->size = node->size * expansion;
    copy->index = node->index * expansion;
    if (copy->younger) copy->younger->elder = copy;
    if (copy->child) {
        MtrNode *auxnode = copy->child;
        while (auxnode != NULL) {
            auxnode->parent = copy;
            auxnode = auxnode->younger;
        }
    }
    return(copy);
 
} /* end of Mtr_CopyTree */

Here is the call graph for this function:

Here is the caller graph for this function:

Mtr_CreateFirstChild()

MtrNode * Mtr_CreateFirstChild

(

MtrNode *

parent

)

Function********************************************************************

Synopsis [Creates a new node and makes it the first child of parent.]

Description [Creates a new node and makes it the first child of parent. Returns pointer to new child.]

SideEffects [None]

SeeAlso [Mtr_MakeFirstChild Mtr_CreateLastChild]

Definition at line 337 of file mtrBasic.c.

{
    MtrNode *child;
 
    child = Mtr_AllocNode();
    if (child == NULL) return(NULL);
 
    child->child = child->younger = child-> elder = NULL;
    child->flags = 0;
    Mtr_MakeFirstChild(parent,child);
    return(child);
 
} /* end of Mtr_CreateFirstChild */

Here is the call graph for this function:

Mtr_CreateLastChild()

MtrNode * Mtr_CreateLastChild

(

MtrNode *

parent

)

Function********************************************************************

Synopsis [Creates a new node and makes it the last child of parent.]

Description [Creates a new node and makes it the last child of parent. Returns pointer to new child.]

SideEffects [None]

SeeAlso [Mtr_MakeLastChild Mtr_CreateFirstChild]

Definition at line 366 of file mtrBasic.c.

{
    MtrNode *child;
 
    child = Mtr_AllocNode();
    if (child == NULL) return(NULL);
 
    child->child = child->younger = child->elder = NULL;
    child->flags = 0;
    Mtr_MakeLastChild(parent,child);
    return(child);
 
} /* end of Mtr_CreateLastChild */

Here is the call graph for this function:

Mtr_DeallocNode()

void Mtr_DeallocNode

(

MtrNode *

node

)

Function********************************************************************

Synopsis [Deallocates tree node.]

Description []

SideEffects [None]

SeeAlso [Mtr_AllocNode]

Definition at line 140 of file mtrBasic.c.

{
    ABC_FREE(node);
    return;
 
} /* end of Mtr_DeallocNode */

Here is the caller graph for this function:

Mtr_FreeTree()

void Mtr_FreeTree

(

MtrNode *

node

)

Function********************************************************************

Synopsis [Disposes of tree rooted at node.]

Description []

SideEffects [None]

SeeAlso [Mtr_InitTree]

Definition at line 188 of file mtrBasic.c.

{
    if (node == NULL) return;
    if (! MTR_TEST(node,MTR_TERMINAL)) Mtr_FreeTree(node->child);
    Mtr_FreeTree(node->younger);
    Mtr_DeallocNode(node);
    return;
 
} /* end of Mtr_FreeTree */

Here is the call graph for this function:

Here is the caller graph for this function:

Mtr_InitTree()

MtrNode * Mtr_InitTree

(

void

)

Function********************************************************************

Synopsis [Initializes tree with one node.]

Description [Initializes tree with one node. Returns pointer to node.]

SideEffects [None]

SeeAlso [Mtr_FreeTree Mtr_InitGroupTree]

Definition at line 161 of file mtrBasic.c.

{
    MtrNode *node;
 
    node = Mtr_AllocNode();
    if (node == NULL) return(NULL);
 
    node->parent = node->child = node->elder = node->younger = NULL;
    node->flags = 0;
 
    return(node);
 
} /* end of Mtr_InitTree */

Here is the call graph for this function:

Here is the caller graph for this function:

Mtr_MakeFirstChild()

void Mtr_MakeFirstChild	(	MtrNode *	parent,
		MtrNode *	child )

Function********************************************************************

Synopsis [Makes child the first child of parent.]

Description []

SideEffects [None]

SeeAlso [Mtr_MakeLastChild Mtr_CreateFirstChild]

Definition at line 269 of file mtrBasic.c.

{
    child->parent = parent;
    child->younger = parent->child;
    child->elder = NULL;
    if (parent->child != NULL) {
#ifdef MTR_DEBUG
        assert(parent->child->elder == NULL);
#endif
        parent->child->elder = child;
    }
    parent->child = child;
    return;
 
} /* end of Mtr_MakeFirstChild */

Here is the caller graph for this function:

Mtr_MakeLastChild()

void Mtr_MakeLastChild	(	MtrNode *	parent,
		MtrNode *	child )

Function********************************************************************

Synopsis [Makes child the last child of parent.]

Description []

SideEffects [None]

SeeAlso [Mtr_MakeFirstChild Mtr_CreateLastChild]

Definition at line 300 of file mtrBasic.c.

{
    MtrNode *node;
 
    child->younger = NULL;
 
    if (parent->child == NULL) {
        parent->child = child;
        child->elder = NULL;
    } else {
        for (node = parent->child;
             node->younger != NULL;
             node = node->younger);
        node->younger = child;
        child->elder = node;
    }
    child->parent = parent;
    return;
 
} /* end of Mtr_MakeLastChild */

Here is the caller graph for this function:

Mtr_MakeNextSibling()

void Mtr_MakeNextSibling	(	MtrNode *	first,
		MtrNode *	second )

Function********************************************************************

Synopsis [Makes second the next sibling of first.]

Description [Makes second the next sibling of first. Second becomes a child of the parent of first.]

SideEffects [None]

SeeAlso []

Definition at line 395 of file mtrBasic.c.

{
    second->younger = first->younger;
    if (first->younger != NULL) {
        first->younger->elder = second;
    }
    second->parent = first->parent;
    first->younger = second;
    second->elder = first;
    return;
 
} /* end of Mtr_MakeNextSibling */

Mtr_PrintTree()

void Mtr_PrintTree

(

MtrNode *

node

)

Function********************************************************************

Synopsis [Prints a tree, one node per line.]

Description []

SideEffects [None]

SeeAlso [Mtr_PrintGroups]

Definition at line 423 of file mtrBasic.c.

{
    if (node == NULL) return;
    (void) fprintf(stdout,
#if SIZEOF_VOID_P == 8
    "N=0x%-8lx C=0x%-8lx Y=0x%-8lx E=0x%-8lx P=0x%-8lx F=%x L=%u S=%u\n",
    (unsigned long) node, (unsigned long) node->child,
    (unsigned long) node->younger, (unsigned long) node->elder,
    (unsigned long) node->parent, node->flags, node->low, node->size);
#else
    "N=0x%-8x C=0x%-8x Y=0x%-8x E=0x%-8x P=0x%-8x F=%x L=%hu S=%hu\n",
    (unsigned) node, (unsigned) node->child,
    (unsigned) node->younger, (unsigned) node->elder,
    (unsigned) node->parent, node->flags, node->low, node->size);
#endif
    if (!MTR_TEST(node,MTR_TERMINAL)) Mtr_PrintTree(node->child);
    Mtr_PrintTree(node->younger);
    return;
 
} /* end of Mtr_PrintTree */

Here is the call graph for this function:

Here is the caller graph for this function: