OpenASIP 2.2
Loading...
Searching...
No Matches
BFRescheduleSuccessorsClose.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 BFRescheduleSuccessorsClose.cc
27 *
28 * Definition of BFRescheduleSuccessorsClose class
29 *
30 * Tries to reschedule successors closer to a move.
31 *
32 * The guard can be removed, if the move has no side effects.
33 *
34 * @author Heikki Kultala 2014-2020(heikki.kultala-no.spam-tuni.fi)
35 * @note rating: red
36 */
37
41
43
44#ifdef DEBUG_BUBBLFISH_SCHEDULER
45 std::cerr << "\t\t\tRescheduling successors close" << std::endl;
46#endif
47 bool pushed = false;
48 auto succs = ddg().successors(mn_);
49 for (auto i: succs) {
50 if (i->isScheduled()) {
51 if (ddg().earliestCycle(*i) < i->cycle()) {
52 auto resched = new BFRescheduleResultClose(sched_, *i, 0);
53 pushed |= runPreChild(resched);
54 }
55 }
56 }
57 return pushed;
58}
BF2Scheduler & sched_
DataDependenceGraph & ddg()
virtual NodeSet successors(const Node &node, bool ignoreBackEdges=false, bool ignoreForwardEdges=false) const
int earliestCycle(const MoveNode &moveNode, unsigned int ii=UINT_MAX, bool ignoreRegWaRs=false, bool ignoreRegWaWs=false, bool ignoreGuards=false, bool ignoreFUDeps=false, bool ignoreSameOperationEdges=false, bool assumeBypassing=false) const
bool runPreChild(Reversible *preChild)