2014-05-03 23:27:38 +01:00
|
|
|
/*
|
2017-06-30 08:22:17 +01:00
|
|
|
* This file is part of the MicroPython project, http://micropython.org/
|
2014-05-03 23:27:38 +01: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 19:53:11 +01:00
|
|
|
#include <assert.h>
|
|
|
|
|
2015-01-01 20:27:54 +00:00
|
|
|
#include "py/scope.h"
|
2013-10-04 19:53:11 +01:00
|
|
|
|
2015-12-18 12:35:44 +00:00
|
|
|
#if MICROPY_ENABLE_COMPILER
|
|
|
|
|
2020-04-10 21:09:29 +01:00
|
|
|
// These low numbered qstrs should fit in 8 bits. See assertions below.
|
2016-09-30 03:34:05 +01: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_,
|
|
|
|
};
|
|
|
|
|
2014-08-30 14:59:21 +01:00
|
|
|
scope_t *scope_new(scope_kind_t kind, mp_parse_node_t pn, qstr source_file, mp_uint_t emit_options) {
|
2020-04-10 21:09:29 +01: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 12:27:39 +01:00
|
|
|
scope_t *scope = m_new0(scope_t, 1);
|
2013-10-04 19:53:11 +01:00
|
|
|
scope->kind = kind;
|
|
|
|
scope->pn = pn;
|
2014-01-19 11:48:48 +00:00
|
|
|
scope->source_file = source_file;
|
2016-09-30 03:34:05 +01:00
|
|
|
if (kind == SCOPE_FUNCTION || kind == SCOPE_CLASS) {
|
|
|
|
assert(MP_PARSE_NODE_IS_STRUCT(pn));
|
|
|
|
scope->simple_name = MP_PARSE_NODE_LEAF_ARG(((mp_parse_node_struct_t *)pn)->nodes[0]);
|
|
|
|
} else {
|
|
|
|
scope->simple_name = scope_simple_name_table[kind];
|
2013-10-04 19:53:11 +01:00
|
|
|
}
|
2014-04-13 11:04:33 +01:00
|
|
|
scope->raw_code = mp_emit_glue_new_raw_code();
|
2013-10-05 18:08:26 +01:00
|
|
|
scope->emit_options = emit_options;
|
2014-05-21 20:32:59 +01:00
|
|
|
scope->id_info_alloc = MICROPY_ALLOC_SCOPE_ID_INIT;
|
2014-04-09 12:27:39 +01:00
|
|
|
scope->id_info = m_new(id_info_t, scope->id_info_alloc);
|
2013-10-04 19:53:11 +01: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 09:42:57 +01:00
|
|
|
id_info_t *scope_find_or_add_id(scope_t *scope, qstr qst, id_info_kind_t kind) {
|
2014-09-08 23:05:16 +01:00
|
|
|
id_info_t *id_info = scope_find(scope, qst);
|
2014-08-15 14:30:52 +01:00
|
|
|
if (id_info != NULL) {
|
|
|
|
return id_info;
|
2013-10-04 19:53:11 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// make sure we have enough memory
|
|
|
|
if (scope->id_info_len >= scope->id_info_alloc) {
|
2014-05-21 20:32:59 +01: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 19:53:11 +01: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 14:30:52 +01:00
|
|
|
id_info = &scope->id_info[scope->id_info_len++];
|
2013-10-04 19:53:11 +01:00
|
|
|
|
2018-10-27 12:41:21 +01:00
|
|
|
id_info->kind = kind;
|
2014-04-09 14:42:51 +01:00
|
|
|
id_info->flags = 0;
|
2013-10-20 15:07:49 +01:00
|
|
|
id_info->local_num = 0;
|
2014-09-08 23:05:16 +01:00
|
|
|
id_info->qst = qst;
|
2013-10-04 19:53:11 +01:00
|
|
|
return id_info;
|
|
|
|
}
|
|
|
|
|
2014-09-08 23:05:16 +01:00
|
|
|
id_info_t *scope_find(scope_t *scope, qstr qst) {
|
2014-08-15 14:30:52 +01:00
|
|
|
for (mp_uint_t i = 0; i < scope->id_info_len; i++) {
|
2014-09-08 23:05:16 +01:00
|
|
|
if (scope->id_info[i].qst == qst) {
|
2013-10-04 19:53:11 +01:00
|
|
|
return &scope->id_info[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2014-09-08 23:05:16 +01:00
|
|
|
id_info_t *scope_find_global(scope_t *scope, qstr qst) {
|
2013-10-04 19:53:11 +01:00
|
|
|
while (scope->parent != NULL) {
|
|
|
|
scope = scope->parent;
|
|
|
|
}
|
2014-09-08 23:05:16 +01:00
|
|
|
return scope_find(scope, qst);
|
2013-10-04 19:53:11 +01:00
|
|
|
}
|
|
|
|
|
2016-09-30 04:53:00 +01:00
|
|
|
STATIC void scope_close_over_in_parents(scope_t *scope, qstr qst) {
|
2013-10-04 19:53:11 +01:00
|
|
|
assert(scope->parent != NULL); // we should have at least 1 parent
|
2016-09-30 04:53:00 +01: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 12:41:21 +01: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 14:30:52 +01:00
|
|
|
// variable not previously declared in this scope, so declare it as free and keep searching parents
|
2013-10-04 19:53:11 +01:00
|
|
|
id->kind = ID_INFO_KIND_FREE;
|
|
|
|
} else {
|
|
|
|
// variable is declared in this scope, so finish
|
2016-09-30 04:53:00 +01: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 19:53:11 +01:00
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2016-09-30 04:53:00 +01:00
|
|
|
}
|
|
|
|
|
2018-10-26 06:48:07 +01:00
|
|
|
void scope_check_to_close_over(scope_t *scope, id_info_t *id) {
|
2016-09-30 04:53:00 +01:00
|
|
|
if (scope->parent != NULL) {
|
|
|
|
for (scope_t *s = scope->parent; s->parent != NULL; s = s->parent) {
|
2018-10-26 06:48:07 +01:00
|
|
|
id_info_t *id2 = scope_find(s, id->qst);
|
2016-09-30 04:53:00 +01: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 06:48:07 +01:00
|
|
|
scope_close_over_in_parents(scope, id->qst);
|
2016-09-30 04:53:00 +01:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-10-04 19:53:11 +01:00
|
|
|
}
|
2015-12-18 12:35:44 +00:00
|
|
|
|
|
|
|
#endif // MICROPY_ENABLE_COMPILER
|