This repository has been archived by the owner on Oct 30, 2023. It is now read-only.
forked from Gaomengkai/Vrabche
-
Notifications
You must be signed in to change notification settings - Fork 0
/
IRUtils.cpp
412 lines (388 loc) · 12.3 KB
/
IRUtils.cpp
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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
//
// Created by gao on 6/29/23.
//
#include "IRUtils.h"
#include "IRLogger.h"
namespace IRCtrl
{
int IRCtrl::Utils::parseInteger(const std::string& str)
{
if (str.empty()) { throw std::invalid_argument("Empty string"); }
size_t startPos = 0;
int base = 10;
if (str.size() > 2 && (str.substr(0, 2) == "0x" || str.substr(0, 2) == "0X")) {
startPos = 2;
base = 16;
} else if (str[0] == '0') {
startPos = 1;
base = 8;
}
try {
size_t pos = 0;
int num = std::stoi(str.substr(startPos), &pos, base);
// Check Invalid Chars
if (pos != str.size() - startPos) {
throw std::invalid_argument("Invalid characters in the string");
}
return num;
} catch (const std::exception& e) {
throw std::invalid_argument("Failed to parse the integer");
}
}
int Utils::tryParseInteger(const std::string& str)
{
int a = 0;
try {
a = parseInteger(str);
} catch (const std::invalid_argument& e) {
float f = std::strtof(str.c_str(), nullptr);
a = (int)f;
}
return a;
}
/// Do a calc between 2 literal/const number
/// \param a
/// \param b
/// \param op
/// \return
std::shared_ptr<CVal>
Utils::constBiCalc(const std::shared_ptr<CVal>& a, const std::shared_ptr<CVal>& b, IRValOp op)
{
auto af = std::dynamic_pointer_cast<FloatCVal>(a);
auto ai = std::dynamic_pointer_cast<IntCVal>(a);
auto bf = std::dynamic_pointer_cast<FloatCVal>(b);
auto bi = std::dynamic_pointer_cast<IntCVal>(b);
bool isResFloat = false;
isResFloat = (af != nullptr) || (bf != nullptr);
if (isResFloat) {
auto res = std::make_shared<FloatCVal>("");
float _a, _b;
if (af != nullptr)
_a = af->fVal;
else
_a = (float)ai->iVal;
if (bf != nullptr)
_b = bf->fVal;
else
_b = (float)bi->iVal;
res->fVal = FLOP(_a, _b, op);
return res;
} else {
int _a, _b;
_a = ai->iVal;
_b = bi->iVal;
auto res = std::make_shared<IntCVal>("");
res->iVal = T1OP(_a, _b, op);
return res;
}
}
/// Get access to a CArr
/// \param arr_
/// \param pos
/// \param shape
/// \return a l-value ref of CVal. use auto& to receive the return
inline shared_ptr<CVal>& getValInACArrRef(
const shared_ptr<CArr>& arr_, const std::deque<size_t>& pos, const std::deque<size_t>& shape
)
{
shared_ptr<CArr> arr = arr_;
auto subArrShape = shape;
// init for first to last-1 dim. because last-1 is CVal not CArr.
for (auto p = 0; p < pos.size() - 1; p++) {
// init
if (arr->_childArrs.empty()) {
arr->_shape = subArrShape;
for (auto i = 0; i < arr->_shape.front(); i++) {
arr->witch.emplace_back(CArr::ZERO);
arr->_childVals.emplace_back(nullptr);
arr->_childArrs.emplace_back(nullptr);
}
}
arr->isZero = false;
// insert
if (arr->_childArrs[pos[p]] == nullptr) {
arr->_childArrs[pos[p]] = make_shared<CArr>("", arr->containedType);
}
arr->witch[pos[p]] = CArr::CARR;
arr = arr->_childArrs[pos[p]]; // attention
subArrShape.pop_front();
}
// last layer (CVal)
if (arr->_childArrs.empty()) {
arr->_shape = subArrShape;
for (auto i = 0; i < arr->_shape.back(); i++) {
arr->witch.emplace_back(CArr::ZERO);
arr->_childVals.emplace_back(nullptr);
arr->_childArrs.emplace_back(nullptr);
}
}
arr->isZero = false;
if (arr->_childVals[pos.back()] == nullptr) {
if (arr->containedType == IRValType::Int) {
arr->_childVals[pos.back()] = make_shared<IntCVal>("");
} else if (arr->containedType == IRValType::Float) {
arr->_childVals[pos.back()] = make_shared<FloatCVal>("");
}
}
arr->witch[pos.back()] = CArr::CVAL;
return arr->_childVals[pos.back()];
}
/// According to shape, add N to cur.
/// \param shape [2][3]
/// \param cur [1][2]
/// \param N
/// \param startsAt
/// \param reset
void ArrayPosPlusN(
const std::deque<size_t>& shape,
std::deque<size_t>& cur,
size_t N,
int startsAt = -1,
bool reset = true
)
{
if (startsAt == -1) startsAt = shape.size() - 1;
for (int i = startsAt; i >= 0; --i) { // ATTENTION!!!!!!!!
cur[i] += N;
if (cur[i] < shape[i]) { break; }
N = cur[i] / shape[i];
cur[i] %= shape[i];
}
if (reset) {
for (int i = startsAt + 1; i < shape.size(); ++i) { cur[i] = 0; }
}
}
shared_ptr<CVal> makeSureType(IRValType ty_, const shared_ptr<CVal>& val)
{
if (val->type == ty_) {
return val;
} else {
if (ty_ == IRValType::Int) {
auto res = make_shared<IntCVal>("");
res->iVal = DPC(FloatCVal, val)->fVal;
return res;
} else if (ty_ == IRValType::Float) {
auto res = make_shared<FloatCVal>("");
res->fVal = DPC(IntCVal, val)->iVal;
return res;
}
}
return nullptr;
}
struct CArrGenerator {
std::shared_ptr<CArr> arr;
std::deque<size_t> cur;
std::deque<size_t> shape;
std::vector<size_t> curShape;
std::vector<size_t> curArrayPos;
const shared_ptr<InitListVal>& iList;
size_t curArrayDim;
CArrGenerator(
const std::shared_ptr<CArr>& arr_,
const std::deque<size_t>& shape_,
const shared_ptr<InitListVal>& iList_
)
: arr(arr_)
, cur(shape_.size(), 0)
, shape(shape_)
, iList(iList_)
, curArrayDim(0)
{
}
void gen() { gen(iList, cur, 0); }
void gen(const shared_ptr<InitListVal>& val, std::deque<size_t> pos, size_t d)
{
auto pVal = 0, pArr = 0;
for (auto i = 0; i < val->which.size(); i++) {
if (val->which[i] == InitListVal::CVAL) {
auto& c = getValInACArrRef(arr, pos, shape);
// c= val->cVal [pVal++];
c = makeSureType(arr->containedType, val->cVal[pVal++]);
ArrayPosPlusN(shape, pos, 1);
} else {
auto before = pos[d];
auto& il = val->initList[pArr++];
gen(il, pos, d + 1);
if (before == pos[d]) ArrayPosPlusN(shape, pos, 1, d);
}
}
}
};
/// Build a completely CArr from AST
/// \param iList
/// \return
std::shared_ptr<CArr> Utils::buildAnCArrFromInitList(
const shared_ptr<InitListVal>& iList, const std::deque<size_t>& shape
)
{
auto rr = make_shared<CArr>("", iList->contained);
rr->_shape = shape;
rr->isZero = true;
auto g = CArrGenerator(rr, shape, iList);
g.gen();
rr->advancedType = MS<ArrayType>(rr->containedType, vector<size_t>(shape.begin(), shape.end()));
auto arr = g.arr;
ZeroInitCArr(arr);
return arr;
}
std::shared_ptr<VArr> Utils::buildAnVArrFromInitList(
const shared_ptr<InitListVal>& iList, const std::deque<size_t>& shape
)
{
auto c = buildAnCArrFromInitList(iList, shape);
auto r = make_shared<VArr>(*c);
return r;
}
string Utils::valTypeToStr(IRValType _t)
{
switch (_t) {
case IRValType::Func: return "function";
case IRValType::Int: return "i32";
case IRValType::Float: return "float";
case IRValType::Arr: return "";
case IRValType::Void: return "void";
case IRValType::Pointer:
case IRValType::FloatArr:
case IRValType::IntArr: return "";
case IRValType::Bool: return "i1";
case IRValType::Unknown: return "ERROR";
}
RUNTIME_ERROR("Unknown IRValType" << (int)_t);
}
string Utils::floatTo64BitStr(float x)
{
stringstream ss;
// ss<<"0x"<<std::hex<<reinterpret_cast<uint32_t>(this->fVal);
// Method above was not allowed
// In LLVM-IR, a float is 64 bit.
double thisValue = x;
ss << "0x" << std::hex << *(uint64_t*)(&thisValue);
return ss.str();
}
std::tuple<size_t, int, float> Utils::parseCVal(const shared_ptr<CVal>& cVal)
{
float fInit = 0;
int iInit = 0;
size_t position = 0;
auto fValInit = std::dynamic_pointer_cast<FloatCVal>(cVal);
auto iValInit = std::dynamic_pointer_cast<IntCVal>(cVal);
if (fValInit != nullptr) {
fInit = fValInit->fVal;
iInit = (int)fInit;
position = 1;
} else if (iValInit != nullptr) {
iInit = iValInit->iVal;
fInit = (float)iInit;
position = 2;
}
return {position, iInit, fInit};
}
string Utils::localConstName(const string& functionName, const string& idName)
{
static int id = 0;
return "__const." + std::to_string(id++) + "." + functionName + "." + idName;
}
/// \brief Get string representation of a icmp operator
/// \param _op
/// \return Just as you expected
string Utils::icmpOpToStr(ICMPOp _op)
{
// enum class ICMPOp {EQ, NE, UGT, UGE, ULT, ULE, SGT, SGE, SLT, SLE};
switch (_op) {
case ICMPOp::EQ: return "eq";
case ICMPOp::NE: return "ne";
case ICMPOp::UGT: return "ugt";
case ICMPOp::UGE: return "uge";
case ICMPOp::ULT: return "ult";
case ICMPOp::ULE: return "ule";
case ICMPOp::SGT: return "sgt";
case ICMPOp::SGE: return "sge";
case ICMPOp::SLT: return "slt";
case ICMPOp::SLE: return "sle";
}
throw std::runtime_error("Unknown icmp operator");
}
/// enum class FCMPOp { False, OEQ, OGT, OGE, OLT, OLE, ONE, ORD, UEQ, UGT, UGE, ULT, ULE, UNE, UNO,
/// True }; \param _op \return Just as you expected
string Utils::fcmpOpToStr(FCMPOp _op)
{
switch (_op) {
case FCMPOp::False: return "false";
case FCMPOp::OEQ: return "oeq";
case FCMPOp::OGT: return "ogt";
case FCMPOp::OGE: return "oge";
case FCMPOp::OLT: return "olt";
case FCMPOp::OLE: return "ole";
case FCMPOp::ONE: return "one";
case FCMPOp::ORD: return "ord";
case FCMPOp::UEQ: return "ueq";
case FCMPOp::UGT: return "ugt";
case FCMPOp::UGE: return "uge";
case FCMPOp::ULT: return "ult";
case FCMPOp::ULE: return "ule";
case FCMPOp::UNE: return "une";
case FCMPOp::UNO: return "uno";
case FCMPOp::True: return "true";
}
RUNTIME_ERROR("Unknown fcmp operator" << (int)_op);
}
template<class T1, class T2>
T1 Utils::T1OP(T1 v1, T2 v2, IRValOp op)
{
switch (op) {
case IRValOp::Add: return (T1)v1 + v2;
case IRValOp::Sub: return (T1)v1 - v2;
case IRValOp::Mul: return (T1)v1 * v2;
case IRValOp::Div: return (T1)v1 / v2;
case IRValOp::Rem: return (T1)v1 % v2;
}
return 0;
}
template<class T1, class T2>
T2 Utils::T2OP(T1 v1, T2 v2, IRValOp op)
{
switch (op) {
case IRValOp::Add: return (T2)v1 + v2;
case IRValOp::Sub: return (T2)v1 - v2;
case IRValOp::Mul: return (T2)v1 * v2;
case IRValOp::Div: return (T2)v1 / v2;
case IRValOp::Rem: return (T2)v1 % v2;
}
return 0;
}
template<class T1, class T2>
float Utils::FLOP(T1 v1, T2 v2, IRValOp op)
{
switch (op) {
case IRValOp::Add: return (float)v1 + v2;
case IRValOp::Sub: return (float)v1 - v2;
case IRValOp::Mul: return (float)v1 * v2;
case IRValOp::Div: return (float)v1 / v2;
case IRValOp::Rem: throw std::invalid_argument("float cannot %");
}
return 0;
}
void Utils::ZeroInitCArr(const shared_ptr<CArr>& vArr)
{
bool isZero = true;
for (auto i = 0; i < vArr->witch.size(); i++) {
auto w = vArr->witch[i];
if (w == CArr::CARR) {
ZeroInitCArr(vArr->_childArrs[i]);
if (!vArr->_childArrs[i]->isZero) { isZero = false; }
} else if (w == CArr::ZERO) {
} else if (w == CArr::CVAL) {
if ((vArr->containedType == IRValType::Int &&
(DPC(IntCVal, vArr->_childVals[i])->iVal == 0)) ||
(vArr->containedType == IRValType::Float &&
(DPC(FloatCVal, vArr->_childVals[i])->fVal == 0))) {
vArr->_childVals[i] = nullptr;
vArr->witch[i] = CArr::ZERO;
} else {
isZero = false;
}
}
vArr->isZero = isZero;
}
}
} // namespace IRCtrl