diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2012-07-04 14:53:07 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2012-07-04 14:53:07 -0700 |
| commit | 9ebcd9eca983890738bc76f84f4e276a9cb693d7 (patch) | |
| tree | 966c59c9020e85c857678fb1edffcc2138dce545 /src/sat | |
| parent | c921058019c22ca917fb63f1139a46cb9f766ae2 (diff) | |
| download | abc-9ebcd9eca983890738bc76f84f4e276a9cb693d7.tar.gz abc-9ebcd9eca983890738bc76f84f4e276a9cb693d7.tar.bz2 abc-9ebcd9eca983890738bc76f84f4e276a9cb693d7.zip | |
Various changes to enable sensitization-based refinement in &gla.
Diffstat (limited to 'src/sat')
| -rw-r--r-- | src/sat/cnf/cnf.h | 2 | ||||
| -rw-r--r-- | src/sat/cnf/cnfCore.c | 8 |
2 files changed, 5 insertions, 5 deletions
diff --git a/src/sat/cnf/cnf.h b/src/sat/cnf/cnf.h index 54aaf5ca..478755d6 100644 --- a/src/sat/cnf/cnf.h +++ b/src/sat/cnf/cnf.h @@ -128,7 +128,7 @@ static inline void Cnf_ObjSetBestCut( Aig_Obj_t * pObj, Cnf_Cut_t * pCut /*=== cnfCore.c ========================================================*/ extern Vec_Int_t * Cnf_DeriveMappingArray( Aig_Man_t * pAig ); extern Cnf_Dat_t * Cnf_Derive( Aig_Man_t * pAig, int nOutputs ); -extern Cnf_Dat_t * Cnf_DeriveOther( Aig_Man_t * pAig ); +extern Cnf_Dat_t * Cnf_DeriveOther( Aig_Man_t * pAig, int fSkipTtMin ); extern Cnf_Man_t * Cnf_ManRead(); extern void Cnf_ClearMemory(); /*=== cnfCut.c ========================================================*/ diff --git a/src/sat/cnf/cnfCore.c b/src/sat/cnf/cnfCore.c index d1dd8561..65d7ef60 100644 --- a/src/sat/cnf/cnfCore.c +++ b/src/sat/cnf/cnfCore.c @@ -60,7 +60,7 @@ Vec_Int_t * Cnf_DeriveMappingArray( Aig_Man_t * pAig ) // generate cuts for all nodes, assign cost, and find best cuts clk = clock(); - pMemCuts = Dar_ManComputeCuts( pAig, 10, 0 ); + pMemCuts = Dar_ManComputeCuts( pAig, 10, 0, 0 ); p->timeCuts = clock() - clk; // find the mapping @@ -113,7 +113,7 @@ Cnf_Dat_t * Cnf_Derive( Aig_Man_t * pAig, int nOutputs ) // generate cuts for all nodes, assign cost, and find best cuts clk = clock(); - pMemCuts = Dar_ManComputeCuts( pAig, 10, 0 ); + pMemCuts = Dar_ManComputeCuts( pAig, 10, 0, 0 ); p->timeCuts = clock() - clk; // find the mapping @@ -150,7 +150,7 @@ p->timeSave = clock() - clk; SeeAlso [] ***********************************************************************/ -Cnf_Dat_t * Cnf_DeriveOther( Aig_Man_t * pAig ) +Cnf_Dat_t * Cnf_DeriveOther( Aig_Man_t * pAig, int fSkipTtMin ) { Cnf_Man_t * p; Cnf_Dat_t * pCnf; @@ -166,7 +166,7 @@ Cnf_Dat_t * Cnf_DeriveOther( Aig_Man_t * pAig ) // generate cuts for all nodes, assign cost, and find best cuts clk = clock(); - pMemCuts = Dar_ManComputeCuts( pAig, 10, 0 ); + pMemCuts = Dar_ManComputeCuts( pAig, 10, fSkipTtMin, 0 ); p->timeCuts = clock() - clk; // find the mapping |