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

#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"
19
#include "intdivmod.h"
Damien's avatar
Damien committed
20
21
22

// TODO need to mangle __attr names

23
24
#define MICROPY_EMIT_NATIVE (MICROPY_EMIT_X64 || MICROPY_EMIT_THUMB)

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

33
34
35
36
#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
37

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

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

50
51
    int next_label;

Damien's avatar
Damien committed
52
53
    int break_label;
    int continue_label;
54
55
    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
56
57
58
59
60
61
62
63
64

    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
65
66
    bool func_arg_is_super; // used to compile special case of super() function call

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

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

    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
75
76
} compiler_t;

77
78
79
80
81
82
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;
}

83
84
85
86
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
87
88
89
90
91
92

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

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

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

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

            case PN_factor_2:
156
                if (MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[1])) {
157
                    machine_int_t arg = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[1]);
158
159
160
161
162
163
                    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
164
165
166
167
168
169
170
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

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

    return pn;
}

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

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

203
204
205
206
207
208
209
210
211
212
213
214
STATIC void compile_increase_except_level(compiler_t *comp) {
    comp->cur_except_level += 1;
    if (comp->cur_except_level > comp->scope_cur->exc_stack_size) {
        comp->scope_cur->exc_stack_size = comp->cur_except_level;
    }
}

STATIC void compile_decrease_except_level(compiler_t *comp) {
    assert(comp->cur_except_level > 0);
    comp->cur_except_level -= 1;
}

215
STATIC scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
216
    scope_t *scope = scope_new(kind, pn, comp->source_file, rt_get_unique_code_id(), emit_options);
Damien's avatar
Damien committed
217
218
219
220
221
222
223
224
225
226
227
228
229
230
    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;
}

231
STATIC int list_len(mp_parse_node_t pn, int pn_kind) {
232
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
233
        return 0;
234
    } else if (MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
235
236
        return 1;
    } else {
237
238
        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
239
240
            return 1;
        } else {
241
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
242
243
244
245
        }
    }
}

246
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)) {
247
248
249
    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
250
251
252
        for (int i = 0; i < num_nodes; i++) {
            f(comp, pns->nodes[i]);
        }
253
    } else if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
254
255
256
257
        f(comp, pn);
    }
}

258
STATIC int list_get(mp_parse_node_t *pn, int pn_kind, mp_parse_node_t **nodes) {
259
    if (MP_PARSE_NODE_IS_NULL(*pn)) {
Damien's avatar
Damien committed
260
261
        *nodes = NULL;
        return 0;
262
    } else if (MP_PARSE_NODE_IS_LEAF(*pn)) {
Damien's avatar
Damien committed
263
264
265
        *nodes = pn;
        return 1;
    } else {
266
267
        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
268
269
270
271
            *nodes = pn;
            return 1;
        } else {
            *nodes = pns->nodes;
272
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
273
274
275
276
        }
    }
}

277
void compile_do_nothing(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
278
279
}

280
281
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
282
283
284
285
286
    for (int i = 0; i < num_nodes; i++) {
        compile_node(comp, pns->nodes[i]);
    }
}

287
#if MICROPY_EMIT_CPYTHON
288
STATIC bool cpython_c_tuple_is_const(mp_parse_node_t pn) {
289
    if (!MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
290
291
        return false;
    }
292
    if (MP_PARSE_NODE_IS_ID(pn)) {
Damien's avatar
Damien committed
293
294
295
296
297
        return false;
    }
    return true;
}

298
STATIC void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
299
300
    uint len;
    const byte *str = qstr_data(qstr, &len);
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
    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, "'");
    }
}

338
STATIC void cpython_c_tuple_emit_const(compiler_t *comp, mp_parse_node_t pn, vstr_t *vstr) {
339
    assert(MP_PARSE_NODE_IS_LEAF(pn));
340
341
342
343
344
    if (MP_PARSE_NODE_IS_SMALL_INT(pn)) {
        vstr_printf(vstr, INT_FMT, MP_PARSE_NODE_LEAF_SMALL_INT(pn));
        return;
    }

345
346
347
348
349
350
351
352
    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
353
            switch (arg) {
354
355
356
                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
357
358
359
360
361
362
363
                default: assert(0);
            }
            break;
        default: assert(0);
    }
}

364
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
365
366
    int n = 0;
    if (pns_list != NULL) {
367
        n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
Damien's avatar
Damien committed
368
369
370
    }
    int total = n;
    bool is_const = true;
371
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
372
        total += 1;
373
        if (!cpython_c_tuple_is_const(pn)) {
Damien's avatar
Damien committed
374
375
376
377
            is_const = false;
        }
    }
    for (int i = 0; i < n; i++) {
378
        if (!cpython_c_tuple_is_const(pns_list->nodes[i])) {
Damien's avatar
Damien committed
379
380
381
382
383
384
            is_const = false;
            break;
        }
    }
    if (total > 0 && is_const) {
        bool need_comma = false;
385
386
        vstr_t *vstr = vstr_new();
        vstr_printf(vstr, "(");
387
        if (!MP_PARSE_NODE_IS_NULL(pn)) {
388
            cpython_c_tuple_emit_const(comp, pn, vstr);
Damien's avatar
Damien committed
389
390
391
392
            need_comma = true;
        }
        for (int i = 0; i < n; i++) {
            if (need_comma) {
393
                vstr_printf(vstr, ", ");
Damien's avatar
Damien committed
394
            }
395
            cpython_c_tuple_emit_const(comp, pns_list->nodes[i], vstr);
Damien's avatar
Damien committed
396
397
398
            need_comma = true;
        }
        if (total == 1) {
399
            vstr_printf(vstr, ",)");
Damien's avatar
Damien committed
400
        } else {
401
            vstr_printf(vstr, ")");
Damien's avatar
Damien committed
402
        }
403
        EMIT_ARG(load_const_verbatim_str, vstr_str(vstr));
404
        vstr_free(vstr);
Damien's avatar
Damien committed
405
    } else {
406
        if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
407
408
409
410
411
            compile_node(comp, pn);
        }
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
412
        EMIT_ARG(build_tuple, total);
Damien's avatar
Damien committed
413
414
    }
}
415
416
417
#endif

// funnelling all tuple creations through this function is purely so we can optionally agree with CPython
418
void c_tuple(compiler_t *comp, mp_parse_node_t pn, mp_parse_node_struct_t *pns_list) {
419
#if MICROPY_EMIT_CPYTHON
420
421
422
    cpython_c_tuple(comp, pn, pns_list);
#else
    int total = 0;
423
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
424
425
426
427
        compile_node(comp, pn);
        total += 1;
    }
    if (pns_list != NULL) {
428
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
429
430
431
432
433
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
        total += n;
    }
434
    EMIT_ARG(build_tuple, total);
435
436
#endif
}
Damien's avatar
Damien committed
437

438
void compile_generic_tuple(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
439
    // a simple tuple expression
440
    c_tuple(comp, MP_PARSE_NODE_NULL, pns);
Damien's avatar
Damien committed
441
442
}

443
STATIC bool node_is_const_false(mp_parse_node_t pn) {
444
    return MP_PARSE_NODE_IS_TOKEN_KIND(pn, MP_TOKEN_KW_FALSE);
445
    // untested: || (MP_PARSE_NODE_IS_SMALL_INT(pn) && MP_PARSE_NODE_LEAF_SMALL_INT(pn) == 0);
Damien's avatar
Damien committed
446
447
}

448
STATIC bool node_is_const_true(mp_parse_node_t pn) {
449
    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
450
451
}

452
#if MICROPY_EMIT_CPYTHON
453
// the is_nested variable is purely to match with CPython, which doesn't fully optimise not's
454
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
455
456
    if (node_is_const_false(pn)) {
        if (jump_if == false) {
457
            EMIT_ARG(jump, label);
Damien's avatar
Damien committed
458
459
460
461
        }
        return;
    } else if (node_is_const_true(pn)) {
        if (jump_if == true) {
462
            EMIT_ARG(jump, label);
Damien's avatar
Damien committed
463
464
        }
        return;
465
466
467
468
    } 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
469
            if (jump_if == false) {
470
                int label2 = comp_next_label(comp);
Damien's avatar
Damien committed
471
                for (int i = 0; i < n - 1; i++) {
472
                    cpython_c_if_cond(comp, pns->nodes[i], true, label2, true);
Damien's avatar
Damien committed
473
                }
474
                cpython_c_if_cond(comp, pns->nodes[n - 1], false, label, true);
475
                EMIT_ARG(label_assign, label2);
Damien's avatar
Damien committed
476
477
            } else {
                for (int i = 0; i < n; i++) {
478
                    cpython_c_if_cond(comp, pns->nodes[i], true, label, true);
Damien's avatar
Damien committed
479
480
481
                }
            }
            return;
482
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_and_test) {
Damien's avatar
Damien committed
483
484
            if (jump_if == false) {
                for (int i = 0; i < n; i++) {
485
                    cpython_c_if_cond(comp, pns->nodes[i], false, label, true);
Damien's avatar
Damien committed
486
487
                }
            } else {
488
                int label2 = comp_next_label(comp);
Damien's avatar
Damien committed
489
                for (int i = 0; i < n - 1; i++) {
490
                    cpython_c_if_cond(comp, pns->nodes[i], false, label2, true);
Damien's avatar
Damien committed
491
                }
492
                cpython_c_if_cond(comp, pns->nodes[n - 1], true, label, true);
493
                EMIT_ARG(label_assign, label2);
Damien's avatar
Damien committed
494
495
            }
            return;
496
        } else if (!is_nested && MP_PARSE_NODE_STRUCT_KIND(pns) == PN_not_test_2) {
497
            cpython_c_if_cond(comp, pns->nodes[0], !jump_if, label, true);
Damien's avatar
Damien committed
498
499
500
501
502
503
504
            return;
        }
    }

    // nothing special, fall back to default compiling for node and jump
    compile_node(comp, pn);
    if (jump_if == false) {
505
        EMIT_ARG(pop_jump_if_false, label);
Damien's avatar
Damien committed
506
    } else {
507
        EMIT_ARG(pop_jump_if_true, label);
Damien's avatar
Damien committed
508
509
    }
}
510
#endif
Damien's avatar
Damien committed
511

512
STATIC void c_if_cond(compiler_t *comp, mp_parse_node_t pn, bool jump_if, int label) {
513
#if MICROPY_EMIT_CPYTHON
514
515
516
517
    cpython_c_if_cond(comp, pn, jump_if, label, false);
#else
    if (node_is_const_false(pn)) {
        if (jump_if == false) {
518
            EMIT_ARG(jump, label);
519
520
521
522
        }
        return;
    } else if (node_is_const_true(pn)) {
        if (jump_if == true) {
523
            EMIT_ARG(jump, label);
524
525
        }
        return;
526
527
528
529
    } 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) {
530
531
532
533
534
535
            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);
536
                EMIT_ARG(label_assign, label2);
537
538
539
540
541
542
            } else {
                for (int i = 0; i < n; i++) {
                    c_if_cond(comp, pns->nodes[i], true, label);
                }
            }
            return;
543
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_and_test) {
544
545
546
547
548
549
550
551
552
553
            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);
554
                EMIT_ARG(label_assign, label2);
555
556
            }
            return;
557
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_not_test_2) {
558
559
560
561
562
563
564
565
            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) {
566
        EMIT_ARG(pop_jump_if_false, label);
567
    } else {
568
        EMIT_ARG(pop_jump_if_true, label);
569
570
    }
#endif
Damien's avatar
Damien committed
571
572
573
}

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

576
void c_assign_power(compiler_t *comp, mp_parse_node_struct_t *pns, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
577
578
579
580
    if (assign_kind != ASSIGN_AUG_STORE) {
        compile_node(comp, pns->nodes[0]);
    }

581
582
583
584
    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
585
586
587
588
589
            if (assign_kind != ASSIGN_AUG_STORE) {
                for (int i = 0; i < n - 1; i++) {
                    compile_node(comp, pns1->nodes[i]);
                }
            }
590
591
            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
592
        }
593
        if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_paren) {
594
            compile_syntax_error(comp, "can't assign to function call");
Damien's avatar
Damien committed
595
            return;
596
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_bracket) {
Damien's avatar
Damien committed
597
598
599
600
601
602
603
            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);
604
                    EMIT_ARG(binary_op, RT_BINARY_OP_SUBSCR);
Damien's avatar
Damien committed
605
606
607
608
                } else {
                    EMIT(store_subscr);
                }
            }
609
610
        } 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
611
612
            if (assign_kind == ASSIGN_AUG_LOAD) {
                EMIT(dup_top);
613
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
614
615
616
617
            } else {
                if (assign_kind == ASSIGN_AUG_STORE) {
                    EMIT(rot_two);
                }
618
                EMIT_ARG(store_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
619
620
621
622
623
624
625
626
627
628
            }
        } else {
            // shouldn't happen
            assert(0);
        }
    } else {
        // shouldn't happen
        assert(0);
    }

629
    if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
Damien's avatar
Damien committed
630
631
632
633
634
        // SyntaxError, cannot assign
        assert(0);
    }
}

635
void c_assign_tuple(compiler_t *comp, int n, mp_parse_node_t *nodes) {
Damien's avatar
Damien committed
636
637
638
    assert(n >= 0);
    int have_star_index = -1;
    for (int i = 0; i < n; i++) {
639
        if (MP_PARSE_NODE_IS_STRUCT_KIND(nodes[i], PN_star_expr)) {
Damien's avatar
Damien committed
640
            if (have_star_index < 0) {
641
                EMIT_ARG(unpack_ex, i, n - i - 1);
Damien's avatar
Damien committed
642
643
                have_star_index = i;
            } else {
644
                compile_syntax_error(comp, "two starred expressions in assignment");
Damien's avatar
Damien committed
645
646
647
648
649
                return;
            }
        }
    }
    if (have_star_index < 0) {
650
        EMIT_ARG(unpack_sequence, n);
Damien's avatar
Damien committed
651
652
653
    }
    for (int i = 0; i < n; i++) {
        if (i == have_star_index) {
654
            c_assign(comp, ((mp_parse_node_struct_t*)nodes[i])->nodes[0], ASSIGN_STORE);
Damien's avatar
Damien committed
655
656
657
658
659
660
661
        } else {
            c_assign(comp, nodes[i], ASSIGN_STORE);
        }
    }
}

// assigns top of stack to pn
662
void c_assign(compiler_t *comp, mp_parse_node_t pn, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
663
    tail_recursion:
664
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
665
        assert(0);
666
667
668
    } 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
669
670
671
            switch (assign_kind) {
                case ASSIGN_STORE:
                case ASSIGN_AUG_STORE:
672
                    EMIT_ARG(store_id, arg);
Damien's avatar
Damien committed
673
674
                    break;
                case ASSIGN_AUG_LOAD:
675
                    EMIT_ARG(load_id, arg);
Damien's avatar
Damien committed
676
677
678
                    break;
            }
        } else {
679
            compile_syntax_error(comp, "can't assign to literal");
Damien's avatar
Damien committed
680
681
682
            return;
        }
    } else {
683
684
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
Damien's avatar
Damien committed
685
686
687
688
689
690
691
692
693
694
695
            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;
                }
696
                c_assign_tuple(comp, MP_PARSE_NODE_STRUCT_NUM_NODES(pns), pns->nodes);
Damien's avatar
Damien committed
697
698
699
700
                break;

            case PN_atom_paren:
                // lhs is something in parenthesis
701
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
702
                    // empty tuple
703
                    compile_syntax_error(comp, "can't assign to ()");
Damien's avatar
Damien committed
704
                    return;
705
706
                } 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
707
708
709
710
711
712
713
714
715
716
717
718
719
                    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;
                }
720
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
721
722
                    // empty list, assignment allowed
                    c_assign_tuple(comp, 0, NULL);
723
724
                } 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
725
726
727
728
729
730
731
732
                    goto testlist_comp;
                } else {
                    // brackets around 1 item
                    c_assign_tuple(comp, 1, &pns->nodes[0]);
                }
                break;

            default:
733
                printf("unknown assign, %u\n", (uint)MP_PARSE_NODE_STRUCT_KIND(pns));
Damien's avatar
Damien committed
734
735
736
737
738
739
                assert(0);
        }
        return;

        testlist_comp:
        // lhs is a sequence
740
741
742
        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
743
                // sequence of one item, with trailing comma
744
                assert(MP_PARSE_NODE_IS_NULL(pns2->nodes[0]));
Damien's avatar
Damien committed
745
                c_assign_tuple(comp, 1, &pns->nodes[0]);
746
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns2) == PN_testlist_comp_3c) {
Damien's avatar
Damien committed
747
748
                // sequence of many items
                // TODO call c_assign_tuple instead
749
                int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns2);
750
                EMIT_ARG(unpack_sequence, 1 + n);
Damien's avatar
Damien committed
751
752
753
754
                c_assign(comp, pns->nodes[0], ASSIGN_STORE);
                for (int i = 0; i < n; i++) {
                    c_assign(comp, pns2->nodes[i], ASSIGN_STORE);
                }
755
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_comp_for) {
Damien's avatar
Damien committed
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
                // 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:
772
    compile_syntax_error(comp, "illegal expression for augmented assignment");
Damien's avatar
Damien committed
773
774
775
776
}

// 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) {
777
778
#if !MICROPY_EMIT_CPYTHON
    // in Micro Python we put the default params into a tuple using the bytecode
779
780
781
    if (n_default_params) {
        EMIT_ARG(build_tuple, n_default_params);
    }
782
783
#endif

Damien's avatar
Damien committed
784
    // make closed over variables, if any
785
    // ensure they are closed over in the order defined in the outer scope (mainly to agree with CPython)
Damien's avatar
Damien committed
786
787
    int nfree = 0;
    if (comp->scope_cur->kind != SCOPE_MODULE) {
788
789
790
791
792
793
        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
794
#if MICROPY_EMIT_CPYTHON
795
                        EMIT_ARG(load_closure, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
796
797
#else
                        // in Micro Python we load closures using LOAD_FAST
798
                        EMIT_ARG(load_fast, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
799
#endif
800
801
802
                        nfree += 1;
                    }
                }
Damien's avatar
Damien committed
803
804
805
806
807
808
            }
        }
    }

    // make the function/closure
    if (nfree == 0) {
809
        EMIT_ARG(make_function, this_scope, n_dict_params, n_default_params);
Damien's avatar
Damien committed
810
    } else {
811
        EMIT_ARG(build_tuple, nfree);
812
        EMIT_ARG(make_closure, this_scope, n_dict_params, n_default_params);
Damien's avatar
Damien committed
813
814
815
    }
}

816
void compile_funcdef_param(compiler_t *comp, mp_parse_node_t pn) {
817
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_star)) {
818
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
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
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
        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
861
862
            // this parameter has a default value
            // in CPython, None (and True, False?) as default parameters are loaded with LOAD_NAME; don't understandy why
863

Damien's avatar
Damien committed
864
865
866
            if (comp->have_bare_star) {
                comp->param_pass_num_dict_params += 1;
                if (comp->param_pass == 1) {
867
868
                    EMIT_ARG(load_const_id, MP_PARSE_NODE_LEAF_ARG(pn_id));
                    compile_node(comp, pn_equal);
Damien's avatar
Damien committed
869
870
871
872
                }
            } else {
                comp->param_pass_num_default_params += 1;
                if (comp->param_pass == 2) {
873
                    compile_node(comp, pn_equal);
Damien's avatar
Damien committed
874
875
876
                }
            }
        }
877
878
879

        // TODO pn_colon not implemented
        (void)pn_colon;
Damien's avatar
Damien committed
880
881
882
883
884
    }
}

// leaves function object on stack
// returns function name
885
qstr compile_funcdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
886
887
    if (comp->pass == PASS_1) {
        // create a new scope for this function
888
        scope_t *s = scope_new_and_link(comp, SCOPE_FUNCTION, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
889
        // store the function scope so the compiling function can use it at each pass
890
        pns->nodes[4] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
891
892
893
894
895
896
897
898
899
    }

    // 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
900
901

    // pass 1 does any default parameters after bare star
Damien's avatar
Damien committed
902
    comp->have_bare_star = false;
903
    comp->param_pass = 1;
Damien's avatar
Damien committed
904
905
906
    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);
907
908
909
910
911
912

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

    // pass 2 does any default parameters before bare star
Damien's avatar
Damien committed
913
    comp->have_bare_star = false;
914
    comp->param_pass = 2;
Damien's avatar
Damien committed
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
    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
937
qstr compile_classdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
938
939
    if (comp->pass == PASS_1) {
        // create a new scope for this class
940
        scope_t *s = scope_new_and_link(comp, SCOPE_CLASS, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
941
        // store the class scope so the compiling function can use it at each pass
942
        pns->nodes[3] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
943
944
945
946
947
948
949
950
951
952
953
    }

    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
954
    EMIT_ARG(load_const_id, cscope->simple_name);
Damien's avatar
Damien committed
955
956

    // nodes[1] has parent classes, if any
957
958
    comp->func_arg_is_super = false;
    compile_trailer_paren_helper(comp, pns->nodes[1], false, 2);
Damien's avatar
Damien committed
959
960
961
962
963

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

964
// returns true if it was a built-in decorator (even if the built-in had an error)
965
STATIC bool compile_built_in_decorator(compiler_t *comp, int name_len, mp_parse_node_t *name_nodes, uint *emit_options) {
966
    if (MP_PARSE_NODE_LEAF_ARG(name_nodes[0]) != MP_QSTR_micropython) {
967
968
969
970
        return false;
    }

    if (name_len != 2) {
971
        compile_syntax_error(comp, "invalid micropython decorator");
972
973
974
        return true;
    }

975
    qstr attr = MP_PARSE_NODE_LEAF_ARG(name_nodes[1]);
976
    if (attr == MP_QSTR_byte_code) {
Damien's avatar
Damien committed
977
        *emit_options = EMIT_OPT_BYTE_CODE;
978
#if MICROPY_EMIT_NATIVE
979
    } else if (attr == MP_QSTR_native) {
980
        *emit_options = EMIT_OPT_NATIVE_PYTHON;
981
    } else if (attr == MP_QSTR_viper) {
Damien's avatar
Damien committed
982
        *emit_options = EMIT_OPT_VIPER;
983
#endif
984
#if MICROPY_EMIT_INLINE_THUMB
985
    } else if (attr == MP_QSTR_asm_thumb) {
986
        *emit_options = EMIT_OPT_ASM_THUMB;
987
#endif
988
    } else {
989
        compile_syntax_error(comp, "invalid micropython decorator");
990
991
992
993
994
    }

    return true;
}

995
void compile_decorated(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
996
    // get the list of decorators
997
    mp_parse_node_t *nodes;
Damien's avatar
Damien committed
998
999
    int n = list_get(&pns->nodes[0], PN_decorators, &nodes);

1000
1001
1002
1003
1004
    // 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
1005
    for (int i = 0; i < n; i++) {
1006
1007
        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];
1008
1009

        // nodes[0] contains the decorator function, which is a dotted name
1010
        mp_parse_node_t *name_nodes;
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
        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++) {
1024
                assert(MP_PARSE_NODE_IS_ID(name_nodes[i])); // should be
1025
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(name_nodes[i]));
1026
1027
1028
            }

            // nodes[1] contains arguments to the decorator function, if any
1029
            if (!MP_PARSE_NODE_IS_NULL(pns_decorator->nodes[1])) {
1030
                // call the decorator function with the arguments in nodes[1]
Damien George's avatar
Damien George committed
1031
                comp->func_arg_is_super = false;
1032
1033
                compile_node(comp, pns_decorator->nodes[1]);
            }
Damien's avatar
Damien committed
1034
1035
1036
1037
        }
    }

    // compile the body (funcdef or classdef) and get its name
1038
    mp_parse_node_struct_t *pns_body = (mp_parse_node_struct_t*)pns->nodes[1];
Damien's avatar
Damien committed
1039
    qstr body_name = 0;
1040
    if (MP_PARSE_NODE_STRUCT_KIND(pns_body) == PN_funcdef) {
1041
        body_name = compile_funcdef_helper(comp, pns_body, emit_options);
1042
    } else if (MP_PARSE_NODE_STRUCT_KIND(pns_body) == PN_classdef) {
1043
        body_name = compile_classdef_helper(comp, pns_body, emit_options);
Damien's avatar
Damien committed
1044
1045
1046
1047
1048
1049
    } else {
        // shouldn't happen
        assert(0);
    }

    // call each decorator
1050
    for (int i = 0; i < n - num_built_in_decorators; i++) {
1051
        EMIT_ARG(call_function, 1, 0, false, false);
Damien's avatar
Damien committed
1052
1053
1054
    }

    // store func/class object into name
1055
    EMIT_ARG(store_id, body_name);
Damien's avatar
Damien committed
1056
1057
}

1058
void compile_funcdef(compiler_t *comp, mp_parse_node_struct_t *pns) {
1059
    qstr fname = compile_funcdef_helper(comp, pns, comp->scope_cur->emit_options);
Damien's avatar
Damien committed
1060
    // store function object into function name
1061