Public Types | Public Member Functions | Friends

wali::graph::InterGraph Class Reference

List of all members.

Public Types

typedef std::ostream &(* PRINT_OP )(std::ostream &, int)

Public Member Functions

 InterGraph (wali::sem_elem_t s, bool e, bool pre)
 ~InterGraph ()
void addEdge (Transition src, Transition tgt, wali::sem_elem_t se)
void addEdge (Transition src1, Transition src2, Transition tgt, wali::sem_elem_t se)
void addEdge (Transition src1, Transition src2, Transition tgt, wali::merge_fn_t mf)
void addCallRetEdge (Transition src, Transition tgt, wali::sem_elem_t se)
void addCallEdge (Transition src1, Transition src2)
void setSource (Transition t, wali::sem_elem_t se)
void setESource (Transition t, wali::sem_elem_t wtAtCall, wali::sem_elem_t wtAfterCall)
void setupInterSolution (std::list< Transition > *wt_required=NULL)
sem_elem_t get_weight (Transition t)
sem_elem_t get_call_weight (Transition t)
void update_all_weights ()
bool exists (int state, int stack, WT_CHECK op)
std::ostream & print (std::ostream &out, PRINT_OP pop=defaultPrintOp)
std::ostream & print_stats (std::ostream &out)
bool path_summary (int state, int stack, int accept, WT_CORRECT correct, WT_CHECK op)
bool exists (Transition &t)
int nGraphs ()

Friends

class SummaryGraph

Member Typedef Documentation

typedef std::ostream&(* wali::graph::InterGraph::PRINT_OP)(std::ostream &, int)

Constructor & Destructor Documentation

wali::graph::InterGraph::InterGraph ( wali::sem_elem_t  s,
bool  e,
bool  pre 
)
wali::graph::InterGraph::~InterGraph (  ) 

Member Function Documentation

void wali::graph::InterGraph::addEdge ( Transition  src,
Transition  tgt,
wali::sem_elem_t  se 
)

Referenced by addCallRetEdge().

void wali::graph::InterGraph::addEdge ( Transition  src1,
Transition  src2,
Transition  tgt,
wali::sem_elem_t  se 
)
void wali::graph::InterGraph::addEdge ( Transition  src1,
Transition  src2,
Transition  tgt,
wali::merge_fn_t  mf 
)
void wali::graph::InterGraph::addCallRetEdge ( Transition  src,
Transition  tgt,
wali::sem_elem_t  se 
)

References addEdge().

void wali::graph::InterGraph::addCallEdge ( Transition  src1,
Transition  src2 
)
void wali::graph::InterGraph::setSource ( Transition  t,
wali::sem_elem_t  se 
)
void wali::graph::InterGraph::setESource ( Transition  t,
wali::sem_elem_t  wtAtCall,
wali::sem_elem_t  wtAfterCall 
)
void wali::graph::InterGraph::setupInterSolution ( std::list< Transition > *  wt_required = NULL  ) 
sem_elem_t wali::graph::InterGraph::get_weight ( Transition  t  ) 
sem_elem_t wali::graph::InterGraph::get_call_weight ( Transition  t  ) 
void wali::graph::InterGraph::update_all_weights (  ) 
bool wali::graph::InterGraph::exists ( int  state,
int  stack,
WT_CHECK  op 
)
std::ostream & wali::graph::InterGraph::print ( std::ostream &  out,
PRINT_OP  pop = defaultPrintOp 
)
std::ostream & wali::graph::InterGraph::print_stats ( std::ostream &  out  ) 

References wali::graph::UnionFind::find(), wali::graph::RegExp::get_stats(), wali::graph::RegExpStats::hashmap_hits, wali::graph::RegExpStats::hashmap_misses, wali::graph::RegExpStats::height, wali::graph::RegExpStats::lnd, wali::graph::RegExpStats::ncombine, wali::graph::IntraGraphStats::ncombine, wali::graph::InterGraphStats::ncombine, wali::graph::InterGraphStats::ncomponents, wali::graph::IntraGraphStats::ncutset, wali::graph::InterGraphStats::ncutset, wali::graph::IntraGraphStats::ndom_componentcutset, wali::graph::InterGraphStats::ndom_componentcutset, wali::graph::IntraGraphStats::ndom_components, wali::graph::InterGraphStats::ndom_components, wali::graph::IntraGraphStats::ndom_componentsize, wali::graph::InterGraphStats::ndom_componentsize, wali::graph::IntraGraphStats::ndom_sequence, wali::graph::InterGraphStats::ndom_sequence, wali::graph::InterGraphStats::nedges, wali::graph::IntraGraphStats::nedges, wali::graph::RegExpStats::nextend, wali::graph::IntraGraphStats::nextend, wali::graph::InterGraphStats::nextend, wali::graph::IntraGraphStats::nget_weight, wali::graph::InterGraphStats::nget_weight, wali::graph::InterGraphStats::ngraphs, wali::graph::InterGraphStats::nhyperedges, wali::graph::InterGraphStats::niter, wali::graph::InterGraphStats::nnodes, wali::graph::RegExpStats::nstar, wali::graph::IntraGraphStats::nstar, wali::graph::InterGraphStats::nstar, wali::graph::IntraGraphStats::nupdatable, wali::graph::InterGraphStats::nupdatable, wali::graph::RegExp::out_node_height(), and wali::graph::RegExpStats::out_nodes.

bool wali::graph::InterGraph::path_summary ( int  state,
int  stack,
int  accept,
WT_CORRECT  correct,
WT_CHECK  op 
)
bool wali::graph::InterGraph::exists ( Transition t  ) 
int wali::graph::InterGraph::nGraphs (  ) 

Friends And Related Function Documentation

friend class SummaryGraph [friend]

The documentation for this class was generated from the following files: