summaryrefslogtreecommitdiff
path: root/passes/abc
diff options
context:
space:
mode:
authorClifford Wolf <clifford@clifford.at>2014-02-13 19:14:15 +0100
committerClifford Wolf <clifford@clifford.at>2014-02-13 19:14:15 +0100
commitde3ea9269a55b653b94651559bebc93e01e28afb (patch)
tree105823f11adc8cd67d2b0fd0b735fd038985789d /passes/abc
parenta1239416185aebca03d131dc3ebe3e3d45c5a9f3 (diff)
updated default ABC command strings
Diffstat (limited to 'passes/abc')
-rw-r--r--passes/abc/abc.cc8
1 files changed, 4 insertions, 4 deletions
diff --git a/passes/abc/abc.cc b/passes/abc/abc.cc
index eaecb791..4add6452 100644
--- a/passes/abc/abc.cc
+++ b/passes/abc/abc.cc
@@ -29,10 +29,10 @@
// Kahn, Arthur B. (1962), "Topological sorting of large networks", Communications of the ACM 5 (11): 558–562, doi:10.1145/368996.369025
// http://en.wikipedia.org/wiki/Topological_sorting
-#define ABC_COMMAND_LIB "strash; ifraig -v; retime -v; balance -v; scorr -v; dch -vf; map -v;"
-#define ABC_COMMAND_CTR "strash; ifraig -v; retime -v; balance -v; scorr -v; dch -vf; map -v; buffer -v; upsize -v; dnsize -v; stime -p"
-#define ABC_COMMAND_LUT "strash; ifraig -v; retime -v; balance -v; scorr -v; dch -vf; if -v"
-#define ABC_COMMAND_DFL "strash; ifraig -v; retime -v; balance -v; scorr -v; dch -vf; map -v"
+#define ABC_COMMAND_LIB "strash; scorr -v; ifraig -v; retime -v; strash; dch -vf; map -v"
+#define ABC_COMMAND_CTR "strash; scorr -v; ifraig -v; retime -v; strash; dch -vf; map -v; buffer -v; upsize -v; dnsize -v; stime -p"
+#define ABC_COMMAND_LUT "strash; scorr -v; ifraig -v; retime -v; strash; dch -vf; if -v"
+#define ABC_COMMAND_DFL "strash; scorr -v; ifraig -v; retime -v; strash; dch -vf; map -v"
#include "kernel/register.h"
#include "kernel/sigtools.h"