diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2014-10-28 23:53:17 -0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2014-10-28 23:53:17 -0700 |
commit | 135bf3ecdf6609d4c8e97727cb3c8ad8042a6b4c (patch) | |
tree | 125bcd8c87686becd6f492c775a37c2fe83f6d3d | |
parent | c556baa92eb9973b1d181177557cfb9025196a92 (diff) | |
download | abc-135bf3ecdf6609d4c8e97727cb3c8ad8042a6b4c.tar.gz abc-135bf3ecdf6609d4c8e97727cb3c8ad8042a6b4c.tar.bz2 abc-135bf3ecdf6609d4c8e97727cb3c8ad8042a6b4c.zip |
Compiler warnings.
-rw-r--r-- | src/aig/ivy/ivyRwr.c | 2 | ||||
-rw-r--r-- | src/aig/ivy/ivySeq.c | 2 | ||||
-rw-r--r-- | src/base/abci/abcRec3.c | 2 | ||||
-rw-r--r-- | src/bool/rpo/rpo.c | 2 | ||||
-rw-r--r-- | src/bool/rpo/rpo.h | 1 | ||||
-rw-r--r-- | src/misc/extra/extraUtilSupp.c | 2 | ||||
-rw-r--r-- | src/opt/rwr/rwrEva.c | 2 | ||||
-rw-r--r-- | src/sat/bsat/satSolver.h | 4 |
8 files changed, 9 insertions, 8 deletions
diff --git a/src/aig/ivy/ivyRwr.c b/src/aig/ivy/ivyRwr.c index a4bfe54b..30bff58f 100644 --- a/src/aig/ivy/ivyRwr.c +++ b/src/aig/ivy/ivyRwr.c @@ -163,7 +163,7 @@ int Ivy_NodeRewrite( Ivy_Man_t * pMan, Rwt_Man_t * p, Ivy_Obj_t * pNode, int fUp char * pPerm; int Required, nNodesSaved; int nNodesSaveCur = -1; // Suppress "might be used uninitialized" - int i, c, GainCur, GainBest = -1; + int i, c, GainCur = -1, GainBest = -1; abctime clk, clk2; p->nNodesConsidered++; diff --git a/src/aig/ivy/ivySeq.c b/src/aig/ivy/ivySeq.c index c231dea6..0ffe2d15 100644 --- a/src/aig/ivy/ivySeq.c +++ b/src/aig/ivy/ivySeq.c @@ -156,7 +156,7 @@ int Ivy_NodeRewriteSeq( Ivy_Man_t * pMan, Rwt_Man_t * p, Ivy_Obj_t * pNode, int char * pPerm; int nNodesSaved; int nNodesSaveCur = -1; // Suppress "might be used uninitialized" - int i, c, GainCur, GainBest = -1; + int i, c, GainCur = -1, GainBest = -1; abctime clk, clk2;//, clk3; p->nNodesConsidered++; diff --git a/src/base/abci/abcRec3.c b/src/base/abci/abcRec3.c index 1d61ffae..965a0ecd 100644 --- a/src/base/abci/abcRec3.c +++ b/src/base/abci/abcRec3.c @@ -1430,4 +1430,4 @@ void Abc_NtkRecStop3() //////////////////////////////////////////////////////////////////////// -ABC_NAMESPACE_IMPL_END
\ No newline at end of file +ABC_NAMESPACE_IMPL_END diff --git a/src/bool/rpo/rpo.c b/src/bool/rpo/rpo.c index cf24fbe1..03988551 100644 --- a/src/bool/rpo/rpo.c +++ b/src/bool/rpo/rpo.c @@ -380,4 +380,4 @@ Literal_t* Rpo_Recursion(unsigned* target, Literal_t** vecLit, int nLit, int nLi return result; } -ABC_NAMESPACE_IMPL_END
\ No newline at end of file +ABC_NAMESPACE_IMPL_END diff --git a/src/bool/rpo/rpo.h b/src/bool/rpo/rpo.h index e4936324..8119bf27 100644 --- a/src/bool/rpo/rpo.h +++ b/src/bool/rpo/rpo.h @@ -55,4 +55,5 @@ ABC_NAMESPACE_HEADER_END #endif +
\ No newline at end of file diff --git a/src/misc/extra/extraUtilSupp.c b/src/misc/extra/extraUtilSupp.c index bb513863..59a1d129 100644 --- a/src/misc/extra/extraUtilSupp.c +++ b/src/misc/extra/extraUtilSupp.c @@ -402,7 +402,7 @@ static inline int Abc_SuppCountOnes64( word i ) } int Abc_SuppFindVar( Vec_Wec_t * pS, Vec_Wec_t * pD, int nVars ) { - int v, vBest = -1, dBest; + int v, vBest = -1, dBest = -1; for ( v = 0; v < nVars; v++ ) { if ( Vec_WecLevelSize(pS, v) ) diff --git a/src/opt/rwr/rwrEva.c b/src/opt/rwr/rwrEva.c index a4d50fca..463e9bd7 100644 --- a/src/opt/rwr/rwrEva.c +++ b/src/opt/rwr/rwrEva.c @@ -68,7 +68,7 @@ int Rwr_NodeRewrite( Rwr_Man_t * p, Cut_Man_t * pManCut, Abc_Obj_t * pNode, int char * pPerm; int Required, nNodesSaved; int nNodesSaveCur = -1; // Suppress "might be used uninitialized" - int i, GainCur, GainBest = -1; + int i, GainCur = -1, GainBest = -1; abctime clk, clk2;//, Counter; p->nNodesConsidered++; diff --git a/src/sat/bsat/satSolver.h b/src/sat/bsat/satSolver.h index ccb7d6c4..c82879de 100644 --- a/src/sat/bsat/satSolver.h +++ b/src/sat/bsat/satSolver.h @@ -211,8 +211,8 @@ static void sat_solver_act_var_clear(sat_solver* s) { int i; for (i = 0; i < s->size; i++) - s->activity[i] = 0.0; - s->var_inc = 1.0; + s->activity[i] = 0; + s->var_inc = 1; } static void sat_solver_compress(sat_solver* s) { |