OpenASIP  2.0
BFMergeAndKeepUser.hh
Go to the documentation of this file.
1 /*
2  Copyright (c) 2002-2020 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 BFMergeAndKeepUser.hh
26  *
27  * Declaration of scheduler operation which performs a bypass, including the
28  * ddg updates.
29  *
30  * @author Heikki Kultala 2020 (hkultala-no.spam-tuni.fi)
31  * @note rating: red
32  */
33 
34 
35 #include "BFOptimization.hh"
36 #include "TCEString.hh"
37 
38 class MoveNode;
39 class BF2Scheduler;
40 
42 public:
44  MoveNode& src,
45  MoveNode& mn,
46  bool force = false,
47  bool updatePrologMove = true) :
48  BFOptimization(sched), src_(src), dst_(mn),
49  force_(force),
50  updatePrologMove_(updatePrologMove),
52  bool operator()() override;
54 protected:
55  void undoOnlyMe() override;
56 
57  bool updateEdges(MoveNode* src, MoveNode* dst, bool loopBypass, bool pre);
58 
59 private:
62  bool force_;
66 };
MoveNode
Definition: MoveNode.hh:65
BFOptimization
Definition: BFOptimization.hh:73
BFMergeAndKeepUser::reg_
TCEString reg_
Definition: BFMergeAndKeepUser.hh:63
TCEString.hh
BFMergeAndKeepUser::force_
bool force_
Definition: BFMergeAndKeepUser.hh:62
BF2Scheduler
Definition: BF2Scheduler.hh:74
BFMergeAndKeepUser::updateEdges
bool updateEdges(MoveNode *src, MoveNode *dst, bool loopBypass, bool pre)
Definition: BFMergeAndKeepUser.cc:47
BFMergeAndKeepUser::~BFMergeAndKeepUser
~BFMergeAndKeepUser()
Definition: BFMergeAndKeepUser.hh:53
BFMergeAndKeepUser::undoOnlyMe
void undoOnlyMe() override
Definition: BFMergeAndKeepUser.cc:197
false
find Finds info of the inner loops in the false
Definition: InnerLoopFinder.cc:81
TCEString
Definition: TCEString.hh:53
BFMergeAndKeepUser::dst_
MoveNode & dst_
Definition: BFMergeAndKeepUser.hh:61
BFMergeAndKeepUser::updatePrologMove_
bool updatePrologMove_
Definition: BFMergeAndKeepUser.hh:64
BFMergeAndKeepUser::duplicatedSrc_
bool duplicatedSrc_
Definition: BFMergeAndKeepUser.hh:65
BFMergeAndKeepUser::src_
MoveNode & src_
Definition: BFMergeAndKeepUser.hh:60
BFMergeAndKeepUser::operator()
bool operator()() override
Definition: BFMergeAndKeepUser.cc:150
BFOptimization.hh
BFMergeAndKeepUser
Definition: BFMergeAndKeepUser.hh:41
BFMergeAndKeepUser::BFMergeAndKeepUser
BFMergeAndKeepUser(BF2Scheduler &sched, MoveNode &src, MoveNode &mn, bool force=false, bool updatePrologMove=true)
Definition: BFMergeAndKeepUser.hh:43