to find if a node has other node in its output via any combinational …

…connection
masc-ucsc · Oct 21, 2023 · 990be13 · 990be13
1 parent 87577c2
commit 990be13
Show file tree

Hide file tree

Showing 2 changed files with 18 additions and 0 deletions.
diff --git a/lgraph/node.cpp b/lgraph/node.cpp
@@ -434,6 +434,23 @@ bool Node::is_root() const {
   return ans;
 }
 
+bool Node::is_combinationally_connected(const Node &n2) const {
+  bool is_comb_conn = false;
+  for (const auto &e : out_edges()) {
+    auto n = e.sink.get_node();
+    if ( n == n2 ) {
+      //n2 IS connected to the node's out.
+      is_comb_conn = true;
+      break;
+    } else if ( n.is_type_flop() ) {
+      is_comb_conn = false;
+    } else {
+      is_comb_conn = n.is_combinationally_connected(n2);
+    }
+  }
+  return is_comb_conn;
+}
+
 Node Node::get_up_node() const {
   I(!is_root());
   I(!Hierarchy::is_invalid(hidx));

diff --git a/lgraph/node.hpp b/lgraph/node.hpp
@@ -313,6 +313,7 @@ class Node {
   Hierarchy_index hierarchy_go_up() const;
   Node            get_up_node() const;
   bool            is_root() const;
+  bool            is_combinationally_connected(const Node &n2) const;
 
   void            set_type_sub(Lg_type_id subid);
   void            set_type_const(const Lconst &val);