compile.c 131 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
    uint16_t n_arg_keyword;
54
    uint8_t star_flags;
55
56
57
58
    uint8_t have_bare_star;
    uint8_t param_pass;
    uint16_t param_pass_num_dict_params;
    uint16_t param_pass_num_default_params;
Damien's avatar
Damien committed
59
60
61
62

    scope_t *scope_head;
    scope_t *scope_cur;

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

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

70
STATIC void compile_syntax_error(compiler_t *comp, mp_parse_node_t pn, const char *msg) {
71
    // TODO store the error message to a variable in compiler_t instead of printing it
72
73
74
75
76
    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));
    }
77
78
79
80
    printf("SyntaxError: %s\n", msg);
    comp->had_error = true;
}

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

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

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

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

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

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

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

    return pn;
}

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

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

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

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

215
STATIC scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
216
    scope_t *scope = scope_new(kind, pn, comp->source_file, mp_emit_glue_get_unique_code_id(), emit_options);
Damien's avatar
Damien committed
217
218
219
220
221
222
223
224
225
226
227
228
229
230
    scope->parent = comp->scope_cur;
    scope->next = NULL;
    if (comp->scope_head == NULL) {
        comp->scope_head = scope;
    } else {
        scope_t *s = comp->scope_head;
        while (s->next != NULL) {
            s = s->next;
        }
        s->next = scope;
    }
    return scope;
}

231
STATIC int list_len(mp_parse_node_t pn, int pn_kind) {
232
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
233
        return 0;
234
    } else if (MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
235
236
        return 1;
    } else {
237
238
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        if (MP_PARSE_NODE_STRUCT_KIND(pns) != pn_kind) {
Damien's avatar
Damien committed
239
240
            return 1;
        } else {
241
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
242
243
244
245
        }
    }
}

246
STATIC void apply_to_single_or_list(compiler_t *comp, mp_parse_node_t pn, int pn_list_kind, void (*f)(compiler_t*, mp_parse_node_t)) {
247
248
249
    if (MP_PARSE_NODE_IS_STRUCT(pn) && MP_PARSE_NODE_STRUCT_KIND((mp_parse_node_struct_t*)pn) == pn_list_kind) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        int num_nodes = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
250
251
252
        for (int i = 0; i < num_nodes; i++) {
            f(comp, pns->nodes[i]);
        }
253
    } else if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
254
255
256
257
        f(comp, pn);
    }
}

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

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

280
281
void compile_generic_all_nodes(compiler_t *comp, mp_parse_node_struct_t *pns) {
    int num_nodes = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
282
283
284
285
286
    for (int i = 0; i < num_nodes; i++) {
        compile_node(comp, pns->nodes[i]);
    }
}

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

298
STATIC void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
299
300
    uint len;
    const byte *str = qstr_data(qstr, &len);
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
    bool has_single_quote = false;
    bool has_double_quote = false;
    for (int i = 0; i < len; i++) {
        if (str[i] == '\'') {
            has_single_quote = true;
        } else if (str[i] == '"') {
            has_double_quote = true;
        }
    }
    if (bytes) {
        vstr_printf(vstr, "b");
    }
    bool quote_single = false;
    if (has_single_quote && !has_double_quote) {
        vstr_printf(vstr, "\"");
    } else {
        quote_single = true;
        vstr_printf(vstr, "'");
    }
    for (int i = 0; i < len; i++) {
        if (str[i] == '\n') {
            vstr_printf(vstr, "\\n");
        } else if (str[i] == '\\') {
            vstr_printf(vstr, "\\\\");
        } else if (str[i] == '\'' && quote_single) {
            vstr_printf(vstr, "\\'");
        } else {
            vstr_printf(vstr, "%c", str[i]);
        }
    }
    if (has_single_quote && !has_double_quote) {
        vstr_printf(vstr, "\"");
    } else {
        vstr_printf(vstr, "'");
    }
}

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

345
346
347
348
349
350
351
352
    int arg = MP_PARSE_NODE_LEAF_ARG(pn);
    switch (MP_PARSE_NODE_LEAF_KIND(pn)) {
        case MP_PARSE_NODE_ID: assert(0);
        case MP_PARSE_NODE_INTEGER: vstr_printf(vstr, "%s", qstr_str(arg)); break;
        case MP_PARSE_NODE_DECIMAL: vstr_printf(vstr, "%s", qstr_str(arg)); break;
        case MP_PARSE_NODE_STRING: cpython_c_print_quoted_str(vstr, arg, false); break;
        case MP_PARSE_NODE_BYTES: cpython_c_print_quoted_str(vstr, arg, true); break;
        case MP_PARSE_NODE_TOKEN:
Damien's avatar
Damien committed
353
            switch (arg) {
354
355
356
                case MP_TOKEN_KW_FALSE: vstr_printf(vstr, "False"); break;
                case MP_TOKEN_KW_NONE: vstr_printf(vstr, "None"); break;
                case MP_TOKEN_KW_TRUE: vstr_printf(vstr, "True"); break;
357
                default: assert(0); // shouldn't happen
Damien's avatar
Damien committed
358
359
360
361
362
363
            }
            break;
        default: assert(0);
    }
}

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

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

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

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

448
STATIC bool node_is_const_true(mp_parse_node_t pn) {
449
    return MP_PARSE_NODE_IS_TOKEN_KIND(pn, MP_TOKEN_KW_TRUE) || (MP_PARSE_NODE_IS_SMALL_INT(pn) && MP_PARSE_NODE_LEAF_SMALL_INT(pn) == 1);
Damien's avatar
Damien committed
450
451
}

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

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

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

    // nothing special, fall back to default compiling for node and jump
    compile_node(comp, pn);
    if (jump_if == false) {
566
        EMIT_ARG(pop_jump_if_false, label);
567
    } else {
568
        EMIT_ARG(pop_jump_if_true, label);
569
570
    }
#endif
Damien's avatar
Damien committed
571
572
573
}

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

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

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

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

    return;

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

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

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

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

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

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

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

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

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

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

Damien's avatar
Damien committed
867
868
869
            if (comp->have_bare_star) {
                comp->param_pass_num_dict_params += 1;
                if (comp->param_pass == 1) {
870
871
872
873
874
875
876
#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
877
878
                    EMIT_ARG(load_const_id, MP_PARSE_NODE_LEAF_ARG(pn_id));
                    compile_node(comp, pn_equal);
879
880
881
882
#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
883
884
885
886
                }
            } else {
                comp->param_pass_num_default_params += 1;
                if (comp->param_pass == 2) {
887
                    compile_node(comp, pn_equal);
Damien's avatar
Damien committed
888
889
890
                }
            }
        }
891
892
893

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

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

    // save variables (probably don't need to do this, since we can't have nested definitions..?)
908
909
910
911
    uint old_have_bare_star = comp->have_bare_star;
    uint old_param_pass = comp->param_pass;
    uint old_param_pass_num_dict_params = comp->param_pass_num_dict_params;
    uint old_param_pass_num_default_params = comp->param_pass_num_default_params;
Damien's avatar
Damien committed
912
913

    // compile default parameters
914
915

    // pass 1 does any default parameters after bare star
Damien's avatar
Damien committed
916
    comp->have_bare_star = false;
917
    comp->param_pass = 1;
Damien's avatar
Damien committed
918
919
920
    comp->param_pass_num_dict_params = 0;
    comp->param_pass_num_default_params = 0;
    apply_to_single_or_list(comp, pns->nodes[1], PN_typedargslist, compile_funcdef_param);
921
922
923
924
925
926

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

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

933
934
935
936
937
938
939
#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
940
941
942
943
    // get the scope for this function
    scope_t *fscope = (scope_t*)pns->nodes[4];

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

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

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

    // nodes[1] has parent classes, if any
978
979
980
981
982
    // 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;
    }
983
    comp->func_arg_is_super = false;
984
    compile_trailer_paren_helper(comp, parents, false, 2);
Damien's avatar
Damien committed
985
986
987
988
989

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

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

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

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

    return true;
}

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

1026
1027
1028
1029
1030
    // 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
1031
    for (int i = 0; i < n; i++) {
1032
1033
        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];
1034
1035

        // nodes[0] contains the decorator function, which is a dotted name
1036
        mp_parse_node_t *name_nodes;
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
        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++) {
1050
                assert(MP_PARSE_NODE_IS_ID(name_nodes[i])); // should be
1051
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(name_nodes[i]));
1052
1053
1054
            }

            // nodes[1] contains arguments to the decorator function, if any
1055
            if (!MP_PARSE_NODE_IS_NULL(pns_decorator->nodes[1])) {