summaryrefslogtreecommitdiff
path: root/passes
diff options
context:
space:
mode:
authorClifford Wolf <clifford@clifford.at>2015-08-13 09:30:20 +0200
committerClifford Wolf <clifford@clifford.at>2015-08-13 09:30:20 +0200
commit08ad5409a2e5b6dda9f9b2c361e6d82bf0551e51 (patch)
tree9281a91c8effbebe727ed1391b2e9036ef3b5361 /passes
parent667b0150185d53578b002a00df9c4f347a35fed2 (diff)
Some ASCII encoding fixes (comments and docs) by Larry Doolittle
Diffstat (limited to 'passes')
-rw-r--r--passes/cmds/scc.cc2
-rw-r--r--passes/techmap/abc.cc2
2 files changed, 2 insertions, 2 deletions
diff --git a/passes/cmds/scc.cc b/passes/cmds/scc.cc
index 4acb5aef..43a43b4f 100644
--- a/passes/cmds/scc.cc
+++ b/passes/cmds/scc.cc
@@ -18,7 +18,7 @@
*/
// [[CITE]] Tarjan's strongly connected components algorithm
-// Tarjan, R. E. (1972), "Depth-first search and linear graph algorithms", SIAM Journal on Computing 1 (2): 146–160, doi:10.1137/0201010
+// Tarjan, R. E. (1972), "Depth-first search and linear graph algorithms", SIAM Journal on Computing 1 (2): 146-160, doi:10.1137/0201010
// http://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm
#include "kernel/register.h"
diff --git a/passes/techmap/abc.cc b/passes/techmap/abc.cc
index 1449f2e8..c19593f0 100644
--- a/passes/techmap/abc.cc
+++ b/passes/techmap/abc.cc
@@ -26,7 +26,7 @@
// http://www.ece.cmu.edu/~ee760/760docs/blif.pdf
// [[CITE]] Kahn's Topological sorting algorithm
-// Kahn, Arthur B. (1962), "Topological sorting of large networks", Communications of the ACM 5 (11): 558–562, doi:10.1145/368996.369025
+// 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; scorr; ifraig; retime {D}; strash; dch -f; map {D}"