1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
/* ScummVM Tools
*
* ScummVM Tools is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "instruction.h"
#include "codegen.h"
#include "engine.h"
bool outputStackEffect = true;
void setOutputStackEffect(bool value) {
outputStackEffect = value;
}
bool Instruction::isJump() const {
return isCondJump() || isUncondJump();
}
bool Instruction::isCondJump() const {
return false;
}
bool Instruction::isUncondJump() const {
return false;
}
bool Instruction::isStackOp() const {
return false;
}
bool Instruction::isFuncCall() const {
return false;
}
bool Instruction::isReturn() const {
return false;
}
bool Instruction::isKernelCall() const {
return false;
}
bool Instruction::isLoad() const {
return false;
}
bool Instruction::isStore() const {
return false;
}
uint32 Instruction::getDestAddress() const {
throw WrongTypeException();
}
std::ostream &Instruction::print(std::ostream &output) const {
output << boost::format("%08x: %s") % _address % _name;
std::vector<ValuePtr>::const_iterator param;
for (param = _params.begin(); param != _params.end(); ++param) {
if (param != _params.begin())
output << ",";
output << " " << *param;
}
if (outputStackEffect)
output << boost::format(" (%d)") % _stackChange;
return output;
}
bool CondJumpInstruction::isCondJump() const {
return true;
}
bool UncondJumpInstruction::isUncondJump() const {
return true;
}
void UncondJumpInstruction::processInst(ValueStack &stack, Engine *engine, CodeGenerator *codeGen) {
}
bool StackInstruction::isStackOp() const {
return true;
}
bool CallInstruction::isFuncCall() const {
return true;
}
bool LoadInstruction::isLoad() const {
return true;
}
bool StoreInstruction::isStore() const {
return true;
}
void DupStackInstruction::processInst(ValueStack &stack, Engine *engine, CodeGenerator *codeGen) {
std::stringstream s;
ValuePtr p = stack.pop()->dup(s);
if (s.str().length() > 0)
codeGen->addOutputLine(s.str());
stack.push(p);
stack.push(p);
}
void BoolNegateStackInstruction::processInst(ValueStack &stack, Engine *engine, CodeGenerator *codeGen) {
stack.push(stack.pop()->negate());
}
void BinaryOpStackInstruction::processInst(ValueStack &stack, Engine *engine, CodeGenerator *codeGen) {
ValuePtr op1 = stack.pop();
ValuePtr op2 = stack.pop();
if (codeGen->_binOrder == kFIFOArgOrder)
stack.push(new BinaryOpValue(op2, op1, _codeGenData));
else if (codeGen->_binOrder == kLIFOArgOrder)
stack.push(new BinaryOpValue(op1, op2, _codeGenData));
}
bool ReturnInstruction::isReturn() const {
return true;
}
void ReturnInstruction::processInst(ValueStack &stack, Engine *engine, CodeGenerator *codeGen) {
codeGen->addOutputLine("return;");
}
void UnaryOpPrefixStackInstruction::processInst(ValueStack &stack, Engine *engine, CodeGenerator *codeGen) {
stack.push(new UnaryOpValue(stack.pop(), _codeGenData, false));
}
void UnaryOpPostfixStackInstruction::processInst(ValueStack &stack, Engine *engine, CodeGenerator *codeGen) {
stack.push(new UnaryOpValue(stack.pop(), _codeGenData, true));
}
void KernelCallStackInstruction::processInst(ValueStack &stack, Engine *engine, CodeGenerator *codeGen) {
codeGen->_argList.clear();
bool returnsValue = (_codeGenData.find("r") == 0);
std::string metadata = (!returnsValue ? _codeGenData : _codeGenData.substr(1));
for (size_t i = 0; i < metadata.length(); i++)
codeGen->processSpecialMetadata(this, metadata[i], i);
stack.push(new CallValue(_name, codeGen->_argList));
if (!returnsValue) {
std::stringstream stream;
stream << stack.pop() << ";";
codeGen->addOutputLine(stream.str());
}
}
bool KernelCallInstruction::isKernelCall() const {
return true;
}
|
