summaryrefslogtreecommitdiffstats
path: root/src/proof/fraig/fraigInt.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/fraig/fraigInt.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/fraig/fraigInt.h')
-rw-r--r--src/proof/fraig/fraigInt.h24
1 files changed, 12 insertions, 12 deletions
diff --git a/src/proof/fraig/fraigInt.h b/src/proof/fraig/fraigInt.h
index 0decf6ff..37f00720 100644
--- a/src/proof/fraig/fraigInt.h
+++ b/src/proof/fraig/fraigInt.h
@@ -189,18 +189,18 @@ struct Fraig_ManStruct_t_
int nImplies1;
// runtime statistics
- clock_t timeToAig; // time to transfer to the mapping structure
- clock_t timeSims; // time to compute k-feasible cuts
- clock_t timeTrav; // time to traverse the network
- clock_t timeFeed; // time for solver feedback (recording and resimulating)
- clock_t timeImply; // time to analyze implications
- clock_t timeSat; // time to compute the truth table for each cut
- clock_t timeToNet; // time to transfer back to the network
- clock_t timeTotal; // the total mapping time
- clock_t time1; // time to perform one task
- clock_t time2; // time to perform another task
- clock_t time3; // time to perform another task
- clock_t time4; // time to perform another task
+ abctime timeToAig; // time to transfer to the mapping structure
+ abctime timeSims; // time to compute k-feasible cuts
+ abctime timeTrav; // time to traverse the network
+ abctime timeFeed; // time for solver feedback (recording and resimulating)
+ abctime timeImply; // time to analyze implications
+ abctime timeSat; // time to compute the truth table for each cut
+ abctime timeToNet; // time to transfer back to the network
+ abctime timeTotal; // the total mapping time
+ abctime time1; // time to perform one task
+ abctime time2; // time to perform another task
+ abctime time3; // time to perform another task
+ abctime time4; // time to perform another task
};
// the mapping node