All current features except show_ancestors implemented

viperproject · Dec 1, 2023 · d9b7c34 · d9b7c34
1 parent 59a2e31
commit d9b7c34
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 9 deletions.
diff --git a/axiom-profiler-GUI/src/results/filters/graph_filters.rs b/axiom-profiler-GUI/src/results/filters/graph_filters.rs
@@ -55,8 +55,7 @@ impl Filter {
             Filter::MaxInsts(n) => graph.keep_n_most_costly(n),
             Filter::HideSubTreeWithRoot(nidx) => graph.remove_subtree_with_root(nidx),
             Filter::ShowNeighbours(nidx, direction) => graph.show_neighbours(nidx, direction),
-            // Filter::ShowSourceTree(nidx) => graph.show_ancestors(nidx),
-            _ => (),
+            Filter::ShowSourceTree(nidx) => graph.show_ancestors(nidx),
         }
     }
 }

diff --git a/smt-log-parser/src/parsers/z3/inst_graph.rs b/smt-log-parser/src/parsers/z3/inst_graph.rs
@@ -195,13 +195,13 @@ impl InstGraph {
         }
     }
 
-    // pub fn show_ancestors(&mut self, node: NodeIndex) {
-    //     let orig_with_reversed_edges = petgraph::visit::Reversed(&self.orig_graph);
-    //     let mut dfs = Dfs::new(orig_with_reversed_edges, node);
-    //     while let Some(nx) = dfs.next(orig_with_reversed_edges) {
-    //         self.orig_graph[nx].visible = true;
-    //     }
-    // }
+    pub fn show_ancestors(&mut self, node: NodeIndex) {
+        // let orig_with_reversed_edges = petgraph::visit::Reversed(&self.orig_graph);
+        // let mut dfs = Dfs::new(orig_with_reversed_edges, node);
+        // while let Some(nx) = dfs.next(orig_with_reversed_edges) {
+        //     self.orig_graph[nx].visible = true;
+        // }
+    }
 
     pub fn reset(&mut self) {
         for node in self.orig_graph.node_weights_mut() {