FindStatements.h

Go to the documentation of this file.

#ifndef FINDSTATEMENTS_IS_DEFINED
#define FINDSTATEMENTS_IS_DEFINED


#include <AstInterface.h>
#include <StmtInfoCollect.h>
#include <ReachingDefinition.h>
#include <DefUseChain.h>

#include <iostream>
#include <iterator>
#include <list>
#include <set>

using namespace std;

//#define DEBUG_FINDSTATEMENTS

class FindDefUseChainNode : public AstSimpleProcessing {
  
  map<SgNode*,  DefUseChainNode*> &refmap; // copy of the map from memory ref to def use chain nodes
  set<DefUseChainNode*> refs;
  
 public:
  FindDefUseChainNode( map<SgNode*,  DefUseChainNode*> &r) : refmap(r) {}

  virtual void visit( SgNode* cur){
    map<SgNode*,  DefUseChainNode*>::const_iterator p = refmap.find(cur);
    if ( p  != refmap.end()) {
      refs.insert((*p).second);
    } 
  }
  set<DefUseChainNode*> get_refs(){return refs;}
};

class FindStatements {
  
 public:
  static void FindStatementsForSlice(SgNode* func_defn, SgNode* slicing_criterion, set<SgNode*>& slice,
                                     AliasAnalysisInterface* alias);
 protected:
  static bool alreadyInSlice(set<SgNode*> slice, SgNode* node);
  
  static void writeNodes(set<SgNode*> nodes, string heading);
  
  static void writeDUnodes(set<DefUseChainNode*> nodes, string heading);
};

#endif