cutList.h File Reference

Go to the source code of this file.

Data Structures
struct	Cut_ListStruct_t_

Typedefs
typedef typedefABC_NAMESPACE_HEADER_START struct Cut_ListStruct_t_	Cut_List_t
	INCLUDES ///. More...

Functions
static void	Cut_ListStart (Cut_List_t *p)
	MACRO DEFINITIONS ///. More...
static void	Cut_ListAdd (Cut_List_t *p, Cut_Cut_t *pCut)
static void	Cut_ListAdd2 (Cut_List_t *p, Cut_Cut_t *pCut)
static void	Cut_ListDerive (Cut_List_t *p, Cut_Cut_t *pList)
static void	Cut_ListAddList (Cut_List_t *pOld, Cut_List_t *pNew)
static Cut_Cut_t *	Cut_ListFinish (Cut_List_t *p)

Typedef Documentation

typedef typedefABC_NAMESPACE_HEADER_START struct Cut_ListStruct_t_ Cut_List_t

INCLUDES ///.

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

FileName [cutList.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Implementation of layered listed list of cuts.]

Synopsis [External declarations.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

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

Revision [

Id:

cutList.h,v 1.00 2005/06/20 00:00:00 alanmi Exp

]PARAMETERS ///BASIC TYPES ///

Definition at line 40 of file cutList.h.

Function Documentation

static void Cut_ListAdd ( Cut_List_t *  p, Cut_Cut_t *  pCut  )

inlinestatic

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

Synopsis [Adds one cut to the cut list.]

Description []

SideEffects []

SeeAlso []

Definition at line 87 of file cutList.h.

{
    assert( pCut->nLeaves > 0 && pCut->nLeaves <= CUT_SIZE_MAX );
    *p->ppTail[pCut->nLeaves] = pCut;
    p->ppTail[pCut->nLeaves] = &pCut->pNext;
}

static void Cut_ListAdd2 ( Cut_List_t *  p, Cut_Cut_t *  pCut  )

inlinestatic

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

Synopsis [Adds one cut to the cut list while preserving order.]

Description []

SideEffects []

SeeAlso []

Definition at line 105 of file cutList.h.

{
    extern int Cut_CutCompare( Cut_Cut_t * pCut1, Cut_Cut_t * pCut2 );
    Cut_Cut_t * pTemp, ** ppSpot;
    assert( pCut->nLeaves > 0 && pCut->nLeaves <= CUT_SIZE_MAX );
    if ( p->pHead[pCut->nLeaves] != NULL )
    {
        ppSpot = &p->pHead[pCut->nLeaves];
        for ( pTemp = p->pHead[pCut->nLeaves]; pTemp; pTemp = pTemp->pNext )
        {
            if ( Cut_CutCompare(pCut, pTemp) < 0 )
            {
                *ppSpot = pCut;
                pCut->pNext = pTemp;
                return;
            }
            else
                ppSpot = &pTemp->pNext;
        }
    }
    *p->ppTail[pCut->nLeaves] = pCut;
    p->ppTail[pCut->nLeaves] = &pCut->pNext;
}

static void Cut_ListAddList ( Cut_List_t *  pOld, Cut_List_t *  pNew  )

inlinestatic

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

Synopsis [Adds the second list to the first list.]

Description []

SideEffects []

SeeAlso []

Definition at line 168 of file cutList.h.

{
    int i;
    for ( i = 1; i <= CUT_SIZE_MAX; i++ )
    {
        if ( pNew->pHead[i] == NULL )
            continue;
        *pOld->ppTail[i] = pNew->pHead[i];
        pOld->ppTail[i] = pNew->ppTail[i];
    }
}

static void Cut_ListDerive ( Cut_List_t *  p, Cut_Cut_t *  pList  )

inlinestatic

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

Synopsis [Derive the super list from the linked list of cuts.]

Description []

SideEffects []

SeeAlso []

Definition at line 140 of file cutList.h.

{
    Cut_Cut_t * pPrev;
    int nLeaves;
    Cut_ListStart( p );
    while ( pList != NULL )
    {
        nLeaves = pList->nLeaves;
        p->pHead[nLeaves] = pList;
        for ( pPrev = pList, pList = pList->pNext; pList; pPrev = pList, pList = pList->pNext )
            if ( nLeaves < (int)pList->nLeaves )
                break;
        p->ppTail[nLeaves] = &pPrev->pNext;
        pPrev->pNext = NULL;
    }
}

static Cut_Cut_t* Cut_ListFinish ( Cut_List_t *  p )

inlinestatic

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

Synopsis [Returns the cut list linked into one sequence of cuts.]

Description []

SideEffects []

SeeAlso []

Definition at line 191 of file cutList.h.

{
    Cut_Cut_t * pHead = NULL, ** ppTail = &pHead;
    int i;
    for ( i = 1; i <= CUT_SIZE_MAX; i++ )
    {
        if ( p->pHead[i] == NULL )
            continue;
        *ppTail = p->pHead[i];
        ppTail = p->ppTail[i];
    }
    *ppTail = NULL;
    return pHead;
}

static void Cut_ListStart ( Cut_List_t *  p )

inlinestatic

MACRO DEFINITIONS ///.

FUNCTION DECLARATIONS /// Function*************************************************************

Synopsis [Start the cut list.]

Description []

SideEffects []

SeeAlso []

Definition at line 66 of file cutList.h.

{
    int i;
    for ( i = 1; i <= CUT_SIZE_MAX; i++ )
    {
        p->pHead[i] = 0;
        p->ppTail[i] = &p->pHead[i];
    }
}