wali::graph Namespace Reference

Classes
struct	ActionFunctor
class	Node
class	Graph
struct	Transition
struct	TransitionCmp
struct	TransitionEq
struct	TransitionHash
class	UnionFind
struct	InterGraphStats
class	ETransHandler
class	HyperEdge
class	GraphEdge
class	GraphNode
class	InterGraph
struct	IntraGraphStats
class	IntraGraphEdge
struct	PathSequence
struct	EvaluatedPathSequence
class	IntraGraphNode
class	update_t
class	IntraGraph
class	LinkEval
struct	cmp_reg_exp
struct	reg_exp_key_t
struct	hash_reg_exp_key
struct	hash_sem_elem
struct	sem_elem_equal
struct	sem_elem_less
struct	RegExpStats
class	RegExpSatProcess
class	RegExp
class	SummaryGraphStats
class	SummaryGraphNode
class	SummaryGraph
Typedefs
typedef std::pair< Transition, wali::sem_elem_t >	WTransition
typedef ref_ptr< InterGraph >	InterGraphPtr
typedef map< Transition, int, TransitionCmp >	transition_map_t
typedef pair< int, reg_exp_t >	heap_t
typedef ref_ptr< RegExp >	reg_exp_t
typedef long unsigned int	node_no_t
typedef pair< long int, long int >	out_node_height_t
typedef map< long int, out_node_height_t >	out_node_stat_t
typedef map< reg_exp_t, reg_exp_t, cmp_reg_exp >	reg_exp_cache_t
typedef map< unsigned int, sem_elem_t >	delta_map_t
typedef wali::HashMap < reg_exp_key_t, reg_exp_t, hash_reg_exp_key, reg_exp_key_t >	reg_exp_hash_t
typedef wali::HashMap < sem_elem_t, reg_exp_t, hash_sem_elem, sem_elem_equal >	const_reg_exp_hash_t
Enumerations
enum	inter_node_t {   InterNone = 0,   InterSource = 1,   InterOutNode = 2,   InterSourceOutNode = 3 }
enum	node_type {   None,   SuperSource,   Source,   OutNode }
enum	reg_exp_type {   Constant,   Updatable,   Extend,   Combine,   Star }
Functions
inter_node_t	promote_type (inter_node_t t1, inter_node_t t2)
bool	is_source_type (inter_node_t t1)
int	myrand (int l, int u)
int	get_number (map< int, int > &intra_node_map, int src, IntraGraph *ca)
ostream &	operator<< (ostream &out, const IntraGraphStats &s)
ostream &	operator<< (ostream &out, const RegExpStats &s)
void	my_set_union (std::set< long int > &a, std::set< long int > &b)

---

Typedef Documentation

typedef std::pair<Transition, wali::sem_elem_t> wali::graph::WTransition

typedef ref_ptr<InterGraph> wali::graph::InterGraphPtr

typedef map<Transition, int, TransitionCmp> wali::graph::transition_map_t

typedef pair<int, reg_exp_t> wali::graph::heap_t

typedef ref_ptr<RegExp> wali::graph::reg_exp_t

typedef long unsigned int wali::graph::node_no_t

typedef pair<long int, long int> wali::graph::out_node_height_t

typedef map<long int, out_node_height_t> wali::graph::out_node_stat_t

typedef map<reg_exp_t, reg_exp_t, cmp_reg_exp> wali::graph::reg_exp_cache_t

typedef map<unsigned int, sem_elem_t> wali::graph::delta_map_t

typedef wali::HashMap<reg_exp_key_t, reg_exp_t, hash_reg_exp_key, reg_exp_key_t> wali::graph::reg_exp_hash_t

typedef wali::HashMap<sem_elem_t, reg_exp_t, hash_sem_elem, sem_elem_equal> wali::graph::const_reg_exp_hash_t

---

Enumeration Type Documentation

enum wali::graph::inter_node_t

Enumerator:

InterNone
InterSource
InterOutNode
InterSourceOutNode

enum wali::graph::node_type

Enumerator:

None
SuperSource
Source
OutNode

enum wali::graph::reg_exp_type

Enumerator:

Constant
Updatable
Extend
Combine
Star

---

Function Documentation

inter_node_t wali::graph::promote_type	(	inter_node_t	t1,
		inter_node_t	t2
	)

References InterNone.

Referenced by wali::graph::InterGraph::addEdge(), wali::graph::InterGraph::setESource(), and wali::graph::InterGraph::setSource().

bool wali::graph::is_source_type

(

inter_node_t

t1

)

References InterSource, and InterSourceOutNode.

Referenced by wali::graph::InterGraph::print(), and wali::graph::InterGraph::setupInterSolution().

int wali::graph::myrand	(	int	l,
		int	u
	)

int wali::graph::get_number	(	map< int, int > &	intra_node_map,
		int	src,
		IntraGraph *	ca
	)

References wali::graph::IntraGraph::makeNode().

Referenced by wali::graph::InterGraph::path_summary().

ostream & wali::graph::operator<<	(	ostream &	out,
		const IntraGraphStats &	s
	)

ostream & wali::graph::operator<<	(	ostream &	out,
		const RegExpStats &	s
	)

void wali::graph::my_set_union	(	std::set< long int > &	a,
		std::set< long int > &	b
	)

Referenced by wali::graph::RegExp::minimize_height().