diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2016-03-29 20:16:30 -0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2016-03-29 20:16:30 -0700 |
commit | 31430043c219a29bc261a28a909ecb284b67de60 (patch) | |
tree | a7747c1c2cc4cab343cd5bdbc14d177e21fd9ce1 /src/aig | |
parent | e026f05ae3c436f825eb9b5f788a3c5f33e7bdad (diff) | |
download | abc-31430043c219a29bc261a28a909ecb284b67de60.tar.gz abc-31430043c219a29bc261a28a909ecb284b67de60.tar.bz2 abc-31430043c219a29bc261a28a909ecb284b67de60.zip |
Windowing for technology mapping.
Diffstat (limited to 'src/aig')
-rw-r--r-- | src/aig/gia/gia.h | 33 | ||||
-rw-r--r-- | src/aig/gia/giaIf.c | 24 | ||||
-rw-r--r-- | src/aig/gia/giaMan.c | 2 | ||||
-rw-r--r-- | src/aig/gia/giaSplit.c | 385 | ||||
-rw-r--r-- | src/aig/gia/module.make | 1 |
5 files changed, 432 insertions, 13 deletions
diff --git a/src/aig/gia/gia.h b/src/aig/gia/gia.h index 19c984a3..a6ff65f2 100644 --- a/src/aig/gia/gia.h +++ b/src/aig/gia/gia.h @@ -112,6 +112,7 @@ struct Gia_Man_t_ int fAddStrash; // performs additional structural hashing int fSweeper; // sweeper is running int * pRefs; // the reference count + int * pLutRefs; // the reference count Vec_Int_t * vLevels; // levels of the nodes int nLevels; // the mamixum level int nConstrs; // the number of constraints @@ -536,18 +537,25 @@ static inline void Gia_ObjSetNumId( Gia_Man_t * p, int Id, int n ) static inline void Gia_ObjSetNum( Gia_Man_t * p, Gia_Obj_t * pObj, int n ) { Vec_IntWriteEntry(p->vTtNums, Gia_ObjId(p,pObj), n); } static inline void Gia_ObjResetNumId( Gia_Man_t * p, int Id ) { Vec_IntWriteEntry(p->vTtNums, Id, -ABC_INFINITY); } -static inline int Gia_ObjRefNumId( Gia_Man_t * p, int Id ) { return p->pRefs[Id]; } -static inline int Gia_ObjRefIncId( Gia_Man_t * p, int Id ) { return p->pRefs[Id]++; } -static inline int Gia_ObjRefDecId( Gia_Man_t * p, int Id ) { return --p->pRefs[Id]; } -static inline int Gia_ObjRefNum( Gia_Man_t * p, Gia_Obj_t * pObj ) { return Gia_ObjRefNumId( p, Gia_ObjId(p, pObj) ); } -static inline int Gia_ObjRefInc( Gia_Man_t * p, Gia_Obj_t * pObj ) { return Gia_ObjRefIncId( p, Gia_ObjId(p, pObj) ); } -static inline int Gia_ObjRefDec( Gia_Man_t * p, Gia_Obj_t * pObj ) { return Gia_ObjRefDecId( p, Gia_ObjId(p, pObj) ); } -static inline void Gia_ObjRefFanin0Inc(Gia_Man_t * p, Gia_Obj_t * pObj){ Gia_ObjRefInc(p, Gia_ObjFanin0(pObj)); } -static inline void Gia_ObjRefFanin1Inc(Gia_Man_t * p, Gia_Obj_t * pObj){ Gia_ObjRefInc(p, Gia_ObjFanin1(pObj)); } -static inline void Gia_ObjRefFanin2Inc(Gia_Man_t * p, Gia_Obj_t * pObj){ Gia_ObjRefInc(p, Gia_ObjFanin2(p, pObj)); } -static inline void Gia_ObjRefFanin0Dec(Gia_Man_t * p, Gia_Obj_t * pObj){ Gia_ObjRefDec(p, Gia_ObjFanin0(pObj)); } -static inline void Gia_ObjRefFanin1Dec(Gia_Man_t * p, Gia_Obj_t * pObj){ Gia_ObjRefDec(p, Gia_ObjFanin1(pObj)); } -static inline void Gia_ObjRefFanin2Dec(Gia_Man_t * p, Gia_Obj_t * pObj){ Gia_ObjRefDec(p, Gia_ObjFanin2(p, pObj)); } +static inline int Gia_ObjRefNumId( Gia_Man_t * p, int Id ) { return p->pRefs[Id]; } +static inline int Gia_ObjRefIncId( Gia_Man_t * p, int Id ) { return p->pRefs[Id]++; } +static inline int Gia_ObjRefDecId( Gia_Man_t * p, int Id ) { return --p->pRefs[Id]; } +static inline int Gia_ObjRefNum( Gia_Man_t * p, Gia_Obj_t * pObj ) { return Gia_ObjRefNumId( p, Gia_ObjId(p, pObj) ); } +static inline int Gia_ObjRefInc( Gia_Man_t * p, Gia_Obj_t * pObj ) { return Gia_ObjRefIncId( p, Gia_ObjId(p, pObj) ); } +static inline int Gia_ObjRefDec( Gia_Man_t * p, Gia_Obj_t * pObj ) { return Gia_ObjRefDecId( p, Gia_ObjId(p, pObj) ); } +static inline void Gia_ObjRefFanin0Inc(Gia_Man_t * p, Gia_Obj_t * pObj) { Gia_ObjRefInc(p, Gia_ObjFanin0(pObj)); } +static inline void Gia_ObjRefFanin1Inc(Gia_Man_t * p, Gia_Obj_t * pObj) { Gia_ObjRefInc(p, Gia_ObjFanin1(pObj)); } +static inline void Gia_ObjRefFanin2Inc(Gia_Man_t * p, Gia_Obj_t * pObj) { Gia_ObjRefInc(p, Gia_ObjFanin2(p, pObj)); } +static inline void Gia_ObjRefFanin0Dec(Gia_Man_t * p, Gia_Obj_t * pObj) { Gia_ObjRefDec(p, Gia_ObjFanin0(pObj)); } +static inline void Gia_ObjRefFanin1Dec(Gia_Man_t * p, Gia_Obj_t * pObj) { Gia_ObjRefDec(p, Gia_ObjFanin1(pObj)); } +static inline void Gia_ObjRefFanin2Dec(Gia_Man_t * p, Gia_Obj_t * pObj) { Gia_ObjRefDec(p, Gia_ObjFanin2(p, pObj)); } + +static inline int Gia_ObjLutRefNumId( Gia_Man_t * p, int Id ) { assert(p->pLutRefs); return p->pLutRefs[Id]; } +static inline int Gia_ObjLutRefIncId( Gia_Man_t * p, int Id ) { assert(p->pLutRefs); return p->pLutRefs[Id]++; } +static inline int Gia_ObjLutRefDecId( Gia_Man_t * p, int Id ) { assert(p->pLutRefs); return --p->pLutRefs[Id]; } +static inline int Gia_ObjLutRefNum( Gia_Man_t * p, Gia_Obj_t * pObj ) { assert(p->pLutRefs); return p->pLutRefs[Gia_ObjId(p, pObj)]; } +static inline int Gia_ObjLutRefInc( Gia_Man_t * p, Gia_Obj_t * pObj ) { assert(p->pLutRefs); return p->pLutRefs[Gia_ObjId(p, pObj)]++; } +static inline int Gia_ObjLutRefDec( Gia_Man_t * p, Gia_Obj_t * pObj ) { assert(p->pLutRefs); return --p->pLutRefs[Gia_ObjId(p, pObj)]; } static inline void Gia_ObjSetTravIdCurrent( Gia_Man_t * p, Gia_Obj_t * pObj ) { assert( Gia_ObjId(p, pObj) < p->nTravIdsAlloc ); p->pTravIds[Gia_ObjId(p, pObj)] = p->nTravIds; } static inline void Gia_ObjSetTravIdPrevious( Gia_Man_t * p, Gia_Obj_t * pObj ) { assert( Gia_ObjId(p, pObj) < p->nTravIdsAlloc ); p->pTravIds[Gia_ObjId(p, pObj)] = p->nTravIds - 1; } @@ -1251,6 +1259,7 @@ extern int Gia_ManLutNum( Gia_Man_t * p ); extern int Gia_ManLutLevel( Gia_Man_t * p ); extern void Gia_ManLutParams( Gia_Man_t * p, int * pnCurLuts, int * pnCurEdges, int * pnCurLevels ); extern void Gia_ManSetRefsMapped( Gia_Man_t * p ); +extern void Gia_ManSetLutRefs( Gia_Man_t * p ); extern void Gia_ManSetIfParsDefault( void * pIfPars ); extern void Gia_ManMappingVerify( Gia_Man_t * p ); extern void Gia_ManTransferMapping( Gia_Man_t * p, Gia_Man_t * pGia ); diff --git a/src/aig/gia/giaIf.c b/src/aig/gia/giaIf.c index 8383433f..d93390e3 100644 --- a/src/aig/gia/giaIf.c +++ b/src/aig/gia/giaIf.c @@ -257,6 +257,30 @@ void Gia_ManSetRefsMapped( Gia_Man_t * p ) /**Function************************************************************* + Synopsis [Assigns levels.] + + Description [] + + SideEffects [] + + SeeAlso [] + +***********************************************************************/ +void Gia_ManSetLutRefs( Gia_Man_t * p ) +{ + Gia_Obj_t * pObj; + int i, k, iFan; + ABC_FREE( p->pLutRefs ); + p->pLutRefs = ABC_CALLOC( int, Gia_ManObjNum(p) ); + Gia_ManForEachCo( p, pObj, i ) + Gia_ObjLutRefInc( p, Gia_ObjFanin0(pObj) ); + Gia_ManForEachLut( p, i ) + Gia_LutForEachFanin( p, i, iFan, k ) + Gia_ObjLutRefInc( p, Gia_ManObj(p, iFan) ); +} + +/**Function************************************************************* + Synopsis [Calculate mapping overlap.] Description [] diff --git a/src/aig/gia/giaMan.c b/src/aig/gia/giaMan.c index bae40c9a..cba58b3c 100644 --- a/src/aig/gia/giaMan.c +++ b/src/aig/gia/giaMan.c @@ -136,7 +136,7 @@ void Gia_ManStop( Gia_Man_t * p ) ABC_FREE( p->pNexts ); ABC_FREE( p->pSibls ); ABC_FREE( p->pRefs ); -// ABC_FREE( p->pNodeRefs ); + ABC_FREE( p->pLutRefs ); ABC_FREE( p->pHTable ); ABC_FREE( p->pMuxes ); ABC_FREE( p->pObjs ); diff --git a/src/aig/gia/giaSplit.c b/src/aig/gia/giaSplit.c new file mode 100644 index 00000000..c2e2d448 --- /dev/null +++ b/src/aig/gia/giaSplit.c @@ -0,0 +1,385 @@ +/**CFile**************************************************************** + + FileName [giaSplit.c] + + SystemName [ABC: Logic synthesis and verification system.] + + PackageName [Scalable AIG package.] + + Synopsis [Structural AIG splitting.] + + Author [Alan Mishchenko] + + Affiliation [UC Berkeley] + + Date [Ver. 1.0. Started - June 20, 2005.] + + Revision [$Id: giaSplit.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $] + +***********************************************************************/ + +#include "gia.h" +#include "misc/extra/extra.h" + +ABC_NAMESPACE_IMPL_START + + +//////////////////////////////////////////////////////////////////////// +/// DECLARATIONS /// +//////////////////////////////////////////////////////////////////////// + +typedef struct Spl_Man_t_ Spl_Man_t; +struct Spl_Man_t_ +{ + // input data + Gia_Man_t * pGia; // user AIG with nodes marked + int iObj; // object ID + int Limit; // limit on AIG nodes + int Count; // count of AIG nodes + // intermediate + Vec_Bit_t * vMarksCIO; // CI/CO marks + Vec_Bit_t * vMarksIn; // input marks + Vec_Bit_t * vMarksNo; // node marks + Vec_Int_t * vNodes; // nodes used in the window + Vec_Int_t * vRoots; // nodes pointing to Nodes + Vec_Int_t * vLeaves; // nodes pointed by Nodes + // temporary + Vec_Int_t * vFanouts; // fanouts of the node + Vec_Int_t * vCands; // candidate nodes + Vec_Int_t * vInputs; // non-trivial inputs +}; + +//////////////////////////////////////////////////////////////////////// +/// FUNCTION DEFINITIONS /// +//////////////////////////////////////////////////////////////////////// + +/**Function************************************************************* + + Synopsis [] + + Description [] + + SideEffects [] + + SeeAlso [] + +***********************************************************************/ +Spl_Man_t * Spl_ManAlloc( Gia_Man_t * pGia, int Limit ) +{ + int i, iObj; + Spl_Man_t * p = ABC_CALLOC( Spl_Man_t, 1 ); + assert( Gia_ManHasMapping(pGia) ); + p->pGia = pGia; + p->Limit = Limit; + // intermediate + p->vMarksCIO = Vec_BitStart( Gia_ManObjNum(pGia) ); + p->vMarksIn = Vec_BitStart( Gia_ManObjNum(pGia) ); + p->vMarksNo = Vec_BitStart( Gia_ManObjNum(pGia) ); + p->vRoots = Vec_IntAlloc( 100 ); + p->vNodes = Vec_IntAlloc( 100 ); + p->vLeaves = Vec_IntAlloc( 100 ); + // temporary + p->vFanouts = Vec_IntAlloc( 100 ); + p->vCands = Vec_IntAlloc( 100 ); + p->vInputs = Vec_IntAlloc( 100 ); + // mark CIs/COs + Gia_ManForEachCiId( pGia, iObj, i ) + Vec_BitWriteEntry( p->vMarksCIO, iObj, 1 ); + Gia_ManForEachCoId( pGia, iObj, i ) + Vec_BitWriteEntry( p->vMarksCIO, iObj, 1 ); + // prepare AIG + Gia_ManStaticFanoutStart( pGia ); + Gia_ManSetLutRefs( pGia ); + Gia_ManCreateRefs( pGia ); + return p; +} +void Spl_ManStop( Spl_Man_t * p ) +{ + Gia_ManStaticFanoutStop( p->pGia ); + // intermediate + Vec_BitFree( p->vMarksCIO ); + Vec_BitFree( p->vMarksIn ); + Vec_BitFree( p->vMarksNo ); + Vec_IntFree( p->vRoots ); + Vec_IntFree( p->vNodes ); + Vec_IntFree( p->vLeaves ); + // temporary + Vec_IntFree( p->vFanouts ); + Vec_IntFree( p->vCands ); + Vec_IntFree( p->vInputs ); + ABC_FREE( p ); +} + +/**Function************************************************************* + + Synopsis [Takes Nodes and Marks. Returns Leaves and Roots.] + + Description [] + + SideEffects [] + + SeeAlso [] + +***********************************************************************/ +void Spl_ManWinFindLeavesRoots( Spl_Man_t * p ) +{ + int iObj, iFan, i, k; + // collect leaves + Vec_IntClear( p->vLeaves ); + Vec_IntForEachEntry( p->vNodes, iObj, i ) + { + assert( Vec_BitEntry(p->vMarksNo, iObj) ); + Gia_LutForEachFanin( p->pGia, iObj, iFan, k ) + if ( !Vec_BitEntry(p->vMarksNo, iFan) ) + { + Vec_BitWriteEntry(p->vMarksNo, iFan, 1); + Vec_IntPush( p->vLeaves, iFan ); + } + } + Vec_IntForEachEntry( p->vLeaves, iObj, i ) + Vec_BitWriteEntry(p->vMarksNo, iObj, 0); + // collect roots + Vec_IntClear( p->vRoots ); + Vec_IntForEachEntry( p->vNodes, iObj, i ) + Gia_LutForEachFanin( p->pGia, iObj, iFan, k ) + Gia_ObjLutRefDecId( p->pGia, iFan ); + Vec_IntForEachEntry( p->vNodes, iObj, i ) + if ( Gia_ObjLutRefNumId(p->pGia, iObj) ) + Vec_IntPush( p->vRoots, iObj ); + Vec_IntForEachEntry( p->vNodes, iObj, i ) + Gia_LutForEachFanin( p->pGia, iObj, iFan, k ) + Gia_ObjLutRefIncId( p->pGia, iFan ); +} + + + + +/**Function************************************************************* + + Synopsis [Computes LUTs that are fanouts of the node outside of the cone.] + + Description [] + + SideEffects [] + + SeeAlso [] + +***********************************************************************/ +void Spl_ManLutFanouts_rec( Gia_Man_t * p, int iObj, Vec_Int_t * vFanouts, Vec_Bit_t * vMarksNo, Vec_Bit_t * vMarksCIO ) +{ + int iFanout, i; + if ( Vec_BitEntry(vMarksNo, iObj) || Vec_BitEntry(vMarksCIO, iObj) ) + return; + if ( Gia_ObjIsLut(p, iObj) ) + { + Vec_BitWriteEntry( vMarksCIO, iObj, 1 ); + Vec_IntPush( vFanouts, iObj ); + return; + } + Gia_ObjForEachFanoutStaticId( p, iObj, iFanout, i ) + Spl_ManLutFanouts_rec( p, iFanout, vFanouts, vMarksNo, vMarksCIO ); +} +int Spl_ManLutFanouts( Gia_Man_t * p, int iObj, Vec_Int_t * vFanouts, Vec_Bit_t * vMarksNo, Vec_Bit_t * vMarksCIO ) +{ + int i, iFanout; + assert( Gia_ObjIsLut(p, iObj) ); + Vec_IntClear( vFanouts ); + Gia_ObjForEachFanoutStaticId( p, iObj, iFanout, i ) + Spl_ManLutFanouts_rec( p, iFanout, vFanouts, vMarksNo, vMarksCIO ); + // clean up + Vec_IntForEachEntry( vFanouts, iFanout, i ) + Vec_BitWriteEntry( vMarksCIO, iFanout, 0 ); + return Vec_IntSize(vFanouts); +} + + +/**Function************************************************************* + + Synopsis [Compute MFFC size of one node.] + + Description [] + + SideEffects [] + + SeeAlso [] + +***********************************************************************/ +int Spl_ManLutMffcSize( Gia_Man_t * p, int iObj ) +{ + int Res, iFan, i; + assert( Gia_ObjIsLut(p, iObj) ); + Gia_LutForEachFanin( p, iObj, iFan, i ) + Gia_ObjRefIncId( p, iFan ); + Res = Gia_NodeMffcSize( p, Gia_ManObj(p, iObj) ); + Gia_LutForEachFanin( p, iObj, iFan, i ) + Gia_ObjRefDecId( p, iFan ); + return Res; +} + +/**Function************************************************************* + + Synopsis [Returns the number of fanins not beloning to the set.] + + Description [] + + SideEffects [] + + SeeAlso [] + +***********************************************************************/ +int Spl_ManCountMarkedFanins( Gia_Man_t * p, int iObj, Vec_Bit_t * vMarks ) +{ + int k, iFan, Count = 0; + Gia_LutForEachFanin( p, iObj, iFan, k ) + if ( Vec_BitEntry(vMarks, iFan) ) + Count++; + return Count; +} + +/**Function************************************************************* + + Synopsis [] + + Description [] + + SideEffects [] + + SeeAlso [] + +***********************************************************************/ +int Spl_ManFindOne( Spl_Man_t * p ) +{ + int nFanouts, iObj, iFan, i, k; + int Res = 0, InCount, InCountMax = -1; + Vec_IntClear( p->vCands ); + Vec_IntClear( p->vInputs ); + // deref + Vec_IntForEachEntry( p->vNodes, iObj, i ) + Gia_LutForEachFanin( p->pGia, iObj, iFan, k ) + Gia_ObjLutRefDecId( p->pGia, iFan ); + // consider LUT inputs - get one that has no refs + Vec_IntForEachEntry( p->vNodes, iObj, i ) + Gia_LutForEachFanin( p->pGia, iObj, iFan, k ) + if ( !Vec_BitEntry(p->vMarksNo, iFan) && !Vec_BitEntry(p->vMarksCIO, iFan) ) + { + if ( !Gia_ObjLutRefNumId(p->pGia, iFan) ) + { + Res = iFan; + goto finish; + } + Vec_IntPush( p->vCands, iFan ); + Vec_IntPush( p->vInputs, iFan ); + } + + // all inputs have refs - collect external nodes + Vec_IntForEachEntry( p->vNodes, iObj, i ) + { + if ( Gia_ObjLutRefNumId(p->pGia, iObj) == 0 ) + continue; + assert( Gia_ObjLutRefNumId(p->pGia, iObj) > 0 ); + if ( Gia_ObjLutRefNumId(p->pGia, iObj) >= 5 ) + continue; + nFanouts = Spl_ManLutFanouts( p->pGia, iObj, p->vFanouts, p->vMarksNo, p->vMarksCIO ); + if ( Gia_ObjLutRefNumId(p->pGia, iObj) == 1 && nFanouts == 1 ) + { + Res = Vec_IntEntry(p->vFanouts, 0); + goto finish; + } + Vec_IntAppend( p->vCands, p->vFanouts ); + } + + // mark leaves + Vec_IntForEachEntry( p->vInputs, iObj, i ) + Vec_BitWriteEntry( p->vMarksIn, iObj, 1 ); + // find candidate with maximum input overlap + Vec_IntForEachEntry( p->vCands, iObj, i ) + { + InCount = Spl_ManCountMarkedFanins( p->pGia, iObj, p->vMarksIn ); + if ( InCountMax < InCount ) + { + InCountMax = InCount; + Res = iObj; + } + } + // unmark leaves + Vec_IntForEachEntry( p->vInputs, iObj, i ) + Vec_BitWriteEntry( p->vMarksIn, iObj, 0 ); + + // get the first candidate + if ( Res == 0 && Vec_IntSize(p->vCands) > 0 ) + Res = Vec_IntEntry( p->vCands, 0 ); + +finish: + // deref + Vec_IntForEachEntry( p->vNodes, iObj, i ) + Gia_LutForEachFanin( p->pGia, iObj, iFan, k ) + Gia_ObjLutRefIncId( p->pGia, iFan ); + return Res; +} + + + +/**Function************************************************************* + + Synopsis [] + + Description [] + + SideEffects [] + + SeeAlso [] + +***********************************************************************/ +void Spl_ManComputeOne( Spl_Man_t * p, int iPivot ) +{ + int CountAdd, iObj, i; + assert( Gia_ObjIsLut(p->pGia, iPivot) ); + // assume it was previously filled in + Vec_IntForEachEntry( p->vNodes, iObj, i ) + Vec_BitWriteEntry( p->vMarksNo, iObj, 0 ); + // double check that it is empty + //Gia_ManForEachLut( p->pGia, iObj ) + // assert( !Vec_BitEntry(p->vMarksNo, iObj) ); + // add root node + Vec_IntFill( p->vNodes, 1, iPivot ); + Vec_BitWriteEntry( p->vMarksNo, iPivot, 1 ); + //printf( "%d ", iPivot ); + // add one node at a time + p->Count = Spl_ManLutMffcSize( p->pGia, iPivot ); + while ( (iObj = Spl_ManFindOne(p)) ) + { + assert( Gia_ObjIsLut(p->pGia, iObj) ); + CountAdd = Spl_ManLutMffcSize( p->pGia, iObj ); + if ( p->Count + CountAdd > p->Limit ) + break; + p->Count += CountAdd; + Vec_IntPush( p->vNodes, iObj ); + Vec_BitWriteEntry( p->vMarksNo, iObj, 1 ); + //printf( "+%d ", iObj ); + } + //printf( "\n" ); + Vec_IntSort( p->vNodes, 0 ); +} + +void Spl_ManComputeOneTest( Gia_Man_t * pGia ) +{ + int iLut; + Spl_Man_t * p = Spl_ManAlloc( pGia, 64 ); + Gia_ManForEachLut( pGia, iLut ) + { + Spl_ManComputeOne( p, iLut ); + Spl_ManWinFindLeavesRoots( p ); + // Vec_IntPrint( p->vNodes ); + printf( "Obj = %6d : Leaf = %2d. Node = %2d. Root = %2d. AND = %3d.\n", + iLut, Vec_IntSize(p->vLeaves), Vec_IntSize(p->vNodes), Vec_IntSize(p->vRoots), p->Count ); + } + Spl_ManStop( p ); +} + +//////////////////////////////////////////////////////////////////////// +/// END OF FILE /// +//////////////////////////////////////////////////////////////////////// + + +ABC_NAMESPACE_IMPL_END + diff --git a/src/aig/gia/module.make b/src/aig/gia/module.make index db492759..b69c5bb6 100644 --- a/src/aig/gia/module.make +++ b/src/aig/gia/module.make @@ -65,6 +65,7 @@ SRC += src/aig/gia/giaAig.c \ src/aig/gia/giaSim2.c \ src/aig/gia/giaSort.c \ src/aig/gia/giaSpeedup.c \ + src/aig/gia/giaSplit.c \ src/aig/gia/giaStg.c \ src/aig/gia/giaStr.c \ src/aig/gia/giaSupMin.c \ |