OpenASIP
2.0
|
This is the complete list of members for BFDREEarly, including all inherited members.
addJumpGuardIfNeeded(MoveNode &mn, int cycle, bool ignoreGuardWriteCycle=false) | BFOptimization | private |
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 |
BFDREEarly(BF2Scheduler &sched, MoveNode &mn) | BFDREEarly | inline |
BFKillNode(BF2Scheduler &sched, MoveNode &mn) | BFKillNode | inline |
BFOptimization(BF2Scheduler &sched) | BFOptimization | inline |
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 |
createCopyForPrologEpilog(MoveNode &mn) | BFOptimization | private |
createdEdges_ | BFKillNode | protected |
ddg() | BFOptimization | protected |
ddg() const | BFOptimization | protected |
deleteChildren(std::stack< Reversible * > &children) | Reversible | |
destinationFU(const MoveNode &mn) | BFOptimization | private |
duplicator() const | BFOptimization | protected |
fuOfTerminal(const TTAProgram::Terminal &t) | BFOptimization | private |
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 |
immCountPreventsScheduling(const MoveNode &mn) | BFOptimization | protected |
isFinishFront() | BFOptimization | inlinevirtual |
jumpGuardAvailableCycle(const MoveNode &mn) | BFOptimization | protected |
mightBeReady(MoveNode &mn) | BFOptimization | virtual |
mn_ | BFKillNode | protected |
needJumpGuard(const MoveNode &mn, int cycle) | BFOptimization | protected |
operator()() | BFDREEarly | virtual |
postChildren_ | Reversible | protected |
preChildren_ | Reversible | protected |
prologDDG() | BFOptimization | protected |
prologMoves_ | BFOptimization | protectedstatic |
prologRM() const | BFOptimization | protected |
putAlsoToPrologEpilog(int cycle, MoveNode &mn) | BFOptimization | 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 |
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 |
unassign(MoveNode &mn, bool disposePrologCopy=true) | BFOptimization | protectedvirtual |
unassignCopyFromPrologEpilog(MoveNode &mh, bool disposePrologCopy=true) | BFOptimization | private |
undo() | Reversible | virtual |
undoAndRemoveChildren(std::stack< Reversible * > &children) | Reversible | protected |
undoAndRemovePostChildren() | Reversible | protected |
undoAndRemovePreChildren() | Reversible | protected |
undoOnlyMe() | BFKillNode | virtual |
unsetJumpGuard(MoveNode &mn) | BFOptimization | protected |
unsetJumpGuardIfNeeded(MoveNode &mn, int cycle) | BFOptimization | private |
usePrologMove(const MoveNode &mn) | BFOptimization | protected |
~Reversible() | Reversible | virtual |