summaryrefslogtreecommitdiff
path: root/passes/abc
diff options
context:
space:
mode:
authorClifford Wolf <clifford@clifford.at>2013-03-15 10:23:02 +0100
committerClifford Wolf <clifford@clifford.at>2013-03-15 10:23:02 +0100
commit10956cb84aa7c3dd2300794b9283951dece9e5fa (patch)
treef61270ba49c58b0800885567fc489eaaa430f01a /passes/abc
parent89f009d17187690fe0446fd95a1f623516a33f3d (diff)
Added [[CITE]] tags to abc and fsm_extract passes
Diffstat (limited to 'passes/abc')
-rw-r--r--passes/abc/abc.cc9
1 files changed, 9 insertions, 0 deletions
diff --git a/passes/abc/abc.cc b/passes/abc/abc.cc
index a51557a4..acd93546 100644
--- a/passes/abc/abc.cc
+++ b/passes/abc/abc.cc
@@ -17,6 +17,14 @@
*
*/
+// [[CITE]] ABC
+// Berkeley Logic Synthesis and Verification Group, ABC: A System for Sequential Synthesis and Verification
+// http://www.eecs.berkeley.edu/~alanmi/abc/
+
+// [[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
+// http://en.wikipedia.org/wiki/Topological_sorting
+
#include "kernel/register.h"
#include "kernel/sigtools.h"
#include "kernel/log.h"
@@ -187,6 +195,7 @@ static void dump_loop_graph(FILE *f, int &nr, std::map<int, std::set<int>> &edge
static void handle_loops()
{
// http://en.wikipedia.org/wiki/Topological_sorting
+ // (Kahn, Arthur B. (1962), "Topological sorting of large networks")
std::map<int, std::set<int>> edges;
std::vector<int> in_edges_count(signal_list.size());