OpenASIP
2.0
src
applibs
Scheduler
Algorithms
BFLateBypass.hh
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 BFLateBypass.hh
27
*
28
* Declaration of BFLateBypass class
29
*
30
* Performs a bypass of noy-yet-scheduled result into already scheduled
31
* use of the value.
32
*
33
* @author Heikki Kultala 2014-2020(heikki.kultala-no.spam-tuni.fi)
34
* @note rating: red
35
*/
36
37
#ifndef BF_LATE_BYPASS_HH
38
#define BF_LATE_BYPASS_HH
39
40
#include "
BFOptimization.hh
"
41
42
class
MoveNode
;
43
namespace
TTAMachine
{
44
class
Bus;
45
}
46
47
class
BFLateBypass
:
public
BFOptimization
{
48
public
:
49
BFLateBypass
(
BF2Scheduler
& sched,
MoveNode
& src,
MoveNode
& dst,
int
lc) :
50
BFOptimization
(sched),
51
src_
(src),
dst_
(dst),
lc_
(lc),
prologBus_
(NULL) {}
52
53
virtual
bool
operator()
();
54
virtual
void
undoOnlyMe
();
55
protected
:
56
int
originalCycle_
;
57
MoveNode
&
src_
;
58
MoveNode
&
dst_
;
59
int
lc_
;
60
const
TTAMachine::Bus
*
originalBus_
;
61
const
TTAMachine::Bus
*
prologBus_
;
62
};
63
64
#endif
BFLateBypass::lc_
int lc_
Definition:
BFLateBypass.hh:59
BFLateBypass::BFLateBypass
BFLateBypass(BF2Scheduler &sched, MoveNode &src, MoveNode &dst, int lc)
Definition:
BFLateBypass.hh:49
TTAMachine::Bus
Definition:
Bus.hh:53
MoveNode
Definition:
MoveNode.hh:65
BFOptimization
Definition:
BFOptimization.hh:73
BFLateBypass::dst_
MoveNode & dst_
Definition:
BFLateBypass.hh:58
BFLateBypass::prologBus_
const TTAMachine::Bus * prologBus_
Definition:
BFLateBypass.hh:61
BFLateBypass::operator()
virtual bool operator()()
Definition:
BFLateBypass.cc:59
BF2Scheduler
Definition:
BF2Scheduler.hh:74
BFLateBypass::originalCycle_
int originalCycle_
Definition:
BFLateBypass.hh:56
BFLateBypass::src_
MoveNode & src_
Definition:
BFLateBypass.hh:57
BFLateBypass::undoOnlyMe
virtual void undoOnlyMe()
Definition:
BFLateBypass.cc:161
TTAMachine
Definition:
Assembler.hh:48
BFLateBypass
Definition:
BFLateBypass.hh:47
BFOptimization.hh
BFLateBypass::originalBus_
const TTAMachine::Bus * originalBus_
Definition:
BFLateBypass.hh:60
Generated by
1.8.17