call_sequences.cpp

Go to the documentation of this file.

/*******************************************************************\
 
Module: Printing function call sequences for Ofer
 
Author: Daniel Kroening
 
Date: April 2013
 
\*******************************************************************/
 
 
#include "call_sequences.h"
 
#include <stack>
#include <iostream>
 
#include <util/simplify_expr.h>
 
#include <goto-programs/goto_model.h>
 
#include <langapi/language_util.h>
 
#include <linking/static_lifetime_init.h>
 
void show_call_sequences(
  const irep_idt &caller,
  const goto_programt &goto_program)
{
  // show calls in  blocks within caller body
  // dfs on code blocks using stack
  std::cout << "# " << caller << '\n';
  std::stack<goto_programt::const_targett> stack;
  std::set<goto_programt::const_targett, goto_programt::target_less_than> seen;
  const goto_programt::const_targett start=goto_program.instructions.begin();
 
  if(start!=goto_program.instructions.end())
    stack.push(start);
 
  while(!stack.empty())
  {
    goto_programt::const_targett t=stack.top();
    stack.pop();
 
    if(!seen.insert(t).second)
      continue; // seen it already
    if(t->is_function_call())
    {
      const exprt &callee = t->call_function();
      if(callee.id()==ID_symbol)
      {
        std::cout << caller << " -> "
                  << to_symbol_expr(callee).get_identifier() << '\n';
      }
    }
 
    // get successors and add to stack
    for(const auto &it : goto_program.get_successors(t))
    {
      stack.push(it);
    }
  }
  std::cout << '\n';
}
 
void show_call_sequences(const goto_modelt &goto_model)
{
  // do per function
  // show the calls in the body of the specific function
 
  for(const auto &gf_entry : goto_model.goto_functions.function_map)
    show_call_sequences(gf_entry.first, gf_entry.second.body);
}
 
class check_call_sequencet
{
public:
  explicit check_call_sequencet(
    const goto_modelt &_goto_model,
    const std::vector<irep_idt> &_sequence):
    goto_functions(_goto_model.goto_functions),
    sequence(_sequence)
  {
  }
 
  void operator()();
 
protected:
  const goto_functionst &goto_functions;
  const std::vector<irep_idt> &sequence;
 
  struct call_stack_entryt
  {
    goto_functionst::function_mapt::const_iterator f;
    goto_programt::const_targett return_address;
 
    bool operator==(const call_stack_entryt &other) const
    {
      return
        f->first==other.f->first &&
        return_address==other.return_address;
    }
  };
 
  struct statet
  {
    goto_functionst::function_mapt::const_iterator f;
    goto_programt::const_targett pc;
    std::vector<call_stack_entryt> call_stack;
    unsigned index;
 
    bool operator==(const statet &other) const
    {
      return
        f->first==other.f->first &&
        pc==other.pc &&
        call_stack==other.call_stack &&
        index==other.index;
    }
  };
 
  // NOLINTNEXTLINE(readability/identifiers)
  struct state_hash
  {
    std::size_t operator()(const statet &s) const
    {
      size_t pc_hash=
        s.pc==s.f->second.body.instructions.end()?0:
        (size_t)&*s.pc;
 
      return hash_string(s.f->first)^
             pc_hash^
             s.index^s.call_stack.size();
    }
  };
 
  typedef std::unordered_set<statet, state_hash> statest;
  statest states;
};
 
void check_call_sequencet::operator()()
{
  std::stack<statet> queue;
 
  if(sequence.empty())
  {
    std::cout << "empty sequence given\n";
    return;
  }
 
  irep_idt entry=sequence.front();
 
  goto_functionst::function_mapt::const_iterator f_it=
    goto_functions.function_map.find(entry);
 
  if(f_it!=goto_functions.function_map.end())
  {
    queue.push(statet());
    queue.top().f=f_it;
    queue.top().pc=f_it->second.body.instructions.begin();
    queue.top().index=1;
  }
 
  while(!queue.empty())
  {
    statet &e=queue.top();
 
    // seen already?
    if(states.find(e)!=states.end())
    {
      // drop, continue
      queue.pop();
      continue;
    }
 
    // insert
    states.insert(e);
 
    // satisfies sequence?
    if(e.index==sequence.size())
    {
      std::cout << "sequence feasible\n";
      return;
    }
 
    // new, explore
    if(e.pc==e.f->second.body.instructions.end())
    {
      if(e.call_stack.empty())
        queue.pop();
      else
      {
        // successor is the return location
        e.pc=e.call_stack.back().return_address;
        e.f=e.call_stack.back().f;
        e.call_stack.pop_back();
      }
    }
    else if(e.pc->is_function_call())
    {
      const exprt &function = e.pc->call_function();
      if(function.id()==ID_symbol)
      {
        irep_idt identifier=to_symbol_expr(function).get_identifier();
 
        if(sequence[e.index]==identifier)
        {
          e.index++; // yes, we have seen it
 
          goto_functionst::function_mapt::const_iterator f_call_it=
            goto_functions.function_map.find(identifier);
 
          if(f_call_it==goto_functions.function_map.end())
            e.pc++;
          else
          {
            e.pc++;
            e.call_stack.push_back(call_stack_entryt());
            e.call_stack.back().return_address=e.pc;
            e.call_stack.back().f=e.f;
            e.pc=f_call_it->second.body.instructions.begin();
            e.f=f_call_it;
          }
        }
        else
          queue.pop();
      }
    }
    else if(e.pc->is_goto())
    {
      goto_programt::const_targett t=e.pc->get_target();
 
      if(e.pc->condition().is_true())
        e.pc=t;
      else
      {
        e.pc++;
        queue.push(e); // deque doesn't invalidate references
        queue.top().pc=t;
      }
    }
    else
    {
      e.pc++;
    }
  }
 
  std::cout << "sequence not feasible\n";
}
 
void check_call_sequence(const goto_modelt &goto_model)
{
  // read the sequence from stdin
 
  std::vector<irep_idt> sequence;
 
  std::string line;
  while(std::getline(std::cin, line))
  {
    if(!line.empty() && line[line.size() - 1] == '\r')
      line.resize(line.size()-1);
 
    if(!line.empty())
      sequence.push_back(line);
  }
 
  check_call_sequencet(goto_model, sequence)();
}
 
static void list_calls_and_arguments(
  const namespacet &ns,
  const goto_programt &goto_program)
{
  for(const auto &instruction : goto_program.instructions)
  {
    if(!instruction.is_function_call())
      continue;
 
    const exprt &f = instruction.call_function();
 
    if(f.id()!=ID_symbol)
      continue;
 
    const irep_idt &identifier=to_symbol_expr(f).get_identifier();
    if(identifier == INITIALIZE_FUNCTION)
      continue;
 
    std::string name=from_expr(ns, identifier, f);
    std::string::size_type java_type_suffix=name.find(":(");
    if(java_type_suffix!=std::string::npos)
      name.erase(java_type_suffix);
 
    std::cout << "found call to " << name;
 
    if(!instruction.call_arguments().empty())
    {
      std::cout << " with arguments ";
      for(exprt::operandst::const_iterator it =
            instruction.call_arguments().begin();
          it != instruction.call_arguments().end();
          ++it)
      {
        if(it != instruction.call_arguments().begin())
          std::cout << ", ";
        std::cout << from_expr(ns, identifier, simplify_expr(*it, ns));
      }
    }
 
    std::cout << '\n';
  }
}
 
void list_calls_and_arguments(const goto_modelt &goto_model)
{
  // do per function
 
  const namespacet ns(goto_model.symbol_table);
 
  for(const auto &gf_entry : goto_model.goto_functions.function_map)
    list_calls_and_arguments(ns, gf_entry.second.body);
}