ORDERED_NODE_ITER Module Reference

#include <ip_graph_trav.h>

Collaboration diagram for ORDERED_NODE_ITER:

[legend]

Public Member Functions
	ORDERED_NODE_ITER (GRAPH *gr, TRAVERSAL_ORDER o, MEM_POOL *mm)
	~ORDERED_NODE_ITER (void)
void	operator++ ()
NODE_INDEX	Current () const
BOOL	Is_Empty () const
void	Reset ()
void	Print (FILE *)
void	Compute_Node_Level (NODE_INDEX)
Private Member Functions
void	Walk (NODE_INDEX r, mUINT8 *visit)
void	BuildVector (TRAVERSAL_ORDER)
void	MarkRecursive (mUINT8 visit[], NODE_INDEX r)
void	Build_Level_Order ()
Private Attributes
GRAPH *	g
INT	cur_v
VVECTOR *	v
TRAVERSAL_ORDER	order
MEM_POOL *	m

---

Detailed Description

Definition at line 157 of file ip_graph_trav.h.

---

Constructor & Destructor Documentation

ORDERED_NODE_ITER::ORDERED_NODE_ITER	(	GRAPH *	gr,
		TRAVERSAL_ORDER	o,
		MEM_POOL *	mm
	)			[inline]

Definition at line 173 of file ip_graph_trav.h.

References BuildVector(), cur_v, g, m, and order.

ORDERED_NODE_ITER::~ORDERED_NODE_ITER

(

void

)

[inline]

Definition at line 181 of file ip_graph_trav.h.

References CXX_DELETE, Malloc_Mem_Pool, and v.

---

Member Function/Subroutine Documentation

void ORDERED_NODE_ITER::Walk	(	NODE_INDEX	r,
		mUINT8 *	visit
	)			[private]

Referenced by BuildVector().

void ORDERED_NODE_ITER::BuildVector

(

TRAVERSAL_ORDER

order

)

[private]

Definition at line 60 of file ip_graph_trav.cxx.

References VVECTOR::Append(), Build_Level_Order(), BZERO, CXX_DELETE_ARRAY, CXX_NEW, CXX_NEW_ARRAY, DONTCARE, g, GRAPH_root, GRAPH_v_i, GRAPH_vmax, i, INT, Level_Count, LEVELORDER, Malloc_Mem_Pool, mUINT8, NODE_fcnt, POSTORDER, PREORDER, v, and Walk().

Referenced by ORDERED_NODE_ITER().

void ORDERED_NODE_ITER::MarkRecursive	(	mUINT8	visit[],
		NODE_INDEX	r
	)			[private]

Definition at line 117 of file ip_graph_trav.cxx.

References NODE_ITER::Current_Edge_Index(), NODE_ITER::First_Succ(), fprintf(), g, GRAPH_e_i, NODE_ITER::Next_Succ(), Set_EDGE_recursive, and TFile.

void ORDERED_NODE_ITER::Build_Level_Order

(

)

[private]

Definition at line 211 of file ip_graph_trav.cxx.

References VVECTOR::Append(), CXX_DELETE_ARRAY, CXX_NEW_ARRAY, g, GRAPH_v_i, GRAPH_vmax, i, INT, IPA_CG_Max_Depth, Level_Count, Malloc_Mem_Pool, NODE_fcnt, GRAPH::Node_Level(), and v.

Referenced by BuildVector().

void ORDERED_NODE_ITER::operator++

(

void

)

[inline]

Definition at line 186 of file ip_graph_trav.h.

References cur_v.

NODE_INDEX ORDERED_NODE_ITER::Current

(

void

)

const [inline]

Definition at line 187 of file ip_graph_trav.h.

References cur_v, and v.

Referenced by IPA_NODE_ITER::Current().

BOOL ORDERED_NODE_ITER::Is_Empty

(

void

)

const [inline]

Definition at line 188 of file ip_graph_trav.h.

References VVECTOR::Cnt(), cur_v, and v.

Referenced by IPA_NODE_ITER::Is_Empty().

void ORDERED_NODE_ITER::Reset

(

)

[inline]

Definition at line 189 of file ip_graph_trav.h.

References cur_v.

Referenced by IPA_NODE_ITER::First().

void ORDERED_NODE_ITER::Print

(

FILE *

fp

)

Definition at line 98 of file ip_graph_trav.cxx.

References VVECTOR::Cnt(), fprintf(), i, INT, order, POSTORDER, PREORDER, and v.

Referenced by IPA_NODE_ITER::Print().

void ORDERED_NODE_ITER::Compute_Node_Level

(

NODE_INDEX

r

)

Definition at line 181 of file ip_graph_trav.cxx.

References NODE_ITER::First_Succ(), g, INT, IPA_CG_Max_Depth, Level_Count, NODE_ITER::Next_Succ(), GRAPH::Node_Level(), and GRAPH::Set_Node_Level().

---

Field Documentation

GRAPH* ORDERED_NODE_ITER::g [private]

Definition at line 160 of file ip_graph_trav.h.

Referenced by Build_Level_Order(), BuildVector(), Compute_Node_Level(), MarkRecursive(), and ORDERED_NODE_ITER().

INT ORDERED_NODE_ITER::cur_v [private]

Definition at line 161 of file ip_graph_trav.h.

Referenced by Current(), Is_Empty(), operator++(), ORDERED_NODE_ITER(), and Reset().

VVECTOR* ORDERED_NODE_ITER::v [private]

Definition at line 162 of file ip_graph_trav.h.

Referenced by Build_Level_Order(), BuildVector(), Current(), Is_Empty(), Print(), and ~ORDERED_NODE_ITER().

TRAVERSAL_ORDER ORDERED_NODE_ITER::order [private]

Definition at line 163 of file ip_graph_trav.h.

Referenced by ORDERED_NODE_ITER(), and Print().

MEM_POOL* ORDERED_NODE_ITER::m [private]

Definition at line 164 of file ip_graph_trav.h.

Referenced by ORDERED_NODE_ITER().

---

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

• osprey/ipa/main/analyze/ip_graph_trav.h
• osprey/ipa/main/analyze/ip_graph_trav.cxx