OpenASIP  2.0
BFUnscheduleMove.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 BFUnscheduleMove.cc
27  *
28  * Definition of BFUnscheduleMove class
29  *
30  * Unschedules a move.
31  *
32  * @author Heikki Kultala 2014-2020(heikki.kultala-no.spam-tuni.fi)
33  * @note rating: red
34  */
35 
36 #include "BFUnscheduleMove.hh"
37 #include "Move.hh"
38 #include "DataDependenceGraph.hh"
39 #include "Bus.hh"
40 #include "POMDisassembler.hh"
41 #include "SimpleResourceManager.hh"
42 #include "Instruction.hh"
43 #include "MoveNodeDuplicator.hh"
44 #include "Terminal.hh"
45 #include "BF2Scheduler.hh"
46 
48  oldCycle_ = mn_.cycle();
49  oldBus_ = &mn_.move().bus();
50 
51  if (mn_.isSourceOperation()) {
53  }
54 
57  }
58 
59  if (mn_.move().source().isImmediateRegister()) {
63  }
64 
65  MoveNode* prologMN = ii() ? duplicator().getMoveNode(mn_) : NULL;
66  if (prologMN != NULL) {
67  prologBus_ = &prologMN->move().bus();
68 
69  if (prologMN->move().source().isImmediateRegister()) {
71  }
72 
73 #ifdef DEBUG_BUBBLEFISH_SCHEDULER
74  std::cerr << "\t\t\t\tProlog move: " << prologMN->toString() << std::endl;
75  std::cerr << "\t\t\t\tBFUnscheduleMove Saving prolog bus: " << prologBus_->name() << " cycle: " << oldCycle_ << std::endl;
76 #endif
77  }
78 #ifdef DEBUG_BUBBLEFISH_SCHEDULER
79  for (int i = 0; i < recurseCounter_*2; i++)
80  std::cerr << "\t";
81 
82  std::cerr << "\t\tUnscheduling original: " << mn_.toString() << " bus: " << oldBus_->name() << std::endl;
83 #endif
84  unassign(mn_, false);
85 #ifdef DEBUG_BUBBLEFISH_SCHEDULER
88  for (int i = 0; i < recurseCounter_*2; i++)
89  std::cerr << "\t";
90 
91  std::cerr << "\t\tCannot assign to old cycle: " << mn_.toString()
92  << " old cycle: " << oldCycle_ << std::endl;
93  ddg().writeToDotFile("cannot_assign_old_cycle.dot");
94  if (mn_.isSourceOperation()) {
95  std::cerr << "\t\twhole src PO: " << mn_.sourceOperation().toString()
96  << std::endl;
97  }
99  std::cerr << "\t\twhole dst PO: " << mn_.destinationOperation().toString()
100  << std::endl;
101  }
102  assert(false);
103  }
104 #endif
105 }
106 
108 #ifdef DEBUG_BUBBLEFISH_SCHEDULER
109  for (int i = 0; i < recurseCounter_*2; i++)
110  std::cerr << "\t";
111 
112  std::cerr << "\t\treturning original: " << mn_.toString() << " current bus: "
113  << mn_.move().bus().name() << " old bus: " << oldBus_->name()
114  << " cycle: " << oldCycle_ << std::endl;
115 #endif
116 
117 #ifdef DEBUG_BUBBLEFISH_SCHEDULER
120  immRegIndex_, true)) {
121  std::cerr << "Cannot return to old cycle: " << mn_.toString() << " cycle: " << oldCycle_ << std::endl;
122  if (mn_.isDestinationOperation()) {
123  std::cerr << "dstPO: " << mn_.destinationOperation().toString() << std::endl;
124  }
125  if (mn_.isSourceOperation()) {
126  std::cerr << "srcPO: " << mn_.sourceOperation().toString() << std::endl;
127  }
128  std::cerr << "Original bus: " << oldBus_->name() << std::endl;
129  ddg().writeToDotFile("cannot_return_old_cycle.dot");
131  for (int i = 0; i < ins->moveCount(); i++) {
132  std::cerr << "\t" << POMDisassembler::disassemble(ins->move(i))
133  << " bus: " << ins->move(i).bus().name()
134  << std::endl;
135  }
136  std::cerr << "ins contains " << ins->immediateCount() << " immediates." << std::endl;
137  assert(false);
138  }
139 #endif
142 }
143 
145 #ifdef DEBUG_BUBBLEFISH_SCHEDULER
146  std::cerr << "BFUnscheudleMove undo" << std::endl;
147 #endif
148  returnOriginal();
149 }
150 
151 bool
154  return true;
155 }
156 
SimpleResourceManager::immediateWriteCycle
virtual int immediateWriteCycle(const MoveNode &) const
Definition: SimpleResourceManager.cc:520
BFOptimization::unassign
virtual void unassign(MoveNode &mn, bool disposePrologCopy=true)
Definition: BFOptimization.cc:196
BFUnscheduleMove.hh
BFOptimization::assign
virtual bool assign(int cycle, MoveNode &, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU_=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1, bool ignoreGuardWriteCycle=false)
Definition: BFOptimization.cc:103
TTAMachine::Component::name
virtual TCEString name() const
Definition: MachinePart.cc:125
BFOptimization::duplicator
MoveNodeDuplicator & duplicator() const
Definition: BFOptimization.cc:87
MoveNode::toString
std::string toString() const
Definition: MoveNode.cc:576
BFUnscheduleMove::oldBus_
const TTAMachine::Bus * oldBus_
Definition: BFUnscheduleMove.hh:63
TTAProgram::Instruction::move
Move & move(int i) const
Definition: Instruction.cc:193
TTAProgram::Terminal::index
virtual int index() const
Definition: Terminal.cc:274
BFUnscheduleMove::operator()
bool operator()()
Definition: BFUnscheduleMove.cc:152
MoveNode::isDestinationOperation
bool isDestinationOperation() const
BFOptimization::ii
unsigned int ii() const
Definition: BFOptimization.cc:85
TTAProgram::Instruction
Definition: Instruction.hh:57
BFUnscheduleMove::returnOriginal
void returnOriginal()
Definition: BFUnscheduleMove.cc:107
TTAProgram::Move::destination
Terminal & destination() const
Definition: Move.cc:323
TTAProgram::Move::bus
const TTAMachine::Bus & bus() const
Definition: Move.cc:373
DataDependenceGraph.hh
MoveNode
Definition: MoveNode.hh:65
BFUnscheduleMove::dstFU_
const TTAMachine::FunctionUnit * dstFU_
Definition: BFUnscheduleMove.hh:67
BFUnscheduleMove::undoOnlyMe
void undoOnlyMe()
Definition: BFUnscheduleMove.cc:144
Terminal.hh
BFUnscheduleMove::oldCycle_
int oldCycle_
Definition: BFUnscheduleMove.hh:62
BFUnscheduleMove::mn_
MoveNode & mn_
Definition: BFUnscheduleMove.hh:61
POMDisassembler.hh
BFUnscheduleMove::oldImmWriteCycle_
int oldImmWriteCycle_
Definition: BFUnscheduleMove.hh:65
MoveNode::sourceOperation
ProgramOperation & sourceOperation() const
Definition: MoveNode.cc:453
assert
#define assert(condition)
Definition: Application.hh:86
TTAProgram::Terminal::isImmediateRegister
virtual bool isImmediateRegister() const
Definition: Terminal.cc:97
MoveNode::cycle
int cycle() const
Definition: MoveNode.cc:421
BFOptimization::prologRM
SimpleResourceManager * prologRM() const
Definition: BFOptimization.cc:77
BF2Scheduler.hh
Instruction.hh
BFUnscheduleMove::recurseCounter_
static int recurseCounter_
Definition: BFUnscheduleMove.hh:71
MoveNode::isSourceOperation
bool isSourceOperation() const
Definition: MoveNode.cc:168
TTAProgram::Terminal::immediateUnit
virtual const TTAMachine::ImmediateUnit & immediateUnit() const
Definition: Terminal.cc:240
BFOptimization::ddg
DataDependenceGraph & ddg()
Definition: BFOptimization.cc:70
Bus.hh
BFOptimization::rm
SimpleResourceManager & rm() const
Definition: BFOptimization.cc:76
BFUnscheduleMove::immu_
const TTAMachine::ImmediateUnit * immu_
Definition: BFUnscheduleMove.hh:69
MoveNodeDuplicator.hh
GraphBase::writeToDotFile
virtual void writeToDotFile(const TCEString &fileName) const
TTAProgram::Terminal::functionUnit
virtual const TTAMachine::FunctionUnit & functionUnit() const
Definition: Terminal.cc:251
MoveNodeDuplicator::getMoveNode
MoveNode * getMoveNode(MoveNode &mn)
Definition: MoveNodeDuplicator.cc:85
MoveNode::destinationOperation
ProgramOperation & destinationOperation(unsigned int index=0) const
BFUnscheduleMove::unscheduleOriginal
void unscheduleOriginal()
Definition: BFUnscheduleMove.cc:47
MoveNode::move
TTAProgram::Move & move()
ProgramOperation::toString
std::string toString() const
Definition: ProgramOperation.cc:746
POMDisassembler::disassemble
static std::string disassemble(const TTAProgram::Move &move)
Definition: POMDisassembler.cc:629
BFUnscheduleMove::prologBus_
const TTAMachine::Bus * prologBus_
Definition: BFUnscheduleMove.hh:64
BFUnscheduleMove::immRegIndex_
int immRegIndex_
Definition: BFUnscheduleMove.hh:70
TTAProgram::Instruction::immediateCount
int immediateCount() const
Definition: Instruction.cc:267
SimpleResourceManager.hh
TTAProgram::Move::source
Terminal & source() const
Definition: Move.cc:302
BFUnscheduleMove::srcFU_
const TTAMachine::FunctionUnit * srcFU_
Definition: BFUnscheduleMove.hh:68
Move.hh
BFOptimization::canAssign
virtual bool canAssign(int cycle, MoveNode &mn, const TTAMachine::Bus *bus=nullptr, const TTAMachine::FunctionUnit *srcFU=nullptr, const TTAMachine::FunctionUnit *dstFU=nullptr, const TTAMachine::Bus *prologBus=nullptr, int immWriteCycle=-1, int prologImmWriteCycle=-1, const TTAMachine::ImmediateUnit *immu=nullptr, int immRegIndex=-1, bool ignoreGWN=false)
Definition: BFOptimization.cc:495
TTAProgram::Instruction::moveCount
int moveCount() const
Definition: Instruction.cc:176
BFUnscheduleMove::prologImmWriteCycle_
int prologImmWriteCycle_
Definition: BFUnscheduleMove.hh:66
SimpleResourceManager::instruction
virtual TTAProgram::Instruction * instruction(int cycle) const override
Definition: SimpleResourceManager.cc:442