#include <BFPushAntidepDown.hh>

Inheritance diagram for BFPushAntidepDown:

Collaboration diagram for BFPushAntidepDown:

Public Member Functions
	BFPushAntidepDown (BF2Scheduler &sched, MoveNode &adepDest, int latency, int newLC)

bool	operator() ()

Public Member Functions inherited from BFRescheduleMove
	BFRescheduleMove (BF2Scheduler &sched, MoveNode &mn)

void	undoOnlyMe ()

Public Member Functions inherited from BFUnscheduleMove
	BFUnscheduleMove (BF2Scheduler &sched, MoveNode &mn)

void	unscheduleOriginal ()

void	undoOnlyMe ()

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
int	lat_

int	newLC_

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 BFUnscheduleMove
void	returnOriginal ()

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)

Protected Attributes inherited from BFRescheduleMove
std::stack< Reversible * >	midChildren_

Protected Attributes inherited from BFUnscheduleMove
MoveNode &	mn_

int	oldCycle_

const TTAMachine::Bus *	oldBus_

const TTAMachine::Bus *	prologBus_

int	oldImmWriteCycle_

int	prologImmWriteCycle_

const TTAMachine::FunctionUnit *	dstFU_

const TTAMachine::FunctionUnit *	srcFU_

const TTAMachine::ImmediateUnit *	immu_

int	immRegIndex_

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 BFUnscheduleMove
static int	recurseCounter_ = 0

Static Protected Attributes inherited from BFOptimization
static std::map< MoveNode , MoveNode , MoveNode::Comparator >	prologMoves_

Detailed Description

Definition at line 48 of file BFPushAntidepDown.hh.

Constructor & Destructor Documentation

◆ BFPushAntidepDown()

BFPushAntidepDown::BFPushAntidepDown	(	BF2Scheduler &	sched,
		MoveNode &	adepDest,
		int	latency,
		int	newLC
	)

inline

Definition at line 50 of file BFPushAntidepDown.hh.

                                                                     :
        BFRescheduleMove(sched, adepDest),
        lat_(latency), newLC_(newLC) {}

Member Function Documentation

◆ operator()()

bool BFPushAntidepDown::operator() ( )

virtual

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

Implements Reversible.

Definition at line 52 of file BFPushAntidepDown.cc.

                              {
    if (mn_.move().isControlFlowMove()) {
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
        std::cerr << "\t\t\tCannot reschedule control flow move!" << std::endl;
#endif
        return false;
    }
 
    if (&mn_ == sched_.guardWriteNode()) {
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
        std::cerr << "\t\t|TCannot reschedule guard write move!" << std::endl;
#endif
        return false;
    }
 
    unscheduleOriginal();
 
    int ddgLC = ddg().latestCycle(mn_);
    int ddgEC = ddg().earliestCycle(mn_);
 
    // first try to schedule top-down close to the optimal as possible
    int prefEc = newLC_ - lat_ +1;
    if (ddgEC > prefEc) {
        prefEc = ddgEC;
    }
 
    int ec = rmEC(prefEc, mn_);
    if (ec <= std::min(ddgLC,sched_.maximumAllowedCycle()) && ec != -1) {
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
    std::cerr << "\t\t\t\t\ttopdown resched: " << ec << std::endl;
#endif
    assign(ec, mn_);
    return true;
    } else {
    // topdown failed, bottom-up then be it
    int lc = rmLC(
        (std::min(ddgLC, sched_.maximumAllowedCycle())),mn_);
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
    std::cerr << "\t\t\t\tbottomup resched ddglc: " << ddgLC << " latest_: "
              << sched_.maximumAllowedCycle() << " lc: " << lc << std::endl;
#endif
    if (lc < ddgEC || lc == oldCycle_) {
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
        std::cerr << "\t\tPushing down antidep dest: " << mn_.toString()
                  << " failed lc: "<< lc << " ddgEC: " << ddgEC << std::endl;
        std::cerr << "\t\tPushAntidepsDown seting to old bus: "
                  << mn_.toString() << " to bus "
                  << oldBus_->name() << std::endl;
#endif
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
        assert(canAssign(oldCycle_, mn_, oldBus_, NULL, NULL, prologBus_));
#endif
        assign(oldCycle_, mn_, oldBus_, NULL, NULL, prologBus_,
               oldImmWriteCycle_, prologImmWriteCycle_);
        return false;
    }
    assert(lc != -1);
    assign(lc, mn_);
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
    std::cerr << "\t\tPushed antidep down: " << mn_.toString() << " bus: "
              << mn_.move().bus().name() << std::endl;
#endif
    return true;
    }
    return false;
}

References assert, BFOptimization::assign(), TTAProgram::Move::bus(), BFOptimization::canAssign(), BFOptimization::ddg(), DataDependenceGraph::earliestCycle(), BF2Scheduler::guardWriteNode(), TTAProgram::Move::isControlFlowMove(), lat_, DataDependenceGraph::latestCycle(), BF2Scheduler::maximumAllowedCycle(), BFUnscheduleMove::mn_, MoveNode::move(), TTAMachine::Component::name(), newLC_, BFUnscheduleMove::oldBus_, BFUnscheduleMove::oldCycle_, BFUnscheduleMove::oldImmWriteCycle_, BFUnscheduleMove::prologBus_, BFUnscheduleMove::prologImmWriteCycle_, BFOptimization::rmEC(), BFOptimization::rmLC(), BFOptimization::sched_, MoveNode::toString(), and BFUnscheduleMove::unscheduleOriginal().

Here is the call graph for this function:

Member Data Documentation

◆ lat_

int BFPushAntidepDown::lat_

private

Definition at line 56 of file BFPushAntidepDown.hh.

Referenced by operator()().

◆ newLC_

int BFPushAntidepDown::newLC_

private

Definition at line 57 of file BFPushAntidepDown.hh.

Referenced by operator()().

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

Public Member Functions

Private Attributes

Additional Inherited Members