tmp debugging code

Author: polgreen

src/analyses/call_graph_helpers.cpp

@@ -71,20 +71,30 @@ std::set<irep_idt> get_reaching_functions(
   return get_connected_functions(graph, function, false);
 }
 
+#include <iostream>
 std::set<irep_idt> get_functions_reachable_within_n_steps(
   const call_grapht::directed_grapht &graph,
   const irep_idt &start_function,
   std::size_t n)
 {
   std::set<irep_idt> result;
+  std::cout<<"GRAPH:\n";
+  graph.output_dot(std::cout);
+  std::cout<<"REACHABLE: ";
+
 
   if(auto start_idx = graph.get_node_index(start_function))
   {
     for(const auto &index : graph.depth_limited_search(*start_idx, n))
+    {
       result.insert(graph[index].function);
+      std::cout<<index<<" ";
+    }
+std::cout<<std::endl;
   }
   else
     throw "unknown start function";
 
+
   return result;
 }

unit/analyses/call_graph.cpp

@@ -225,26 +225,30 @@ SCENARIO("call_graph",
 
       THEN("We expect {A,B} to be reachable from {A} in 1 step")
       {
+        call_graph_from_goto_functions.output(std::cout);
+        exported.output_dot(std::cout);
         irep_idt function_name = "A";
         std::size_t depth = 1;
+        std::cout<<"functions reachable within 1 step from A\n";
         std::set<irep_idt> reachable = get_functions_reachable_within_n_steps(
           exported, function_name, depth);
         REQUIRE(reachable.size() == 2);
         REQUIRE(reachable.count("A"));
         REQUIRE(reachable.count("B"));
       }
-      THEN("We expect {A,B,C,D} to be reachable from {A} in 2 and 3 steps")
+      THEN("We expect {B,C,D} to be reachable from {A} in 2 and 3 steps")
       {
         irep_idt function_name = "A";
         std::size_t depth = 2;
+        std::cout<<"functions reachable within 2 steps from A\n";
         std::set<irep_idt> reachable = get_functions_reachable_within_n_steps(
           exported, function_name, depth);
         REQUIRE(reachable.size() == 4);
         REQUIRE(reachable.count("A"));
         REQUIRE(reachable.count("B"));
         REQUIRE(reachable.count("C"));
         REQUIRE(reachable.count("D"));
-
+        std::cout<<"functions reachable within 3 steps from A\n";
         depth = 3;
         reachable = get_functions_reachable_within_n_steps(
           exported, function_name, depth);
@@ -257,6 +261,7 @@ SCENARIO("call_graph",
 
       THEN("We expect nothing to be reachable in 0 steps")
       {
+        std::cout<<"functions reachable within 0 steps from A\n";
         irep_idt function_name = "A";
         std::size_t depth = 0;
         std::set<irep_idt> reachable = get_functions_reachable_within_n_steps(