Compiler warnings.

12 files changed, 36 insertions, 36 deletions

diff --git a/src/aig/aig/aigDup.c b/src/aig/aig/aigDup.c
index 86ad2104..3ccd8dab 100644
--- a/src/aig/aig/aigDup.c
+++ b/src/aig/aig/aigDup.c
@@ -46,7 +46,7 @@ ABC_NAMESPACE_IMPL_START
 Aig_Man_t * Aig_ManDupSimple( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i;
     assert( p->pManTime == NULL );
     // create the new manager
@@ -107,7 +107,7 @@ Aig_Man_t * Aig_ManDupSimple( Aig_Man_t * p )
 Aig_Man_t * Aig_ManDupSimpleWithHints( Aig_Man_t * p, Vec_Int_t * vHints )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i, Entry;
     assert( p->nAsserts == 0 || p->nConstrs == 0 );
     // create the new manager
@@ -184,7 +184,7 @@ Aig_Obj_t * Aig_ManDupSimpleDfs_rec( Aig_Man_t * pNew, Aig_Man_t * p, Aig_Obj_t
 Aig_Man_t * Aig_ManDupSimpleDfs( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i;
     assert( p->pManTime == NULL );
     // create the new manager
@@ -240,7 +240,7 @@ Aig_Man_t * Aig_ManDupSimpleDfs( Aig_Man_t * p )
 Aig_Man_t * Aig_ManDupSimpleDfsPart( Aig_Man_t * p, Vec_Ptr_t * vPis, Vec_Ptr_t * vPos )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i;
     // create the new manager
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -277,7 +277,7 @@ Aig_Man_t * Aig_ManDupSimpleDfsPart( Aig_Man_t * p, Vec_Ptr_t * vPis, Vec_Ptr_t
 Aig_Man_t * Aig_ManDupOrdered( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i, nNodes;
     // create the new manager
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -345,7 +345,7 @@ Aig_Man_t * Aig_ManDupOrdered( Aig_Man_t * p )
 Aig_Man_t * Aig_ManDupCof( Aig_Man_t * p, int iInput, int Value )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i;
     assert( p->pManTime == NULL );
     // create the new manager
@@ -413,7 +413,7 @@ Aig_Man_t * Aig_ManDupCof( Aig_Man_t * p, int iInput, int Value )
 Aig_Man_t * Aig_ManDupTrim( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i, nNodes;
     // create the new manager
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -462,7 +462,7 @@ Aig_Man_t * Aig_ManDupTrim( Aig_Man_t * p )
 Aig_Man_t * Aig_ManDupExor( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i;
     // create the new manager
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -563,7 +563,7 @@ Aig_Obj_t * Aig_ManDupDfs_rec( Aig_Man_t * pNew, Aig_Man_t * p, Aig_Obj_t * pObj
 Aig_Man_t * Aig_ManDupDfs( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i, nNodes;
     // create the new manager
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -626,7 +626,7 @@ Aig_Man_t * Aig_ManDupDfs( Aig_Man_t * p )
 Vec_Ptr_t * Aig_ManOrderPios( Aig_Man_t * p, Aig_Man_t * pOrder )
 {
     Vec_Ptr_t * vPios;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i;
     assert( Aig_ManCiNum(p) == Aig_ManCiNum(pOrder) );
     assert( Aig_ManCoNum(p) == Aig_ManCoNum(pOrder) );
@@ -694,7 +694,7 @@ Aig_Obj_t * Aig_ManDupDfsGuided_rec( Aig_Man_t * pNew, Aig_Man_t * p, Aig_Obj_t
 Aig_Man_t * Aig_ManDupDfsGuided( Aig_Man_t * p, Vec_Ptr_t * vPios )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i, nNodes;
     // create the new manager
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -764,7 +764,7 @@ Aig_Man_t * Aig_ManDupLevelized( Aig_Man_t * p )
 {
     Vec_Vec_t * vLevels;
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj, * pObjNew;
+    Aig_Obj_t * pObj, * pObjNew = NULL;
     int i, k;
     // create the new manager
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -835,7 +835,7 @@ Aig_Man_t * Aig_ManDupLevelized( Aig_Man_t * p )
 Aig_Man_t * Aig_ManDupWithoutPos( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i;
     // create the new manager
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -871,7 +871,7 @@ Aig_Man_t * Aig_ManDupWithoutPos( Aig_Man_t * p )
 Aig_Man_t * Aig_ManDupFlopsOnly( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i;
     pNew = Aig_ManDupWithoutPos( p );
     Saig_ManForEachLi( p, pObj, i )
@@ -920,7 +920,7 @@ static inline Aig_Obj_t * Aig_ObjChild1Repres( Aig_Man_t * p, Aig_Obj_t * pObj )
 Aig_Man_t * Aig_ManDupRepres( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i;
     // start the HOP package
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -995,7 +995,7 @@ Aig_Obj_t * Aig_ManDupRepres_rec( Aig_Man_t * pNew, Aig_Man_t * p, Aig_Obj_t * p
 Aig_Man_t * Aig_ManDupRepresDfs( Aig_Man_t * p )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i;
     // start the HOP package
     pNew = Aig_ManStart( Aig_ManObjNumMax(p) );
@@ -1049,7 +1049,7 @@ Aig_Man_t * Aig_ManDupRepresDfs( Aig_Man_t * p )
 Aig_Man_t * Aig_ManCreateMiter( Aig_Man_t * p1, Aig_Man_t * p2, int Oper )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i;
     assert( Aig_ManRegNum(p1) == 0 );
     assert( Aig_ManRegNum(p2) == 0 );
@@ -1152,7 +1152,7 @@ Aig_Man_t * Aig_ManDupOrpos( Aig_Man_t * p, int fAddRegs )
 Aig_Man_t * Aig_ManDupOneOutput( Aig_Man_t * p, int iPoNum, int fAddRegs )
 {
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i;
     assert( Aig_ManRegNum(p) > 0 );
     assert( iPoNum < Aig_ManCoNum(p)-Aig_ManRegNum(p) );
@@ -1199,7 +1199,7 @@ Aig_Man_t * Aig_ManDupOneOutput( Aig_Man_t * p, int iPoNum, int fAddRegs )
 Aig_Man_t * Aig_ManDupUnsolvedOutputs( Aig_Man_t * p, int fAddRegs )
 { 
     Aig_Man_t * pNew;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i, nOuts = 0;
     assert( Aig_ManRegNum(p) > 0 );
     if ( p->nConstrs > 0 )
@@ -1255,7 +1255,7 @@ Aig_Man_t * Aig_ManDupUnsolvedOutputs( Aig_Man_t * p, int fAddRegs )
 Aig_Man_t * Aig_ManDupArray( Vec_Ptr_t * vArray )
 {
     Aig_Man_t * p, * pNew;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i, k;
     if ( Vec_PtrSize(vArray) == 0 )
         return NULL;
@@ -1303,7 +1303,7 @@ Aig_Man_t * Aig_ManDupNodes( Aig_Man_t * pMan, Vec_Ptr_t * vArray )
 {
     Aig_Man_t * pNew;
     Vec_Ptr_t * vObjs;
-    Aig_Obj_t * pObj;
+    Aig_Obj_t * pObj = NULL;
     int i;
     if ( Vec_PtrSize(vArray) == 0 )
         return NULL;
diff --git a/src/aig/aig/aigObj.c b/src/aig/aig/aigObj.c
index 98025ae3..4de2e191 100644
--- a/src/aig/aig/aigObj.c
+++ b/src/aig/aig/aigObj.c
@@ -392,7 +392,7 @@ void Aig_ObjPrint( Aig_Man_t * p, Aig_Obj_t * pObj )
 ***********************************************************************/
 void Aig_NodeFixBufferFanins( Aig_Man_t * p, Aig_Obj_t * pObj, int fUpdateLevel )
 {
-    Aig_Obj_t * pFanReal0, * pFanReal1, * pResult;
+    Aig_Obj_t * pFanReal0, * pFanReal1, * pResult = NULL;
     p->nBufFixes++;
     if ( Aig_ObjIsCo(pObj) )
     {
diff --git a/src/aig/gia/giaCSat.c b/src/aig/gia/giaCSat.c
index 65cf2961..e0e0e315 100644
--- a/src/aig/gia/giaCSat.c
+++ b/src/aig/gia/giaCSat.c
@@ -860,7 +860,7 @@ int Cbs_ManPropagate( Cbs_Man_t * p, int Level )
 int Cbs_ManSolve_rec( Cbs_Man_t * p, int Level )
 { 
     Cbs_Que_t * pQue = &(p->pClauses);
-    Gia_Obj_t * pVar, * pDecVar;
+    Gia_Obj_t * pVar = NULL, * pDecVar;
     int hClause, hLearn0, hLearn1;
     int iPropHead, iJustHead, iJustTail;
     // propagate assignments
diff --git a/src/aig/gia/giaCSatOld.c b/src/aig/gia/giaCSatOld.c
index a562c8ae..43a65a4b 100644
--- a/src/aig/gia/giaCSatOld.c
+++ b/src/aig/gia/giaCSatOld.c
@@ -585,7 +585,7 @@ int Cbs0_ManPropagate( Cbs0_Man_t * p )
 ***********************************************************************/
 int Cbs0_ManSolve_rec( Cbs0_Man_t * p )
 {
-    Gia_Obj_t * pVar, * pDecVar;
+    Gia_Obj_t * pVar = NULL, * pDecVar;
     int iPropHead, iJustHead, iJustTail;
     // propagate assignments
     assert( !Cbs0_QueIsEmpty(&p->pProp) );
diff --git a/src/aig/gia/giaCTas.c b/src/aig/gia/giaCTas.c
index 73575733..3dded68b 100644
--- a/src/aig/gia/giaCTas.c
+++ b/src/aig/gia/giaCTas.c
@@ -1285,7 +1285,7 @@ int Tas_ManPropagate( Tas_Man_t * p, int Level )
 int Tas_ManSolve_rec( Tas_Man_t * p, int Level )
 { 
     Tas_Que_t * pQue = &(p->pClauses);
-    Gia_Obj_t * pVar, * pDecVar = NULL;
+    Gia_Obj_t * pVar = NULL, * pDecVar = NULL;
     int hClause, hLearn0, hLearn1;
     int iPropHead, iJustHead, iJustTail;
     // propagate assignments
diff --git a/src/aig/gia/giaEnable.c b/src/aig/gia/giaEnable.c
index b7d0616d..3377a49c 100644
--- a/src/aig/gia/giaEnable.c
+++ b/src/aig/gia/giaEnable.c
@@ -516,7 +516,7 @@ Gia_Man_t * Gia_ManRemoveEnables( Gia_Man_t * p )
     Vec_Ptr_t * vCtrls, * vDatas;
     Vec_Int_t * vFlopClasses;
     Gia_Man_t * pNew, * pAux; 
-    Gia_Obj_t * pFlopIn, * pFlopOut, * pDriver, * pFan0, * pFan1, * pCtrl, * pData, * pObj;
+    Gia_Obj_t * pFlopIn, * pFlopOut, * pDriver, * pFan0, * pFan1, * pCtrl = NULL, * pData, * pObj;
     int i, iClass, fCompl, Counter = 0;
     vCtrls = Vec_PtrAlloc( 100 );
     Vec_PtrPush( vCtrls, NULL );
diff --git a/src/aig/gia/giaFrames.c b/src/aig/gia/giaFrames.c
index 3b33e3de..39493be8 100644
--- a/src/aig/gia/giaFrames.c
+++ b/src/aig/gia/giaFrames.c
@@ -438,7 +438,7 @@ void * Gia_ManUnrollAdd( void * pMan, int fMax )
 {
     Gia_ManUnr_t * p = (Gia_ManUnr_t *)pMan;
     Gia_Obj_t * pObj;
-    int f, i, Lit, Beg, End;
+    int f, i, Lit = 0, Beg, End;
     // create PIs on demand
     if ( p->pPars->fSaveLastLit ) 
         for ( i = 0; i < Gia_ManPiNum(p->pAig); i++ )
diff --git a/src/aig/gia/giaIf.c b/src/aig/gia/giaIf.c
index 70cf707d..f2d63060 100644
--- a/src/aig/gia/giaIf.c
+++ b/src/aig/gia/giaIf.c
@@ -773,7 +773,7 @@ static inline If_Obj_t * If_ManFanin1Copy( If_Man_t * pIfMan, Gia_Obj_t * pObj )
 If_Man_t * Gia_ManToIf( Gia_Man_t * p, If_Par_t * pPars )
 {
     If_Man_t * pIfMan;
-    If_Obj_t * pIfObj;
+    If_Obj_t * pIfObj = NULL;
     Gia_Obj_t * pObj;
     int i;
     // create levels with choices
@@ -1500,7 +1500,7 @@ int Gia_ManFromIfLogicFindLut( If_Man_t * pIfMan, Gia_Man_t * pNew, If_Cut_t * p
 ***********************************************************************/
 void Gia_ManFromIfGetConfig( Vec_Int_t * vConfigs, If_Man_t * pIfMan, If_Cut_t * pCutBest, int iLit, Vec_Str_t * vConfigsStr )
 {
-    If_Obj_t * pIfObj;
+    If_Obj_t * pIfObj = NULL;
     word * pPerm = If_DsdManGetFuncConfig( pIfMan->pIfDsdMan, If_CutDsdLit(pIfMan, pCutBest) ); // cell input -> DSD input
     char * pCutPerm = If_CutDsdPerm( pIfMan, pCutBest ); // DSD input -> cut input
     word * pArray;  int v, i, Lit, Var;
@@ -2296,7 +2296,7 @@ Gia_Man_t * Gia_ManPerformMappingInt( Gia_Man_t * p, If_Par_t * pPars )
         pNew = Gia_ManFromIfLogic( pIfMan );
     if ( p->vCiArrs || p->vCoReqs )
     {
-        If_Obj_t * pIfObj;
+        If_Obj_t * pIfObj = NULL;
         Vec_IntFreeP( &p->vCoArrs );
         p->vCoArrs = Vec_IntAlloc( Gia_ManCoNum(p) );
         If_ManForEachCo( pIfMan, pIfObj, i )
diff --git a/src/aig/gia/giaMini.c b/src/aig/gia/giaMini.c
index b4150807..3fb8aecb 100644
--- a/src/aig/gia/giaMini.c
+++ b/src/aig/gia/giaMini.c
@@ -61,7 +61,7 @@ Gia_Man_t * Gia_ManFromMiniAig( Mini_Aig_t * p, Vec_Int_t ** pvCopies )
 {
     Gia_Man_t * pGia, * pTemp;
     Vec_Int_t * vCopies;
-    int i, iGiaLit, nNodes;
+    int i, iGiaLit = 0, nNodes;
     // get the number of nodes
     nNodes = Mini_AigNodeNum(p);
     // create ABC network
diff --git a/src/aig/gia/giaSwitch.c b/src/aig/gia/giaSwitch.c
index 58acbb69..b1c5eb82 100644
--- a/src/aig/gia/giaSwitch.c
+++ b/src/aig/gia/giaSwitch.c
@@ -146,7 +146,7 @@ void Gia_ManSwiDelete( Gia_ManSwi_t * p )
 ***********************************************************************/
 static inline void Gia_ManSwiSimInfoRandom( Gia_ManSwi_t * p, unsigned * pInfo, int nProbNum )
 {
-    unsigned Mask;
+    unsigned Mask = 0;
     int w, i;
     if ( nProbNum == -1 )
     { // 3/8 = 1/4 + 1/8
@@ -185,7 +185,7 @@ static inline void Gia_ManSwiSimInfoRandom( Gia_ManSwi_t * p, unsigned * pInfo,
 ***********************************************************************/
 static inline void Gia_ManSwiSimInfoRandomShift( Gia_ManSwi_t * p, unsigned * pInfo, int nProbNum )
 {
-    unsigned Mask;
+    unsigned Mask = 0;
     int w, i;
     if ( nProbNum == -1 )
     { // 3/8 = 1/4 + 1/8
diff --git a/src/aig/ivy/ivyDsd.c b/src/aig/ivy/ivyDsd.c
index 5a1deb03..78a935be 100644
--- a/src/aig/ivy/ivyDsd.c
+++ b/src/aig/ivy/ivyDsd.c
@@ -219,8 +219,8 @@ int Ivy_TruthDsd( unsigned uTruth, Vec_Int_t * vTree )
 int Ivy_TruthDecompose_rec( unsigned uTruth, Vec_Int_t * vTree )
 {
     Ivy_Dec_t Node;
-    int Supp[5], Vars0[5], Vars1[5], Vars2[5], * pVars;
-    int nSupp, Count0, Count1, Count2, nVars, RetValue, fCompl, i;
+    int Supp[5], Vars0[5], Vars1[5], Vars2[5], * pVars = NULL;
+    int nSupp, Count0, Count1, Count2, nVars = 0, RetValue, fCompl = 0, i;
     unsigned uTruthCof, uCof0, uCof1;
 
     // get constant confactors
diff --git a/src/aig/ivy/ivyObj.c b/src/aig/ivy/ivyObj.c
index 2829fd38..527f4daf 100644
--- a/src/aig/ivy/ivyObj.c
+++ b/src/aig/ivy/ivyObj.c
@@ -441,7 +441,7 @@ void Ivy_ObjReplace( Ivy_Man_t * p, Ivy_Obj_t * pObjOld, Ivy_Obj_t * pObjNew, in
 ***********************************************************************/
 void Ivy_NodeFixBufferFanins( Ivy_Man_t * p, Ivy_Obj_t * pNode, int fUpdateLevel )
 {
-    Ivy_Obj_t * pFanReal0, * pFanReal1, * pResult;
+    Ivy_Obj_t * pFanReal0, * pFanReal1, * pResult = NULL;
     if ( Ivy_ObjIsPo(pNode) )
     {
         if ( !Ivy_ObjIsBuf(Ivy_ObjFanin0(pNode)) )