#include <BUBasicBlockScheduler.hh>

Inheritance diagram for BUBasicBlockScheduler:

Collaboration diagram for BUBasicBlockScheduler:

Classes
struct	ltstr

Public Member Functions
	BUBasicBlockScheduler (InterPassData &data, SoftwareBypasser bypasser=NULL, RegisterRenamer registerRenamer=NULL)

virtual	~BUBasicBlockScheduler ()

virtual int	handleDDG (DataDependenceGraph &ddg, SimpleResourceManager &rm, const TTAMachine::Machine &targetMachine, int minCycle=0, bool testOnly=false)

virtual int	handleLoopDDG (DataDependenceGraph &ddg, SimpleResourceManager &rm, const TTAMachine::Machine &targetMachine, int tripCount, SimpleResourceManager *prologRM=NULL, bool testOnly=false)

virtual std::string	shortDescription () const

virtual std::string	longDescription () const

virtual DataDependenceGraphBuilder &	ddgBuilder ()

Public Member Functions inherited from BasicBlockScheduler
	BasicBlockScheduler (InterPassData &data, SoftwareBypasser bypasser=NULL, RegisterRenamer renamer=NULL)

virtual	~BasicBlockScheduler ()

virtual void	printStats () const

Public Member Functions inherited from DDGPass
	DDGPass (InterPassData &data)

virtual	~DDGPass ()

Public Member Functions inherited from SchedulerPass
	SchedulerPass (InterPassData &data)

virtual	~SchedulerPass ()

InterPassData &	interPassData ()

Public Member Functions inherited from BasicBlockPass
	BasicBlockPass (InterPassData &data)

virtual	~BasicBlockPass ()

virtual void	handleBasicBlock (TTAProgram::BasicBlock &basicBlock, const TTAMachine::Machine &targetMachine, TTAProgram::InstructionReferenceManager &irm, BasicBlockNode *bbn=NULL)

virtual void	executeDDGPass (TTAProgram::BasicBlock &bb, const TTAMachine::Machine &targetMachine, TTAProgram::InstructionReferenceManager &irm, std::vector< DDGPass * > ddgPasses, BasicBlockNode *bbn=NULL)

virtual bool	executeLoopPass (TTAProgram::BasicBlock &bb, const TTAMachine::Machine &targetMachine, TTAProgram::InstructionReferenceManager &irm, std::vector< DDGPass * > ddgPasses, BasicBlockNode *bbn=NULL)

Protected Types
typedef std::set< MoveNode *, ltstr >	OrderedSet

Protected Member Functions
void	scheduleRRMove (MoveNode &moveNode)

void	scheduleOperation (MoveNodeGroup &moves, BUMoveNodeSelector &selector)

bool	scheduleOperandWrites (MoveNodeGroup &moves, int cycle)

int	scheduleResultReads (MoveNodeGroup &moves, int cycle, bool bypass=false, bool bypassLate=false)

void	scheduleMove (MoveNode &move, int cycle, bool allowPredicationandRenaming)

void	scheduleResultReadTempMoves (MoveNode &resultMove, MoveNode &resultRead, int lastUse)

void	scheduleInputOperandTempMoves (MoveNode &resultMove, MoveNode &resultRead)

void	scheduleRRTempMoves (MoveNode &regToRegMove, MoveNode &firstMove, int lastUse)

bool	scheduleOperand (MoveNode &, int cycle)

bool	tryToSwitchInputs (ProgramOperation &op)

bool	tryToOptimizeWaw (const MoveNode &moveNode)

MoveNode *	precedingTempMove (MoveNode &current)

OrderedSet	findBypassDestinations (MoveNode &node)

void	undoBypass (MoveNode &node, MoveNode *single=NULL, int originalCycle=-1)

bool	bypassNode (MoveNode &node, int &maxResultCycle)

void	finalizeSchedule (MoveNode &node, BUMoveNodeSelector &selector)

void	unscheduleAllNodes ()

void	clearRemovedNodes ()

Protected Member Functions inherited from BasicBlockScheduler
void	scheduleRRMove (MoveNode &moveNode)

void	scheduleOperation (MoveNodeGroup &moves)

int	scheduleOperandWrites (int &cycle, MoveNodeGroup &moves)

bool	scheduleResultReads (MoveNodeGroup &moves)

void	scheduleMove (MoveNode &move, int earliestCycle, bool allowPredicationAndRenaming)

void	scheduleRRTempMoves (MoveNode &regToRegMove, MoveNode &firstMove, int lastUse)

void	scheduleInputOperandTempMoves (MoveNode &operandMove, MoveNode &operandWrite)

void	unschedule (MoveNode &moveNode)

void	unscheduleAllNodes ()

void	unscheduleInputOperandTempMoves (MoveNode &operandMove)

void	scheduleResultReadTempMoves (MoveNode &resultMove, MoveNode &resultRead, int lastUse)

void	unscheduleResultReadTempMoves (MoveNode &resultMove)

void	notifyScheduled (MoveNodeGroup &moves, MoveNodeSelector &selector)

void	ddgSnapshot (DataDependenceGraph &ddg, const std::string &name, DataDependenceGraph::DumpFileFormat format, bool final, bool resetCounter=false) const

MoveNode *	succeedingTempMove (MoveNode &current)

int	getTriggerOperand (const Operation &operation, const TTAMachine::Machine &machine)

bool	tryToSwitchInputs (ProgramOperation &op)

void	handleRemovedResultMoves (std::set< std::pair< TTAProgram::Move *, int > > removedMoves)

bool	tryToOptimizeWaw (const MoveNode &moveNode)

void	tryToDelayOperands (MoveNodeGroup &moves)

Protected Member Functions inherited from BasicBlockPass
void	ddgSnapshot (DataDependenceGraph *ddg, std::string &name, DataDependenceGraph::DumpFileFormat format, bool final)

virtual DataDependenceGraph *	createDDGFromBB (TTAProgram::BasicBlock &bb, const TTAMachine::Machine &mach)

Protected Attributes
MoveNode *	jumpMove_

std::map< MoveNode , std::vector< MoveNode >, MoveNode::Comparator >	bypassDestinations_

std::map< MoveNode *, std::vector< int >, MoveNode::Comparator >	bypassDestinationsCycle_

std::map< MoveNode , std::vector< const TTAMachine::Bus >, MoveNode::Comparator >	bypassDestinationsBus_

std::set< MoveNode * >	droppedNodes_

unsigned int	endCycle_

bool	bypass_

bool	dre_

int	bypassDistance_

Protected Attributes inherited from BasicBlockScheduler
const TTAMachine::Machine *	targetMachine_
	The target machine we are scheduling the program against.

DataDependenceGraph *	ddg_
	DDG of the currently scheduled BB.

SimpleResourceManager *	rm_
	Resource Manager of the currently scheduled BB.

std::map< const MoveNode *, DataDependenceGraph::NodeSet >	scheduledTempMoves_
	Stores the MoveNodes that were scheduled as temp moves during scheduling of the operand move.

SoftwareBypasser *	softwareBypasser_
	The software bypasser to use to bypass registers when possible.

RegisterRenamer *	renamer_

int	minCycle_
	The earliest cycle to schedule moves in. Used to leave room for sched_yield() by the sched_yield() emitter.

MoveNodeSelector *	selector_

int	bypassedCount_

int	deadResults_

LLVMTCECmdLineOptions *	options_

MoveNode *	jumpNode_

int	tripCount_

Additional Inherited Members
Static Public Member Functions inherited from BasicBlockScheduler
static MoveNode *	findTrigger (const ProgramOperation &po, const TTAMachine::Machine &mach)

Static Public Member Functions inherited from BasicBlockPass
static void	copyRMToBB (SimpleResourceManager &rm, TTAProgram::BasicBlock &bb, const TTAMachine::Machine &targetMachine, TTAProgram::InstructionReferenceManager &irm, int lastCycle=-1)

Static Protected Member Functions inherited from BasicBlockScheduler
static MoveNode *	findTriggerFromUnit (const ProgramOperation &po, const TTAMachine::Unit &unit)

Detailed Description

A class that implements the functionality of a bottom up basic block scheduler.

Schedules the program one basic block at a time. Does not fill delay slots if they couldn't be filled with the basic block's contents itself (no instruction importing).

Definition at line 61 of file BUBasicBlockScheduler.hh.

Member Typedef Documentation

◆ OrderedSet

typedef std::set<MoveNode*, ltstr> BUBasicBlockScheduler::OrderedSet

protected

Definition at line 97 of file BUBasicBlockScheduler.hh.

Constructor & Destructor Documentation

◆ BUBasicBlockScheduler()

BUBasicBlockScheduler::BUBasicBlockScheduler	(	InterPassData &	data,
		SoftwareBypasser *	bypasser = `NULL`,
		RegisterRenamer *	renamer = `NULL`
	)

Constructs the basic block scheduler.

Parameters

data	Interpass data
bypasser	Helper module implementing software bypassing
delaySlotFiller	Helper module implementing jump delay slot filling
registerRenamer	Helper module implementing register renaming

Definition at line 86 of file BUBasicBlockScheduler.cc.

                              :
    BasicBlockScheduler(data, bypasser, renamer),
    endCycle_(INT_MAX), bypass_(true), dre_(true), bypassDistance_(3) {
 
    CmdLineOptions *cmdLineOptions = Application::cmdLineOptions();
    options_ = dynamic_cast<LLVMTCECmdLineOptions*>(cmdLineOptions);
    jumpMove_ = NULL;
}

References Application::cmdLineOptions(), jumpMove_, and BasicBlockScheduler::options_.

Here is the call graph for this function:

◆ ~BUBasicBlockScheduler()

BUBasicBlockScheduler::~BUBasicBlockScheduler ( )

virtual

Destructor.

Definition at line 101 of file BUBasicBlockScheduler.cc.

101 {

102}

Member Function Documentation

◆ bypassNode()

bool BUBasicBlockScheduler::bypassNode	(	MoveNode &	moveNode,
		int &	maxResultCycle
	)

protected

Tries to bypass node with all of it's successors.

Parameters

moveNode,node	which is tried to bypass
maxResultCycle,cycle	of latest of rescheduled nodes

Returns: True if all of the successors were successfully bypassed

Definition at line 1601 of file BUBasicBlockScheduler.cc.

                         {
    bool edgesCopied = false;    
    unsigned int bypassCount = 0;
    int localMaximum = 0;
    if (!bypass_)
        return false;    
    // First try to bypass all uses of the result
    unsigned int rawDestinations =
        ddg_->onlyRegisterRawDestinations(moveNode, false, false).size();
    OrderedSet destinations = 
        findBypassDestinations(moveNode);
    if (destinations.size() > 0) {
        for (OrderedSet::iterator it = destinations.begin(); 
            it != destinations.end(); it++) {
            if (!ddg_->guardsAllowBypass(moveNode, **it)) {                
                continue;
            }
            MoveNode* temp = succeedingTempMove(moveNode);                         
            if (!(*it)->isScheduled() && temp == (*it)) {
                // skip temp moves if unscheduled.
                // The temp moves of reading operand could be 
                // scheduled and bypass will try to skip those
                // but temp moves of result are there for reason
                // so bypass would only revert to original
                // status which is unschedulable.
                std::cerr << "\t\tSkipping temporary outgoing move " << 
                    (*it)->toString() << std::endl;
                continue;
            }
            assert((*it)->isScheduled());
            int originalCycle = (*it)->cycle();                                    
            int latestLimit = originalCycle + bypassDistance_;            
            int earliestLimit = originalCycle - bypassDistance_;             
            if ((*it)->isDestinationVariable() && temp == (*it)) {
                // If bypassing to temporary register
                // missing edges in DDG could cause 
                // overwrite of temporary value before it is 
                // consumed. 
                // Find previous and following reads from temp
                // register around location of original temp write.                                                                                                                                                                               
                MoveNode* lastRead =
                    ddg_->lastScheduledRegisterRead(
                        (*it)->move().destination().registerFile(),
                        (*it)->move().destination().index(),
                        originalCycle);                        
                if (lastRead != NULL) {
                    assert(lastRead->isScheduled());
                    earliestLimit = lastRead->cycle();
                }
                MoveNode *firstRead = 
                    ddg_->firstScheduledRegisterRead(
                        (*it)->move().destination().registerFile(),
                        (*it)->move().destination().index(),
                        originalCycle);                        
                if (firstRead != NULL) {
                    assert(firstRead->isScheduled());
                    latestLimit = firstRead->cycle();
                }      
            }     
                                             
#ifdef DEBUG_BYPASS                            
            ddg_->writeToDotFile("beforeUnschedule.dot");
#endif                  
            const TTAMachine::Bus* bus = &(*it)->move().bus();
            bypassDestinationsBus_[&moveNode].push_back(
                dynamic_cast<const TTAMachine::Bus*>(bus));
            unschedule(**it);
            if (!ddg_->mergeAndKeepUser(moveNode, **it)) {
                assert(!(*it)->isScheduled());
                scheduleMove(**it, originalCycle, true);
#ifdef DEBUG_BYPASS                                            
                std::cerr << "Merge fail. moveNode=" << moveNode.toString()
                << ", **it=" << (*it)->toString() << std::endl;
#endif                
                bypassDestinationsBus_[&moveNode].pop_back();
                continue;
            }
 
            if ((**it).move().source().isImmediateRegister()) {
                (**it).move().setSource(
                    static_cast<SimpleResourceManager*>(rm_)->immediateValue(moveNode)->copy());
            }
 
            bypassDestinations_[&moveNode].push_back(*it);       
            bypassDestinationsCycle_[&moveNode].push_back(
                originalCycle);            
            assert((*it)->isScheduled() == false);
            int startCycle = std::min(latestLimit, maxResultCycle);
            scheduleMove(**it, startCycle, true);
            
#ifdef DEBUG_BYPASS                        
            std::cerr << "\t\t\tCreated " << (*it)->toString()
            << " with original cycle " << originalCycle << std::endl;
#endif                        
            if (!(*it)->isScheduled() || 
                (*it)->cycle() > latestLimit ||
                (*it)->cycle() < earliestLimit ||
                (*it)->cycle() < originalCycle) {
                // Scheduling bypass failed, undo and try to 
                // schedule other possible bypasses.
                undoBypass(moveNode, *it, originalCycle);
                bypassDestinations_[&moveNode].pop_back();
                bypassDestinationsCycle_[&moveNode].pop_back();
                bypassDestinationsBus_[&moveNode].pop_back();                                                    
            } else {
                localMaximum =
                    ((*it)->cycle() > localMaximum) ?
                    (*it)->cycle() : localMaximum;                    
                if (!edgesCopied) {
                    // In case operands reads same register that
                    // result writes, removing result move after
                    // successfull bypass could lead to operand
                    // scheduled after the register it reads is 
                    // overwriten. This should prevent such situation.
                    ddg_->copyDepsOver(moveNode, true, true);
                    edgesCopied = true;
                }   
                bypassCount++;
            }
        }
    } else {
        DataDependenceGraph::NodeSet rrDestinations =
            ddg_->onlyRegisterRawDestinations(moveNode, false, false);
        if (rrDestinations.size() == 0 && 
            moveNode.isDestinationVariable() && 
            moveNode.isSourceVariable() &&
            !ddg_->resultUsed(moveNode)) {
            // move is not used at all anywhere? Lets try to drop it
            return true;
        }
    }
    if (bypassCount == rawDestinations && bypassCount != 0) {
        maxResultCycle = localMaximum;
        return true;
    } else {
        return false;
    }
}

References assert, bypass_, bypassDestinations_, bypassDestinationsBus_, bypassDestinationsCycle_, bypassDistance_, DataDependenceGraph::copyDepsOver(), MoveNode::cycle(), BasicBlockScheduler::ddg_, findBypassDestinations(), DataDependenceGraph::firstScheduledRegisterRead(), DataDependenceGraph::guardsAllowBypass(), MoveNode::isDestinationVariable(), MoveNode::isScheduled(), MoveNode::isSourceVariable(), DataDependenceGraph::lastScheduledRegisterRead(), DataDependenceGraph::mergeAndKeepUser(), DataDependenceGraph::onlyRegisterRawDestinations(), DataDependenceGraph::resultUsed(), BasicBlockScheduler::rm_, scheduleMove(), BasicBlockScheduler::succeedingTempMove(), MoveNode::toString(), undoBypass(), BasicBlockScheduler::unschedule(), and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Referenced by handleDDG(), handleLoopDDG(), scheduleResultReads(), scheduleResultReadTempMoves(), and scheduleRRTempMoves().

Here is the call graph for this function:

◆ clearRemovedNodes()

void BUBasicBlockScheduler::clearRemovedNodes ( )

protected

Finaly, remove moves that were dropped during dead result move elimination also from the parent of the given subgraph DDG.

Definition at line 1873 of file BUBasicBlockScheduler.cc.

                                         {
 
    for (std::set<MoveNode*>::iterator i = droppedNodes_.begin(); 
        i != droppedNodes_.end(); i++) {
        MoveNode& node = **i;
        if (ddg_->rootGraph() != ddg_ && !node.isScheduled()) {            
            ddg_->rootGraph()->removeNode(node);
            if (MapTools::containsKey(bypassDestinations_, &node)) {
                bypassDestinations_.erase(&node);
                bypassDestinationsCycle_.erase(&node);
                bypassDestinationsBus_.erase(&node);
            }
        }
    }
    droppedNodes_.clear();
}

References bypassDestinations_, bypassDestinationsBus_, bypassDestinationsCycle_, MapTools::containsKey(), BasicBlockScheduler::ddg_, droppedNodes_, MoveNode::isScheduled(), BoostGraph< GraphNode, GraphEdge >::removeNode(), and BoostGraph< GraphNode, GraphEdge >::rootGraph().

Referenced by handleDDG(), and handleLoopDDG().

Here is the call graph for this function:

◆ ddgBuilder()

virtual DataDependenceGraphBuilder & BasicBlockPass::ddgBuilder ( )

inlinevirtual

Reimplemented from BasicBlockScheduler.

Definition at line 86 of file BasicBlockPass.hh.

86{ return ddgBuilder_; }

BasicBlockPass::ddgBuilder_

DataDependenceGraphBuilder ddgBuilder_

Definition BasicBlockPass.hh:100

◆ finalizeSchedule()

void BUBasicBlockScheduler::finalizeSchedule	(	MoveNode &	node,
		BUMoveNodeSelector &	selector
	)

protected

Definition at line 1743 of file BUBasicBlockScheduler.cc.

                                                  {
    if (node.isScheduled()) {                                    
        selector.notifyScheduled(node);
        std::map<const MoveNode*, DataDependenceGraph::NodeSet >::
            iterator tmIter = scheduledTempMoves_.find(&node);
        if (tmIter != scheduledTempMoves_.end()) {
            DataDependenceGraph::NodeSet& tempMoves = tmIter->second;
            for (DataDependenceGraph::NodeSet::iterator i =
                tempMoves.begin(); i != tempMoves.end(); i++) {
                selector.notifyScheduled(**i);
            }
        }                      
    } else if (MapTools::containsKey(bypassDestinations_, &node) && dre_) {
      
#ifdef DEBUG_BYPASS
        std::cerr << "\tDroping node " << node.toString() << std::endl;
        ddg_->writeToDotFile("before_copyDeps.dot");
#endif                
        static_cast<DataDependenceGraph*>(ddg_->rootGraph())->
            copyDepsOver(node, true, true); 
        DataDependenceGraph::NodeSet preds = ddg_->predecessors(node); 
        ddg_->dropNode(node);
        droppedNodes_.insert(&node);
#ifdef DEBUG_BYPASS
        ddg_->writeToDotFile("after_dropNode.dot");
#endif                
          
        for (DataDependenceGraph::NodeSet::iterator i = 
            preds.begin(); i != preds.end(); i++) {
            selector.mightBeReady(**i);
        }          
        std::map<const MoveNode*, DataDependenceGraph::NodeSet >::
            iterator tmIter = scheduledTempMoves_.find(&node);
        if (tmIter != scheduledTempMoves_.end()) {
            DataDependenceGraph::NodeSet& tempMoves = tmIter->second;
            for (DataDependenceGraph::NodeSet::iterator i =
                tempMoves.begin(); i != tempMoves.end(); i++) {
                if ((*i)->isScheduled()) {
                    selector.notifyScheduled(**i);
                } else {
#ifdef DEBUG_BYPASS
                    std::cerr << "\tDroping temp move for node " 
                        << node.toString() << ", " << (*i)->toString() 
                        << std::endl;
                    ddg_->writeToDotFile("before_temp_copyDeps.dot");
#endif                                  
                    static_cast<DataDependenceGraph*>(ddg_->rootGraph())->
                        copyDepsOver(**i, true, true);                   
                    ddg_->dropNode(**i);
                    droppedNodes_.insert(*i);
#ifdef DEBUG_BYPASS
                    ddg_->writeToDotFile("after_temp_dropNode.dot");
#endif                                      
                }    
            }
        }                
    } else if (node.move().source().equals(node.move().destination()) ||
            (node.isSourceVariable() 
            && node.isDestinationVariable() 
            && !ddg_->resultUsed(node))) {
        
        // we lost edges so our notifyScheduled does not notify
        // some antidependencies. store them for notification.
                        
        DataDependenceGraph::NodeSet predecessors =
            ddg_->predecessors(node);          
        predecessors.erase(&node); // if WaW to itself, rremove it.
    
        assert(node.isScheduled() == false);
    
        // this may lead to extra raw edges.
        static_cast<DataDependenceGraph*>(ddg_->rootGraph())->
            copyDepsOver(node, true, true);
    
        ddg_->dropNode(node);
        droppedNodes_.insert(&node);
        // we lost edges so our notifyScheduled does not notify
        // some antidependencies. notify them.
        for (DataDependenceGraph::NodeSet::iterator iter =
            predecessors.begin();
            iter != predecessors.end(); iter++) {
            selector.mightBeReady(**iter);
        }
        
    } else {
        TCEString msg = "Node " + node.toString() + " did not get scheduled";
        ddg_->writeToDotFile("after_dropNode.dot");     
        throw InvalidData(
        __FILE__, __LINE__, __func__, msg);
    }      
}

References __func__, assert, bypassDestinations_, MapTools::containsKey(), BasicBlockScheduler::ddg_, TTAProgram::Move::destination(), dre_, BoostGraph< GraphNode, GraphEdge >::dropNode(), droppedNodes_, TTAProgram::Terminal::equals(), MoveNode::isDestinationVariable(), MoveNode::isScheduled(), MoveNode::isSourceVariable(), BUMoveNodeSelector::mightBeReady(), MoveNode::move(), BUMoveNodeSelector::notifyScheduled(), BoostGraph< GraphNode, GraphEdge >::predecessors(), DataDependenceGraph::resultUsed(), BoostGraph< GraphNode, GraphEdge >::rootGraph(), BasicBlockScheduler::scheduledTempMoves_, TTAProgram::Move::source(), MoveNode::toString(), and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Referenced by handleDDG(), handleLoopDDG(), scheduleOperation(), scheduleResultReadTempMoves(), and scheduleRRTempMoves().

Here is the call graph for this function:

◆ findBypassDestinations()

BUBasicBlockScheduler::OrderedSet BUBasicBlockScheduler::findBypassDestinations ( MoveNode & node )

protected

Finds a destination where to bypass.

Goes through ddg and checks for connectivity.

Returns: pair of destination of bypass and amount of regs skipped by the bypass.

Definition at line 1487 of file BUBasicBlockScheduler.cc.

                                                            {
    
    OrderedSet okDestination;    
    // DDG can only handle single hops so far.
    // TODO: Fix when DDG could handle multiple destinations
    DataDependenceGraph::NodeSet rrDestinations =
        ddg_->onlyRegisterRawDestinations(node, false, false);
    for (DataDependenceGraph::NodeSet::iterator j = 
             rrDestinations.begin(); j != rrDestinations.end(); j++) {
        MoveNode* n = *j;
        if (ddg_->onlyRegisterRawSource(*n) == NULL) {
            // No bypassing of moves with multiple register definition
            // sources.
            // TODO: bypass destination with multiple definition sources
            // using inverse guard of guarded source.
            continue;
        }
        MachineConnectivityCheck::PortSet destinationPorts;            
        destinationPorts.insert(&n->move().destination().port());
        
        if (MachineConnectivityCheck::canSourceWriteToAnyDestinationPort(
             node, destinationPorts)) {
            if (n->isScheduled() == false 
                && rm_->initiationInterval() != 0) {
                // Found node connected by loop edge, ignore it.
                ddg_->writeToDotFile("failing_test.dot");
                continue;
            }
            okDestination.insert(n);                
        }    
        destinationPorts.clear();
    }
    return okDestination;
}

References MachineConnectivityCheck::canSourceWriteToAnyDestinationPort(), BasicBlockScheduler::ddg_, TTAProgram::Move::destination(), SimpleResourceManager::initiationInterval(), MoveNode::isScheduled(), MoveNode::move(), DataDependenceGraph::onlyRegisterRawDestinations(), DataDependenceGraph::onlyRegisterRawSource(), TTAProgram::Terminal::port(), BasicBlockScheduler::rm_, and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Referenced by bypassNode().

Here is the call graph for this function:

◆ handleDDG()

int BUBasicBlockScheduler::handleDDG	(	DataDependenceGraph &	ddg,
		SimpleResourceManager &	rm,
		const TTAMachine::Machine &	targetMachine,
		int	minCycle = `0`,
		bool	test = `false`
	)

virtual

Schedules a piece of code in a DDG

Parameters

ddg	The ddg containing the code
rm	Resource manager that is to be used.
targetMachine	The target machine.

Exceptions

Exception several TCE exceptions can be thrown in case of a scheduling error.

Reimplemented from BasicBlockScheduler.

Definition at line 113 of file BUBasicBlockScheduler.cc.

                                                              {
    ddg_ = &ddg;
    targetMachine_ = &targetMachine;
 
    if (renamer_ != NULL) {
        renamer_->initialize(ddg);
    }
 
    if (options_ != NULL && options_->dumpDDGsDot()) {
        ddgSnapshot(
            ddg, std::string("0"), DataDependenceGraph::DUMP_DOT, false);
    }
 
    if (options_ != NULL && options_->dumpDDGsXML()) {
        ddgSnapshot(
            ddg, std::string("0"), DataDependenceGraph::DUMP_XML, false);
    }
 
    if (options_ != NULL && options_->bypassDistance() > -1) {
        bypassDistance_ = options_->bypassDistance();        
    } 
    
    if (options_ != NULL && options_->bypassDistance() == 0) {
        bypass_ = false;
    }     
    
    if (options_ != NULL && !options_->killDeadResults()) {
        dre_ = false;
    }
    
    // empty need not to be scheduled
    if (ddg.nodeCount() == 0 ||
        (ddg.nodeCount() == 1 && !ddg.node(0).isMove())) {
        return 0;
    }
 
    // INT_MAX/2 won't work on trunk due to multithreading injecting empty
    // instructions into the beginning of basic block.    
    endCycle_ = INT_MAX/1000;
 
    // scheduling pipeline resources after last cycle may cause problems.
    // make RM to check for those
    rm.setMaxCycle(endCycle_);
 
    BUMoveNodeSelector selector(ddg, targetMachine);
    selector_ = &selector;
    // register selector to renamer for notfications.
    if (renamer_ != NULL) {
        renamer_->setSelector(&selector);
    }
 
    rm_ = &rm;
 
    MoveNodeGroup moves = selector.candidates();
    while (moves.nodeCount() > 0) {
        bool movesRemoved = false;
        MoveNode& firstMove = moves.node(0);
        if (firstMove.isOperationMove()) {
            scheduleOperation(moves, selector);
            movesRemoved = true;
        } else {
            if (firstMove.move().destination().isRA()) {
                scheduleMove(firstMove, endCycle_, true);
                finalizeSchedule(firstMove, selector);                
            } else {
                int tmp = endCycle_;
                if (bypassNode(firstMove,tmp) && dre_ 
                    &&!ddg_->resultUsed(firstMove)) {
                    // No need to schedule original move any more
                    movesRemoved = true;
                } else {
                    // schedule original move
                    scheduleRRMove(firstMove);
                    // If move was register copy to self, it could have been
                    // just dropped.
                    movesRemoved = true;                    
                    if (!firstMove.isScheduled()) {
                        undoBypass(firstMove);
                        scheduleRRMove(firstMove);
                    }
                }
                if (bypass_) {
                    bypassNode(firstMove, tmp);
                }
                finalizeSchedule(firstMove, selector);    
            }
        }
        if (!movesRemoved) {
            if (!moves.isScheduled()) {
                std::string message = " Move(s) did not get scheduled: ";
                for (int i = 0; i < moves.nodeCount(); i++) {
                    message += moves.node(i).toString() + " ";
                }
                ddg.writeToDotFile("failed_bb.dot");
                throw ModuleRunTimeError(__FILE__,__LINE__,__func__, message);
            }
        }
        moves = selector.candidates();
        if (!test)
            clearRemovedNodes();                
    }
 
    if (ddg.nodeCount() != ddg.scheduledNodeCount()) {
        debugLog("All moves in the DDG didn't get scheduled.");
        ddg.writeToDotFile("failed_bb.dot");
        abortWithError("Should not happen!");
    }
 
    if (options_ != NULL && options_->dumpDDGsDot()) {
        std::string wtf = "0";
        ddgSnapshot(
            ddg, wtf, DataDependenceGraph::DUMP_DOT, true);
    }
 
    if (options_ != NULL && options_->dumpDDGsXML()) {
        ddgSnapshot(
            ddg, std::string("0"), DataDependenceGraph::DUMP_XML, true);
    }
    if (rm_->largestCycle() > (int)endCycle_) {
        ddg.writeToDotFile("largest_bigger_than_endcycle.dot");
        std::cerr << "rm largest cycle bigger than endCycle_!" <<
            std::endl << "This may break delay slot filler!" <<
            std::endl << " rm largest: " << rm_->largestCycle() <<
            " end cycle: " << endCycle_ << std::endl;
        
        abortWithError("Should not happen!");
    }
    int size = rm_->largestCycle() - rm_->smallestCycle();    
    if (test) {
        unscheduleAllNodes();
    }
    return size;
}

References __func__, abortWithError, bypass_, SchedulerCmdLineOptions::bypassDistance(), bypassDistance_, bypassNode(), BUMoveNodeSelector::candidates(), clearRemovedNodes(), BasicBlockScheduler::ddg_, BasicBlockScheduler::ddgSnapshot(), debugLog, TTAProgram::Move::destination(), dre_, DataDependenceGraph::DUMP_DOT, DataDependenceGraph::DUMP_XML, LLVMTCECmdLineOptions::dumpDDGsDot(), LLVMTCECmdLineOptions::dumpDDGsXML(), endCycle_, finalizeSchedule(), RegisterRenamer::initialize(), MoveNode::isMove(), MoveNode::isOperationMove(), TTAProgram::Terminal::isRA(), MoveNodeGroup::isScheduled(), MoveNode::isScheduled(), SchedulerCmdLineOptions::killDeadResults(), SimpleResourceManager::largestCycle(), MoveNode::move(), BoostGraph< GraphNode, GraphEdge >::node(), MoveNodeGroup::node(), MoveNodeGroup::nodeCount(), BoostGraph< GraphNode, GraphEdge >::nodeCount(), BasicBlockScheduler::options_, BasicBlockScheduler::renamer_, DataDependenceGraph::resultUsed(), BasicBlockScheduler::rm_, DataDependenceGraph::scheduledNodeCount(), scheduleMove(), scheduleOperation(), scheduleRRMove(), BasicBlockScheduler::selector_, SimpleResourceManager::setMaxCycle(), RegisterRenamer::setSelector(), SimpleResourceManager::smallestCycle(), BasicBlockScheduler::targetMachine_, MoveNode::toString(), undoBypass(), unscheduleAllNodes(), and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Here is the call graph for this function:

◆ handleLoopDDG()

int BUBasicBlockScheduler::handleLoopDDG	(	DataDependenceGraph &	ddg,
		SimpleResourceManager &	rm,
		const TTAMachine::Machine &	targetMachine,
		int	tripCount,
		SimpleResourceManager *	prologRM = `NULL`,
		bool	testOnly = `false`
	)

virtual

Schedules loop in a DDG

Parameters

ddg	The ddg containing the loop
rm	Resource manager that is to be used.
targetMachine	The target machine.

Exceptions

Exception several TCE exceptions can be thrown in case of a scheduling error.

Returns: negative if failed, else overlapcount.

Reimplemented from BasicBlockScheduler.

Definition at line 260 of file BUBasicBlockScheduler.cc.

                                           {
    tripCount_ = tripCount;
    ddg_ = &ddg;
    targetMachine_ = &targetMachine;
    minCycle_ = 0;
 
    if (renamer_ != NULL) {
        renamer_->initialize(ddg);
    }
 
    if (options_ != NULL && options_->dumpDDGsDot()) {
        ddgSnapshot(
            ddg, std::string("0"), DataDependenceGraph::DUMP_DOT, false, true);
    }
 
    if (options_ != NULL && options_->dumpDDGsXML()) {
        ddgSnapshot(
            ddg, std::string("0"), DataDependenceGraph::DUMP_XML, false, true);
    }
 
    if (options_ != NULL && options_->bypassDistance() > -1) {
        bypassDistance_ = options_->bypassDistance();        
    } 
    
    if (options_ != NULL && options_->bypassDistance() == 0) {
        bypass_ = false;
    }     
    
    if (options_ != NULL && !options_->killDeadResults()) {
        dre_ = false;
    }
    
    scheduledTempMoves_.clear();
 
    // empty DDGs can be ignored
    if (ddg.nodeCount() == 0 ||
        (ddg.nodeCount() == 1 && !ddg.node(0).isMove())) {        
        return 0;
    }
    endCycle_ = 2 * rm.initiationInterval() - 1;
    BUMoveNodeSelector selector(ddg, targetMachine);
 
    rm_ = &rm;
 
    if (renamer_ != NULL) {
        renamer_->setSelector(&selector);
    }
    MoveNodeGroup moves = selector.candidates();
    while (moves.nodeCount() > 0) {
        bool movesRemoved = false;
        MoveNode& firstMove = moves.node(0);
        if (firstMove.isOperationMove()) {
            scheduleOperation(moves, selector);
            movesRemoved = true;
        } else {
            if (firstMove.move().destination().isRA()) {
                scheduleMove(firstMove, endCycle_, true);
                notifyScheduled(moves, selector);
            } else {
                int tmp = endCycle_;
                if (bypassNode(firstMove,tmp) && dre_ 
                    &&!ddg_->resultUsed(firstMove)) {
                    // No need to schedule original move any more
                    movesRemoved = true;
                } else {
                    // schedule original move
                    scheduleRRMove(firstMove);
                    // If move was register copy to self, it could have been
                    // just dropped.
                    movesRemoved = true;                    
                }          
                if (bypass_) {
                    bypassNode(firstMove, tmp);
                }
                finalizeSchedule(firstMove, selector);                    
            }
        }
 
        if (!movesRemoved && !moves.isScheduled()) {
            ddg_->writeToDotFile(
                std::string("ii_") + 
                Conversion::toString(rm.initiationInterval()) + 
                std::string("_dag.dot"));
 
            unscheduleAllNodes();
            return -1;
        }
 
        moves = selector.candidates();
    }
    
    if (ddg.nodeCount() !=
        ddg.scheduledNodeCount()) {
        debugLog("All moves in the DDG didn't get scheduled.");
//        debugLog("Disassembly of the situation:");
//        Application::logStream() << bb.disassemble() << std::endl;
        ddg.writeToDotFile("failed_bb.dot");
        abortWithError("Should not happen!");
    }
 
    // loop scheduling did not help
    if (static_cast<unsigned>(ddg.largestCycle() - ddg.smallestCycle()) < rm.initiationInterval()
        || testOnly) {
        if (static_cast<unsigned>(ddg.largestCycle() - ddg.smallestCycle()) < 
            rm.initiationInterval()) {
            Application::logStream() 
                << "No overlapping instructions." 
                << "Should Revert to ordinary scheduler."
                << " ii = " << rm.initiationInterval() 
                << " size = " << ddg.largestCycle() - ddg.smallestCycle()
                << std::endl;
        } 
        // this have to be calculated before unscheduling.
        int rv = (ddg.largestCycle() - ddg.smallestCycle()) / rm.initiationInterval();
        unscheduleAllNodes();
        return rv;
    }
 
    // test that ext-cond jump not in prolog (where it is skipped)
    int overlap_count = (ddg.largestCycle() - ddg.smallestCycle()) / rm.initiationInterval();
    if (overlap_count >= tripCount) {
        unscheduleAllNodes();
        return -1;
    }
    
    if (options_ != NULL && options_->dumpDDGsDot()) {
        ddgSnapshot(ddg, std::string("0"), DataDependenceGraph::DUMP_DOT, true);
    }
 
    if (options_ != NULL && options_->dumpDDGsXML()) {
        ddgSnapshot(ddg, std::string("0"), DataDependenceGraph::DUMP_XML, true);
    }
    
    if (jumpMove_ != NULL) {
        MoveNode* jumpLimit = ddg_->findLoopLimitAndIndex(*jumpMove_).first;
        if (jumpLimit != NULL) {
            int jumpOverlapCount = (endCycle_ - rm.smallestCycle()) 
                / rm.initiationInterval();
            TTAProgram::TerminalImmediate& ti = dynamic_cast<
        TTAProgram::TerminalImmediate&>(jumpLimit->move().source());
            int jumpLimitValue = ti.value().unsignedValue();
            int loopCounterStep = 1;
            if (jumpLimitValue != tripCount_) {
                if (jumpLimitValue == 2 * tripCount_) {
                    loopCounterStep = 2;
                } else {
                    if (jumpLimitValue == 4 * tripCount_) {
                        loopCounterStep = 4;
                    } else {
                        // don't know how much to decr. counter.
                        unscheduleAllNodes();
                        return -1;
                    }
                }
            }
            if (tripCount_ > jumpOverlapCount) {
                jumpLimit->move().setSource(
                    new TTAProgram::TerminalImmediate(
                        SimValue(
                            jumpLimitValue - 
                            (jumpOverlapCount * loopCounterStep), 
                            ti.value().width())));
            } else {
                // loop limit is too short. 
                // would be always executed too many times.
                jumpLimit->move().setSource(
                    new TTAProgram::TerminalImmediate(SimValue(jumpLimitValue)));                
                unscheduleAllNodes();
                return -1;
            }
            
        }
    }
    clearRemovedNodes();
    return (ddg.largestCycle() - ddg.smallestCycle()) / rm.initiationInterval();
}

Here is the call graph for this function:

◆ longDescription()

std::string BUBasicBlockScheduler::longDescription ( ) const

virtual

Optional longer description of the pass.

This description can include usage instructions, details of choice of algorithmic details, etc.

Returns: The description as a string.

Reimplemented from BasicBlockScheduler.

Definition at line 1209 of file BUBasicBlockScheduler.cc.

                                             {
    return
        "Bottom-up list basic block scheduler that uses the longest path "
        "information of data dependency graph to prioritize the ready list."
        "Assumes that the input has registers allocated and no connectivity "
        "missing.";
}

◆ precedingTempMove()

MoveNode * BUBasicBlockScheduler::precedingTempMove ( MoveNode & current )

protected

Finds the temp move preceding the given movenode.

If it does not have one, returns null.

Parameters

current MoveNode whose tempmoves we are searching

Returns: tempMove preceding given node, or null if does not exist.

Definition at line 1424 of file BUBasicBlockScheduler.cc.

                                                          {
 
    DataDependenceGraph::NodeSet pred = ddg_->predecessors(current);
    MoveNode* result = NULL;
    for (DataDependenceGraph::NodeSet::iterator i = pred.begin();
         i != pred.end(); ++i) {
        MoveNode& m = **i;
        if (m.isScheduled() ||
            !m.move().hasAnnotations(
                TTAProgram::ProgramAnnotation::ANN_CONNECTIVITY_MOVE))
            continue;
 
        assert(result == NULL &&
               "Multiple candidates for the temp move of result read.");
        result = &m;
    }
    return result;
}

References TTAProgram::ProgramAnnotation::ANN_CONNECTIVITY_MOVE, assert, BasicBlockScheduler::ddg_, TTAProgram::AnnotatedInstructionElement::hasAnnotations(), MoveNode::isScheduled(), MoveNode::move(), and BoostGraph< GraphNode, GraphEdge >::predecessors().

Referenced by scheduleOperand().

Here is the call graph for this function:

◆ scheduleInputOperandTempMoves()

void BUBasicBlockScheduler::scheduleInputOperandTempMoves	(	MoveNode &	operandMove,
		MoveNode &	operandWrite
	)

protected

Schedules the (possible) temporary register copy moves (due to missing connectivity) preceeding the given input move.

The function recursively goes through all the temporary moves added to the given input move.

Parameters

operandMove	A temp move whose predecessor has to be scheduled.
operandWrite	The original move of which temp moves to schedule.

Definition at line 1289 of file BUBasicBlockScheduler.cc.

                                                   {
    /* Because temporary register moves do not have WaR dependency edges
       between the other possible uses of the same temp register in
       the same operation, we have to limit the scheduling of the new
       temp reg move to the last use of the same temp register so
       we don't overwrite the temp registers of other operands. */
    int lastUse = endCycle_;
 
    // find all unscheduled preceeding temp moves of the operand move
    DataDependenceGraph::EdgeSet inEdges = ddg_->inEdges(operandMove);
    MoveNode* tempMove = NULL;
    for (DataDependenceGraph::EdgeSet::iterator i = inEdges.begin();
         i != inEdges.end(); ++i) {
 
        if ((**i).edgeReason() != DataDependenceEdge::EDGE_REGISTER ||
            (**i).guardUse() ||
            (**i).dependenceType() != DataDependenceEdge::DEP_RAW) {
            continue;
        }
 
        MoveNode& m = ddg_->tailNode(**i);
        if (m.isScheduled() ||
            !m.move().hasAnnotations(
                TTAProgram::ProgramAnnotation::ANN_CONNECTIVITY_MOVE)) {
            continue;
        }
 
        assert(tempMove == NULL &&
               "Multiple unscheduled moves for the operand move, should have "
               "max. one (the temporary move)!");
        tempMove = &m;
        // First cycle where temporary register will be read, this should
        // be actuall operand move cycle!
        MoveNode* firstRead =
            ddg_->firstScheduledRegisterRead(
                tempMove->move().destination().registerFile(),
                tempMove->move().destination().index());
        if (firstRead != NULL) {
            assert(firstRead->isScheduled());
            lastUse = firstRead->cycle();
            if (operandMove.isScheduled() && lastUse != operandMove.cycle()) {
                Application::logStream() << "\tFirst register read problem "
                << operandMove.toString() << " temp " << firstRead->toString()
                << std::endl;
            }
        }
    }
 
    if (tempMove == NULL)
        return; // no temp moves found
 
    scheduleMove(*tempMove, lastUse - 1, true);
    if (!tempMove->isScheduled()) {
        std::cerr << "temp move: " << tempMove->toString()
                  << "not scheduled."
                  << std::endl;
        ddg_->writeToDotFile("failTempNotSched.dot");
    }
    assert(tempMove->isScheduled());
    scheduledTempMoves_[&operandWrite].insert(tempMove);
    scheduleInputOperandTempMoves(*tempMove, operandWrite);
}

References TTAProgram::ProgramAnnotation::ANN_CONNECTIVITY_MOVE, assert, MoveNode::cycle(), BasicBlockScheduler::ddg_, DataDependenceEdge::DEP_RAW, TTAProgram::Move::destination(), DataDependenceEdge::EDGE_REGISTER, endCycle_, DataDependenceGraph::firstScheduledRegisterRead(), TTAProgram::AnnotatedInstructionElement::hasAnnotations(), TTAProgram::Terminal::index(), BoostGraph< GraphNode, GraphEdge >::inEdges(), MoveNode::isScheduled(), Application::logStream(), MoveNode::move(), TTAProgram::Terminal::registerFile(), BasicBlockScheduler::scheduledTempMoves_, scheduleInputOperandTempMoves(), scheduleMove(), BoostGraph< GraphNode, GraphEdge >::tailNode(), MoveNode::toString(), and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Referenced by scheduleInputOperandTempMoves(), and scheduleOperand().

Here is the call graph for this function:

◆ scheduleMove()

void BUBasicBlockScheduler::scheduleMove	(	MoveNode &	moveNode,
		int	latestCycle,
		bool	allowPredicationAndRenaming
	)

protected

Schedules a single move to the earliest possible cycle, taking in account the DDG, resource constraints, and latencies in producing source values.

This method assumes the move is possible to schedule with regards to connectivity and resources. Short immediates are converted to long immediates when needed.

Parameters

move	The move to schedule.
earliestCycle	The earliest cycle to try.

Definition at line 959 of file BUBasicBlockScheduler.cc.

                                                                           {
    if (moveNode.isScheduled()) {
        ddg_->writeToDotFile("already_sched.dot");
        throw InvalidData(
            __FILE__, __LINE__, __func__,
            (boost::format("Move '%s' is already scheduled!")
            % moveNode.toString()).str());
    }
    int ii = rm_->initiationInterval();
    int ddgCycle = endCycle_;
    if (moveNode.move().isControlFlowMove()) {
        ddgCycle = endCycle_ - targetMachine_->controlUnit()->delaySlots();
        if (ddg_->latestCycle(moveNode, ii) < ddgCycle) {
                // Trying to schedule CFG move but data dependence does not
                // allow it to schedule in correct place
                throw InvalidData(
                    __FILE__, __LINE__, __func__,
                    (boost::format("Move '%s' needs to be scheduled in %d,"
                    " but data dependence does not allow it!")
                    % moveNode.toString() % ddgCycle).str());
        }
        jumpMove_ = &moveNode;
    } else { // not a control flow move:
        ddgCycle = ddg_->latestCycle(moveNode, ii);
        if (renamer_ != NULL && allowPredicationAndRenaming) {
            int latestFromTrigger =
                (moveNode.isDestinationOperation()) ?
                    moveNode.latestTriggerWriteCycle() : latestCycle;
            int minRenamedEC = std::min(
                latestFromTrigger, ddg_->latestCycle(
                    moveNode, ii, true)); // TODO: 0 or INT_MAX
 
            // rename if can and may alow scheuduling later.
            if (minRenamedEC > ddgCycle) {
                minRenamedEC =  rm_->latestCycle(minRenamedEC, moveNode);
                if (minRenamedEC > ddgCycle) {
                    if (renamer_->renameSourceRegister(
                            moveNode, ii != 0, true, true, minRenamedEC)) {
                        ddgCycle = ddg_->latestCycle(moveNode, ii);
                    }
#ifdef THIS_IS_BUGGY_WITH_REGCOPY_ADDER
                    else {
                        MoveNode *limitingAdep =
                            ddg_->findLimitingAntidependenceDestination(
                                moveNode);
                        if (limitingAdep != NULL) {
                            // don't try to rename is same operation.
                            // as it would not help at all.
                            if (!moveNode.isDestinationOperation() ||
                                !limitingAdep->isSourceOperation() ||
                                &moveNode.destinationOperation() !=
                                &limitingAdep->sourceOperation()) {
                                if (renamer_->renameDestinationRegister(
                                        *limitingAdep, false, true, true)) {
                                    ddgCycle =
                                        ddg_->latestCycle(moveNode, ii);
                                }
                            }
                        }
                    }
#endif
                }
            }
        }
    }
    // if it's a conditional move then we have to be sure that the guard
    // is defined before executing the move.
    // this is already handled by DDGs earliestCycle, except cases
    // where the guard is defined in a previous BB. 
    // So this prevents scheduling unconditional moves at the beginning
    // of a BB.
    
    if (!moveNode.move().isUnconditional()) {
 
        if (allowPredicationAndRenaming) {
            // try to get rid of the guard if it gives earlier earliestcycle.
            if (ddg_->latestCycle(moveNode, ii, false, true, true) 
                > ddgCycle) {
                bool guardNeeded = false;
                if (moveNode.move().destination().isGPR() || 
                    moveNode.move().isControlFlowMove()) {
                    guardNeeded = true;
                } else {
                    // this would be needed only for trigger,
                    // but trigger may change during scheduling.
                    // so lets just limit all operands, it seems 
                    // this does not make the schedule any worse.
                    if (moveNode.isDestinationOperation()) {
                        const Operation& o = 
                            moveNode.destinationOperation().operation();
                        if (o.writesMemory() || o.hasSideEffects() ||
                            o.affectsCount() != 0) {
                            guardNeeded = true;
                        }
                    }
                }
                if (!guardNeeded) {
                    moveNode.move().setGuard(NULL);
                    ddg_->removeIncomingGuardEdges(moveNode);
                    ddgCycle = ddg_->latestCycle(moveNode, ii);
                    assert(moveNode.move().isUnconditional());
                }
            }
            
            if (ii == 0 && tryToOptimizeWaw(moveNode)) {
                ddgCycle = std::max(ddg_->latestCycle(moveNode, ii),
                                    moveNode.guardLatency()-1);
            }
 
        }
    }
    
    ddgCycle = (ddgCycle == INT_MAX) ? endCycle_ : ddgCycle;
    assert(ddgCycle != -1);
    // Earliest cycle from which to start, could depend on result ready
    // for result moves.
    int minCycle = std::min(latestCycle, ddgCycle);
    if (moveNode.isSourceConstant() &&
        !moveNode.move().hasAnnotations(
            TTAProgram::ProgramAnnotation::ANN_REQUIRES_LIMM)) {
        // If source is constant and node does not have annotation already,
        // we add it if constant can not be transported so IU broker and
        // OutputPSocket brokers will add Immediate
        // Example : 999999 -> integer0.2
        if (!rm_->canTransportImmediate(moveNode)){
            TTAProgram::ProgramAnnotation annotation(
                TTAProgram::ProgramAnnotation::ANN_REQUIRES_LIMM);
            moveNode.move().setAnnotation(annotation);
 
        } else if (!moveNode.isDestinationOperation() &&
                   rm_->latestCycle(endCycle_, moveNode) == -1 && ii == 0) {
            // If source is constant and node does not have annotation already,
            // we add it if node has no connection, so IU broker and
            // OutputPSocket brokers will add Immediate
            // Example: 27 -> integer0.2
            // With bus capable of transporting 27 as short immediate but
            // no connection from that bus to integer0 unit
            TTAProgram::ProgramAnnotation annotation(
                TTAProgram::ProgramAnnotation::ANN_REQUIRES_LIMM);
            moveNode.move().setAnnotation(annotation);
        }
    }
    // annotate the return move otherwise it might get undetected in the
    // simulator after the short to long immediate conversion and thus
    // stopping simulation automatically might not work
    if (moveNode.isSourceConstant() &&
        moveNode.move().isReturn() &&
        !rm_->canTransportImmediate(moveNode)) {
        TTAProgram::ProgramAnnotation annotation(
            TTAProgram::ProgramAnnotation::ANN_STACKFRAME_PROCEDURE_RETURN);
        moveNode.move().setAnnotation(annotation);
    }
    int earliestDDG = ddg_->earliestCycle(moveNode, ii);
    minCycle = rm_->latestCycle(minCycle, moveNode);
    if (minCycle < earliestDDG) {
        // Bypassed move could get scheduld too early, this should prevent it
        return ;
    }
    if (minCycle == -1 || minCycle == INT_MAX) {
        if (moveNode.isSourceConstant() &&
            !moveNode.isDestinationOperation() &&
            moveNode.move().hasAnnotations(
                TTAProgram::ProgramAnnotation::ANN_REQUIRES_LIMM)) {
            // If earliest cycle returns -1 and source is constant and moveNode
            // needs long immediate there is most likely missing long immediate
            // unit
            std::string msg = "Assignment of MoveNode " + moveNode.toString();
            msg += " failed! Most likely missing Long Immediate Unit";
            msg += " or Instruction Template!";
            throw IllegalMachine(
                __FILE__, __LINE__, __func__, msg);
        }
        return;
    }    
    if (moveNode.isSourceOperation() && !moveNode.isDestinationOperation()) {
        ProgramOperation& po = moveNode.sourceOperation();
        if (po.isAnyOutputAssigned()) {
            // Some of the output moves are already assigned, we try to 
            // put this as close to them as possible
            int localMaximum = 0;
            for (int i = 0; i < po.outputMoveCount(); i++) {
                MoveNode& temp = po.outputMove(i);
                if (temp.isScheduled()) {
                    localMaximum = std::max(temp.cycle(), localMaximum);
                }
            }
            if (localMaximum != 0 && localMaximum < minCycle) {
                // Bypassed moves are earlier then this one can be scheduled
                // scheduling it too late won't help since operands are limited
                // with already scheduled result move
                
                // if ddg requires move to be later then the bypassed
                // versions, we have to obey that
                localMaximum = std::max(earliestDDG, localMaximum);
                int rmEarliest = 
                    rm_->earliestCycle((localMaximum + minCycle)/2, moveNode);
                if (rmEarliest != -1 && 
                    rmEarliest != INT_MAX && 
                    rmEarliest < minCycle) {
                    minCycle = rmEarliest;
                }
            }
        }
    }
    rm_->assign(minCycle,  moveNode);
    if (!moveNode.isScheduled()) {
        throw ModuleRunTimeError(
            __FILE__, __LINE__, __func__,
            (boost::format("Assignment of MoveNode '%s' failed!")
            % moveNode.toString()).str());
    }
    // Find out the cycle when execution of operation actually ends.
    // Only use for operations that uses internal pipeline after the result read.
    if (moveNode.isDestinationOperation()) {
 
        const Operation& op = moveNode.destinationOperation().operation();
        const TTAMachine::HWOperation& hwop =
            *moveNode.move().destination().functionUnit().operation(op.name());
 
        unsigned int epEndCycle = moveNode.cycle() + hwop.latency();
        // The pipeline will end after current the final cycle,
        // have to scheduler earlier.
        if (epEndCycle > endCycle_ && 
            moveNode.destinationOperation().outputMoveCount() > 0) {
            rm_->unassign(moveNode);
        }
    }
}

References __func__, Operation::affectsCount(), TTAProgram::ProgramAnnotation::ANN_REQUIRES_LIMM, TTAProgram::ProgramAnnotation::ANN_STACKFRAME_PROCEDURE_RETURN, assert, SimpleResourceManager::assign(), SimpleResourceManager::canTransportImmediate(), TTAMachine::Machine::controlUnit(), MoveNode::cycle(), BasicBlockScheduler::ddg_, TTAMachine::ControlUnit::delaySlots(), TTAProgram::Move::destination(), MoveNode::destinationOperation(), DataDependenceGraph::earliestCycle(), SimpleResourceManager::earliestCycle(), endCycle_, DataDependenceGraph::findLimitingAntidependenceDestination(), TTAProgram::Terminal::functionUnit(), MoveNode::guardLatency(), TTAProgram::AnnotatedInstructionElement::hasAnnotations(), Operation::hasSideEffects(), SimpleResourceManager::initiationInterval(), ProgramOperation::isAnyOutputAssigned(), TTAProgram::Move::isControlFlowMove(), MoveNode::isDestinationOperation(), TTAProgram::Terminal::isGPR(), TTAProgram::Move::isReturn(), MoveNode::isScheduled(), MoveNode::isSourceConstant(), MoveNode::isSourceOperation(), TTAProgram::Move::isUnconditional(), jumpMove_, TTAMachine::HWOperation::latency(), DataDependenceGraph::latestCycle(), SimpleResourceManager::latestCycle(), MoveNode::latestTriggerWriteCycle(), MoveNode::move(), Operation::name(), ProgramOperation::operation(), TTAMachine::FunctionUnit::operation(), ProgramOperation::outputMove(), ProgramOperation::outputMoveCount(), DataDependenceGraph::removeIncomingGuardEdges(), RegisterRenamer::renameDestinationRegister(), BasicBlockScheduler::renamer_, RegisterRenamer::renameSourceRegister(), BasicBlockScheduler::rm_, TTAProgram::AnnotatedInstructionElement::setAnnotation(), TTAProgram::Move::setGuard(), MoveNode::sourceOperation(), BasicBlockScheduler::targetMachine_, MoveNode::toString(), tryToOptimizeWaw(), SimpleResourceManager::unassign(), Operation::writesMemory(), and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Referenced by bypassNode(), handleDDG(), handleLoopDDG(), scheduleInputOperandTempMoves(), scheduleOperand(), scheduleResultReads(), scheduleResultReadTempMoves(), scheduleRRMove(), scheduleRRTempMoves(), tryToOptimizeWaw(), and undoBypass().

Here is the call graph for this function:

◆ scheduleOperand()

bool BUBasicBlockScheduler::scheduleOperand	(	MoveNode &	node,
		int	cycle
	)

protected

Checks existence of temporary moves and schedules operand according to discovered dependencies.

Definition at line 1448 of file BUBasicBlockScheduler.cc.

                                                                {
    int tempRegLimitCycle = cycle;
    // Find out if RegCopyAdded create temporary move for input.
    // If so, the operand has to be scheduled before the other use
    // of same temporary register.
    MoveNode* test = precedingTempMove(node);
    if (test != NULL) {
        // Input temp move exists. Check where the move is reading data
        // from, so operand move can be scheduled earlier then
        // the already scheduled overwriting cycle.
        MoveNode* firstWrite =
        ddg_->firstScheduledRegisterWrite(
            node.move().source().registerFile(),
            node.move().source().index());
        if (firstWrite != NULL) {
            assert(firstWrite->isScheduled());
            tempRegLimitCycle = firstWrite->cycle();
        }
    }
    cycle = std::min(cycle, tempRegLimitCycle);
    // This must pass, since we got latest cycle from RM.
    scheduleMove(node, cycle, true);
    if (node.isScheduled() == false) {
        // the latest cycle may change because scheduleMove may do things like
        // register renaming, so this may fail.
        return false;
    }
    scheduleInputOperandTempMoves(node, node);
    return true;
}

References assert, MoveNode::cycle(), BasicBlockScheduler::ddg_, DataDependenceGraph::firstScheduledRegisterWrite(), TTAProgram::Terminal::index(), MoveNode::isScheduled(), MoveNode::move(), precedingTempMove(), TTAProgram::Terminal::registerFile(), scheduleInputOperandTempMoves(), scheduleMove(), and TTAProgram::Move::source().

Referenced by scheduleOperandWrites().

Here is the call graph for this function:

◆ scheduleOperandWrites()

bool BUBasicBlockScheduler::scheduleOperandWrites	(	MoveNodeGroup &	moves,
		int	cycle
	)

protected

Schedules operand moves of an operation execution.

Assumes the given MoveNodeGroup contains all moves in the operation execution. Also assumes that all result moves of the MoveNodeGroup have been scheduled. Assumes bottom up scheduling.

Parameters

moves	Moves of the operation execution.
cycle	latest cycle for starting scheduling of operands

Returns: True if all operands got scheduled

Definition at line 663 of file BUBasicBlockScheduler.cc.

                                                                            {
    ProgramOperation& po =
        (moves.node(0).isSourceOperation())?
        (moves.node(0).sourceOperation()):
        (moves.node(0).destinationOperation());
 
    int unscheduledMoves = 0;
    int scheduledMoves = 0;
    MoveNode* trigger = NULL;
 
    for (int i = 0; i < moves.nodeCount(); i++) {
        if (!moves.node(i).isDestinationOperation()) {
            continue;
        }
        // count how many operand moves will need to be scheduled
        unscheduledMoves++;
        if (moves.node(i).move().destination().isTriggering()) {
            int limit = moves.node(i).latestTriggerWriteCycle();
            // update starting cycle based on scheduled results
            // if necessary.
            cycle = (limit < cycle) ? limit : cycle;
        }
    }
    int counter = 0;
 
    while (unscheduledMoves != scheduledMoves && counter < 5 && cycle >=0) {
        // try to schedule all input moveNodes, also find trigger
        // Try to schedule trigger first, otherwise the operand
        // may get scheduled in cycle where trigger does not fit and
        // later cycle will not be possible for trigger.
        trigger = findTrigger(po, *targetMachine_);
        if (trigger != NULL && !trigger->isScheduled()) {
            if (scheduleOperand(*trigger, cycle) == false) {
                cycle--;
                counter++;
                continue;
            }
            assert(trigger->isScheduled());
            cycle = trigger->cycle();
 
            if (trigger->move().destination().isTriggering()) {
                // We schedulled trigger, this will give us latest possible cycle
                // in order not to have operands later then trigger.
                if (ddg_->hasNode(*trigger)) {
                    // handle moving fu deps.
                    // they may move trigger to later time.
                    ddg_->moveFUDependenciesToTrigger(*trigger);
                    int triggerLatest =
                        std::min(ddg_->latestCycle(*trigger,
                                rm_->initiationInterval()), 
                            cycle);
                    triggerLatest = rm_->latestCycle(triggerLatest, *trigger);
                    if (triggerLatest != INT_MAX &&
                        triggerLatest > trigger->cycle()) {
                        unschedule(*trigger);
                        unscheduleInputOperandTempMoves(*trigger);
                        if (scheduleOperand(*trigger, triggerLatest) == false) {
                            // reschedule with new dependencies failed,
                            // bringing back originaly scheduled trigger
                            scheduleOperand(*trigger, cycle);
                        }
                        assert(trigger->isScheduled());
                        cycle = trigger->cycle();
                    }
                }
            }
        }
 
        for (int moveIndex = 0; moveIndex < moves.nodeCount(); ++moveIndex) {
            MoveNode& moveNode = moves.node(moveIndex);
            // skip the result reads
            if (!moveNode.isDestinationOperation()) {
                continue;
            }
 
            if (moveNode.isScheduled()) {
                continue;
            }
            if (scheduleOperand(moveNode, cycle) == false) {
                unscheduleInputOperandTempMoves(*trigger);
                break;
            }
 
        }
        // Tests if all input moveNodes were scheduled, if so check if trigger
        // is latest
        scheduledMoves = 0;
        for (int moveIndex = 0; moveIndex < moves.nodeCount(); ++moveIndex) {
            MoveNode& moveNode = moves.node(moveIndex);
            // skip the result reads
            if (!moveNode.isDestinationOperation()) {
                continue;
            }
            if (moveNode.isScheduled()) {
                scheduledMoves++;
                if (moveNode.cycle() > cycle) {
                    // moveNode is operand and it is scheduled after the 
                    // trigger! This is wrong!
                    std::cerr << "Move " << moveNode.toString()
                    << " is scheduled after the trigger!" << std::endl;
                    scheduledMoves--;
                }
            }
        }
 
        // Some moveNodes were not scheduled
        // unschedule all and try with higher start cycle
        if (scheduledMoves != unscheduledMoves) {
            for (int i = 0; i < moves.nodeCount(); i++){
                MoveNode& moveNode = moves.node(i);
                if (moveNode.isScheduled() &&
                    moveNode.isDestinationOperation()) {
                    unschedule(moveNode);
                    unscheduleInputOperandTempMoves(moveNode);
                }
            }
            scheduledMoves = 0;
        } else {
            // every operand is scheduled, we can return quickly
            return true;
        }
        cycle--;
        counter++;
    }
    // If loop timeouts we get here
    if (scheduledMoves != unscheduledMoves) {
        return false;
    }
    return true;
}

References assert, MoveNode::cycle(), BasicBlockScheduler::ddg_, TTAProgram::Move::destination(), MoveNode::destinationOperation(), BasicBlockScheduler::findTrigger(), BoostGraph< GraphNode, GraphEdge >::hasNode(), SimpleResourceManager::initiationInterval(), MoveNode::isDestinationOperation(), MoveNode::isScheduled(), MoveNode::isSourceOperation(), TTAProgram::Terminal::isTriggering(), DataDependenceGraph::latestCycle(), SimpleResourceManager::latestCycle(), MoveNode::latestTriggerWriteCycle(), MoveNode::move(), DataDependenceGraph::moveFUDependenciesToTrigger(), MoveNodeGroup::node(), MoveNodeGroup::nodeCount(), BasicBlockScheduler::rm_, scheduleOperand(), MoveNode::sourceOperation(), BasicBlockScheduler::targetMachine_, MoveNode::toString(), BasicBlockScheduler::unschedule(), and BasicBlockScheduler::unscheduleInputOperandTempMoves().

Referenced by scheduleOperation().

Here is the call graph for this function:

◆ scheduleOperation()

void BUBasicBlockScheduler::scheduleOperation	(	MoveNodeGroup &	moves,
		BUMoveNodeSelector &	selector
	)

protected

Schedules moves in a single operation execution.

Assumes the given MoveNodeGroup contains all moves in the operation execution. Also assumes that all outputs of the MoveNodeGroup have been scheduled.

Parameters

moves Moves of the operation execution.

Definition at line 454 of file BUBasicBlockScheduler.cc.

                                                        {
    ProgramOperation& po =
        (moves.node(0).isSourceOperation())?
        (moves.node(0).sourceOperation()):
        (moves.node(0).destinationOperation());
    tryToSwitchInputs(po);        
    bool operandsFailed = true;
    bool resultsFailed = true;
    int resultsStartCycle = endCycle_;
    int maxResult = resultsStartCycle;
 
#ifdef DEBUG_REG_COPY_ADDER
    ddg_->setCycleGrouping(true);
    ddg_->writeToDotFile(
        (boost::format("%s_before_ddg.dot") % ddg_->name()).str());
#endif
    RegisterCopyAdder regCopyAdder(
        BasicBlockPass::interPassData(), *rm_, *selector_, true);
    RegisterCopyAdder::AddedRegisterCopies copies =
         regCopyAdder.addMinimumRegisterCopies(po, *targetMachine_, ddg_);
        
#ifdef DEBUG_REG_COPY_ADDER
    const int tempsAdded = copies.count_;
#endif
    ;
#ifdef DEBUG_REG_COPY_ADDER
    if (tempsAdded > 0) {
        ddg_->writeToDotFile(
            (boost::format("%s_after_regcopy_ddg.dot") % ddg_->name()).str());
    }
//    ddg_->sanityCheck();    
#endif
 
    bool bypass = bypass_;
    bool bypassLate = bypass_;   
    int ii = rm_->initiationInterval();
    // Find smallest cycle from RM is known, otherwise 1
    int rmSmallest = (rm_->smallestCycle() < INT_MAX) ? rm_->smallestCycle() : 1;
    // rmSmallest is cycle where there is nothing scheduled, and nothing
    // is scheduled before it, so it the schedule of result fails there
    // there is no point decreasing the schedule any more.
    int stopingPoint = (ii == 0) ? 
        rmSmallest - 1 : 
        endCycle_ - ii -1;
    while ((operandsFailed || resultsFailed) &&
        resultsStartCycle >= stopingPoint) {
        maxResult = scheduleResultReads(
            moves, resultsStartCycle, bypass, bypassLate);
        if (maxResult != -1) {
            resultsFailed = false;
        } else {
            // At least one of the results did not get scheduled correctly,
            // We try with earlier starting cycle.
            // Drawback, in case of 3 results, 1 could be scheduled very late,
            // second bit earlier and third failing because of location of
            // second scheduled result, not first.
            // Better solution would be to try to push scheduled results up
            // individually, but that would be rather slow process.
            for (int i = 0; i < moves.nodeCount(); i++){
                MoveNode& moveNode = moves.node(i);
                if (moveNode.isScheduled() &&
                    moveNode.isSourceOperation()) {
                    unschedule(moveNode);
                    unscheduleResultReadTempMoves(moveNode);
                    undoBypass(moveNode);
                }
            }
            resultsFailed = true;
            if (bypass && bypassLate) {
                bypass = true;
                bypassLate = false;
            } else if (bypass && !bypassLate) {
                bypass = false;            
                bypassLate = true;
            } else if (!bypass && bypassLate) {
                bypassLate = false;
            } else {
                // We will try to schedule results in earlier cycle
                resultsStartCycle--;    
                bypass = bypass_;
                bypassLate = bypass_;                                                
            }
            continue;
        }
        regCopyAdder.resultsScheduled(copies, *ddg_);
        if (scheduleOperandWrites(moves, resultsStartCycle)) {
            operandsFailed = false;
        } else {
            // Scheduling some operand failed, unschedule all moves, try earlier
            for (int i = 0;i < po.inputMoveCount(); i++) {
                MoveNode& moveNode = po.inputMove(i);//moves.node(i);
                if (moveNode.isScheduled()) {
                    unschedule(moveNode);
                    if (moveNode.isDestinationOperation()) {
                        unscheduleInputOperandTempMoves(moveNode);
                    }
 
                    if (moveNode.isSourceOperation()) {
                        unscheduleResultReadTempMoves(moveNode);
                    }
                }
            }
 
            for (int i = 0;i < po.outputMoveCount(); i++) {
                MoveNode& moveNode = po.outputMove(i);//moves.node(i);
                if (moveNode.isScheduled()) {
                    unschedule(moveNode);
                    if (moveNode.isDestinationOperation()) {
                        unscheduleInputOperandTempMoves(moveNode);
                    }
 
                    if (moveNode.isSourceOperation()) {
                        unscheduleResultReadTempMoves(moveNode);
                    }
                }
            }
 
            std::vector<MoveNode*> outputMoves;
            for (int i = 0; i < po.outputMoveCount(); i++) {
                outputMoves.push_back(&po.outputMove(i));
            }
            
            for (unsigned int i = 0; i < outputMoves.size(); i++) {
                // then undo the bypass etc.
                MoveNode& moveNode = *outputMoves[i]; //moves.node(i);
                if (moveNode.isSourceOperation()) {
                    undoBypass(moveNode);
                }
            }
 
            operandsFailed = true;
            if (bypass && bypassLate) {
                bypass = true;
                bypassLate = false;
            } else if (bypass && !bypassLate) {
                bypass = false;            
                bypassLate = true;
            } else if (!bypass && bypassLate) {
                bypassLate = false;
            } else {
                resultsStartCycle--;                
                maxResult--;                
                resultsStartCycle = std::min(maxResult, resultsStartCycle);                                
                bypass = bypass_;
                bypassLate = bypass_;                                                
            }
        }
    }
    // This fails if we reach 0 cycle.
    if (resultsFailed) {
        if (ii == 0) {
            // This is only problem with regular scheduling, with loop schedule
            // this is expected for too small II.
            ddg_->writeToDotFile(
                (boost::format("bb_%s_2_failed_scheduling.dot")
                % ddg_->name()).str());
        }
        unscheduleAllNodes();
        throw ModuleRunTimeError(
             __FILE__, __LINE__, __func__,
             "Results scheduling failed for \'" + moves.toString());
    }
 
    if (operandsFailed) {
        if (ii == 0) {
            // This is only problem with regular scheduling, with loop schedule
            // this is expected for too small II.            
            ddg_->writeToDotFile(
                (boost::format("bb_%s_2_scheduling.dot")
                % ddg_->name()).str());
        }
        unscheduleAllNodes();
        throw ModuleRunTimeError(
            __FILE__, __LINE__, __func__,
            "Operands scheduling failed for \'" + moves.toString());
    }
  
    for (int i = 0; i < moves.nodeCount(); i++) {
        finalizeSchedule(moves.node(i), selector);
    }
    regCopyAdder.operandsScheduled(copies,*ddg_);
#ifdef DEBUG_REG_COPY_ADDER
    if (tempsAdded > 0) {
        ddg_->writeToDotFile(
            (boost::format("%s_after_scheduler_ddg.dot") %
             ddg_->name()).str());
        Application::logStream()
            << "(operation fix #" << ddg_->name() << ")" << std::endl
            << std::endl;
        ++graphCount;
    }
 
#endif
}

References __func__, RegisterCopyAdder::addMinimumRegisterCopies(), bypass_, RegisterCopyAdder::AddedRegisterCopies::count_, BasicBlockScheduler::ddg_, MoveNode::destinationOperation(), endCycle_, finalizeSchedule(), SimpleResourceManager::initiationInterval(), ProgramOperation::inputMove(), ProgramOperation::inputMoveCount(), SchedulerPass::interPassData(), MoveNode::isDestinationOperation(), MoveNode::isScheduled(), MoveNode::isSourceOperation(), Application::logStream(), BoostGraph< GraphNode, GraphEdge >::name(), MoveNodeGroup::node(), MoveNodeGroup::nodeCount(), RegisterCopyAdder::operandsScheduled(), ProgramOperation::outputMove(), ProgramOperation::outputMoveCount(), RegisterCopyAdder::resultsScheduled(), BasicBlockScheduler::rm_, scheduleOperandWrites(), scheduleResultReads(), BasicBlockScheduler::selector_, DataDependenceGraph::setCycleGrouping(), SimpleResourceManager::smallestCycle(), MoveNode::sourceOperation(), BasicBlockScheduler::targetMachine_, MoveNodeGroup::toString(), tryToSwitchInputs(), undoBypass(), BasicBlockScheduler::unschedule(), unscheduleAllNodes(), BasicBlockScheduler::unscheduleInputOperandTempMoves(), BasicBlockScheduler::unscheduleResultReadTempMoves(), and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Referenced by handleDDG(), and handleLoopDDG().

Here is the call graph for this function:

◆ scheduleResultReads()

int BUBasicBlockScheduler::scheduleResultReads	(	MoveNodeGroup &	moves,
		int	cycle,
		bool	bypass = `false`,
		bool	bypassLate = `false`
	)

protected

Schedules the result read moves of an operation execution.

Assumes the given MoveNodeGroup contains all moves in the operation execution.

Parameters

moves Moves of the operation execution.

Returns: Last cycle in which any of the results was scheduled

Definition at line 804 of file BUBasicBlockScheduler.cc.

                                                                   {
    int maxResultCycle = cycle;
    int tempRegLimitCycle = cycle;
    int localMaximum = 0;
    bool resultScheduled = false;
    for (int moveIndex = 0; moveIndex < moves.nodeCount(); ++moveIndex) {
        if (!moves.node(moveIndex).isSourceOperation()) {
            continue;
        }
        MoveNode& moveNode = moves.node(moveIndex);
        bool bypassSuccess = false;
        if (!moveNode.isScheduled()) {
            if (!moveNode.isSourceOperation()) {
                throw InvalidData(
                    __FILE__, __LINE__, __func__,
                    (boost::format("Move to schedule '%s' is not "
                    "result move!") % moveNode.toString()).str());
            }
            if (bypass) {
                int newMaximum = maxResultCycle + bypassDistance_;
                bypassSuccess = bypassNode(moveNode, newMaximum);                
                localMaximum = 
                        (newMaximum > localMaximum) ? newMaximum : localMaximum;
                if (dre_ && bypassSuccess &&
                    !ddg_->resultUsed(moveNode)) {
                    // All uses of result were bypassed, result will be removed
                    // after whole operation is scheduled.
                    //tempRegLimitCycle = std::max(tempRegLimitCycle, maxResultCycle);  
                    resultScheduled = true;
                    continue;
                } 
            }
 
            // Find out if RegCopyAdded create temporary copy for output move
            MoveNode* test = succeedingTempMove(moveNode);
            if (test != NULL) {
                // Output temp move exists. Check where the original move
                // will be writing, that is the temporary register.
                MoveNode* firstWrite =
                    ddg_->firstScheduledRegisterWrite(
                        moveNode.move().destination().registerFile(),
                        moveNode.move().destination().index());
                if (firstWrite != NULL) {
                    assert(firstWrite->isScheduled());
                    tempRegLimitCycle = firstWrite->cycle();
                }
                // Schedule temporary move first.
                scheduleResultReadTempMoves(
                    moveNode, moveNode, tempRegLimitCycle);                
                // If there was temporary result read scheduled, write needs
                // to be at least one cycle earlier.                    
                if (test != NULL && test->isScheduled())
                    tempRegLimitCycle = std::min(test->cycle() -1, cycle);                
            }
            tempRegLimitCycle = 
                (localMaximum != 0) 
                    ? std::min(localMaximum +1, tempRegLimitCycle)
                    : tempRegLimitCycle;
                    
            scheduleMove(moveNode, tempRegLimitCycle, true);
            if (!moveNode.isScheduled()) {
                // Scheduling result failed due to some of the bypassed moves
                // will try again without bypassing anything.
                undoBypass(moveNode);
                return -1;
            }            
            if (bypassLate) {
                int newMaximum = moveNode.cycle() + bypassDistance_;
                if (bypassNode(moveNode, newMaximum)) {
                    localMaximum = 
                        (localMaximum < newMaximum) ? newMaximum : localMaximum;
                    localMaximum = (localMaximum > cycle) ? localMaximum : cycle;                        
                    int originalCycle = moveNode.cycle();
                    unschedule(moveNode);
                    scheduleMove(moveNode, localMaximum, true);
                    if (!moveNode.isScheduled()) {
                        scheduleMove(moveNode, originalCycle, false);
                    }
                }
                assert(moveNode.isScheduled());
            }
            resultScheduled = true;
            // Find latest schedule result cycle
            localMaximum = 
                (localMaximum < moveNode.cycle()) 
                ? moveNode.cycle() : localMaximum;                    
            
            maxResultCycle =
                (moveNode.cycle() > maxResultCycle) ?
                    moveNode.cycle() : maxResultCycle;
        }
 
    }    
    return (resultScheduled) ? localMaximum : maxResultCycle;
}

References __func__, assert, bypassDistance_, bypassNode(), MoveNode::cycle(), BasicBlockScheduler::ddg_, TTAProgram::Move::destination(), dre_, DataDependenceGraph::firstScheduledRegisterWrite(), TTAProgram::Terminal::index(), MoveNode::isScheduled(), MoveNode::isSourceOperation(), MoveNode::move(), MoveNodeGroup::node(), MoveNodeGroup::nodeCount(), TTAProgram::Terminal::registerFile(), DataDependenceGraph::resultUsed(), scheduleMove(), scheduleResultReadTempMoves(), BasicBlockScheduler::succeedingTempMove(), MoveNode::toString(), undoBypass(), and BasicBlockScheduler::unschedule().

Referenced by scheduleOperation().

Here is the call graph for this function:

◆ scheduleResultReadTempMoves()

void BUBasicBlockScheduler::scheduleResultReadTempMoves	(	MoveNode &	resultMove,
		MoveNode &	resultRead,
		int	firstWriteCycle
	)

protected

Schedules the (possible) temporary register copy moves (due to missing connectivity) preceeding the given result read move.

The function recursively goes through all the temporary moves added to the given result move.

Parameters

resultMove	A temp move whose predecessor has to be scheduled.
resultRead	The original move of which temp moves to schedule.
firstWriteCycle	Recursive function parameter.

Definition at line 1228 of file BUBasicBlockScheduler.cc.

                                                                     {
    /* Because temporary register moves do not have WaR/WaW dependency edges
       between the other possible uses of the same temp register in
       the same operation, we have to limit the scheduling of the new
       temp reg move to the last use of the same temp register so
       we don't overwrite the temp registers of the other operands. */
 
 
    // find all unscheduled succeeding moves of the result read move
    // there should be only only one with the only dependence edge (RaW) to
    // the result move
 
    MoveNode* tempMove1 = succeedingTempMove(resultMove);
    if (tempMove1 == NULL)
        return; // no temp moves found
 
    MoveNode* tempMove2 = succeedingTempMove(*tempMove1);
    if (tempMove2 != NULL) {
        // Found second temp move. First temp move will write register
        // which second will read.
        MoveNode* firstWrite =
            ddg_->firstScheduledRegisterWrite(
                tempMove1->move().destination().registerFile(),
                tempMove1->move().destination().index());
        if (firstWrite != NULL && firstWrite->isScheduled())
            firstWriteCycle = firstWrite->cycle();
        scheduleResultReadTempMoves(*tempMove1, resultRead, firstWriteCycle);   
        if (tempMove2 != NULL && tempMove2->isScheduled()){ // TODO: maybe there is scheduled is missing
            firstWriteCycle = tempMove2->cycle() -1;        
        }
    }
    bool bypassSuccess = false;
    if (bypass_) {
        int tmp = endCycle_;
        bypassSuccess = bypassNode(*tempMove1, tmp);
    }
    if (!bypassSuccess || !dre_ || ddg_->resultUsed(*tempMove1)) {
        scheduleMove(*tempMove1, firstWriteCycle, true);
        assert(tempMove1->isScheduled());
        if (bypass_) {
            int tmp = endCycle_;
            bypassSuccess = bypassNode(*tempMove1, tmp);
        }        
        scheduledTempMoves_[&resultRead].insert(tempMove1);
    } else if (dre_ && !ddg_->resultUsed(*tempMove1)) {
        finalizeSchedule(*tempMove1, dynamic_cast<BUMoveNodeSelector&>(*selector_));
    }
}

References assert, bypass_, bypassNode(), MoveNode::cycle(), BasicBlockScheduler::ddg_, TTAProgram::Move::destination(), dre_, endCycle_, finalizeSchedule(), DataDependenceGraph::firstScheduledRegisterWrite(), TTAProgram::Terminal::index(), MoveNode::isScheduled(), MoveNode::move(), TTAProgram::Terminal::registerFile(), DataDependenceGraph::resultUsed(), BasicBlockScheduler::scheduledTempMoves_, scheduleMove(), scheduleResultReadTempMoves(), BasicBlockScheduler::selector_, and BasicBlockScheduler::succeedingTempMove().

Referenced by scheduleResultReads(), scheduleResultReadTempMoves(), scheduleRRMove(), and scheduleRRTempMoves().

Here is the call graph for this function:

◆ scheduleRRMove()

void BUBasicBlockScheduler::scheduleRRMove ( MoveNode & moveNode )

protected

Schedules moves in a single operation execution.

Assumes the given MoveNodeGroup contains all moves in the operation execution. Also assumes that all inputs to the MoveNodeGroup have been scheduled.

Parameters

moveNode R-R Move to schedule.

Definition at line 911 of file BUBasicBlockScheduler.cc.

                                                        {
#ifdef DEBUG_REG_COPY_ADDER
    ddg_->setCycleGrouping(true);
    ddg_->writeToDotFile(
        (boost::format("%s_before_ddg.dot") % ddg_->name()).str());
#endif
 
    if (moveNode.move().source().equals(
        moveNode.move().destination())) {
        return;
    } 
 
    RegisterCopyAdder regCopyAdder(
        BasicBlockPass::interPassData(), *rm_, *selector_, true);
 
#ifdef DEBUG_REG_COPY_ADDER
    const int tempsAdded =
#endif
 
        regCopyAdder.addRegisterCopiesToRRMove(moveNode, ddg_)
#ifdef DEBUG_REG_COPY_ADDER
        .count_
#endif
        ;
#ifdef DEBUG_REG_COPY_ADDER
    if (tempsAdded > 0) {
        ddg_->writeToDotFile(
            (boost::format("%s_after_regcopy_ddg.dot") % ddg_->name()).str());
    }
//    ddg_->sanityCheck();
#endif
    scheduleResultReadTempMoves(moveNode, moveNode, endCycle_);
    scheduleMove(moveNode, endCycle_, true);
}

References RegisterCopyAdder::addRegisterCopiesToRRMove(), RegisterCopyAdder::AddedRegisterCopies::count_, BasicBlockScheduler::ddg_, TTAProgram::Move::destination(), endCycle_, TTAProgram::Terminal::equals(), SchedulerPass::interPassData(), MoveNode::move(), BoostGraph< GraphNode, GraphEdge >::name(), BasicBlockScheduler::rm_, scheduleMove(), scheduleResultReadTempMoves(), BasicBlockScheduler::selector_, DataDependenceGraph::setCycleGrouping(), TTAProgram::Move::source(), and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Referenced by handleDDG(), and handleLoopDDG().

Here is the call graph for this function:

◆ scheduleRRTempMoves()

void BUBasicBlockScheduler::scheduleRRTempMoves	(	MoveNode &	regToRegMove,
		MoveNode &	firstMove,
		int	lastUse
	)

protected

Schedules the (possible) temporary register copy moves (due to missing connectivity) succeeding the given RR move.

The function recursively goes through all the temporary moves added to the given RR move.

Parameters

regToRegMove	A temp move whose successor has to be scheduled.
firstMove	The original move of which temp moves to schedule.
lastUse	Recursive function parameter, it should be set as 0 for the first function call.

Definition at line 1365 of file BUBasicBlockScheduler.cc.

                                                              {
    /* Because temporary register moves do not have WaR/WaW dependency edges
       between the other possible uses of the same temp register in
       the same operation, we have to limit the scheduling of the new
       temp reg move to the last use of the same temp register so
       we don't overwrite the temp registers of the other operands. */
 
    // find all unscheduled succeeding moves of the result read move
    // there should be only only one with the only dependence edge (RaW) to
    // the result move
 
    MoveNode* tempMove1 = succeedingTempMove(regToRegMove);
    if (tempMove1 == NULL)
        return; // no temp moves found
 
    MoveNode* tempMove2 = succeedingTempMove(*tempMove1);
    if (tempMove2 != NULL) {
        MoveNode* firstWrite =
            ddg_->firstScheduledRegisterWrite(
                tempMove1->move().destination().registerFile(),
                tempMove1->move().destination().index());
        if (firstWrite != NULL) {
            assert(firstWrite->isScheduled());
            lastUse = firstWrite->cycle();
        }            
    }
    scheduleResultReadTempMoves(*tempMove1, firstMove, lastUse);
    bool bypassSuccess = false;
    if (bypass_) {
        int tmp = endCycle_;
        bypassSuccess = bypassNode(*tempMove1, tmp);
    }
    if (!bypassSuccess || !dre_ || ddg_->resultUsed(*tempMove1)) {
        scheduleMove(*tempMove1, lastUse - 1, true);    
        if (!tempMove1->isScheduled()) {
            std::cerr << "not scheduled: " << tempMove1->toString() << std::endl;
            ddg_->writeToDotFile("tempNotSched.dot");
        }
        if (bypass_) {
            int tmp = endCycle_;
            bypassSuccess = bypassNode(*tempMove1, tmp);
        }        
        assert(tempMove1->isScheduled());
        scheduledTempMoves_[&firstMove].insert(tempMove1);
    } else if (dre_ && !ddg_->resultUsed(*tempMove1)) {
        finalizeSchedule(*tempMove1, dynamic_cast<BUMoveNodeSelector&>(*selector_));
    }
}

References assert, bypass_, bypassNode(), MoveNode::cycle(), BasicBlockScheduler::ddg_, TTAProgram::Move::destination(), dre_, endCycle_, finalizeSchedule(), DataDependenceGraph::firstScheduledRegisterWrite(), TTAProgram::Terminal::index(), MoveNode::isScheduled(), MoveNode::move(), TTAProgram::Terminal::registerFile(), DataDependenceGraph::resultUsed(), BasicBlockScheduler::scheduledTempMoves_, scheduleMove(), scheduleResultReadTempMoves(), BasicBlockScheduler::selector_, BasicBlockScheduler::succeedingTempMove(), MoveNode::toString(), and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Here is the call graph for this function:

◆ shortDescription()

std::string BUBasicBlockScheduler::shortDescription ( ) const

virtual

A short description of the pass, usually the optimization name, such as "basic block scheduler".

Returns: The description as a string.

Reimplemented from BasicBlockScheduler.

Definition at line 1196 of file BUBasicBlockScheduler.cc.

                                              {
    return "Bottom-up list scheduler with a basic block scope.";
}

◆ tryToOptimizeWaw()

bool BUBasicBlockScheduler::tryToOptimizeWaw ( const MoveNode & moveNode )

protected

Tries to get rid of WaW dependence from unconditional to conditional.

if the conditional move's result is overwritten by the cond for all users, make the unconditional move conditional, with opposite guard.

Definition at line 1977 of file BUBasicBlockScheduler.cc.

                                                                {
 
    if (ddg_->latestCycle(moveNode, endCycle_ , false, true, true) >=
        ddg_->latestCycle(moveNode)) {
        return false;
    }
    
    MoveNode* wawPred = NULL;
    DataDependenceEdge* wawEdge = NULL;
 
    DataDependenceGraph::EdgeSet inEdges = ddg_->inEdges(moveNode);
    for (DataDependenceGraph::EdgeSet::iterator i = inEdges.begin();
         i != inEdges.end(); i++) {
        DataDependenceEdge* e = *i;
 
        if (e->dependenceType() == DataDependenceEdge::DEP_WAW &&
            e->edgeReason() == DataDependenceEdge::EDGE_REGISTER &&
            !e->tailPseudo()) {
            if (wawPred == NULL) {
                wawPred = &ddg_->tailNode(**i);
                wawEdge = e;
            } else {
                return false;
            }
        }
    }
    if (wawPred == NULL) {
        return false;
    }
    
    if (!wawPred->move().isUnconditional()) {
        return false;
    }
 
    // check that no other usage of the data.
    DataDependenceGraph::NodeSet consumers = ddg_->regRawSuccessors(*wawPred);
    DataDependenceGraph::NodeSet consumers2 = ddg_->regRawSuccessors(moveNode);
    for (DataDependenceGraph::NodeSet::iterator i = consumers.begin();
         i != consumers.end(); i++) {
        MoveNode* mn = *i;
        if (consumers2.find(mn) == consumers2.end() &&
            (mn->move().isUnconditional() ||
             !ddg_->exclusingGuards(*mn, moveNode))) {
            return false;
        }
    }
    if (wawPred->isScheduled())
        unschedule(*wawPred);
 
    TTAProgram::CodeGenerator cg(*targetMachine_);
    wawPred->move().setGuard(cg.createInverseGuard(moveNode.move().guard()));
 
    ddg_->copyDepsOver(*wawPred, true, false);
    
    ddg_->copyIncomingGuardEdges(moveNode, *wawPred);
    ddg_->copyOutgoingGuardWarEdges(moveNode, *wawPred);
    
    ddg_->removeEdge(*wawEdge);
    
    scheduleMove(*wawPred, endCycle_, false);
    bool revert = false;
 
    if (!wawPred->isScheduled()) {
        revert = true;
    }
    if (revert) {
        wawPred->move().setGuard(NULL);
        ddg_->removeIncomingGuardEdges(*wawPred);
        ddg_->removeOutgoingGuardWarEdges(*wawPred);
        ddg_->connectNodes(*wawPred, moveNode, *wawEdge);
        return false;
    }
 
    return true;
}

Referenced by scheduleMove().

Here is the call graph for this function:

◆ tryToSwitchInputs()

bool BUBasicBlockScheduler::tryToSwitchInputs ( ProgramOperation & po )

protected

If the operation is commutative, tries to change the operands so that the scheduler can schedule it better.

If the operation is not commutative, does nothing.

Which is better depends lots on the code being compiled and architecture which we are compiling for.

Current implementation tries to make constants triggers, and if there are no constant inputs, try to also change inputs so that last ready operand becomes trigger if it's near, but first ready operand becomes trigger if it's further (allows better bypassing of other operands) This seems to work in practice

Parameters

po	programoperation whose inputs to switch

Returns: true if changed inputs, false if not.

Definition at line 1909 of file BUBasicBlockScheduler.cc.

                                                             {
    
    const Operation& op = po.operation();
    if (op.numberOfInputs() == 2 && op.canSwap(1, 2)) {
        
        int triggerOperand = getTriggerOperand(op, *targetMachine_);
 
        if (triggerOperand != 0) {
            MoveNode* latest = NULL;
            int latestMinCycle = -1;
            int firstMinCycle = INT_MAX;
 
            //check all input moves.
            for (int i = 0; i < po.inputMoveCount(); i++) {
                MoveNode& node = po.inputMove(i);
                // always make constants triggers.
                // todo: shoudl do this only with short imms?
                if (node.isSourceConstant()) {
                    int operandIndex = 
                        node.move().destination().operationIndex();
                    if (operandIndex != triggerOperand) {
                        po.switchInputs();
                        return true;
                    } else {
                        return false;
                    }
                }
 
                int minCycle = ddg_->latestCycle(
                    node, rm_->initiationInterval(), false, true, true, true, true);
                if (minCycle > latestMinCycle) {
                    latest = &node;
                    latestMinCycle = minCycle;
                }
                if (minCycle < firstMinCycle) {
                    firstMinCycle = minCycle;
                }
            }
 
            int lastOperand = latest->move().destination().operationIndex();
 
            // don't change if min cycles of first and last are equal.
            if (latestMinCycle == firstMinCycle) {
                return false;
            }
            if (latestMinCycle - firstMinCycle > 1) { // reverse logic if far.
                if (lastOperand == triggerOperand) {
                    po.switchInputs();
                    return true;
                }
            } else {
                if (lastOperand != triggerOperand) {
                    po.switchInputs();
                    return true;
                }
            }
        }
    }
    return false;
}

References Operation::canSwap(), BasicBlockScheduler::ddg_, TTAProgram::Move::destination(), BasicBlockScheduler::getTriggerOperand(), SimpleResourceManager::initiationInterval(), ProgramOperation::inputMove(), ProgramOperation::inputMoveCount(), MoveNode::isSourceConstant(), DataDependenceGraph::latestCycle(), MoveNode::move(), Operation::numberOfInputs(), ProgramOperation::operation(), TTAProgram::Terminal::operationIndex(), BasicBlockScheduler::rm_, ProgramOperation::switchInputs(), and BasicBlockScheduler::targetMachine_.

Referenced by scheduleOperation().

Here is the call graph for this function:

◆ undoBypass()

void BUBasicBlockScheduler::undoBypass	(	MoveNode &	moveNode,
		MoveNode *	single = `NULL`,
		int	oCycle = `-1`
	)

protected

Remove all the bypasses of result write in moveNode and restore and schedule original moves.

Definition at line 1527 of file BUBasicBlockScheduler.cc.

                                                      {
 
    if (single == NULL) {
        if (MapTools::containsKey(bypassDestinations_, &moveNode)) {
            std::vector<MoveNode*> destinationsVector = 
                bypassDestinations_[&moveNode];                    
            std::vector<std::pair<MoveNode*, int> > rescheduleVector;
 
            for (unsigned int j = 0; j < destinationsVector.size(); j++) {            
            // unschedule and unmerge all bypassed nodes
                MoveNode* dest = destinationsVector[j];
                if (dest->isScheduled()) {
                    unschedule(*dest);
                }
                ddg_->unMergeUser(moveNode, *dest);
                int originalCycle =                 
                    bypassDestinationsCycle_[&moveNode][j];                
                const TTAMachine::Bus* bus =
                    bypassDestinationsBus_[&moveNode][j];
                dest->move().setBus(*bus);
                rescheduleVector.push_back(
                    std::pair<MoveNode*, int>(dest, originalCycle));
                droppedNodes_.erase(dest);
            }
            for (unsigned int i = 0; i < rescheduleVector.size(); i++) {
            // reassign nodes to their original places
                std::pair<MoveNode*, int> dest = rescheduleVector[i];
                //rm_->assign(dest.second,  *dest.first);
                scheduleMove(*dest.first, dest.second, false);
                if (!dest.first->isScheduled()) {
                    ddg_->writeToDotFile("unbypassFailed.dot");
                    std::cerr << " Source: " << moveNode.toString()
                    << ", Original: " << dest.first->toString() << 
                    ", original cycle: " << dest.second << std::endl<< std::endl;  
                }
                assert(dest.first->isScheduled());                
            }            
            bypassDestinations_.erase(&moveNode);          
            bypassDestinationsCycle_.erase(&moveNode);
            bypassDestinationsBus_.erase(&moveNode);                                      
        }
    } else {
        if (single->isScheduled()) {
            // Bypassed node could get scheduled too early, in such a case
            // this move need to be unscheduled.
            unschedule(*single);
        }        
        int size = bypassDestinationsBus_[&moveNode].size();
        const TTAMachine::Bus* bus =
            bypassDestinationsBus_[&moveNode][size-1];
        ddg_->unMergeUser(moveNode, *single);
        single->move().setBus(*bus);
        //rm_->assign(oCycle,  *single);
        scheduleMove(*single, oCycle, false);
        if (!single->isScheduled()) {
            ddg_->writeToDotFile("unbypassFailed.dot");
            std::cerr << " Source: " << moveNode.toString()
            << ", Original: " << single->toString() << ", original cycle: " 
            << oCycle << std::endl;
        }
        droppedNodes_.erase(single);
        assert(single->isScheduled());        
    }
}

References assert, bypassDestinations_, bypassDestinationsBus_, bypassDestinationsCycle_, MapTools::containsKey(), BasicBlockScheduler::ddg_, droppedNodes_, MoveNode::isScheduled(), MoveNode::move(), scheduleMove(), TTAProgram::Move::setBus(), MoveNode::toString(), DataDependenceGraph::unMergeUser(), BasicBlockScheduler::unschedule(), and GraphBase< GraphNode, GraphEdge >::writeToDotFile().

Referenced by bypassNode(), handleDDG(), scheduleOperation(), and scheduleResultReads().

Here is the call graph for this function:

◆ unscheduleAllNodes()

void BUBasicBlockScheduler::unscheduleAllNodes ( )

protected

Calls unschedule() for all ddg nodes, which were scheduled and remove possible bypasses.

Definition at line 1840 of file BUBasicBlockScheduler.cc.

                                          {
    DataDependenceGraph::NodeSet scheduled = ddg_->scheduledMoves();
 
    for (DataDependenceGraph::NodeSet::iterator i = scheduled.begin();
         i != scheduled.end(); ++i) {
        MoveNode& moveNode = **i;
        if (moveNode.isScheduled()) {
            unschedule(moveNode);
            i = scheduled.begin();
        }        
    }
    std::map<MoveNode*, std::vector<MoveNode*>, MoveNode::Comparator>::iterator it =
        bypassDestinations_.begin();
    for (; it != bypassDestinations_.end(); it++) {
        std::vector<MoveNode*> destinationsVector = (*it).second;
        for (unsigned int k = 0; k < destinationsVector.size(); k++) {            
            // unschedule and unmerge all bypassed nodes
            MoveNode* dest = destinationsVector[k];
            ddg_->unMergeUser(*(*it).first, *dest);
        }        
    }
    bypassDestinationsCycle_.clear();
    bypassDestinationsBus_.clear();
    bypassDestinations_.clear();
    droppedNodes_.clear();
    assert(ddg_->scheduledNodeCount() == 0);
}

References assert, bypassDestinations_, bypassDestinationsBus_, bypassDestinationsCycle_, BasicBlockScheduler::ddg_, droppedNodes_, MoveNode::isScheduled(), DataDependenceGraph::scheduledMoves(), DataDependenceGraph::scheduledNodeCount(), DataDependenceGraph::unMergeUser(), and BasicBlockScheduler::unschedule().

Referenced by handleDDG(), handleLoopDDG(), and scheduleOperation().

Here is the call graph for this function:

Member Data Documentation

◆ bypass_

bool BUBasicBlockScheduler::bypass_

protected

Definition at line 155 of file BUBasicBlockScheduler.hh.

Referenced by bypassNode(), handleDDG(), handleLoopDDG(), scheduleOperation(), scheduleResultReadTempMoves(), and scheduleRRTempMoves().

◆ bypassDestinations_

std::map<MoveNode*, std::vector<MoveNode*>, MoveNode::Comparator> BUBasicBlockScheduler::bypassDestinations_

protected

Definition at line 145 of file BUBasicBlockScheduler.hh.

Referenced by bypassNode(), clearRemovedNodes(), finalizeSchedule(), undoBypass(), and unscheduleAllNodes().

◆ bypassDestinationsBus_

std::map<MoveNode*, std::vector<const TTAMachine::Bus*>, MoveNode::Comparator > BUBasicBlockScheduler::bypassDestinationsBus_

protected

Definition at line 151 of file BUBasicBlockScheduler.hh.

Referenced by bypassNode(), clearRemovedNodes(), undoBypass(), and unscheduleAllNodes().

◆ bypassDestinationsCycle_

std::map<MoveNode*, std::vector<int>, MoveNode::Comparator > BUBasicBlockScheduler::bypassDestinationsCycle_

protected

Definition at line 147 of file BUBasicBlockScheduler.hh.

Referenced by bypassNode(), clearRemovedNodes(), undoBypass(), and unscheduleAllNodes().

◆ bypassDistance_

int BUBasicBlockScheduler::bypassDistance_

protected

Definition at line 157 of file BUBasicBlockScheduler.hh.

Referenced by bypassNode(), handleDDG(), handleLoopDDG(), and scheduleResultReads().

◆ dre_

bool BUBasicBlockScheduler::dre_

protected

Definition at line 156 of file BUBasicBlockScheduler.hh.

Referenced by finalizeSchedule(), handleDDG(), handleLoopDDG(), scheduleResultReads(), scheduleResultReadTempMoves(), and scheduleRRTempMoves().

◆ droppedNodes_

std::set<MoveNode*> BUBasicBlockScheduler::droppedNodes_

protected

Definition at line 152 of file BUBasicBlockScheduler.hh.

Referenced by clearRemovedNodes(), finalizeSchedule(), undoBypass(), and unscheduleAllNodes().

◆ endCycle_

unsigned int BUBasicBlockScheduler::endCycle_

protected

Definition at line 154 of file BUBasicBlockScheduler.hh.

Referenced by handleDDG(), handleLoopDDG(), scheduleInputOperandTempMoves(), scheduleMove(), scheduleOperation(), scheduleResultReadTempMoves(), scheduleRRMove(), scheduleRRTempMoves(), and tryToOptimizeWaw().

◆ jumpMove_

MoveNode* BUBasicBlockScheduler::jumpMove_

protected

Definition at line 142 of file BUBasicBlockScheduler.hh.

Referenced by BUBasicBlockScheduler(), handleLoopDDG(), and scheduleMove().

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

Classes

Public Member Functions

Protected Types

Protected Member Functions

Protected Attributes

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ OrderedSet

Constructor & Destructor Documentation

◆ BUBasicBlockScheduler()

◆ ~BUBasicBlockScheduler()

Member Function Documentation

◆ bypassNode()

◆ clearRemovedNodes()

◆ ddgBuilder()

◆ finalizeSchedule()

◆ findBypassDestinations()

◆ handleDDG()

◆ handleLoopDDG()

◆ longDescription()

◆ precedingTempMove()

◆ scheduleInputOperandTempMoves()

◆ scheduleMove()

◆ scheduleOperand()

◆ scheduleOperandWrites()

◆ scheduleOperation()

◆ scheduleResultReads()

◆ scheduleResultReadTempMoves()

◆ scheduleRRMove()

◆ scheduleRRTempMoves()

◆ shortDescription()

◆ tryToOptimizeWaw()

◆ tryToSwitchInputs()

◆ undoBypass()

◆ unscheduleAllNodes()

Member Data Documentation

◆ bypass_

◆ bypassDestinations_

◆ bypassDestinationsBus_

◆ bypassDestinationsCycle_

◆ bypassDistance_

◆ dre_

◆ droppedNodes_

◆ endCycle_

◆ jumpMove_