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

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

// TODO need to mangle __attr names

21
22
#define MICROPY_EMIT_NATIVE (MICROPY_EMIT_X64 || MICROPY_EMIT_THUMB)

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

31
32
33
34
#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
35

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

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

48
49
    int next_label;

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

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

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

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

    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
73
74
} compiler_t;

75
76
77
78
79
80
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;
}

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

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

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

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

            case PN_term:
132
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
133
134
                    int arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    int arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
135
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_STAR)) {
136
#if MICROPY_EMIT_CPYTHON
137
                        // can overflow; enabled only to compare with CPython
138
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 * arg1);
139
#endif
140
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_SLASH)) {
Damien's avatar
Damien committed
141
                        ; // pass
142
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PERCENT)) {
143
                        // XXX implement this properly as Python's % operator acts differently to C's
144
145
                        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)) {
146
                        // XXX implement this properly as Python's // operator acts differently to C's
147
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, 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
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
STATIC scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
204
    scope_t *scope = scope_new(kind, pn, comp->source_file, rt_get_unique_code_id(), emit_options);
Damien's avatar
Damien committed
205
206
207
208
209
210
211
212
213
214
215
216
217
218
    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;
}

219
STATIC int list_len(mp_parse_node_t pn, int pn_kind) {
220
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
221
        return 0;
222
    } else if (MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
223
224
        return 1;
    } else {
225
226
        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
227
228
            return 1;
        } else {
229
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
230
231
232
233
        }
    }
}

234
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)) {
235
236
237
    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
238
239
240
        for (int i = 0; i < num_nodes; i++) {
            f(comp, pns->nodes[i]);
        }
241
    } else if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
242
243
244
245
        f(comp, pn);
    }
}

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

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

268
269
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
270
271
272
273
274
    for (int i = 0; i < num_nodes; i++) {
        compile_node(comp, pns->nodes[i]);
    }
}

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

286
STATIC void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
287
288
    uint len;
    const byte *str = qstr_data(qstr, &len);
289
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
    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, "'");
    }
}

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

333
334
335
336
337
338
339
340
    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
341
            switch (arg) {
342
343
344
                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
345
346
347
348
349
350
351
                default: assert(0);
            }
            break;
        default: assert(0);
    }
}

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

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

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

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

436
STATIC bool node_is_const_true(mp_parse_node_t pn) {
437
    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
438
439
}

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

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

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

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

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

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

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

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

// assigns top of stack to pn
650
void c_assign(compiler_t *comp, mp_parse_node_t pn, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
651
    tail_recursion:
652
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
653
        assert(0);
654
655
656
    } 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
657
658
659
            switch (assign_kind) {
                case ASSIGN_STORE:
                case ASSIGN_AUG_STORE:
660
                    EMIT_ARG(store_id, arg);
Damien's avatar
Damien committed
661
662
                    break;
                case ASSIGN_AUG_LOAD:
663
                    EMIT_ARG(load_id, arg);
Damien's avatar
Damien committed
664
665
666
                    break;
            }
        } else {
667
            compile_syntax_error(comp, "can't assign to literal");
Damien's avatar
Damien committed
668
669
670
            return;
        }
    } else {
671
672
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
Damien's avatar
Damien committed
673
674
675
676
677
678
679
680
681
682
683
            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;
                }
684
                c_assign_tuple(comp, MP_PARSE_NODE_STRUCT_NUM_NODES(pns), pns->nodes);
Damien's avatar
Damien committed
685
686
687
688
                break;

            case PN_atom_paren:
                // lhs is something in parenthesis
689
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
690
                    // empty tuple
691
                    compile_syntax_error(comp, "can't assign to ()");
Damien's avatar
Damien committed
692
                    return;
693
694
                } 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
695
696
697
698
699
700
701
702
703
704
705
706
707
                    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;
                }
708
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
709
710
                    // empty list, assignment allowed
                    c_assign_tuple(comp, 0, NULL);
711
712
                } 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
713
714
715
716
717
718
719
720
                    goto testlist_comp;
                } else {
                    // brackets around 1 item
                    c_assign_tuple(comp, 1, &pns->nodes[0]);
                }
                break;

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

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

// 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
766
    // ensure they are closed over in the order defined in the outer scope (mainly to agree with CPython)
Damien's avatar
Damien committed
767
768
    int nfree = 0;
    if (comp->scope_cur->kind != SCOPE_MODULE) {
769
770
771
772
773
774
        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
775
#if MICROPY_EMIT_CPYTHON
776
                        EMIT_ARG(load_closure, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
777
778
#else
                        // in Micro Python we load closures using LOAD_FAST
779
                        EMIT_ARG(load_fast, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
780
#endif
781
782
783
                        nfree += 1;
                    }
                }
Damien's avatar
Damien committed
784
785
786
787
            }
        }
    }
    if (nfree > 0) {
788
        EMIT_ARG(build_tuple, nfree);
Damien's avatar
Damien committed
789
790
791
792
    }

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

799
void compile_funcdef_param(compiler_t *comp, mp_parse_node_t pn) {
800
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_star)) {
801
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
802
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
        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
844
845
            // this parameter has a default value
            // in CPython, None (and True, False?) as default parameters are loaded with LOAD_NAME; don't understandy why
846

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

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

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

    // 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
883
884

    // pass 1 does any default parameters after bare star
Damien's avatar
Damien committed
885
    comp->have_bare_star = false;
886
    comp->param_pass = 1;
Damien's avatar
Damien committed
887
888
889
    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);
890
891
892
893
894
895

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

    // pass 2 does any default parameters before bare star
Damien's avatar
Damien committed
896
    comp->have_bare_star = false;
897
    comp->param_pass = 2;
Damien's avatar
Damien committed
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
    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
920
qstr compile_classdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
921
922
    if (comp->pass == PASS_1) {
        // create a new scope for this class
923
        scope_t *s = scope_new_and_link(comp, SCOPE_CLASS, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
924
        // store the class scope so the compiling function can use it at each pass
925
        pns->nodes[3] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
926
927
928
929
930
931
932
933
934
935
936
    }

    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
937
    EMIT_ARG(load_const_id, cscope->simple_name);
Damien's avatar
Damien committed
938
939

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

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

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

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

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

    return true;
}

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

983
984
985
986
987
    // 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
988
    for (int i = 0; i < n; i++) {
989
990
        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];
991
992

        // nodes[0] contains the decorator function, which is a dotted name
993
        mp_parse_node_t *name_nodes;
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
        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++) {
1007
                assert(MP_PARSE_NODE_IS_ID(name_nodes[i])); // should be
1008
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(name_nodes[i]));
1009
1010
1011
            }

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

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

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

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

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

1047
1048
void c_del_stmt(compiler_t *comp, mp_parse_node_t pn) {
    if (MP_PARSE_NODE_IS_ID(pn)) {
1049
        EMIT_ARG(delete_id, MP_PARSE_NODE_LEAF_ARG(pn));
1050
1051
    } 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
1052
1053
1054

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

1055
1056
1057
1058
        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);