cutApi.c File Reference

#include "cutInt.h"

Include dependency graph for cutApi.c:

Go to the source code of this file.

Functions
ABC_NAMESPACE_IMPL_START Cut_Cut_t *	Cut_NodeReadCutsNew (Cut_Man_t *p, int Node)
	DECLARATIONS ///.
Cut_Cut_t *	Cut_NodeReadCutsOld (Cut_Man_t *p, int Node)
Cut_Cut_t *	Cut_NodeReadCutsTemp (Cut_Man_t *p, int Node)
void	Cut_NodeWriteCutsNew (Cut_Man_t *p, int Node, Cut_Cut_t *pList)
void	Cut_NodeWriteCutsOld (Cut_Man_t *p, int Node, Cut_Cut_t *pList)
void	Cut_NodeWriteCutsTemp (Cut_Man_t *p, int Node, Cut_Cut_t *pList)
void	Cut_NodeSetTriv (Cut_Man_t *p, int Node)
void	Cut_NodeTryDroppingCuts (Cut_Man_t *p, int Node)
void	Cut_NodeFreeCuts (Cut_Man_t *p, int Node)

Function Documentation

Cut_NodeFreeCuts()

void Cut_NodeFreeCuts	(	Cut_Man_t *	p,
		int	Node )

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

Synopsis [Deallocates the cuts at the node.]

Description []

SideEffects []

SeeAlso []

Definition at line 184 of file cutApi.c.

{
    Cut_Cut_t * pList, * pCut, * pCut2;
    pList = Cut_NodeReadCutsNew( p, Node );
    if ( pList == NULL )
        return;
    Cut_ListForEachCutSafe( pList, pCut, pCut2 )
        Cut_CutRecycle( p, pCut );
    Cut_NodeWriteCutsNew( p, Node, NULL );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Cut_NodeReadCutsNew()

ABC_NAMESPACE_IMPL_START Cut_Cut_t * Cut_NodeReadCutsNew	(	Cut_Man_t *	p,
		int	Node )

DECLARATIONS ///.

MACRO DEFINITIONS ///.

CFile****************************************************************

FileName [cutNode.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [K-feasible cut computation package.]

Synopsis [Procedures to compute cuts for a node.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - June 20, 2005.]

Revision [

Id

cutNode.c,v 1.00 2005/06/20 00:00:00 alanmi Exp

] FUNCTION DEFINITIONS /// Function*************************************************************

Synopsis [Returns the pointer to the linked list of cuts.]

Description []

SideEffects []

SeeAlso []

Definition at line 45 of file cutApi.c.

{
    if ( Node >= p->vCutsNew->nSize )
        return NULL;
    return (Cut_Cut_t *)Vec_PtrEntry( p->vCutsNew, Node );
}

Here is the caller graph for this function:

Cut_NodeReadCutsOld()

Cut_Cut_t * Cut_NodeReadCutsOld	(	Cut_Man_t *	p,
		int	Node )

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

Synopsis [Returns the pointer to the linked list of cuts.]

Description []

SideEffects []

SeeAlso []

Definition at line 63 of file cutApi.c.

{
    assert( Node < p->vCutsOld->nSize );
    return (Cut_Cut_t *)Vec_PtrEntry( p->vCutsOld, Node );
}

Here is the caller graph for this function:

Cut_NodeReadCutsTemp()

Cut_Cut_t * Cut_NodeReadCutsTemp	(	Cut_Man_t *	p,
		int	Node )

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

Synopsis [Returns the pointer to the linked list of cuts.]

Description []

SideEffects []

SeeAlso []

Definition at line 80 of file cutApi.c.

{
    assert( Node < p->vCutsTemp->nSize );
    return (Cut_Cut_t *)Vec_PtrEntry( p->vCutsTemp, Node );
}

Here is the caller graph for this function:

Cut_NodeSetTriv()

void Cut_NodeSetTriv	(	Cut_Man_t *	p,
		int	Node )

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

Synopsis [Sets the trivial cut for the node.]

Description []

SideEffects []

SeeAlso []

Definition at line 145 of file cutApi.c.

{
    assert( Cut_NodeReadCutsNew(p, Node) == NULL );
    Cut_NodeWriteCutsNew( p, Node, Cut_CutCreateTriv(p, Node) );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Cut_NodeTryDroppingCuts()

void Cut_NodeTryDroppingCuts	(	Cut_Man_t *	p,
		int	Node )

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

Synopsis [Consider dropping cuts if they are useless by now.]

Description []

SideEffects []

SeeAlso []

Definition at line 162 of file cutApi.c.

{
    int nFanouts;
    assert( p->vFanCounts );
    nFanouts = Vec_IntEntry( p->vFanCounts, Node );
    assert( nFanouts > 0 );
    if ( --nFanouts == 0 )
        Cut_NodeFreeCuts( p, Node );
    Vec_IntWriteEntry( p->vFanCounts, Node, nFanouts );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Cut_NodeWriteCutsNew()

void Cut_NodeWriteCutsNew	(	Cut_Man_t *	p,
		int	Node,
		Cut_Cut_t *	pList )

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

Synopsis [Returns the pointer to the linked list of cuts.]

Description []

SideEffects []

SeeAlso []

Definition at line 97 of file cutApi.c.

{
    Vec_PtrWriteEntry( p->vCutsNew, Node, pList );
}

Here is the caller graph for this function:

Cut_NodeWriteCutsOld()

void Cut_NodeWriteCutsOld	(	Cut_Man_t *	p,
		int	Node,
		Cut_Cut_t *	pList )

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

Synopsis [Returns the pointer to the linked list of cuts.]

Description []

SideEffects []

SeeAlso []

Definition at line 113 of file cutApi.c.

{
    Vec_PtrWriteEntry( p->vCutsOld, Node, pList );
}

Here is the caller graph for this function:

Cut_NodeWriteCutsTemp()

void Cut_NodeWriteCutsTemp	(	Cut_Man_t *	p,
		int	Node,
		Cut_Cut_t *	pList )

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

Synopsis [Returns the pointer to the linked list of cuts.]

Description []

SideEffects []

SeeAlso []

Definition at line 129 of file cutApi.c.

{
    Vec_PtrWriteEntry( p->vCutsTemp, Node, pList );
}

Here is the caller graph for this function: