covInt.h File Reference

#include "base/abc/abc.h"

Go to the source code of this file.

Data Structures
struct	Min_Man_t_
struct	Min_Cube_t_

Macros
#define	Min_CoverForEachCube(pCover, pCube)
#define	Min_CoverForEachCubeSafe(pCover, pCube, pCube2)
#define	Min_CoverForEachCubePrev(pCover, pCube, ppPrev)

Typedefs
typedef typedefABC_NAMESPACE_HEADER_START struct Min_Man_t_	Min_Man_t
	DECLARATIONS ///. More...
typedef struct Min_Cube_t_	Min_Cube_t

Functions
static int	Min_CubeHasBit (Min_Cube_t *p, int i)
static void	Min_CubeSetBit (Min_Cube_t *p, int i)
static void	Min_CubeXorBit (Min_Cube_t *p, int i)
static int	Min_CubeGetVar (Min_Cube_t *p, int Var)
static void	Min_CubeXorVar (Min_Cube_t *p, int Var, int Value)
void	Min_EsopMinimize (Min_Man_t *p)
	FUNCTION DEFINITIONS ///. More...
void	Min_EsopAddCube (Min_Man_t *p, Min_Cube_t *pCube)
void	Min_SopMinimize (Min_Man_t *p)
	FUNCTION DEFINITIONS ///. More...
void	Min_SopAddCube (Min_Man_t *p, Min_Cube_t *pCube)
Min_Man_t *	Min_ManAlloc (int nVars)
	DECLARATIONS ///. More...
void	Min_ManClean (Min_Man_t *p, int nSupp)
void	Min_ManFree (Min_Man_t *p)
void	Min_CoverCreate (Vec_Str_t *vCover, Min_Cube_t *pCover, char Type)
void	Min_CubeWrite (FILE *pFile, Min_Cube_t *pCube)
void	Min_CoverWrite (FILE *pFile, Min_Cube_t *pCover)
void	Min_CoverWriteStore (FILE *pFile, Min_Man_t *p)
void	Min_CoverWriteFile (Min_Cube_t *pCover, char *pName, int fEsop)
void	Min_CoverCheck (Min_Man_t *p)
int	Min_CubeCheck (Min_Cube_t *pCube)
Min_Cube_t *	Min_CoverCollect (Min_Man_t *p, int nSuppSize)
void	Min_CoverExpand (Min_Man_t *p, Min_Cube_t *pCover)
int	Min_CoverSuppVarNum (Min_Man_t *p, Min_Cube_t *pCover)
static Min_Cube_t *	Min_CubeAlloc (Min_Man_t *p)
	FUNCTION DEFINITIONS ///. More...
static Min_Cube_t *	Min_CubeAllocVar (Min_Man_t *p, int iVar, int fCompl)
static Min_Cube_t *	Min_CubeDup (Min_Man_t *p, Min_Cube_t *pCopy)
static void	Min_CubeRecycle (Min_Man_t *p, Min_Cube_t *pCube)
static void	Min_CoverRecycle (Min_Man_t *p, Min_Cube_t *pCover)
static int	Min_CubeCountLits (Min_Cube_t *pCube)
static void	Min_CubeGetLits (Min_Cube_t *pCube, Vec_Int_t *vLits)
static int	Min_CoverCountCubes (Min_Cube_t *pCover)
static int	Min_CubesDisjoint (Min_Cube_t *pCube0, Min_Cube_t *pCube1)
static void	Min_CoverGetDisjVars (Min_Cube_t *pThis, Min_Cube_t *pCube, Vec_Int_t *vVars)
static int	Min_CubesDistOne (Min_Cube_t *pCube0, Min_Cube_t *pCube1, Min_Cube_t *pTemp)
static int	Min_CubesDistTwo (Min_Cube_t *pCube0, Min_Cube_t *pCube1, int *pVar0, int *pVar1)
static Min_Cube_t *	Min_CubesProduct (Min_Man_t *p, Min_Cube_t *pCube0, Min_Cube_t *pCube1)
static Min_Cube_t *	Min_CubesXor (Min_Man_t *p, Min_Cube_t *pCube0, Min_Cube_t *pCube1)
static int	Min_CubesAreEqual (Min_Cube_t *pCube0, Min_Cube_t *pCube1)
static int	Min_CubeIsContained (Min_Cube_t *pCube0, Min_Cube_t *pCube1)
static void	Min_CubesTransform (Min_Cube_t *pCube, Min_Cube_t *pDist, Min_Cube_t *pMask)
static void	Min_CubesTransformOr (Min_Cube_t *pCube, Min_Cube_t *pDist)
static void	Min_CoverExpandRemoveEqual (Min_Man_t *p, Min_Cube_t *pCover)
static int	Min_CoverContainsCube (Min_Man_t *p, Min_Cube_t *pCube)

Macro Definition Documentation

#define Min_CoverForEachCube	(		pCover,
			pCube
	)

Value:

for ( pCube = pCover;                                       \
          pCube;                                                \
          pCube = pCube->pNext )

Definition at line 65 of file covInt.h.

#define Min_CoverForEachCubePrev	(		pCover,
			pCube,
			ppPrev
	)

Value:

for ( pCube = pCover,                                       \
          ppPrev = &(pCover);                                   \
          pCube;                                                \
          ppPrev = &pCube->pNext,                               \
          pCube = pCube->pNext )

Definition at line 75 of file covInt.h.

#define Min_CoverForEachCubeSafe	(		pCover,
			pCube,
			pCube2
	)

Value:

for ( pCube = pCover,                                       \
          pCube2 = pCube? pCube->pNext: NULL;                   \
          pCube;                                                \
          pCube = pCube2,                                       \
          pCube2 = pCube? pCube->pNext: NULL )

Definition at line 69 of file covInt.h.

Typedef Documentation

typedef struct Min_Cube_t_ Min_Cube_t

Definition at line 35 of file covInt.h.

typedef typedefABC_NAMESPACE_HEADER_START struct Min_Man_t_ Min_Man_t

DECLARATIONS ///.

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

FileName [covInt.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Mapping into network of SOPs/ESOPs.]

Synopsis [Internal declarations.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

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

Revision [

Id:

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

]

Definition at line 34 of file covInt.h.

Function Documentation

void Min_CoverCheck

(

Min_Man_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 223 of file covMinUtil.c.

{
    Min_Cube_t * pCube;
    int i;
    for ( i = 0; i <= p->nVars; i++ )
        Min_CoverForEachCube( p->ppStore[i], pCube )
            assert( i == (int)pCube->nLits );
}

Min_Cube_t* Min_CoverCollect	(	Min_Man_t *	p,
		int	nSuppSize
	)

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

Synopsis [Converts the cover from the sorted structure.]

Description []

SideEffects []

SeeAlso []

Definition at line 264 of file covMinUtil.c.

{
    Min_Cube_t * pCov = NULL, ** ppTail = &pCov;
    Min_Cube_t * pCube, * pCube2;
    int i;
    for ( i = 0; i <= nSuppSize; i++ )
    {
        Min_CoverForEachCubeSafe( p->ppStore[i], pCube, pCube2 )
        {
            assert( i == (int)pCube->nLits );
            *ppTail = pCube; 
            ppTail = &pCube->pNext;
            assert( pCube->uData[0] ); // not a bubble
        }
    }
    *ppTail = NULL;
    return pCov;
}

static int Min_CoverContainsCube ( Min_Man_t *  p, Min_Cube_t *  pCube  )

inlinestatic

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

Synopsis [Returns 1 if the given cube is contained in one of the cubes of the cover.]

Description []

SideEffects []

SeeAlso []

Definition at line 620 of file covInt.h.

{
    Min_Cube_t * pThis;
    int i;
/*
    // this cube cannot be equal to any cube
    Min_CoverForEachCube( p->ppStore[pCube->nLits], pThis )
    {
        if ( Min_CubesAreEqual( pCube, pThis ) )
        {
            Min_CubeWrite( stdout, pCube );
            assert( 0 );
        }
    }
*/
    // try to find a containing cube
    for ( i = 0; i <= (int)pCube->nLits; i++ )
    Min_CoverForEachCube( p->ppStore[i], pThis )
    {
        // skip the bubble
        if ( pThis != p->pBubble && Min_CubeIsContained( pThis, pCube ) )
            return 1;
    }
    return 0;
}

static int Min_CoverCountCubes ( Min_Cube_t *  pCover )

inlinestatic

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

Synopsis [Counts the number of cubes in the cover.]

Description []

SideEffects []

SeeAlso []

Definition at line 274 of file covInt.h.

{
    Min_Cube_t * pCube;
    int Count = 0;
    Min_CoverForEachCube( pCover, pCube )
        Count++;
    return Count;
}

void Min_CoverCreate	(	Vec_Str_t *	vCover,
		Min_Cube_t *	pCover,
		char	Type
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 85 of file covMinUtil.c.

{
    Min_Cube_t * pCube;
    assert( pCover != NULL );
    Vec_StrClear( vCover );
    Min_CoverForEachCube( pCover, pCube )
        Min_CubeCreate( vCover, pCube, Type );
    Vec_StrPush( vCover, 0 );
}

void Min_CoverExpand	(	Min_Man_t *	p,
		Min_Cube_t *	pCover
	)

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

Synopsis [Sorts the cover in the increasing number of literals.]

Description []

SideEffects []

SeeAlso []

Definition at line 294 of file covMinUtil.c.

{
    Min_Cube_t * pCube, * pCube2;
    Min_ManClean( p, p->nVars );
    Min_CoverForEachCubeSafe( pCover, pCube, pCube2 )
    {
        pCube->pNext = p->ppStore[pCube->nLits];
        p->ppStore[pCube->nLits] = pCube;
        p->nCubes++;
    }
}

static void Min_CoverExpandRemoveEqual ( Min_Man_t *  p, Min_Cube_t *  pCover  )

inlinestatic

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

Synopsis [Sorts the cover in the increasing number of literals.]

Description []

SideEffects []

SeeAlso []

Definition at line 583 of file covInt.h.

{
    Min_Cube_t * pCube, * pCube2, * pThis;
    if ( pCover == NULL )
    {
        Min_ManClean( p, p->nVars );
        return;
    }
    Min_ManClean( p, pCover->nVars );
    Min_CoverForEachCubeSafe( pCover, pCube, pCube2 )
    {
        // go through the linked list
        Min_CoverForEachCube( p->ppStore[pCube->nLits], pThis )
            if ( Min_CubesAreEqual( pCube, pThis ) )
            {
                Min_CubeRecycle( p, pCube );
                break;
            }
        if ( pThis != NULL )
            continue;
        pCube->pNext = p->ppStore[pCube->nLits];
        p->ppStore[pCube->nLits] = pCube;
        p->nCubes++;
    }
}

static void Min_CoverGetDisjVars ( Min_Cube_t *  pThis, Min_Cube_t *  pCube, Vec_Int_t *  vVars  )

inlinestatic

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

Synopsis [Collects the disjoint variables of the two cubes.]

Description []

SideEffects []

SeeAlso []

Definition at line 321 of file covInt.h.

{
    unsigned uData;
    int i, w;
    Vec_IntClear( vVars );
    for ( w = 0; w < (int)pCube->nWords; w++ )
    {
        uData  = pThis->uData[w] & (pThis->uData[w] >> 1) & 0x55555555;
        uData &= (pCube->uData[w] ^ (pCube->uData[w] >> 1));
        if ( uData == 0 )
            continue;
        for ( i = 0; i < 32; i += 2 )
            if ( uData & (1 << i) )
                Vec_IntPush( vVars, w*16 + i/2 );
    }
}

static void Min_CoverRecycle ( Min_Man_t *  p, Min_Cube_t *  pCover  )

inlinestatic

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

Synopsis [Recycles the cube cover.]

Description []

SideEffects []

SeeAlso []

Definition at line 205 of file covInt.h.

{
    Min_Cube_t * pCube, * pCube2;
    Min_CoverForEachCubeSafe( pCover, pCube, pCube2 )
        Extra_MmFixedEntryRecycle( p->pMemMan, (char *)pCube );
}

int Min_CoverSuppVarNum	(	Min_Man_t *	p,
		Min_Cube_t *	pCover
	)

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

Synopsis [Sorts the cover in the increasing number of literals.]

Description []

SideEffects []

SeeAlso []

Definition at line 317 of file covMinUtil.c.

{
    Min_Cube_t * pCube;
    int i, Counter;
    if ( pCover == NULL )
        return 0;
    // clean the cube
    for ( i = 0; i < (int)pCover->nWords; i++ )
        p->pTemp->uData[i]  = ~((unsigned)0);
    // add the bit data
    Min_CoverForEachCube( pCover, pCube )
        for ( i = 0; i < (int)pCover->nWords; i++ )
            p->pTemp->uData[i] &= pCube->uData[i];
    // count the vars
    Counter = 0;
    for ( i = 0; i < (int)pCover->nVars; i++ )
        Counter += ( Min_CubeGetVar(p->pTemp, i) != 3 );
    return Counter;
}

void Min_CoverWrite	(	FILE *	pFile,
		Min_Cube_t *	pCover
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 140 of file covMinUtil.c.

{
    Min_Cube_t * pCube;
    Min_CoverForEachCube( pCover, pCube )
        Min_CubeWrite( pFile, pCube );
    printf( "\n" );
}

void Min_CoverWriteFile	(	Min_Cube_t *	pCover,
		char *	pName,
		int	fEsop
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 190 of file covMinUtil.c.

{
    char Buffer[1000];
    Min_Cube_t * pCube;
    FILE * pFile;
    int i;
    sprintf( Buffer, "%s.%s", pName, fEsop? "esop" : "pla" );
    for ( i = strlen(Buffer) - 1; i >= 0; i-- )
        if ( Buffer[i] == '<' || Buffer[i] == '>' )
            Buffer[i] = '_';
    pFile = fopen( Buffer, "w" );
    fprintf( pFile, "# %s cover for output %s generated by ABC on %s\n", fEsop? "ESOP":"SOP", pName, Extra_TimeStamp() );
    fprintf( pFile, ".i %d\n", pCover? pCover->nVars : 0 );
    fprintf( pFile, ".o %d\n", 1 );
    fprintf( pFile, ".p %d\n", Min_CoverCountCubes(pCover) );
    if ( fEsop ) fprintf( pFile, ".type esop\n" );
    Min_CoverForEachCube( pCover, pCube )
        Min_CubeWrite( pFile, pCube );
    fprintf( pFile, ".e\n" );
    fclose( pFile );
}

void Min_CoverWriteStore	(	FILE *	pFile,
		Min_Man_t *	p
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 159 of file covMinUtil.c.

{
    Min_Cube_t * pCube;
    int i;
    for ( i = 0; i <= p->nVars; i++ )
    {
        Min_CoverForEachCube( p->ppStore[i], pCube )
        {
            printf( "%2d : ", i );
            if ( pCube == p->pBubble )
            {
                printf( "Bubble\n" );
                continue;
            }
            Min_CubeWrite( pFile, pCube );
        }
    }
    printf( "\n" );
}

static Min_Cube_t* Min_CubeAlloc ( Min_Man_t *  p )

inlinestatic

FUNCTION DEFINITIONS ///.

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

Synopsis [Creates the cube.]

Description []

SideEffects []

SeeAlso []

Definition at line 126 of file covInt.h.

{
    Min_Cube_t * pCube;
    pCube = (Min_Cube_t *)Extra_MmFixedEntryFetch( p->pMemMan );
    pCube->pNext  = NULL;
    pCube->nVars  = p->nVars;
    pCube->nWords = p->nWords;
    pCube->nLits  = 0;
    memset( pCube->uData, 0xff, sizeof(unsigned) * p->nWords );
    return pCube;
}

static Min_Cube_t* Min_CubeAllocVar ( Min_Man_t *  p, int  iVar, int  fCompl  )

inlinestatic

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

Synopsis [Creates the cube representing elementary var.]

Description []

SideEffects []

SeeAlso []

Definition at line 149 of file covInt.h.

{
    Min_Cube_t * pCube;
    pCube = Min_CubeAlloc( p );
    Min_CubeXorBit( pCube, iVar*2+fCompl );
    pCube->nLits = 1;
    return pCube;
}

int Min_CubeCheck

(

Min_Cube_t *

pCube

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 244 of file covMinUtil.c.

{
    int i;
    for ( i = 0; i < (int)pCube->nVars; i++ )
        if ( Min_CubeGetVar( pCube, i ) == 0 )
            return 0;
    return 1;
}

static int Min_CubeCountLits ( Min_Cube_t *  pCube )

inlinestatic

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

Synopsis [Counts the number of cubes in the cover.]

Description []

SideEffects []

SeeAlso []

Definition at line 224 of file covInt.h.

{
    unsigned uData;
    int Count = 0, i, w;
    for ( w = 0; w < (int)pCube->nWords; w++ )
    {
        uData = pCube->uData[w] ^ (pCube->uData[w] >> 1);
        for ( i = 0; i < 32; i += 2 )
            if ( uData & (1 << i) )
                Count++;
    }
    return Count;
}

static Min_Cube_t* Min_CubeDup ( Min_Man_t *  p, Min_Cube_t *  pCopy  )

inlinestatic

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

Synopsis [Creates the cube.]

Description []

SideEffects []

SeeAlso []

Definition at line 169 of file covInt.h.

{
    Min_Cube_t * pCube;
    pCube = Min_CubeAlloc( p );
    memcpy( pCube->uData, pCopy->uData, sizeof(unsigned) * p->nWords );
    pCube->nLits = pCopy->nLits;
    return pCube;
}

static void Min_CubeGetLits ( Min_Cube_t *  pCube, Vec_Int_t *  vLits  )

inlinestatic

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

Synopsis [Counts the number of cubes in the cover.]

Description []

SideEffects []

SeeAlso []

Definition at line 249 of file covInt.h.

{
    unsigned uData;
    int i, w;
    Vec_IntClear( vLits );
    for ( w = 0; w < (int)pCube->nWords; w++ )
    {
        uData = pCube->uData[w] ^ (pCube->uData[w] >> 1);
        for ( i = 0; i < 32; i += 2 )
            if ( uData & (1 << i) )
                Vec_IntPush( vLits, w*16 + i/2 );
    }
}

static int Min_CubeGetVar ( Min_Cube_t *  p, int  Var  )

inlinestatic

Definition at line 86 of file covInt.h.

{ return 3 & (p->uData[(2*Var)>>5] >> ((2*Var) & 31)); }

static int Min_CubeHasBit ( Min_Cube_t *  p, int  i  )

inlinestatic

Definition at line 83 of file covInt.h.

{ return (p->uData[(i)>>5] & (1<<((i) & 31))) > 0;     }

static int Min_CubeIsContained ( Min_Cube_t *  pCube0, Min_Cube_t *  pCube1  )

inlinestatic

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

Synopsis [Returns 1 if pCube1 is contained in pCube0, bitwise.]

Description []

SideEffects []

SeeAlso []

Definition at line 522 of file covInt.h.

{
    int i;
    for ( i = 0; i < (int)pCube0->nWords; i++ )
        if ( (pCube0->uData[i] & pCube1->uData[i]) != pCube1->uData[i] )
            return 0;
    return 1;
}

static void Min_CubeRecycle ( Min_Man_t *  p, Min_Cube_t *  pCube  )

inlinestatic

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

Synopsis [Recycles the cube.]

Description []

SideEffects []

SeeAlso []

Definition at line 189 of file covInt.h.

{
    Extra_MmFixedEntryRecycle( p->pMemMan, (char *)pCube );
}

static int Min_CubesAreEqual ( Min_Cube_t *  pCube0, Min_Cube_t *  pCube1  )

inlinestatic

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

Synopsis [Makes the produce of two cubes.]

Description []

SideEffects []

SeeAlso []

Definition at line 502 of file covInt.h.

{
    int i;
    for ( i = 0; i < (int)pCube0->nWords; i++ )
        if ( pCube0->uData[i] != pCube1->uData[i] )
            return 0;
    return 1;
}

static int Min_CubesDisjoint ( Min_Cube_t *  pCube0, Min_Cube_t *  pCube1  )

inlinestatic

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

Synopsis [Checks if two cubes are disjoint.]

Description []

SideEffects []

SeeAlso []

Definition at line 295 of file covInt.h.

{
    unsigned uData;
    int i;
    assert( pCube0->nVars == pCube1->nVars );
    for ( i = 0; i < (int)pCube0->nWords; i++ )
    {
        uData = pCube0->uData[i] & pCube1->uData[i];
        uData = (uData | (uData >> 1)) & 0x55555555;
        if ( uData != 0x55555555 )
            return 1;
    }
    return 0;
}

static int Min_CubesDistOne ( Min_Cube_t *  pCube0, Min_Cube_t *  pCube1, Min_Cube_t *  pTemp  )

inlinestatic

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

Synopsis [Checks if two cubes are disjoint.]

Description []

SideEffects []

SeeAlso []

Definition at line 349 of file covInt.h.

{
    unsigned uData;
    int i, fFound = 0;
    for ( i = 0; i < (int)pCube0->nWords; i++ )
    {
        uData = pCube0->uData[i] ^ pCube1->uData[i];
        if ( uData == 0 )
        {
            if ( pTemp ) pTemp->uData[i] = 0;
            continue;
        }
        if ( fFound )
            return 0;
        uData = (uData | (uData >> 1)) & 0x55555555;
        if ( (uData & (uData-1)) > 0 ) // more than one 1
            return 0;
        if ( pTemp ) pTemp->uData[i] = uData | (uData << 1);
        fFound = 1;
    }
    if ( fFound == 0 )
    {
        printf( "\n" );
        Min_CubeWrite( stdout, pCube0 );
        Min_CubeWrite( stdout, pCube1 );
        printf( "Error: Min_CubesDistOne() looks at two equal cubes!\n" );
    }
    return 1;
}

static int Min_CubesDistTwo ( Min_Cube_t *  pCube0, Min_Cube_t *  pCube1, int *  pVar0, int *  pVar1  )

inlinestatic

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

Synopsis [Checks if two cubes are disjoint.]

Description []

SideEffects []

SeeAlso []

Definition at line 390 of file covInt.h.

{
    unsigned uData;//, uData2;
    int i, k, Var0 = -1, Var1 = -1;
    for ( i = 0; i < (int)pCube0->nWords; i++ )
    {
        uData = pCube0->uData[i] ^ pCube1->uData[i];
        if ( uData == 0 )
            continue;
        if ( Var0 >= 0 && Var1 >= 0 ) // more than two 1s
            return 0;
        uData = (uData | (uData >> 1)) & 0x55555555;
        if ( (Var0 >= 0 || Var1 >= 0) && (uData & (uData-1)) > 0 )
            return 0;
        for ( k = 0; k < 32; k += 2 )
            if ( uData & (1 << k) )
            {
                if ( Var0 == -1 )
                    Var0 = 16 * i + k/2;
                else if ( Var1 == -1 )
                    Var1 = 16 * i + k/2;
                else
                    return 0;
            }
        /*
        if ( Var0 >= 0 )
        {
            uData &= 0xFFFF;
            uData2 = (uData >> 16);
            if ( uData && uData2 )
                return 0;
            if ( uData )
            {
            }
            uData }= uData2;
            uData &= 0x
        }
        */
    }
    if ( Var0 >= 0 && Var1 >= 0 )
    {
        *pVar0 = Var0;
        *pVar1 = Var1;
        return 1;
    }
    if ( Var0 == -1 || Var1 == -1 )
    {
        printf( "\n" );
        Min_CubeWrite( stdout, pCube0 );
        Min_CubeWrite( stdout, pCube1 );
        printf( "Error: Min_CubesDistTwo() looks at two equal cubes or dist1 cubes!\n" );
    }
    return 0;
}

static void Min_CubeSetBit ( Min_Cube_t *  p, int  i  )

inlinestatic

Definition at line 84 of file covInt.h.

{ p->uData[(i)>>5] |= (1<<((i) & 31));                 }

static Min_Cube_t* Min_CubesProduct ( Min_Man_t *  p, Min_Cube_t *  pCube0, Min_Cube_t *  pCube1  )

inlinestatic

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

Synopsis [Makes the produce of two cubes.]

Description []

SideEffects []

SeeAlso []

Definition at line 456 of file covInt.h.

{
    Min_Cube_t * pCube;
    int i;
    assert( pCube0->nVars == pCube1->nVars );
    pCube = Min_CubeAlloc( p );
    for ( i = 0; i < p->nWords; i++ )
        pCube->uData[i] = pCube0->uData[i] & pCube1->uData[i];
    pCube->nLits = Min_CubeCountLits( pCube );
    return pCube;
}

static void Min_CubesTransform ( Min_Cube_t *  pCube, Min_Cube_t *  pDist, Min_Cube_t *  pMask  )

inlinestatic

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

Synopsis [Transforms the cube into the result of merging.]

Description []

SideEffects []

SeeAlso []

Definition at line 542 of file covInt.h.

{
    int w;
    for ( w = 0; w < (int)pCube->nWords; w++ )
    {
        pCube->uData[w]  =  pCube->uData[w] ^ pDist->uData[w];
        pCube->uData[w] |= (pDist->uData[w] & ~pMask->uData[w]);
    }
}

static void Min_CubesTransformOr ( Min_Cube_t *  pCube, Min_Cube_t *  pDist  )

inlinestatic

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

Synopsis [Transforms the cube into the result of distance-1 merging.]

Description []

SideEffects []

SeeAlso []

Definition at line 563 of file covInt.h.

{
    int w;
    for ( w = 0; w < (int)pCube->nWords; w++ )
        pCube->uData[w] |= pDist->uData[w];
}

static Min_Cube_t* Min_CubesXor ( Min_Man_t *  p, Min_Cube_t *  pCube0, Min_Cube_t *  pCube1  )

inlinestatic

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

Synopsis [Makes the produce of two cubes.]

Description []

SideEffects []

SeeAlso []

Definition at line 479 of file covInt.h.

{
    Min_Cube_t * pCube;
    int i;
    assert( pCube0->nVars == pCube1->nVars );
    pCube = Min_CubeAlloc( p );
    for ( i = 0; i < p->nWords; i++ )
        pCube->uData[i] = pCube0->uData[i] ^ pCube1->uData[i];
    pCube->nLits = Min_CubeCountLits( pCube );
    return pCube;
}

void Min_CubeWrite	(	FILE *	pFile,
		Min_Cube_t *	pCube
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 106 of file covMinUtil.c.

{
    int i;
    assert( (int)pCube->nLits == Min_CubeCountLits(pCube) );
    for ( i = 0; i < (int)pCube->nVars; i++ )
        if ( Min_CubeHasBit(pCube, i*2) )
        {
            if ( Min_CubeHasBit(pCube, i*2+1) )
                fprintf( pFile, "-" );
            else
                fprintf( pFile, "0" );
        }
        else
        {
            if ( Min_CubeHasBit(pCube, i*2+1) )
                fprintf( pFile, "1" );
            else
                fprintf( pFile, "?" );
        }
    fprintf( pFile, " 1\n" );
//    fprintf( pFile, " %d\n", pCube->nLits );
}

static void Min_CubeXorBit ( Min_Cube_t *  p, int  i  )

inlinestatic

Definition at line 85 of file covInt.h.

{ p->uData[(i)>>5] ^= (1<<((i) & 31));                 }

static void Min_CubeXorVar ( Min_Cube_t *  p, int  Var, int  Value  )

inlinestatic

Definition at line 87 of file covInt.h.

{ p->uData[(2*Var)>>5] ^= (Value<<((2*Var) & 31));     }

void Min_EsopAddCube	(	Min_Man_t *	p,
		Min_Cube_t *	pCube
	)

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

Synopsis [Adds the cube to storage.]

Description []

SideEffects []

SeeAlso []

Definition at line 291 of file covMinEsop.c.

{
    assert( pCube != p->pBubble );
    assert( (int)pCube->nLits == Min_CubeCountLits(pCube) );
    while ( Min_EsopAddCubeInt( p, pCube ) );
}

void Min_EsopMinimize

(

Min_Man_t *

p

)

FUNCTION DEFINITIONS ///.

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 47 of file covMinEsop.c.

{
    int nCubesInit, nCubesOld, nIter;
    if ( p->nCubes < 3 )
        return;
    nIter = 0;
    nCubesInit = p->nCubes;
    do {
        nCubesOld = p->nCubes;
        Min_EsopRewrite( p );
        nIter++;
    }
    while ( 100.0*(nCubesOld - p->nCubes)/nCubesOld > 3.0 );

//    printf( "%d:%d->%d ", nIter, nCubesInit, p->nCubes );
}

Min_Man_t* Min_ManAlloc

(

int

nVars

)

DECLARATIONS ///.

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

FileName [covMinMan.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Mapping into network of SOPs/ESOPs.]

Synopsis [SOP manipulation.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

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

Revision [

Id:

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

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

Synopsis [Starts the minimization manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 45 of file covMinMan.c.

{
    Min_Man_t * pMan;
    // start the manager
    pMan = ABC_ALLOC( Min_Man_t, 1 );
    memset( pMan, 0, sizeof(Min_Man_t) );
    pMan->nVars   = nVars;
    pMan->nWords  = Abc_BitWordNum( nVars * 2 );
    pMan->pMemMan = Extra_MmFixedStart( sizeof(Min_Cube_t) + sizeof(unsigned) * (pMan->nWords - 1) );
    // allocate storage for the temporary cover
    pMan->ppStore = ABC_ALLOC( Min_Cube_t *, pMan->nVars + 1 );
    // create tautology cubes
    Min_ManClean( pMan, nVars );
    pMan->pOne0  = Min_CubeAlloc( pMan );
    pMan->pOne1  = Min_CubeAlloc( pMan );
    pMan->pTemp  = Min_CubeAlloc( pMan );
    pMan->pBubble = Min_CubeAlloc( pMan );  pMan->pBubble->uData[0] = 0;
    // create trivial cubes
    Min_ManClean( pMan, 1 );
    pMan->pTriv0[0] = Min_CubeAllocVar( pMan, 0, 0 );
    pMan->pTriv0[1] = Min_CubeAllocVar( pMan, 0, 1 );   
    pMan->pTriv1[0] = Min_CubeAllocVar( pMan, 0, 0 );
    pMan->pTriv1[1] = Min_CubeAllocVar( pMan, 0, 1 );   
    Min_ManClean( pMan, nVars );
    return pMan;
}

void Min_ManClean	(	Min_Man_t *	p,
		int	nSupp
	)

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

Synopsis [Cleans the minimization manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 83 of file covMinMan.c.

{
    // set the size of the cube manager
    p->nVars  = nSupp;
    p->nWords = Abc_BitWordNum(2*nSupp);
    // clean the storage
    memset( p->ppStore, 0, sizeof(Min_Cube_t *) * (nSupp + 1) );
    p->nCubes = 0;
}

void Min_ManFree

(

Min_Man_t *

p

)

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

Synopsis [Stops the minimization manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 104 of file covMinMan.c.

{
    Extra_MmFixedStop( p->pMemMan );
    ABC_FREE( p->ppStore );
    ABC_FREE( p );
}

void Min_SopAddCube	(	Min_Man_t *	p,
		Min_Cube_t *	pCube
	)

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

Synopsis [Adds the cube to storage.]

Description []

SideEffects []

SeeAlso []

Definition at line 433 of file covMinSop.c.

{
    assert( Min_CubeCheck( pCube ) );
    assert( pCube != p->pBubble );
    assert( (int)pCube->nLits == Min_CubeCountLits(pCube) );
    while ( Min_SopAddCubeInt( p, pCube ) );
}

void Min_SopMinimize

(

Min_Man_t *

p

)

FUNCTION DEFINITIONS ///.

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 47 of file covMinSop.c.

{
    int nCubesInit, nCubesOld, nIter;
    if ( p->nCubes < 3 )
        return;
    nIter = 0;
    nCubesInit = p->nCubes;
    do {
        nCubesOld = p->nCubes;
        Min_SopRewrite( p );
        nIter++;
//    printf( "%d:%d->%d ", nIter, nCubesInit, p->nCubes );
    }
    while ( 100.0*(nCubesOld - p->nCubes)/nCubesOld > 3.0 );
//    printf( "\n" );

}