OpenASIP  2.0
Public Member Functions | Private Attributes | List of all members
BFRemoveGuardsFromSuccs Class Reference

#include <BFRemoveGuardsFromSuccs.hh>

Inheritance diagram for BFRemoveGuardsFromSuccs:
Inheritance graph
Collaboration diagram for BFRemoveGuardsFromSuccs:
Collaboration graph

Public Member Functions

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

Private Attributes

MoveNode & guardWrite_
 
int oldLC_
 
int maxLC_
 

Additional Inherited Members

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

Detailed Description

Definition at line 45 of file BFRemoveGuardsFromSuccs.hh.

Constructor & Destructor Documentation

◆ BFRemoveGuardsFromSuccs()

BFRemoveGuardsFromSuccs::BFRemoveGuardsFromSuccs ( BF2Scheduler &  sched,
MoveNode &  guardWrite,
int  oldLC,
int  maxLC 
)
inline

Definition at line 47 of file BFRemoveGuardsFromSuccs.hh.

48  :
49  BFOptimization(sched),
50  guardWrite_(guardWrite), oldLC_(oldLC), maxLC_(maxLC) {}

Member Function Documentation

◆ operator()()

bool BFRemoveGuardsFromSuccs::operator() ( )
overridevirtual

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

Implements Reversible.

Definition at line 45 of file BFRemoveGuardsFromSuccs.cc.

45  {
46 
47  DataDependenceGraph::EdgeSet outEdges = ddg().outEdges(guardWrite_);
48 
49 // std::list<BFRemoveGuardFromSucc*> guardRemoves;
50  std::list<MoveNode*> guardRemoveNodes;
51 
52  for (auto e: outEdges) {
53  if (e->guardUse() &&
54  e->dependenceType() == DataDependenceEdge::DEP_RAW) {
55  MoveNode& head = ddg().headNode(*e);
56  if (head.move().isUnconditional()) {
57  std::cerr << "guard edge to uncond move?" << head.toString()
58  << std::endl;
59  continue;
60  }
61  if (head.isScheduled()) {
62  // this is not in critical path.
63  int cycle = head.cycle();
64  if (cycle > maxLC_ + head.guardLatency()) {
65  continue;
66  } else {
67  if (canBeSpeculated(head)) {
68  guardRemoveNodes.push_back(&head);
69  } else {
70  maxLC_ = std::min(
71  maxLC_, head.cycle() - head.guardLatency());
72  continue;
73  }
74  }
75  }
76  }
77  }
78 
79  for (auto i: guardRemoveNodes) {
80  MoveNode& mn = *i;
81  if (mn.cycle() - mn.guardLatency() < maxLC_) {
82  runPostChild(new BFRemoveGuardFromSucc(sched_, mn));
83  }
84  }
85  if (postChildren_.empty()) {
86  return false;
87  }
88 
89  // if could not improve schedule, return everything back the way it was
90  int ddglc = ddg().latestCycle(guardWrite_, ii(), false, false);
91  int rmlc = rm().latestCycle(ddglc, guardWrite_);
92  if (rmlc <= oldLC_) {
93  undo();
94  return false;
95  }
96 
97  return true;
98 }

References BFOptimization::canBeSpeculated(), MoveNode::cycle(), BFOptimization::ddg(), DataDependenceEdge::DEP_RAW, MoveNode::guardLatency(), guardWrite_, BoostGraph< GraphNode, GraphEdge >::headNode(), BFOptimization::ii(), MoveNode::isScheduled(), TTAProgram::Move::isUnconditional(), SimpleResourceManager::latestCycle(), DataDependenceGraph::latestCycle(), maxLC_, MoveNode::move(), oldLC_, BoostGraph< GraphNode, GraphEdge >::outEdges(), Reversible::postChildren_, BFOptimization::rm(), Reversible::runPostChild(), BFOptimization::sched_, MoveNode::toString(), and Reversible::undo().

Here is the call graph for this function:

Member Data Documentation

◆ guardWrite_

MoveNode& BFRemoveGuardsFromSuccs::guardWrite_
private

Definition at line 53 of file BFRemoveGuardsFromSuccs.hh.

Referenced by operator()().

◆ maxLC_

int BFRemoveGuardsFromSuccs::maxLC_
private

Definition at line 55 of file BFRemoveGuardsFromSuccs.hh.

Referenced by operator()().

◆ oldLC_

int BFRemoveGuardsFromSuccs::oldLC_
private

Definition at line 54 of file BFRemoveGuardsFromSuccs.hh.

Referenced by operator()().

The documentation for this class was generated from the following files:
Reversible::postChildren_
std::stack< Reversible * > postChildren_
Definition: Reversible.hh:58
BFRemoveGuardsFromSuccs::maxLC_
int maxLC_
Definition: BFRemoveGuardsFromSuccs.hh:55
MoveNode::toString
std::string toString() const
Definition: MoveNode.cc:576
BoostGraph::headNode
virtual Node & headNode(const Edge &edge) const
BFOptimization::ii
unsigned int ii() const
Definition: BFOptimization.cc:85
TTAProgram::Move::isUnconditional
bool isUnconditional() const
Definition: Move.cc:154
MoveNode
Definition: MoveNode.hh:65
BFOptimization::sched_
BF2Scheduler & sched_
Definition: BFOptimization.hh:103
BFOptimization::canBeSpeculated
bool canBeSpeculated(const Operation &op)
Definition: BFOptimization.cc:857
MoveNode::cycle
int cycle() const
Definition: MoveNode.cc:421
MoveNode::guardLatency
int guardLatency() const
Definition: MoveNode.cc:779
BoostGraph< MoveNode, DataDependenceEdge >::EdgeSet
std::set< DataDependenceEdge *, typename DataDependenceEdge ::Comparator > EdgeSet
Definition: BoostGraph.hh:87
DataDependenceEdge::DEP_RAW
@ DEP_RAW
Definition: DataDependenceEdge.hh:47
Reversible::undo
virtual void undo()
Definition: Reversible.cc:69
BFRemoveGuardFromSucc
Definition: BFRemoveGuardFromSucc.hh:54
BFRemoveGuardsFromSuccs::oldLC_
int oldLC_
Definition: BFRemoveGuardsFromSuccs.hh:54
BFOptimization::ddg
DataDependenceGraph & ddg()
Definition: BFOptimization.cc:70
BFOptimization::rm
SimpleResourceManager & rm() const
Definition: BFOptimization.cc:76
BFOptimization::BFOptimization
BFOptimization(BF2Scheduler &sched)
Definition: BFOptimization.hh:75
BoostGraph::outEdges
virtual EdgeSet outEdges(const Node &node) const
MoveNode::move
TTAProgram::Move & move()
BFRemoveGuardsFromSuccs::guardWrite_
MoveNode & guardWrite_
Definition: BFRemoveGuardsFromSuccs.hh:53
SimpleResourceManager::latestCycle
virtual int latestCycle(MoveNode &node, const TTAMachine::Bus *bus=NULL, const TTAMachine::FunctionUnit *srcFU=NULL, const TTAMachine::FunctionUnit *dstFU=NULL, int immWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1) const override
Definition: SimpleResourceManager.cc:349
MoveNode::isScheduled
bool isScheduled() const
Definition: MoveNode.cc:409
Reversible::runPostChild
bool runPostChild(Reversible *preChild)
Definition: Reversible.cc:139
DataDependenceGraph::latestCycle
int latestCycle(const MoveNode &moveNode, unsigned int ii=UINT_MAX, bool ignoreRegAntideps=false, bool ignoreUnscheduledSuccessors=true, bool ignoreGuards=false, bool ignoreFUDeps=false, bool ignoreSameOperationEdges=false) const
Definition: DataDependenceGraph.cc:543
Generated by   doxygen 1.8.17