Graph: add reachable stop node

1 files changed, 18 insertions, 0 deletions

diff --git a/miasm2/core/graph.py b/miasm2/core/graph.py
index d35148b1..a817c024 100644
--- a/miasm2/core/graph.py
+++ b/miasm2/core/graph.py
@@ -267,6 +267,12 @@ class DiGraph(object):
             for next_node in next_cb(node):
                 todo.add(next_node)
 
+    def predecessors_stop_node_iter(self, node, head):
+        if node == head:
+            raise StopIteration
+        for next_node in self.predecessors_iter(node):
+            yield next_node
+
     def reachable_sons(self, head):
         """Compute all nodes reachable from node @head. Each son is an
         immediate successor of an arbitrary, already yielded son of @head"""
@@ -277,6 +283,18 @@ class DiGraph(object):
         predecessor of an arbitrary, already yielded parent of @leaf"""
         return self._reachable_nodes(leaf, self.predecessors_iter)
 
+    def reachable_parents_stop_node(self, leaf, head):
+        """Compute all parents of node @leaf. Each parent is an immediate
+        predecessor of an arbitrary, already yielded parent of @leaf.
+        Do not compute reachables past @head node"""
+        return self._reachable_nodes(
+            leaf,
+            lambda node_cur: self.predecessors_stop_node_iter(
+                node_cur, head
+            )
+        )
+
+
     @staticmethod
     def _compute_generic_dominators(head, reachable_cb, prev_cb, next_cb):
         """Generic algorithm to compute either the dominators or postdominators