compile.c 129 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;
Damien's avatar
Damien committed
41
    bool is_repl;
Damien's avatar
Damien committed
42
    pass_kind_t pass;
Damien's avatar
Damien committed
43
    bool had_error; // try to keep compiler clean from nlr
Damien's avatar
Damien committed
44

45
46
    int next_label;

Damien's avatar
Damien committed
47
48
    int break_label;
    int continue_label;
49
50
    int break_continue_except_level;
    int cur_except_level; // increased for SETUP_EXCEPT, SETUP_FINALLY; decreased for POP_BLOCK, POP_EXCEPT
Damien's avatar
Damien committed
51
52
53
54
55
56
57
58
59

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

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

Damien's avatar
Damien committed
62
63
64
    scope_t *scope_head;
    scope_t *scope_cur;

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

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

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

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

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

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

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

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

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

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

    return pn;
}

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

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

205
206
207
208
209
210
211
212
213
214
215
216
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;
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    return;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    return true;
}

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

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

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

            // nodes[1] contains arguments to the decorator function, if any
1057
            if (!MP_PARSE_NODE_IS_NULL(pns_decorator->nodes[1])) {
1058
                // call the decorator function with the arguments in nodes[1]
Damien George's avatar
Damien George committed
1059
                comp->func_arg_is_super = false;