clean up all compiler warnings in the bzl build

maliberty · maliberty · commit d9c954c21d45 · 2025-12-01T01:03:00.000Z
Signed-off-by: Matt Liberty &lt;mliberty@precisioninno.com&gt;
diff --git a/src/aig/aig/aigCanon.c b/src/aig/aig/aigCanon.c
@@ -98,7 +98,7 @@ static Aig_RMan_t * s_pRMan = NULL;
 ***********************************************************************/
 Aig_RMan_t * Aig_RManStart()
 {
-    static Bdc_Par_t Pars = {0}, * pPars = &Pars;
+  static Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;
     Aig_RMan_t * p;
     p = ABC_ALLOC( Aig_RMan_t, 1 );
     memset( p, 0, sizeof(Aig_RMan_t) );
diff --git a/src/aig/gia/giaBidec.c b/src/aig/gia/giaBidec.c
@@ -233,7 +233,7 @@ if ( Kit_TruthSupportSize(pTruth, nVars) != nVars )
 Gia_Man_t * Gia_ManPerformBidec( Gia_Man_t * p, int fVerbose )
 {
     Bdc_Man_t * pManDec;
-    Bdc_Par_t Pars = {0}, * pPars = &Pars;
+    Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;
     Vec_Int_t * vLeaves, * vTruth, * vVisited;
     Gia_Man_t * pNew, * pTemp;
     Gia_Obj_t * pObj;
diff --git a/src/aig/gia/giaCut.c b/src/aig/gia/giaCut.c
@@ -1078,7 +1078,7 @@ int Gia_ManCountSelfCuts( Gia_Man_t * p, Gia_Sto_t * pSto )
 void Gia_ManEvalCutHashing( Gia_Man_t * p, Gia_Sto_t * pSto )
 {
     Hsh_VecMan_t * pHash = Hsh_VecManStart( 100000 );
-    Vec_Int_t vTemp = {0};
+    Vec_Int_t vTemp = {0, 0, nullptr};
     Vec_Int_t * vLevel; int i, k, * pCut, nBytes = 0, nCuts = 0;
     Vec_WecForEachLevel( pSto->vCuts, vLevel, i ) if ( Vec_IntSize(vLevel) ) {
         Gia_Obj_t * pObj = Gia_ManObj(p, i);
diff --git a/src/aig/gia/giaRex.c b/src/aig/gia/giaRex.c
@@ -430,7 +430,7 @@ void Gia_ManAutomWalkOne( Gia_Man_t * p, int nSteps, Vec_Wrd_t * vStates, Vec_In
                 continue;
             Index = Vec_WrdFind( vStates, pNext[k] );
             Count = Index == -1 ? 0 : Vec_IntEntry( vCounts, Index );
-            if ( CountMin > Count || (CountMin != ABC_INFINITY && Count && ((float)CountMin / Count) > (float)rand()/RAND_MAX ) )
+            if ( CountMin > Count || (CountMin != ABC_INFINITY && Count && ((double)CountMin / Count) > (double)rand()/RAND_MAX ) )
             {
                 CountMin = Count;
                 IndexMin = Index;
diff --git a/src/aig/gia/giaTransduction.h b/src/aig/gia/giaTransduction.h
@@ -888,7 +888,7 @@ class Transduction: ManUtil<Man, lit, LitMax> {
         vvCs[i].push_back(vCsOld[j]);
         continue;
       }
-      vPfUpdates[i] = vPfUpdates[i] | vPfUpdates[i0];
+      vPfUpdates[i] = vPfUpdates[i] || vPfUpdates[i0];
       vvFos[i0].erase(find(vvFos[i0].begin(), vvFos[i0].end(), i));
       count++;
       typename std::vector<int>::iterator itfi = vFisOld.begin() + j;
diff --git a/src/base/abci/abcBidec.c b/src/base/abci/abcBidec.c
@@ -109,7 +109,7 @@ Hop_Obj_t * Abc_NodeIfNodeResyn( Bdc_Man_t * p, Hop_Man_t * pHop, Hop_Obj_t * pR
 ***********************************************************************/
 void Abc_NtkBidecResyn( Abc_Ntk_t * pNtk, int fVerbose )
 {
-    Bdc_Par_t Pars = {0}, * pPars = &Pars;
+  Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;
     Bdc_Man_t * p;
     Abc_Obj_t * pObj;
     Vec_Int_t * vTruth;
diff --git a/src/base/abci/abcDec.c b/src/base/abci/abcDec.c
@@ -628,7 +628,7 @@ void Abc_TruthDecPerform( Abc_TtStore_t * p, int DecType, int fVerbose )
     {
         // perform bi-decomposition and count AIG nodes
         Bdc_Man_t * pManDec;
-        Bdc_Par_t Pars = {0}, * pPars = &Pars;
+        Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;
         pPars->nVarsMax = p->nVars;
         pManDec = Bdc_ManAlloc( pPars );
         for ( i = 0; i < p->nFuncs; i++ )
diff --git a/src/base/abci/abcPrint.c b/src/base/abci/abcPrint.c
@@ -77,7 +77,7 @@ int Abc_NtkCompareAndSaveBest( Abc_Ntk_t * pNtk )
         int    Edges;  // edges in the best saved network
         int    nPis;   // the number of primary inputs
         int    nPos;   // the number of primary outputs
-    } ParsNew, ParsBest = { 0 };
+    } ParsNew, ParsBest = { 0, 0, 0, 0, 0, 0, 0 };
     char * pFileNameOut;
     // free storage for the name
     if ( pNtk == NULL )
diff --git a/src/base/cba/cbaReadVer.c b/src/base/cba/cbaReadVer.c
@@ -104,7 +104,7 @@ static const Prs_VerPrim_t s_VerilogPrims[16] =
     {CBA_BOX_XOR,  "xor"   },   
     {CBA_BOX_XNOR, "xnor"  },  
     {CBA_BOX_TRI,  "bufif1"},  
-    {0}
+    {0, ""}
 };
 
 // predefined operator names
diff --git a/src/bool/bdc/bdcCore.c b/src/bool/bdc/bdcCore.c
@@ -344,7 +344,7 @@ void Bdc_ManDecomposeTest( unsigned uTruth, int nVars )
 {
     static int Counter = 0;
     static int Total = 0;
-    Bdc_Par_t Pars = {0}, * pPars = &Pars;
+    Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;
     Bdc_Man_t * p;
     int RetValue;
 //    unsigned uCare = ~0x888f888f;
@@ -379,7 +379,7 @@ int Bdc_ManBidecNodeNum( word * pFunc, word * pCare, int nVars, int fVerbose )
 {
     int nNodes;
     Bdc_Man_t * pManDec;
-    Bdc_Par_t Pars = {0}, * pPars = &Pars;
+    Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;
     pPars->nVarsMax = nVars;
     pManDec = Bdc_ManAlloc( pPars );
     Bdc_ManDecompose( pManDec, (unsigned *)pFunc, (unsigned *)pCare, nVars, NULL, 1000 );
@@ -428,7 +428,7 @@ Vec_Int_t * Bdc_ManBidecResub( word * pFunc, word * pCare, int nVars )
     Vec_Int_t * vRes = NULL;
     int nNodes;
     Bdc_Man_t * pManDec; 
-    Bdc_Par_t Pars = {0}, * pPars = &Pars;
+    Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;
     pPars->nVarsMax = nVars;
     pManDec = Bdc_ManAlloc( pPars );
     Bdc_ManDecompose( pManDec, (unsigned *)pFunc, (unsigned *)pCare, nVars, NULL, 1000 );
diff --git a/src/map/amap/amapMatch.c b/src/map/amap/amapMatch.c
@@ -521,7 +521,9 @@ void Amap_ManMatchNode( Amap_Man_t * p, Amap_Obj_t * pNode, int fFlow, int fRefs
     int fVerbose = 0; //(pNode->Level == 2 || pNode->Level == 4);
     int fVeryVerbose = fVerbose;
 
-    Amap_Mat_t MA = {0}, MD = {0}, M = {0};
+    Amap_Mat_t MA = {0, 0, 0, 0, 0},
+      MD = {0, 0, 0, 0, 0},
+      M = {0, 0, 0, 0, 0};
     Amap_Mat_t * pMBestA = &MA, * pMBestD = &MD, * pMThis = &M, * pMBest;
     Amap_Cut_t * pCut;
     Amap_Set_t * pSet;
diff --git a/src/map/if/ifDec16.c b/src/map/if/ifDec16.c
@@ -1111,7 +1111,7 @@ int If_CluDetectSpecialCaseCofs( word * pF, int nVars, int iVar )
 // returns 1 if we have special case of cofactors; otherwise, returns 0
 If_Grp_t If_CluDecUsingCofs( word * pTruth, int nVars, int nLutLeaf )
 {
-    If_Grp_t G = {0};
+    If_Grp_t G = {0, 0, {0}};
     word pF2[CLU_WRD_MAX], * pF = pF2;
     int Var2Pla[CLU_VAR_MAX+2], Pla2Var[CLU_VAR_MAX+2];
     int V2P[CLU_VAR_MAX+2], P2V[CLU_VAR_MAX+2];
@@ -1307,7 +1307,7 @@ If_Grp_t If_CluFindGroup( word * pF, int nVars, int iVarStart, int iVarStop, int
 {
     int fVerbose = 0;
     int nRounds = 2;//nBSsize;
-    If_Grp_t G = {0}, * g = &G;//, BestG = {0};
+    If_Grp_t G = {0, 0, {0}}, * g = &G;//, BestG = {0};
     int i, r, v, nCofs, VarBest, nCofsBest2;
     assert( nVars > nBSsize && nVars >= nBSsize + iVarStart && nVars <= CLU_VAR_MAX );
     assert( nBSsize >= 2 && nBSsize <= 6 );
@@ -1554,7 +1554,7 @@ If_Grp_t If_CluCheck( If_Man_t * p, word * pTruth0, int nVars, int iVarStart, in
                      If_Grp_t * pR, word * pFunc0, word * pFunc1, word * pLeftOver, int fHashing )
 {
 //    int fEnableHashing = 0;
-    If_Grp_t G1 = {0}, R = {0};
+  If_Grp_t G1 = {0, 0, {0}}, R = {0, 0, {0}};
     unsigned * pHashed = NULL;
     word Truth, pTruth[CLU_WRD_MAX], pF[CLU_WRD_MAX];//, pG[CLU_WRD_MAX];
     int V2P[CLU_VAR_MAX+2], P2V[CLU_VAR_MAX+2], pCanonPerm[CLU_VAR_MAX];
@@ -1913,7 +1913,10 @@ If_Grp_t If_CluCheck3( If_Man_t * p, word * pTruth0, int nVars, int nLutLeaf, in
     static int Counter = 0;
     unsigned * pHashed = NULL;
     word pLeftOver[CLU_WRD_MAX], Func0, Func1, Func2;
-    If_Grp_t G1 = {0}, G2 = {0}, R = {0}, R2 = {0};
+    If_Grp_t G1 = {0, 0, {0}},
+      G2 = {0, 0, {0}},
+      R = {0, 0, {0}},
+      R2 = {0, 0, {0}};
     int i;
     Counter++;
 //    if ( Counter == 37590 )
@@ -2105,7 +2108,9 @@ float If_CutDelayLutStruct( If_Man_t * p, If_Cut_t * pCut, char * pStr, float Wi
     float Delays[CLU_VAR_MAX+2];
     int fUsed[CLU_VAR_MAX+2] = {0};
     If_Obj_t * pLeaf;
-    If_Grp_t G1 = {0}, G2 = {0}, G3 = {0};
+    If_Grp_t G1 = {0, 0, {0}},
+      G2 = {0, 0, {0}}, \
+      G3 = {0, 0, {0}};
     int nLeaves = If_CutLeaveNum(pCut);
     int i, nLutLeaf, nLutRoot;
     // mark the cut as user cut
@@ -2216,7 +2221,7 @@ int If_TtMemCutNum2() { return Vec_MemEntryNum(s_vTtMem2); }
 int If_CutPerformCheck16( If_Man_t * p, unsigned * pTruth0, int nVars, int nLeaves, char * pStr )
 {
     unsigned pTruth[IF_MAX_FUNC_LUTSIZE > 5 ? 1 << (IF_MAX_FUNC_LUTSIZE - 5) : 1];
-    If_Grp_t G1 = {0};//, G3 = {0};
+    If_Grp_t G1 = {0, 0, {0}};//, G3 = {0};
     int i, nLutLeaf, nLutLeaf2, nLutRoot, Length;
     // stretch the truth table
     assert( nVars >= 6 );
diff --git a/src/map/if/ifDec66.c b/src/map/if/ifDec66.c
@@ -275,7 +275,7 @@ unsigned * If_CluHashLookup2( If_Man_t * p, word * pTruth, int t )
 // returns if successful
 int If_CluCheckXX( If_Man_t * p, word * pTruth0, int lutSize, int nVars, int fHashing )
 {
-    If_Grp_t G1 = {0};
+    If_Grp_t G1 = {0, 0, {0}};
     unsigned * pHashed = NULL;
 
     if ( p && fHashing )
@@ -405,4 +405,4 @@ int If_CutPerformCheckXX( If_Man_t * p, unsigned * pTruth0, int nVars, int nLeav
 ////////////////////////////////////////////////////////////////////////
 
 
-ABC_NAMESPACE_IMPL_END
+ABC_NAMESPACE_IMPL_END
diff --git a/src/map/scl/scl.c b/src/map/scl/scl.c
@@ -188,7 +188,7 @@ int Scl_CommandReadLib( Abc_Frame_t * pAbc, int argc, char ** argv )
     int fUseAll = 0;
     int fSkipMultiOuts = 0;
     
-    SC_DontUse dont_use = {0};
+    SC_DontUse dont_use = {0, 0};
     dont_use.dont_use_list = ABC_ALLOC(char *, argc);
     dont_use.size = 0;
 
diff --git a/src/map/scl/sclLiberty.c b/src/map/scl/sclLiberty.c
@@ -1818,7 +1818,7 @@ void Scl_LibertyTest()
     if ( p == NULL )
         return;
 //    Scl_LibertyParseDump( p, "temp_.lib" );
-    SC_DontUse dont_use = {0};
+    SC_DontUse dont_use = {0, 0};
     vStr = Scl_LibertyReadSclStr( p, fVerbose, fVeryVerbose, dont_use, 0);
     Scl_LibertyStringDump( "test_scl.lib", vStr );
     Vec_StrFree( vStr );
diff --git a/src/opt/mfs/mfsCore.c b/src/opt/mfs/mfsCore.c
@@ -389,7 +389,7 @@ int Abc_NtkMfs( Abc_Ntk_t * pNtk, Mfs_Par_t * pPars )
 {
     extern Aig_Man_t * Abc_NtkToDar( Abc_Ntk_t * pNtk, int fExors, int fRegisters );
 
-    Bdc_Par_t Pars = {0}, * pDecPars = &Pars;
+    Bdc_Par_t Pars = {0, 0, 0}, * pDecPars = &Pars;
     ProgressBar * pProgress;
     Mfs_Man_t * p;
     Abc_Obj_t * pObj;
diff --git a/src/opt/nwk/nwkBidec.c b/src/opt/nwk/nwkBidec.c
@@ -128,7 +128,7 @@ Hop_Obj_t * Nwk_NodeIfNodeResyn( Bdc_Man_t * p, Hop_Man_t * pHop, Hop_Obj_t * pR
 ***********************************************************************/
 void Nwk_ManBidecResyn( Nwk_Man_t * pNtk, int fVerbose )
 {
-    Bdc_Par_t Pars = {0}, * pPars = &Pars;
+    Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;
     Bdc_Man_t * p;
     Nwk_Obj_t * pObj;
     Vec_Int_t * vTruth;
diff --git a/src/opt/nwk/nwkMan.c b/src/opt/nwk/nwkMan.c
@@ -129,7 +129,7 @@ int Nwk_ManCompareAndSaveBest( Nwk_Man_t * pNtk, void * pNtl )
         int    Nodes;  // nodes in the best saved network
         int    nPis;   // the number of primary inputs
         int    nPos;   // the number of primary outputs
-    } ParsNew, ParsBest = { 0 };
+    } ParsNew, ParsBest = { 0, 0, 0, 0, 0, 0 };
     // free storage for the name
     if ( pNtk == NULL )
     {
diff --git a/src/proof/abs/absVta.c b/src/proof/abs/absVta.c
@@ -872,7 +872,7 @@ Abc_Cex_t * Vta_ManRefineAbstraction( Vta_Man_t * p, int f )
                 continue;
     //        Vta_ObjPreds( p, pThis, Gia_ManObj(p->pGia, pThis->iObj), &pThis0, &pThis1 );
     //        if ( (pThis0 && (pThis0->fAdded || pThis0->fVisit)) || (pThis1 && (pThis1->fAdded || pThis1->fVisit)) )
-                Vec_IntPush( vTermsToAdd, Vta_ObjId(p, pThis) );
+            Vec_IntPush( vTermsToAdd, Vta_ObjId(p, pThis) );
         }
         // remove those currenty included
         Vta_ManForEachObjVec( vTermsToAdd, p, pThis, i )
diff --git a/src/proof/live/kliveness.c b/src/proof/live/kliveness.c
@@ -211,13 +211,13 @@ Aig_Man_t *introduceAbsorberLogic( Aig_Man_t *pAig, int *pLiveIndex_0, int *pLiv
     //****************************************************************
     // Step 2: map constant nodes
     //****************************************************************
-        pObj = Aig_ManConst1( pAig );
-        pObj->pData = Aig_ManConst1( pNewAig );
+    pObj = Aig_ManConst1( pAig );
+    pObj->pData = Aig_ManConst1( pNewAig );
 
     //****************************************************************
         // Step 3: create true PIs
     //****************************************************************
-        Saig_ManForEachPi( pAig, pObj, i )
+    Saig_ManForEachPi( pAig, pObj, i )
     {
         piCopied++;
         pObj->pData = Aig_ObjCreateCi(pNewAig);
@@ -226,11 +226,11 @@ Aig_Man_t *introduceAbsorberLogic( Aig_Man_t *pAig, int *pLiveIndex_0, int *pLiv
     //****************************************************************
     // Step 5: create register outputs
     //****************************************************************
-        Saig_ManForEachLo( pAig, pObj, i )
-        {
-        loCopied++;
-        pObj->pData = Aig_ObjCreateCi(pNewAig);
-        }
+    Saig_ManForEachLo( pAig, pObj, i )
+    {
+      loCopied++;
+      pObj->pData = Aig_ObjCreateCi(pNewAig);
+    }
 
     //****************************************************************
     // Step 6: create "D" register output for the ABSORBER logic
diff --git a/src/sat/glucose/Glucose.cpp b/src/sat/glucose/Glucose.cpp
@@ -350,14 +350,14 @@ void Solver::removeClause(CRef cr) {
 
 
 bool Solver::satisfied(const Clause& c) const {
-  if(incremental)  // Check clauses with many selectors is too time consuming
+  if (incremental)  // Check clauses with many selectors is too time consuming
     return (value(c[0]) == l_True) || (value(c[1]) == l_True);
 
   // Default mode.
-    for (int i = 0; i < c.size(); i++)
-        if (value(c[i]) == l_True)
-            return true;
-    return false; 
+  for (int i = 0; i < c.size(); i++)
+    if (value(c[i]) == l_True)
+      return true;
+  return false; 
 }
 
 /************************************************************
diff --git a/src/sat/glucose2/Glucose2.cpp b/src/sat/glucose2/Glucose2.cpp
@@ -394,14 +394,14 @@ void Solver::removeClause(CRef cr) {
 
 
 bool Solver::satisfied(const Clause& c) const {
-  if(incremental)  // Check clauses with many selectors is too time consuming
+  if (incremental)  // Check clauses with many selectors is too time consuming
     return (value(c[0]) == l_True) || (value(c[1]) == l_True);
 
   // Default mode.
-    for (int i = 0; i < c.size(); i++)
-        if (value(c[i]) == l_True)
-            return true;
-    return false; 
+  for (int i = 0; i < c.size(); i++)
+    if (value(c[i]) == l_True)
+      return true;
+  return false; 
 }
 
 /************************************************************

Original file line number	Diff line number	Diff line change
`@@ -98,7 +98,7 @@ static Aig_RMan_t * s_pRMan = NULL;`
`98`	`98`	`***********************************************************************/`
`99`	`99`	`Aig_RMan_t * Aig_RManStart()`
`100`	`100`	`{`
`101`		`- static Bdc_Par_t Pars = {0}, * pPars = &Pars;`
	`101`	`+ static Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;`
`102`	`102`	`Aig_RMan_t * p;`
`103`	`103`	`p = ABC_ALLOC( Aig_RMan_t, 1 );`
`104`	`104`	`memset( p, 0, sizeof(Aig_RMan_t) );`
Original file line number	Diff line number	Diff line change
`@@ -233,7 +233,7 @@ if ( Kit_TruthSupportSize(pTruth, nVars) != nVars )`
`233`	`233`	`Gia_Man_t * Gia_ManPerformBidec( Gia_Man_t * p, int fVerbose )`
`234`	`234`	`{`
`235`	`235`	`Bdc_Man_t * pManDec;`
`236`		`- Bdc_Par_t Pars = {0}, * pPars = &Pars;`
	`236`	`+ Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;`
`237`	`237`	`Vec_Int_t * vLeaves, * vTruth, * vVisited;`
`238`	`238`	`Gia_Man_t * pNew, * pTemp;`
`239`	`239`	`Gia_Obj_t * pObj;`
Original file line number	Diff line number	Diff line change
`@@ -1078,7 +1078,7 @@ int Gia_ManCountSelfCuts( Gia_Man_t * p, Gia_Sto_t * pSto )`
`1078`	`1078`	`void Gia_ManEvalCutHashing( Gia_Man_t * p, Gia_Sto_t * pSto )`
`1079`	`1079`	`{`
`1080`	`1080`	`Hsh_VecMan_t * pHash = Hsh_VecManStart( 100000 );`
`1081`		`- Vec_Int_t vTemp = {0};`
	`1081`	`+ Vec_Int_t vTemp = {0, 0, nullptr};`
`1082`	`1082`	`Vec_Int_t * vLevel; int i, k, * pCut, nBytes = 0, nCuts = 0;`
`1083`	`1083`	`Vec_WecForEachLevel( pSto->vCuts, vLevel, i ) if ( Vec_IntSize(vLevel) ) {`
`1084`	`1084`	`Gia_Obj_t * pObj = Gia_ManObj(p, i);`
Original file line number	Diff line number	Diff line change
`@@ -430,7 +430,7 @@ void Gia_ManAutomWalkOne( Gia_Man_t * p, int nSteps, Vec_Wrd_t * vStates, Vec_In`
`430`	`430`	`continue;`
`431`	`431`	`Index = Vec_WrdFind( vStates, pNext[k] );`
`432`	`432`	`Count = Index == -1 ? 0 : Vec_IntEntry( vCounts, Index );`
`433`		`- if ( CountMin > Count \|\| (CountMin != ABC_INFINITY && Count && ((float)CountMin / Count) > (float)rand()/RAND_MAX ) )`
	`433`	`+ if ( CountMin > Count \|\| (CountMin != ABC_INFINITY && Count && ((double)CountMin / Count) > (double)rand()/RAND_MAX ) )`
`434`	`434`	`{`
`435`	`435`	`CountMin = Count;`
`436`	`436`	`IndexMin = Index;`
Original file line number	Diff line number	Diff line change
`@@ -888,7 +888,7 @@ class Transduction: ManUtil<Man, lit, LitMax> {`
`888`	`888`	`vvCs[i].push_back(vCsOld[j]);`
`889`	`889`	`continue;`
`890`	`890`	`}`
`891`		`- vPfUpdates[i] = vPfUpdates[i] \| vPfUpdates[i0];`
	`891`	`+ vPfUpdates[i] = vPfUpdates[i] \|\| vPfUpdates[i0];`
`892`	`892`	`vvFos[i0].erase(find(vvFos[i0].begin(), vvFos[i0].end(), i));`
`893`	`893`	`count++;`
`894`	`894`	`typename std::vector<int>::iterator itfi = vFisOld.begin() + j;`
Original file line number	Diff line number	Diff line change
`@@ -109,7 +109,7 @@ Hop_Obj_t * Abc_NodeIfNodeResyn( Bdc_Man_t * p, Hop_Man_t * pHop, Hop_Obj_t * pR`
`109`	`109`	`***********************************************************************/`
`110`	`110`	`void Abc_NtkBidecResyn( Abc_Ntk_t * pNtk, int fVerbose )`
`111`	`111`	`{`
`112`		`- Bdc_Par_t Pars = {0}, * pPars = &Pars;`
	`112`	`+ Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;`
`113`	`113`	`Bdc_Man_t * p;`
`114`	`114`	`Abc_Obj_t * pObj;`
`115`	`115`	`Vec_Int_t * vTruth;`
Original file line number	Diff line number	Diff line change
`@@ -628,7 +628,7 @@ void Abc_TruthDecPerform( Abc_TtStore_t * p, int DecType, int fVerbose )`
`628`	`628`	`{`
`629`	`629`	`// perform bi-decomposition and count AIG nodes`
`630`	`630`	`Bdc_Man_t * pManDec;`
`631`		`- Bdc_Par_t Pars = {0}, * pPars = &Pars;`
	`631`	`+ Bdc_Par_t Pars = {0, 0, 0}, * pPars = &Pars;`
`632`	`632`	`pPars->nVarsMax = p->nVars;`
`633`	`633`	`pManDec = Bdc_ManAlloc( pPars );`
`634`	`634`	`for ( i = 0; i < p->nFuncs; i++ )`