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

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

// TODO need to mangle __attr names

24
25
#define MICROPY_EMIT_NATIVE (MICROPY_EMIT_X64 || MICROPY_EMIT_THUMB)

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

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

typedef struct _compiler_t {
40
    qstr source_file;
41
42
43
44
    uint8_t is_repl;
    uint8_t pass; // holds enum type pass_kind_t
    uint8_t had_error; // try to keep compiler clean from nlr
    uint8_t func_arg_is_super; // used to compile special case of super() function call
Damien's avatar
Damien committed
45

46
47
    int next_label;

Damien's avatar
Damien committed
48
49
    int break_label;
    int continue_label;
50
    int break_continue_except_level;
51
    uint16_t cur_except_level; // increased for SETUP_EXCEPT, SETUP_FINALLY; decreased for POP_BLOCK, POP_EXCEPT
Damien's avatar
Damien committed
52
53
54
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;

    scope_t *scope_head;
    scope_t *scope_cur;

64
65
    emit_t *emit;                                   // current emitter
    const emit_method_table_t *emit_method_table;   // current emit method table
66
67
68

    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
69
70
} compiler_t;

71
STATIC void compile_syntax_error(compiler_t *comp, mp_parse_node_t pn, const char *msg) {
72
    // TODO store the error message to a variable in compiler_t instead of printing it
73
74
75
76
77
    if (MP_PARSE_NODE_IS_STRUCT(pn)) {
        printf("  File \"%s\", line " UINT_FMT "\n", qstr_str(comp->source_file), (machine_uint_t)((mp_parse_node_struct_t*)pn)->source_line);
    } else {
        printf("  File \"%s\"\n", qstr_str(comp->source_file));
    }
78
79
80
81
    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
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PLUS)) {
117
                        arg0 += arg1;
118
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_MINUS)) {
119
                        arg0 -= arg1;
Damien's avatar
Damien committed
120
121
122
                    } else {
                        // shouldn't happen
                        assert(0);
123
                    }
124
125
                    if (MP_PARSE_FITS_SMALL_INT(arg0)) {
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0);
Damien's avatar
Damien committed
126
127
128
129
130
                    }
                }
                break;

            case PN_term:
131
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
132
133
                    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]);
134
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_STAR)) {
135
136
137
138
139
140
                        if (!mp_small_int_mul_overflow(arg0, arg1)) {
                            arg0 *= arg1;
                            if (MP_PARSE_FITS_SMALL_INT(arg0)) {
                                pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0);
                            }
                        }
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
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, mp_small_int_modulo(arg0, arg1));
145
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_SLASH)) {
146
                        if (arg1 != 0) {
147
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, mp_small_int_floor_divide(arg0, arg1));
148
                        }
Damien's avatar
Damien committed
149
150
151
152
153
154
155
156
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

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

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

    return pn;
}

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

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

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

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

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

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

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

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

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

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

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

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

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

346
347
348
349
350
351
352
353
    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
354
            switch (arg) {
355
356
357
                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;
358
                default: assert(0); // shouldn't happen
Damien's avatar
Damien committed
359
360
361
362
363
364
            }
            break;
        default: assert(0);
    }
}

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

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

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

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

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

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

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

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

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

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

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

627
    if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
628
        goto cannot_assign;
Damien's avatar
Damien committed
629
    }
630
631
632
633
634

    return;

cannot_assign:
    compile_syntax_error(comp, (mp_parse_node_t)pns, "can't assign to expression");
Damien's avatar
Damien committed
635
636
}

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

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

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

            default:
735
736
                compile_syntax_error(comp, (mp_parse_node_t)pns, "can't assign to expression");
                return;
Damien's avatar
Damien committed
737
738
739
740
741
        }
        return;

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

// stuff for lambda and comprehensions and generators
779
780
781
782
// if we are not in CPython compatibility mode then:
//  if n_pos_defaults > 0 then there is a tuple on the stack with the positional defaults
//  if n_kw_defaults > 0 then there is a dictionary on the stack with the keyword defaults
//  if both exist, the tuple is above the dictionary (ie the first pop gets the tuple)
783
784
785
786
void close_over_variables_etc(compiler_t *comp, scope_t *this_scope, int n_pos_defaults, int n_kw_defaults) {
    assert(n_pos_defaults >= 0);
    assert(n_kw_defaults >= 0);

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

    // make the function/closure
    if (nfree == 0) {
812
        EMIT_ARG(make_function, this_scope, n_pos_defaults, n_kw_defaults);
Damien's avatar
Damien committed
813
    } else {
814
        EMIT_ARG(build_tuple, nfree);
815
        EMIT_ARG(make_closure, this_scope, n_pos_defaults, n_kw_defaults);
Damien's avatar
Damien committed
816
817
818
    }
}

819
void compile_funcdef_param(compiler_t *comp, mp_parse_node_t pn) {
820
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_star)) {
821
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
        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 {
850
            // XXX what to do here?
851
852
853
854
855
856
857
858
859
            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) {
860
                compile_syntax_error(comp, pn, "non-default argument follows default argument");
861
862
863
864
                return;
            }

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

Damien's avatar
Damien committed
868
869
870
            if (comp->have_bare_star) {
                comp->param_pass_num_dict_params += 1;
                if (comp->param_pass == 1) {
871
872
873
874
875
876
877
#if !MICROPY_EMIT_CPYTHON
                    // in Micro Python we put the default dict parameters into a dictionary using the bytecode
                    if (comp->param_pass_num_dict_params == 1) {
                        // first default dict param, so make the map
                        EMIT_ARG(build_map, 0);
                    }
#endif
878
879
                    EMIT_ARG(load_const_id, MP_PARSE_NODE_LEAF_ARG(pn_id));
                    compile_node(comp, pn_equal);
880
881
882
883
#if !MICROPY_EMIT_CPYTHON
                    // in Micro Python we put the default dict parameters into a dictionary using the bytecode
                    EMIT(store_map);
#endif
Damien's avatar
Damien committed
884
885
886
887
                }
            } else {
                comp->param_pass_num_default_params += 1;
                if (comp->param_pass == 2) {
888
                    compile_node(comp, pn_equal);
Damien's avatar
Damien committed
889
890
891
                }
            }
        }
892
893
894

        // TODO pn_colon not implemented
        (void)pn_colon;
Damien's avatar
Damien committed
895
896
897
898
899
    }
}

// leaves function object on stack
// returns function name
900
qstr compile_funcdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
901
902
    if (comp->pass == PASS_1) {
        // create a new scope for this function
903
        scope_t *s = scope_new_and_link(comp, SCOPE_FUNCTION, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
904
        // store the function scope so the compiling function can use it at each pass
905
        pns->nodes[4] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
906
907
908
909
910
911
912
913
914
    }

    // 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
915
916

    // pass 1 does any default parameters after bare star
Damien's avatar
Damien committed
917
    comp->have_bare_star = false;
918
    comp->param_pass = 1;
Damien's avatar
Damien committed
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);
922
923
924
925
926
927

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

    // pass 2 does any default parameters before bare star
Damien's avatar
Damien committed
928
    comp->have_bare_star = false;
929
    comp->param_pass = 2;
Damien's avatar
Damien committed
930
931
932
933
    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);

934
935
936
937
938
939
940
#if !MICROPY_EMIT_CPYTHON
    // in Micro Python we put the default positional parameters into a tuple using the bytecode
    if (comp->param_pass_num_default_params > 0) {
        EMIT_ARG(build_tuple, comp->param_pass_num_default_params);
    }
#endif

Damien's avatar
Damien committed
941
942
943
944
    // get the scope for this function
    scope_t *fscope = (scope_t*)pns->nodes[4];

    // make the function
945
    close_over_variables_etc(comp, fscope, comp->param_pass_num_default_params, comp->param_pass_num_dict_params);
Damien's avatar
Damien committed
946
947
948
949
950
951
952
953
954
955
956
957
958

    // 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
959
qstr compile_classdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
960
961
    if (comp->pass == PASS_1) {
        // create a new scope for this class
962
        scope_t *s = scope_new_and_link(comp, SCOPE_CLASS, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
963
        // store the class scope so the compiling function can use it at each pass
964
        pns->nodes[3] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
965
966
967
968
969
970
971
972
973
974
975
    }

    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
976
    EMIT_ARG(load_const_id, cscope->simple_name);
Damien's avatar
Damien committed
977
978

    // nodes[1] has parent classes, if any
979
980
981
982
983
    // empty parenthesis (eg class C():) gets here as an empty PN_classdef_2 and needs special handling
    mp_parse_node_t parents = pns->nodes[1];
    if (MP_PARSE_NODE_IS_STRUCT_KIND(parents, PN_classdef_2)) {
        parents = MP_PARSE_NODE_NULL;
    }
984
    comp->func_arg_is_super = false;
985
    compile_trailer_paren_helper(comp, parents, false, 2);
Damien's avatar
Damien committed
986
987
988
989
990

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

991
// returns true if it was a built-in decorator (even if the built-in had an error)
992
STATIC bool compile_built_in_decorator(compiler_t *comp, int name_len, mp_parse_node_t *name_nodes, uint *emit_options) {
993
    if (MP_PARSE_NODE_LEAF_ARG(name_nodes[0]) != MP_QSTR_micropython) {
994
995
996
997
        return false;
    }

    if (name_len != 2) {
998
        compile_syntax_error(comp, name_nodes[0], "invalid micropython decorator");
999
1000
1001
        return true;
    }

1002
    qstr attr = MP_PARSE_NODE_LEAF_ARG(name_nodes[1]);
1003
    if (attr == MP_QSTR_byte_code) {
1004
        *emit_options = MP_EMIT_OPT_BYTE_CODE;
1005
#if MICROPY_EMIT_NATIVE
1006
    } else if (attr == MP_QSTR_native) {
1007
        *emit_options = MP_EMIT_OPT_NATIVE_PYTHON;
1008
    } else if (attr == MP_QSTR_viper) {
1009
        *emit_options = MP_EMIT_OPT_VIPER;
1010
#endif
1011
#if MICROPY_EMIT_INLINE_THUMB
1012
    } else if (attr == MP_QSTR_asm_thumb) {
1013
        *emit_options = MP_EMIT_OPT_ASM_THUMB;
1014
#endif
1015
    } else {
1016
        compile_syntax_error(comp, name_nodes[1], "invalid micropython decorator");
1017
1018
1019
1020
1021
    }

    return true;
}

1022
void compile_decorated(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
1023
    // get the list of decorators
1024
    mp_parse_node_t *nodes;
Damien's avatar
Damien committed
1025
1026
    int n = list_get(&pns->nodes[0], PN_decorators, &nodes);

1027
1028
1029
1030
1031
    // 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
1032
    for (int i = 0; i < n; i++) {
Damien's avatar