/
llvm_compile.cc
419 lines (388 loc) · 14.8 KB
/
llvm_compile.cc
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
413
414
415
416
417
418
419
#include "Python.h"
#include "llvm_compile.h"
#include "Python/llvm_fbuilder.h"
#include "_llvmfunctionobject.h"
#include "code.h"
#include "global_llvm_data.h"
#include "opcode.h"
#include "Util/PyBytecodeIterator.h"
#include "llvm/ADT/OwningPtr.h"
#include "llvm/Analysis/Verifier.h"
#include "llvm/BasicBlock.h"
using llvm::BasicBlock;
struct InstrInfo {
InstrInfo() : line_number_(0), block_(NULL), backedge_block_(NULL) {}
// The line this instruction falls on.
int line_number_;
// If this instruction starts a new basic block, this is the
// LLVM block it starts.
BasicBlock *block_;
// If this instruction is the target of a backedge in the
// control flow graph, this block implements the necessary
// line tracing and then branches to the main block.
BasicBlock *backedge_block_;
};
// Uses *code to fill line numbers into instr_info. Assumes that
// instr_info[*].line_number was initialized to 0. Returns -1 on
// error, or 0 on success.
static int
set_line_numbers(PyCodeObject *code, std::vector<InstrInfo>& instr_info)
{
assert(PyString_Check(code->co_code));
assert(instr_info.size() == (size_t)PyString_GET_SIZE(code->co_code) &&
"instr_info indices must match bytecode indices.");
// First, assign each address's "line number" to the change in the
// line number that applies at that address.
size_t addr = 0;
const unsigned char *const lnotab_str =
(unsigned char *)PyString_AS_STRING(code->co_lnotab);
const int lnotab_size = PyString_GET_SIZE(code->co_lnotab);
for (int i = 0; i + 1 < lnotab_size; i += 2) {
addr += lnotab_str[i];
if (addr >= instr_info.size()) {
PyErr_Format(PyExc_SystemError,
"lnotab referred to addr %zu, which is outside of"
" bytecode string of length %zu.",
addr, instr_info.size());
return -1;
}
// Use += instead of = to handle line number jumps of more than 255.
instr_info[addr].line_number_ += lnotab_str[i + 1];
}
// Second, add up the line number deltas and store the total line
// number back into instr_info.
int line = code->co_firstlineno;
for (size_t i = 0; i < instr_info.size(); ++i) {
line += instr_info[i].line_number_;
instr_info[i].line_number_ = line;
}
return 0;
}
// Uses the jump instructions in the bytecode string to identify basic
// blocks and backedges, and creates new llvm::BasicBlocks inside
// *function accordingly into instr_info. Returns -1 on error, or 0
// on success.
static int
find_basic_blocks(PyObject *bytecode, py::LlvmFunctionBuilder &fbuilder,
std::vector<InstrInfo>& instr_info)
{
assert(PyString_Check(bytecode) && "Expected bytecode string");
assert(instr_info.size() == (size_t)PyString_GET_SIZE(bytecode) &&
"instr_info indices must match bytecode indices.");
PyBytecodeIterator iter(bytecode);
for (; !iter.Done() && !iter.Error(); iter.Advance()) {
size_t target_index;
const char *target_name;
const char *fallthrough_name;
const char *backedge_name;
switch (iter.Opcode()) {
#define OPCODE_JABS(opname) \
case opname: \
target_index = iter.Oparg(); \
target_name = #opname "_target"; \
fallthrough_name = #opname "_fallthrough"; \
backedge_name = #opname "_backedge"; \
break;
OPCODE_JABS(JUMP_IF_FALSE_OR_POP)
OPCODE_JABS(JUMP_IF_TRUE_OR_POP)
OPCODE_JABS(JUMP_ABSOLUTE)
OPCODE_JABS(POP_JUMP_IF_FALSE)
OPCODE_JABS(POP_JUMP_IF_TRUE)
OPCODE_JABS(CONTINUE_LOOP)
#undef OPCODE_JABS
#define OPCODE_JREL(opname) \
case opname: \
target_index = iter.NextIndex() + iter.Oparg(); \
target_name = #opname "_target"; \
fallthrough_name = #opname "_fallthrough"; \
backedge_name = #opname "_backedge"; \
break;
OPCODE_JREL(FOR_ITER)
OPCODE_JREL(JUMP_FORWARD)
OPCODE_JREL(SETUP_LOOP)
OPCODE_JREL(SETUP_EXCEPT)
OPCODE_JREL(SETUP_FINALLY)
#undef OPCODE_JREL
// Disable an optimization to LOAD_FAST if DELETE_FAST is ever used.
// This isn't a jump, and isn't necessary for basic block creation, but
// doing this check here saves us having to iterate over the opcodes
// again.
case DELETE_FAST:
fbuilder.uses_delete_fast = true;
continue;
default:
// This isn't a jump, so we don't need any new blocks for it.
continue;
}
// LLVM BasicBlocks can only have one terminator (jump or return) and
// only at the end of the block. This means we need to create two new
// blocks for any jump: one for the target instruction, and one for
// the instruction right after the jump. In either case, if a block
// for that instruction already exists, use the existing block.
if (iter.NextIndex() >= instr_info.size()) {
// An unconditional jump as the last instruction will have a
// NextIndex() just beyond the end of the bytecode.
// Handle this by not allocating a fallthrough block and
// passing NULL as the fallthrough parameter to
// LlvmFunctionBuilder::JUMP_ABSOLUTE. This method doesn't use
// its fallthrough parameter so this does not cause a problem.
if (iter.Opcode() != JUMP_ABSOLUTE &&
iter.Opcode() != JUMP_FORWARD) {
PyErr_SetString(PyExc_SystemError,
"Fell through out of bytecode.");
return -1;
}
}
else if (instr_info[iter.NextIndex()].block_ == NULL) {
instr_info[iter.NextIndex()].block_ =
fbuilder.CreateBasicBlock(fallthrough_name);
}
if (target_index >= instr_info.size()) {
PyErr_Format(PyExc_SystemError,
"Jumped to index %zu, which is outside of the"
" bytecode string of length %zu.",
target_index, instr_info.size());
return -1;
}
if (instr_info[target_index].block_ == NULL) {
instr_info[target_index].block_ =
fbuilder.CreateBasicBlock(target_name);
}
if (target_index < iter.NextIndex() && // This is a backedge.
instr_info[target_index].backedge_block_ == NULL) {
instr_info[target_index].backedge_block_ =
fbuilder.CreateBasicBlock(backedge_name);
}
}
if (iter.Error()) {
return -1;
}
return 0;
}
extern "C" _LlvmFunction *
_PyCode_ToLlvmIr(PyCodeObject *code)
{
if (!PyCode_Check(code)) {
PyErr_Format(PyExc_TypeError, "Expected code object, not '%.500s'",
code->ob_type->tp_name);
return NULL;
}
if (!PyString_Check(code->co_code)) {
PyErr_SetString(PyExc_SystemError,
"non-string codestring in code object");
return NULL;
}
PyGlobalLlvmData *global_data = PyGlobalLlvmData::Get();
global_data->MaybeCollectUnusedGlobals();
py::LlvmFunctionBuilder fbuilder(global_data, code);
std::vector<InstrInfo> instr_info(PyString_GET_SIZE(code->co_code));
if (-1 == set_line_numbers(code, instr_info)) {
return NULL;
}
if (-1 == find_basic_blocks(code->co_code, fbuilder, instr_info)) {
return NULL;
}
PyBytecodeIterator iter(code->co_code);
for (; !iter.Done() && !iter.Error(); iter.Advance()) {
fbuilder.SetLasti(iter.CurIndex());
if (instr_info[iter.CurIndex()].block_ != NULL) {
fbuilder.FallThroughTo(instr_info[iter.CurIndex()].block_);
}
// Must call SetLineNumber *after* selecting the new insert block
// (above), or the line-number-setting LLVM IR might get added after
// a block terminator in the previous block.
if (iter.CurIndex() == 0 ||
instr_info[iter.CurIndex()].line_number_ !=
instr_info[iter.CurIndex() - 1].line_number_) {
fbuilder.SetLineNumber(instr_info[iter.CurIndex()].line_number_);
}
BasicBlock *target, *fallthrough;
int target_opindex;
switch(iter.Opcode()) {
case NOP:
break;
#define OPCODE(opname) \
case opname: \
fbuilder.opname(); \
break;
OPCODE(POP_TOP)
OPCODE(ROT_TWO)
OPCODE(ROT_THREE)
OPCODE(DUP_TOP)
OPCODE(ROT_FOUR)
OPCODE(UNARY_POSITIVE)
OPCODE(UNARY_NEGATIVE)
OPCODE(UNARY_NOT)
OPCODE(UNARY_CONVERT)
OPCODE(UNARY_INVERT)
OPCODE(DUP_TOP_TWO)
OPCODE(DUP_TOP_THREE)
OPCODE(LIST_APPEND)
OPCODE(BINARY_POWER)
OPCODE(BINARY_MULTIPLY)
OPCODE(BINARY_DIVIDE)
OPCODE(BINARY_MODULO)
OPCODE(BINARY_ADD)
OPCODE(BINARY_SUBTRACT)
OPCODE(BINARY_SUBSCR)
OPCODE(BINARY_FLOOR_DIVIDE)
OPCODE(BINARY_TRUE_DIVIDE)
OPCODE(INPLACE_FLOOR_DIVIDE)
OPCODE(INPLACE_TRUE_DIVIDE)
OPCODE(SLICE_NONE)
OPCODE(SLICE_LEFT)
OPCODE(SLICE_RIGHT)
OPCODE(SLICE_BOTH)
OPCODE(RAISE_VARARGS_ZERO)
OPCODE(RAISE_VARARGS_ONE)
OPCODE(RAISE_VARARGS_TWO)
OPCODE(RAISE_VARARGS_THREE)
OPCODE(BUILD_SLICE_TWO)
OPCODE(BUILD_SLICE_THREE)
OPCODE(STORE_SLICE_NONE)
OPCODE(STORE_SLICE_LEFT)
OPCODE(STORE_SLICE_RIGHT)
OPCODE(STORE_SLICE_BOTH)
OPCODE(DELETE_SLICE_NONE)
OPCODE(DELETE_SLICE_LEFT)
OPCODE(DELETE_SLICE_RIGHT)
OPCODE(DELETE_SLICE_BOTH)
OPCODE(STORE_MAP)
OPCODE(IMPORT_NAME)
OPCODE(INPLACE_ADD)
OPCODE(INPLACE_SUBTRACT)
OPCODE(INPLACE_MULTIPLY)
OPCODE(INPLACE_DIVIDE)
OPCODE(INPLACE_MODULO)
OPCODE(STORE_SUBSCR)
OPCODE(DELETE_SUBSCR)
OPCODE(BINARY_LSHIFT)
OPCODE(BINARY_RSHIFT)
OPCODE(BINARY_AND)
OPCODE(BINARY_XOR)
OPCODE(BINARY_OR)
OPCODE(INPLACE_POWER)
OPCODE(GET_ITER)
OPCODE(INPLACE_LSHIFT)
OPCODE(INPLACE_RSHIFT)
OPCODE(INPLACE_AND)
OPCODE(INPLACE_XOR)
OPCODE(INPLACE_OR)
OPCODE(BREAK_LOOP)
OPCODE(WITH_CLEANUP)
OPCODE(RETURN_VALUE)
OPCODE(YIELD_VALUE)
OPCODE(POP_BLOCK)
OPCODE(END_FINALLY)
#undef OPCODE
#define OPCODE_WITH_ARG(opname) \
case opname: \
fbuilder.opname(iter.Oparg()); \
break;
OPCODE_WITH_ARG(STORE_NAME)
OPCODE_WITH_ARG(DELETE_NAME)
OPCODE_WITH_ARG(UNPACK_SEQUENCE)
OPCODE_WITH_ARG(STORE_ATTR)
OPCODE_WITH_ARG(DELETE_ATTR)
OPCODE_WITH_ARG(STORE_GLOBAL)
OPCODE_WITH_ARG(DELETE_GLOBAL)
OPCODE_WITH_ARG(LOAD_CONST)
OPCODE_WITH_ARG(LOAD_NAME)
OPCODE_WITH_ARG(BUILD_TUPLE)
OPCODE_WITH_ARG(BUILD_LIST)
OPCODE_WITH_ARG(BUILD_MAP)
OPCODE_WITH_ARG(LOAD_ATTR)
OPCODE_WITH_ARG(COMPARE_OP)
OPCODE_WITH_ARG(LOAD_GLOBAL)
OPCODE_WITH_ARG(LOAD_FAST)
OPCODE_WITH_ARG(STORE_FAST)
OPCODE_WITH_ARG(DELETE_FAST)
OPCODE_WITH_ARG(CALL_FUNCTION)
OPCODE_WITH_ARG(MAKE_CLOSURE)
OPCODE_WITH_ARG(LOAD_CLOSURE)
OPCODE_WITH_ARG(LOAD_DEREF)
OPCODE_WITH_ARG(STORE_DEREF)
OPCODE_WITH_ARG(CALL_FUNCTION_VAR)
OPCODE_WITH_ARG(CALL_FUNCTION_KW)
OPCODE_WITH_ARG(CALL_FUNCTION_VAR_KW)
#undef OPCODE_WITH_ARG
#define ABS iter.Oparg()
#define REL iter.NextIndex() + iter.Oparg()
#define NO_OPINDEX target
#define NEED_OPINDEX target, target_opindex
#define COND_BRANCH iter.Oparg(), iter.NextIndex(), target
#define OPCODE_J(opname, OPINDEX_EXPR, TARGET_PARAM) \
case opname: \
target_opindex = OPINDEX_EXPR; \
if ((size_t)target_opindex < iter.NextIndex()) { \
target = instr_info[target_opindex].backedge_block_; \
} else { \
target = instr_info[target_opindex].block_; \
} \
assert(target != NULL && "Missing target block"); \
if (iter.NextIndex() < instr_info.size()) { \
fallthrough = instr_info[iter.NextIndex()].block_; \
assert(fallthrough != NULL && "Missing fallthrough block"); \
} else { \
fallthrough = NULL; \
} \
fbuilder.opname(TARGET_PARAM, fallthrough); \
break;
OPCODE_J(JUMP_IF_FALSE_OR_POP, ABS, COND_BRANCH)
OPCODE_J(JUMP_IF_TRUE_OR_POP, ABS, COND_BRANCH)
OPCODE_J(POP_JUMP_IF_FALSE, ABS, COND_BRANCH)
OPCODE_J(POP_JUMP_IF_TRUE, ABS, COND_BRANCH)
OPCODE_J(CONTINUE_LOOP, ABS, NEED_OPINDEX)
OPCODE_J(JUMP_ABSOLUTE, ABS, NO_OPINDEX)
OPCODE_J(JUMP_FORWARD, REL, NO_OPINDEX)
OPCODE_J(FOR_ITER, REL, NO_OPINDEX)
OPCODE_J(SETUP_LOOP, REL, NEED_OPINDEX)
OPCODE_J(SETUP_EXCEPT, REL, NEED_OPINDEX)
OPCODE_J(SETUP_FINALLY, REL, NEED_OPINDEX)
#undef OPCODE_J
#undef ABS
#undef REL
#undef NO_OPINDEX
#undef NEED_OPINDEX
case EXTENDED_ARG:
// Already handled by the iterator.
default:
PyErr_Format(PyExc_SystemError,
"Invalid opcode %d in LLVM IR generation",
iter.Opcode());
return NULL;
}
}
if (iter.Error()) {
return NULL;
}
// Make sure the last block has a terminator, even though it should
// be unreachable.
fbuilder.FallThroughTo(fbuilder.unreachable_block());
for (size_t i = 0; i < instr_info.size(); ++i) {
const InstrInfo &info = instr_info[i];
if (info.backedge_block_ != NULL) {
assert(info.block_ != NULL &&
"We expect that any backedge is to the beginning"
" of a basic block.");
fbuilder.SetLasti(i);
bool backedge_is_to_start_of_line =
i == 0 || instr_info[i - 1].line_number_ != info.line_number_;
fbuilder.FillBackedgeLanding(info.backedge_block_, info.block_,
backedge_is_to_start_of_line,
info.line_number_);
}
}
if (llvm::verifyFunction(*fbuilder.function(), llvm::PrintMessageAction)) {
PyErr_SetString(PyExc_SystemError, "invalid LLVM IR produced");
return NULL;
}
// Now that we know that there were no errors, register invalidation
// callbacks for the code object.
if (fbuilder.FinishFunction() < 0) {
return NULL;
}
// Make sure the function survives global optimizations.
fbuilder.function()->setLinkage(llvm::GlobalValue::ExternalLinkage);
return _LlvmFunction_New(fbuilder.function());
}