summaryrefslogtreecommitdiffstats
path: root/src/misc
diff options
context:
space:
mode:
authorAlan Mishchenko <alanmi@berkeley.edu>2012-07-07 17:46:54 -0700
committerAlan Mishchenko <alanmi@berkeley.edu>2012-07-07 17:46:54 -0700
commit3aab7245738a69f1dd4d898493d5dabf6596ea61 (patch)
tree16a23107ca27a250e82c492dcdd1a2bea640cff6 /src/misc
parent16d96fcf533fb77ff4a45992991e38ac7ea74bb3 (diff)
downloadabc-3aab7245738a69f1dd4d898493d5dabf6596ea61.tar.gz
abc-3aab7245738a69f1dd4d898493d5dabf6596ea61.tar.bz2
abc-3aab7245738a69f1dd4d898493d5dabf6596ea61.zip
Fixing time primtouts throughout the code.
Diffstat (limited to 'src/misc')
-rw-r--r--src/misc/bbl/bblif.c1
-rw-r--r--src/misc/extra/extra.h1
-rw-r--r--src/misc/extra/extraBdd.h1
-rw-r--r--src/misc/extra/extraBddCas.c2
-rw-r--r--src/misc/extra/extraBddMisc.c10
-rw-r--r--src/misc/extra/extraBddTime.c6
-rw-r--r--src/misc/extra/extraUtilUtil.c4
-rw-r--r--src/misc/nm/nmTable.c3
-rw-r--r--src/misc/tim/tim.c1
-rw-r--r--src/misc/util/utilSort.c6
-rw-r--r--src/misc/util/util_hack.h1
11 files changed, 17 insertions, 19 deletions
diff --git a/src/misc/bbl/bblif.c b/src/misc/bbl/bblif.c
index 47190fb7..eefff9f7 100644
--- a/src/misc/bbl/bblif.c
+++ b/src/misc/bbl/bblif.c
@@ -22,7 +22,6 @@
#include <stdlib.h>
#include <string.h>
#include <assert.h>
-#include <time.h>
#include "src/misc/util/abc_global.h"
#include "bblif.h"
diff --git a/src/misc/extra/extra.h b/src/misc/extra/extra.h
index e9daa87e..2f04e781 100644
--- a/src/misc/extra/extra.h
+++ b/src/misc/extra/extra.h
@@ -42,7 +42,6 @@
#include <stdlib.h>
#include <string.h>
#include <assert.h>
-#include <time.h>
#include "src/misc/st/st.h"
diff --git a/src/misc/extra/extraBdd.h b/src/misc/extra/extraBdd.h
index 25df14bb..fcd10320 100644
--- a/src/misc/extra/extraBdd.h
+++ b/src/misc/extra/extraBdd.h
@@ -42,7 +42,6 @@
#include <stdlib.h>
#include <string.h>
#include <assert.h>
-#include <time.h>
#include "src/misc/st/st.h"
#include "src/bdd/cudd/cuddInt.h"
diff --git a/src/misc/extra/extraBddCas.c b/src/misc/extra/extraBddCas.c
index 0416a0d2..08b0f95f 100644
--- a/src/misc/extra/extraBddCas.c
+++ b/src/misc/extra/extraBddCas.c
@@ -192,7 +192,7 @@ Extra_bddEncodingNonStrict(
{
DdNode * bEncoded, * bResult;
int nVarsCol = Cudd_SupportSize(dd,bVarsCol);
- long clk;
+ clock_t clk;
// cannot work with more that 32-bit codes
assert( nMulti < 32 );
diff --git a/src/misc/extra/extraBddMisc.c b/src/misc/extra/extraBddMisc.c
index a5f987e3..b54449b4 100644
--- a/src/misc/extra/extraBddMisc.c
+++ b/src/misc/extra/extraBddMisc.c
@@ -1348,9 +1348,9 @@ extraTransferPermuteRecur(
if ( st_lookup( table, ( char * ) f, ( char ** ) &res ) )
return ( Cudd_NotCond( res, comple ) );
- if ( ddS->TimeStop && time(NULL) > ddS->TimeStop )
+ if ( ddS->TimeStop && clock() > ddS->TimeStop )
return NULL;
- if ( ddD->TimeStop && time(NULL) > ddD->TimeStop )
+ if ( ddD->TimeStop && clock() > ddD->TimeStop )
return NULL;
/* Recursive step. */
@@ -1909,9 +1909,9 @@ DdNode * extraBddAndPermute( DdHashTable * table, DdManager * ddF, DdNode * bF,
return bRes;
Counter++;
- if ( ddF->TimeStop && time(NULL) > ddF->TimeStop )
+ if ( ddF->TimeStop && clock() > ddF->TimeStop )
return NULL;
- if ( ddG->TimeStop && time(NULL) > ddG->TimeStop )
+ if ( ddG->TimeStop && clock() > ddG->TimeStop )
return NULL;
// find the topmost variable in F and G using var order of F
@@ -1982,7 +1982,7 @@ void Extra_TestAndPerm( DdManager * ddF, DdNode * bF, DdNode * bG )
{
DdManager * ddG;
DdNode * bG2, * bRes1, * bRes2;
- int clk;
+ clock_t clk;
// disable variable ordering in ddF
Cudd_AutodynDisable( ddF );
diff --git a/src/misc/extra/extraBddTime.c b/src/misc/extra/extraBddTime.c
index 853f8a64..b5e2672a 100644
--- a/src/misc/extra/extraBddTime.c
+++ b/src/misc/extra/extraBddTime.c
@@ -225,7 +225,7 @@ cuddBddAndRecurTime(
}
// if ( TimeOut && ((*pRecCalls)++ % CHECK_FACTOR) == 0 && TimeOut < clock() )
- if ( TimeOut && time(NULL) > TimeOut )
+ if ( TimeOut && clock() > TimeOut )
return NULL;
/* Here we can skip the use of cuddI, because the operands are known
@@ -379,7 +379,7 @@ cuddBddAndAbstractRecurTime(
}
// if ( TimeOut && ((*pRecCalls)++ % CHECK_FACTOR) == 0 && TimeOut < clock() )
- if ( TimeOut && time(NULL) > TimeOut )
+ if ( TimeOut && clock() > TimeOut )
return NULL;
if (topf == top) {
@@ -596,7 +596,7 @@ extraTransferPermuteRecurTime(
if ( st_lookup( table, ( char * ) f, ( char ** ) &res ) )
return ( Cudd_NotCond( res, comple ) );
- if ( TimeOut && time(NULL) > TimeOut )
+ if ( TimeOut && clock() > TimeOut )
return NULL;
/* Recursive step. */
diff --git a/src/misc/extra/extraUtilUtil.c b/src/misc/extra/extraUtilUtil.c
index fe8b25f1..7f19480c 100644
--- a/src/misc/extra/extraUtilUtil.c
+++ b/src/misc/extra/extraUtilUtil.c
@@ -347,7 +347,7 @@ void (*Extra_UtilMMoutOfMemory)( long size ) = (void (*)( long size ))Extra_Util
SeeAlso []
***********************************************************************/
-long Extra_CpuTime()
+clock_t Extra_CpuTime()
{
return clock();
}
@@ -366,7 +366,7 @@ long Extra_CpuTime()
#if defined(NT) || defined(NT64) || defined(WIN32)
double Extra_CpuTimeDouble()
{
- return (double)clock()/CLOCKS_PER_SEC;
+ return 1.0*clock()/CLOCKS_PER_SEC;
}
#else
diff --git a/src/misc/nm/nmTable.c b/src/misc/nm/nmTable.c
index 4c2b7a0a..1a792242 100644
--- a/src/misc/nm/nmTable.c
+++ b/src/misc/nm/nmTable.c
@@ -256,7 +256,8 @@ void Nm_ManProfile( Nm_Man_t * p )
void Nm_ManResize( Nm_Man_t * p )
{
Nm_Entry_t ** pBinsNewI2N, ** pBinsNewN2I, * pEntry, * pEntry2, ** ppSpot;
- int nBinsNew, Counter, e, clk;
+ int nBinsNew, Counter, e;
+ clock_t clk;
clk = clock();
// get the new table size
diff --git a/src/misc/tim/tim.c b/src/misc/tim/tim.c
index 9056d261..c56bfaaf 100644
--- a/src/misc/tim/tim.c
+++ b/src/misc/tim/tim.c
@@ -22,7 +22,6 @@
#include <stdlib.h>
#include <string.h>
#include <assert.h>
-#include <time.h>
#include "src/misc/vec/vec.h"
#include "src/misc/mem/mem.h"
diff --git a/src/misc/util/utilSort.c b/src/misc/util/utilSort.c
index eb2b32c3..48321c9f 100644
--- a/src/misc/util/utilSort.c
+++ b/src/misc/util/utilSort.c
@@ -398,9 +398,10 @@ int Abc_SortNumCompare( int * pNum1, int * pNum2 )
void Abc_SortTest()
{
int fUseNew = 0;
- int i, clk, nSize = 50000000;
+ int i, nSize = 50000000;
int * pArray = (int *)malloc( sizeof(int) * nSize );
int * pPerm;
+ clock_t clk;
// generate numbers
srand( 1000 );
for ( i = 0; i < nSize; i++ )
@@ -743,7 +744,8 @@ void Abc_QuickSortTest()
int nSize = 1000000;
int fVerbose = 0;
word * pData1, * pData2;
- int i, clk = clock();
+ int i;
+ clock_t clk = clock();
// generate numbers
pData1 = ABC_ALLOC( word, nSize );
pData2 = ABC_ALLOC( word, nSize );
diff --git a/src/misc/util/util_hack.h b/src/misc/util/util_hack.h
index 9c702bfe..505b8c99 100644
--- a/src/misc/util/util_hack.h
+++ b/src/misc/util/util_hack.h
@@ -25,7 +25,6 @@
#include <stdlib.h>
#include <string.h>
#include <assert.h>
-#include <time.h>
#include <math.h>
#include "abc_global.h"