Ttopt::TruthTableCare Class Reference

Inheritance diagram for Ttopt::TruthTableCare:

Collaboration diagram for Ttopt::TruthTableCare:

Public Member Functions
	TruthTableCare (int nInputs, int nOutputs)
void	Save (unsigned i)
void	Load (unsigned i)
void	SaveIndices (unsigned i)
void	LoadIndices (unsigned i)
void	Swap (int lev)
void	RestoreCare ()
word	GetCare (int index_lev, int lev)
void	CopyFuncMasked (int index1, int index2, int lev, bool fCompl)
bool	IsDC (int index, int lev)
int	Include (int index1, int index2, int lev, bool fCompl)
int	Intersect (int index1, int index2, int lev, bool fCompl, bool fEq=true)
void	MergeCare (int index1, int index2, int lev)
void	Merge (int index1, int index2, int lev, bool fCompl)
int	BDDBuildOne (int index, int lev)
void	CompleteMerge ()
void	BDDBuildStartup ()
virtual void	BDDRebuildByMerge (int lev)
int	BDDRebuild (int lev)
int	BDDSwap (int lev)
void	OptimizationStartup ()
virtual void	Optimize ()
Public Member Functions inherited from Ttopt::TruthTableRewrite
	TruthTableRewrite (int nInputs, int nOutputs)
void	SetValue (int index_lev, int lev, word value)
void	CopyFunc (int index1, int index2, int lev, bool fCompl)
void	ShiftToMajority (int index, int lev)
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 void	BDDBuildLevel (int lev)
virtual int	BDDBuild ()
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)
virtual void	BDDGenerateAig (Gia_Man_t *pNew, Vec_Int_t *vSupp)

Public Attributes
std::vector< word >	originalt
std::vector< word >	caret
std::vector< word >	care
std::vector< std::vector< std::pair< int, int > > >	vvMergedIndices
std::vector< std::vector< word > >	savedcare
std::vector< std::vector< std::vector< std::pair< int, int > > > >	vvMergedIndicesSaved
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 697 of file giaTtopt.cpp.

Constructor & Destructor Documentation

TruthTableCare()

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

inline

Definition at line 708 of file giaTtopt.cpp.

                                           : TruthTableRewrite(nInputs, nOutputs) {
    if(nSize) {
      care.resize(nSize);
    } else {
      care.resize(1);
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

Member Function Documentation

BDDBuildOne()

int Ttopt::TruthTableCare::BDDBuildOne ( int index, int lev )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Reimplemented in Ttopt::TruthTableLevelTSM.

Definition at line 906 of file giaTtopt.cpp.

                                      {
    int r = BDDFind(index, lev);
    if(r >= -2) {
      if(r >= 0) {
        Merge(vvIndices[lev][r >> 1], index, lev, r & 1);
      }
      return r;
    }
    vvIndices[lev].push_back(index);
    return (vvIndices[lev].size() - 1) << 1;
  }

Here is the call graph for this function:

Here is the caller graph for this function:

BDDBuildStartup()

void Ttopt::TruthTableCare::BDDBuildStartup ( )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 926 of file giaTtopt.cpp.

                         {
    RestoreCare();
    vvIndices.clear();
    vvIndices.resize(nInputs);
    vvRedundantIndices.clear();
    vvRedundantIndices.resize(nInputs);
    vvMergedIndices.clear();
    vvMergedIndices.resize(nInputs);
    for(int i = 0; i < nOutputs; i++) {
      if(!IsDC(i, 0)) {
        BDDBuildOne(i, 0);
      }
    }
  }

Here is the call graph for this function:

BDDRebuild()

int Ttopt::TruthTableCare::BDDRebuild ( int lev )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Reimplemented in Ttopt::TruthTableLevelTSM.

Definition at line 948 of file giaTtopt.cpp.

                          {
    RestoreCare();
    int i;
    for(i = lev; i < nInputs; i++) {
      vvIndices[i].clear();
      vvMergedIndices[i].clear();
      if(i) {
        vvRedundantIndices[i-1].clear();
      }
    }
    for(i = 0; i < lev; i++) {
      BDDRebuildByMerge(i);
    }
    for(i = lev; i < nInputs; i++) {
      if(!i) {
        for(int j = 0; j < nOutputs; j++) {
          if(!IsDC(j, 0)) {
            BDDBuildOne(j, 0);
          }
        }
      } else {
        BDDBuildLevel(i);
      }
    }
    return BDDNodeCount();
  }

Here is the call graph for this function:

Here is the caller graph for this function:

BDDRebuildByMerge()

virtual void Ttopt::TruthTableCare::BDDRebuildByMerge ( int lev )

inlinevirtual

Reimplemented in Ttopt::TruthTableLevelTSM.

Definition at line 941 of file giaTtopt.cpp.

                                          {
    for(unsigned i = 0; i < vvMergedIndices[lev].size(); i++) {
      std::pair<int, int> &p = vvMergedIndices[lev][i];
      MergeCare(p.first >> 1, p.second, lev);
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

BDDSwap()

int Ttopt::TruthTableCare::BDDSwap ( int lev )

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 975 of file giaTtopt.cpp.

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

Here is the call graph for this function:

CompleteMerge()

void Ttopt::TruthTableCare::CompleteMerge ( )

inline

Definition at line 918 of file giaTtopt.cpp.

                       {
    for(int i = nInputs - 1; i >= 0; i--) {
      for(std::vector<std::pair<int, int> >::reverse_iterator it = vvMergedIndices[i].rbegin(); it != vvMergedIndices[i].rend(); it++) {
        CopyFunc((*it).second, (*it).first >> 1, i, (*it).first & 1);
      }
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

CopyFuncMasked()

void Ttopt::TruthTableCare::CopyFuncMasked ( int index1, int index2, int lev, bool fCompl )

inline

Definition at line 792 of file giaTtopt.cpp.

                                                                    {
    assert(index1 >= 0);
    assert(index2 >= 0);
    int logwidth = nInputs - lev;
    if(logwidth > lww) {
      int nScopeSize = 1 << (logwidth - lww);
      for(int i = 0; i < nScopeSize; i++) {
        word value = t[nScopeSize * index2 + i];
        if(fCompl) {
          value = ~value;
        }
        word cvalue = caret[nScopeSize * index2 + i];
        t[nScopeSize * index1 + i] &= ~cvalue;
        t[nScopeSize * index1 + i] |= cvalue & value;
      }
    } else {
      word one = ones[logwidth];
      word value1 = GetValue(index1, lev);
      word value2 = GetValue(index2, lev);
      if(fCompl) {
        value2 ^= one;
      }
      word cvalue = GetCare(index2, lev);
      value1 &= cvalue ^ one;
      value1 |= cvalue & value2;
      SetValue(index1, lev, value1);
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

GetCare()

word Ttopt::TruthTableCare::GetCare ( int index_lev, int lev )

inline

Definition at line 783 of file giaTtopt.cpp.

                                       {
    assert(index_lev >= 0);
    assert(nInputs - lev <= lww);
    int logwidth = nInputs - lev;
    int index = index_lev >> (lww - logwidth);
    int pos = (index_lev % (1 << (lww - logwidth))) << logwidth;
    return (caret[index] >> pos) & ones[logwidth];
  }

Here is the caller graph for this function:

Include()

int Ttopt::TruthTableCare::Include ( int index1, int index2, int lev, bool fCompl )

inline

Definition at line 835 of file giaTtopt.cpp.

                                                            {
    assert(index1 >= 0);
    assert(index2 >= 0);
    int logwidth = nInputs - lev;
    bool fEq = true;
    if(logwidth > lww) {
      int nScopeSize = 1 << (logwidth - lww);
      for(int i = 0; i < nScopeSize && (fEq || fCompl); i++) {
        word cvalue = caret[nScopeSize * index2 + i];
        if(~caret[nScopeSize * index1 + i] & cvalue) {
          return 0;
        }
        word value = t[nScopeSize * index1 + i] ^ t[nScopeSize * index2 + i];
        fEq &= !(value & cvalue);
        fCompl &= !(~value & cvalue);
      }
    } else {
      word cvalue = GetCare(index2, lev);
      if((GetCare(index1, lev) ^ ones[logwidth]) & cvalue) {
        return 0;
      }
      word value = GetValue(index1, lev) ^ GetValue(index2, lev);
      fEq &= !(value & cvalue);
      fCompl &= !((value ^ ones[logwidth]) & cvalue);
    }
    return 2 * fCompl + fEq;
  }

Here is the call graph for this function:

Intersect()

int Ttopt::TruthTableCare::Intersect ( int index1, int index2, int lev, bool fCompl, bool fEq = true )

inline

Definition at line 863 of file giaTtopt.cpp.

                                                                               {
    assert(index1 >= 0);
    assert(index2 >= 0);
    int logwidth = nInputs - lev;
    if(logwidth > lww) {
      int nScopeSize = 1 << (logwidth - lww);
      for(int i = 0; i < nScopeSize && (fEq || fCompl); i++) {
        word value = t[nScopeSize * index1 + i] ^ t[nScopeSize * index2 + i];
        word cvalue = caret[nScopeSize * index1 + i] & caret[nScopeSize * index2 + i];
        fEq &= !(value & cvalue);
        fCompl &= !(~value & cvalue);
      }
    } else {
      word value = GetValue(index1, lev) ^ GetValue(index2, lev);
      word cvalue = GetCare(index1, lev) & GetCare(index2, lev);
      fEq &= !(value & cvalue);
      fCompl &= !((value ^ ones[logwidth]) & cvalue);
    }
    return 2 * fCompl + fEq;
  }

Here is the call graph for this function:

IsDC()

bool Ttopt::TruthTableCare::IsDC ( int index, int lev )

inline

Definition at line 821 of file giaTtopt.cpp.

                                {
    if(nInputs - lev > lww) {
      int nScopeSize = 1 << (nInputs - lev - lww);
      for(int i = 0; i < nScopeSize; i++) {
        if(caret[nScopeSize * index + i]) {
          return false;
        }
      }
    } else if(GetCare(index, lev)) {
      return false;
    }
    return true;
  }

Here is the call graph for this function:

Here is the caller graph for this function:

Load()

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

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 724 of file giaTtopt.cpp.

                        {
    TruthTable::Load(i);
    care = savedcare[i];
  }

Here is the call graph for this function:

LoadIndices()

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

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 737 of file giaTtopt.cpp.

                               {
    TruthTable::LoadIndices(i);
    vvMergedIndices = vvMergedIndicesSaved[i];
  }

Here is the call graph for this function:

Merge()

void Ttopt::TruthTableCare::Merge ( int index1, int index2, int lev, bool fCompl )

inline

Definition at line 901 of file giaTtopt.cpp.

                                                           {
    MergeCare(index1, index2, lev);
    vvMergedIndices[lev].push_back(std::make_pair((index1 << 1) ^ (int)fCompl, index2));
  }

Here is the call graph for this function:

Here is the caller graph for this function:

MergeCare()

void Ttopt::TruthTableCare::MergeCare ( int index1, int index2, int lev )

inline

Definition at line 884 of file giaTtopt.cpp.

                                                  {
    assert(index1 >= 0);
    assert(index2 >= 0);
    int logwidth = nInputs - lev;
    if(logwidth > lww) {
      int nScopeSize = 1 << (logwidth - lww);
      for(int i = 0; i < nScopeSize; i++) {
        caret[nScopeSize * index1 + i] |= caret[nScopeSize * index2 + i];
      }
    } else {
      word value = GetCare(index2, lev);
      int index = index1 >> (lww - logwidth);
      int pos = (index1 % (1 << (lww - logwidth))) << logwidth;
      caret[index] |= value << pos;
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

OptimizationStartup()

void Ttopt::TruthTableCare::OptimizationStartup ( )

inline

Definition at line 980 of file giaTtopt.cpp.

                             {
    originalt = t;
    RestoreCare();
    vvIndices.clear();
    vvIndices.resize(nInputs);
    vvMergedIndices.clear();
    vvMergedIndices.resize(nInputs);
    for(int i = 0; i < nOutputs; i++) {
      if(!IsDC(i, 0)) {
        BDDBuildOne(i, 0);
      } else {
        ShiftToMajority(i, 0);
      }
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

Optimize()

virtual void Ttopt::TruthTableCare::Optimize ( )

inlinevirtual

Definition at line 996 of file giaTtopt.cpp.

                          {
    OptimizationStartup();
    for(int i = 1; i < nInputs; i++) {
      for(unsigned j = 0; j < vvIndices[i-1].size(); j++) {
        int index = vvIndices[i-1][j];
        BDDBuildOne(index << 1, i);
        BDDBuildOne((index << 1) ^ 1, i);
      }
    }
    CompleteMerge();
  }

Here is the call graph for this function:

Here is the caller graph for this function:

RestoreCare()

void Ttopt::TruthTableCare::RestoreCare ( )

inline

Definition at line 768 of file giaTtopt.cpp.

                     {
    caret.clear();
    if(nSize) {
      for(int i = 0; i < nOutputs; i++) {
        caret.insert(caret.end(), care.begin(), care.end());
      }
    } else {
      caret.resize(nTotalSize);
      for(int i = 0; i < nOutputs; i++) {
        int padding = i * (1 << nInputs);
        caret[padding / ww] |= care[0] << (padding % ww);
      }
    }
  }

Here is the caller graph for this function:

Save()

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

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 716 of file giaTtopt.cpp.

                        {
    TruthTable::Save(i);
    if(savedcare.size() < i + 1) {
      savedcare.resize(i + 1);
    }
    savedcare[i] = care;
  }

Here is the call graph for this function:

SaveIndices()

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

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 729 of file giaTtopt.cpp.

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

Here is the call graph for this function:

Swap()

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

inlinevirtual

Reimplemented from Ttopt::TruthTable.

Definition at line 742 of file giaTtopt.cpp.

                     {
    TruthTable::Swap(lev);
    if(nInputs - lev - 1 > lww) {
      int nScopeSize = 1 << (nInputs - lev - 2 - lww);
      for(int i = nScopeSize; i < nSize; i += (nScopeSize << 2)) {
        for(int j = 0; j < nScopeSize; j++) {
          std::swap(care[i + j], care[i + nScopeSize + j]);
        }
      }
    } else if(nInputs - lev - 1 == lww) {
      for(int i = 0; i < nSize; i += 2) {
        care[i+1] ^= care[i] >> (ww / 2);
        care[i] ^= care[i+1] << (ww / 2);
        care[i+1] ^= care[i] >> (ww / 2);
      }
    } else {
      for(int i = 0; i < nSize || (i == 0 && !nSize); i++) {
        int d = nInputs - lev - 2;
        int shamt = 1 << d;
        care[i] ^= (care[i] >> shamt) & swapmask[d];
        care[i] ^= (care[i] & swapmask[d]) << shamt;
        care[i] ^= (care[i] >> shamt) & swapmask[d];
      }
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

care

std::vector<word> Ttopt::TruthTableCare::care

Definition at line 701 of file giaTtopt.cpp.

caret

std::vector<word> Ttopt::TruthTableCare::caret

Definition at line 700 of file giaTtopt.cpp.

originalt

std::vector<word> Ttopt::TruthTableCare::originalt

Definition at line 699 of file giaTtopt.cpp.

savedcare

std::vector<std::vector<word> > Ttopt::TruthTableCare::savedcare

Definition at line 705 of file giaTtopt.cpp.

vvMergedIndices

std::vector<std::vector<std::pair<int, int> > > Ttopt::TruthTableCare::vvMergedIndices

Definition at line 703 of file giaTtopt.cpp.

vvMergedIndicesSaved

std::vector<std::vector<std::vector<std::pair<int, int> > > > Ttopt::TruthTableCare::vvMergedIndicesSaved

Definition at line 706 of file giaTtopt.cpp.

---

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

• src/aig/gia/giaTtopt.cpp