ABC: A System for Sequential Synthesis and Verification
 
Loading...
Searching...
No Matches
dchMan.c
Go to the documentation of this file.
1
20
21#include "dchInt.h"
22
24
25
29
33
46{
47 Dch_Man_t * p;
48 // create interpolation manager
49 p = ABC_ALLOC( Dch_Man_t, 1 );
50 memset( p, 0, sizeof(Dch_Man_t) );
51 p->pPars = pPars;
52 p->pAigTotal = pAig; //Dch_DeriveTotalAig( vAigs );
53 Aig_ManFanoutStart( p->pAigTotal );
54 // SAT solving
55 p->nSatVars = 1;
56 p->pSatVars = ABC_CALLOC( int, Aig_ManObjNumMax(p->pAigTotal) );
57 p->vUsedNodes = Vec_PtrAlloc( 1000 );
58 p->vFanins = Vec_PtrAlloc( 100 );
59 p->vSimRoots = Vec_PtrAlloc( 1000 );
60 p->vSimClasses = Vec_PtrAlloc( 1000 );
61 // equivalences proved
62 p->pReprsProved = ABC_CALLOC( Aig_Obj_t *, Aig_ManObjNumMax(p->pAigTotal) );
63 return p;
64}
65
78{
79 int nNodeNum = Aig_ManNodeNum(p->pAigTotal) / 3;
80 Abc_Print( 1, "Parameters: Sim words = %d. Conf limit = %d. SAT var max = %d.\n",
81 p->pPars->nWords, p->pPars->nBTLimit, p->pPars->nSatVarMax );
82 Abc_Print( 1, "AIG nodes : Total = %6d. Dangling = %6d. Main = %6d. (%6.2f %%)\n",
83 Aig_ManNodeNum(p->pAigTotal),
84 Aig_ManNodeNum(p->pAigTotal)-nNodeNum,
85 nNodeNum,
86 100.0 * nNodeNum/Aig_ManNodeNum(p->pAigTotal) );
87 Abc_Print( 1, "SAT solver: Vars = %d. Max cone = %d. Recycles = %d.\n",
88 p->nSatVars, p->nConeMax, p->nRecycles );
89 Abc_Print( 1, "SAT calls : All = %6d. Unsat = %6d. Sat = %6d. Fail = %6d.\n",
90 p->nSatCalls, p->nSatCalls-p->nSatCallsSat-p->nSatFailsReal,
91 p->nSatCallsSat, p->nSatFailsReal );
92 Abc_Print( 1, "Choices : Lits = %6d. Reprs = %5d. Equivs = %5d. Choices = %5d.\n",
93 p->nLits, p->nReprs, p->nEquivs, p->nChoices );
94 Abc_Print( 1, "Choicing runtime statistics:\n" );
95 p->timeOther = p->timeTotal-p->timeSimInit-p->timeSimSat-p->timeSat-p->timeChoice;
96 Abc_PrintTimeP( 1, "Sim init ", p->timeSimInit, p->timeTotal );
97 Abc_PrintTimeP( 1, "Sim SAT ", p->timeSimSat, p->timeTotal );
98 Abc_PrintTimeP( 1, "SAT solving", p->timeSat, p->timeTotal );
99 Abc_PrintTimeP( 1, " sat ", p->timeSatSat, p->timeTotal );
100 Abc_PrintTimeP( 1, " unsat ", p->timeSatUnsat, p->timeTotal );
101 Abc_PrintTimeP( 1, " undecided", p->timeSatUndec, p->timeTotal );
102 Abc_PrintTimeP( 1, "Choice ", p->timeChoice, p->timeTotal );
103 Abc_PrintTimeP( 1, "Other ", p->timeOther, p->timeTotal );
104 Abc_PrintTimeP( 1, "TOTAL ", p->timeTotal, p->timeTotal );
105 if ( p->pPars->timeSynth )
106 {
107 Abc_PrintTime( 1, "Synthesis ", p->pPars->timeSynth );
108 }
109}
110
123{
124 Aig_ManFanoutStop( p->pAigTotal );
125 if ( p->pPars->fVerbose )
127 if ( p->pAigFraig )
128 Aig_ManStop( p->pAigFraig );
129 if ( p->ppClasses )
130 Dch_ClassesStop( p->ppClasses );
131 if ( p->pSat )
132 sat_solver_delete( p->pSat );
133 Vec_PtrFree( p->vUsedNodes );
134 Vec_PtrFree( p->vFanins );
135 Vec_PtrFree( p->vSimRoots );
136 Vec_PtrFree( p->vSimClasses );
137 ABC_FREE( p->pReprsProved );
138 ABC_FREE( p->pSatVars );
139 ABC_FREE( p );
140}
141
154{
155 int Lit;
156 if ( p->pSat )
157 {
158 Aig_Obj_t * pObj;
159 int i;
160 Vec_PtrForEachEntry( Aig_Obj_t *, p->vUsedNodes, pObj, i )
161 Dch_ObjSetSatNum( p, pObj, 0 );
162 Vec_PtrClear( p->vUsedNodes );
163// memset( p->pSatVars, 0, sizeof(int) * Aig_ManObjNumMax(p->pAigTotal) );
164 sat_solver_delete( p->pSat );
165 }
166 p->pSat = sat_solver_new();
167 sat_solver_setnvars( p->pSat, 1000 );
168 // var 0 is not used
169 // var 1 is reserved for const1 node - add the clause
170 p->nSatVars = 1;
171// p->nSatVars = 0;
172 Lit = toLit( p->nSatVars );
173 if ( p->pPars->fPolarFlip )
174 Lit = lit_neg( Lit );
175 sat_solver_addclause( p->pSat, &Lit, &Lit + 1 );
176 Dch_ObjSetSatNum( p, Aig_ManConst1(p->pAigFraig), p->nSatVars++ );
177
178 p->nRecycles++;
179 p->nCallsSince = 0;
180}
181
182
183
184
188
189
191
#define ABC_ALLOC(type, num)
Definition abc_global.h:264
#define ABC_CALLOC(type, num)
Definition abc_global.h:265
#define ABC_FREE(obj)
Definition abc_global.h:267
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
void Aig_ManFanoutStart(Aig_Man_t *p)
FUNCTION DEFINITIONS ///.
Definition aigFanout.c:56
void Aig_ManFanoutStop(Aig_Man_t *p)
Definition aigFanout.c:89
void Aig_ManStop(Aig_Man_t *p)
Definition aigMan.c:187
struct Aig_Obj_t_ Aig_Obj_t
Definition aig.h:51
typedefABC_NAMESPACE_HEADER_START struct Aig_Man_t_ Aig_Man_t
INCLUDES ///.
Definition aig.h:50
#define sat_solver_addclause
Definition cecSatG2.c:37
void Dch_ClassesStop(Dch_Cla_t *p)
Definition dchClass.c:185
struct Dch_Man_t_ Dch_Man_t
Definition dchInt.h:50
void Dch_ManStop(Dch_Man_t *p)
Definition dchMan.c:122
ABC_NAMESPACE_IMPL_START Dch_Man_t * Dch_ManCreate(Aig_Man_t *pAig, Dch_Pars_t *pPars)
DECLARATIONS ///.
Definition dchMan.c:45
void Dch_ManPrintStats(Dch_Man_t *p)
Definition dchMan.c:77
void Dch_ManSatSolverRecycle(Dch_Man_t *p)
Definition dchMan.c:153
typedefABC_NAMESPACE_HEADER_START struct Dch_Pars_t_ Dch_Pars_t
INCLUDES ///.
Definition dch.h:43
Cube * p
Definition exorList.c:222
sat_solver * sat_solver_new(void)
Definition satSolver.c:1137
void sat_solver_setnvars(sat_solver *s, int n)
Definition satSolver.c:1272
void sat_solver_delete(sat_solver *s)
Definition satSolver.c:1341
char * memset()
#define Vec_PtrForEachEntry(Type, vVec, pEntry, i)
MACRO DEFINITIONS ///.
Definition vecPtr.h:55