2014-05-03 22:27:38 +00:00
|
|
|
/*
|
2017-06-30 07:22:17 +00:00
|
|
|
* This file is part of the MicroPython project, http://micropython.org/
|
2014-05-03 22:27:38 +00:00
|
|
|
*
|
|
|
|
* The MIT License (MIT)
|
|
|
|
*
|
2019-08-22 04:55:16 +00:00
|
|
|
* Copyright (c) 2013-2019 Damien P. George
|
2014-05-03 22:27:38 +00:00
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2014-03-16 07:14:26 +00:00
|
|
|
#include <stdbool.h>
|
2013-10-04 18:53:11 +00:00
|
|
|
#include <stdint.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <assert.h>
|
|
|
|
|
2015-01-01 23:30:53 +00:00
|
|
|
#include "py/mpstate.h"
|
2015-01-01 20:27:54 +00:00
|
|
|
#include "py/emit.h"
|
|
|
|
#include "py/bc0.h"
|
2013-10-04 18:53:11 +00:00
|
|
|
|
2015-12-18 12:35:44 +00:00
|
|
|
#if MICROPY_ENABLE_COMPILER
|
|
|
|
|
2014-05-10 17:07:08 +00:00
|
|
|
#define BYTES_FOR_INT ((BYTES_PER_WORD * 8 + 6) / 7)
|
|
|
|
#define DUMMY_DATA_SIZE (BYTES_FOR_INT)
|
|
|
|
|
2013-10-05 11:19:06 +00:00
|
|
|
struct _emit_t {
|
2015-11-27 17:01:44 +00:00
|
|
|
// Accessed as mp_obj_t, so must be aligned as such, and we rely on the
|
|
|
|
// memory allocator returning a suitably aligned pointer.
|
|
|
|
// Should work for cases when mp_obj_t is 64-bit on a 32-bit machine.
|
|
|
|
byte dummy_data[DUMMY_DATA_SIZE];
|
|
|
|
|
2014-05-10 17:16:21 +00:00
|
|
|
pass_kind_t pass : 8;
|
2014-09-08 22:05:16 +00:00
|
|
|
mp_uint_t last_emit_was_return_value : 8;
|
2014-05-10 17:16:21 +00:00
|
|
|
|
2013-10-04 18:53:11 +00:00
|
|
|
int stack_size;
|
|
|
|
|
|
|
|
scope_t *scope;
|
|
|
|
|
2014-09-08 22:05:16 +00:00
|
|
|
mp_uint_t last_source_line_offset;
|
|
|
|
mp_uint_t last_source_line;
|
2014-01-18 23:24:36 +00:00
|
|
|
|
2014-09-08 22:05:16 +00:00
|
|
|
mp_uint_t max_num_labels;
|
|
|
|
mp_uint_t *label_offsets;
|
2013-10-04 18:53:11 +00:00
|
|
|
|
2015-11-27 17:01:44 +00:00
|
|
|
size_t code_info_offset;
|
|
|
|
size_t code_info_size;
|
|
|
|
size_t bytecode_offset;
|
|
|
|
size_t bytecode_size;
|
2014-01-18 23:24:36 +00:00
|
|
|
byte *code_base; // stores both byte code and code info
|
2015-11-02 17:27:18 +00:00
|
|
|
|
2019-09-25 05:45:47 +00:00
|
|
|
size_t n_info;
|
|
|
|
size_t n_cell;
|
|
|
|
|
2015-11-02 17:27:18 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE
|
|
|
|
uint16_t ct_cur_obj;
|
|
|
|
uint16_t ct_num_obj;
|
|
|
|
uint16_t ct_cur_raw_code;
|
|
|
|
#endif
|
2015-10-23 00:23:11 +00:00
|
|
|
mp_uint_t *const_table;
|
2013-10-04 18:53:11 +00:00
|
|
|
};
|
|
|
|
|
2015-03-26 15:49:53 +00:00
|
|
|
emit_t *emit_bc_new(void) {
|
2014-01-18 23:24:36 +00:00
|
|
|
emit_t *emit = m_new0(emit_t, 1);
|
2015-03-26 15:49:53 +00:00
|
|
|
return emit;
|
|
|
|
}
|
|
|
|
|
2015-04-09 15:29:54 +00:00
|
|
|
void emit_bc_set_max_num_labels(emit_t *emit, mp_uint_t max_num_labels) {
|
2013-10-05 17:08:26 +00:00
|
|
|
emit->max_num_labels = max_num_labels;
|
2014-09-08 22:05:16 +00:00
|
|
|
emit->label_offsets = m_new(mp_uint_t, emit->max_num_labels);
|
2013-10-05 17:08:26 +00:00
|
|
|
}
|
2013-10-05 13:17:09 +00:00
|
|
|
|
2014-01-24 22:42:28 +00:00
|
|
|
void emit_bc_free(emit_t *emit) {
|
2014-09-08 22:05:16 +00:00
|
|
|
m_del(mp_uint_t, emit->label_offsets, emit->max_num_labels);
|
2014-01-24 14:20:11 +00:00
|
|
|
m_del_obj(emit_t, emit);
|
|
|
|
}
|
|
|
|
|
2015-04-09 15:31:53 +00:00
|
|
|
typedef byte *(*emit_allocator_t)(emit_t *emit, int nbytes);
|
|
|
|
|
|
|
|
STATIC void emit_write_uint(emit_t *emit, emit_allocator_t allocator, mp_uint_t val) {
|
2014-09-04 13:44:01 +00:00
|
|
|
// We store each 7 bits in a separate byte, and that's how many bytes needed
|
|
|
|
byte buf[BYTES_FOR_INT];
|
|
|
|
byte *p = buf + sizeof(buf);
|
|
|
|
// We encode in little-ending order, but store in big-endian, to help decoding
|
|
|
|
do {
|
|
|
|
*--p = val & 0x7f;
|
|
|
|
val >>= 7;
|
|
|
|
} while (val != 0);
|
2015-04-09 15:29:54 +00:00
|
|
|
byte *c = allocator(emit, buf + sizeof(buf) - p);
|
2014-09-04 13:44:01 +00:00
|
|
|
while (p != buf + sizeof(buf) - 1) {
|
|
|
|
*c++ = *p++ | 0x80;
|
|
|
|
}
|
|
|
|
*c = *p;
|
|
|
|
}
|
|
|
|
|
2014-01-18 23:24:36 +00:00
|
|
|
// all functions must go through this one to emit code info
|
2015-04-09 15:29:54 +00:00
|
|
|
STATIC byte *emit_get_cur_to_write_code_info(emit_t *emit, int num_bytes_to_write) {
|
2014-05-07 16:24:22 +00:00
|
|
|
if (emit->pass < MP_PASS_EMIT) {
|
2014-01-18 23:24:36 +00:00
|
|
|
emit->code_info_offset += num_bytes_to_write;
|
|
|
|
return emit->dummy_data;
|
|
|
|
} else {
|
|
|
|
assert(emit->code_info_offset + num_bytes_to_write <= emit->code_info_size);
|
|
|
|
byte *c = emit->code_base + emit->code_info_offset;
|
|
|
|
emit->code_info_offset += num_bytes_to_write;
|
|
|
|
return c;
|
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2020-02-27 04:36:53 +00:00
|
|
|
STATIC void emit_write_code_info_byte(emit_t *emit, byte val) {
|
2015-03-18 17:47:47 +00:00
|
|
|
*emit_get_cur_to_write_code_info(emit, 1) = val;
|
|
|
|
}
|
|
|
|
|
2015-04-09 15:29:54 +00:00
|
|
|
STATIC void emit_write_code_info_qstr(emit_t *emit, qstr qst) {
|
2015-11-02 17:27:18 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE
|
|
|
|
assert((qst >> 16) == 0);
|
|
|
|
byte *c = emit_get_cur_to_write_code_info(emit, 2);
|
|
|
|
c[0] = qst;
|
|
|
|
c[1] = qst >> 8;
|
|
|
|
#else
|
2014-09-04 13:44:01 +00:00
|
|
|
emit_write_uint(emit, emit_get_cur_to_write_code_info, qst);
|
2015-11-02 17:27:18 +00:00
|
|
|
#endif
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2014-04-13 13:51:56 +00:00
|
|
|
#if MICROPY_ENABLE_SOURCE_LINE
|
2015-04-09 15:29:54 +00:00
|
|
|
STATIC void emit_write_code_info_bytes_lines(emit_t *emit, mp_uint_t bytes_to_skip, mp_uint_t lines_to_skip) {
|
2014-04-13 13:51:56 +00:00
|
|
|
assert(bytes_to_skip > 0 || lines_to_skip > 0);
|
|
|
|
while (bytes_to_skip > 0 || lines_to_skip > 0) {
|
2014-07-31 16:12:01 +00:00
|
|
|
mp_uint_t b, l;
|
2017-02-10 00:58:10 +00:00
|
|
|
if (lines_to_skip <= 6 || bytes_to_skip > 0xf) {
|
2014-07-31 16:12:01 +00:00
|
|
|
// use 0b0LLBBBBB encoding
|
|
|
|
b = MIN(bytes_to_skip, 0x1f);
|
2017-02-10 00:58:10 +00:00
|
|
|
if (b < bytes_to_skip) {
|
|
|
|
// we can't skip any lines until we skip all the bytes
|
|
|
|
l = 0;
|
|
|
|
} else {
|
|
|
|
l = MIN(lines_to_skip, 0x3);
|
|
|
|
}
|
2014-07-31 16:12:01 +00:00
|
|
|
*emit_get_cur_to_write_code_info(emit, 1) = b | (l << 5);
|
|
|
|
} else {
|
|
|
|
// use 0b1LLLBBBB 0bLLLLLLLL encoding (l's LSB in second byte)
|
|
|
|
b = MIN(bytes_to_skip, 0xf);
|
|
|
|
l = MIN(lines_to_skip, 0x7ff);
|
|
|
|
byte *ci = emit_get_cur_to_write_code_info(emit, 2);
|
|
|
|
ci[0] = 0x80 | b | ((l >> 4) & 0x70);
|
|
|
|
ci[1] = l;
|
|
|
|
}
|
2014-04-13 13:51:56 +00:00
|
|
|
bytes_to_skip -= b;
|
|
|
|
lines_to_skip -= l;
|
2014-01-25 11:43:20 +00:00
|
|
|
}
|
2014-01-18 23:24:36 +00:00
|
|
|
}
|
2014-04-13 13:51:56 +00:00
|
|
|
#endif
|
2014-01-18 23:24:36 +00:00
|
|
|
|
|
|
|
// all functions must go through this one to emit byte code
|
2015-04-09 15:29:54 +00:00
|
|
|
STATIC byte *emit_get_cur_to_write_bytecode(emit_t *emit, int num_bytes_to_write) {
|
2014-05-07 16:24:22 +00:00
|
|
|
if (emit->pass < MP_PASS_EMIT) {
|
2014-05-10 09:36:38 +00:00
|
|
|
emit->bytecode_offset += num_bytes_to_write;
|
2013-10-04 18:53:11 +00:00
|
|
|
return emit->dummy_data;
|
|
|
|
} else {
|
2014-05-10 09:36:38 +00:00
|
|
|
assert(emit->bytecode_offset + num_bytes_to_write <= emit->bytecode_size);
|
|
|
|
byte *c = emit->code_base + emit->code_info_size + emit->bytecode_offset;
|
|
|
|
emit->bytecode_offset += num_bytes_to_write;
|
2013-10-04 18:53:11 +00:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_write_bytecode_raw_byte(emit_t *emit, byte b1) {
|
2015-04-09 15:29:54 +00:00
|
|
|
byte *c = emit_get_cur_to_write_bytecode(emit, 1);
|
2013-10-04 18:53:11 +00:00
|
|
|
c[0] = b1;
|
|
|
|
}
|
|
|
|
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_write_bytecode_byte(emit_t *emit, int stack_adj, byte b1) {
|
|
|
|
mp_emit_bc_adjust_stack_size(emit, stack_adj);
|
|
|
|
byte *c = emit_get_cur_to_write_bytecode(emit, 1);
|
|
|
|
c[0] = b1;
|
|
|
|
}
|
|
|
|
|
2014-05-10 09:36:38 +00:00
|
|
|
// Similar to emit_write_bytecode_uint(), just some extra handling to encode sign
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_write_bytecode_byte_int(emit_t *emit, int stack_adj, byte b1, mp_int_t num) {
|
|
|
|
emit_write_bytecode_byte(emit, stack_adj, b1);
|
2014-02-19 13:47:59 +00:00
|
|
|
|
|
|
|
// We store each 7 bits in a separate byte, and that's how many bytes needed
|
2014-05-10 17:07:08 +00:00
|
|
|
byte buf[BYTES_FOR_INT];
|
2014-02-19 13:47:59 +00:00
|
|
|
byte *p = buf + sizeof(buf);
|
|
|
|
// We encode in little-ending order, but store in big-endian, to help decoding
|
|
|
|
do {
|
|
|
|
*--p = num & 0x7f;
|
|
|
|
num >>= 7;
|
|
|
|
} while (num != 0 && num != -1);
|
|
|
|
// Make sure that highest bit we stored (mask 0x40) matches sign
|
|
|
|
// of the number. If not, store extra byte just to encode sign
|
|
|
|
if (num == -1 && (*p & 0x40) == 0) {
|
|
|
|
*--p = 0x7f;
|
|
|
|
} else if (num == 0 && (*p & 0x40) != 0) {
|
|
|
|
*--p = 0;
|
|
|
|
}
|
|
|
|
|
2015-04-09 15:29:54 +00:00
|
|
|
byte *c = emit_get_cur_to_write_bytecode(emit, buf + sizeof(buf) - p);
|
2014-02-19 13:47:59 +00:00
|
|
|
while (p != buf + sizeof(buf) - 1) {
|
|
|
|
*c++ = *p++ | 0x80;
|
|
|
|
}
|
|
|
|
*c = *p;
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_write_bytecode_byte_uint(emit_t *emit, int stack_adj, byte b, mp_uint_t val) {
|
|
|
|
emit_write_bytecode_byte(emit, stack_adj, b);
|
2014-09-04 13:44:01 +00:00
|
|
|
emit_write_uint(emit, emit_get_cur_to_write_bytecode, val);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-11-02 17:27:18 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_write_bytecode_byte_const(emit_t *emit, int stack_adj, byte b, mp_uint_t n, mp_uint_t c) {
|
2015-11-02 17:27:18 +00:00
|
|
|
if (emit->pass == MP_PASS_EMIT) {
|
|
|
|
emit->const_table[n] = c;
|
|
|
|
}
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_uint(emit, stack_adj, b, n);
|
2015-11-02 17:27:18 +00:00
|
|
|
}
|
|
|
|
#endif
|
2014-04-13 10:04:33 +00:00
|
|
|
|
2020-02-27 04:36:53 +00:00
|
|
|
STATIC void emit_write_bytecode_byte_qstr(emit_t *emit, int stack_adj, byte b, qstr qst) {
|
2015-11-02 17:27:18 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE
|
|
|
|
assert((qst >> 16) == 0);
|
2019-08-22 04:55:16 +00:00
|
|
|
mp_emit_bc_adjust_stack_size(emit, stack_adj);
|
2015-11-02 17:27:18 +00:00
|
|
|
byte *c = emit_get_cur_to_write_bytecode(emit, 3);
|
|
|
|
c[0] = b;
|
|
|
|
c[1] = qst;
|
|
|
|
c[2] = qst >> 8;
|
|
|
|
#else
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_uint(emit, stack_adj, b, qst);
|
2015-11-02 17:27:18 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_write_bytecode_byte_obj(emit_t *emit, int stack_adj, byte b, mp_obj_t obj) {
|
2015-11-02 17:27:18 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_const(emit, stack_adj, b,
|
2015-11-02 17:27:18 +00:00
|
|
|
emit->scope->num_pos_args + emit->scope->num_kwonly_args
|
2015-11-27 17:01:44 +00:00
|
|
|
+ emit->ct_cur_obj++, (mp_uint_t)obj);
|
2015-11-02 17:27:18 +00:00
|
|
|
#else
|
2015-11-27 17:01:44 +00:00
|
|
|
// aligns the pointer so it is friendly to GC
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, stack_adj, b);
|
2015-11-27 17:01:44 +00:00
|
|
|
emit->bytecode_offset = (size_t)MP_ALIGN(emit->bytecode_offset, sizeof(mp_obj_t));
|
2020-02-27 04:36:53 +00:00
|
|
|
mp_obj_t *c = (mp_obj_t *)emit_get_cur_to_write_bytecode(emit, sizeof(mp_obj_t));
|
2015-11-27 17:01:44 +00:00
|
|
|
// Verify thar c is already uint-aligned
|
|
|
|
assert(c == MP_ALIGN(c, sizeof(mp_obj_t)));
|
|
|
|
*c = obj;
|
2015-11-02 17:27:18 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_write_bytecode_byte_raw_code(emit_t *emit, int stack_adj, byte b, mp_raw_code_t *rc) {
|
2015-11-02 17:27:18 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_const(emit, stack_adj, b,
|
2015-11-02 17:27:18 +00:00
|
|
|
emit->scope->num_pos_args + emit->scope->num_kwonly_args
|
2015-11-27 17:01:44 +00:00
|
|
|
+ emit->ct_num_obj + emit->ct_cur_raw_code++, (mp_uint_t)(uintptr_t)rc);
|
2015-11-02 17:27:18 +00:00
|
|
|
#else
|
2015-11-27 17:01:44 +00:00
|
|
|
// aligns the pointer so it is friendly to GC
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, stack_adj, b);
|
2020-02-27 04:36:53 +00:00
|
|
|
emit->bytecode_offset = (size_t)MP_ALIGN(emit->bytecode_offset, sizeof(void *));
|
|
|
|
void **c = (void **)emit_get_cur_to_write_bytecode(emit, sizeof(void *));
|
2015-11-27 17:01:44 +00:00
|
|
|
// Verify thar c is already uint-aligned
|
2020-02-27 04:36:53 +00:00
|
|
|
assert(c == MP_ALIGN(c, sizeof(void *)));
|
2015-11-27 17:01:44 +00:00
|
|
|
*c = rc;
|
2015-11-02 17:27:18 +00:00
|
|
|
#endif
|
2019-08-14 14:09:36 +00:00
|
|
|
#if MICROPY_PY_SYS_SETTRACE
|
|
|
|
rc->line_of_definition = emit->last_source_line;
|
|
|
|
#endif
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2013-11-05 22:06:08 +00:00
|
|
|
// unsigned labels are relative to ip following this instruction, stored as 16 bits
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_write_bytecode_byte_unsigned_label(emit_t *emit, int stack_adj, byte b1, mp_uint_t label) {
|
|
|
|
mp_emit_bc_adjust_stack_size(emit, stack_adj);
|
2014-09-08 22:05:16 +00:00
|
|
|
mp_uint_t bytecode_offset;
|
2014-05-07 16:24:22 +00:00
|
|
|
if (emit->pass < MP_PASS_EMIT) {
|
2014-05-10 09:36:38 +00:00
|
|
|
bytecode_offset = 0;
|
2013-10-04 18:53:11 +00:00
|
|
|
} else {
|
2014-05-10 09:36:38 +00:00
|
|
|
bytecode_offset = emit->label_offsets[label] - emit->bytecode_offset - 3;
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
2014-05-10 09:36:38 +00:00
|
|
|
byte *c = emit_get_cur_to_write_bytecode(emit, 3);
|
2013-11-05 22:06:08 +00:00
|
|
|
c[0] = b1;
|
2014-05-10 09:36:38 +00:00
|
|
|
c[1] = bytecode_offset;
|
|
|
|
c[2] = bytecode_offset >> 8;
|
2013-11-05 22:06:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// signed labels are relative to ip following this instruction, stored as 16 bits, in excess
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_write_bytecode_byte_signed_label(emit_t *emit, int stack_adj, byte b1, mp_uint_t label) {
|
|
|
|
mp_emit_bc_adjust_stack_size(emit, stack_adj);
|
2014-05-10 09:36:38 +00:00
|
|
|
int bytecode_offset;
|
2014-05-07 16:24:22 +00:00
|
|
|
if (emit->pass < MP_PASS_EMIT) {
|
2014-05-10 09:36:38 +00:00
|
|
|
bytecode_offset = 0;
|
2013-11-05 22:06:08 +00:00
|
|
|
} else {
|
2014-05-10 09:36:38 +00:00
|
|
|
bytecode_offset = emit->label_offsets[label] - emit->bytecode_offset - 3 + 0x8000;
|
2013-11-05 22:06:08 +00:00
|
|
|
}
|
2015-04-09 15:29:54 +00:00
|
|
|
byte *c = emit_get_cur_to_write_bytecode(emit, 3);
|
2013-11-05 22:06:08 +00:00
|
|
|
c[0] = b1;
|
2014-05-10 09:36:38 +00:00
|
|
|
c[1] = bytecode_offset;
|
|
|
|
c[2] = bytecode_offset >> 8;
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_start_pass(emit_t *emit, pass_kind_t pass, scope_t *scope) {
|
2013-12-30 22:32:17 +00:00
|
|
|
emit->pass = pass;
|
|
|
|
emit->stack_size = 0;
|
|
|
|
emit->last_emit_was_return_value = false;
|
|
|
|
emit->scope = scope;
|
2014-01-18 23:24:36 +00:00
|
|
|
emit->last_source_line_offset = 0;
|
|
|
|
emit->last_source_line = 1;
|
2017-12-08 07:23:23 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
// With debugging enabled labels are checked for unique assignment
|
2018-05-19 15:52:43 +00:00
|
|
|
if (pass < MP_PASS_EMIT && emit->label_offsets != NULL) {
|
2014-09-08 22:05:16 +00:00
|
|
|
memset(emit->label_offsets, -1, emit->max_num_labels * sizeof(mp_uint_t));
|
2013-12-30 22:32:17 +00:00
|
|
|
}
|
2017-12-08 07:23:23 +00:00
|
|
|
#endif
|
2014-05-10 09:36:38 +00:00
|
|
|
emit->bytecode_offset = 0;
|
2014-01-18 23:24:36 +00:00
|
|
|
emit->code_info_offset = 0;
|
|
|
|
|
2019-09-16 12:12:59 +00:00
|
|
|
// Write local state size, exception stack size, scope flags and number of arguments
|
2015-03-18 17:47:47 +00:00
|
|
|
{
|
|
|
|
mp_uint_t n_state = scope->num_locals + scope->stack_size;
|
|
|
|
if (n_state == 0) {
|
|
|
|
// Need at least 1 entry in the state, in the case an exception is
|
|
|
|
// propagated through this function, the exception is returned in
|
|
|
|
// the highest slot in the state (fastn[0], see vm.c).
|
|
|
|
n_state = 1;
|
|
|
|
}
|
2019-01-04 06:09:41 +00:00
|
|
|
#if MICROPY_DEBUG_VM_STACK_OVERFLOW
|
|
|
|
// An extra slot in the stack is needed to detect VM stack overflow
|
|
|
|
n_state += 1;
|
|
|
|
#endif
|
2014-01-18 23:24:36 +00:00
|
|
|
|
2019-09-16 12:12:59 +00:00
|
|
|
size_t n_exc_stack = scope->exc_stack_size;
|
|
|
|
MP_BC_PRELUDE_SIG_ENCODE(n_state, n_exc_stack, scope, emit_write_code_info_byte, emit);
|
|
|
|
}
|
2015-10-22 22:45:37 +00:00
|
|
|
|
2019-09-25 05:45:47 +00:00
|
|
|
// Write number of cells and size of the source code info
|
|
|
|
if (pass >= MP_PASS_CODE_SIZE) {
|
|
|
|
MP_BC_PRELUDE_SIZE_ENCODE(emit->n_info, emit->n_cell, emit_write_code_info_byte, emit);
|
2014-03-27 10:55:21 +00:00
|
|
|
}
|
|
|
|
|
2019-09-25 05:45:47 +00:00
|
|
|
emit->n_info = emit->code_info_offset;
|
|
|
|
|
2015-03-18 17:47:47 +00:00
|
|
|
// Write the name and source file of this function.
|
|
|
|
emit_write_code_info_qstr(emit, scope->simple_name);
|
|
|
|
emit_write_code_info_qstr(emit, scope->source_file);
|
|
|
|
|
2015-11-02 17:27:18 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE
|
|
|
|
emit->ct_cur_obj = 0;
|
|
|
|
emit->ct_cur_raw_code = 0;
|
|
|
|
#endif
|
|
|
|
|
2015-10-23 00:23:11 +00:00
|
|
|
if (pass == MP_PASS_EMIT) {
|
|
|
|
// Write argument names (needed to resolve positional args passed as
|
|
|
|
// keywords). We store them as full word-sized objects for efficient access
|
|
|
|
// in mp_setup_code_state this is the start of the prelude and is guaranteed
|
|
|
|
// to be aligned on a word boundary.
|
|
|
|
|
|
|
|
// For a given argument position (indexed by i) we need to find the
|
|
|
|
// corresponding id_info which is a parameter, as it has the correct
|
|
|
|
// qstr name to use as the argument name. Note that it's not a simple
|
|
|
|
// 1-1 mapping (ie i!=j in general) because of possible closed-over
|
|
|
|
// variables. In the case that the argument i has no corresponding
|
|
|
|
// parameter we use "*" as its name (since no argument can ever be named
|
|
|
|
// "*"). We could use a blank qstr but "*" is better for debugging.
|
|
|
|
// Note: there is some wasted RAM here for the case of storing a qstr
|
|
|
|
// for each closed-over variable, and maybe there is a better way to do
|
|
|
|
// it, but that would require changes to mp_setup_code_state.
|
|
|
|
for (int i = 0; i < scope->num_pos_args + scope->num_kwonly_args; i++) {
|
|
|
|
qstr qst = MP_QSTR__star_;
|
|
|
|
for (int j = 0; j < scope->id_info_len; ++j) {
|
|
|
|
id_info_t *id = &scope->id_info[j];
|
|
|
|
if ((id->flags & ID_FLAG_IS_PARAM) && id->local_num == i) {
|
|
|
|
qst = id->qst;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
emit->const_table[i] = (mp_uint_t)MP_OBJ_NEW_QSTR(qst);
|
|
|
|
}
|
|
|
|
}
|
2013-12-30 22:32:17 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_end_pass(emit_t *emit) {
|
2015-03-26 15:49:53 +00:00
|
|
|
if (emit->pass == MP_PASS_SCOPE) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2013-12-30 22:32:17 +00:00
|
|
|
// check stack is back to zero size
|
2016-09-27 05:46:50 +00:00
|
|
|
assert(emit->stack_size == 0);
|
2013-12-30 22:32:17 +00:00
|
|
|
|
2015-03-18 17:47:47 +00:00
|
|
|
emit_write_code_info_byte(emit, 0); // end of line number info
|
2014-01-18 23:24:36 +00:00
|
|
|
|
2019-09-25 05:45:47 +00:00
|
|
|
// Calculate size of source code info section
|
|
|
|
emit->n_info = emit->code_info_offset - emit->n_info;
|
|
|
|
|
|
|
|
// Emit closure section of prelude
|
|
|
|
emit->n_cell = 0;
|
|
|
|
for (size_t i = 0; i < emit->scope->id_info_len; ++i) {
|
|
|
|
id_info_t *id = &emit->scope->id_info[i];
|
|
|
|
if (id->kind == ID_INFO_KIND_CELL) {
|
|
|
|
assert(id->local_num <= 255);
|
|
|
|
emit_write_code_info_byte(emit, id->local_num); // write the local which should be converted to a cell
|
|
|
|
++emit->n_cell;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-11-02 17:27:18 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE
|
|
|
|
assert(emit->pass <= MP_PASS_STACK_SIZE || (emit->ct_num_obj == emit->ct_cur_obj));
|
|
|
|
emit->ct_num_obj = emit->ct_cur_obj;
|
|
|
|
#endif
|
|
|
|
|
2014-05-07 16:24:22 +00:00
|
|
|
if (emit->pass == MP_PASS_CODE_SIZE) {
|
2015-11-02 17:27:18 +00:00
|
|
|
#if !MICROPY_PERSISTENT_CODE
|
2015-03-18 17:47:47 +00:00
|
|
|
// so bytecode is aligned
|
2015-11-27 17:01:44 +00:00
|
|
|
emit->code_info_offset = (size_t)MP_ALIGN(emit->code_info_offset, sizeof(mp_uint_t));
|
2015-11-02 17:27:18 +00:00
|
|
|
#endif
|
2014-09-04 13:44:01 +00:00
|
|
|
|
|
|
|
// calculate size of total code-info + bytecode, in bytes
|
2014-01-18 23:24:36 +00:00
|
|
|
emit->code_info_size = emit->code_info_offset;
|
2014-05-10 09:36:38 +00:00
|
|
|
emit->bytecode_size = emit->bytecode_offset;
|
|
|
|
emit->code_base = m_new0(byte, emit->code_info_size + emit->bytecode_size);
|
2013-12-30 22:32:17 +00:00
|
|
|
|
2015-11-02 17:27:18 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE
|
|
|
|
emit->const_table = m_new0(mp_uint_t,
|
|
|
|
emit->scope->num_pos_args + emit->scope->num_kwonly_args
|
|
|
|
+ emit->ct_cur_obj + emit->ct_cur_raw_code);
|
|
|
|
#else
|
|
|
|
emit->const_table = m_new0(mp_uint_t,
|
|
|
|
emit->scope->num_pos_args + emit->scope->num_kwonly_args);
|
|
|
|
#endif
|
2015-10-23 00:23:11 +00:00
|
|
|
|
2014-05-07 16:24:22 +00:00
|
|
|
} else if (emit->pass == MP_PASS_EMIT) {
|
2014-05-10 09:36:38 +00:00
|
|
|
mp_emit_glue_assign_bytecode(emit->scope->raw_code, emit->code_base,
|
2018-02-14 07:41:17 +00:00
|
|
|
#if MICROPY_PERSISTENT_CODE_SAVE || MICROPY_DEBUG_PRINTERS
|
2015-10-23 00:23:11 +00:00
|
|
|
emit->code_info_size + emit->bytecode_size,
|
2018-02-14 07:41:17 +00:00
|
|
|
#endif
|
2015-11-02 21:55:42 +00:00
|
|
|
emit->const_table,
|
|
|
|
#if MICROPY_PERSISTENT_CODE_SAVE
|
|
|
|
emit->ct_cur_obj, emit->ct_cur_raw_code,
|
|
|
|
#endif
|
|
|
|
emit->scope->scope_flags);
|
2013-12-30 22:32:17 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
bool mp_emit_bc_last_emit_was_return_value(emit_t *emit) {
|
2013-10-04 18:53:11 +00:00
|
|
|
return emit->last_emit_was_return_value;
|
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_adjust_stack_size(emit_t *emit, mp_int_t delta) {
|
2017-05-25 10:42:30 +00:00
|
|
|
if (emit->pass == MP_PASS_SCOPE) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
assert((mp_int_t)emit->stack_size + delta >= 0);
|
2014-04-10 17:28:54 +00:00
|
|
|
emit->stack_size += delta;
|
2017-05-25 10:42:30 +00:00
|
|
|
if (emit->stack_size > emit->scope->stack_size) {
|
|
|
|
emit->scope->stack_size = emit->stack_size;
|
|
|
|
}
|
|
|
|
emit->last_emit_was_return_value = false;
|
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_set_source_line(emit_t *emit, mp_uint_t source_line) {
|
2020-02-27 04:36:53 +00:00
|
|
|
#if MICROPY_ENABLE_SOURCE_LINE
|
2015-01-01 23:30:53 +00:00
|
|
|
if (MP_STATE_VM(mp_optimise_value) >= 3) {
|
2014-06-02 16:39:15 +00:00
|
|
|
// If we compile with -O3, don't store line numbers.
|
|
|
|
return;
|
|
|
|
}
|
2014-01-18 23:24:36 +00:00
|
|
|
if (source_line > emit->last_source_line) {
|
2014-09-08 22:05:16 +00:00
|
|
|
mp_uint_t bytes_to_skip = emit->bytecode_offset - emit->last_source_line_offset;
|
|
|
|
mp_uint_t lines_to_skip = source_line - emit->last_source_line;
|
2014-01-25 11:43:20 +00:00
|
|
|
emit_write_code_info_bytes_lines(emit, bytes_to_skip, lines_to_skip);
|
2014-05-10 09:36:38 +00:00
|
|
|
emit->last_source_line_offset = emit->bytecode_offset;
|
2014-01-18 23:24:36 +00:00
|
|
|
emit->last_source_line = source_line;
|
|
|
|
}
|
2020-02-27 04:36:53 +00:00
|
|
|
#else
|
2015-09-04 15:53:46 +00:00
|
|
|
(void)emit;
|
|
|
|
(void)source_line;
|
2020-02-27 04:36:53 +00:00
|
|
|
#endif
|
2014-01-18 23:24:36 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_label_assign(emit_t *emit, mp_uint_t l) {
|
2019-08-22 04:55:16 +00:00
|
|
|
mp_emit_bc_adjust_stack_size(emit, 0);
|
2015-03-26 15:49:53 +00:00
|
|
|
if (emit->pass == MP_PASS_SCOPE) {
|
|
|
|
return;
|
|
|
|
}
|
2013-10-05 12:37:10 +00:00
|
|
|
assert(l < emit->max_num_labels);
|
2014-05-07 16:24:22 +00:00
|
|
|
if (emit->pass < MP_PASS_EMIT) {
|
2013-10-05 12:37:10 +00:00
|
|
|
// assign label offset
|
2015-01-16 17:47:07 +00:00
|
|
|
assert(emit->label_offsets[l] == (mp_uint_t)-1);
|
2014-05-10 09:36:38 +00:00
|
|
|
emit->label_offsets[l] = emit->bytecode_offset;
|
2014-05-07 16:24:22 +00:00
|
|
|
} else {
|
|
|
|
// ensure label offset has not changed from MP_PASS_CODE_SIZE to MP_PASS_EMIT
|
2014-05-10 09:36:38 +00:00
|
|
|
assert(emit->label_offsets[l] == emit->bytecode_offset);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-05-22 11:58:25 +00:00
|
|
|
void mp_emit_bc_import(emit_t *emit, qstr qst, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_IMPORT_NAME + MP_EMIT_IMPORT_NAME == MP_BC_IMPORT_NAME);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_IMPORT_NAME + MP_EMIT_IMPORT_FROM == MP_BC_IMPORT_FROM);
|
2019-08-22 04:55:16 +00:00
|
|
|
int stack_adj = kind == MP_EMIT_IMPORT_FROM ? 1 : -1;
|
2018-05-22 11:58:25 +00:00
|
|
|
if (kind == MP_EMIT_IMPORT_STAR) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, stack_adj, MP_BC_IMPORT_STAR);
|
2018-05-22 11:58:25 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_qstr(emit, stack_adj, MP_BC_IMPORT_NAME + kind, qst);
|
2018-05-22 11:58:25 +00:00
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_load_const_tok(emit_t *emit, mp_token_kind_t tok) {
|
2019-08-22 04:36:27 +00:00
|
|
|
MP_STATIC_ASSERT(MP_BC_LOAD_CONST_FALSE + (MP_TOKEN_KW_NONE - MP_TOKEN_KW_FALSE) == MP_BC_LOAD_CONST_NONE);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_LOAD_CONST_FALSE + (MP_TOKEN_KW_TRUE - MP_TOKEN_KW_FALSE) == MP_BC_LOAD_CONST_TRUE);
|
|
|
|
if (tok == MP_TOKEN_ELLIPSIS) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_obj(emit, 1, MP_BC_LOAD_CONST_OBJ, MP_OBJ_FROM_PTR(&mp_const_ellipsis_obj));
|
2019-08-22 04:36:27 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 1, MP_BC_LOAD_CONST_FALSE + (tok - MP_TOKEN_KW_FALSE));
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_load_const_small_int(emit_t *emit, mp_int_t arg) {
|
2019-09-12 02:19:49 +00:00
|
|
|
if (-MP_BC_LOAD_CONST_SMALL_INT_MULTI_EXCESS <= arg
|
|
|
|
&& arg < MP_BC_LOAD_CONST_SMALL_INT_MULTI_NUM - MP_BC_LOAD_CONST_SMALL_INT_MULTI_EXCESS) {
|
|
|
|
emit_write_bytecode_byte(emit, 1,
|
|
|
|
MP_BC_LOAD_CONST_SMALL_INT_MULTI + MP_BC_LOAD_CONST_SMALL_INT_MULTI_EXCESS + arg);
|
py: Compress load-int, load-fast, store-fast, unop, binop bytecodes.
There is a lot potential in compress bytecodes and make more use of the
coding space. This patch introduces "multi" bytecodes which have their
argument included in the bytecode (by addition).
UNARY_OP and BINARY_OP now no longer take a 1 byte argument for the
opcode. Rather, the opcode is included in the first byte itself.
LOAD_FAST_[0,1,2] and STORE_FAST_[0,1,2] are removed in favour of their
multi versions, which can take an argument between 0 and 15 inclusive.
The majority of LOAD_FAST/STORE_FAST codes fit in this range and so this
saves a byte for each of these.
LOAD_CONST_SMALL_INT_MULTI is used to load small ints between -16 and 47
inclusive. Such ints are quite common and now only need 1 byte to
store, and now have much faster decoding.
In all this patch saves about 2% RAM for typically bytecode (1.8% on
64-bit test, 2.5% on pyboard test). It also reduces the binary size
(because bytecodes are simplified) and doesn't harm performance.
2014-10-25 15:43:46 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_int(emit, 1, MP_BC_LOAD_CONST_SMALL_INT, arg);
|
py: Compress load-int, load-fast, store-fast, unop, binop bytecodes.
There is a lot potential in compress bytecodes and make more use of the
coding space. This patch introduces "multi" bytecodes which have their
argument included in the bytecode (by addition).
UNARY_OP and BINARY_OP now no longer take a 1 byte argument for the
opcode. Rather, the opcode is included in the first byte itself.
LOAD_FAST_[0,1,2] and STORE_FAST_[0,1,2] are removed in favour of their
multi versions, which can take an argument between 0 and 15 inclusive.
The majority of LOAD_FAST/STORE_FAST codes fit in this range and so this
saves a byte for each of these.
LOAD_CONST_SMALL_INT_MULTI is used to load small ints between -16 and 47
inclusive. Such ints are quite common and now only need 1 byte to
store, and now have much faster decoding.
In all this patch saves about 2% RAM for typically bytecode (1.8% on
64-bit test, 2.5% on pyboard test). It also reduces the binary size
(because bytecodes are simplified) and doesn't harm performance.
2014-10-25 15:43:46 +00:00
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-06-25 14:42:13 +00:00
|
|
|
void mp_emit_bc_load_const_str(emit_t *emit, qstr qst) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_qstr(emit, 1, MP_BC_LOAD_CONST_STRING, qst);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-11-27 12:41:25 +00:00
|
|
|
void mp_emit_bc_load_const_obj(emit_t *emit, mp_obj_t obj) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_obj(emit, 1, MP_BC_LOAD_CONST_OBJ, obj);
|
2015-01-13 15:55:54 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_load_null(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 1, MP_BC_LOAD_NULL);
|
2017-09-13 10:36:06 +00:00
|
|
|
}
|
2014-03-31 10:59:23 +00:00
|
|
|
|
2018-05-18 14:11:04 +00:00
|
|
|
void mp_emit_bc_load_local(emit_t *emit, qstr qst, mp_uint_t local_num, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_LOAD_FAST_N + MP_EMIT_IDOP_LOCAL_FAST == MP_BC_LOAD_FAST_N);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_LOAD_FAST_N + MP_EMIT_IDOP_LOCAL_DEREF == MP_BC_LOAD_DEREF);
|
2015-01-20 12:47:20 +00:00
|
|
|
(void)qst;
|
2018-05-18 14:11:04 +00:00
|
|
|
if (kind == MP_EMIT_IDOP_LOCAL_FAST && local_num <= 15) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 1, MP_BC_LOAD_FAST_MULTI + local_num);
|
py: Compress load-int, load-fast, store-fast, unop, binop bytecodes.
There is a lot potential in compress bytecodes and make more use of the
coding space. This patch introduces "multi" bytecodes which have their
argument included in the bytecode (by addition).
UNARY_OP and BINARY_OP now no longer take a 1 byte argument for the
opcode. Rather, the opcode is included in the first byte itself.
LOAD_FAST_[0,1,2] and STORE_FAST_[0,1,2] are removed in favour of their
multi versions, which can take an argument between 0 and 15 inclusive.
The majority of LOAD_FAST/STORE_FAST codes fit in this range and so this
saves a byte for each of these.
LOAD_CONST_SMALL_INT_MULTI is used to load small ints between -16 and 47
inclusive. Such ints are quite common and now only need 1 byte to
store, and now have much faster decoding.
In all this patch saves about 2% RAM for typically bytecode (1.8% on
64-bit test, 2.5% on pyboard test). It also reduces the binary size
(because bytecodes are simplified) and doesn't harm performance.
2014-10-25 15:43:46 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_uint(emit, 1, MP_BC_LOAD_FAST_N + kind, local_num);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-05-22 11:16:30 +00:00
|
|
|
void mp_emit_bc_load_global(emit_t *emit, qstr qst, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_LOAD_NAME + MP_EMIT_IDOP_GLOBAL_NAME == MP_BC_LOAD_NAME);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_LOAD_NAME + MP_EMIT_IDOP_GLOBAL_GLOBAL == MP_BC_LOAD_GLOBAL);
|
2015-01-20 12:47:20 +00:00
|
|
|
(void)qst;
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_qstr(emit, 1, MP_BC_LOAD_NAME + kind, qst);
|
2016-02-11 22:30:53 +00:00
|
|
|
if (MICROPY_OPT_CACHE_MAP_LOOKUP_IN_BYTECODE_DYNAMIC) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_raw_byte(emit, 0);
|
2015-01-06 12:51:39 +00:00
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2017-04-18 23:45:59 +00:00
|
|
|
void mp_emit_bc_load_method(emit_t *emit, qstr qst, bool is_super) {
|
2019-08-22 04:55:16 +00:00
|
|
|
int stack_adj = 1 - 2 * is_super;
|
|
|
|
emit_write_bytecode_byte_qstr(emit, stack_adj, is_super ? MP_BC_LOAD_SUPER_METHOD : MP_BC_LOAD_METHOD, qst);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_load_build_class(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 1, MP_BC_LOAD_BUILD_CLASS);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2018-05-22 11:31:56 +00:00
|
|
|
void mp_emit_bc_subscr(emit_t *emit, int kind) {
|
|
|
|
if (kind == MP_EMIT_SUBSCR_LOAD) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, -1, MP_BC_LOAD_SUBSCR);
|
2018-05-22 11:31:56 +00:00
|
|
|
} else {
|
|
|
|
if (kind == MP_EMIT_SUBSCR_DELETE) {
|
|
|
|
mp_emit_bc_load_null(emit);
|
|
|
|
mp_emit_bc_rot_three(emit);
|
|
|
|
}
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, -3, MP_BC_STORE_SUBSCR);
|
2018-05-22 11:31:56 +00:00
|
|
|
}
|
2014-04-17 21:10:53 +00:00
|
|
|
}
|
|
|
|
|
2018-05-22 11:43:41 +00:00
|
|
|
void mp_emit_bc_attr(emit_t *emit, qstr qst, int kind) {
|
|
|
|
if (kind == MP_EMIT_ATTR_LOAD) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_qstr(emit, 0, MP_BC_LOAD_ATTR, qst);
|
2018-05-22 11:43:41 +00:00
|
|
|
} else {
|
|
|
|
if (kind == MP_EMIT_ATTR_DELETE) {
|
|
|
|
mp_emit_bc_load_null(emit);
|
|
|
|
mp_emit_bc_rot_two(emit);
|
|
|
|
}
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_qstr(emit, -2, MP_BC_STORE_ATTR, qst);
|
2018-05-22 11:43:41 +00:00
|
|
|
}
|
|
|
|
if (MICROPY_OPT_CACHE_MAP_LOOKUP_IN_BYTECODE_DYNAMIC) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_raw_byte(emit, 0);
|
2018-05-22 11:43:41 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-05-18 14:11:04 +00:00
|
|
|
void mp_emit_bc_store_local(emit_t *emit, qstr qst, mp_uint_t local_num, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_STORE_FAST_N + MP_EMIT_IDOP_LOCAL_FAST == MP_BC_STORE_FAST_N);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_STORE_FAST_N + MP_EMIT_IDOP_LOCAL_DEREF == MP_BC_STORE_DEREF);
|
2015-01-20 12:47:20 +00:00
|
|
|
(void)qst;
|
2018-05-18 14:11:04 +00:00
|
|
|
if (kind == MP_EMIT_IDOP_LOCAL_FAST && local_num <= 15) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, -1, MP_BC_STORE_FAST_MULTI + local_num);
|
py: Compress load-int, load-fast, store-fast, unop, binop bytecodes.
There is a lot potential in compress bytecodes and make more use of the
coding space. This patch introduces "multi" bytecodes which have their
argument included in the bytecode (by addition).
UNARY_OP and BINARY_OP now no longer take a 1 byte argument for the
opcode. Rather, the opcode is included in the first byte itself.
LOAD_FAST_[0,1,2] and STORE_FAST_[0,1,2] are removed in favour of their
multi versions, which can take an argument between 0 and 15 inclusive.
The majority of LOAD_FAST/STORE_FAST codes fit in this range and so this
saves a byte for each of these.
LOAD_CONST_SMALL_INT_MULTI is used to load small ints between -16 and 47
inclusive. Such ints are quite common and now only need 1 byte to
store, and now have much faster decoding.
In all this patch saves about 2% RAM for typically bytecode (1.8% on
64-bit test, 2.5% on pyboard test). It also reduces the binary size
(because bytecodes are simplified) and doesn't harm performance.
2014-10-25 15:43:46 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_uint(emit, -1, MP_BC_STORE_FAST_N + kind, local_num);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-05-22 11:16:30 +00:00
|
|
|
void mp_emit_bc_store_global(emit_t *emit, qstr qst, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_STORE_NAME + MP_EMIT_IDOP_GLOBAL_NAME == MP_BC_STORE_NAME);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_STORE_NAME + MP_EMIT_IDOP_GLOBAL_GLOBAL == MP_BC_STORE_GLOBAL);
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_qstr(emit, -1, MP_BC_STORE_NAME + kind, qst);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2018-05-18 14:11:04 +00:00
|
|
|
void mp_emit_bc_delete_local(emit_t *emit, qstr qst, mp_uint_t local_num, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_DELETE_FAST + MP_EMIT_IDOP_LOCAL_FAST == MP_BC_DELETE_FAST);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_DELETE_FAST + MP_EMIT_IDOP_LOCAL_DEREF == MP_BC_DELETE_DEREF);
|
2015-01-20 12:47:20 +00:00
|
|
|
(void)qst;
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_uint(emit, 0, MP_BC_DELETE_FAST + kind, local_num);
|
2013-12-11 00:41:43 +00:00
|
|
|
}
|
|
|
|
|
2018-05-22 11:16:30 +00:00
|
|
|
void mp_emit_bc_delete_global(emit_t *emit, qstr qst, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_DELETE_NAME + MP_EMIT_IDOP_GLOBAL_NAME == MP_BC_DELETE_NAME);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_DELETE_NAME + MP_EMIT_IDOP_GLOBAL_GLOBAL == MP_BC_DELETE_GLOBAL);
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_qstr(emit, 0, MP_BC_DELETE_NAME + kind, qst);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_dup_top(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 1, MP_BC_DUP_TOP);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_dup_top_two(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 2, MP_BC_DUP_TOP_TWO);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_pop_top(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, -1, MP_BC_POP_TOP);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_rot_two(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 0, MP_BC_ROT_TWO);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_rot_three(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 0, MP_BC_ROT_THREE);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_jump(emit_t *emit, mp_uint_t label) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_signed_label(emit, 0, MP_BC_JUMP, label);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_pop_jump_if(emit_t *emit, bool cond, mp_uint_t label) {
|
2015-02-28 15:04:06 +00:00
|
|
|
if (cond) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_signed_label(emit, -1, MP_BC_POP_JUMP_IF_TRUE, label);
|
2015-02-28 15:04:06 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_signed_label(emit, -1, MP_BC_POP_JUMP_IF_FALSE, label);
|
2015-02-28 15:04:06 +00:00
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_jump_if_or_pop(emit_t *emit, bool cond, mp_uint_t label) {
|
2015-02-28 15:04:06 +00:00
|
|
|
if (cond) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_signed_label(emit, -1, MP_BC_JUMP_IF_TRUE_OR_POP, label);
|
2015-02-28 15:04:06 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_signed_label(emit, -1, MP_BC_JUMP_IF_FALSE_OR_POP, label);
|
2015-02-28 15:04:06 +00:00
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_unwind_jump(emit_t *emit, mp_uint_t label, mp_uint_t except_depth) {
|
2014-02-01 20:08:18 +00:00
|
|
|
if (except_depth == 0) {
|
2014-05-30 14:20:41 +00:00
|
|
|
if (label & MP_EMIT_BREAK_FROM_FOR) {
|
|
|
|
// need to pop the iterator if we are breaking out of a for loop
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_raw_byte(emit, MP_BC_POP_TOP);
|
2016-01-09 23:59:52 +00:00
|
|
|
// also pop the iter_buf
|
2017-03-23 05:36:08 +00:00
|
|
|
for (size_t i = 0; i < MP_OBJ_ITER_BUF_NSLOTS - 1; ++i) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_raw_byte(emit, MP_BC_POP_TOP);
|
2016-01-09 23:59:52 +00:00
|
|
|
}
|
2014-05-30 14:20:41 +00:00
|
|
|
}
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_signed_label(emit, 0, MP_BC_JUMP, label & ~MP_EMIT_BREAK_FROM_FOR);
|
2014-05-30 14:20:41 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_signed_label(emit, 0, MP_BC_UNWIND_JUMP, label & ~MP_EMIT_BREAK_FROM_FOR);
|
|
|
|
emit_write_bytecode_raw_byte(emit, ((label & MP_EMIT_BREAK_FROM_FOR) ? 0x80 : 0) | except_depth);
|
2014-02-01 20:08:18 +00:00
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2018-05-22 12:33:26 +00:00
|
|
|
void mp_emit_bc_setup_block(emit_t *emit, mp_uint_t label, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_SETUP_WITH + MP_EMIT_SETUP_BLOCK_WITH == MP_BC_SETUP_WITH);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_SETUP_WITH + MP_EMIT_SETUP_BLOCK_EXCEPT == MP_BC_SETUP_EXCEPT);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_SETUP_WITH + MP_EMIT_SETUP_BLOCK_FINALLY == MP_BC_SETUP_FINALLY);
|
2016-09-27 02:37:21 +00:00
|
|
|
// The SETUP_WITH opcode pops ctx_mgr from the top of the stack
|
|
|
|
// and then pushes 3 entries: __exit__, ctx_mgr, as_value.
|
2019-08-22 04:55:16 +00:00
|
|
|
int stack_adj = kind == MP_EMIT_SETUP_BLOCK_WITH ? 2 : 0;
|
|
|
|
emit_write_bytecode_byte_unsigned_label(emit, stack_adj, MP_BC_SETUP_WITH + kind, label);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2016-04-07 07:50:38 +00:00
|
|
|
void mp_emit_bc_with_cleanup(emit_t *emit, mp_uint_t label) {
|
|
|
|
mp_emit_bc_load_const_tok(emit, MP_TOKEN_KW_NONE);
|
|
|
|
mp_emit_bc_label_assign(emit, label);
|
2019-08-22 04:55:16 +00:00
|
|
|
// The +2 is to ensure we have enough stack space to call the __exit__ method
|
|
|
|
emit_write_bytecode_byte(emit, 2, MP_BC_WITH_CLEANUP);
|
|
|
|
// Cancel the +2 above, plus the +2 from mp_emit_bc_setup_block(MP_EMIT_SETUP_BLOCK_WITH)
|
|
|
|
mp_emit_bc_adjust_stack_size(emit, -4);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_end_finally(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, -1, MP_BC_END_FINALLY);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2016-01-09 23:59:52 +00:00
|
|
|
void mp_emit_bc_get_iter(emit_t *emit, bool use_stack) {
|
2019-08-22 04:55:16 +00:00
|
|
|
int stack_adj = use_stack ? MP_OBJ_ITER_BUF_NSLOTS - 1 : 0;
|
|
|
|
emit_write_bytecode_byte(emit, stack_adj, use_stack ? MP_BC_GET_ITER_STACK : MP_BC_GET_ITER);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_for_iter(emit_t *emit, mp_uint_t label) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_unsigned_label(emit, 1, MP_BC_FOR_ITER, label);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2017-01-17 04:30:18 +00:00
|
|
|
void mp_emit_bc_for_iter_end(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
mp_emit_bc_adjust_stack_size(emit, -MP_OBJ_ITER_BUF_NSLOTS);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2019-02-15 01:18:59 +00:00
|
|
|
void mp_emit_bc_pop_except_jump(emit_t *emit, mp_uint_t label, bool within_exc_handler) {
|
|
|
|
(void)within_exc_handler;
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_unsigned_label(emit, 0, MP_BC_POP_EXCEPT_JUMP, label);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_unary_op(emit_t *emit, mp_unary_op_t op) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 0, MP_BC_UNARY_OP_MULTI + op);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_binary_op(emit_t *emit, mp_binary_op_t op) {
|
2014-02-01 23:04:09 +00:00
|
|
|
bool invert = false;
|
2014-03-30 12:35:08 +00:00
|
|
|
if (op == MP_BINARY_OP_NOT_IN) {
|
2014-02-01 23:04:09 +00:00
|
|
|
invert = true;
|
2014-03-30 12:35:08 +00:00
|
|
|
op = MP_BINARY_OP_IN;
|
|
|
|
} else if (op == MP_BINARY_OP_IS_NOT) {
|
2014-02-01 23:04:09 +00:00
|
|
|
invert = true;
|
2014-03-30 12:35:08 +00:00
|
|
|
op = MP_BINARY_OP_IS;
|
2014-02-01 23:04:09 +00:00
|
|
|
}
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, -1, MP_BC_BINARY_OP_MULTI + op);
|
2014-02-01 23:04:09 +00:00
|
|
|
if (invert) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, 0, MP_BC_UNARY_OP_MULTI + MP_UNARY_OP_NOT);
|
2014-02-01 23:04:09 +00:00
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2018-05-18 14:41:40 +00:00
|
|
|
void mp_emit_bc_build(emit_t *emit, mp_uint_t n_args, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_BUILD_TUPLE + MP_EMIT_BUILD_TUPLE == MP_BC_BUILD_TUPLE);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_BUILD_TUPLE + MP_EMIT_BUILD_LIST == MP_BC_BUILD_LIST);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_BUILD_TUPLE + MP_EMIT_BUILD_MAP == MP_BC_BUILD_MAP);
|
2018-05-22 12:18:42 +00:00
|
|
|
MP_STATIC_ASSERT(MP_BC_BUILD_TUPLE + MP_EMIT_BUILD_SET == MP_BC_BUILD_SET);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_BUILD_TUPLE + MP_EMIT_BUILD_SLICE == MP_BC_BUILD_SLICE);
|
2019-08-22 04:55:16 +00:00
|
|
|
int stack_adj = kind == MP_EMIT_BUILD_MAP ? 1 : 1 - n_args;
|
|
|
|
emit_write_bytecode_byte_uint(emit, stack_adj, MP_BC_BUILD_TUPLE + kind, n_args);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_store_map(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, -2, MP_BC_STORE_MAP);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2016-09-18 13:59:47 +00:00
|
|
|
void mp_emit_bc_store_comp(emit_t *emit, scope_kind_t kind, mp_uint_t collection_stack_index) {
|
2016-09-18 22:46:01 +00:00
|
|
|
int t;
|
2016-09-18 13:59:47 +00:00
|
|
|
int n;
|
|
|
|
if (kind == SCOPE_LIST_COMP) {
|
2016-09-18 22:46:01 +00:00
|
|
|
n = 0;
|
|
|
|
t = 0;
|
|
|
|
} else if (!MICROPY_PY_BUILTINS_SET || kind == SCOPE_DICT_COMP) {
|
|
|
|
n = 1;
|
|
|
|
t = 1;
|
|
|
|
} else if (MICROPY_PY_BUILTINS_SET) {
|
|
|
|
n = 0;
|
|
|
|
t = 2;
|
|
|
|
}
|
|
|
|
// the lower 2 bits of the opcode argument indicate the collection type
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_uint(emit, -1 - n, MP_BC_STORE_COMP, ((collection_stack_index + n) << 2) | t);
|
2016-09-18 13:59:47 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_unpack_sequence(emit_t *emit, mp_uint_t n_args) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_uint(emit, -1 + n_args, MP_BC_UNPACK_SEQUENCE, n_args);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_unpack_ex(emit_t *emit, mp_uint_t n_left, mp_uint_t n_right) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_uint(emit, -1 + n_left + n_right + 1, MP_BC_UNPACK_EX, n_left | (n_right << 8));
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_make_function(emit_t *emit, scope_t *scope, mp_uint_t n_pos_defaults, mp_uint_t n_kw_defaults) {
|
2014-03-31 14:18:37 +00:00
|
|
|
if (n_pos_defaults == 0 && n_kw_defaults == 0) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_raw_code(emit, 1, MP_BC_MAKE_FUNCTION, scope->raw_code);
|
2014-02-01 18:29:40 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte_raw_code(emit, -1, MP_BC_MAKE_FUNCTION_DEFARGS, scope->raw_code);
|
2014-02-01 13:05:04 +00:00
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_make_closure(emit_t *emit, scope_t *scope, mp_uint_t n_closed_over, mp_uint_t n_pos_defaults, mp_uint_t n_kw_defaults) {
|
2014-03-31 14:18:37 +00:00
|
|
|
if (n_pos_defaults == 0 && n_kw_defaults == 0) {
|
2019-08-22 04:55:16 +00:00
|
|
|
int stack_adj = -n_closed_over + 1;
|
|
|
|
emit_write_bytecode_byte_raw_code(emit, stack_adj, MP_BC_MAKE_CLOSURE, scope->raw_code);
|
|
|
|
emit_write_bytecode_raw_byte(emit, n_closed_over);
|
2014-03-26 21:14:59 +00:00
|
|
|
} else {
|
2014-04-20 16:50:40 +00:00
|
|
|
assert(n_closed_over <= 255);
|
2019-08-22 04:55:16 +00:00
|
|
|
int stack_adj = -2 - (mp_int_t)n_closed_over + 1;
|
|
|
|
emit_write_bytecode_byte_raw_code(emit, stack_adj, MP_BC_MAKE_CLOSURE_DEFARGS, scope->raw_code);
|
|
|
|
emit_write_bytecode_raw_byte(emit, n_closed_over);
|
2014-03-26 21:14:59 +00:00
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2019-08-22 04:55:16 +00:00
|
|
|
STATIC void emit_bc_call_function_method_helper(emit_t *emit, int stack_adj, mp_uint_t bytecode_base, mp_uint_t n_positional, mp_uint_t n_keyword, mp_uint_t star_flags) {
|
2014-04-09 11:43:17 +00:00
|
|
|
if (star_flags) {
|
2019-08-22 04:55:16 +00:00
|
|
|
stack_adj -= (int)n_positional + 2 * (int)n_keyword + 2;
|
|
|
|
emit_write_bytecode_byte_uint(emit, stack_adj, bytecode_base + 1, (n_keyword << 8) | n_positional); // TODO make it 2 separate uints?
|
2013-10-04 18:53:11 +00:00
|
|
|
} else {
|
2019-08-22 04:55:16 +00:00
|
|
|
stack_adj -= (int)n_positional + 2 * (int)n_keyword;
|
|
|
|
emit_write_bytecode_byte_uint(emit, stack_adj, bytecode_base, (n_keyword << 8) | n_positional); // TODO make it 2 separate uints?
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
2014-03-31 10:59:23 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_call_function(emit_t *emit, mp_uint_t n_positional, mp_uint_t n_keyword, mp_uint_t star_flags) {
|
2014-04-09 11:43:17 +00:00
|
|
|
emit_bc_call_function_method_helper(emit, 0, MP_BC_CALL_FUNCTION, n_positional, n_keyword, star_flags);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_call_method(emit_t *emit, mp_uint_t n_positional, mp_uint_t n_keyword, mp_uint_t star_flags) {
|
2014-04-09 11:43:17 +00:00
|
|
|
emit_bc_call_function_method_helper(emit, -1, MP_BC_CALL_METHOD, n_positional, n_keyword, star_flags);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_return_value(emit_t *emit) {
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, -1, MP_BC_RETURN_VALUE);
|
2013-10-04 18:53:11 +00:00
|
|
|
emit->last_emit_was_return_value = true;
|
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_raise_varargs(emit_t *emit, mp_uint_t n_args) {
|
2019-08-22 02:39:07 +00:00
|
|
|
MP_STATIC_ASSERT(MP_BC_RAISE_LAST + 1 == MP_BC_RAISE_OBJ);
|
|
|
|
MP_STATIC_ASSERT(MP_BC_RAISE_LAST + 2 == MP_BC_RAISE_FROM);
|
2016-10-25 09:05:33 +00:00
|
|
|
assert(n_args <= 2);
|
2019-08-22 02:39:07 +00:00
|
|
|
emit_write_bytecode_byte(emit, -n_args, MP_BC_RAISE_LAST + n_args);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2018-05-18 14:30:42 +00:00
|
|
|
void mp_emit_bc_yield(emit_t *emit, int kind) {
|
|
|
|
MP_STATIC_ASSERT(MP_BC_YIELD_VALUE + 1 == MP_BC_YIELD_FROM);
|
2019-08-22 04:55:16 +00:00
|
|
|
emit_write_bytecode_byte(emit, -kind, MP_BC_YIELD_VALUE + kind);
|
2014-05-07 16:24:22 +00:00
|
|
|
emit->scope->scope_flags |= MP_SCOPE_FLAG_GENERATOR;
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_start_except_handler(emit_t *emit) {
|
2016-09-27 02:37:21 +00:00
|
|
|
mp_emit_bc_adjust_stack_size(emit, 4); // stack adjust for the exception instance, +3 for possible UNWIND_JUMP state
|
2014-06-30 04:17:25 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
void mp_emit_bc_end_except_handler(emit_t *emit) {
|
2016-09-27 02:37:21 +00:00
|
|
|
mp_emit_bc_adjust_stack_size(emit, -3); // stack adjust
|
2014-06-30 04:17:25 +00:00
|
|
|
}
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
#if MICROPY_EMIT_NATIVE
|
2013-10-05 17:08:26 +00:00
|
|
|
const emit_method_table_t emit_bc_method_table = {
|
2019-03-08 23:59:25 +00:00
|
|
|
#if MICROPY_DYNAMIC_COMPILER
|
|
|
|
NULL,
|
|
|
|
NULL,
|
|
|
|
#endif
|
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_start_pass,
|
|
|
|
mp_emit_bc_end_pass,
|
|
|
|
mp_emit_bc_last_emit_was_return_value,
|
|
|
|
mp_emit_bc_adjust_stack_size,
|
|
|
|
mp_emit_bc_set_source_line,
|
2013-10-05 11:19:06 +00:00
|
|
|
|
2015-03-26 14:42:40 +00:00
|
|
|
{
|
2018-05-18 14:11:04 +00:00
|
|
|
mp_emit_bc_load_local,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_load_global,
|
2015-03-26 14:42:40 +00:00
|
|
|
},
|
|
|
|
{
|
2018-05-18 14:11:04 +00:00
|
|
|
mp_emit_bc_store_local,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_store_global,
|
2015-03-26 14:42:40 +00:00
|
|
|
},
|
|
|
|
{
|
2018-05-18 14:11:04 +00:00
|
|
|
mp_emit_bc_delete_local,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_delete_global,
|
2015-03-26 14:42:40 +00:00
|
|
|
},
|
2013-10-05 13:17:09 +00:00
|
|
|
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_label_assign,
|
2018-05-22 11:58:25 +00:00
|
|
|
mp_emit_bc_import,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_load_const_tok,
|
|
|
|
mp_emit_bc_load_const_small_int,
|
|
|
|
mp_emit_bc_load_const_str,
|
|
|
|
mp_emit_bc_load_const_obj,
|
|
|
|
mp_emit_bc_load_null,
|
|
|
|
mp_emit_bc_load_method,
|
|
|
|
mp_emit_bc_load_build_class,
|
2018-05-22 11:31:56 +00:00
|
|
|
mp_emit_bc_subscr,
|
2018-05-22 11:43:41 +00:00
|
|
|
mp_emit_bc_attr,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_dup_top,
|
|
|
|
mp_emit_bc_dup_top_two,
|
|
|
|
mp_emit_bc_pop_top,
|
|
|
|
mp_emit_bc_rot_two,
|
|
|
|
mp_emit_bc_rot_three,
|
|
|
|
mp_emit_bc_jump,
|
|
|
|
mp_emit_bc_pop_jump_if,
|
|
|
|
mp_emit_bc_jump_if_or_pop,
|
|
|
|
mp_emit_bc_unwind_jump,
|
2018-05-22 12:33:26 +00:00
|
|
|
mp_emit_bc_setup_block,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_with_cleanup,
|
|
|
|
mp_emit_bc_end_finally,
|
|
|
|
mp_emit_bc_get_iter,
|
|
|
|
mp_emit_bc_for_iter,
|
|
|
|
mp_emit_bc_for_iter_end,
|
2019-02-15 01:18:59 +00:00
|
|
|
mp_emit_bc_pop_except_jump,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_unary_op,
|
|
|
|
mp_emit_bc_binary_op,
|
2018-05-18 14:41:40 +00:00
|
|
|
mp_emit_bc_build,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_store_map,
|
2016-09-18 13:59:47 +00:00
|
|
|
mp_emit_bc_store_comp,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_unpack_sequence,
|
|
|
|
mp_emit_bc_unpack_ex,
|
|
|
|
mp_emit_bc_make_function,
|
|
|
|
mp_emit_bc_make_closure,
|
|
|
|
mp_emit_bc_call_function,
|
|
|
|
mp_emit_bc_call_method,
|
|
|
|
mp_emit_bc_return_value,
|
|
|
|
mp_emit_bc_raise_varargs,
|
2018-05-18 14:30:42 +00:00
|
|
|
mp_emit_bc_yield,
|
2015-03-26 16:44:14 +00:00
|
|
|
|
|
|
|
mp_emit_bc_start_except_handler,
|
|
|
|
mp_emit_bc_end_except_handler,
|
|
|
|
};
|
|
|
|
#else
|
|
|
|
const mp_emit_method_table_id_ops_t mp_emit_bc_method_table_load_id_ops = {
|
2018-05-18 14:11:04 +00:00
|
|
|
mp_emit_bc_load_local,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_load_global,
|
|
|
|
};
|
|
|
|
|
|
|
|
const mp_emit_method_table_id_ops_t mp_emit_bc_method_table_store_id_ops = {
|
2018-05-18 14:11:04 +00:00
|
|
|
mp_emit_bc_store_local,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_store_global,
|
|
|
|
};
|
|
|
|
|
|
|
|
const mp_emit_method_table_id_ops_t mp_emit_bc_method_table_delete_id_ops = {
|
2018-05-18 14:11:04 +00:00
|
|
|
mp_emit_bc_delete_local,
|
2015-03-26 16:44:14 +00:00
|
|
|
mp_emit_bc_delete_global,
|
2013-10-05 11:19:06 +00:00
|
|
|
};
|
2015-03-26 16:44:14 +00:00
|
|
|
#endif
|
2015-12-18 12:35:44 +00:00
|
|
|
|
2020-04-16 07:13:57 +00:00
|
|
|
#endif // MICROPY_ENABLE_COMPILER
|