Ttopt::TruthTableReo Class Reference

Inheritance diagram for Ttopt::TruthTableReo:

Collaboration diagram for Ttopt::TruthTableReo:

Public Member Functions
	TruthTableReo (int nInputs, int nOutputs)
void	Save (unsigned i)
void	Load (unsigned i)
void	SaveIndices (unsigned i)
void	LoadIndices (unsigned i)
void	BDDBuildStartup ()
void	BDDBuildLevel (int lev)
int	BDDBuild ()
int	BDDRebuildOne (int index, int cof0, int cof1, int lev, Hash_IntMan_t *unique, std::vector< int > &vChildrenLow)
int	BDDRebuild (int lev)
void	Swap (int lev)
int	BDDSwap (int lev)
virtual void	BDDGenerateAig (Gia_Man_t *pNew, Vec_Int_t *vSupp)
Public Member Functions inherited from Ttopt::TruthTable
	TruthTable (int nInputs, int nOutputs)
word	GetValue (int index_lev, int lev)
int	IsEq (int index1, int index2, int lev, bool fCompl=false)
bool	Imply (int index1, int index2, int lev)
int	BDDNodeCountLevel (int lev)
int	BDDNodeCount ()
int	BDDFind (int index, int lev)
virtual int	BDDBuildOne (int index, int lev)
void	SwapIndex (int &index, int d)
int	SiftReo ()
void	Reo (std::vector< int > vLevelsNew)
int	RandomSiftReo (int nRound)
int	BDDGenerateAigRec (Gia_Man_t *pNew, std::vector< int > const &vInputs, std::vector< std::vector< int > > &vvNodes, int index, int lev)

Public Attributes
bool	fBuilt
std::vector< std::vector< int > >	vvChildren
std::vector< std::vector< std::vector< int > > >	vvChildrenSaved
Public Attributes inherited from Ttopt::TruthTable
int	nInputs
int	nSize
int	nTotalSize
int	nOutputs
std::vector< word >	t
std::vector< std::vector< int > >	vvIndices
std::vector< std::vector< int > >	vvRedundantIndices
std::vector< int >	vLevels
std::vector< std::vector< word > >	savedt
std::vector< std::vector< std::vector< int > > >	vvIndicesSaved
std::vector< std::vector< std::vector< int > > >	vvRedundantIndicesSaved
std::vector< std::vector< int > >	vLevelsSaved

Additional Inherited Members
Public Types inherited from Ttopt::TruthTable
typedef std::bitset< 64 >	bsw
Static Public Attributes inherited from Ttopt::TruthTable
static const int	ww = 64
static const int	lww = 6
static const word	ones []
static const word	swapmask []

Detailed Description

Definition at line 479 of file giaTtopt.cpp.

Constructor & Destructor Documentation

TruthTableReo()

Ttopt::TruthTableReo::TruthTableReo ( int nInputs, int nOutputs )

inline

Definition at line 485 of file giaTtopt.cpp.

                                          : TruthTable(nInputs, nOutputs) {
    fBuilt = false;
  }

Here is the call graph for this function:

Member Function Documentation

BDDBuild()

int Ttopt::TruthTableReo::BDDBuild ( )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 533 of file giaTtopt.cpp.

                 {
    if(fBuilt) {
      return BDDNodeCount();
    }
    fBuilt = true;
    BDDBuildStartup();
    for(int i = 1; i < nInputs + 1; i++) {
      BDDBuildLevel(i);
    }
    return BDDNodeCount();
  }

Here is the call graph for this function:

BDDBuildLevel()

void Ttopt::TruthTableReo::BDDBuildLevel ( int lev )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 520 of file giaTtopt.cpp.

                              {
    for(unsigned i = 0; i < vvIndices[lev-1].size(); i++) {
      int index = vvIndices[lev-1][i];
      int cof0 = BDDBuildOne(index << 1, lev);
      int cof1 = BDDBuildOne((index << 1) ^ 1, lev);
      vvChildren[lev-1].push_back(cof0);
      vvChildren[lev-1].push_back(cof1);
      if(cof0 == cof1) {
        vvRedundantIndices[lev-1].push_back(index);
      }
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

BDDBuildStartup()

void Ttopt::TruthTableReo::BDDBuildStartup ( )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 514 of file giaTtopt.cpp.

                         {
    vvChildren.clear();
    vvChildren.resize(nInputs);
    TruthTable::BDDBuildStartup();
  }

Here is the call graph for this function:

Here is the caller graph for this function:

BDDGenerateAig()

virtual void Ttopt::TruthTableReo::BDDGenerateAig ( Gia_Man_t * pNew, Vec_Int_t * vSupp )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 623 of file giaTtopt.cpp.

                                                                 {
    abort();
  }

Here is the call graph for this function:

BDDRebuild()

int Ttopt::TruthTableReo::BDDRebuild ( int lev )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 568 of file giaTtopt.cpp.

                          {
    vvRedundantIndices[lev].clear();
    vvRedundantIndices[lev+1].clear();
    std::vector<int> vChildrenHigh;
    std::vector<int> vChildrenLow;
    Hash_IntMan_t *unique = Hash_IntManStart(2 * vvIndices[lev+1].size());
    vvIndices[lev+1].clear();
    for(unsigned i = 0; i < vvIndices[lev].size(); i++) {
      int index = vvIndices[lev][i];
      int cof0index = vvChildren[lev][i+i] >> 1;
      int cof1index = vvChildren[lev][i+i+1] >> 1;
      bool cof0c = vvChildren[lev][i+i] & 1;
      bool cof1c = vvChildren[lev][i+i+1] & 1;
      int cof00, cof01, cof10, cof11;
      if(cof0index < 0) {
        cof00 = -2 ^ (int)cof0c;
        cof01 = -2 ^ (int)cof0c;
      } else {
        cof00 = vvChildren[lev+1][cof0index+cof0index] ^ (int)cof0c;
        cof01 = vvChildren[lev+1][cof0index+cof0index+1] ^ (int)cof0c;
      }
      if(cof1index < 0) {
        cof10 = -2 ^ (int)cof1c;
        cof11 = -2 ^ (int)cof1c;
      } else {
        cof10 = vvChildren[lev+1][cof1index+cof1index] ^ (int)cof1c;
        cof11 = vvChildren[lev+1][cof1index+cof1index+1] ^ (int)cof1c;
      }
      int newcof0 = BDDRebuildOne(index << 1, cof00, cof10, lev + 1, unique, vChildrenLow);
      int newcof1 = BDDRebuildOne((index << 1) ^ 1, cof01, cof11, lev + 1, unique, vChildrenLow);
      vChildrenHigh.push_back(newcof0);
      vChildrenHigh.push_back(newcof1);
      if(newcof0 == newcof1) {
        vvRedundantIndices[lev].push_back(index);
      }
    }
    Hash_IntManStop(unique);
    vvChildren[lev] = vChildrenHigh;
    vvChildren[lev+1] = vChildrenLow;
    return BDDNodeCount();
  }

Here is the call graph for this function:

Here is the caller graph for this function:

BDDRebuildOne()

int Ttopt::TruthTableReo::BDDRebuildOne ( int index, int cof0, int cof1, int lev, Hash_IntMan_t * unique, std::vector< int > & vChildrenLow )

inline

Definition at line 545 of file giaTtopt.cpp.

                                                                                                                 {
    if(cof0 < 0 && cof0 == cof1) {
      return cof0;
    }
    bool fCompl = cof0 & 1;
    if(fCompl) {
      cof0 ^= 1;
      cof1 ^= 1;
    }
    int *place = Hash_Int2ManLookup(unique, cof0, cof1);
    if(*place) {
      return (Hash_IntObjData2(unique, *place) << 1) ^ (int)fCompl;
    }
    vvIndices[lev].push_back(index);
    Hash_Int2ManInsert(unique, cof0, cof1, vvIndices[lev].size() - 1);
    vChildrenLow.push_back(cof0);
    vChildrenLow.push_back(cof1);
    if(cof0 == cof1) {
      vvRedundantIndices[lev].push_back(index);
    }
    return ((vvIndices[lev].size() - 1) << 1) ^ (int)fCompl;
  }

Here is the caller graph for this function:

BDDSwap()

int Ttopt::TruthTableReo::BDDSwap ( int lev )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 618 of file giaTtopt.cpp.

                       {
    Swap(lev);
    return BDDNodeCount();
  }

Here is the call graph for this function:

Load()

void Ttopt::TruthTableReo::Load ( unsigned i )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 496 of file giaTtopt.cpp.

                        {
    assert(i < vLevelsSaved.size());
    vLevels = vLevelsSaved[i];
  }

LoadIndices()

void Ttopt::TruthTableReo::LoadIndices ( unsigned i )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 509 of file giaTtopt.cpp.

                               {
    TruthTable::LoadIndices(i);
    vvChildren = vvChildrenSaved[i];
  }

Here is the call graph for this function:

Save()

void Ttopt::TruthTableReo::Save ( unsigned i )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 489 of file giaTtopt.cpp.

                        {
    if(vLevelsSaved.size() < i + 1) {
      vLevelsSaved.resize(i + 1);
    }
    vLevelsSaved[i] = vLevels;
  }

SaveIndices()

void Ttopt::TruthTableReo::SaveIndices ( unsigned i )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 501 of file giaTtopt.cpp.

                               {
    TruthTable::SaveIndices(i);
    if(vvChildrenSaved.size() < i + 1) {
      vvChildrenSaved.resize(i + 1);
    }
    vvChildrenSaved[i] = vvChildren;
  }

Here is the call graph for this function:

Swap()

void Ttopt::TruthTableReo::Swap ( int lev )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 610 of file giaTtopt.cpp.

                     {
    assert(lev < nInputs - 1);
    std::vector<int>::iterator it0 = std::find(vLevels.begin(), vLevels.end(), lev);
    std::vector<int>::iterator it1 = std::find(vLevels.begin(), vLevels.end(), lev + 1);
    std::swap(*it0, *it1);
    BDDRebuild(lev);
  }

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

fBuilt

bool Ttopt::TruthTableReo::fBuilt

Definition at line 481 of file giaTtopt.cpp.

vvChildren

std::vector<std::vector<int> > Ttopt::TruthTableReo::vvChildren

Definition at line 482 of file giaTtopt.cpp.

vvChildrenSaved

std::vector<std::vector<std::vector<int> > > Ttopt::TruthTableReo::vvChildrenSaved

Definition at line 483 of file giaTtopt.cpp.

---

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

• src/aig/gia/giaTtopt.cpp