call graph helper interface to depth limited search

Gets all functions reachable within n steps, by calling depth limited search

Author: polgreen

src/analyses/call_graph_helpers.cpp

@@ -70,3 +70,21 @@ std::set<irep_idt> get_reaching_functions(
 {
   return get_connected_functions(graph, function, false);
 }
+
+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;
+
+  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);
+  }
+  else
+    throw "unknown start function";
+
+  return result;
+}

src/analyses/call_graph_helpers.h

@@ -49,4 +49,18 @@ std::set<irep_idt> get_reachable_functions(
 std::set<irep_idt> get_reaching_functions(
   const call_grapht::directed_grapht &graph, const irep_idt &function);
 
+
+/// Get either callers or callees reachable from a given
+/// start function within N steps
+/// \param graph: call graph
+/// \param start_function: single start function
+/// \param n: number of steps to consider
+/// \param forwards: if true, get callees; otherwise get callers
+/// \return set of functions that can be reached from the start function
+/// including the start function
+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);
+
 #endif