summaryrefslogtreecommitdiffstats
path: root/src/sat/bsat/satProof.c
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/sat/bsat/satProof.c
parent16d96fcf533fb77ff4a45992991e38ac7ea74bb3 (diff)
downloadabc-3aab7245738a69f1dd4d898493d5dabf6596ea61.tar.gz
abc-3aab7245738a69f1dd4d898493d5dabf6596ea61.tar.bz2
abc-3aab7245738a69f1dd4d898493d5dabf6596ea61.zip
Fixing time primtouts throughout the code.
Diffstat (limited to 'src/sat/bsat/satProof.c')
-rw-r--r--src/sat/bsat/satProof.c15
1 files changed, 9 insertions, 6 deletions
diff --git a/src/sat/bsat/satProof.c b/src/sat/bsat/satProof.c
index f56c20cc..f7e08592 100644
--- a/src/sat/bsat/satProof.c
+++ b/src/sat/bsat/satProof.c
@@ -145,7 +145,7 @@ Vec_Int_t * Proof_CollectUsedIter( Vec_Set_t * vProof, Vec_Int_t * vRoots, int f
{
int fVerify = 0;
Vec_Int_t * vUsed, * vStack;
- int clk = clock();
+ clock_t clk = clock();
int i, Entry, iPrev = 0;
vUsed = Vec_IntAlloc( 1000 );
vStack = Vec_IntAlloc( 1000 );
@@ -309,8 +309,9 @@ void Sat_ProofReduce2( sat_solver2 * s )
int fVerbose = 0;
Vec_Int_t * vUsed;
satset * pNode, * pFanin, * pPivot;
- int i, k, hTemp, clk = clock();
- static int TimeTotal = 0;
+ int i, k, hTemp;
+ clock_t clk = clock();
+ static clock_t TimeTotal = 0;
// collect visited nodes
vUsed = Proof_CollectUsedIter( vProof, vRoots, 1 );
@@ -371,8 +372,9 @@ void Sat_ProofReduce( sat_solver2 * s )
int fVerbose = 0;
Vec_Ptr_t * vUsed;
satset * pNode, * pFanin, * pPivot;
- int i, j, k, hTemp, nSize, clk = clock();
- static int TimeTotal = 0;
+ int i, j, k, hTemp, nSize;
+ clock_t clk = clock();
+ static clock_t TimeTotal = 0;
// collect visited nodes
nSize = Proof_MarkUsedRec( vProof, vRoots );
@@ -525,7 +527,8 @@ void Sat_ProofCheck( sat_solver2 * s )
Vec_Set_t * vResolves;
Vec_Int_t * vUsed, * vTemp;
satset * pSet, * pSet0 = NULL, * pSet1;
- int i, k, hRoot, Handle, Counter = 0, clk = clock();
+ int i, k, hRoot, Handle, Counter = 0;
+ clock_t clk = clock();
hRoot = s->hProofLast;
if ( hRoot == -1 )
return;