2 files changed, 10 insertions, 10 deletions

diff --git a/src/bool/kit/cloud.c b/src/bool/kit/cloud.c
index ca2d81eb..3511b3bd 100644
--- a/src/bool/kit/cloud.c
+++ b/src/bool/kit/cloud.c
@@ -71,7 +71,7 @@ CloudManager * Cloud_Init( int nVars, int nBits )
 {
     CloudManager * dd;
     int i;
-    clock_t clk1, clk2;
+    abctime clk1, clk2;
 
     assert( nVars <= 100000 );
     assert( nBits < 32 );
@@ -99,10 +99,10 @@ CloudManager * Cloud_Init( int nVars, int nBits )
     dd->nNodesLimit       = (1 << nBits);       // 2 ^  nBits
 
     // unique table
-clk1 = clock();
+clk1 = Abc_Clock();
     dd->tUnique           = ABC_CALLOC( CloudNode, dd->nNodesAlloc );
     dd->nMemUsed         += sizeof(CloudNode) * dd->nNodesAlloc;
-clk2 = clock();
+clk2 = Abc_Clock();
 //ABC_PRT( "calloc() time", clk2 - clk1 ); 
 
     // set up the constant node (the only node that is not in the hash table)
diff --git a/src/bool/kit/kitPerm.c b/src/bool/kit/kitPerm.c
index 9d6f9373..16f5746d 100644
--- a/src/bool/kit/kitPerm.c
+++ b/src/bool/kit/kitPerm.c
@@ -280,31 +280,31 @@ void Kit_PermComputeTest()
     word * T = (word *)malloc( 8 * NFUNCS );
     word i, o, w = 0;
     int k, b;
-    clock_t clk;
+    abctime clk;
 
     srand( 0 );
 
-    clk = clock();
+    clk = Abc_Clock();
     for ( k = 0; k < NFUNCS; k++ )
         for ( b = 0; b < 8; b++ )
             ((byte *)(T + k))[b] = (byte)(rand() & 0xFF);
-    ABC_PRT( "Assign", clock() - clk );
+    ABC_PRT( "Assign", Abc_Clock() - clk );
 
 //    T[0] = 0xacaccacaaccaacca;
 //    Kit_DsdPrintFromTruth( T, 6 );
 
     // perform measurements
-    clk = clock();
+    clk = Abc_Clock();
     for ( k = 0; k < NFUNCS; k++ )
     {
         i = T[k];
 //        Kit_PermComputeNaive( &i, 6 );
         Tf( i, 6 );
     }
-    ABC_PRT( "Perm1 ", clock() - clk );
+    ABC_PRT( "Perm1 ", Abc_Clock() - clk );
 
     // perform measurements
-    clk = clock();
+    clk = Abc_Clock();
     for ( k = 0; k < NFUNCS; k++ )
     {
         i = T[k];
@@ -314,7 +314,7 @@ void Kit_PermComputeTest()
 //        Kit_PermComputeNaive( &w, 6 );
 //        assert( w == o );
     }
-    ABC_PRT( "Perm2 ", clock() - clk );
+    ABC_PRT( "Perm2 ", Abc_Clock() - clk );
 
     assert( w == 0 );
     free( T );