summaryrefslogtreecommitdiffstats
path: root/src/proof/dch/dchInt.h
diff options
context:
space:
mode:
authorAlan Mishchenko <alanmi@berkeley.edu>2013-05-27 15:09:23 -0700
committerAlan Mishchenko <alanmi@berkeley.edu>2013-05-27 15:09:23 -0700
commit19c25fd6aab057b2373717f996fe538507c1b1e1 (patch)
tree7aa7cd7609a5de31d11b3455b6388fd9300c8d0f /src/proof/dch/dchInt.h
parent94356f0d1fa8e671303299717f631ecf0ca2f17e (diff)
downloadabc-19c25fd6aab057b2373717f996fe538507c1b1e1.tar.gz
abc-19c25fd6aab057b2373717f996fe538507c1b1e1.tar.bz2
abc-19c25fd6aab057b2373717f996fe538507c1b1e1.zip
Adding a wrapper around clock() for more accurate time counting in ABC.
Diffstat (limited to 'src/proof/dch/dchInt.h')
-rw-r--r--src/proof/dch/dchInt.h18
1 files changed, 9 insertions, 9 deletions
diff --git a/src/proof/dch/dchInt.h b/src/proof/dch/dchInt.h
index d1dd2c51..7edbc0f9 100644
--- a/src/proof/dch/dchInt.h
+++ b/src/proof/dch/dchInt.h
@@ -84,15 +84,15 @@ struct Dch_Man_t_
int nEquivs; // the number of final equivalences
int nChoices; // the number of final choice nodes
// runtime stats
- clock_t timeSimInit; // simulation and class computation
- clock_t timeSimSat; // simulation of the counter-examples
- clock_t timeSat; // solving SAT
- clock_t timeSatSat; // sat
- clock_t timeSatUnsat; // unsat
- clock_t timeSatUndec; // undecided
- clock_t timeChoice; // choice computation
- clock_t timeOther; // other runtime
- clock_t timeTotal; // total runtime
+ abctime timeSimInit; // simulation and class computation
+ abctime timeSimSat; // simulation of the counter-examples
+ abctime timeSat; // solving SAT
+ abctime timeSatSat; // sat
+ abctime timeSatUnsat; // unsat
+ abctime timeSatUndec; // undecided
+ abctime timeChoice; // choice computation
+ abctime timeOther; // other runtime
+ abctime timeTotal; // total runtime
};
////////////////////////////////////////////////////////////////////////