ABC: A System for Sequential Synthesis and Verification
 
Loading...
Searching...
No Matches
giaSatoko.c File Reference
#include "gia.h"
#include "sat/cnf/cnf.h"
#include "misc/extra/extra.h"
#include "sat/satoko/satoko.h"
Include dependency graph for giaSatoko.c:

Go to the source code of this file.

Functions

ABC_NAMESPACE_IMPL_START void Gia_ManCollectVars_rec (int Var, Vec_Int_t *vMapping, Vec_Int_t *vRes, Vec_Bit_t *vVisit)
 DECLARATIONS ///.
 
Vec_Int_tGia_ManCollectVars (int Root, Vec_Int_t *vMapping, int nVars)
 
void Gia_ManSatokoReport (int iOutput, int status, abctime clk)
 
satoko_tGia_ManSatokoFromDimacs (char *pFileName, satoko_opts_t *opts)
 
void Gia_ManSatokoDimacs (char *pFileName, satoko_opts_t *opts)
 
satoko_tGia_ManSatokoInit (Cnf_Dat_t *pCnf, satoko_opts_t *opts)
 
satoko_tGia_ManSatokoCreate (Gia_Man_t *p, satoko_opts_t *opts)
 
int Gia_ManSatokoCallOne (Gia_Man_t *p, satoko_opts_t *opts, int iOutput)
 
void Gia_ManSatokoCall (Gia_Man_t *p, satoko_opts_t *opts, int fSplit, int fIncrem)
 

Function Documentation

◆ Gia_ManCollectVars()

Vec_Int_t * Gia_ManCollectVars ( int Root,
Vec_Int_t * vMapping,
int nVars )

Definition at line 62 of file giaSatoko.c.

63{
64 Vec_Int_t * vRes = Vec_IntAlloc( 100 );
65 Vec_Bit_t * vVisit = Vec_BitStart( nVars );
66 assert( Vec_IntEntry(vMapping, Root) );
67 Gia_ManCollectVars_rec( Root, vMapping, vRes, vVisit );
68 Vec_BitFree( vVisit );
69 return vRes;
70}
typedefABC_NAMESPACE_IMPL_START struct Vec_Int_t_ Vec_Int_t
DECLARATIONS ///.
Definition bblif.c:37
ABC_NAMESPACE_IMPL_START void Gia_ManCollectVars_rec(int Var, Vec_Int_t *vMapping, Vec_Int_t *vRes, Vec_Bit_t *vVisit)
DECLARATIONS ///.
Definition giaSatoko.c:48
#define assert(ex)
Definition util_old.h:213
typedefABC_NAMESPACE_HEADER_START struct Vec_Bit_t_ Vec_Bit_t
INCLUDES ///.
Definition vecBit.h:42
Here is the call graph for this function:
Here is the caller graph for this function:

◆ Gia_ManCollectVars_rec()

ABC_NAMESPACE_IMPL_START void Gia_ManCollectVars_rec ( int Var,
Vec_Int_t * vMapping,
Vec_Int_t * vRes,
Vec_Bit_t * vVisit )

DECLARATIONS ///.

CFile****************************************************************

FileName [giaSatoko.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Scalable AIG package.]

Synopsis [Interface to Satoko solver.]

Author [Alan Mishchenko, Bruno Schmitt]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - June 20, 2005.]

Revision [

Id
giaSatoko.c,v 1.00 2005/06/20 00:00:00 alanmi Exp

] FUNCTION DEFINITIONS /// Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 48 of file giaSatoko.c.

49{
50 int * pCut, i;
51 if ( Vec_BitEntry(vVisit, Var) )
52 return;
53 Vec_BitWriteEntry(vVisit, Var, 1);
54 if ( Vec_IntEntry(vMapping, Var) ) // primary input or constant 0
55 {
56 pCut = Vec_IntEntryP( vMapping, Vec_IntEntry(vMapping, Var) );
57 for ( i = 1; i <= pCut[0]; i++ )
58 Gia_ManCollectVars_rec( pCut[i], vMapping, vRes, vVisit );
59 }
60 Vec_IntPush( vRes, Var );
61}
int Var
Definition exorList.c:228
Here is the call graph for this function:
Here is the caller graph for this function:

◆ Gia_ManSatokoCall()

void Gia_ManSatokoCall ( Gia_Man_t * p,
satoko_opts_t * opts,
int fSplit,
int fIncrem )

Definition at line 214 of file giaSatoko.c.

215{
216 int fUseCone = 1;
217 Gia_Man_t * pOne;
218 Gia_Obj_t * pRoot;
219 Vec_Int_t * vCone;
220 int i, iLit, status;
221 if ( fIncrem )
222 {
223 abctime clk = Abc_Clock();
224 Cnf_Dat_t * pCnf = (Cnf_Dat_t *)Mf_ManGenerateCnf( p, 8, 0, 0, fUseCone, 0 );
225 satoko_t * pSat = Gia_ManSatokoInit( pCnf, opts );
226 Gia_ManForEachCo( p, pRoot, i )
227 {
228 abctime clk = Abc_Clock();
229 iLit = Abc_Var2Lit( i+1, 0 );
230 satoko_assump_push( pSat, iLit );
231 if ( fUseCone )
232 {
233 vCone = Gia_ManCollectVars( i+1, pCnf->vMapping, pCnf->nVars );
234 satoko_mark_cone( pSat, Vec_IntArray(vCone), Vec_IntSize(vCone) );
235 printf( "Cone has %6d vars (out of %6d). ", Vec_IntSize(vCone), pCnf->nVars );
236 status = satoko_solve( pSat );
237 satoko_unmark_cone( pSat, Vec_IntArray(vCone), Vec_IntSize(vCone) );
238 Vec_IntFree( vCone );
239 }
240 else
241 {
242 status = satoko_solve( pSat );
243 }
244 satoko_assump_pop( pSat );
245 Gia_ManSatokoReport( i, status, Abc_Clock() - clk );
246 }
247 Cnf_DataFree( pCnf );
248 satoko_destroy( pSat );
249 Abc_PrintTime( 1, "Total time", Abc_Clock() - clk );
250 return;
251 }
252 if ( fSplit )
253 {
254 abctime clk = Abc_Clock();
255 Gia_ManForEachCo( p, pRoot, i )
256 {
257 pOne = Gia_ManDupDfsCone( p, pRoot );
258 Gia_ManSatokoCallOne( pOne, opts, i );
259 Gia_ManStop( pOne );
260 }
261 Abc_PrintTime( 1, "Total time", Abc_Clock() - clk );
262 return;
263 }
264 Gia_ManSatokoCallOne( p, opts, -1 );
265}
ABC_INT64_T abctime
Definition abc_global.h:332
struct Cnf_Dat_t_ Cnf_Dat_t
Definition cnf.h:52
void Cnf_DataFree(Cnf_Dat_t *p)
Definition cnfMan.c:207
Cube * p
Definition exorList.c:222
satoko_t * Gia_ManSatokoInit(Cnf_Dat_t *pCnf, satoko_opts_t *opts)
Definition giaSatoko.c:172
Vec_Int_t * Gia_ManCollectVars(int Root, Vec_Int_t *vMapping, int nVars)
Definition giaSatoko.c:62
int Gia_ManSatokoCallOne(Gia_Man_t *p, satoko_opts_t *opts, int iOutput)
Definition giaSatoko.c:199
void Gia_ManSatokoReport(int iOutput, int status, abctime clk)
Definition giaSatoko.c:83
void Gia_ManStop(Gia_Man_t *p)
Definition giaMan.c:82
Gia_Man_t * Gia_ManDupDfsCone(Gia_Man_t *p, Gia_Obj_t *pObj)
Definition giaDup.c:2188
struct Gia_Obj_t_ Gia_Obj_t
Definition gia.h:76
struct Gia_Man_t_ Gia_Man_t
Definition gia.h:96
#define Gia_ManForEachCo(p, pObj, i)
Definition gia.h:1236
void * Mf_ManGenerateCnf(Gia_Man_t *pGia, int nLutSize, int fCnfObjIds, int fAddOrCla, int fMapping, int fVerbose)
Definition giaMf.c:1877
int satoko_solve(satoko_t *)
Definition solver_api.c:314
struct solver_t_ satoko_t
Definition satoko.h:35
void satoko_assump_push(satoko_t *s, int)
Definition solver_api.c:298
void satoko_assump_pop(satoko_t *s)
Definition solver_api.c:306
void satoko_destroy(satoko_t *)
Definition solver_api.c:132
int nVars
Definition cnf.h:59
Vec_Int_t * vMapping
Definition cnf.h:67
Here is the call graph for this function:

◆ Gia_ManSatokoCallOne()

int Gia_ManSatokoCallOne ( Gia_Man_t * p,
satoko_opts_t * opts,
int iOutput )

Definition at line 199 of file giaSatoko.c.

200{
201 abctime clk = Abc_Clock();
202 satoko_t * pSat;
203 int status = SATOKO_UNSAT, Cost = 0;
204 pSat = Gia_ManSatokoCreate( p, opts );
205 if ( pSat )
206 {
207 status = satoko_solve( pSat );
208 Cost = satoko_stats(pSat)->n_conflicts;
209 satoko_destroy( pSat );
210 }
211 Gia_ManSatokoReport( iOutput, status, Abc_Clock() - clk );
212 return Cost;
213}
satoko_t * Gia_ManSatokoCreate(Gia_Man_t *p, satoko_opts_t *opts)
Definition giaSatoko.c:188
@ SATOKO_UNSAT
Definition satoko.h:25
satoko_stats_t * satoko_stats(satoko_t *)
Definition solver_api.c:433
long n_conflicts
Definition satoko.h:81
Here is the call graph for this function:
Here is the caller graph for this function:

◆ Gia_ManSatokoCreate()

satoko_t * Gia_ManSatokoCreate ( Gia_Man_t * p,
satoko_opts_t * opts )

Definition at line 188 of file giaSatoko.c.

189{
190 Cnf_Dat_t * pCnf = (Cnf_Dat_t *)Mf_ManGenerateCnf( p, 8, 0, 1, 0, 0 );
191 satoko_t * pSat = Gia_ManSatokoInit( pCnf, opts );
192 int status = pSat ? satoko_simplify(pSat) : SATOKO_OK;
193 Cnf_DataFree( pCnf );
194 if ( status == SATOKO_OK )
195 return pSat;
196 satoko_destroy( pSat );
197 return NULL;
198}
int satoko_simplify(satoko_t *)
Definition solver_api.c:202
@ SATOKO_OK
Definition satoko.h:19
Here is the call graph for this function:
Here is the caller graph for this function:

◆ Gia_ManSatokoDimacs()

void Gia_ManSatokoDimacs ( char * pFileName,
satoko_opts_t * opts )

Definition at line 148 of file giaSatoko.c.

149{
150 abctime clk = Abc_Clock();
151 int status = SATOKO_UNSAT;
152 satoko_t * pSat = Gia_ManSatokoFromDimacs( pFileName, opts );
153 if ( pSat )
154 {
155 status = satoko_solve( pSat );
156 satoko_destroy( pSat );
157 }
158 Gia_ManSatokoReport( -1, status, Abc_Clock() - clk );
159}
satoko_t * Gia_ManSatokoFromDimacs(char *pFileName, satoko_opts_t *opts)
Definition giaSatoko.c:99
Here is the call graph for this function:

◆ Gia_ManSatokoFromDimacs()

satoko_t * Gia_ManSatokoFromDimacs ( char * pFileName,
satoko_opts_t * opts )

Definition at line 99 of file giaSatoko.c.

100{
101 satoko_t * pSat = satoko_create();
102 char * pBuffer = Extra_FileReadContents( pFileName );
103 Vec_Int_t * vLits = Vec_IntAlloc( 100 );
104 char * pTemp; int fComp, Var, VarMax = 0;
105 for ( pTemp = pBuffer; *pTemp; pTemp++ )
106 {
107 if ( *pTemp == 'c' || *pTemp == 'p' )
108 {
109 while ( *pTemp != '\n' )
110 pTemp++;
111 continue;
112 }
113 while ( *pTemp == ' ' || *pTemp == '\t' || *pTemp == '\r' || *pTemp == '\n' )
114 pTemp++;
115 fComp = 0;
116 if ( *pTemp == '-' )
117 fComp = 1, pTemp++;
118 if ( *pTemp == '+' )
119 pTemp++;
120 Var = atoi( pTemp );
121 if ( Var == 0 ) {
122 if ( Vec_IntSize(vLits) > 0 )
123 {
124 satoko_setnvars( pSat, VarMax+1 );
125 if ( !satoko_add_clause( pSat, Vec_IntArray(vLits), Vec_IntSize(vLits) ) )
126 {
127 satoko_destroy(pSat);
128 Vec_IntFree( vLits );
129 ABC_FREE( pBuffer );
130 return NULL;
131 }
132 Vec_IntClear( vLits );
133 }
134 }
135 else
136 {
137 Var--;
138 VarMax = Abc_MaxInt( VarMax, Var );
139 Vec_IntPush( vLits, Abc_Var2Lit(Var, fComp) );
140 }
141 while ( *pTemp >= '0' && *pTemp <= '9' )
142 pTemp++;
143 }
144 ABC_FREE( pBuffer );
145 Vec_IntFree( vLits );
146 return pSat;
147}
#define ABC_FREE(obj)
Definition abc_global.h:267
char * Extra_FileReadContents(char *pFileName)
void satoko_setnvars(satoko_t *, int)
Definition solver_api.c:230
int satoko_add_clause(satoko_t *, int *, int)
Definition solver_api.c:255
satoko_t * satoko_create(void)
Definition solver_api.c:88
Here is the call graph for this function:
Here is the caller graph for this function:

◆ Gia_ManSatokoInit()

satoko_t * Gia_ManSatokoInit ( Cnf_Dat_t * pCnf,
satoko_opts_t * opts )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 172 of file giaSatoko.c.

173{
174 satoko_t * pSat = satoko_create();
175 int i;
176 //sat_solver_setnvars( pSat, p->nVars );
177 for ( i = 0; i < pCnf->nClauses; i++ )
178 {
179 if ( !satoko_add_clause( pSat, pCnf->pClauses[i], pCnf->pClauses[i+1]-pCnf->pClauses[i] ) )
180 {
181 satoko_destroy( pSat );
182 return NULL;
183 }
184 }
185 satoko_configure(pSat, opts);
186 return pSat;
187}
void satoko_configure(satoko_t *, satoko_opts_t *)
Definition solver_api.c:196
int ** pClauses
Definition cnf.h:62
int nClauses
Definition cnf.h:61
Here is the call graph for this function:
Here is the caller graph for this function:

◆ Gia_ManSatokoReport()

void Gia_ManSatokoReport ( int iOutput,
int status,
abctime clk )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 83 of file giaSatoko.c.

84{
85 if ( iOutput >= 0 )
86 Abc_Print( 1, "Output %6d : ", iOutput );
87 else
88 Abc_Print( 1, "Total: " );
89
90 if ( status == SATOKO_UNDEC )
91 Abc_Print( 1, "UNDECIDED " );
92 else if ( status == SATOKO_SAT )
93 Abc_Print( 1, "SATISFIABLE " );
94 else
95 Abc_Print( 1, "UNSATISFIABLE " );
96
97 Abc_PrintTime( 1, "Time", clk );
98}
@ SATOKO_SAT
Definition satoko.h:24
@ SATOKO_UNDEC
Definition satoko.h:23
Here is the caller graph for this function: