rrr::BddMspfAnalyzer< Ntk > Class Template Reference

#include <rrrBddMspfAnalyzer.h>

Public Member Functions
	BddMspfAnalyzer ()
	BddMspfAnalyzer (Parameter const *pPar)
	~BddMspfAnalyzer ()
void	AssignNetwork (Ntk *pNtk_, bool fReuse)
bool	CheckRedundancy (int id, int idx)
bool	CheckFeasibility (int id, int fi, bool c)
void	ResetSummary ()
summary< int >	GetStatsSummary () const
summary< double >	GetTimesSummary () const

Detailed Description

template<typename Ntk>
class rrr::BddMspfAnalyzer< Ntk >

Definition at line 12 of file rrrBddMspfAnalyzer.h.

Constructor & Destructor Documentation

BddMspfAnalyzer() [1/2]

template<typename Ntk>

rrr::BddMspfAnalyzer< Ntk >::BddMspfAnalyzer

(

)

Definition at line 683 of file rrrBddMspfAnalyzer.h.

                                        :
    pNtk(NULL),
    nVerbose(0),
    fInitialized(false),
    pBdd(NULL),
    fUpdate(false) {
    ResetSummary();
  }

Here is the call graph for this function:

BddMspfAnalyzer() [2/2]

template<typename Ntk>

rrr::BddMspfAnalyzer< Ntk >::BddMspfAnalyzer

(

Parameter const *

pPar

)

Definition at line 693 of file rrrBddMspfAnalyzer.h.

                                                             :
    pNtk(NULL),
    nVerbose(pPar->nAnalyzerVerbose),
    fInitialized(false),
    pBdd(NULL),
    fUpdate(false) {
    ResetSummary();
  }

Here is the call graph for this function:

~BddMspfAnalyzer()

template<typename Ntk>

rrr::BddMspfAnalyzer< Ntk >::~BddMspfAnalyzer

(

)

Definition at line 703 of file rrrBddMspfAnalyzer.h.

                                         {
    Reset();
  }

Member Function Documentation

AssignNetwork()

template<typename Ntk>

void rrr::BddMspfAnalyzer< Ntk >::AssignNetwork	(	Ntk *	pNtk_,
		bool	fReuse )

Definition at line 708 of file rrrBddMspfAnalyzer.h.

                                                                  {
    Reset(fReuse);
    pNtk = pNtk_;
    pNtk->AddCallback(std::bind(&BddMspfAnalyzer<Ntk>::ActionCallback, this, std::placeholders::_1));
  }

CheckFeasibility()

template<typename Ntk>

bool rrr::BddMspfAnalyzer< Ntk >::CheckFeasibility	(	int	id,
		int	fi,
		bool	c )

Definition at line 754 of file rrrBddMspfAnalyzer.h.

                                                                    {
    if(!fInitialized) {
      Initialize();
    } else if(fUpdate) {
      Simulate();
      fUpdate = false;
    }
    Mspf(id, false);
    time_point timeStart = GetCurrentTime();
    bool fFeasible = false;
    switch(pNtk->GetNodeType(id)) {
    case AND: {
      lit x = pBdd->Or(pBdd->LitNot(vFs[id]), vGs[id]);
      IncRef(x);
      lit y = pBdd->Or(x, pBdd->LitNotCond(vFs[fi], c));
      DecRef(x);
      if(pBdd->IsConst1(y)) {
        fFeasible = true;
        return true;
      }
      break;
    }
    default:
      assert(0);
    }
    if(nVerbose) {
      if(fFeasible) {
        std::cout << "node " << id << " fanin " << (c? "!": "") << fi << " is feasible" << std::endl;
      } else {
        std::cout << "node " << id << " fanin " << (c? "!": "") << fi << " is NOT feasible" << std::endl;
      }
    }
    durationCheck += Duration(timeStart, GetCurrentTime());
    return fFeasible;
  }

CheckRedundancy()

template<typename Ntk>

bool rrr::BddMspfAnalyzer< Ntk >::CheckRedundancy	(	int	id,
		int	idx )

Definition at line 719 of file rrrBddMspfAnalyzer.h.

                                                            {
    if(!fInitialized) {
      Initialize();
    } else if(fUpdate) {
      Simulate();
      fUpdate = false;
    }
    Mspf(id);
    time_point timeStart = GetCurrentTime();
    bool fRedundant = false;
    switch(pNtk->GetNodeType(id)) {
    case AND: {
      int fi = pNtk->GetFanin(id, idx);
      bool c = pNtk->GetCompl(id, idx);
      lit x = pBdd->Or(pBdd->LitNotCond(vFs[fi], c), vvCs[id][idx]);
      if(pBdd->IsConst1(x)) {
        fRedundant = true;
      }
      break;
    }
    default:
      assert(0);
    }
    if(nVerbose) {
      if(fRedundant) {
        std::cout << "node " << id << " fanin " << (pNtk->GetCompl(id, idx)? "!": "") << pNtk->GetFanin(id, idx) << " index " << idx << " is redundant" << std::endl;
      } else {
        std::cout << "node " << id << " fanin " << (pNtk->GetCompl(id, idx)? "!": "") << pNtk->GetFanin(id, idx) << " index " << idx << " is NOT redundant" << std::endl;
      }
    }
    durationCheck += Duration(timeStart, GetCurrentTime());
    return fRedundant;
  }

GetStatsSummary()

template<typename Ntk>

summary< int > rrr::BddMspfAnalyzer< Ntk >::GetStatsSummary

(

)

const

Definition at line 809 of file rrrBddMspfAnalyzer.h.

                                                           {
    summary<int> v;
    v.emplace_back("bdd node", pBdd->GetNumTotalCreatedNodes() - nNodesOld + nNodesAccumulated);
    return v;
  }

GetTimesSummary()

template<typename Ntk>

summary< double > rrr::BddMspfAnalyzer< Ntk >::GetTimesSummary

(

)

const

Definition at line 816 of file rrrBddMspfAnalyzer.h.

                                                              {
    summary<double> v;
    v.emplace_back("bdd symbolic simulation", durationSimulation);
    v.emplace_back("bdd care computation", durationPf);
    v.emplace_back("bdd check", durationCheck);
    v.emplace_back("bdd reorder", durationReorder);
    return v;
  }

ResetSummary()

template<typename Ntk>

void rrr::BddMspfAnalyzer< Ntk >::ResetSummary

(

)

Definition at line 795 of file rrrBddMspfAnalyzer.h.

                                          {
    if(pBdd) {
      nNodesOld = pBdd->GetNumTotalCreatedNodes();
    } else {
      nNodesOld = 0;
    }
    nNodesAccumulated = 0;
    durationSimulation = 0;
    durationPf = 0;
    durationCheck = 0;
    durationReorder = 0;
  }

Here is the caller graph for this function:

---

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

• src/opt/rrr/rrrBddMspfAnalyzer.h