Rewire::Miaig Class Reference

#include <rewire_miaig.h>

Public Member Functions
	Miaig (void)
	~Miaig (void)
	Miaig (const Miaig &m)
Miaig &	operator= (const Miaig &m)
	Miaig (int nIns, int nOuts, int nObjsAlloc)
	Miaig (Gia_Man_t *pGia)
	Miaig (Abc_Ntk_t *pNtk)
	Miaig (Mini_Aig_t *pMiniAig)
void	setExc (Gia_Man_t *pExc)
void	addref (void)
void	release (void)
bool	operator== (const Miaig &m) const
int	fromGia (Gia_Man_t *pGia)
int	fromMiniAig (Mini_Aig_t *pMiniAig)
int &	nIns (void)
int &	nOuts (void)
int &	nObjs (void)
int &	nObjsAlloc (void)
int	objIsPi (int i)
int	objIsPo (int i)
int	objIsNode (int i)
int	objPiIdx (int i)
int	objPoIdx (int i)
void	print (void)
int	appendObj (void)
void	appendFanin (int i, int iLit)
int	objFaninNum (int i)
int	objFanin0 (int i)
int	objFanin1 (int i)
int &	objLevel (int i)
int &	objRef (int i)
int &	objTravId (int i)
int &	objCopy (int i)
int &	objDist (int i)
int &	nTravIds (void)
word *	objTruth (int i, int n)
vi *	objFanins (int i)
int	objType (int i)
int	nWords (void)
void	refObj (int iObj)
void	derefObj (int iObj)
void	derefObj_rec (int iObj, int iLitSkip)
void	setName (char *pName)
float	countAnd2 (int reset=0, int fDummy=0)
float	countTransistors (int reset=0, int nMode=0)
int	countLevel (int min=0)
Miaig	dup (int fRemDangle, int fMapped=0)
Miaig	dupDfs (void)
Miaig	dupStrash (int fCprop, int fStrash, int fCascade)
Miaig	dupMulti (int nFaninMax_, int nGrowth)
Miaig	expand (int nFaninAddLimitAll, int nDist, int nExpandableLevel, word *pExc, int fCheck, int nVerbose)
Miaig	share (int nNewNodesMax)
Miaig	reduce (word *pExc, int fCheck, int fVerbose)
Miaig	expandThenReduce (int nFaninAddLimit, int nDist, int nExpandableLevel, word *pExc, int fCheck, int fVerbose)
Miaig	expandShareReduce (int nFaninAddLimitAll, int nDivs, int nDist, int nExpandableLevel, word *pExc, int fCheck, int nVerbose)
Miaig	rewire (int nIters, float levelGrowRatio, int nExpands, int nGrowth, int nDivs, int nFaninMax, int nTimeOut, int nMode, int nMappedMode, int nDist, int fCheck, Gia_ChMan_t *pChMan, int nVerbose)
Gia_Man_t *	toGia (void)
Abc_Ntk_t *	toNtk (int fMapped=0)
Mini_Aig_t *	toMiniAig (void)

Detailed Description

Definition at line 191 of file rewire_miaig.h.

Constructor & Destructor Documentation

Miaig() [1/6]

Rewire::Miaig::Miaig ( void )

inline

Definition at line 332 of file rewire_miaig.h.

    : _refcount(nullptr), _data(nullptr) {
}

Here is the caller graph for this function:

~Miaig()

Rewire::Miaig::~Miaig ( void )

inline

Definition at line 357 of file rewire_miaig.h.

                         {
    release();
}

Here is the call graph for this function:

Miaig() [2/6]

Rewire::Miaig::Miaig ( const Miaig & m )

inline

Definition at line 361 of file rewire_miaig.h.

    : _refcount(m._refcount), _data(m._data) {
    addref();
}

Here is the call graph for this function:

Miaig() [3/6]

Rewire::Miaig::Miaig ( int nIns, int nOuts, int nObjsAlloc )

inline

Definition at line 336 of file rewire_miaig.h.

    : Miaig() {
    create(nIns, nOuts, nObjsAlloc);
}

Here is the call graph for this function:

Miaig() [4/6]

Rewire::Miaig::Miaig ( Gia_Man_t * pGia )

inline

Definition at line 342 of file rewire_miaig.h.

                                   : Miaig() {
    fromGia(pGia);
}

Here is the call graph for this function:

Miaig() [5/6]

Rewire::Miaig::Miaig ( Abc_Ntk_t * pNtk )

inline

Definition at line 346 of file rewire_miaig.h.

                                   : Miaig() {
    Mini_Aig_t *pMiniAig = Abc_ManRewireMiniAigFromNtk(pNtk);
    fromMiniAig(pMiniAig);
    Mini_AigStop(pMiniAig);
}

Here is the call graph for this function:

Miaig() [6/6]

Rewire::Miaig::Miaig ( Mini_Aig_t * pMiniAig )

inline

Definition at line 352 of file rewire_miaig.h.

                                        : Miaig() {
    fromMiniAig(pMiniAig);
}

Here is the call graph for this function:

Member Function Documentation

addref()

void Rewire::Miaig::addref ( void )

inline

Definition at line 383 of file rewire_miaig.h.

                              {
    if (_refcount) {
        RW_XADD(_refcount, 1);
    }
}

Here is the caller graph for this function:

appendFanin()

void Rewire::Miaig::appendFanin ( int i, int iLit )

inline

Definition at line 467 of file rewire_miaig.h.

                                              {
    Vi_PushOrder(objFanins(i), iLit);
}

Here is the call graph for this function:

Here is the caller graph for this function:

appendObj()

int Rewire::Miaig::appendObj ( void )

inline

Definition at line 462 of file rewire_miaig.h.

                                {
    assert(nObjs() < nObjsAlloc());
    return nObjs()++;
}

Here is the call graph for this function:

Here is the caller graph for this function:

countAnd2()

float Rewire::Miaig::countAnd2 ( int reset = 0, int fDummy = 0 )

inline

Definition at line 512 of file rewire_miaig.h.

                                                   {
    int i, Counter = 0;
    Miaig_ForEachNode(i) {
        Counter += objFaninNum(i) - 1;
    }
    return Counter;
}

Here is the call graph for this function:

Here is the caller graph for this function:

countLevel()

int Rewire::Miaig::countLevel ( int min = 0 )

inline

Definition at line 520 of file rewire_miaig.h.

                                    {
    initializeLevels();
    int i, Level = (min) ? RW_INT_MAX : -1;
    int (*compareFunc)(int, int) = (min) ? Rw_MinInt : Rw_MaxInt;
    Miaig_ForEachOutput(i) {
        Level = compareFunc(Level, objLevel(i));
    }
    return Level;
}

Here is the call graph for this function:

Here is the caller graph for this function:

countTransistors()

float Rewire::Miaig::countTransistors	(	int	reset = 0,
		int	nMode = 0 )

Definition at line 272 of file rewire_miaig.cpp.

                                                        {
    if (!reset && _data->nTransistor) return _data->nTransistor;
#ifdef RW_ABC
    float area = 0;
    Abc_Ntk_t *pNtkMapped = NULL, *pNtkMappedTemp = NULL;
    if (nMappedMode == 0) {        // amap
        Abc_Ntk_t *pNtk = toNtk();
        pNtkMapped = Abc_ManRewireMapAmap(pNtk);
        Abc_NtkDelete(pNtk);
    } else if (nMappedMode == 1) { // &nf
        Gia_Man_t *pGia = toGia();
        pNtkMapped = Gia_ManRewireMapNf(pGia);
        Gia_ManStop(pGia);
    } else if (nMappedMode == 2) { // &simap
        Abc_Ntk_t *pNtk = toNtk();
        pNtkMapped = Abc_ManRewireMapAmap(pNtk);
        area = Abc_NtkGetMappedArea(pNtkMapped);
        Gia_Man_t *pGia = toGia();
        while ((pNtkMappedTemp = Gia_ManRewireMapSimap(pGia, area - 2, 0, 40))) {
            area -= 2;
            Abc_NtkDelete(pNtkMapped);
            pNtkMapped = pNtkMappedTemp;
        }
        Gia_ManStop(pGia);
    }
    if (pNtkMapped) {
        area = Abc_NtkGetMappedArea(pNtkMapped);
        Vec_Int_t *vMapping = Abc_ManRewireNtkWriteMiniMapping(pNtkMapped);
        _data->pNtkMapped = moveVecToVi(vMapping);
        Abc_NtkDelete(pNtkMapped);
    }
#else
    float area = countAnd2(reset, 0);
#endif // RW_ABC
 
    return _data->nTransistor = area;
}

Here is the call graph for this function:

Here is the caller graph for this function:

derefObj()

void Rewire::Miaig::derefObj

(

int

iObj

)

Definition at line 427 of file rewire_miaig.cpp.

                             {
    int k, iLit;
    Miaig_ForEachObjFanin(iObj, iLit, k)
        objRef(Rw_Lit2Var(iLit))--;
}

Here is the call graph for this function:

derefObj_rec()

void Rewire::Miaig::derefObj_rec	(	int	iObj,
		int	iLitSkip )

Definition at line 433 of file rewire_miaig.cpp.

                                               {
    int k, iLit;
    Miaig_ForEachObjFanin(iObj, iLit, k) { 
        if (iLit != iLitSkip && --objRef(Rw_Lit2Var(iLit)) == 0 && objIsNode(Rw_Lit2Var(iLit))) {
            derefObj_rec(Rw_Lit2Var(iLit), -1);
            Vi_Fill(objFanins(Rw_Lit2Var(iLit)), 1, 0);
            refObj(Rw_Lit2Var(iLit));
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

dup()

Miaig Rewire::Miaig::dup	(	int	fRemDangle,
		int	fMapped = 0 )

Definition at line 486 of file rewire_miaig.cpp.

                                            {
    // Miaig pNew = Maig_Alloc(nIns(), nOuts(), nObjs());
    Miaig pNew(nIns(), nOuts(), nObjs());
    memset(_data->pCopy, 0, sizeof(int) * nObjs());
    int i, k, iLit; // obj2obj
    if (fRemDangle)
        markDfs();
    Miaig_ForEachInput(i)
        objCopy(i) = i;
    Miaig_ForEachNodeOutput(i) {
        assert(objFaninNum(i) > 0);
        if (fRemDangle && objTravId(i) != nTravIds())
            continue;
        objCopy(i) = pNew.appendObj();
        Miaig_ForEachObjFanin(i, iLit, k)
            pNew.appendFanin(objCopy(i), Rw_Lit2LitV(_data->pCopy, iLit));
    }
    if (_data->pNtkMapped && fMapped)
        pNew._data->pNtkMapped = Vi_Dup(_data->pNtkMapped);
    return pNew;
}

Here is the call graph for this function:

Here is the caller graph for this function:

dupDfs()

Miaig Rewire::Miaig::dupDfs

(

void

)

Definition at line 527 of file rewire_miaig.cpp.

                        {
    Miaig pNew(nIns(), nOuts(), nObjsAlloc());
    // 1. the array is filled with -1 to distinct visited nodes from unvisited
    memset(_data->pCopy, 0xFF, sizeof(int) * nObjsAlloc());
    int i; // obj2obj
    // for each primary input we mark it with it's index
    Miaig_ForEachConstInput(i)
        objCopy(i) = i;
    // 2. for each primary output we call recursive function for it's fanin
    Miaig_ForEachOutput(i)
        dupDfs_rec(pNew, Rw_Lit2Var(objFanin0(i)));
    // 3. for each primary output append it's fanin
    Miaig_ForEachOutput(i)
        pNew.appendFanin(pNew.appendObj(), Rw_Lit2LitV(_data->pCopy, objFanin0(i)));
    return pNew;
}

Here is the call graph for this function:

Here is the caller graph for this function:

dupMulti()

Miaig Rewire::Miaig::dupMulti	(	int	nFaninMax_,
		int	nGrowth )

Definition at line 693 of file rewire_miaig.cpp.

                                                 {
    Miaig pNew(nIns(), nOuts(), nObjs());
    int *pStop = createStops();
    int i, k, iLit;
    vi *vArray = Vi_Alloc(100);
    assert(nFaninMax_ >= 2 && nGrowth >= 1);
    memset(_data->pCopy, 0, sizeof(int) * nObjs()); // obj2lit
    Miaig_ForEachConstInput(i)
        objCopy(i) = Rw_Var2Lit(i, 0);
    Miaig_ForEachNode(i) {
        if (pStop[i] == 1)
            continue;
        assert(pStop[i] > 1); // no dangling
        Vi_Shrink(vArray, 0);
        collectSuper_rec(objFanin0(i), pStop, vArray);
        collectSuper_rec(objFanin1(i), pStop, vArray);
        assert(Vi_Size(vArray) > 1);
        reduceFanins(vArray);
        assert(Vi_Size(vArray) > 0);
        if (Vi_Size(vArray) == 1)
            objCopy(i) = Vi_Read(vArray, 0);
        else {
            int nFaninMaxLocal = 2 + (Random_Num(0) % (nFaninMax_ - 1));
            int nGrowthLocal = 1 + (Random_Num(0) % nGrowth);
            assert(nFaninMaxLocal >= 2 && nFaninMaxLocal <= nFaninMax_);
            assert(nGrowthLocal >= 1 && nGrowthLocal <= nGrowth);
 
            if (Vi_Size(vArray) > nFaninMaxLocal)
                Vi_Randomize(vArray);
            // create a cascade of nodes
            while (Vi_Size(vArray) > nFaninMaxLocal) {
                int iObj = pNew.appendObj();
                vi *vFanins = pNew.objFanins(iObj);
                assert(vFanins->ptr == NULL);
                vFanins->cap = nFaninMaxLocal + nGrowthLocal;
                vFanins->ptr = (int *)malloc(sizeof(int) * vFanins->cap);
                Vi_ForEachEntryStop(vArray, iLit, k, nFaninMaxLocal)
                    pNew.appendFanin(iObj, iLit);
                assert(Vi_Space(vFanins) == nGrowthLocal);
                for (k = 0; k < nFaninMaxLocal; k++)
                    Vi_Drop(vArray, 0);
                Vi_Push(vArray, Rw_Var2Lit(iObj, 0));
            }
            // create the last node
            int iObj = pNew.appendObj();
            vi *vFanins = pNew.objFanins(iObj);
            assert(vFanins->ptr == NULL);
            vFanins->cap = Vi_Size(vArray) + nGrowthLocal;
            vFanins->ptr = (int *)malloc(sizeof(int) * vFanins->cap);
            Vi_ForEachEntry(vArray, iLit, k)
                pNew.appendFanin(iObj, iLit);
            assert(Vi_Space(vFanins) == nGrowthLocal);
            objCopy(i) = Rw_Var2Lit(iObj, 0);
        }
    }
    Miaig_ForEachOutput(i)
        pNew.appendFanin(pNew.appendObj(), Rw_Lit2LitL(_data->pCopy, objFanin0(i)));
    Vi_Free(vArray);
    free(pStop);
    return pNew;
}

Here is the call graph for this function:

Here is the caller graph for this function:

dupStrash()

Miaig Rewire::Miaig::dupStrash	(	int	fCprop,
		int	fStrash,
		int	fCascade )

Definition at line 643 of file rewire_miaig.cpp.

                                                            {
    int i, nObjsAlloc = 1 + nIns() + nOuts() + countAnd2();
    Miaig pNew(nIns(), nOuts(), nObjsAlloc);
    memset(_data->pCopy, 0, sizeof(int) * nObjs()); // obj2lit
    if (fStrash) {
        assert(pNew._data->pTable == NULL);
        pNew._data->TableSize = Abc_PrimeCudd(3 * countAnd2());
        pNew._data->pTable = (int *)calloc(sizeof(int), 3 * pNew._data->TableSize);
    }
    Miaig_ForEachInput(i)
        objCopy(i) = Rw_Var2Lit(i, 0);
    Miaig_ForEachNode(i) {
        assert(objFaninNum(i) > 0);
        if (fCascade)
            objCopy(i) = buildNodeCascade(pNew, objFanins(i), fCprop, fStrash);
        else
            objCopy(i) = buildNodeBalance(pNew, objFanins(i), fCprop, fStrash);
    }
    Miaig_ForEachOutput(i)
        pNew.appendFanin(pNew.appendObj(), Rw_Lit2LitL(_data->pCopy, objFanin0(i)));
    return pNew.dup(1);
}

Here is the call graph for this function:

Here is the caller graph for this function:

expand()

Miaig Rewire::Miaig::expand	(	int	nFaninAddLimitAll,
		int	nDist,
		int	nExpandableLevel,
		word *	pExc,
		int	fCheck,
		int	nVerbose )

Definition at line 1146 of file rewire_miaig.cpp.

                                                                                                                {
    int i, iNode, nAdded = 0;
    assert(nFaninAddLimitAll > 0);
    vi *vOrder = createRandomOrder();
 
    initializeTruth();
    initializeRefs();
    initializeLevels();
    if (nDist) initializeDists();
    Vi_ForEachEntry(vOrder, iNode, i) {
        nAdded += expandOne(iNode, std::min(Vi_Space(objFanins(iNode)), nFaninAddLimitAll - nAdded), nDist, nExpandableLevel, pExc, fCheck, fVerbose);
        if (nAdded >= nFaninAddLimitAll)
            break;
    }
    assert(nAdded <= nFaninAddLimitAll);
    if (fCheck) verifyRefs();
    return dupDfs();
}

Here is the call graph for this function:

Here is the caller graph for this function:

expandShareReduce()

Miaig Rewire::Miaig::expandShareReduce	(	int	nFaninAddLimitAll,
		int	nDivs,
		int	nDist,
		int	nExpandableLevel,
		word *	pExc,
		int	fCheck,
		int	nVerbose )

Definition at line 1208 of file rewire_miaig.cpp.

                                                                                                                                      {
    // expand
    Miaig pNew = expand(nFaninAddLimitAll, nDist, nExpandableLevel, pExc, fCheck, nVerbose);
    // share
    pNew = pNew.share(nDivs == -1 ? pNew.nObjs() : nDivs);
    // reduce
    pNew = pNew.reduce(pExc, fCheck, nVerbose);
    return pNew;
}

Here is the call graph for this function:

Here is the caller graph for this function:

expandThenReduce()

Miaig Rewire::Miaig::expandThenReduce	(	int	nFaninAddLimit,
		int	nDist,
		int	nExpandableLevel,
		word *	pExc,
		int	fCheck,
		int	fVerbose )

Definition at line 1192 of file rewire_miaig.cpp.

                                                                                                                       {
    Miaig pTemp;
    int i, iNode;
    vi *vOrder = topoCollect();
 
    initializeTruth();
    initializeRefs();
    initializeLevels();
    if (nDist) initializeDists();
    Vi_ForEachEntry(vOrder, iNode, i) {
        expandThenReduceOne(iNode, nFaninAddLimit, nDist, nExpandableLevel, pExc, fCheck, fVerbose);
    }
    if (fCheck) verifyRefs();
    return dupDfs().dupStrash(1, 1, 1);
}

Here is the call graph for this function:

Here is the caller graph for this function:

fromGia()

int Rewire::Miaig::fromGia

(

Gia_Man_t *

pGia

)

Definition at line 137 of file rewire_miaig.cpp.

                                  {
    Gia_Obj_t *pObj;
    int *pCopy = (int *)calloc(sizeof(int), Gia_ManObjNum(pGia)); // obj2obj
    // printf("[INFO] Converting GIA into MIAIG\n");
    // printf("[INFO] PI/PO/OBJ = %d/%d/%d\n", Gia_ManPiNum(pGia), Gia_ManPoNum(pGia), Gia_ManObjNum(pGia));
    create(Gia_ManPiNum(pGia), Gia_ManPoNum(pGia), Gia_ManObjNum(pGia));
    int i;
    pCopy[0] = Gia_ObjId(pGia, Gia_ManConst0(pGia));
    Miaig_ForEachInput(i) {
        pCopy[i] = i;
    }
    Gia_ManForEachAnd(pGia, pObj, i) {
        pCopy[i] = appendObj();
        assert(pCopy[i] == i);
        appendFanin(pCopy[i], Rw_Lit2LitV(pCopy, Gia_Obj2Lit(pGia, Gia_ObjChild1(pObj))));
        appendFanin(pCopy[i], Rw_Lit2LitV(pCopy, Gia_Obj2Lit(pGia, Gia_ObjChild0(pObj))));
    }
    Gia_ManForEachPo(pGia, pObj, i)
        appendFanin(appendObj(), Rw_Lit2LitV(pCopy, Gia_Obj2Lit(pGia, Gia_ObjChild0(pObj))));
    free(pCopy);
    return 1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

fromMiniAig()

int Rewire::Miaig::fromMiniAig

(

Mini_Aig_t *

pMiniAig

)

Definition at line 160 of file rewire_miaig.cpp.

                                           {
    int *pCopy = (int *)calloc(sizeof(int), Mini_AigNodeNum(pMiniAig)); // obj2obj
    create(Mini_AigPiNum(pMiniAig), Mini_AigPoNum(pMiniAig), Mini_AigNodeNum(pMiniAig));
    int i;
    Miaig_ForEachInput(i)
        pCopy[i] = i;  
    Mini_AigForEachAnd( pMiniAig, i ) {
        pCopy[i] = appendObj();
        assert( pCopy[i] == i );
        appendFanin(pCopy[i], Rw_Lit2LitV(pCopy, Mini_AigNodeFanin0(pMiniAig, i)));
        appendFanin(pCopy[i], Rw_Lit2LitV(pCopy, Mini_AigNodeFanin1(pMiniAig, i)));
    }
    Mini_AigForEachPo( pMiniAig, i )
        appendFanin(appendObj(), Rw_Lit2LitV(pCopy, Mini_AigNodeFanin0(pMiniAig, i)));
    free(pCopy);
    return 1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

nIns()

int & Rewire::Miaig::nIns ( void )

inline

Definition at line 424 of file rewire_miaig.h.

                            {
    return _data->nIns;
}

Here is the caller graph for this function:

nObjs()

int & Rewire::Miaig::nObjs ( void )

inline

Definition at line 432 of file rewire_miaig.h.

                             {
    return _data->nObjs;
}

Here is the caller graph for this function:

nObjsAlloc()

int & Rewire::Miaig::nObjsAlloc ( void )

inline

Definition at line 436 of file rewire_miaig.h.

                                  {
    return _data->nObjsAlloc;
}

Here is the caller graph for this function:

nOuts()

int & Rewire::Miaig::nOuts ( void )

inline

Definition at line 428 of file rewire_miaig.h.

                             {
    return _data->nOuts;
}

Here is the caller graph for this function:

nTravIds()

int & Rewire::Miaig::nTravIds ( void )

inline

Definition at line 504 of file rewire_miaig.h.

                                {
    return _data->nTravIds;
}

Here is the caller graph for this function:

nWords()

int Rewire::Miaig::nWords ( void )

inline

Definition at line 508 of file rewire_miaig.h.

                             {
    return _data->nWords;
}

Here is the caller graph for this function:

objCopy()

int & Rewire::Miaig::objCopy ( int i )

inline

Definition at line 496 of file rewire_miaig.h.

                                {
    return _data->pCopy[i];
}

Here is the caller graph for this function:

objDist()

int & Rewire::Miaig::objDist ( int i )

inline

Definition at line 500 of file rewire_miaig.h.

                                {
    return _data->pDist[i];
}

objFanin0()

int Rewire::Miaig::objFanin0 ( int i )

inline

Definition at line 475 of file rewire_miaig.h.

                                 {
    return Vi_Read(objFanins(i), 0);
}

Here is the call graph for this function:

Here is the caller graph for this function:

objFanin1()

int Rewire::Miaig::objFanin1 ( int i )

inline

Definition at line 479 of file rewire_miaig.h.

                                 {
    assert(objFaninNum(i) == 2);
    return Vi_Read(objFanins(i), 1);
}

Here is the call graph for this function:

Here is the caller graph for this function:

objFaninNum()

int Rewire::Miaig::objFaninNum ( int i )

inline

Definition at line 471 of file rewire_miaig.h.

                                   {
    return Vi_Size(objFanins(i));
}

Here is the call graph for this function:

Here is the caller graph for this function:

objFanins()

vi * Rewire::Miaig::objFanins ( int i )

inline

Definition at line 534 of file rewire_miaig.h.

                                 {
    return _data->pvFans + i;
}

Here is the caller graph for this function:

objIsNode()

int Rewire::Miaig::objIsNode ( int i )

inline

Definition at line 448 of file rewire_miaig.h.

                                 {
    return i > nIns() && i < nObjs() - nOuts();
}

Here is the call graph for this function:

Here is the caller graph for this function:

objIsPi()

int Rewire::Miaig::objIsPi ( int i )

inline

Definition at line 440 of file rewire_miaig.h.

                               {
    return i > 0 && i <= nIns();
}

Here is the call graph for this function:

objIsPo()

int Rewire::Miaig::objIsPo ( int i )

inline

Definition at line 444 of file rewire_miaig.h.

                               {
    return i >= nObjs() - nOuts();
}

Here is the call graph for this function:

objLevel()

int & Rewire::Miaig::objLevel ( int i )

inline

Definition at line 484 of file rewire_miaig.h.

                                 {
    return _data->pLevel[i];
}

Here is the caller graph for this function:

objPiIdx()

int Rewire::Miaig::objPiIdx ( int i )

inline

Definition at line 452 of file rewire_miaig.h.

                                {
    // assert(objIsPi(i));
    return i - 1;
}

objPoIdx()

int Rewire::Miaig::objPoIdx ( int i )

inline

Definition at line 457 of file rewire_miaig.h.

                                {
    // assert(objIsPo(i));
    return i - (nObjs() - nOuts());
}

Here is the call graph for this function:

objRef()

int & Rewire::Miaig::objRef ( int i )

inline

Definition at line 488 of file rewire_miaig.h.

                               {
    return _data->pRefs[i];
}

Here is the caller graph for this function:

objTravId()

int & Rewire::Miaig::objTravId ( int i )

inline

Definition at line 492 of file rewire_miaig.h.

                                  {
    return _data->pTravIds[i];
}

Here is the caller graph for this function:

objTruth()

word * Rewire::Miaig::objTruth ( int i, int n )

inline

Definition at line 530 of file rewire_miaig.h.

                                         {
    return _data->pTruths[n] + nWords() * i;
}

Here is the call graph for this function:

Here is the caller graph for this function:

objType()

int Rewire::Miaig::objType ( int i )

inline

Definition at line 538 of file rewire_miaig.h.

                               {
    return objTravId(i) == nTravIds();
}

Here is the call graph for this function:

operator=()

Miaig & Rewire::Miaig::operator= ( const Miaig & m )

inline

Definition at line 366 of file rewire_miaig.h.

                                             {
    if (this == &m) {
        return *this;
    }
 
    if (m._refcount) {
        RW_XADD(m._refcount, 1);
    }
 
    release();
 
    _refcount = m._refcount;
    _data = m._data;
 
    return *this;
}

Here is the call graph for this function:

operator==()

bool Rewire::Miaig::operator== ( const Miaig & m ) const

inline

Definition at line 420 of file rewire_miaig.h.

                                                  {
    return (_data == m._data);
}

Here is the call graph for this function:

print()

void Rewire::Miaig::print

(

void

)

Definition at line 116 of file rewire_miaig.cpp.

                      {
    int i, k, iLit;
    printf("\nAIG printout:\n");
    printf("Const0\n");
    Miaig_ForEachInput(i)
        printf("Pi%d\n", i);
    Miaig_ForEachNode(i) {
        printf("Node%d {", i);
        Miaig_ForEachObjFanin(i, iLit, k)
            printf(" %d", iLit);
        printf(" }\n");
    }
    Miaig_ForEachOutput(i) {
        printf("Po%d ", i);
        Miaig_ForEachObjFanin(i, iLit, k)
            printf(" %d", iLit);
        printf("\n");
    }
}

reduce()

Miaig Rewire::Miaig::reduce	(	word *	pExc,
		int	fCheck,
		int	fVerbose )

Definition at line 1178 of file rewire_miaig.cpp.

                                                        {
    int i, iNode;
    vi *vOrder = topoCollect();
 
    initializeTruth();
    initializeRefs();
    initializeLevels();
    // works best for final
    Vi_ForEachEntry(vOrder, iNode, i)
        reduceOne(iNode, 0, 0, 1, pExc, fCheck, fVerbose);
    if (fCheck) verifyRefs();
    return dupStrash(1, 1, 1);
}

Here is the call graph for this function:

Here is the caller graph for this function:

refObj()

void Rewire::Miaig::refObj

(

int

iObj

)

Definition at line 421 of file rewire_miaig.cpp.

                           {
    int k, iLit;
    Miaig_ForEachObjFanin(iObj, iLit, k)
        objRef(Rw_Lit2Var(iLit))++;
}

Here is the call graph for this function:

Here is the caller graph for this function:

release()

void Rewire::Miaig::release ( void )

inline

Definition at line 389 of file rewire_miaig.h.

                               {
    if (_refcount && RW_XADD(_refcount, -1) == 1) {
        if (_data) {
            if (_data->pName) free(_data->pName);
            for (int i = 0; i < _data->nObjsAlloc; ++i)
                if (_data->pvFans[i].ptr)
                    free(_data->pvFans[i].ptr);
            free(_data->pvFans);
            Vi_Free(_data->vOrder);
            Vi_Free(_data->vOrderF);
            Vi_Free(_data->vOrderF2);
            Vi_Free(_data->vTfo);
            free(_data->pTravIds);
            free(_data->pCopy);
            free(_data->pRefs);
            free(_data->pTruths[0]);
            if (_data->pCare) free(_data->pCare);
            if (_data->pProd) free(_data->pProd);
            if (_data->pExc) free(_data->pExc);
            if (_data->pLevel) free(_data->pLevel);
            if (_data->pDist) free(_data->pDist);
            if (_data->pTable) free(_data->pTable);
            if (_data->pNtkMapped) Vi_Free(_data->pNtkMapped);
            delete _data;
        }
    }
 
    _data = nullptr;
    _refcount = nullptr;
}

Here is the call graph for this function:

Here is the caller graph for this function:

rewire()

Miaig Rewire::Miaig::rewire	(	int	nIters,
		float	levelGrowRatio,
		int	nExpands,
		int	nGrowth,
		int	nDivs,
		int	nFaninMax,
		int	nTimeOut,
		int	nMode,
		int	nMappedMode,
		int	nDist,
		int	fCheck,
		Gia_ChMan_t *	pChMan,
		int	nVerbose )

Definition at line 1241 of file rewire_miaig.cpp.

                                                                                                                                                                                                             {
    const int nRootSave = 8;
    const int nBestSave = 4;
    int nRestart = 5000;
    std::vector<Miaig> pRoots = {this->dup(0)};
    std::vector<Miaig> pBests = {this->dup(0)}; Miaig pInit = pBests[0];
    iword clkStart = Time_Clock();
    Miaig pNew;
    Miaig pRoot = pRoots[0];
    Miaig pBest = this->dup(0); int improved = 0;
    float (Miaig::*Miaig_ObjectiveFunction)(int, int) = (nMode == 0) ? &Miaig::countAnd2 : &Miaig::countTransistors;
    int maxLevel = levelGrowRatio != 0 ? this->countLevel() * levelGrowRatio : 0;
    int nExpandableLevel = maxLevel ? maxLevel - this->countLevel() : 0;
    int fMapped = nMode > 0;
    word *pExc = _data->pExc;
 
    float PrevBest = ((&pBest)->*Miaig_ObjectiveFunction)(1, nMappedMode);
    int iterNotImproveAfterRestart = 0;
    if (nVerbose && maxLevel) printf("Max level         : %5d\n", maxLevel);
    if (nVerbose) printf("Initial target    : %5g (AND2 = %5g Level = %3d)\n", PrevBest, this->countAnd2(1), this->countLevel());
    for (int i = 0; nIters ? i < nIters : 1; i++) {
        if (nVerbose) printf("\rIteration %7d(%zu) : %5g -> ", i + 1, pBests.size(), ((&pRoot)->*Miaig_ObjectiveFunction)(0, nMappedMode));
        if (nTimeOut && nTimeOut < 1.0 * (Time_Clock() - clkStart) / CLOCKS_PER_SEC) break;
        if (PrevBest == 0) break;
        pNew = pRoot.dupMulti(nFaninMax, nGrowth);
 
        if (i % 2 == 0) {
            pNew = pNew.expandThenReduce(nGrowth, nDist, nExpandableLevel, pExc, fCheck, nVerbose > 1);
        }
        pNew = pNew.expandShareReduce(nExpands, nDivs, nDist, nExpandableLevel, pExc, fCheck, nVerbose > 1);
 
        ++iterNotImproveAfterRestart;
        // report
        float rootTarget = ((&pRoot)->*Miaig_ObjectiveFunction)(0, nMappedMode);
        float newTarget = ((&pNew)->*Miaig_ObjectiveFunction)(1, nMappedMode);
        if (maxLevel ? pNew.countLevel() > maxLevel : 0) {
        } else if (PrevBest > newTarget) {
            if (nVerbose) printf("%5g (AND2 = %5g Level = %3d) ", newTarget, pNew.countAnd2(), pNew.countLevel());
            if (nVerbose) Time_PrintEndl("Elapsed time", Time_Clock() - clkStart);
            PrevBest = newTarget;
            pBests = {pNew.dup(0), pNew.dup(0)};
            pBest = pNew.dup(0, fMapped), improved = 1;
            iterNotImproveAfterRestart = 0;
        } else if (PrevBest == newTarget) {
            randomAddBest(pBests, pNew.dup(0), nBestSave, pChMan);
        }
        // compare
        if (maxLevel ? pNew.countLevel() > maxLevel : 0) {
        } else if (rootTarget < newTarget) {
            if (iterNotImproveAfterRestart > nRestart) {
                pNew = randomRead(pBests).dupMulti(nFaninMax, nGrowth);
                pNew = pNew.expand(nExpands, nDist, nExpandableLevel, pExc, fCheck, nVerbose > 1);
                pNew = pNew.share(nDivs == -1 ? pNew.nObjs() : nDivs);
                pNew = pNew.dupStrash(1, 1, 0);
                pRoots = {pNew};
                iterNotImproveAfterRestart = 0;
            } else if (rootTarget * 1.05 > newTarget) {
                pRoots = {pNew};
            }
        } else if (rootTarget == newTarget) {
            randomAddBest(pRoots, pNew, nRootSave, pChMan);
        } else {
            pRoots = {pNew};
        }
        pRoot = randomRead(pRoots);
    }
    if (nVerbose) Time_PrintEndl("Total solving time", Time_Clock() - clkStart);
    return improved ? pBest : randomReadExcept(pBests, pInit);
}

Here is the call graph for this function:

Here is the caller graph for this function:

setExc()

void Rewire::Miaig::setExc

(

Gia_Man_t *

pExc

)

Definition at line 252 of file rewire_miaig.cpp.

                                  {
    int i;
    assert(Gia_ManCiNum(pExc) == nIns());
    assert(Gia_ManCoNum(pExc) == nOuts() || Gia_ManCoNum(pExc) == 1);
    if (Gia_ManCoNum(pExc) != nOuts() && Gia_ManCoNum(pExc) == 1) {
        printf("[Warning] The external careset has only a single output that will be applied to all other outputs.\n");
    }
    if (!_data->pExc) {
        _data->pExc = (word *)malloc(sizeof(word) * nWords() * nOuts());
    }
    Miaig Exc(pExc);
    Exc.initializeTruth();
    for (i = 0; i < nOuts(); ++i) {
        word *tExc = Exc.objTruth(Exc.nObjs() - Exc.nOuts() + std::min(i, Gia_ManCoNum(pExc)-1), 0);
        Tt_Dup(_data->pExc + nWords() * i, tExc, nWords());
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

setName()

void Rewire::Miaig::setName

(

char *

pName

)

Definition at line 103 of file rewire_miaig.cpp.

                               {
    if (_data) {
        if (_data->pName) {
            free(_data->pName);
        }
        if (pName == NULL || pName[0] == '\0') {
            _data->pName = strdup("rewire_miaig");
        } else {
            _data->pName = strdup(pName);
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

share()

Miaig Rewire::Miaig::share

(

int

nNewNodesMax

)

Definition at line 1166 of file rewire_miaig.cpp.

                                   {
    Miaig pCopy = dup(0);
    int nNewNodes = pCopy.findShared(nNewNodesMax);
    if (nNewNodes == 0)
        return pCopy;
    // temporarily create "hidden" nodes for DFS duplicator
    pCopy.nObjs() -= nNewNodes;
    Miaig pNew = pCopy.dupDfs();
    pCopy.nObjs() += nNewNodes;
    return pNew;
}

Here is the call graph for this function:

Here is the caller graph for this function:

toGia()

Gia_Man_t * Rewire::Miaig::toGia

(

void

)

Definition at line 178 of file rewire_miaig.cpp.

                            {
    int i, k, iLit, And2 = countAnd2();
    Gia_Man_t *pGia = Gia_ManStart(1 + nIns() + And2 + nOuts()), *pTemp;
    pGia->pName = Abc_UtilStrsav(_data->pName);
    Gia_ManHashAlloc(pGia);
    memset(_data->pCopy, 0, sizeof(int) * nObjs());
    Miaig_ForEachInput(i)
        objCopy(i) = Gia_ManAppendCi(pGia);
    Miaig_ForEachNode(i) {
        assert(objFaninNum(i) > 0);
        Miaig_ForEachObjFanin(i, iLit, k) {
            if (k == 0)
                objCopy(i) = Rw_Lit2LitL(_data->pCopy, iLit);
            else 
                objCopy(i) = Gia_ManHashAnd(pGia, objCopy(i), Rw_Lit2LitL(_data->pCopy, iLit));
        }
    }
    Miaig_ForEachOutput(i) {
        assert(objFaninNum(i) == 1);
        Miaig_ForEachObjFanin(i, iLit, k)
            Gia_ManAppendCo(pGia, Rw_Lit2LitL(_data->pCopy, iLit));
    }
    // assert(Gia_ManObjNum(pGia) == (1 + nIns() + nOuts() + And2));
    pGia = Gia_ManCleanup(pTemp = pGia);
    Gia_ManStop(pTemp);
    return pGia;
}

Here is the call graph for this function:

Here is the caller graph for this function:

toMiniAig()

Mini_Aig_t * Rewire::Miaig::toMiniAig

(

void

)

Definition at line 206 of file rewire_miaig.cpp.

                                 {
    int i, k, iLit;
    Mini_Aig_t * pMini = Mini_AigStart();
    memset(_data->pCopy, 0, sizeof(int) * nObjs());
    Miaig_ForEachInput(i)
        objCopy(i) = Mini_AigCreatePi(pMini);
    Miaig_ForEachNode(i) {
        assert(objFaninNum(i) > 0);
        Miaig_ForEachObjFanin(i, iLit, k)
        if (k == 0)
            objCopy(i) = Rw_Lit2LitL(_data->pCopy, iLit);
        else
            objCopy(i) = Mini_AigAnd(pMini, objCopy(i), Rw_Lit2LitL(_data->pCopy, iLit));
    }
    Miaig_ForEachOutput(i) {
        assert(objFaninNum(i) == 1);
        Miaig_ForEachObjFanin(i, iLit, k)
            Mini_AigCreatePo(pMini, Rw_Lit2LitL(_data->pCopy, iLit));
    }
    assert(pMini->nSize == 2 * (1 + nIns() + nOuts() + countAnd2()));
    return pMini;    
}

Here is the call graph for this function:

Here is the caller graph for this function:

toNtk()

Abc_Ntk_t * Rewire::Miaig::toNtk

(

int

fMapped = 0

)

Definition at line 229 of file rewire_miaig.cpp.

                                   {
    Abc_Ntk_t *pNtk;
    if (_data->pNtkMapped && fMapped) {
        pNtk = Abc_ManRewireNtkFromMiniMapping(Vi_Array(_data->pNtkMapped));
        ABC_FREE(pNtk->pName);
        Abc_NtkSetName(pNtk, Abc_UtilStrsav(_data->pName));
        return pNtk; 
    }
    Gia_Man_t *pGia = toGia();
    pNtk = Gia_ManRewirePut(pGia);
    Gia_ManStop(pGia);
    return pNtk;
}

Here is the call graph for this function:

Here is the caller graph for this function:

---

The documentation for this class was generated from the following files:

• src/opt/rar/rewire_miaig.h
• src/opt/rar/rewire_miaig.cpp