Suggested white-space changes for fewer gcc warnings.

src/misc/bar/bar.h

@@ -61,7 +61,9 @@ extern void              Bar_ProgressStop( Bar_Progress_t * p );
 extern void              Bar_ProgressUpdate_int( Bar_Progress_t * p, int nItemsCur, char * pString );
 
 static inline void       Bar_ProgressUpdate( Bar_Progress_t * p, int nItemsCur, char * pString ) {  
-    if ( BAR_PROGRESS_USE && p && (nItemsCur < *((int*)p)) ) return; Bar_ProgressUpdate_int(p, nItemsCur, pString); }
+    if ( BAR_PROGRESS_USE && p && (nItemsCur < *((int*)p)) ) return;
+    Bar_ProgressUpdate_int(p, nItemsCur, pString);
+}
 
 
 

src/opt/ret/retDelay.c

@@ -96,7 +96,7 @@ int Abc_NtkRetimeMinDelayTry( Abc_Ntk_t * pNtk, int nDelayLim, int fForward, int
         }
     }
 
-if ( fVerbose && !fInitial )
+    if ( fVerbose && !fInitial )
         printf( "Performing analysis:\n" );
     // find the best iteration
     DelayBest = ABC_INFINITY; IterBest = 0; LatchesBest = Abc_NtkLatchNum(pNtk);
@@ -150,7 +150,7 @@ if ( fVerbose && !fInitial )
             Vec_IntFree( vValues );
         }
     }
-if ( fVerbose && !fInitial )
+    if ( fVerbose && !fInitial )
         printf( "%s : Starting delay = %3d.  Final delay = %3d.  IterBest = %2d (out of %2d).\n",
             fForward? "Forward " : "Backward", DelayStart, DelayBest, IterBest, nIterLimit );
     *pIterBest = (nIterLimit == 1) ? 1 : IterBest;

src/opt/sfm/sfmSat.c

@@ -260,7 +260,7 @@ void Sfm_ComputeInterpolantCheck( Sfm_Ntk_t * p )
         else if ( uTruth == SFM_SAT_UNDEC )
             printf( "The problem is UNDEC.\n" );
         else
-            Kit_DsdPrintFromTruth( (unsigned *)&uTruth, 2 ); printf( "\n" );
+            Kit_DsdPrintFromTruth( (unsigned *)&uTruth, 2 ), printf( "\n" );
     }
 }
 

src/opt/sim/simSupp.c

@@ -118,7 +118,7 @@ Vec_Ptr_t * Sim_ComputeFunSupp( Abc_Ntk_t * pNtk, int fVerbose )
 
     // set the support targets 
     Sim_ComputeSuppSetTargets( p );
-if ( fVerbose )
+    if ( fVerbose )
         printf( "Number of support targets after simulation = %5d.\n", Vec_VecSizeSize(p->vSuppTargs) );
     if ( Vec_VecSizeSize(p->vSuppTargs) == 0 )
         goto exit;
@@ -131,7 +131,7 @@ if ( fVerbose )
         if ( Vec_VecSizeSize(p->vSuppTargs) == 0 )
             goto exit;
 
-if ( fVerbose )
+        if ( fVerbose )
             printf( "Targets = %5d.   Solved = %5d.  Fifo = %5d.\n",
                 Vec_VecSizeSize(p->vSuppTargs), nSolved, Vec_PtrSize(p->vFifo) );
     }

src/proof/fraig/fraigSat.c

@@ -358,7 +358,7 @@ p->timeTrav += Abc_Clock() - clk;
 //    printf( "The number of MUXes detected = %d (%5.2f %% of logic).  ", nMuxes, 300.0*nMuxes/(p->vNodes->nSize - p->vInputs->nSize) );
 //    ABC_PRT( "Time", Abc_Clock() - clk );
 
-if ( fVerbose )
+    if ( fVerbose )
         printf( "%d(%d) - ", Fraig_CountPis(p,p->vVarsInt), Msat_IntVecReadSize(p->vVarsInt) );
 
 
@@ -574,7 +574,7 @@ clk = Abc_Clock();
 //    Fraig_PrepareCones( p, pOld, pNew );
 p->timeTrav += Abc_Clock() - clk;
 
-if ( fVerbose )
+    if ( fVerbose )
         printf( "%d(%d) - ", Fraig_CountPis(p,p->vVarsInt), Msat_IntVecReadSize(p->vVarsInt) );