/**Function*************************************************************
Synopsis [Returns the number of words used.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Gia_ManSatPartCreate_rec( Gia_Man_t * p, Gia_Obj_t * pObj, int * pObjPlace, int * pStore )
{
Gia_Obj_t * pFanin;
int i, nWordsUsed, nSuperSize = 0, Super[2*GIA_LIMIT];
// make sure this is a valid node
assert( Gia_ObjIsAnd(pObj) );
assert( pObj->fMark0 == 0 );
// collect inputs to the supergate
Gia_ManSatPartCollectSuper( p, pObj, Super, &nSuperSize );
assert( nSuperSize <= 2*GIA_LIMIT );
// create the root entry
*pObjPlace = 0;
((Gia_ObjSat1_t *)pObjPlace)->nFans = Gia_Var2Lit( nSuperSize, 0 );
((Gia_ObjSat1_t *)pObjPlace)->nOffset = pStore - pObjPlace;
nWordsUsed = nSuperSize;
for ( i = 0; i < nSuperSize; i++ )
{
pFanin = Gia_ManObj( p, Gia_Lit2Var(Super[i]) );
if ( pFanin->fMark0 )
{
((Gia_ObjSat2_t *)(pStore + i))->fTerm = 1;
((Gia_ObjSat2_t *)(pStore + i))->iLit = Super[i];
}
else
{
assert( Gia_LitIsCompl(Super[i]) );
nWordsUsed += Gia_ManSatPartCreate_rec( p, pFanin, pStore + i, pStore + nWordsUsed );
}
}
return nWordsUsed;
}
/**Function*************************************************************
Synopsis [Derives combinational miter of the two AIGs.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Gia_ManFromAig_rec( Gia_Man_t * pNew, Aig_Man_t * p, Aig_Obj_t * pObj )
{
Aig_Obj_t * pNext;
if ( pObj->iData )
return;
assert( Aig_ObjIsNode(pObj) );
Gia_ManFromAig_rec( pNew, p, Aig_ObjFanin0(pObj) );
Gia_ManFromAig_rec( pNew, p, Aig_ObjFanin1(pObj) );
pObj->iData = Gia_ManAppendAnd( pNew, Gia_ObjChild0Copy(pObj), Gia_ObjChild1Copy(pObj) );
if ( p->pEquivs && (pNext = Aig_ObjEquiv(p, pObj)) )
{
int iObjNew, iNextNew;
Gia_ManFromAig_rec( pNew, p, pNext );
iObjNew = Gia_Lit2Var(pObj->iData);
iNextNew = Gia_Lit2Var(pNext->iData);
if ( pNew->pNexts )
pNew->pNexts[iObjNew] = iNextNew;
}
}