OpenASIP
2.0
|
This is the complete list of members for BF2ScheduleFront, including all inherited members.
addJumpGuardIfNeeded(MoveNode &mn, int cycle, bool ignoreGuardWriteCycle=false) | BFOptimization | private |
allNodesOfSameOperation(MoveNode &mn) | BF2ScheduleFront | protected |
appendBypassSources(MoveNodeMap &map) | BF2ScheduleFront | |
assign(int cycle, MoveNode &, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU_=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1, bool ignoreGuardWriteCycle=false) | BFOptimization | protectedvirtual |
assignCopyToPrologEpilog(int cycle, MoveNode &mn, MoveNode &loopMN, const TTAMachine::Bus *prologBus, int prologImmWriteCycle) | BFOptimization | private |
BF2ScheduleFront(BF2Scheduler &sched, MoveNode &mn, int lc) | BF2ScheduleFront | inline |
BFOptimization(BF2Scheduler &sched) | BFOptimization | inline |
bypassed(MoveNode &src, MoveNode &dst) | BF2ScheduleFront | inline |
bypassSources_ | BF2ScheduleFront | private |
canAssign(int cycle, MoveNode &mn, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1, bool ignoreGWN=false) | BFOptimization | protectedvirtual |
canBeScheduled(const MoveNode &mn) | BFOptimization | protected |
canBeSpeculated(const Operation &op) | BFOptimization | protected |
canBeSpeculated(const MoveNode &mn) | BFOptimization | protected |
checkPrologDDG(MoveNode &prologEpilogMN) | BFOptimization | private |
clearPrologMoves() | BFOptimization | static |
clearSchedulingFront() | BF2ScheduleFront | protected |
createCopyForPrologEpilog(MoveNode &mn) | BFOptimization | private |
ddg() | BFOptimization | protected |
ddg() const | BFOptimization | protected |
deleteChildren(std::stack< Reversible * > &children) | Reversible | |
deletingNode(MoveNode *deletedNode) | BF2ScheduleFront | inline |
destinationFU(const MoveNode &mn) | BFOptimization | private |
duplicator() const | BFOptimization | protected |
findInducingBypassSource(MoveNode &mn) | BF2ScheduleFront | |
findInducingBypassSourceFromOperation(ProgramOperation &po, const DataDependenceGraph::NodeSet &processedNodes, DataDependenceGraph::NodeSet &queue) | BF2ScheduleFront | private |
fuOfTerminal(const TTAProgram::Terminal &t) | BFOptimization | private |
getMoveNodeFromFrontBU() | BF2ScheduleFront | protected |
getPreferredLimits(const MoveNode &mn) | BF2ScheduleFront | protected |
getSisterTrigger(const MoveNode &mn, const TTAMachine::Machine &mach) | BFOptimization | static |
hasAmbiguousResources(MoveNode &mn) const | BFOptimization | private |
id() | Reversible | inline |
id_ | Reversible | private |
idCounter_ | Reversible | privatestatic |
ii() const | BFOptimization | protected |
illegalBypassSources_ | BF2ScheduleFront | |
illegalOperandShares_ | BF2ScheduleFront | |
immCountPreventsScheduling(const MoveNode &mn) | BFOptimization | protected |
isFinishFront() | BFOptimization | inlinevirtual |
jumpGuardAvailableCycle(const MoveNode &mn) | BFOptimization | protected |
latestScheduledOfFrontCycle() | BF2ScheduleFront | protected |
lc_ | BF2ScheduleFront | private |
mightBeReady(MoveNode &n) override | BF2ScheduleFront | virtual |
mn_ | BF2ScheduleFront | private |
MoveNodeMap typedef | BF2ScheduleFront | |
needJumpGuard(const MoveNode &mn, int cycle) | BFOptimization | protected |
nodesToNotify_ | BF2ScheduleFront | private |
operator()() override | BF2ScheduleFront | virtual |
PathLengthCache typedef | BF2ScheduleFront | private |
pathLengthCache_ | BF2ScheduleFront | private |
postChildren_ | Reversible | protected |
preChildren_ | Reversible | protected |
prefResultCycle(const MoveNode &mn) | BF2ScheduleFront | static |
printFront(const TCEString &prefix) | BF2ScheduleFront | protected |
prologDDG() | BFOptimization | protected |
prologMoves_ | BFOptimization | protectedstatic |
prologRM() const | BFOptimization | protected |
putAlsoToPrologEpilog(int cycle, MoveNode &mn) | BFOptimization | protected |
requeueOtherMovesOfSameOp(MoveNode &mn) | BF2ScheduleFront | protected |
Reversible() | Reversible | inline |
RFReadPortCountPreventsScheduling(const MoveNode &mn) | BFOptimization | protected |
rm() const | BFOptimization | protected |
rmEC(int cycle, MoveNode &mn, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1) | BFOptimization | protectedvirtual |
rmLC(int cycle, MoveNode &mn, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1) | BFOptimization | protectedvirtual |
rootDDG() | BFOptimization | protected |
runChild(std::stack< Reversible * > &children, Reversible *child) | Reversible | protected |
runChild(Reversible *child, bool pre) | Reversible | protected |
runPostChild(Reversible *preChild) | Reversible | protected |
runPreChild(Reversible *preChild) | Reversible | protected |
sched_ | BFOptimization | protected |
scheduleFrontFromMove(MoveNode &mn) | BF2ScheduleFront | protected |
scheduleMove(MoveNode &move, BF2Scheduler::SchedulingLimits limits, bool allowEarlyBypass=true, bool allowLateBypass=true, bool allowEarlySharing=true) | BF2ScheduleFront | protected |
schedulingFront_ | BF2ScheduleFront | private |
selector() | BFOptimization | protected |
setJumpGuard(MoveNode &mn) | BFOptimization | protected |
setPrologDstFUAnno(MoveNode &prologMN, MoveNode &loopMN) | BFOptimization | protected |
setPrologFUAnnos(MoveNode &prologMN, MoveNode &loopMN) | BFOptimization | private |
setPrologSrcFUAnno(MoveNode &prologMN, MoveNode &loopMN) | BFOptimization | protected |
sourceFU(const MoveNode &mn) | BFOptimization | private |
targetMachine() const | BFOptimization | protected |
tryRevertEarlierBypass(MoveNode &mn) | BF2ScheduleFront | private |
tryToScheduleMoveOuter(MoveNode &mn, int &latestCycle) | BF2ScheduleFront | protected |
unassign(MoveNode &mn, bool disposePrologCopy=true) | BFOptimization | protectedvirtual |
unassignCopyFromPrologEpilog(MoveNode &mh, bool disposePrologCopy=true) | BFOptimization | private |
undidBypass(MoveNode &, MoveNode &dst) | BF2ScheduleFront | inline |
undo() | Reversible | virtual |
undoAndRemoveChildren(std::stack< Reversible * > &children) | Reversible | protected |
undoAndRemovePostChildren() | Reversible | protected |
undoAndRemovePreChildren() | Reversible | protected |
undoOnlyMe() override | BF2ScheduleFront | virtual |
unsetJumpGuard(MoveNode &mn) | BFOptimization | protected |
unsetJumpGuardIfNeeded(MoveNode &mn, int cycle) | BFOptimization | private |
usePrologMove(const MoveNode &mn) | BFOptimization | protected |
~Reversible() | Reversible | virtual |