LLVM API Documentation

Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

DomTreeDFS::Node Class Reference

Collaboration diagram for DomTreeDFS::Node:

Collaboration graph
[legend]
List of all members.

Public Types

typedef std::vector< Node
* >::iterator 		iterator
typedef std::vector< Node
* >::const_iterator 		const_iterator

Public Member Functions

unsigned getDFSNumIn () const
unsigned getDFSNumOut () const
BasicBlock * getBlock () const
iterator begin ()
iterator end ()
const_iterator begin () const
const_iterator end () const
bool dominates (const Node *N) const
bool DominatedBy (const Node *N) const
bool operator< (const Node &N) const
bool operator> (const Node &N) const

Friends

class DomTreeDFS

Member Typedef Documentation

typedef std::vector<Node *>::const_iterator DomTreeDFS::Node::const_iterator
 

Definition at line 120 of file PredicateSimplifier.cpp.

typedef std::vector<Node *>::iterator DomTreeDFS::Node::iterator
 

Definition at line 119 of file PredicateSimplifier.cpp.

Member Function Documentation

const_iterator DomTreeDFS::Node::begin (   )  const [inline]
 

Definition at line 130 of file PredicateSimplifier.cpp.

iterator DomTreeDFS::Node::begin (   )  [inline]
 

Definition at line 127 of file PredicateSimplifier.cpp.

Referenced by InequalityGraph::Node::begin(), and DomTreeDFS::~DomTreeDFS().

bool DomTreeDFS::Node::DominatedBy (  const Node *  N  )  const [inline]
 

Definition at line 137 of file PredicateSimplifier.cpp.

References dominates().

Referenced by InequalityGraph::addInequality(), InequalityGraph::Node::find(), and InequalityGraph::Node::update().

bool DomTreeDFS::Node::dominates (  const Node *  N  )  const [inline]
 

Definition at line 133 of file PredicateSimplifier.cpp.

References DFSin, and DFSout.

Referenced by DominatedBy(), and DomTreeDFS::dominates().

const_iterator DomTreeDFS::Node::end (   )  const [inline]
 

Definition at line 131 of file PredicateSimplifier.cpp.

iterator DomTreeDFS::Node::end (   )  [inline]
 

Definition at line 128 of file PredicateSimplifier.cpp.

Referenced by InequalityGraph::Node::end(), and DomTreeDFS::~DomTreeDFS().

BasicBlock* DomTreeDFS::Node::getBlock (   )  const [inline]
 

Definition at line 125 of file PredicateSimplifier.cpp.

unsigned DomTreeDFS::Node::getDFSNumIn (   )  const [inline]
 

Definition at line 122 of file PredicateSimplifier.cpp.

unsigned DomTreeDFS::Node::getDFSNumOut (   )  const [inline]
 

Definition at line 123 of file PredicateSimplifier.cpp.

bool DomTreeDFS::Node::operator< (  const Node &  N  )  const [inline]
 

Sorts by the number of descendants. With this, you can iterate through a sorted list and the first matching entry is the most specific match for your basic block. The order provided is stable; DomTreeDFS::Nodes with the same number of descendants are sorted by DFS in number.

Definition at line 146 of file PredicateSimplifier.cpp.

References DFSin, and DFSout.

bool DomTreeDFS::Node::operator> (  const Node &  N  )  const [inline]
 

Definition at line 152 of file PredicateSimplifier.cpp.

Friends And Related Function Documentation

friend class DomTreeDFS [friend]
 

Definition at line 117 of file PredicateSimplifier.cpp.

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

Generated on Thu Aug 21 02:46:00 2008 for LLVM by Doxygen1.3.9.1
Copyright © 2003-2007 University of Illinois at Urbana-Champaign. All Rights Reserved.

This web site is hosted by the Computer Science Department at the University of Illinois at Urbana-Champaign.