Fixing time primtouts throughout the code.

9 files changed, 12 insertions, 10 deletions

diff --git a/src/base/abci/abcCut.c b/src/base/abci/abcCut.c
index a2ab9315..918ee2ab 100644
--- a/src/base/abci/abcCut.c
+++ b/src/base/abci/abcCut.c
@@ -291,7 +291,7 @@ Cut_Man_t * Abc_NtkSeqCuts( Abc_Ntk_t * pNtk, Cut_Params_t * pParams )
     Abc_Obj_t * pObj, * pNode;
     int i, nIters, fStatus;
     Vec_Int_t * vChoices;
-    int clk = clock();
+    clock_t clk = clock();
 
     assert( Abc_NtkIsSeq(pNtk) );
     assert( pParams->fSeq );
diff --git a/src/base/abci/abcFraig.c b/src/base/abci/abcFraig.c
index 5ca34ba1..23004df2 100644
--- a/src/base/abci/abcFraig.c
+++ b/src/base/abci/abcFraig.c
@@ -698,7 +698,7 @@ Abc_Ntk_t * Abc_NtkFraigRestore()
     Vec_Ptr_t * vStore;
     Abc_Ntk_t * pNtk, * pFraig;
     int nWords1, nWords2, nWordsMin;
-//    int clk = clock();
+//    clock_t clk = clock();
 
     // get the stored network
     vStore = Abc_FrameReadStore();
diff --git a/src/base/abci/abcIvy.c b/src/base/abci/abcIvy.c
index 0c422ab5..8df8d150 100644
--- a/src/base/abci/abcIvy.c
+++ b/src/base/abci/abcIvy.c
@@ -543,7 +543,7 @@ int Abc_NtkIvyProve( Abc_Ntk_t ** ppNtk, void * pPars )
     // apply AIG rewriting
     if ( pParams->fUseRewriting && Abc_NtkNodeNum(pNtk) > 500 )
     {
-//        int clk = clock();
+//        clock_t clk = clock();
 //printf( "Before rwsat = %d. ", Abc_NtkNodeNum(pNtk) );
         pParams->fUseRewriting = 0;
         pNtk = Abc_NtkBalance( pNtkTemp = pNtk, 0, 0, 0 );          
diff --git a/src/base/abci/abcProve.c b/src/base/abci/abcProve.c
index f4bd89ef..0322b587 100644
--- a/src/base/abci/abcProve.c
+++ b/src/base/abci/abcProve.c
@@ -35,7 +35,7 @@ extern int  Abc_NtkRefactor( Abc_Ntk_t * pNtk, int nNodeSizeMax, int nConeSizeMa
 extern Abc_Ntk_t * Abc_NtkFromFraig( Fraig_Man_t * pMan, Abc_Ntk_t * pNtk );
 
 static Abc_Ntk_t * Abc_NtkMiterFraig( Abc_Ntk_t * pNtk, int nBTLimit, ABC_INT64_T nInspLimit, int * pRetValue, int * pNumFails, ABC_INT64_T * pNumConfs, ABC_INT64_T * pNumInspects );
-static void Abc_NtkMiterPrint( Abc_Ntk_t * pNtk, char * pString, int clk, int fVerbose );
+static void Abc_NtkMiterPrint( Abc_Ntk_t * pNtk, char * pString, clock_t clk, int fVerbose );
 
 
 ////////////////////////////////////////////////////////////////////////
@@ -308,7 +308,7 @@ Abc_Ntk_t * Abc_NtkMiterFraig( Abc_Ntk_t * pNtk, int nBTLimit, ABC_INT64_T nInsp
   SeeAlso     []
 
 ***********************************************************************/
-void Abc_NtkMiterPrint( Abc_Ntk_t * pNtk, char * pString, int clk, int fVerbose )
+void Abc_NtkMiterPrint( Abc_Ntk_t * pNtk, char * pString, clock_t clk, int fVerbose )
 {
     if ( !fVerbose )
         return;
diff --git a/src/base/abci/abcRec.c b/src/base/abci/abcRec.c
index 276f29c9..dd4beebd 100644
--- a/src/base/abci/abcRec.c
+++ b/src/base/abci/abcRec.c
@@ -2201,7 +2201,7 @@ int Abc_NtkRecAddCut( If_Man_t * pIfMan, If_Obj_t * pRoot, If_Cut_t * pCut )
     unsigned * pTruth;
     int i, RetValue, nNodes, nNodesBeg, nInputs = s_pMan->nVars, nLeaves = If_CutLeaveNum(pCut);
     unsigned uCanonPhase;
-    int clk, timeInsert, timeBuild;
+    clock_t clk, timeInsert, timeBuild;
     //int begin = clock();
     assert( nInputs <= 16 );
     assert( nInputs == (int)pCut->nLimit );
diff --git a/src/base/abci/abcRefactor.c b/src/base/abci/abcRefactor.c
index 361b91ce..22b88d28 100644
--- a/src/base/abci/abcRefactor.c
+++ b/src/base/abci/abcRefactor.c
@@ -196,7 +196,8 @@ Dec_Graph_t * Abc_NodeRefactor( Abc_ManRef_t * p, Abc_Obj_t * pNode, Vec_Ptr_t *
     Abc_Obj_t * pFanin;
     Dec_Graph_t * pFForm;
     DdNode * bNodeFunc;
-    int nNodesSaved, nNodesAdded, i, clk;
+    int nNodesSaved, nNodesAdded, i;
+    clock_t clk;
     char * pSop;
     int Required;
 
diff --git a/src/base/abci/abcRewrite.c b/src/base/abci/abcRewrite.c
index 091ac647..a1e19405 100644
--- a/src/base/abci/abcRewrite.c
+++ b/src/base/abci/abcRewrite.c
@@ -169,7 +169,7 @@ Rwr_ManAddTimeTotal( pManRwr, clock() - clkStart );
 
     // put the nodes into the DFS order and reassign their IDs
     {
-//        int clk = clock();
+//        clock_t clk = clock();
     Abc_NtkReassignIds( pNtk );
 //        ABC_PRT( "time", clock() - clk );
     }
diff --git a/src/base/abci/fahout_cut.c b/src/base/abci/fahout_cut.c
index 0b4b421f..eff2ec19 100644
--- a/src/base/abci/fahout_cut.c
+++ b/src/base/abci/fahout_cut.c
@@ -285,7 +285,8 @@ Vec_Int_t * Abc_NtkLutMerge( Abc_Ntk_t * pNtk, Nwk_LMPars_t * pPars )
     Vec_Int_t * vResult;
     Vec_Ptr_t * vStart, * vNext, * vCands1, * vCands2;
     Abc_Obj_t * pLut, * pCand;
-    int i, k, nVertsMax, nCands, clk = clock();
+    int i, k, nVertsMax, nCands;
+    clock_t clk = clock();
     // count the number of vertices
     nVertsMax = 0;
     Abc_NtkForEachNode( pNtk, pLut, i )
diff --git a/src/base/main/mainMC.c b/src/base/main/mainMC.c
index 6d9f4c73..7fec111c 100644
--- a/src/base/main/mainMC.c
+++ b/src/base/main/mainMC.c
@@ -65,7 +65,7 @@ int main( int argc, char * argv[] )
     int fRewrite = 0;
     int fNewAlgo = 1;
     int fVerbose = 0;
-    int clkTotal = clock();
+    clock_t clkTotal = clock();
 
     if ( argc != 2 )
     {