cutList.h 5.93 KB
Newer Older
Alan Mishchenko committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
/**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 $]

***********************************************************************/
 
21 22
#ifndef ABC__opt__cut__cutList_h
#define ABC__opt__cut__cutList_h
Alan Mishchenko committed
23

24 25 26 27

ABC_NAMESPACE_HEADER_START


Alan Mishchenko committed
28 29 30 31 32 33 34 35 36 37 38 39 40 41 42
////////////////////////////////////////////////////////////////////////
///                          INCLUDES                                ///
////////////////////////////////////////////////////////////////////////

////////////////////////////////////////////////////////////////////////
///                         PARAMETERS                               ///
////////////////////////////////////////////////////////////////////////

////////////////////////////////////////////////////////////////////////
///                         BASIC TYPES                              ///
////////////////////////////////////////////////////////////////////////

typedef struct Cut_ListStruct_t_         Cut_List_t;
struct Cut_ListStruct_t_
{
Alan Mishchenko committed
43 44
    Cut_Cut_t *  pHead[CUT_SIZE_MAX+1];
    Cut_Cut_t ** ppTail[CUT_SIZE_MAX+1];
Alan Mishchenko committed
45 46 47
};

////////////////////////////////////////////////////////////////////////
Alan Mishchenko committed
48
///                      MACRO DEFINITIONS                           ///
Alan Mishchenko committed
49 50 51 52 53 54 55 56
////////////////////////////////////////////////////////////////////////

////////////////////////////////////////////////////////////////////////
///                    FUNCTION DECLARATIONS                         ///
////////////////////////////////////////////////////////////////////////

/**Function*************************************************************

Alan Mishchenko committed
57
  Synopsis    [Start the cut list.]
Alan Mishchenko committed
58 59 60 61 62 63 64 65 66 67 68

  Description []
               
  SideEffects []

  SeeAlso     []

***********************************************************************/
static inline void Cut_ListStart( Cut_List_t * p )
{
    int i;
Alan Mishchenko committed
69
    for ( i = 1; i <= CUT_SIZE_MAX; i++ )
Alan Mishchenko committed
70 71 72 73 74 75 76 77
    {
        p->pHead[i] = 0;
        p->ppTail[i] = &p->pHead[i];
    }
}

/**Function*************************************************************

Alan Mishchenko committed
78
  Synopsis    [Adds one cut to the cut list.]
Alan Mishchenko committed
79 80 81 82 83 84 85 86 87 88

  Description []
               
  SideEffects []

  SeeAlso     []

***********************************************************************/
static inline void Cut_ListAdd( Cut_List_t * p, Cut_Cut_t * pCut )
{
Alan Mishchenko committed
89
    assert( pCut->nLeaves > 0 && pCut->nLeaves <= CUT_SIZE_MAX );
Alan Mishchenko committed
90 91 92 93 94 95
    *p->ppTail[pCut->nLeaves] = pCut;
    p->ppTail[pCut->nLeaves] = &pCut->pNext;
}

/**Function*************************************************************

Alan Mishchenko committed
96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182
  Synopsis    [Adds one cut to the cut list while preserving order.]

  Description []
               
  SideEffects []

  SeeAlso     []

***********************************************************************/
static inline void Cut_ListAdd2( Cut_List_t * p, Cut_Cut_t * pCut )
{
    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;
}

/**Function*************************************************************

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

  Description []
               
  SideEffects []

  SeeAlso     []

***********************************************************************/
static inline void Cut_ListDerive( Cut_List_t * p, Cut_Cut_t * pList )
{
    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;
    }
}

/**Function*************************************************************

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

  Description []
               
  SideEffects []

  SeeAlso     []

***********************************************************************/
static inline void Cut_ListAddList( Cut_List_t * pOld, Cut_List_t * pNew )
{
    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];
    }
}

/**Function*************************************************************

  Synopsis    [Returns the cut list linked into one sequence of cuts.]
Alan Mishchenko committed
183 184 185 186 187 188 189 190 191 192

  Description []
               
  SideEffects []

  SeeAlso     []

***********************************************************************/
static inline Cut_Cut_t * Cut_ListFinish( Cut_List_t * p )
{
Alan Mishchenko committed
193
    Cut_Cut_t * pHead = NULL, ** ppTail = &pHead;
Alan Mishchenko committed
194
    int i;
Alan Mishchenko committed
195 196 197 198 199 200 201 202 203
    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;
Alan Mishchenko committed
204 205
}

206 207 208 209


ABC_NAMESPACE_HEADER_END

Alan Mishchenko committed
210 211
#endif

Alan Mishchenko committed
212 213 214 215
////////////////////////////////////////////////////////////////////////
///                       END OF FILE                                ///
////////////////////////////////////////////////////////////////////////