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

// TODO need to mangle __attr names

22
23
#define MICROPY_EMIT_NATIVE (MICROPY_EMIT_X64 || MICROPY_EMIT_THUMB)

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

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

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

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

49
50
    int next_label;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    return pn;
}

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

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

205
STATIC scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
206
    scope_t *scope = scope_new(kind, pn, comp->source_file, rt_get_unique_code_id(), emit_options);
Damien's avatar
Damien committed
207
208
209
210
211
212
213
214
215
216
217
218
219
220
    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;
}

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

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

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

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

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

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

288
STATIC void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
289
290
    uint len;
    const byte *str = qstr_data(qstr, &len);
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
    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, "'");
    }
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

801
void compile_funcdef_param(compiler_t *comp, mp_parse_node_t pn) {
802
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_star)) {
803
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
        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
846
847
            // this parameter has a default value
            // in CPython, None (and True, False?) as default parameters are loaded with LOAD_NAME; don't understandy why
848

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

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

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

    // 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
885
886

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

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

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

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

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

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

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

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

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

    return true;
}

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

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

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

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

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

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

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

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

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

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