OpenASIP  2.0
BFDRELate.cc
Go to the documentation of this file.
1 /*
2  Copyright (c) 2002-2014 Tampere University.
3 
4  This file is part of TTA-Based Codesign Environment (TCE).
5 
6  Permission is hereby granted, free of charge, to any person obtaining a
7  copy of this software and associated documentation files (the "Software"),
8  to deal in the Software without restriction, including without limitation
9  the rights to use, copy, modify, merge, publish, distribute, sublicense,
10  and/or sell copies of the Software, and to permit persons to whom the
11  Software is furnished to do so, subject to the following conditions:
12 
13  The above copyright notice and this permission notice shall be included in
14  all copies or substantial portions of the Software.
15 
16  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19  THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
21  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
22  DEALINGS IN THE SOFTWARE.
23  */
24 
25 /**
26  * @file BFDRELate.cc
27  *
28  * Definition of BFDRELate class
29  *
30  * Performs a dead-result elimination after a late bypass.
31  *
32  * @author Heikki Kultala 2014-2020(heikki.kultala-no.spam-tuni.fi)
33  * @note rating: red
34  */
35 
36 #include "BFDRELate.hh"
37 #include "DataDependenceGraph.hh"
38 #include "BF2Scheduler.hh"
39 #include "Machine.hh"
40 
41 bool
43  if (!sched_.killDeadResults() && !targetMachine().alwaysWriteResults()) {
44  return false;
45  }
46 
47  if (!ddg().resultUsed(mn_)) {
48 
49  // Take the predecssors of the dre'd src because their
50  // antideps may change
52 
53  createdEdges_ = ddg().copyDepsOver(mn_, true, false);
55  ddg().dropNode(mn_);
57 
58  // now mark antideps sources to be notified
59  for (auto n: pred) {
60  mightBeReady(*n);
61  }
62 
63 #ifdef DEBUG_BUBBLEFISH_SCHEDULER
64  std::cerr << "\t\t\tLate DRE ok: " << mn_.toString() << std::endl;
65 #endif
66  return true;
67  } else {
68  return false;
69  }
70 }
BoostGraph::predecessors
virtual NodeSet predecessors(const Node &node, bool ignoreBackEdges=false, bool ignoreForwardEdges=false) const
MoveNode::toString
std::string toString() const
Definition: MoveNode.cc:576
BFKillNode::createdEdges_
DataDependenceGraph::EdgeSet createdEdges_
Definition: BFKillNode.hh:51
BF2Scheduler::killDeadResults
bool killDeadResults() const
Definition: BF2Scheduler.hh:110
BoostGraph< MoveNode, DataDependenceEdge >::NodeSet
std::set< MoveNode *, typename MoveNode ::Comparator > NodeSet
Definition: BoostGraph.hh:86
DataDependenceGraph.hh
BoostGraph::dropNode
virtual void dropNode(Node &node)
BFOptimization::targetMachine
const TTAMachine::Machine & targetMachine() const
Definition: BFOptimization.cc:81
BFOptimization::sched_
BF2Scheduler & sched_
Definition: BFOptimization.hh:103
assert
#define assert(condition)
Definition: Application.hh:86
BF2Scheduler.hh
BFDRELate::operator()
virtual bool operator()()
Definition: BFDRELate.cc:42
BF2Scheduler::nodeAndCopyKilled
void nodeAndCopyKilled(MoveNode &mn)
Definition: BF2Scheduler.cc:803
BFOptimization::ddg
DataDependenceGraph & ddg()
Definition: BFOptimization.cc:70
Machine.hh
BFDRELate.hh
BFKillNode::mn_
MoveNode & mn_
Definition: BFKillNode.hh:52
MoveNode::isScheduled
bool isScheduled() const
Definition: MoveNode.cc:409
DataDependenceGraph::copyDepsOver
EdgeSet copyDepsOver(MoveNode &node, bool anti, bool raw)
Definition: DataDependenceGraph.cc:2422
BFOptimization::mightBeReady
virtual void mightBeReady(MoveNode &mn)
Definition: BFOptimization.cc:953