luke
/
abc
mirror of https://github.com/YosysHQ/abc.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Silencing warnings.

This commit is contained in:
Alan Mishchenko 2012-07-11 15:52:33 -07:00
parent da02d5aa9d
commit 719396a2ff
2 changed files with 6 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/sat/bsat/satClause.h
View File

@ -113,10 +113,11 @@ static inline double Sat_MemMemoryAll( Sat_Mem_t * p ) { return 1.
// k is page offset
// this macro has to be fixed (Sat_MemClauseSize does not work for problem clauses in proof mode)
//#define Sat_MemForEachClause( p, c, i, k ) \
// for ( i = 0; i <= p->iPage[0]; i += 2 ) \
// for ( k = 2; k < Sat_MemLimit(p->pPages[i]) && ((c) = Sat_MemClause( p, i, k )); k += Sat_MemClauseSize(c) )
/*
#define Sat_MemForEachClause( p, c, i, k ) \
for ( i = 0; i <= p->iPage[0]; i += 2 ) \
for ( k = 2; k < Sat_MemLimit(p->pPages[i]) && ((c) = Sat_MemClause( p, i, k )); k += Sat_MemClauseSize(c) )
*/
#define Sat_MemForEachLearned( p, c, i, k ) \
for ( i = 1; i <= p->iPage[1]; i += 2 ) \
for ( k = 2; k < Sat_MemLimit(p->pPages[i]) && ((c) = Sat_MemClause( p, i, k )); k += Sat_MemClauseSize(c) )

4
src/sat/bsat/satSolver2.c
View File

@ -30,8 +30,6 @@ ABC_NAMESPACE_IMPL_START
#define SAT_USE_PROOF_LOGGING
static int Time = 0;
//=================================================================================================
// Debug:
@ -1359,7 +1357,7 @@ void sat_solver2_reducedb(sat_solver2* s)
int nLearnedOld = veci_size(&s->act_clas);
int * act_clas = veci_begin(&s->act_clas);
int * pPerm, * pSortValues, nCutoffValue, * pClaProofs;
int i, j, k, Id, nSelected, LastSize = 0;
int i, j, k, Id, nSelected;//, LastSize = 0;
int Counter, CounterStart;
clock_t clk = clock();
static int Count = 0;