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)
|
|
|
|
*
|
|
|
|
* Copyright (c) 2013, 2014 Damien P. George
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2013-10-04 18:53:11 +00:00
|
|
|
#include <assert.h>
|
|
|
|
|
2015-01-01 20:27:54 +00:00
|
|
|
#include "py/scope.h"
|
2013-10-04 18:53:11 +00:00
|
|
|
|
2015-12-18 12:35:44 +00:00
|
|
|
#if MICROPY_ENABLE_COMPILER
|
|
|
|
|
2020-04-10 20:09:29 +00:00
|
|
|
// These low numbered qstrs should fit in 8 bits. See assertions below.
|
2016-09-30 02:34:05 +00:00
|
|
|
STATIC const uint8_t scope_simple_name_table[] = {
|
|
|
|
[SCOPE_MODULE] = MP_QSTR__lt_module_gt_,
|
|
|
|
[SCOPE_LAMBDA] = MP_QSTR__lt_lambda_gt_,
|
|
|
|
[SCOPE_LIST_COMP] = MP_QSTR__lt_listcomp_gt_,
|
|
|
|
[SCOPE_DICT_COMP] = MP_QSTR__lt_dictcomp_gt_,
|
|
|
|
[SCOPE_SET_COMP] = MP_QSTR__lt_setcomp_gt_,
|
|
|
|
[SCOPE_GEN_EXPR] = MP_QSTR__lt_genexpr_gt_,
|
|
|
|
};
|
|
|
|
|
py: Rework bytecode and .mpy file format to be mostly static data.
Background: .mpy files are precompiled .py files, built using mpy-cross,
that contain compiled bytecode functions (and can also contain machine
code). The benefit of using an .mpy file over a .py file is that they are
faster to import and take less memory when importing. They are also
smaller on disk.
But the real benefit of .mpy files comes when they are frozen into the
firmware. This is done by loading the .mpy file during compilation of the
firmware and turning it into a set of big C data structures (the job of
mpy-tool.py), which are then compiled and downloaded into the ROM of a
device. These C data structures can be executed in-place, ie directly from
ROM. This makes importing even faster because there is very little to do,
and also means such frozen modules take up much less RAM (because their
bytecode stays in ROM).
The downside of frozen code is that it requires recompiling and reflashing
the entire firmware. This can be a big barrier to entry, slows down
development time, and makes it harder to do OTA updates of frozen code
(because the whole firmware must be updated).
This commit attempts to solve this problem by providing a solution that
sits between loading .mpy files into RAM and freezing them into the
firmware. The .mpy file format has been reworked so that it consists of
data and bytecode which is mostly static and ready to run in-place. If
these new .mpy files are located in flash/ROM which is memory addressable,
the .mpy file can be executed (mostly) in-place.
With this approach there is still a small amount of unpacking and linking
of the .mpy file that needs to be done when it's imported, but it's still
much better than loading an .mpy from disk into RAM (although not as good
as freezing .mpy files into the firmware).
The main trick to make static .mpy files is to adjust the bytecode so any
qstrs that it references now go through a lookup table to convert from
local qstr number in the module to global qstr number in the firmware.
That means the bytecode does not need linking/rewriting of qstrs when it's
loaded. Instead only a small qstr table needs to be built (and put in RAM)
at import time. This means the bytecode itself is static/constant and can
be used directly if it's in addressable memory. Also the qstr string data
in the .mpy file, and some constant object data, can be used directly.
Note that the qstr table is global to the module (ie not per function).
In more detail, in the VM what used to be (schematically):
qst = DECODE_QSTR_VALUE;
is now (schematically):
idx = DECODE_QSTR_INDEX;
qst = qstr_table[idx];
That allows the bytecode to be fixed at compile time and not need
relinking/rewriting of the qstr values. Only qstr_table needs to be linked
when the .mpy is loaded.
Incidentally, this helps to reduce the size of bytecode because what used
to be 2-byte qstr values in the bytecode are now (mostly) 1-byte indices.
If the module uses the same qstr more than two times then the bytecode is
smaller than before.
The following changes are measured for this commit compared to the
previous (the baseline):
- average 7%-9% reduction in size of .mpy files
- frozen code size is reduced by about 5%-7%
- importing .py files uses about 5% less RAM in total
- importing .mpy files uses about 4% less RAM in total
- importing .py and .mpy files takes about the same time as before
The qstr indirection in the bytecode has only a small impact on VM
performance. For stm32 on PYBv1.0 the performance change of this commit
is:
diff of scores (higher is better)
N=100 M=100 baseline -> this-commit diff diff% (error%)
bm_chaos.py 371.07 -> 357.39 : -13.68 = -3.687% (+/-0.02%)
bm_fannkuch.py 78.72 -> 77.49 : -1.23 = -1.563% (+/-0.01%)
bm_fft.py 2591.73 -> 2539.28 : -52.45 = -2.024% (+/-0.00%)
bm_float.py 6034.93 -> 5908.30 : -126.63 = -2.098% (+/-0.01%)
bm_hexiom.py 48.96 -> 47.93 : -1.03 = -2.104% (+/-0.00%)
bm_nqueens.py 4510.63 -> 4459.94 : -50.69 = -1.124% (+/-0.00%)
bm_pidigits.py 650.28 -> 644.96 : -5.32 = -0.818% (+/-0.23%)
core_import_mpy_multi.py 564.77 -> 581.49 : +16.72 = +2.960% (+/-0.01%)
core_import_mpy_single.py 68.67 -> 67.16 : -1.51 = -2.199% (+/-0.01%)
core_qstr.py 64.16 -> 64.12 : -0.04 = -0.062% (+/-0.00%)
core_yield_from.py 362.58 -> 354.50 : -8.08 = -2.228% (+/-0.00%)
misc_aes.py 429.69 -> 405.59 : -24.10 = -5.609% (+/-0.01%)
misc_mandel.py 3485.13 -> 3416.51 : -68.62 = -1.969% (+/-0.00%)
misc_pystone.py 2496.53 -> 2405.56 : -90.97 = -3.644% (+/-0.01%)
misc_raytrace.py 381.47 -> 374.01 : -7.46 = -1.956% (+/-0.01%)
viper_call0.py 576.73 -> 572.49 : -4.24 = -0.735% (+/-0.04%)
viper_call1a.py 550.37 -> 546.21 : -4.16 = -0.756% (+/-0.09%)
viper_call1b.py 438.23 -> 435.68 : -2.55 = -0.582% (+/-0.06%)
viper_call1c.py 442.84 -> 440.04 : -2.80 = -0.632% (+/-0.08%)
viper_call2a.py 536.31 -> 532.35 : -3.96 = -0.738% (+/-0.06%)
viper_call2b.py 382.34 -> 377.07 : -5.27 = -1.378% (+/-0.03%)
And for unix on x64:
diff of scores (higher is better)
N=2000 M=2000 baseline -> this-commit diff diff% (error%)
bm_chaos.py 13594.20 -> 13073.84 : -520.36 = -3.828% (+/-5.44%)
bm_fannkuch.py 60.63 -> 59.58 : -1.05 = -1.732% (+/-3.01%)
bm_fft.py 112009.15 -> 111603.32 : -405.83 = -0.362% (+/-4.03%)
bm_float.py 246202.55 -> 247923.81 : +1721.26 = +0.699% (+/-2.79%)
bm_hexiom.py 615.65 -> 617.21 : +1.56 = +0.253% (+/-1.64%)
bm_nqueens.py 215807.95 -> 215600.96 : -206.99 = -0.096% (+/-3.52%)
bm_pidigits.py 8246.74 -> 8422.82 : +176.08 = +2.135% (+/-3.64%)
misc_aes.py 16133.00 -> 16452.74 : +319.74 = +1.982% (+/-1.50%)
misc_mandel.py 128146.69 -> 130796.43 : +2649.74 = +2.068% (+/-3.18%)
misc_pystone.py 83811.49 -> 83124.85 : -686.64 = -0.819% (+/-1.03%)
misc_raytrace.py 21688.02 -> 21385.10 : -302.92 = -1.397% (+/-3.20%)
The code size change is (firmware with a lot of frozen code benefits the
most):
bare-arm: +396 +0.697%
minimal x86: +1595 +0.979% [incl +32(data)]
unix x64: +2408 +0.470% [incl +800(data)]
unix nanbox: +1396 +0.309% [incl -96(data)]
stm32: -1256 -0.318% PYBV10
cc3200: +288 +0.157%
esp8266: -260 -0.037% GENERIC
esp32: -216 -0.014% GENERIC[incl -1072(data)]
nrf: +116 +0.067% pca10040
rp2: -664 -0.135% PICO
samd: +844 +0.607% ADAFRUIT_ITSYBITSY_M4_EXPRESS
As part of this change the .mpy file format version is bumped to version 6.
And mpy-tool.py has been improved to provide a good visualisation of the
contents of .mpy files.
In summary: this commit changes the bytecode to use qstr indirection, and
reworks the .mpy file format to be simpler and allow .mpy files to be
executed in-place. Performance is not impacted too much. Eventually it
will be possible to store such .mpy files in a linear, read-only, memory-
mappable filesystem so they can be executed from flash/ROM. This will
essentially be able to replace frozen code for most applications.
Signed-off-by: Damien George <damien@micropython.org>
2021-10-22 11:22:47 +00:00
|
|
|
scope_t *scope_new(scope_kind_t kind, mp_parse_node_t pn, mp_uint_t emit_options) {
|
2020-04-10 20:09:29 +00:00
|
|
|
// Make sure those qstrs indeed fit in an uint8_t.
|
|
|
|
MP_STATIC_ASSERT(MP_QSTR__lt_module_gt_ <= UINT8_MAX);
|
|
|
|
MP_STATIC_ASSERT(MP_QSTR__lt_lambda_gt_ <= UINT8_MAX);
|
|
|
|
MP_STATIC_ASSERT(MP_QSTR__lt_listcomp_gt_ <= UINT8_MAX);
|
|
|
|
MP_STATIC_ASSERT(MP_QSTR__lt_dictcomp_gt_ <= UINT8_MAX);
|
|
|
|
MP_STATIC_ASSERT(MP_QSTR__lt_setcomp_gt_ <= UINT8_MAX);
|
|
|
|
MP_STATIC_ASSERT(MP_QSTR__lt_genexpr_gt_ <= UINT8_MAX);
|
|
|
|
|
2014-04-09 11:27:39 +00:00
|
|
|
scope_t *scope = m_new0(scope_t, 1);
|
2013-10-04 18:53:11 +00:00
|
|
|
scope->kind = kind;
|
|
|
|
scope->pn = pn;
|
2016-09-30 02:34:05 +00:00
|
|
|
if (kind == SCOPE_FUNCTION || kind == SCOPE_CLASS) {
|
|
|
|
assert(MP_PARSE_NODE_IS_STRUCT(pn));
|
2020-02-27 04:36:53 +00:00
|
|
|
scope->simple_name = MP_PARSE_NODE_LEAF_ARG(((mp_parse_node_struct_t *)pn)->nodes[0]);
|
2016-09-30 02:34:05 +00:00
|
|
|
} else {
|
|
|
|
scope->simple_name = scope_simple_name_table[kind];
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
2014-04-13 10:04:33 +00:00
|
|
|
scope->raw_code = mp_emit_glue_new_raw_code();
|
2013-10-05 17:08:26 +00:00
|
|
|
scope->emit_options = emit_options;
|
2014-05-21 19:32:59 +00:00
|
|
|
scope->id_info_alloc = MICROPY_ALLOC_SCOPE_ID_INIT;
|
2014-04-09 11:27:39 +00:00
|
|
|
scope->id_info = m_new(id_info_t, scope->id_info_alloc);
|
2013-10-04 18:53:11 +00:00
|
|
|
|
|
|
|
return scope;
|
|
|
|
}
|
|
|
|
|
2014-01-23 21:05:47 +00:00
|
|
|
void scope_free(scope_t *scope) {
|
|
|
|
m_del(id_info_t, scope->id_info, scope->id_info_alloc);
|
|
|
|
m_del(scope_t, scope, 1);
|
|
|
|
}
|
|
|
|
|
2020-10-03 08:42:57 +00:00
|
|
|
id_info_t *scope_find_or_add_id(scope_t *scope, qstr qst, id_info_kind_t kind) {
|
2014-09-08 22:05:16 +00:00
|
|
|
id_info_t *id_info = scope_find(scope, qst);
|
2014-08-15 13:30:52 +00:00
|
|
|
if (id_info != NULL) {
|
|
|
|
return id_info;
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// make sure we have enough memory
|
|
|
|
if (scope->id_info_len >= scope->id_info_alloc) {
|
2014-05-21 19:32:59 +00:00
|
|
|
scope->id_info = m_renew(id_info_t, scope->id_info, scope->id_info_alloc, scope->id_info_alloc + MICROPY_ALLOC_SCOPE_ID_INC);
|
|
|
|
scope->id_info_alloc += MICROPY_ALLOC_SCOPE_ID_INC;
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2014-01-19 11:48:48 +00:00
|
|
|
// add new id to end of array of all ids; this seems to match CPython
|
|
|
|
// important thing is that function arguments are first, but that is
|
|
|
|
// handled by the compiler because it adds arguments before compiling the body
|
2014-08-15 13:30:52 +00:00
|
|
|
id_info = &scope->id_info[scope->id_info_len++];
|
2013-10-04 18:53:11 +00:00
|
|
|
|
2018-10-27 11:41:21 +00:00
|
|
|
id_info->kind = kind;
|
2014-04-09 13:42:51 +00:00
|
|
|
id_info->flags = 0;
|
2013-10-20 14:07:49 +00:00
|
|
|
id_info->local_num = 0;
|
2014-09-08 22:05:16 +00:00
|
|
|
id_info->qst = qst;
|
2013-10-04 18:53:11 +00:00
|
|
|
return id_info;
|
|
|
|
}
|
|
|
|
|
2014-09-08 22:05:16 +00:00
|
|
|
id_info_t *scope_find(scope_t *scope, qstr qst) {
|
2014-08-15 13:30:52 +00:00
|
|
|
for (mp_uint_t i = 0; i < scope->id_info_len; i++) {
|
2014-09-08 22:05:16 +00:00
|
|
|
if (scope->id_info[i].qst == qst) {
|
2013-10-04 18:53:11 +00:00
|
|
|
return &scope->id_info[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2014-09-08 22:05:16 +00:00
|
|
|
id_info_t *scope_find_global(scope_t *scope, qstr qst) {
|
2013-10-04 18:53:11 +00:00
|
|
|
while (scope->parent != NULL) {
|
|
|
|
scope = scope->parent;
|
|
|
|
}
|
2014-09-08 22:05:16 +00:00
|
|
|
return scope_find(scope, qst);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
|
2016-09-30 03:53:00 +00:00
|
|
|
STATIC void scope_close_over_in_parents(scope_t *scope, qstr qst) {
|
2013-10-04 18:53:11 +00:00
|
|
|
assert(scope->parent != NULL); // we should have at least 1 parent
|
2016-09-30 03:53:00 +00:00
|
|
|
for (scope_t *s = scope->parent;; s = s->parent) {
|
|
|
|
assert(s->parent != NULL); // we should not get to the outer scope
|
2018-10-27 11:41:21 +00:00
|
|
|
id_info_t *id = scope_find_or_add_id(s, qst, ID_INFO_KIND_UNDECIDED);
|
|
|
|
if (id->kind == ID_INFO_KIND_UNDECIDED) {
|
2014-08-15 13:30:52 +00:00
|
|
|
// variable not previously declared in this scope, so declare it as free and keep searching parents
|
2013-10-04 18:53:11 +00:00
|
|
|
id->kind = ID_INFO_KIND_FREE;
|
|
|
|
} else {
|
|
|
|
// variable is declared in this scope, so finish
|
2016-09-30 03:53:00 +00:00
|
|
|
if (id->kind == ID_INFO_KIND_LOCAL) {
|
|
|
|
// variable local to this scope, close it over
|
|
|
|
id->kind = ID_INFO_KIND_CELL;
|
|
|
|
} else {
|
|
|
|
// ID_INFO_KIND_FREE: variable already closed over in a parent scope
|
|
|
|
// ID_INFO_KIND_CELL: variable already closed over in this scope
|
|
|
|
assert(id->kind == ID_INFO_KIND_FREE || id->kind == ID_INFO_KIND_CELL);
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2016-09-30 03:53:00 +00:00
|
|
|
}
|
|
|
|
|
2018-10-26 05:48:07 +00:00
|
|
|
void scope_check_to_close_over(scope_t *scope, id_info_t *id) {
|
2016-09-30 03:53:00 +00:00
|
|
|
if (scope->parent != NULL) {
|
|
|
|
for (scope_t *s = scope->parent; s->parent != NULL; s = s->parent) {
|
2018-10-26 05:48:07 +00:00
|
|
|
id_info_t *id2 = scope_find(s, id->qst);
|
2016-09-30 03:53:00 +00:00
|
|
|
if (id2 != NULL) {
|
|
|
|
if (id2->kind == ID_INFO_KIND_LOCAL || id2->kind == ID_INFO_KIND_CELL || id2->kind == ID_INFO_KIND_FREE) {
|
|
|
|
id->kind = ID_INFO_KIND_FREE;
|
2018-10-26 05:48:07 +00:00
|
|
|
scope_close_over_in_parents(scope, id->qst);
|
2016-09-30 03:53:00 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-10-04 18:53:11 +00:00
|
|
|
}
|
2015-12-18 12:35:44 +00:00
|
|
|
|
|
|
|
#endif // MICROPY_ENABLE_COMPILER
|