torc::router::NetRouter Class Reference

Provides net routing based on the Nilsson graphsearch algorithm. More...

#include <NetRouter.hpp>

Inheritance diagram for torc::router::NetRouter:

Collaboration diagram for torc::router::NetRouter:

Public Member Functions
	NetRouter (DDB &inDB, NetRouterHeuristicBase *inHeuristic)
	Public Constructor. More...
	~NetRouter ()
	Destructor. More...
void	routeNet (RouteNet &net)
	Route a net. More...
void	resetStats ()
void	printStats (std::ostream &out)
void	route (RouteNet &inNet)
	Primary route call. More...
double	getTotalRouteTime ()
	Get total route time. More...
NetRouterHeuristicBase *	getHeuristic ()
	Get the current heuristic. More...
void	setHeuristic (NetRouterHeuristicBase *inHeuristic)
	Set the current heuristic. More...

Protected Member Functions
void	graphSearch (const Tilewire &inSource, TilewireVector &inSinks, RouteNodePtrVector &outRoute)
	Internal top level route function. More...
void	graphSearchLoop (const Tilewire &inSource, const Tilewire &inSink, RouteNodePtrVector &outRoute)
	Routing loop function. More...
void	graphSearchFilter (RouteNode *inParent, const Arc &inArc, RouteNodePtrVector &outRoute)
	Create a new node and put it into the appropriate structure. More...
void	recordPath (RouteNode *node, Tilewire key, Tilewire inSource, RouteNodePtrVector &outRoute)
	Add the newly found route to the outRoute vector. More...
void	clearContainers ()
	Delete nodes in containers and clear them. More...
bool	expandNetTerminals (Tilewire &inSource, TilewireVector &inSinks, RouteNodePtrVector &outRoute)
	Move net terminals out into the INT tiles. More...
bool	testDedicatedPath (Tilewire inSource, Tilewire inSink, RouteNodePtrVector &outRoute)
	Test for a dedicated routing path. More...
Tilewire	expandSourceTerminal (Tilewire inSource, RouteNodePtrVector &outRoute)
	Move the source terminal of a net in the sinkwards direction. More...
Tilewire	expandSinkTerminal (Tilewire inSink, RouteNodePtrVector &outRoute)
	Move the sink terminal of a net in the sourcewards direction. More...

Protected Attributes
ArcUsage &	mArcUsage
	Database reference. More...
WireUsage &	mWireUsage
	WireUsage reference. More...
RouteNodePtrQueue	mOrder
	Pointer to the heuristic for making routing decisions. More...
RouteNodePtrMap	mOpen
	Collection of candidate nodes the router can expand. More...
RouteNodePtrMap	mClosed
	Collection of nodes that have been expanded. More...
RouteNodePtrMap	mSkipped
	Collection of nodes skipped due to heuristic constraints. More...
RouteNodePtrVector	mPreRoute
	Vector of nodes created during pre-routing. More...
TilewireSet	mAuxClosed
	Set of Closed Tilewires to avoid issues with bidir resources. More...
TilewireVector	mSegmentBuf
	Scratch segment storage. More...
ArcVector	mArcsBuf
	Scratch arc storage. More...
boost::uint32_t	mSearchLimit
	Maximum number of nodes to explore before failing. More...
boost::uint32_t	mStatNets
	Number of nets routed since construction. More...
boost::uint32_t	mStatLoopPasses
	Number of passes through the main loop since construction. More...
boost::uint32_t	mStatExpanded
	Number of nodes created from expansion. More...
boost::uint32_t	mStatSources
	Number of net sources seen since construction. More...
boost::uint32_t	mStatSinks
	Number of net sinks seen since construction. More...
DDB &	mDB
	Database reference. More...
NetRouterHeuristicBase *	mHeuristic
	Pointer to the heuristic for making routing decisions. More...
boost::timer	mRouteTimer
	Timer object for performance analysis. More...
double	mTotalRouteTime
	Total routing time since construction. More...

Private Types
typedef architecture::DDB	DDB
	Imported type names. More...
typedef architecture::ArcUsage	ArcUsage
typedef architecture::WireUsage	WireUsage
typedef architecture::Tilewire	Tilewire
typedef architecture::Arc	Arc
typedef architecture::TilewireVector	TilewireVector
typedef architecture::ArcVector	ArcVector
typedef std::priority_queue < RouteNode *, std::vector < RouteNode * > , RouteNodePtrCostCompare >	RouteNodePtrQueue
typedef boost::unordered_map < Tilewire, RouteNode *, boost::hash < architecture::Tilewire > >	RouteNodePtrMap
typedef boost::unordered_set < Tilewire, boost::hash < architecture::Tilewire > >	TilewireSet

Detailed Description

Provides net routing based on the Nilsson graphsearch algorithm.

The router can either return a vector of nodes or directly populate DDB usage.

Definition at line 42 of file NetRouter.hpp.

Member Typedef Documentation

typedef architecture::Arc torc::router::NetRouter::Arc

private

Definition at line 49 of file NetRouter.hpp.

typedef architecture::ArcUsage torc::router::NetRouter::ArcUsage

private

Definition at line 46 of file NetRouter.hpp.

typedef architecture::ArcVector torc::router::NetRouter::ArcVector

private

Definition at line 51 of file NetRouter.hpp.

typedef architecture::DDB torc::router::NetRouter::DDB

private

Imported type names.

Definition at line 45 of file NetRouter.hpp.

typedef boost::unordered_map<Tilewire, RouteNode*, boost::hash<architecture::Tilewire> > torc::router::NetRouter::RouteNodePtrMap

private

Definition at line 56 of file NetRouter.hpp.

typedef std::priority_queue<RouteNode*, std::vector<RouteNode*>, RouteNodePtrCostCompare> torc::router::NetRouter::RouteNodePtrQueue

private

Definition at line 54 of file NetRouter.hpp.

typedef architecture::Tilewire torc::router::NetRouter::Tilewire

private

Definition at line 48 of file NetRouter.hpp.

typedef boost::unordered_set<Tilewire, boost::hash<architecture::Tilewire> > torc::router::NetRouter::TilewireSet

private

Definition at line 57 of file NetRouter.hpp.

typedef architecture::TilewireVector torc::router::NetRouter::TilewireVector

private

Definition at line 50 of file NetRouter.hpp.

typedef architecture::WireUsage torc::router::NetRouter::WireUsage

private

Definition at line 47 of file NetRouter.hpp.

Constructor & Destructor Documentation

torc::router::NetRouter::NetRouter ( DDB &  inDB, NetRouterHeuristicBase *  inHeuristic  )

inline

Public Constructor.

Definition at line 105 of file NetRouter.hpp.

                                                                  : 
            NetRouterBase(inDB, inHeuristic), mArcUsage(inDB.getArcUsage()), 
            mWireUsage(inDB.getWireUsage()) {
            
            mSearchLimit = 0x001FFFFF;
            mStatNets = 0u;
            mStatLoopPasses = 0u;
            mStatExpanded = 0u;
            mStatSources = 0u;
            mStatSinks = 0u;

            mTotalRouteTime = 0;
        }

torc::router::NetRouter::~NetRouter ( )

inline

Destructor.

Definition at line 119 of file NetRouter.hpp.

{}

Member Function Documentation

void torc::router::NetRouter::clearContainers ( )

inlineprotected

Delete nodes in containers and clear them.

Todo:

Report statistics on nodes deleted?

Definition at line 354 of file NetRouter.hpp.

                               {
            /// \todo Report statistics on nodes deleted?
            RouteNodePtrMap::iterator p;
            RouteNodePtrMap::iterator e = mOpen.end();
            for (p = mOpen.begin(); p != e; p++) { delete (*p).second; }
            e = mClosed.end();
            for (p = mClosed.begin(); p != e; p++) { delete (*p).second; }
            e = mSkipped.end();
            for (p = mSkipped.begin(); p != e; p++) { delete (*p).second; }
            while (!mOrder.empty()) { mOrder.pop(); }
            mOpen.clear();
            mClosed.clear();
            mSkipped.clear();
            mAuxClosed.clear();
        }

Here is the caller graph for this function:

bool torc::router::NetRouter::expandNetTerminals ( Tilewire &  inSource, TilewireVector &  inSinks, RouteNodePtrVector &  outRoute  )

inlineprotected

Move net terminals out into the INT tiles.

Definition at line 370 of file NetRouter.hpp.

                                          {
            
            if (inSource == Tilewire::sInvalid) return false;
            inSource = expandSourceTerminal(inSource, outRoute);
            TilewireVector::iterator e = inSinks.end();
            for (TilewireVector::iterator p = inSinks.begin(); p != e; p++) {
                if (*p == Tilewire::sInvalid) return false;
                *p = expandSinkTerminal(*p, outRoute);
            }
            return true;
        }

Here is the call graph for this function:

Here is the caller graph for this function:

Tilewire torc::router::NetRouter::expandSinkTerminal ( Tilewire  inSink, RouteNodePtrVector &  outRoute  )

inlineprotected

Move the sink terminal of a net in the sourcewards direction.

Definition at line 425 of file NetRouter.hpp.

                                                                                   {
            ArcVector arcs;
            //bool movingsink = false;
            Tilewire tempsink = inSink;
            mDB.expandSegmentSources(inSink, arcs);
            while (arcs.size() == 1) {
                //movingsink = true;
                RouteNode* node = new RouteNode(arcs[0], 0, 0, 0, 0);
                outRoute.push_back(node);
                mDB.useArc(arcs[0]);
                tempsink = arcs[0].getSourceTilewire();
                arcs.clear();
                mDB.expandSegmentSources(tempsink, arcs);
            }
            return arcs[0].getSinkTilewire();
        }

Here is the call graph for this function:

Here is the caller graph for this function:

Tilewire torc::router::NetRouter::expandSourceTerminal ( Tilewire  inSource, RouteNodePtrVector &  outRoute  )

inlineprotected

Move the source terminal of a net in the sinkwards direction.

Definition at line 407 of file NetRouter.hpp.

                                                                                       {
            ArcVector arcs;
            //bool movingsource = false;
            Tilewire tempsource = inSource;
            mDB.expandSegmentSinks(inSource, arcs);
            while (arcs.size() == 1) {
                //movingsource = true;
                RouteNode* node = new RouteNode(arcs[0], 0, 0, 0, 0);
                outRoute.push_back(node);
                mDB.useArc(arcs[0]);
                tempsource = arcs[0].getSinkTilewire();
                arcs.clear();
                mDB.expandSegmentSinks(tempsource, arcs);
            }
            return tempsource;
            //return arcs[0].getSourceTilewire();
        }

Here is the call graph for this function:

Here is the caller graph for this function:

NetRouterHeuristicBase* torc::router::NetRouterBase::getHeuristic ( )

inlineinherited

Get the current heuristic.

Definition at line 83 of file NetRouterBase.hpp.

{ return mHeuristic; }

Here is the caller graph for this function:

double torc::router::NetRouterBase::getTotalRouteTime ( )

inlineinherited

Get total route time.

Definition at line 81 of file NetRouterBase.hpp.

{ return mTotalRouteTime; }

void torc::router::NetRouter::graphSearch ( const Tilewire &  inSource, TilewireVector &  inSinks, RouteNodePtrVector &  outRoute  )

inlineprotected

Internal top level route function.

Todo:

Count new RouteNodes?

Todo:

Set initial cost

Definition at line 201 of file NetRouter.hpp.

                                          {
            
            clearContainers();
            
            mWireUsage.release(inSource);
            TilewireVector::const_iterator p;
            TilewireVector::const_iterator e = inSinks.end();
            for (p = inSinks.begin(); p != e; p++) {
                mWireUsage.release(*p);

            }
            mHeuristic->reorderSinks(inSource, inSinks);
            /// \todo Count new RouteNodes?
            RouteNode* s = new RouteNode(inSource, inSource, 0, 0, 0, 0);

            mOpen.insert(std::pair<Tilewire, RouteNode*>(inSource, s));
            mOrder.push(s);
            e = inSinks.end();
            for (p = inSinks.begin(); p != e; p++) {

                RouteNodePtrVector::iterator q;
                RouteNodePtrVector::iterator f = outRoute.end();
                for (q = outRoute.begin(); q != f; q++) {
                    /// \todo Set initial cost
                    mOpen.insert(std::pair<Tilewire, RouteNode*>((*q)->getSinkTilewire(), (*q)));
                    mOrder.push(*q);
                }
                mHeuristic->setSink(*p);
                ////////////////
                graphSearchLoop(inSource, *p, outRoute);
                ////////////////
                f = outRoute.end();
                for (q = outRoute.begin(); q != f; q++) {
                    Tilewire tw = (*q)->getSinkTilewire();
                    mOpen.erase(tw);
                    mClosed.erase(tw);
                    mSkipped.erase(tw);
                }
                clearContainers();
            }
            
            mWireUsage.use(inSource);
            e = inSinks.end();
            for (p = inSinks.begin(); p != e; p++) {
                mWireUsage.use(*p);
            }
        }

Here is the call graph for this function:

Here is the caller graph for this function:

void torc::router::NetRouter::graphSearchFilter ( RouteNode *  inParent, const Arc &  inArc, RouteNodePtrVector &  outRoute  )

inlineprotected

Create a new node and put it into the appropriate structure.

Todo:

Need to check to see if we should be adjusting pointers in here.

Todo:

Heuristic check if node is filtered

Todo:

Heuristic cost of node

Todo:

Cases for different places the node can go.

Definition at line 305 of file NetRouter.hpp.

                                          {

            const Tilewire& arcSink = inArc.getSinkTilewire();
            /// \todo Need to check to see if we should be adjusting pointers in here.
            if (mWireUsage.isUsed(arcSink)) return; // check if resources used 
            if (mOpen.find(arcSink) != mOpen.end()) return;
            if (mClosed.find(arcSink) != mClosed.end()) return;
            if (mSkipped.find(arcSink) != mSkipped.end()) return;
            
            if (mAuxClosed.find(arcSink) != mAuxClosed.end()) {
//              std::cout << "FOUND SPECIAL CASE: " << arcSink << std::endl;
                return;
            }

            RouteNode* node = new RouteNode(inArc, 0, 0, inParent->getDepth() + 1, inParent);
            /// \todo Heuristic check if node is filtered
            /// \todo Heuristic cost of node
            mHeuristic->nodeCost(*node);
            /// \todo Cases for different places the node can go.
            mOpen.insert(std::pair<Tilewire, RouteNode*>(arcSink, node));
            mOrder.push(node);
        }

Here is the call graph for this function:

Here is the caller graph for this function:

void torc::router::NetRouter::graphSearchLoop ( const Tilewire &  inSource, const Tilewire &  inSink, RouteNodePtrVector &  outRoute  )

inlineprotected

Routing loop function.

Todo:

Throw route failed exception.

Todo:

Throw route limited exception.

Todo:

adjust the node cost to be just the path cost?

Definition at line 250 of file NetRouter.hpp.

                                          {

            boost::uint32_t expanded = 0;
            boost::uint32_t processed = 0;
            while (true) {
                mStatLoopPasses++;
                if (mOrder.size() == 0) {
                    std::cout << "ROUTING FAILED!" << std::endl;
                    clearContainers();
                    /// \todo Throw route failed exception.
                    throw;
                }
                
                if (++processed > mSearchLimit) {
                    std::cout << "ROUTE LIMIT!" << std::endl;
                    /// \todo Throw route limited exception.
                    throw;
                }
                RouteNode* n = mOrder.top();
                Tilewire key = n->getSinkTilewire();
                RouteNodePtrMap::iterator pk = mOpen.find(key);
                mClosed.insert(std::pair<Tilewire, RouteNode*>(key, n));
                mOpen.erase(pk);
                mOrder.pop();

//std::cout << key << "    " << mOrder.size() << std::endl;
                /// \todo adjust the node cost to be just the path cost?
                
                mSegmentBuf.clear();
                mDB.expandSegment(key, mSegmentBuf);
                TilewireVector::iterator p;
                TilewireVector::iterator e = mSegmentBuf.end();
                for (p = mSegmentBuf.begin(); p != e; p++) {
                    if (*p == inSink) {
                        recordPath(n, key, inSource, outRoute);
                        mStatExpanded += expanded;
                        return;
                    }
                    mAuxClosed.insert(*p);
                }
                
                mArcsBuf.clear();

                mHeuristic->expandSegmentSinks(key, mArcsBuf);
//std::cout << "\t" << mArcsBuf.size() << std::endl;
                ArcVector::iterator q;
                ArcVector::iterator f = mArcsBuf.end();
                for (q = mArcsBuf.begin(); q != f; q++) {
                    expanded++;
                    graphSearchFilter(n, *q, outRoute);
                }
            }
        }

Here is the call graph for this function:

Here is the caller graph for this function:

void torc::router::NetRouter::printStats ( std::ostream &  out )

inline

Definition at line 190 of file NetRouter.hpp.

                                         {
            out << "Nets routed: " << mStatNets
                << " Sources: " << mStatSources
                << " Sinks : " << mStatSinks
                << " Arcs expanded: " << mStatExpanded
                << " Loop passes: " << mStatLoopPasses
                << " Total routing time: " << mTotalRouteTime
                << std::endl;
        }

void torc::router::NetRouter::recordPath ( RouteNode *  node, Tilewire  key, Tilewire  inSource, RouteNodePtrVector &  outRoute  )

inlineprotected

Add the newly found route to the outRoute vector.

Definition at line 329 of file NetRouter.hpp.

                                          {
            
            RouteNodePtrVector::iterator p;
            RouteNodePtrVector::iterator e;
            e = mPreRoute.end();
            // transfer preroute to the outRoute;
            for (p = mPreRoute.begin(); p != e; p++) {
                outRoute.push_back(*p);
            }
            mPreRoute.clear();
            while (true) {
                node->setCost(0); // new wavefront?
                e = outRoute.end();
                for (p = outRoute.begin(); p != e; p++) {
                    if ((*p)->getSinkTilewire() == node->getSinkTilewire()) return;
                }
                outRoute.push_back(node);
                if (key == inSource) return; // maybe a redundant check?
                node = node->getParent();
                if (node == 0) return;
                key = node->getSinkTilewire();
            }
        }

Here is the call graph for this function:

Here is the caller graph for this function:

void torc::router::NetRouter::resetStats ( )

inline

Definition at line 183 of file NetRouter.hpp.

                          {
            mStatNets = 0u;
            mStatLoopPasses = 0u;
            mStatExpanded = 0u;
            mStatSources = 0u;
            mStatSinks = 0u;
        }

void torc::router::NetRouterBase::route ( RouteNet &  inNet )

inlineinherited

Primary route call.

Definition at line 72 of file NetRouterBase.hpp.

                                    {
            mRouteTimer.restart();
            routeNet(inNet);
            double routeTime = mRouteTimer.elapsed();
            mTotalRouteTime += routeTime;
            inNet.mProperties[eRouteTime] = routeTime;
        }

Here is the call graph for this function:

Here is the caller graph for this function:

void torc::router::NetRouter::routeNet ( RouteNet &  net )

inlinevirtual

Route a net.

Todo:

Throw appropriate exception.

Todo:

Throw appropriate exception.

Implements torc::router::NetRouterBase.

Definition at line 122 of file NetRouter.hpp.

                                     {
//std::cout << "### ROUTING " << net.getName() << " ###" << std::endl;
            if (!net.hasOneSource()) {
                std::cout << "NetRouter does not support multiple sources" << std::endl;
                throw;
            }
            Tilewire source = *net.sourcesBegin();
            TilewireVector sinks;
            TilewireVector::iterator p;
            TilewireVector::iterator e = net.sinksEnd();
            for (p = net.sinksBegin(); p != e; p++) {
                sinks.push_back(*p);
            }
            
            // test resources in use
            if (source == Tilewire::sInvalid) {
                std::cout << net.getName() << ": source is INVALID" << std::endl;
                return;
            }
            if (mWireUsage.isUsed(source)) {
                /// \todo Throw appropriate exception.
                std::cout << "!Source already in use! " << source << std::endl;
                throw;
            }
            e = sinks.end();
            for (p = sinks.begin(); p != e; p++) {
                if (*p == Tilewire::sInvalid) {
                    std::cout << net.getName() << ": sink is INVALID" << std::endl;
                    return;
                }
                if (mWireUsage.isUsed(*p)) {
                    /// \todo Throw appropriate exception.
                    std::cout << "!Sink already in use! " << *p << std::endl;
                    throw;
                }
            }
            
            // pre-routing
            
            if (sinks.size() == 1 && testDedicatedPath(source, sinks[0], mPreRoute)) {
                RouteNodePtrVector::iterator p;
                RouteNodePtrVector::iterator e;
                e = mPreRoute.end();
                // transfer preroute to the net.
                for (p = mPreRoute.begin(); p != e; p++) {
                    net.routeNodes().push_back(*p);
                }
                mPreRoute.clear();
            } else {
                if (!expandNetTerminals(source, sinks, mPreRoute)) {
                    std::cout << "DISCARDED in expand function: " << net.getName() << std::endl;
                    throw;
                }
            
                graphSearch(source, sinks, net.routeNodes());
            }
            
            mStatNets++;
            mStatSources++;
            mStatSinks += sinks.size();
        }

Here is the call graph for this function:

void torc::router::NetRouterBase::setHeuristic ( NetRouterHeuristicBase *  inHeuristic )

inlineinherited

Set the current heuristic.

Definition at line 85 of file NetRouterBase.hpp.

{ mHeuristic = inHeuristic; }

bool torc::router::NetRouter::testDedicatedPath ( Tilewire  inSource, Tilewire  inSink, RouteNodePtrVector &  outRoute  )

inlineprotected

Test for a dedicated routing path.

Definition at line 383 of file NetRouter.hpp.

                                                                                                 {
            ArcVector arcs;
            RouteNodePtrVector tempRoute;
            Tilewire tempsink = inSink;
            mDB.expandSegmentSources(inSink, arcs);
            while (arcs.size() == 1) {
                RouteNode* node = new RouteNode(arcs[0], 0, 0, 0, 0);
                tempRoute.push_back(node);
                mDB.useArc(arcs[0]);
                tempsink = arcs[0].getSourceTilewire();
                if (tempsink == inSource) {
//                  std::cout << "FOUND DEDICATED ROUTE!!! " << inSource << " to " << inSink 
//                      << std::endl;
                    for (unsigned int i = 0; i < tempRoute.size(); i++) {
                        outRoute.push_back(tempRoute[i]);
                    }
                    return true;
                }
                arcs.clear();
                mDB.expandSegmentSources(tempsink, arcs);
            }
            return false;
        }

Here is the call graph for this function:

Here is the caller graph for this function:

Field Documentation

ArcVector torc::router::NetRouter::mArcsBuf

protected

Scratch arc storage.

Definition at line 87 of file NetRouter.hpp.

ArcUsage& torc::router::NetRouter::mArcUsage

protected

Database reference.

ArcUsage reference.

Definition at line 64 of file NetRouter.hpp.

TilewireSet torc::router::NetRouter::mAuxClosed

protected

Set of Closed Tilewires to avoid issues with bidir resources.

Definition at line 82 of file NetRouter.hpp.

RouteNodePtrMap torc::router::NetRouter::mClosed

protected

Collection of nodes that have been expanded.

Definition at line 76 of file NetRouter.hpp.

DDB& torc::router::NetRouterBase::mDB

protectedinherited

Database reference.

Definition at line 53 of file NetRouterBase.hpp.

NetRouterHeuristicBase* torc::router::NetRouterBase::mHeuristic

protectedinherited

Pointer to the heuristic for making routing decisions.

Definition at line 55 of file NetRouterBase.hpp.

RouteNodePtrMap torc::router::NetRouter::mOpen

protected

Collection of candidate nodes the router can expand.

Definition at line 74 of file NetRouter.hpp.

RouteNodePtrQueue torc::router::NetRouter::mOrder

protected

Pointer to the heuristic for making routing decisions.

Priority queue of nodes to explore during routing, mirrors mOpen.

Definition at line 72 of file NetRouter.hpp.

RouteNodePtrVector torc::router::NetRouter::mPreRoute

protected

Vector of nodes created during pre-routing.

Definition at line 80 of file NetRouter.hpp.

boost::timer torc::router::NetRouterBase::mRouteTimer

protectedinherited

Timer object for performance analysis.

Definition at line 57 of file NetRouterBase.hpp.

boost::uint32_t torc::router::NetRouter::mSearchLimit

protected

Maximum number of nodes to explore before failing.

Definition at line 90 of file NetRouter.hpp.

TilewireVector torc::router::NetRouter::mSegmentBuf

protected

Scratch segment storage.

Definition at line 85 of file NetRouter.hpp.

RouteNodePtrMap torc::router::NetRouter::mSkipped

protected

Collection of nodes skipped due to heuristic constraints.

Definition at line 78 of file NetRouter.hpp.

boost::uint32_t torc::router::NetRouter::mStatExpanded

protected

Number of nodes created from expansion.

Definition at line 96 of file NetRouter.hpp.

boost::uint32_t torc::router::NetRouter::mStatLoopPasses

protected

Number of passes through the main loop since construction.

Definition at line 94 of file NetRouter.hpp.

boost::uint32_t torc::router::NetRouter::mStatNets

protected

Number of nets routed since construction.

Definition at line 92 of file NetRouter.hpp.

boost::uint32_t torc::router::NetRouter::mStatSinks

protected

Number of net sinks seen since construction.

Definition at line 100 of file NetRouter.hpp.

boost::uint32_t torc::router::NetRouter::mStatSources

protected

Number of net sources seen since construction.

Definition at line 98 of file NetRouter.hpp.

double torc::router::NetRouterBase::mTotalRouteTime

protectedinherited

Total routing time since construction.

Definition at line 59 of file NetRouterBase.hpp.

WireUsage& torc::router::NetRouter::mWireUsage

protected

WireUsage reference.

Definition at line 66 of file NetRouter.hpp.

---

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

• NetRouter.hpp