OpenASIP
2.0
src
applibs
Scheduler
Algorithms
BFRemoveEdge.cc
Go to the documentation of this file.
1
/*
2
Copyright (c) 2002-2018 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
* @file BFRemoveEdge.hh
26
*
27
* Definition of BF framework operation which removes a ddg edge.
28
*
29
* @author Heikki Kultala 2018-2020 (heikki.kultala-no.spam-tut.fi)
30
* @note rating: red
31
*/
32
33
#include "
BFRemoveEdge.hh
"
34
#include "
DataDependenceGraph.hh
"
35
36
BFRemoveEdge::BFRemoveEdge
(
37
BF2Scheduler
& sched,
38
MoveNode
& nTail,
MoveNode
& nHead,
39
DataDependenceEdge
& e) :
40
BFOptimization
(sched), e_(e), nTail_(nTail), nHead_(nHead) {}
41
42
bool
BFRemoveEdge::operator()
() {
43
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
44
std::cerr <<
"\t\t\t\tRemoving edge: "
<<
e_
.
toString
()
45
<<
" from: "
<<
nTail_
.
toString
()
46
<<
" to: "
<<
nHead_
.
toString
() << std::endl;
47
#endif
48
ddg
().
rootGraph
()->
removeEdge
(
e_
);
49
return
true
;
50
}
51
52
void
BFRemoveEdge::undoOnlyMe
() {
53
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
54
std::cerr <<
"\t\t\t\tRestoring edge: "
<<
e_
.
toString
()
55
<<
" from: "
<<
nTail_
.
toString
()
56
<<
" to: "
<<
nHead_
.
toString
() << std::endl;
57
#endif
58
59
ddg
().
rootGraph
()->
connectNodes
(
nTail_
,
nHead_
,
e_
);
60
#ifdef DEBUG_BUBBLEFISH_SCHEDULER
61
std::cerr <<
"\t\t\t\tRestored edge."
<< std::endl;
62
#endif
63
}
64
65
BFRemoveEdge::~BFRemoveEdge
() {}
66
BFRemoveEdge::nHead_
MoveNode & nHead_
Definition:
BFRemoveEdge.hh:55
BoostGraph::connectNodes
virtual void connectNodes(const Node &nTail, const Node &nHead, Edge &e)
BoostGraph::removeEdge
virtual void removeEdge(Edge &e)
MoveNode::toString
std::string toString() const
Definition:
MoveNode.cc:576
BFRemoveEdge::nTail_
MoveNode & nTail_
Definition:
BFRemoveEdge.hh:54
DataDependenceGraph.hh
MoveNode
Definition:
MoveNode.hh:65
BFOptimization
Definition:
BFOptimization.hh:73
BFRemoveEdge::e_
DataDependenceEdge & e_
Definition:
BFRemoveEdge.hh:53
BFRemoveEdge::BFRemoveEdge
BFRemoveEdge(BF2Scheduler &sched, MoveNode &nTail, MoveNode &nHead, DataDependenceEdge &e)
Definition:
BFRemoveEdge.cc:36
BFRemoveEdge.hh
BoostGraph::rootGraph
BoostGraph * rootGraph()
BFRemoveEdge::~BFRemoveEdge
virtual ~BFRemoveEdge()
Definition:
BFRemoveEdge.cc:65
BF2Scheduler
Definition:
BF2Scheduler.hh:74
DataDependenceEdge::toString
TCEString toString() const
Definition:
DataDependenceEdge.cc:201
BFOptimization::ddg
DataDependenceGraph & ddg()
Definition:
BFOptimization.cc:70
BFRemoveEdge::undoOnlyMe
void undoOnlyMe() override
Definition:
BFRemoveEdge.cc:52
DataDependenceEdge
Definition:
DataDependenceEdge.hh:43
BFRemoveEdge::operator()
bool operator()() override
Definition:
BFRemoveEdge.cc:42
Generated by
1.8.17