mirrors/yosys
3
0
Fork 0
mirror of https://github.com/YosysHQ/yosys synced 2025-06-06 06:03:23 +00:00
Code Activity

Fix translation bug: The old code really checks for the presense of a node, not an edge in glift and flatten.

Browse source 
Add back statement that inserts nodes in order in opt_expr.cc.
This commit is contained in:
Rasmus Munk Larsen 2023-10-05 17:01:42 -07:00
parent fd7bd420b3
commit 0a37c2a301
4 changed files with 4 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

8
kernel/utils.h
View file

@ -174,11 +174,7 @@ template <typename T, typename C = std::less<T>, typename OPS = hash_ops<T>> cla
void edge(T left, T right) { edge(node(left), node(right)); }
bool has_edges(const T &node)
{
auto it = node_to_index.find(node);
return it == node_to_index.end() || !edges[it->second].empty();
}
bool has_node(const T &node) { return node_to_index.find(node) != node_to_index.end(); }
bool sort()
{
@ -192,8 +188,6 @@ template <typename T, typename C = std::less<T>, typename OPS = hash_ops<T>> cla
std::vector<bool> marked_cells(edges.size(), false);
std::vector<bool> active_cells(edges.size(), false);
std::vector<int> active_stack;
marked_cells.reserve(edges.size());
sorted.reserve(edges.size());
for (const auto &it : node_to_index)