summaryrefslogtreecommitdiffstats
path: root/src/opt/lpk
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/opt/lpk
parent16d96fcf533fb77ff4a45992991e38ac7ea74bb3 (diff)
downloadabc-3aab7245738a69f1dd4d898493d5dabf6596ea61.tar.gz
abc-3aab7245738a69f1dd4d898493d5dabf6596ea61.tar.bz2
abc-3aab7245738a69f1dd4d898493d5dabf6596ea61.zip
Fixing time primtouts throughout the code.
Diffstat (limited to 'src/opt/lpk')
-rw-r--r--src/opt/lpk/lpkAbcDec.c2
-rw-r--r--src/opt/lpk/lpkCore.c12
-rw-r--r--src/opt/lpk/lpkInt.h26
3 files changed, 22 insertions, 18 deletions
diff --git a/src/opt/lpk/lpkAbcDec.c b/src/opt/lpk/lpkAbcDec.c
index de5b66cc..731c37e6 100644
--- a/src/opt/lpk/lpkAbcDec.c
+++ b/src/opt/lpk/lpkAbcDec.c
@@ -148,7 +148,7 @@ int Lpk_Decompose_rec( Lpk_Man_t * pMan, Lpk_Fun_t * p )
{
Lpk_Res_t * pResMux, * pResDsd;
Lpk_Fun_t * p2;
- int clk;
+ clock_t clk;
// is only called for non-trivial blocks
assert( p->nLutK >= 3 && p->nLutK <= 6 );
diff --git a/src/opt/lpk/lpkCore.c b/src/opt/lpk/lpkCore.c
index 5019ba83..6ab13bda 100644
--- a/src/opt/lpk/lpkCore.c
+++ b/src/opt/lpk/lpkCore.c
@@ -133,7 +133,8 @@ int Lpk_ExploreCut( Lpk_Man_t * p, Lpk_Cut_t * pCut, Kit_DsdNtk_t * pNtk )
Kit_DsdObj_t * pRoot;
If_Obj_t * pDriver, * ppLeaves[16];
Abc_Obj_t * pLeaf, * pObjNew;
- int nGain, i, clk;
+ int nGain, i;
+ clock_t clk;
int nNodesBef;
// int nOldShared;
@@ -242,7 +243,8 @@ int Lpk_ResynthesizeNode( Lpk_Man_t * p )
Kit_DsdNtk_t * pDsdNtk;
Lpk_Cut_t * pCut;
unsigned * pTruth;
- int i, k, nSuppSize, nCutNodes, RetValue, clk;
+ int i, k, nSuppSize, nCutNodes, RetValue;
+ clock_t clk;
// compute the cuts
clk = clock();
@@ -371,7 +373,8 @@ int Lpk_ResynthesizeNodeNew( Lpk_Man_t * p )
Lpk_Cut_t * pCut;
unsigned * pTruth;
int nNodesBef, nNodesAft, nCutNodes;
- int i, k, clk;
+ int i, k;
+ clock_t clk;
int Required = Abc_ObjRequiredLevel(p->pObj);
// CloudNode * pFun2;//, * pFun1;
@@ -507,7 +510,8 @@ int Lpk_Resynthesize( Abc_Ntk_t * pNtk, Lpk_Par_t * pPars )
Abc_Obj_t * pObj;
double Delta;
// int * pnFanouts, nObjMax;
- int i, Iter, nNodes, nNodesPrev, clk = clock();
+ int i, Iter, nNodes, nNodesPrev;
+ clock_t clk = clock();
assert( Abc_NtkIsLogic(pNtk) );
// sweep dangling nodes as a preprocessing step
diff --git a/src/opt/lpk/lpkInt.h b/src/opt/lpk/lpkInt.h
index 61fa1624..2ff47dc4 100644
--- a/src/opt/lpk/lpkInt.h
+++ b/src/opt/lpk/lpkInt.h
@@ -121,20 +121,20 @@ struct Lpk_Man_t_
// counter of non-DSD blocks
int nBlocks[17];
// runtime
- int timeCuts;
- int timeTruth;
- int timeSupps;
- int timeTruth2;
- int timeTruth3;
- int timeEval;
- int timeMap;
- int timeOther;
- int timeTotal;
+ clock_t timeCuts;
+ clock_t timeTruth;
+ clock_t timeSupps;
+ clock_t timeTruth2;
+ clock_t timeTruth3;
+ clock_t timeEval;
+ clock_t timeMap;
+ clock_t timeOther;
+ clock_t timeTotal;
// runtime of eval
- int timeEvalMuxAn;
- int timeEvalMuxSp;
- int timeEvalDsdAn;
- int timeEvalDsdSp;
+ clock_t timeEvalMuxAn;
+ clock_t timeEvalMuxSp;
+ clock_t timeEvalDsdAn;
+ clock_t timeEvalDsdSp;
};