summaryrefslogtreecommitdiffstats
path: root/src/base/abci
diff options
context:
space:
mode:
Diffstat (limited to 'src/base/abci')
-rw-r--r--src/base/abci/abcBm.c4
-rw-r--r--src/base/abci/abcDsd.c2
-rw-r--r--src/base/abci/abcMini.c4
-rw-r--r--src/base/abci/abcRec3.c4
-rw-r--r--src/base/abci/abcRr.c2
-rw-r--r--src/base/abci/abcSat.c6
6 files changed, 11 insertions, 11 deletions
diff --git a/src/base/abci/abcBm.c b/src/base/abci/abcBm.c
index 860b4d27..80bb0d83 100644
--- a/src/base/abci/abcBm.c
+++ b/src/base/abci/abcBm.c
@@ -872,7 +872,7 @@ int Abc_NtkMiterSatBm( Abc_Ntk_t * pNtk, ABC_INT64_T nConfLimit, ABC_INT64_T nIn
{
static sat_solver * pSat = NULL;
lbool status;
- int RetValue;
+ int RetValue = 0;
abctime clk;
extern int Abc_NodeAddClausesTop( sat_solver * pSat, Abc_Obj_t * pNode, Vec_Int_t * vVars );
@@ -970,7 +970,7 @@ int Abc_NtkBmSat( Abc_Ntk_t * pNtk1, Abc_Ntk_t * pNtk2, Vec_Ptr_t * iMatchPairs,
Abc_Ntk_t * pMiter = NULL;
Abc_Ntk_t * pCnf;
- int RetValue;
+ int RetValue = 0;
// get the miter of the two networks
if( mode == 0 )
diff --git a/src/base/abci/abcDsd.c b/src/base/abci/abcDsd.c
index 9104c4d6..4d8f5217 100644
--- a/src/base/abci/abcDsd.c
+++ b/src/base/abci/abcDsd.c
@@ -220,7 +220,7 @@ Abc_Obj_t * Abc_NtkDsdConstructNode( Dsd_Manager_t * pManDsd, Dsd_Node_t * pNode
DdManager * ddNew = (DdManager *)pNtkNew->pManFunc;
Dsd_Node_t * pFaninDsd;
Abc_Obj_t * pNodeNew, * pFanin;
- DdNode * bLocal, * bTemp, * bVar;
+ DdNode * bLocal = NULL, * bTemp, * bVar;
Dsd_Type_t Type;
int i, nDecs;
diff --git a/src/base/abci/abcMini.c b/src/base/abci/abcMini.c
index 876f4c8c..67ce8382 100644
--- a/src/base/abci/abcMini.c
+++ b/src/base/abci/abcMini.c
@@ -60,7 +60,7 @@ Abc_Obj_t * Abc_NodeFanin1Copy( Abc_Ntk_t * pNtk, Vec_Int_t * vCopies, Mini_Aig_
Abc_Ntk_t * Abc_NtkFromMiniAig( Mini_Aig_t * p )
{
Abc_Ntk_t * pNtk;
- Abc_Obj_t * pObj;
+ Abc_Obj_t * pObj = NULL;
Vec_Int_t * vCopies;
int i, nNodes;
// get the number of nodes
@@ -123,7 +123,7 @@ int Abc_NodeFanin1Copy2( Abc_Obj_t * pObj )
Mini_Aig_t * Abc_NtkToMiniAig( Abc_Ntk_t * pNtk )
{
Mini_Aig_t * p;
- Abc_Obj_t * pObj;
+ Abc_Obj_t * pObj = NULL;
int i;
assert( Abc_NtkIsStrash(pNtk) );
// create the manager
diff --git a/src/base/abci/abcRec3.c b/src/base/abci/abcRec3.c
index 965a0ecd..6d2d58eb 100644
--- a/src/base/abci/abcRec3.c
+++ b/src/base/abci/abcRec3.c
@@ -1005,7 +1005,7 @@ int If_CutDelayRecCost3( If_Man_t * pIfMan, If_Cut_t * pCut, If_Obj_t * pObj )
{
Lms_Man_t * p = s_pMan3;
char pCanonPerm[LMS_VAR_MAX];
- unsigned uCanonPhase;
+ unsigned uCanonPhase = 0;
// make sure the cut functions match the library
assert( p->nVars == (int)pCut->nLimit );
// if this assertion fires, it means that LMS manager was used for library construction
@@ -1032,7 +1032,7 @@ Hop_Obj_t * Abc_RecToHop3( Hop_Man_t * pMan, If_Man_t * pIfMan, If_Cut_t * pCut,
{
Lms_Man_t * p = s_pMan3;
char pCanonPerm[LMS_VAR_MAX];
- unsigned uCanonPhase;
+ unsigned uCanonPhase = 0;
Hop_Obj_t * pFan0, * pFan1, * pHopObj;
Gia_Man_t * pGia = p->pGia;
Gia_Obj_t * pGiaPo, * pGiaTemp = NULL;
diff --git a/src/base/abci/abcRr.c b/src/base/abci/abcRr.c
index 9a670b67..52d1fd32 100644
--- a/src/base/abci/abcRr.c
+++ b/src/base/abci/abcRr.c
@@ -384,7 +384,7 @@ p->timeProve += Abc_Clock() - clk;
***********************************************************************/
int Abc_NtkRRUpdate( Abc_Ntk_t * pNtk, Abc_Obj_t * pNode, Abc_Obj_t * pFanin, Abc_Obj_t * pFanout )
{
- Abc_Obj_t * pNodeNew, * pFanoutNew;
+ Abc_Obj_t * pNodeNew = NULL, * pFanoutNew = NULL;
assert( pFanout == NULL );
assert( !Abc_ObjIsComplement(pNode) );
assert( !Abc_ObjIsComplement(pFanin) );
diff --git a/src/base/abci/abcSat.c b/src/base/abci/abcSat.c
index bc956e5e..f0ed1532 100644
--- a/src/base/abci/abcSat.c
+++ b/src/base/abci/abcSat.c
@@ -57,7 +57,7 @@ int Abc_NtkMiterSat( Abc_Ntk_t * pNtk, ABC_INT64_T nConfLimit, ABC_INT64_T nInsL
{
sat_solver * pSat;
lbool status;
- int RetValue;
+ int RetValue = 0;
abctime clk;
if ( pNumConfs )
@@ -677,7 +677,7 @@ int Abc_NodeAddClauses( sat_solver * pSat, char * pSop0, char * pSop1, Abc_Obj_t
{
Abc_Obj_t * pFanin;
int i, c, nFanins;
- int RetValue;
+ int RetValue = 0;
char * pCube;
nFanins = Abc_ObjFaninNum( pNode );
@@ -767,7 +767,7 @@ int Abc_NodeAddClauses( sat_solver * pSat, char * pSop0, char * pSop1, Abc_Obj_t
int Abc_NodeAddClausesTop( sat_solver * pSat, Abc_Obj_t * pNode, Vec_Int_t * vVars )
{
Abc_Obj_t * pFanin;
- int RetValue;
+ int RetValue = 0;
pFanin = Abc_ObjFanin0(pNode);
if ( Abc_ObjFaninC0(pNode) )