BFRescheduleSuccessorsClose Class Reference

#include <BFRescheduleSuccessorsClose.hh>

Inheritance diagram for BFRescheduleSuccessorsClose:

Collaboration diagram for BFRescheduleSuccessorsClose:

Public Member Functions
	BFRescheduleSuccessorsClose (BF2Scheduler &sched, MoveNode &mn)
bool	operator() ()
Public Member Functions inherited from BFOptimization
	BFOptimization (BF2Scheduler &sched)
virtual bool	isFinishFront ()
virtual void	mightBeReady (MoveNode &mn)
Public Member Functions inherited from Reversible
virtual void	undo ()
virtual	~Reversible ()
void	deleteChildren (std::stack< Reversible * > &children)
int	id ()
	Reversible ()

Private Attributes
MoveNode &	mn_

Additional Inherited Members
Static Public Member Functions inherited from BFOptimization
static void	clearPrologMoves ()
static MoveNode *	getSisterTrigger (const MoveNode &mn, const TTAMachine::Machine &mach)
Protected Member Functions inherited from BFOptimization
DataDependenceGraph &	ddg ()
DataDependenceGraph *	rootDDG ()
const DataDependenceGraph &	ddg () const
DataDependenceGraph *	prologDDG ()
SimpleResourceManager &	rm () const
SimpleResourceManager *	prologRM () const
BUMoveNodeSelector &	selector ()
const TTAMachine::Machine &	targetMachine () const
unsigned int	ii () const
MoveNodeDuplicator &	duplicator () const
virtual bool	assign (int cycle, MoveNode &, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU_=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1, bool ignoreGuardWriteCycle=false)
virtual void	unassign (MoveNode &mn, bool disposePrologCopy=true)
virtual int	rmEC (int cycle, MoveNode &mn, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1)
virtual int	rmLC (int cycle, MoveNode &mn, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1)
virtual bool	canAssign (int cycle, MoveNode &mn, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1, bool ignoreGWN=false)
bool	putAlsoToPrologEpilog (int cycle, MoveNode &mn)
void	setPrologSrcFUAnno (MoveNode &prologMN, MoveNode &loopMN)
void	setPrologDstFUAnno (MoveNode &prologMN, MoveNode &loopMN)
void	setJumpGuard (MoveNode &mn)
void	unsetJumpGuard (MoveNode &mn)
bool	needJumpGuard (const MoveNode &mn, int cycle)
int	jumpGuardAvailableCycle (const MoveNode &mn)
bool	canBeSpeculated (const Operation &op)
bool	canBeSpeculated (const MoveNode &mn)
bool	usePrologMove (const MoveNode &mn)
bool	canBeScheduled (const MoveNode &mn)
const TTAMachine::RegisterFile *	RFReadPortCountPreventsScheduling (const MoveNode &mn)
bool	immCountPreventsScheduling (const MoveNode &mn)
Protected Member Functions inherited from Reversible
bool	runPreChild (Reversible *preChild)
bool	runPostChild (Reversible *preChild)
bool	runChild (std::stack< Reversible * > &children, Reversible *child)
bool	runChild (Reversible *child, bool pre)
void	undoAndRemovePreChildren ()
void	undoAndRemovePostChildren ()
void	undoAndRemoveChildren (std::stack< Reversible * > &children)
virtual void	undoOnlyMe ()
Protected Attributes inherited from BFOptimization
BF2Scheduler &	sched_
Protected Attributes inherited from Reversible
std::stack< Reversible * >	preChildren_
std::stack< Reversible * >	postChildren_
Static Protected Attributes inherited from BFOptimization
static std::map< MoveNode *, MoveNode *, MoveNode::Comparator >	prologMoves_

Detailed Description

Definition at line 47 of file BFRescheduleSuccessorsClose.hh.

Constructor & Destructor Documentation

BFRescheduleSuccessorsClose()

BFRescheduleSuccessorsClose::BFRescheduleSuccessorsClose ( BF2Scheduler &  sched, MoveNode &  mn  )

inline

Definition at line 50 of file BFRescheduleSuccessorsClose.hh.

                                           :
        BFOptimization(sched), mn_(mn) {}

Member Function Documentation

operator()()

bool BFRescheduleSuccessorsClose::operator() ( )

virtual

This performs the operation. Returns true if success, false if fail.

Implements Reversible.

Definition at line 42 of file BFRescheduleSuccessorsClose.cc.

                                             {
 
#ifdef DEBUG_BUBBLFISH_SCHEDULER
    std::cerr << "\t\t\tRescheduling successors close" << std::endl;
#endif
    bool pushed = false;
    auto succs = ddg().successors(mn_);
    for (auto i: succs) {
        if (i->isScheduled()) {
            if (ddg().earliestCycle(*i) < i->cycle()) {
                auto resched = new BFRescheduleResultClose(sched_, *i, 0);
                pushed |= runPreChild(resched);
            }
        }
    }
    return pushed;
}

References BFOptimization::ddg(), DataDependenceGraph::earliestCycle(), mn_, Reversible::runPreChild(), BFOptimization::sched_, and BoostGraph< GraphNode, GraphEdge >::successors().

Here is the call graph for this function:

Member Data Documentation

mn_

MoveNode& BFRescheduleSuccessorsClose::mn_

private

Definition at line 56 of file BFRescheduleSuccessorsClose.hh.

Referenced by operator()().

---

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

• BFRescheduleSuccessorsClose.hh
• BFRescheduleSuccessorsClose.cc