Searched refs:get_reachable (Results 1 - 2 of 2) sorted by relevance

/seL4-l4v-master/graph-refine/
H A Drep_graph.py332 def get_reachable (self, split, n): member in class:GraphSlice
342 vcount_r = [(split, count, self.get_reachable (split, n))
1012 if self.get_reachable (split, n):
H A Dloop_bounds.py605 if h not in s and rep.get_reachable (h, split) and h != split:

Completed in 45 milliseconds