compile.c 125 KB
Newer Older
Damien's avatar
Damien committed
1
2
3
4
5
6
7
8
#include <unistd.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>

#include "misc.h"
9
#include "mpconfig.h"
10
#include "qstr.h"
Damien's avatar
Damien committed
11
12
13
#include "lexer.h"
#include "parse.h"
#include "scope.h"
14
#include "runtime0.h"
Damien's avatar
Damien committed
15
#include "emit.h"
16
17
18
#include "obj.h"
#include "compile.h"
#include "runtime.h"
Damien's avatar
Damien committed
19
20
21

// TODO need to mangle __attr names

22
23
#define MICROPY_EMIT_NATIVE (MICROPY_EMIT_X64 || MICROPY_EMIT_THUMB)

Damien's avatar
Damien committed
24
25
typedef enum {
    PN_none = 0,
26
#define DEF_RULE(rule, comp, kind, ...) PN_##rule,
Damien's avatar
Damien committed
27
28
29
30
31
#include "grammar.h"
#undef DEF_RULE
    PN_maximum_number_of,
} pn_kind_t;

32
33
34
35
#define EMIT(fun) (comp->emit_method_table->fun(comp->emit))
#define EMIT_ARG(fun, ...) (comp->emit_method_table->fun(comp->emit, __VA_ARGS__))
#define EMIT_INLINE_ASM(fun) (comp->emit_inline_asm_method_table->fun(comp->emit_inline_asm))
#define EMIT_INLINE_ASM_ARG(fun, ...) (comp->emit_inline_asm_method_table->fun(comp->emit_inline_asm, __VA_ARGS__))
Damien's avatar
Damien committed
36

37
38
39
#define EMIT_OPT_NONE           (0)
#define EMIT_OPT_BYTE_CODE      (1)
#define EMIT_OPT_NATIVE_PYTHON  (2)
Damien's avatar
Damien committed
40
41
#define EMIT_OPT_VIPER          (3)
#define EMIT_OPT_ASM_THUMB      (4)
42

Damien's avatar
Damien committed
43
typedef struct _compiler_t {
44
    qstr source_file;
Damien's avatar
Damien committed
45
    bool is_repl;
Damien's avatar
Damien committed
46
    pass_kind_t pass;
Damien's avatar
Damien committed
47
    bool had_error; // try to keep compiler clean from nlr
Damien's avatar
Damien committed
48

49
50
    int next_label;

Damien's avatar
Damien committed
51
52
    int break_label;
    int continue_label;
53
54
    int break_continue_except_level;
    int cur_except_level; // increased for SETUP_EXCEPT, SETUP_FINALLY; decreased for POP_BLOCK, POP_EXCEPT
Damien's avatar
Damien committed
55
56
57
58
59
60
61
62
63

    int n_arg_keyword;
    bool have_star_arg;
    bool have_dbl_star_arg;
    bool have_bare_star;
    int param_pass;
    int param_pass_num_dict_params;
    int param_pass_num_default_params;

Damien George's avatar
Damien George committed
64
65
    bool func_arg_is_super; // used to compile special case of super() function call

Damien's avatar
Damien committed
66
67
68
    scope_t *scope_head;
    scope_t *scope_cur;

69
70
    emit_t *emit;                                   // current emitter
    const emit_method_table_t *emit_method_table;   // current emit method table
71
72
73

    emit_inline_asm_t *emit_inline_asm;                                   // current emitter for inline asm
    const emit_inline_asm_method_table_t *emit_inline_asm_method_table;   // current emit method table for inline asm
Damien's avatar
Damien committed
74
75
} compiler_t;

76
77
78
79
80
81
STATIC void compile_syntax_error(compiler_t *comp, const char *msg) {
    // TODO store the error message to a variable in compiler_t instead of printing it
    printf("SyntaxError: %s\n", msg);
    comp->had_error = true;
}

82
83
84
85
mp_parse_node_t fold_constants(mp_parse_node_t pn) {
    if (MP_PARSE_NODE_IS_STRUCT(pn)) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
86
87
88
89
90
91

        // fold arguments first
        for (int i = 0; i < n; i++) {
            pns->nodes[i] = fold_constants(pns->nodes[i]);
        }

92
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
Damien's avatar
Damien committed
93
            case PN_shift_expr:
94
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
95
96
                    int arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    int arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
97
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_LESS)) {
98
#if MICROPY_EMIT_CPYTHON
99
                        // can overflow; enabled only to compare with CPython
100
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 << arg1);
101
#endif
102
103
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_MORE)) {
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 >> arg1);
Damien's avatar
Damien committed
104
105
106
107
108
109
110
111
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

            case PN_arith_expr:
112
                // overflow checking here relies on SMALL_INT being strictly smaller than machine_int_t
113
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
114
115
                    machine_int_t arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    machine_int_t arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
116
                    machine_int_t res;
117
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PLUS)) {
118
                        res = arg0 + arg1;
119
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_MINUS)) {
120
                        res = arg0 - arg1;
Damien's avatar
Damien committed
121
122
123
                    } else {
                        // shouldn't happen
                        assert(0);
124
125
                        res = 0;
                    }
126
                    if (MP_PARSE_FITS_SMALL_INT(res)) {
127
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, res);
Damien's avatar
Damien committed
128
129
130
131
132
                    }
                }
                break;

            case PN_term:
133
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
134
135
                    int arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    int arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
136
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_STAR)) {
137
#if MICROPY_EMIT_CPYTHON
138
                        // can overflow; enabled only to compare with CPython
139
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 * arg1);
140
#endif
141
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_SLASH)) {
Damien's avatar
Damien committed
142
                        ; // pass
143
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PERCENT)) {
144
                        // XXX implement this properly as Python's % operator acts differently to C's
145
146
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 % arg1);
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_SLASH)) {
147
                        // XXX implement this properly as Python's // operator acts differently to C's
148
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 / arg1);
Damien's avatar
Damien committed
149
150
151
152
153
154
155
156
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

            case PN_factor_2:
157
                if (MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[1])) {
158
                    machine_int_t arg = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[1]);
159
160
161
162
163
164
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[0], MP_TOKEN_OP_PLUS)) {
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg);
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[0], MP_TOKEN_OP_MINUS)) {
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, -arg);
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[0], MP_TOKEN_OP_TILDE)) {
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, ~arg);
Damien's avatar
Damien committed
165
166
167
168
169
170
171
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

172
#if MICROPY_EMIT_CPYTHON
Damien's avatar
Damien committed
173
            case PN_power:
174
                // can overflow; enabled only to compare with CPython
175
176
177
                if (MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_NULL(pns->nodes[1]) && !MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
                    mp_parse_node_struct_t* pns2 = (mp_parse_node_struct_t*)pns->nodes[2];
                    if (MP_PARSE_NODE_IS_SMALL_INT(pns2->nodes[0])) {
178
                        int power = MP_PARSE_NODE_LEAF_SMALL_INT(pns2->nodes[0]);
Damien's avatar
Damien committed
179
180
                        if (power >= 0) {
                            int ans = 1;
181
                            int base = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
Damien's avatar
Damien committed
182
183
184
                            for (; power > 0; power--) {
                                ans *= base;
                            }
185
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, ans);
Damien's avatar
Damien committed
186
187
188
189
                        }
                    }
                }
                break;
190
#endif
Damien's avatar
Damien committed
191
192
193
194
195
196
        }
    }

    return pn;
}

197
STATIC void compile_trailer_paren_helper(compiler_t *comp, mp_parse_node_t pn_arglist, bool is_method_call, int n_positional_extra);
198
void compile_node(compiler_t *comp, mp_parse_node_t pn);
Damien's avatar
Damien committed
199

200
STATIC int comp_next_label(compiler_t *comp) {
201
202
203
    return comp->next_label++;
}

204
STATIC scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
205
    scope_t *scope = scope_new(kind, pn, comp->source_file, rt_get_unique_code_id(), emit_options);
Damien's avatar
Damien committed
206
207
208
209
210
211
212
213
214
215
216
217
218
219
    scope->parent = comp->scope_cur;
    scope->next = NULL;
    if (comp->scope_head == NULL) {
        comp->scope_head = scope;
    } else {
        scope_t *s = comp->scope_head;
        while (s->next != NULL) {
            s = s->next;
        }
        s->next = scope;
    }
    return scope;
}

220
STATIC int list_len(mp_parse_node_t pn, int pn_kind) {
221
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
222
        return 0;
223
    } else if (MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
224
225
        return 1;
    } else {
226
227
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        if (MP_PARSE_NODE_STRUCT_KIND(pns) != pn_kind) {
Damien's avatar
Damien committed
228
229
            return 1;
        } else {
230
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
231
232
233
234
        }
    }
}

235
STATIC void apply_to_single_or_list(compiler_t *comp, mp_parse_node_t pn, int pn_list_kind, void (*f)(compiler_t*, mp_parse_node_t)) {
236
237
238
    if (MP_PARSE_NODE_IS_STRUCT(pn) && MP_PARSE_NODE_STRUCT_KIND((mp_parse_node_struct_t*)pn) == pn_list_kind) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        int num_nodes = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
239
240
241
        for (int i = 0; i < num_nodes; i++) {
            f(comp, pns->nodes[i]);
        }
242
    } else if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
243
244
245
246
        f(comp, pn);
    }
}

247
STATIC int list_get(mp_parse_node_t *pn, int pn_kind, mp_parse_node_t **nodes) {
248
    if (MP_PARSE_NODE_IS_NULL(*pn)) {
Damien's avatar
Damien committed
249
250
        *nodes = NULL;
        return 0;
251
    } else if (MP_PARSE_NODE_IS_LEAF(*pn)) {
Damien's avatar
Damien committed
252
253
254
        *nodes = pn;
        return 1;
    } else {
255
256
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)(*pn);
        if (MP_PARSE_NODE_STRUCT_KIND(pns) != pn_kind) {
Damien's avatar
Damien committed
257
258
259
260
            *nodes = pn;
            return 1;
        } else {
            *nodes = pns->nodes;
261
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
262
263
264
265
        }
    }
}

266
void compile_do_nothing(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
267
268
}

269
270
void compile_generic_all_nodes(compiler_t *comp, mp_parse_node_struct_t *pns) {
    int num_nodes = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
271
272
273
274
275
    for (int i = 0; i < num_nodes; i++) {
        compile_node(comp, pns->nodes[i]);
    }
}

276
#if MICROPY_EMIT_CPYTHON
277
STATIC bool cpython_c_tuple_is_const(mp_parse_node_t pn) {
278
    if (!MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
279
280
        return false;
    }
281
    if (MP_PARSE_NODE_IS_ID(pn)) {
Damien's avatar
Damien committed
282
283
284
285
286
        return false;
    }
    return true;
}

287
STATIC void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
288
289
    uint len;
    const byte *str = qstr_data(qstr, &len);
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
    bool has_single_quote = false;
    bool has_double_quote = false;
    for (int i = 0; i < len; i++) {
        if (str[i] == '\'') {
            has_single_quote = true;
        } else if (str[i] == '"') {
            has_double_quote = true;
        }
    }
    if (bytes) {
        vstr_printf(vstr, "b");
    }
    bool quote_single = false;
    if (has_single_quote && !has_double_quote) {
        vstr_printf(vstr, "\"");
    } else {
        quote_single = true;
        vstr_printf(vstr, "'");
    }
    for (int i = 0; i < len; i++) {
        if (str[i] == '\n') {
            vstr_printf(vstr, "\\n");
        } else if (str[i] == '\\') {
            vstr_printf(vstr, "\\\\");
        } else if (str[i] == '\'' && quote_single) {
            vstr_printf(vstr, "\\'");
        } else {
            vstr_printf(vstr, "%c", str[i]);
        }
    }
    if (has_single_quote && !has_double_quote) {
        vstr_printf(vstr, "\"");
    } else {
        vstr_printf(vstr, "'");
    }
}

327
STATIC void cpython_c_tuple_emit_const(compiler_t *comp, mp_parse_node_t pn, vstr_t *vstr) {
328
    assert(MP_PARSE_NODE_IS_LEAF(pn));
329
330
331
332
333
    if (MP_PARSE_NODE_IS_SMALL_INT(pn)) {
        vstr_printf(vstr, INT_FMT, MP_PARSE_NODE_LEAF_SMALL_INT(pn));
        return;
    }

334
335
336
337
338
339
340
341
    int arg = MP_PARSE_NODE_LEAF_ARG(pn);
    switch (MP_PARSE_NODE_LEAF_KIND(pn)) {
        case MP_PARSE_NODE_ID: assert(0);
        case MP_PARSE_NODE_INTEGER: vstr_printf(vstr, "%s", qstr_str(arg)); break;
        case MP_PARSE_NODE_DECIMAL: vstr_printf(vstr, "%s", qstr_str(arg)); break;
        case MP_PARSE_NODE_STRING: cpython_c_print_quoted_str(vstr, arg, false); break;
        case MP_PARSE_NODE_BYTES: cpython_c_print_quoted_str(vstr, arg, true); break;
        case MP_PARSE_NODE_TOKEN:
Damien's avatar
Damien committed
342
            switch (arg) {
343
344
345
                case MP_TOKEN_KW_FALSE: vstr_printf(vstr, "False"); break;
                case MP_TOKEN_KW_NONE: vstr_printf(vstr, "None"); break;
                case MP_TOKEN_KW_TRUE: vstr_printf(vstr, "True"); break;
Damien's avatar
Damien committed
346
347
348
349
350
351
352
                default: assert(0);
            }
            break;
        default: assert(0);
    }
}

353
STATIC void cpython_c_tuple(compiler_t *comp, mp_parse_node_t pn, mp_parse_node_struct_t *pns_list) {
Damien's avatar
Damien committed
354
355
    int n = 0;
    if (pns_list != NULL) {
356
        n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
Damien's avatar
Damien committed
357
358
359
    }
    int total = n;
    bool is_const = true;
360
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
361
        total += 1;
362
        if (!cpython_c_tuple_is_const(pn)) {
Damien's avatar
Damien committed
363
364
365
366
            is_const = false;
        }
    }
    for (int i = 0; i < n; i++) {
367
        if (!cpython_c_tuple_is_const(pns_list->nodes[i])) {
Damien's avatar
Damien committed
368
369
370
371
372
373
            is_const = false;
            break;
        }
    }
    if (total > 0 && is_const) {
        bool need_comma = false;
374
375
        vstr_t *vstr = vstr_new();
        vstr_printf(vstr, "(");
376
        if (!MP_PARSE_NODE_IS_NULL(pn)) {
377
            cpython_c_tuple_emit_const(comp, pn, vstr);
Damien's avatar
Damien committed
378
379
380
381
            need_comma = true;
        }
        for (int i = 0; i < n; i++) {
            if (need_comma) {
382
                vstr_printf(vstr, ", ");
Damien's avatar
Damien committed
383
            }
384
            cpython_c_tuple_emit_const(comp, pns_list->nodes[i], vstr);
Damien's avatar
Damien committed
385
386
387
            need_comma = true;
        }
        if (total == 1) {
388
            vstr_printf(vstr, ",)");
Damien's avatar
Damien committed
389
        } else {
390
            vstr_printf(vstr, ")");
Damien's avatar
Damien committed
391
        }
392
        EMIT_ARG(load_const_verbatim_str, vstr_str(vstr));
393
        vstr_free(vstr);
Damien's avatar
Damien committed
394
    } else {
395
        if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
396
397
398
399
400
            compile_node(comp, pn);
        }
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
401
        EMIT_ARG(build_tuple, total);
Damien's avatar
Damien committed
402
403
    }
}
404
405
406
#endif

// funnelling all tuple creations through this function is purely so we can optionally agree with CPython
407
void c_tuple(compiler_t *comp, mp_parse_node_t pn, mp_parse_node_struct_t *pns_list) {
408
#if MICROPY_EMIT_CPYTHON
409
410
411
    cpython_c_tuple(comp, pn, pns_list);
#else
    int total = 0;
412
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
413
414
415
416
        compile_node(comp, pn);
        total += 1;
    }
    if (pns_list != NULL) {
417
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
418
419
420
421
422
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
        total += n;
    }
423
    EMIT_ARG(build_tuple, total);
424
425
#endif
}
Damien's avatar
Damien committed
426

427
void compile_generic_tuple(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
428
    // a simple tuple expression
429
    c_tuple(comp, MP_PARSE_NODE_NULL, pns);
Damien's avatar
Damien committed
430
431
}

432
STATIC bool node_is_const_false(mp_parse_node_t pn) {
433
    return MP_PARSE_NODE_IS_TOKEN_KIND(pn, MP_TOKEN_KW_FALSE);
434
    // untested: || (MP_PARSE_NODE_IS_SMALL_INT(pn) && MP_PARSE_NODE_LEAF_SMALL_INT(pn) == 0);
Damien's avatar
Damien committed
435
436
}

437
STATIC bool node_is_const_true(mp_parse_node_t pn) {
438
    return MP_PARSE_NODE_IS_TOKEN_KIND(pn, MP_TOKEN_KW_TRUE) || (MP_PARSE_NODE_IS_SMALL_INT(pn) && MP_PARSE_NODE_LEAF_SMALL_INT(pn) == 1);
Damien's avatar
Damien committed
439
440
}

441
#if MICROPY_EMIT_CPYTHON
442
// the is_nested variable is purely to match with CPython, which doesn't fully optimise not's
443
STATIC void cpython_c_if_cond(compiler_t *comp, mp_parse_node_t pn, bool jump_if, int label, bool is_nested) {
Damien's avatar
Damien committed
444
445
    if (node_is_const_false(pn)) {
        if (jump_if == false) {
446
            EMIT_ARG(jump, label);
Damien's avatar
Damien committed
447
448
449
450
        }
        return;
    } else if (node_is_const_true(pn)) {
        if (jump_if == true) {
451
            EMIT_ARG(jump, label);
Damien's avatar
Damien committed
452
453
        }
        return;
454
455
456
457
    } else if (MP_PARSE_NODE_IS_STRUCT(pn)) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
        if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_or_test) {
Damien's avatar
Damien committed
458
            if (jump_if == false) {
459
                int label2 = comp_next_label(comp);
Damien's avatar
Damien committed
460
                for (int i = 0; i < n - 1; i++) {
461
                    cpython_c_if_cond(comp, pns->nodes[i], true, label2, true);
Damien's avatar
Damien committed
462
                }
463
                cpython_c_if_cond(comp, pns->nodes[n - 1], false, label, true);
464
                EMIT_ARG(label_assign, label2);
Damien's avatar
Damien committed
465
466
            } else {
                for (int i = 0; i < n; i++) {
467
                    cpython_c_if_cond(comp, pns->nodes[i], true, label, true);
Damien's avatar
Damien committed
468
469
470
                }
            }
            return;
471
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_and_test) {
Damien's avatar
Damien committed
472
473
            if (jump_if == false) {
                for (int i = 0; i < n; i++) {
474
                    cpython_c_if_cond(comp, pns->nodes[i], false, label, true);
Damien's avatar
Damien committed
475
476
                }
            } else {
477
                int label2 = comp_next_label(comp);
Damien's avatar
Damien committed
478
                for (int i = 0; i < n - 1; i++) {
479
                    cpython_c_if_cond(comp, pns->nodes[i], false, label2, true);
Damien's avatar
Damien committed
480
                }
481
                cpython_c_if_cond(comp, pns->nodes[n - 1], true, label, true);
482
                EMIT_ARG(label_assign, label2);
Damien's avatar
Damien committed
483
484
            }
            return;
485
        } else if (!is_nested && MP_PARSE_NODE_STRUCT_KIND(pns) == PN_not_test_2) {
486
            cpython_c_if_cond(comp, pns->nodes[0], !jump_if, label, true);
Damien's avatar
Damien committed
487
488
489
490
491
492
493
            return;
        }
    }

    // nothing special, fall back to default compiling for node and jump
    compile_node(comp, pn);
    if (jump_if == false) {
494
        EMIT_ARG(pop_jump_if_false, label);
Damien's avatar
Damien committed
495
    } else {
496
        EMIT_ARG(pop_jump_if_true, label);
Damien's avatar
Damien committed
497
498
    }
}
499
#endif
Damien's avatar
Damien committed
500

501
STATIC void c_if_cond(compiler_t *comp, mp_parse_node_t pn, bool jump_if, int label) {
502
#if MICROPY_EMIT_CPYTHON
503
504
505
506
    cpython_c_if_cond(comp, pn, jump_if, label, false);
#else
    if (node_is_const_false(pn)) {
        if (jump_if == false) {
507
            EMIT_ARG(jump, label);
508
509
510
511
        }
        return;
    } else if (node_is_const_true(pn)) {
        if (jump_if == true) {
512
            EMIT_ARG(jump, label);
513
514
        }
        return;
515
516
517
518
    } else if (MP_PARSE_NODE_IS_STRUCT(pn)) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
        if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_or_test) {
519
520
521
522
523
524
            if (jump_if == false) {
                int label2 = comp_next_label(comp);
                for (int i = 0; i < n - 1; i++) {
                    c_if_cond(comp, pns->nodes[i], true, label2);
                }
                c_if_cond(comp, pns->nodes[n - 1], false, label);
525
                EMIT_ARG(label_assign, label2);
526
527
528
529
530
531
            } else {
                for (int i = 0; i < n; i++) {
                    c_if_cond(comp, pns->nodes[i], true, label);
                }
            }
            return;
532
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_and_test) {
533
534
535
536
537
538
539
540
541
542
            if (jump_if == false) {
                for (int i = 0; i < n; i++) {
                    c_if_cond(comp, pns->nodes[i], false, label);
                }
            } else {
                int label2 = comp_next_label(comp);
                for (int i = 0; i < n - 1; i++) {
                    c_if_cond(comp, pns->nodes[i], false, label2);
                }
                c_if_cond(comp, pns->nodes[n - 1], true, label);
543
                EMIT_ARG(label_assign, label2);
544
545
            }
            return;
546
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_not_test_2) {
547
548
549
550
551
552
553
554
            c_if_cond(comp, pns->nodes[0], !jump_if, label);
            return;
        }
    }

    // nothing special, fall back to default compiling for node and jump
    compile_node(comp, pn);
    if (jump_if == false) {
555
        EMIT_ARG(pop_jump_if_false, label);
556
    } else {
557
        EMIT_ARG(pop_jump_if_true, label);
558
559
    }
#endif
Damien's avatar
Damien committed
560
561
562
}

typedef enum { ASSIGN_STORE, ASSIGN_AUG_LOAD, ASSIGN_AUG_STORE } assign_kind_t;
563
void c_assign(compiler_t *comp, mp_parse_node_t pn, assign_kind_t kind);
Damien's avatar
Damien committed
564

565
void c_assign_power(compiler_t *comp, mp_parse_node_struct_t *pns, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
566
567
568
569
    if (assign_kind != ASSIGN_AUG_STORE) {
        compile_node(comp, pns->nodes[0]);
    }

570
571
572
573
    if (MP_PARSE_NODE_IS_STRUCT(pns->nodes[1])) {
        mp_parse_node_struct_t *pns1 = (mp_parse_node_struct_t*)pns->nodes[1];
        if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_power_trailers) {
            int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns1);
Damien's avatar
Damien committed
574
575
576
577
578
            if (assign_kind != ASSIGN_AUG_STORE) {
                for (int i = 0; i < n - 1; i++) {
                    compile_node(comp, pns1->nodes[i]);
                }
            }
579
580
            assert(MP_PARSE_NODE_IS_STRUCT(pns1->nodes[n - 1]));
            pns1 = (mp_parse_node_struct_t*)pns1->nodes[n - 1];
Damien's avatar
Damien committed
581
        }
582
        if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_paren) {
583
            compile_syntax_error(comp, "can't assign to function call");
Damien's avatar
Damien committed
584
            return;
585
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_bracket) {
Damien's avatar
Damien committed
586
587
588
589
590
591
592
            if (assign_kind == ASSIGN_AUG_STORE) {
                EMIT(rot_three);
                EMIT(store_subscr);
            } else {
                compile_node(comp, pns1->nodes[0]);
                if (assign_kind == ASSIGN_AUG_LOAD) {
                    EMIT(dup_top_two);
593
                    EMIT_ARG(binary_op, RT_BINARY_OP_SUBSCR);
Damien's avatar
Damien committed
594
595
596
597
                } else {
                    EMIT(store_subscr);
                }
            }
598
599
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_period) {
            assert(MP_PARSE_NODE_IS_ID(pns1->nodes[0]));
Damien's avatar
Damien committed
600
601
            if (assign_kind == ASSIGN_AUG_LOAD) {
                EMIT(dup_top);
602
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
603
604
605
606
            } else {
                if (assign_kind == ASSIGN_AUG_STORE) {
                    EMIT(rot_two);
                }
607
                EMIT_ARG(store_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
608
609
610
611
612
613
614
615
616
617
            }
        } else {
            // shouldn't happen
            assert(0);
        }
    } else {
        // shouldn't happen
        assert(0);
    }

618
    if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
Damien's avatar
Damien committed
619
620
621
622
623
        // SyntaxError, cannot assign
        assert(0);
    }
}

624
void c_assign_tuple(compiler_t *comp, int n, mp_parse_node_t *nodes) {
Damien's avatar
Damien committed
625
626
627
    assert(n >= 0);
    int have_star_index = -1;
    for (int i = 0; i < n; i++) {
628
        if (MP_PARSE_NODE_IS_STRUCT_KIND(nodes[i], PN_star_expr)) {
Damien's avatar
Damien committed
629
            if (have_star_index < 0) {
630
                EMIT_ARG(unpack_ex, i, n - i - 1);
Damien's avatar
Damien committed
631
632
                have_star_index = i;
            } else {
633
                compile_syntax_error(comp, "two starred expressions in assignment");
Damien's avatar
Damien committed
634
635
636
637
638
                return;
            }
        }
    }
    if (have_star_index < 0) {
639
        EMIT_ARG(unpack_sequence, n);
Damien's avatar
Damien committed
640
641
642
    }
    for (int i = 0; i < n; i++) {
        if (i == have_star_index) {
643
            c_assign(comp, ((mp_parse_node_struct_t*)nodes[i])->nodes[0], ASSIGN_STORE);
Damien's avatar
Damien committed
644
645
646
647
648
649
650
        } else {
            c_assign(comp, nodes[i], ASSIGN_STORE);
        }
    }
}

// assigns top of stack to pn
651
void c_assign(compiler_t *comp, mp_parse_node_t pn, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
652
    tail_recursion:
653
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
654
        assert(0);
655
656
657
    } else if (MP_PARSE_NODE_IS_LEAF(pn)) {
        if (MP_PARSE_NODE_IS_ID(pn)) {
            int arg = MP_PARSE_NODE_LEAF_ARG(pn);
Damien's avatar
Damien committed
658
659
660
            switch (assign_kind) {
                case ASSIGN_STORE:
                case ASSIGN_AUG_STORE:
661
                    EMIT_ARG(store_id, arg);
Damien's avatar
Damien committed
662
663
                    break;
                case ASSIGN_AUG_LOAD:
664
                    EMIT_ARG(load_id, arg);
Damien's avatar
Damien committed
665
666
667
                    break;
            }
        } else {
668
            compile_syntax_error(comp, "can't assign to literal");
Damien's avatar
Damien committed
669
670
671
            return;
        }
    } else {
672
673
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
Damien's avatar
Damien committed
674
675
676
677
678
679
680
681
682
683
684
            case PN_power:
                // lhs is an index or attribute
                c_assign_power(comp, pns, assign_kind);
                break;

            case PN_testlist_star_expr:
            case PN_exprlist:
                // lhs is a tuple
                if (assign_kind != ASSIGN_STORE) {
                    goto bad_aug;
                }
685
                c_assign_tuple(comp, MP_PARSE_NODE_STRUCT_NUM_NODES(pns), pns->nodes);
Damien's avatar
Damien committed
686
687
688
689
                break;

            case PN_atom_paren:
                // lhs is something in parenthesis
690
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
691
                    // empty tuple
692
                    compile_syntax_error(comp, "can't assign to ()");
Damien's avatar
Damien committed
693
                    return;
694
695
                } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[0], PN_testlist_comp)) {
                    pns = (mp_parse_node_struct_t*)pns->nodes[0];
Damien's avatar
Damien committed
696
697
698
699
700
701
702
703
704
705
706
707
708
                    goto testlist_comp;
                } else {
                    // parenthesis around 1 item, is just that item
                    pn = pns->nodes[0];
                    goto tail_recursion;
                }
                break;

            case PN_atom_bracket:
                // lhs is something in brackets
                if (assign_kind != ASSIGN_STORE) {
                    goto bad_aug;
                }
709
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
710
711
                    // empty list, assignment allowed
                    c_assign_tuple(comp, 0, NULL);
712
713
                } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[0], PN_testlist_comp)) {
                    pns = (mp_parse_node_struct_t*)pns->nodes[0];
Damien's avatar
Damien committed
714
715
716
717
718
719
720
721
                    goto testlist_comp;
                } else {
                    // brackets around 1 item
                    c_assign_tuple(comp, 1, &pns->nodes[0]);
                }
                break;

            default:
722
                printf("unknown assign, %u\n", (uint)MP_PARSE_NODE_STRUCT_KIND(pns));
Damien's avatar
Damien committed
723
724
725
726
727
728
                assert(0);
        }
        return;

        testlist_comp:
        // lhs is a sequence
729
730
731
        if (MP_PARSE_NODE_IS_STRUCT(pns->nodes[1])) {
            mp_parse_node_struct_t *pns2 = (mp_parse_node_struct_t*)pns->nodes[1];
            if (MP_PARSE_NODE_STRUCT_KIND(pns2) == PN_testlist_comp_3b) {
Damien's avatar
Damien committed
732
                // sequence of one item, with trailing comma
733
                assert(MP_PARSE_NODE_IS_NULL(pns2->nodes[0]));
Damien's avatar
Damien committed
734
                c_assign_tuple(comp, 1, &pns->nodes[0]);
735
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns2) == PN_testlist_comp_3c) {
Damien's avatar
Damien committed
736
737
                // sequence of many items
                // TODO call c_assign_tuple instead
738
                int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns2);
739
                EMIT_ARG(unpack_sequence, 1 + n);
Damien's avatar
Damien committed
740
741
742
743
                c_assign(comp, pns->nodes[0], ASSIGN_STORE);
                for (int i = 0; i < n; i++) {
                    c_assign(comp, pns2->nodes[i], ASSIGN_STORE);
                }
744
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_comp_for) {
Damien's avatar
Damien committed
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
                // TODO not implemented
                assert(0);
            } else {
                // sequence with 2 items
                goto sequence_with_2_items;
            }
        } else {
            // sequence with 2 items
            sequence_with_2_items:
            c_assign_tuple(comp, 2, pns->nodes);
        }
        return;
    }
    return;

    bad_aug:
761
    compile_syntax_error(comp, "illegal expression for augmented assignment");
Damien's avatar
Damien committed
762
763
764
765
766
}

// stuff for lambda and comprehensions and generators
void close_over_variables_etc(compiler_t *comp, scope_t *this_scope, int n_dict_params, int n_default_params) {
    // make closed over variables, if any
767
    // ensure they are closed over in the order defined in the outer scope (mainly to agree with CPython)
Damien's avatar
Damien committed
768
769
    int nfree = 0;
    if (comp->scope_cur->kind != SCOPE_MODULE) {
770
771
772
773
774
775
        for (int i = 0; i < comp->scope_cur->id_info_len; i++) {
            id_info_t *id = &comp->scope_cur->id_info[i];
            if (id->kind == ID_INFO_KIND_CELL || id->kind == ID_INFO_KIND_FREE) {
                for (int j = 0; j < this_scope->id_info_len; j++) {
                    id_info_t *id2 = &this_scope->id_info[j];
                    if (id2->kind == ID_INFO_KIND_FREE && id->qstr == id2->qstr) {
Damien George's avatar
Damien George committed
776
#if MICROPY_EMIT_CPYTHON
777
                        EMIT_ARG(load_closure, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
778
779
#else
                        // in Micro Python we load closures using LOAD_FAST
780
                        EMIT_ARG(load_fast, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
781
#endif
782
783
784
                        nfree += 1;
                    }
                }
Damien's avatar
Damien committed
785
786
787
788
            }
        }
    }
    if (nfree > 0) {
789
        EMIT_ARG(build_tuple, nfree);
Damien's avatar
Damien committed
790
791
792
793
    }

    // make the function/closure
    if (nfree == 0) {
794
        EMIT_ARG(make_function, this_scope, n_dict_params, n_default_params);
Damien's avatar
Damien committed
795
    } else {
796
        EMIT_ARG(make_closure, this_scope, n_dict_params, n_default_params);
Damien's avatar
Damien committed
797
798
799
    }
}

800
void compile_funcdef_param(compiler_t *comp, mp_parse_node_t pn) {
801
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_star)) {
802
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
        if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
            // bare star
            comp->have_bare_star = true;
        }

    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_dbl_star)) {
        // TODO do we need to do anything with this?

    } else {
        mp_parse_node_t pn_id;
        mp_parse_node_t pn_colon;
        mp_parse_node_t pn_equal;
        if (MP_PARSE_NODE_IS_ID(pn)) {
            // this parameter is just an id

            pn_id = pn;
            pn_colon = MP_PARSE_NODE_NULL;
            pn_equal = MP_PARSE_NODE_NULL;

        } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_name)) {
            // this parameter has a colon and/or equal specifier

            mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
            pn_id = pns->nodes[0];
            pn_colon = pns->nodes[1];
            pn_equal = pns->nodes[2];

        } else {
            assert(0);
            return;
        }

        if (MP_PARSE_NODE_IS_NULL(pn_equal)) {
            // this parameter does not have a default value

            // check for non-default parameters given after default parameters (allowed by parser, but not syntactically valid)
            if (!comp->have_bare_star && comp->param_pass_num_default_params != 0) {
                compile_syntax_error(comp, "non-default argument follows default argument");
                return;
            }

        } else {
Damien's avatar
Damien committed
845
846
            // this parameter has a default value
            // in CPython, None (and True, False?) as default parameters are loaded with LOAD_NAME; don't understandy why
847

Damien's avatar
Damien committed
848
849
850
            if (comp->have_bare_star) {
                comp->param_pass_num_dict_params += 1;
                if (comp->param_pass == 1) {
851
852
                    EMIT_ARG(load_const_id, MP_PARSE_NODE_LEAF_ARG(pn_id));
                    compile_node(comp, pn_equal);
Damien's avatar
Damien committed
853
854
855
856
                }
            } else {
                comp->param_pass_num_default_params += 1;
                if (comp->param_pass == 2) {
857
                    compile_node(comp, pn_equal);
Damien's avatar
Damien committed
858
859
860
                }
            }
        }
861
862
863

        // TODO pn_colon not implemented
        (void)pn_colon;
Damien's avatar
Damien committed
864
865
866
867
868
    }
}

// leaves function object on stack
// returns function name
869
qstr compile_funcdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
870
871
    if (comp->pass == PASS_1) {
        // create a new scope for this function
872
        scope_t *s = scope_new_and_link(comp, SCOPE_FUNCTION, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
873
        // store the function scope so the compiling function can use it at each pass
874
        pns->nodes[4] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
875
876
877
878
879
880
881
882
883
    }

    // save variables (probably don't need to do this, since we can't have nested definitions..?)
    bool old_have_bare_star = comp->have_bare_star;
    int old_param_pass = comp->param_pass;
    int old_param_pass_num_dict_params = comp->param_pass_num_dict_params;
    int old_param_pass_num_default_params = comp->param_pass_num_default_params;

    // compile default parameters
884
885

    // pass 1 does any default parameters after bare star
Damien's avatar
Damien committed
886
    comp->have_bare_star = false;
887
    comp->param_pass = 1;
Damien's avatar
Damien committed
888
889
890
    comp->param_pass_num_dict_params = 0;
    comp->param_pass_num_default_params = 0;
    apply_to_single_or_list(comp, pns->nodes[1], PN_typedargslist, compile_funcdef_param);
891
892
893
894
895
896

    if (comp->had_error) {
        return MP_QSTR_NULL;
    }

    // pass 2 does any default parameters before bare star
Damien's avatar
Damien committed
897
    comp->have_bare_star = false;
898
    comp->param_pass = 2;
Damien's avatar
Damien committed
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
    comp->param_pass_num_dict_params = 0;
    comp->param_pass_num_default_params = 0;
    apply_to_single_or_list(comp, pns->nodes[1], PN_typedargslist, compile_funcdef_param);

    // get the scope for this function
    scope_t *fscope = (scope_t*)pns->nodes[4];

    // make the function
    close_over_variables_etc(comp, fscope, comp->param_pass_num_dict_params, comp->param_pass_num_default_params);

    // restore variables
    comp->have_bare_star = old_have_bare_star;
    comp->param_pass = old_param_pass;
    comp->param_pass_num_dict_params = old_param_pass_num_dict_params;
    comp->param_pass_num_default_params = old_param_pass_num_default_params;

    // return its name (the 'f' in "def f(...):")
    return fscope->simple_name;
}

// leaves class object on stack
// returns class name
921
qstr compile_classdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
922
923
    if (comp->pass == PASS_1) {
        // create a new scope for this class
924
        scope_t *s = scope_new_and_link(comp, SCOPE_CLASS, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
925
        // store the class scope so the compiling function can use it at each pass
926
        pns->nodes[3] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
927
928
929
930
931
932
933
934
935
936
937
    }

    EMIT(load_build_class);

    // scope for this class
    scope_t *cscope = (scope_t*)pns->nodes[3];

    // compile the class
    close_over_variables_etc(comp, cscope, 0, 0);

    // get its name
938
    EMIT_ARG(load_const_id, cscope->simple_name);
Damien's avatar
Damien committed
939
940

    // nodes[1] has parent classes, if any
941
942
    comp->func_arg_is_super = false;
    compile_trailer_paren_helper(comp, pns->nodes[1], false, 2);
Damien's avatar
Damien committed
943
944
945
946
947

    // return its name (the 'C' in class C(...):")
    return cscope->simple_name;
}

948
// returns true if it was a built-in decorator (even if the built-in had an error)
949
STATIC bool compile_built_in_decorator(compiler_t *comp, int name_len, mp_parse_node_t *name_nodes, uint *emit_options) {
950
    if (MP_PARSE_NODE_LEAF_ARG(name_nodes[0]) != MP_QSTR_micropython) {
951
952
953
954
        return false;
    }

    if (name_len != 2) {
955
        compile_syntax_error(comp, "invalid micropython decorator");
956
957
958
        return true;
    }

959
    qstr attr = MP_PARSE_NODE_LEAF_ARG(name_nodes[1]);
960
    if (attr == MP_QSTR_byte_code) {
Damien's avatar
Damien committed
961
        *emit_options = EMIT_OPT_BYTE_CODE;
962
#if MICROPY_EMIT_NATIVE
963
    } else if (attr == MP_QSTR_native) {
964
        *emit_options = EMIT_OPT_NATIVE_PYTHON;
965
    } else if (attr == MP_QSTR_viper) {
Damien's avatar
Damien committed
966
        *emit_options = EMIT_OPT_VIPER;
967
#endif
968
#if MICROPY_EMIT_INLINE_THUMB
969
    } else if (attr == MP_QSTR_asm_thumb) {
970
        *emit_options = EMIT_OPT_ASM_THUMB;
971
#endif
972
    } else {
973
        compile_syntax_error(comp, "invalid micropython decorator");
974
975
976
977
978
    }

    return true;
}

979
void compile_decorated(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
980
    // get the list of decorators
981
    mp_parse_node_t *nodes;
Damien's avatar
Damien committed
982
983
    int n = list_get(&pns->nodes[0], PN_decorators, &nodes);

984
985
986
987
988
    // inherit emit options for this function/class definition
    uint emit_options = comp->scope_cur->emit_options;

    // compile each decorator
    int num_built_in_decorators = 0;
Damien's avatar
Damien committed
989
    for (int i = 0; i < n; i++) {
990
991
        assert(MP_PARSE_NODE_IS_STRUCT_KIND(nodes[i], PN_decorator)); // should be
        mp_parse_node_struct_t *pns_decorator = (mp_parse_node_struct_t*)nodes[i];
992
993

        // nodes[0] contains the decorator function, which is a dotted name
994
        mp_parse_node_t *name_nodes;
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
        int name_len = list_get(&pns_decorator->nodes[0], PN_dotted_name, &name_nodes);

        // check for built-in decorators
        if (compile_built_in_decorator(comp, name_len, name_nodes, &emit_options)) {
            // this was a built-in
            num_built_in_decorators += 1;

        } else {
            // not a built-in, compile normally

            // compile the decorator function
            compile_node(comp, name_nodes[0]);
            for (int i = 1; i < name_len; i++) {
1008
                assert(MP_PARSE_NODE_IS_ID(name_nodes[i])); // should be
1009
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(name_nodes[i]));
1010
1011
1012
            }

            // nodes[1] contains arguments to the decorator function, if any
1013
            if (!MP_PARSE_NODE_IS_NULL(pns_decorator->nodes[1])) {
1014
                // call the decorator function with the arguments in nodes[1]
Damien George's avatar
Damien George committed
1015
                comp->func_arg_is_super = false;
1016
1017
                compile_node(comp, pns_decorator->nodes[1]);
            }
Damien's avatar
Damien committed
1018
1019
1020
1021
        }
    }

    // compile the body (funcdef or classdef) and get its name
1022
    mp_parse_node_struct_t *pns_body = (mp_parse_node_struct_t*)pns->nodes[1];
Damien's avatar
Damien committed
1023
    qstr body_name = 0;
1024
    if (MP_PARSE_NODE_STRUCT_KIND(pns_body) == PN_funcdef) {
1025
        body_name = compile_funcdef_helper(comp, pns_body, emit_options);
1026
    } else if (MP_PARSE_NODE_STRUCT_KIND(pns_body) == PN_classdef) {
1027
        body_name = compile_classdef_helper(comp, pns_body, emit_options);
Damien's avatar
Damien committed
1028
1029
1030
1031
1032
1033
    } else {
        // shouldn't happen
        assert(0);
    }

    // call each decorator
1034
    for (int i = 0; i < n - num_built_in_decorators; i++) {
1035
        EMIT_ARG(call_function, 1, 0, false, false);
Damien's avatar
Damien committed
1036
1037
1038
    }

    // store func/class object into name
1039
    EMIT_ARG(store_id, body_name);
Damien's avatar
Damien committed
1040
1041
}

1042
void compile_funcdef(compiler_t *comp, mp_parse_node_struct_t *pns) {
1043
    qstr fname = compile_funcdef_helper(comp, pns, comp->scope_cur->emit_options);
Damien's avatar
Damien committed
1044
    // store function object into function name
1045
    EMIT_ARG(store_id, fname);
Damien's avatar
Damien committed
1046
1047
}

1048
1049
void c_del_stmt(compiler_t *comp, mp_parse_node_t pn) {
    if (MP_PARSE_NODE_IS_ID(pn)) {
1050
        EMIT_ARG(delete_id, MP_PARSE_NODE_LEAF_ARG(pn));
1051
1052
    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_power)) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
Damien's avatar
Damien committed
1053
1054
1055

        compile_node(comp, pns->nodes[0]); // base of the power node

1056
1057
1058
1059
        if (MP_PARSE_NODE_IS_STRUCT(pns->nodes[1])) {
            mp_parse_node_struct_t *pns1 = (mp_parse_node_struct_t*)pns->nodes[1];
            if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_power_trailers) {
                int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns1);
Damien's avatar
Damien committed
1060
1061
1062
                for (int i = 0; i