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

#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
17
18
#include "obj.h"
#include "compile.h"
#include "runtime.h"
Damien's avatar
Damien committed
19
20
21

// TODO need to mangle __attr names

22
23
#define MICROPY_EMIT_NATIVE (MICROPY_EMIT_X64 || MICROPY_EMIT_THUMB)

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

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

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

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

49
50
    int next_label;

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

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

    scope_t *scope_head;
    scope_t *scope_cur;

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

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

74
75
76
77
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
78
79
80
81
82
83

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

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

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

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

            case PN_factor_2:
149
150
151
152
153
154
155
156
                if (MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[1])) {
                    machine_int_t arg = MP_PARSE_NODE_LEAF_ARG(pns->nodes[1]);
                    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
157
158
159
160
161
162
163
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

164
#if MICROPY_EMIT_CPYTHON
Damien's avatar
Damien committed
165
            case PN_power:
166
                // can overflow; enabled only to compare with CPython
167
168
169
170
                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])) {
                        int power = MP_PARSE_NODE_LEAF_ARG(pns2->nodes[0]);
Damien's avatar
Damien committed
171
172
                        if (power >= 0) {
                            int ans = 1;
173
                            int base = MP_PARSE_NODE_LEAF_ARG(pns->nodes[0]);
Damien's avatar
Damien committed
174
175
176
                            for (; power > 0; power--) {
                                ans *= base;
                            }
177
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, ans);
Damien's avatar
Damien committed
178
179
180
181
                        }
                    }
                }
                break;
182
#endif
Damien's avatar
Damien committed
183
184
185
186
187
188
        }
    }

    return pn;
}

189
void compile_node(compiler_t *comp, mp_parse_node_t pn);
Damien's avatar
Damien committed
190

191
192
193
194
static int comp_next_label(compiler_t *comp) {
    return comp->next_label++;
}

195
static scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
196
    scope_t *scope = scope_new(kind, pn, comp->source_file, rt_get_unique_code_id(), emit_options);
Damien's avatar
Damien committed
197
198
199
200
201
202
203
204
205
206
207
208
209
210
    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;
}

211
212
static int list_len(mp_parse_node_t pn, int pn_kind) {
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
213
        return 0;
214
    } else if (MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
215
216
        return 1;
    } else {
217
218
        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
219
220
            return 1;
        } else {
221
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
222
223
224
225
        }
    }
}

226
227
228
229
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)) {
    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
230
231
232
        for (int i = 0; i < num_nodes; i++) {
            f(comp, pns->nodes[i]);
        }
233
    } else if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
234
235
236
237
        f(comp, pn);
    }
}

238
239
static int list_get(mp_parse_node_t *pn, int pn_kind, mp_parse_node_t **nodes) {
    if (MP_PARSE_NODE_IS_NULL(*pn)) {
Damien's avatar
Damien committed
240
241
        *nodes = NULL;
        return 0;
242
    } else if (MP_PARSE_NODE_IS_LEAF(*pn)) {
Damien's avatar
Damien committed
243
244
245
        *nodes = pn;
        return 1;
    } else {
246
247
        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
248
249
250
251
            *nodes = pn;
            return 1;
        } else {
            *nodes = pns->nodes;
252
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
253
254
255
256
        }
    }
}

257
void compile_do_nothing(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
258
259
}

260
261
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
262
263
264
265
266
    for (int i = 0; i < num_nodes; i++) {
        compile_node(comp, pns->nodes[i]);
    }
}

267
#if MICROPY_EMIT_CPYTHON
268
269
static bool cpython_c_tuple_is_const(mp_parse_node_t pn) {
    if (!MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
270
271
        return false;
    }
272
    if (MP_PARSE_NODE_IS_ID(pn)) {
Damien's avatar
Damien committed
273
274
275
276
277
        return false;
    }
    return true;
}

278
static void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
279
280
    uint len;
    const byte *str = qstr_data(qstr, &len);
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
    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, "'");
    }
}

318
319
320
321
322
323
324
325
326
327
328
static void cpython_c_tuple_emit_const(compiler_t *comp, mp_parse_node_t pn, vstr_t *vstr) {
    assert(MP_PARSE_NODE_IS_LEAF(pn));
    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_SMALL_INT: vstr_printf(vstr, "%d", arg); break;
        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
329
            switch (arg) {
330
331
332
                case MP_TOKEN_KW_FALSE: vstr_printf(vstr, "False"); break;
                case MP_TOKEN_KW_NONE: vstr_printf(vstr, "None"); break;
                case MP_TOKEN_KW_TRUE: vstr_printf(vstr, "True"); break;
Damien's avatar
Damien committed
333
334
335
336
337
338
339
                default: assert(0);
            }
            break;
        default: assert(0);
    }
}

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

// funnelling all tuple creations through this function is purely so we can optionally agree with CPython
394
void c_tuple(compiler_t *comp, mp_parse_node_t pn, mp_parse_node_struct_t *pns_list) {
395
#if MICROPY_EMIT_CPYTHON
396
397
398
    cpython_c_tuple(comp, pn, pns_list);
#else
    int total = 0;
399
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
400
401
402
403
        compile_node(comp, pn);
        total += 1;
    }
    if (pns_list != NULL) {
404
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
405
406
407
408
409
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
        total += n;
    }
410
    EMIT_ARG(build_tuple, total);
411
412
#endif
}
Damien's avatar
Damien committed
413

414
void compile_generic_tuple(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
415
    // a simple tuple expression
416
    c_tuple(comp, MP_PARSE_NODE_NULL, pns);
Damien's avatar
Damien committed
417
418
}

419
420
421
static bool node_is_const_false(mp_parse_node_t pn) {
    return MP_PARSE_NODE_IS_TOKEN_KIND(pn, MP_TOKEN_KW_FALSE);
    // untested: || (MP_PARSE_NODE_IS_SMALL_INT(pn) && MP_PARSE_NODE_LEAF_ARG(pn) == 1);
Damien's avatar
Damien committed
422
423
}

424
425
static bool node_is_const_true(mp_parse_node_t pn) {
    return MP_PARSE_NODE_IS_TOKEN_KIND(pn, MP_TOKEN_KW_TRUE) || (MP_PARSE_NODE_IS_SMALL_INT(pn) && MP_PARSE_NODE_LEAF_ARG(pn) == 1);
Damien's avatar
Damien committed
426
427
}

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

    // nothing special, fall back to default compiling for node and jump
    compile_node(comp, pn);
    if (jump_if == false) {
481
        EMIT_ARG(pop_jump_if_false, label);
Damien's avatar
Damien committed
482
    } else {
483
        EMIT_ARG(pop_jump_if_true, label);
Damien's avatar
Damien committed
484
485
    }
}
486
#endif
Damien's avatar
Damien committed
487

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

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

552
void c_assign_power(compiler_t *comp, mp_parse_node_struct_t *pns, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
553
554
555
556
    if (assign_kind != ASSIGN_AUG_STORE) {
        compile_node(comp, pns->nodes[0]);
    }

557
558
559
560
    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
561
562
563
564
565
            if (assign_kind != ASSIGN_AUG_STORE) {
                for (int i = 0; i < n - 1; i++) {
                    compile_node(comp, pns1->nodes[i]);
                }
            }
566
567
            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
568
        }
569
        if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_paren) {
Damien's avatar
Damien committed
570
571
            printf("SyntaxError: can't assign to function call\n");
            return;
572
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_bracket) {
Damien's avatar
Damien committed
573
574
575
576
577
578
579
            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);
580
                    EMIT_ARG(binary_op, RT_BINARY_OP_SUBSCR);
Damien's avatar
Damien committed
581
582
583
584
                } else {
                    EMIT(store_subscr);
                }
            }
585
586
        } 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
587
588
            if (assign_kind == ASSIGN_AUG_LOAD) {
                EMIT(dup_top);
589
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
590
591
592
593
            } else {
                if (assign_kind == ASSIGN_AUG_STORE) {
                    EMIT(rot_two);
                }
594
                EMIT_ARG(store_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
595
596
597
598
599
600
601
602
603
604
            }
        } else {
            // shouldn't happen
            assert(0);
        }
    } else {
        // shouldn't happen
        assert(0);
    }

605
    if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
Damien's avatar
Damien committed
606
607
608
609
610
        // SyntaxError, cannot assign
        assert(0);
    }
}

611
void c_assign_tuple(compiler_t *comp, int n, mp_parse_node_t *nodes) {
Damien's avatar
Damien committed
612
613
614
    assert(n >= 0);
    int have_star_index = -1;
    for (int i = 0; i < n; i++) {
615
        if (MP_PARSE_NODE_IS_STRUCT_KIND(nodes[i], PN_star_expr)) {
Damien's avatar
Damien committed
616
            if (have_star_index < 0) {
617
                EMIT_ARG(unpack_ex, i, n - i - 1);
Damien's avatar
Damien committed
618
619
620
621
622
623
624
625
                have_star_index = i;
            } else {
                printf("SyntaxError: two starred expressions in assignment\n");
                return;
            }
        }
    }
    if (have_star_index < 0) {
626
        EMIT_ARG(unpack_sequence, n);
Damien's avatar
Damien committed
627
628
629
    }
    for (int i = 0; i < n; i++) {
        if (i == have_star_index) {
630
            c_assign(comp, ((mp_parse_node_struct_t*)nodes[i])->nodes[0], ASSIGN_STORE);
Damien's avatar
Damien committed
631
632
633
634
635
636
637
        } else {
            c_assign(comp, nodes[i], ASSIGN_STORE);
        }
    }
}

// assigns top of stack to pn
638
void c_assign(compiler_t *comp, mp_parse_node_t pn, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
639
    tail_recursion:
640
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
641
        assert(0);
642
643
644
    } 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
645
646
647
            switch (assign_kind) {
                case ASSIGN_STORE:
                case ASSIGN_AUG_STORE:
648
                    EMIT_ARG(store_id, arg);
Damien's avatar
Damien committed
649
650
                    break;
                case ASSIGN_AUG_LOAD:
651
                    EMIT_ARG(load_id, arg);
Damien's avatar
Damien committed
652
653
654
655
656
657
658
                    break;
            }
        } else {
            printf("SyntaxError: can't assign to literal\n");
            return;
        }
    } else {
659
660
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
Damien's avatar
Damien committed
661
662
663
664
665
666
667
668
669
670
671
            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;
                }
672
                c_assign_tuple(comp, MP_PARSE_NODE_STRUCT_NUM_NODES(pns), pns->nodes);
Damien's avatar
Damien committed
673
674
675
676
                break;

            case PN_atom_paren:
                // lhs is something in parenthesis
677
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
678
679
680
                    // empty tuple
                    printf("SyntaxError: can't assign to ()\n");
                    return;
681
682
                } 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
683
684
685
686
687
688
689
690
691
692
693
694
695
                    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;
                }
696
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
697
698
                    // empty list, assignment allowed
                    c_assign_tuple(comp, 0, NULL);
699
700
                } 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
701
702
703
704
705
706
707
708
                    goto testlist_comp;
                } else {
                    // brackets around 1 item
                    c_assign_tuple(comp, 1, &pns->nodes[0]);
                }
                break;

            default:
709
                printf("unknown assign, %u\n", (uint)MP_PARSE_NODE_STRUCT_KIND(pns));
Damien's avatar
Damien committed
710
711
712
713
714
715
                assert(0);
        }
        return;

        testlist_comp:
        // lhs is a sequence
716
717
718
        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
719
                // sequence of one item, with trailing comma
720
                assert(MP_PARSE_NODE_IS_NULL(pns2->nodes[0]));
Damien's avatar
Damien committed
721
                c_assign_tuple(comp, 1, &pns->nodes[0]);
722
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns2) == PN_testlist_comp_3c) {
Damien's avatar
Damien committed
723
724
                // sequence of many items
                // TODO call c_assign_tuple instead
725
                int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns2);
726
                EMIT_ARG(unpack_sequence, 1 + n);
Damien's avatar
Damien committed
727
728
729
730
                c_assign(comp, pns->nodes[0], ASSIGN_STORE);
                for (int i = 0; i < n; i++) {
                    c_assign(comp, pns2->nodes[i], ASSIGN_STORE);
                }
731
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_comp_for) {
Damien's avatar
Damien committed
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
                // TODO not implemented
                assert(0);
            } else {
                // sequence with 2 items
                goto sequence_with_2_items;
            }
        } else {
            // sequence with 2 items
            sequence_with_2_items:
            c_assign_tuple(comp, 2, pns->nodes);
        }
        return;
    }
    return;

    bad_aug:
    printf("SyntaxError: illegal expression for augmented assignment\n");
}

// stuff for lambda and comprehensions and generators
void close_over_variables_etc(compiler_t *comp, scope_t *this_scope, int n_dict_params, int n_default_params) {
    // make closed over variables, if any
754
    // ensure they are closed over in the order defined in the outer scope (mainly to agree with CPython)
Damien's avatar
Damien committed
755
756
    int nfree = 0;
    if (comp->scope_cur->kind != SCOPE_MODULE) {
757
758
759
760
761
762
        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
763
#if MICROPY_EMIT_CPYTHON
764
                        EMIT_ARG(load_closure, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
765
766
#else
                        // in Micro Python we load closures using LOAD_FAST
767
                        EMIT_ARG(load_fast, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
768
#endif
769
770
771
                        nfree += 1;
                    }
                }
Damien's avatar
Damien committed
772
773
774
775
            }
        }
    }
    if (nfree > 0) {
776
        EMIT_ARG(build_tuple, nfree);
Damien's avatar
Damien committed
777
778
779
780
    }

    // make the function/closure
    if (nfree == 0) {
781
        EMIT_ARG(make_function, this_scope, n_dict_params, n_default_params);
Damien's avatar
Damien committed
782
    } else {
783
        EMIT_ARG(make_closure, this_scope, n_dict_params, n_default_params);
Damien's avatar
Damien committed
784
785
786
    }
}

787
788
789
790
void compile_funcdef_param(compiler_t *comp, mp_parse_node_t pn) {
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_name)) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
Damien's avatar
Damien committed
791
792
793
794
795
            // this parameter has a default value
            // in CPython, None (and True, False?) as default parameters are loaded with LOAD_NAME; don't understandy why
            if (comp->have_bare_star) {
                comp->param_pass_num_dict_params += 1;
                if (comp->param_pass == 1) {
796
                    EMIT_ARG(load_const_id, MP_PARSE_NODE_LEAF_ARG(pns->nodes[0]));
Damien's avatar
Damien committed
797
798
799
800
801
802
803
804
805
                    compile_node(comp, pns->nodes[2]);
                }
            } else {
                comp->param_pass_num_default_params += 1;
                if (comp->param_pass == 2) {
                    compile_node(comp, pns->nodes[2]);
                }
            }
        }
806
807
808
    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_star)) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
809
810
811
812
813
814
815
816
            // bare star
            comp->have_bare_star = true;
        }
    }
}

// leaves function object on stack
// returns function name
817
qstr compile_funcdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
818
819
    if (comp->pass == PASS_1) {
        // create a new scope for this function
820
        scope_t *s = scope_new_and_link(comp, SCOPE_FUNCTION, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
821
        // store the function scope so the compiling function can use it at each pass
822
        pns->nodes[4] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
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
851
852
853
854
855
856
857
858
859
860
    }

    // 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
    comp->have_bare_star = false;
    comp->param_pass = 1; // pass 1 does any default parameters after bare star
    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);
    comp->have_bare_star = false;
    comp->param_pass = 2; // pass 2 does any default parameters before bare star
    comp->param_pass_num_dict_params = 0;
    comp->param_pass_num_default_params = 0;
    apply_to_single_or_list(comp, pns->nodes[1], PN_typedargslist, compile_funcdef_param);

    // get the scope for this function
    scope_t *fscope = (scope_t*)pns->nodes[4];

    // make the function
    close_over_variables_etc(comp, fscope, comp->param_pass_num_dict_params, comp->param_pass_num_default_params);

    // restore variables
    comp->have_bare_star = old_have_bare_star;
    comp->param_pass = old_param_pass;
    comp->param_pass_num_dict_params = old_param_pass_num_dict_params;
    comp->param_pass_num_default_params = old_param_pass_num_default_params;

    // return its name (the 'f' in "def f(...):")
    return fscope->simple_name;
}

// leaves class object on stack
// returns class name
861
qstr compile_classdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
862
863
    if (comp->pass == PASS_1) {
        // create a new scope for this class
864
        scope_t *s = scope_new_and_link(comp, SCOPE_CLASS, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
865
        // store the class scope so the compiling function can use it at each pass
866
        pns->nodes[3] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
867
868
869
870
871
872
873
874
875
876
877
    }

    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
878
    EMIT_ARG(load_const_id, cscope->simple_name);
Damien's avatar
Damien committed
879
880

    // nodes[1] has parent classes, if any
881
    if (MP_PARSE_NODE_IS_NULL(pns->nodes[1])) {
Damien's avatar
Damien committed
882
        // no parent classes
883
        EMIT_ARG(call_function, 2, 0, false, false);
Damien's avatar
Damien committed
884
885
886
887
    } else {
        // have a parent class or classes
        // TODO what if we have, eg, *a or **a in the parent list?
        compile_node(comp, pns->nodes[1]);
888
        EMIT_ARG(call_function, 2 + list_len(pns->nodes[1], PN_arglist), 0, false, false);
Damien's avatar
Damien committed
889
890
891
892
893
894
    }

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

895
// returns true if it was a built-in decorator (even if the built-in had an error)
896
static bool compile_built_in_decorator(compiler_t *comp, int name_len, mp_parse_node_t *name_nodes, uint *emit_options) {
897
    if (MP_PARSE_NODE_LEAF_ARG(name_nodes[0]) != MP_QSTR_micropython) {
898
899
900
901
902
903
904
905
        return false;
    }

    if (name_len != 2) {
        printf("SyntaxError: invalid micropython decorator\n");
        return true;
    }

906
    qstr attr = MP_PARSE_NODE_LEAF_ARG(name_nodes[1]);
907
    if (attr == MP_QSTR_byte_code) {
Damien's avatar
Damien committed
908
        *emit_options = EMIT_OPT_BYTE_CODE;
909
#if MICROPY_EMIT_NATIVE
910
    } else if (attr == MP_QSTR_native) {
911
        *emit_options = EMIT_OPT_NATIVE_PYTHON;
912
    } else if (attr == MP_QSTR_viper) {
Damien's avatar
Damien committed
913
        *emit_options = EMIT_OPT_VIPER;
914
#endif
915
#if MICROPY_EMIT_INLINE_THUMB
916
    } else if (attr == MP_QSTR_asm_thumb) {
917
        *emit_options = EMIT_OPT_ASM_THUMB;
918
#endif
919
    } else {
920
        printf("SyntaxError: invalid micropython decorator '%s'\n", qstr_str(attr));
921
922
923
924
925
    }

    return true;
}

926
void compile_decorated(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
927
    // get the list of decorators
928
    mp_parse_node_t *nodes;
Damien's avatar
Damien committed
929
930
    int n = list_get(&pns->nodes[0], PN_decorators, &nodes);

931
932
933
934
935
    // 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
936
    for (int i = 0; i < n; i++) {
937
938
        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];
939
940

        // nodes[0] contains the decorator function, which is a dotted name
941
        mp_parse_node_t *name_nodes;
942
943
944
945
946
947
948
949
950
951
952
953
954
        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++) {
955
                assert(MP_PARSE_NODE_IS_ID(name_nodes[i])); // should be
956
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(name_nodes[i]));
957
958
959
            }

            // nodes[1] contains arguments to the decorator function, if any
960
            if (!MP_PARSE_NODE_IS_NULL(pns_decorator->nodes[1])) {
961
962
963
                // call the decorator function with the arguments in nodes[1]
                compile_node(comp, pns_decorator->nodes[1]);
            }
Damien's avatar
Damien committed
964
965
966
967
        }
    }

    // compile the body (funcdef or classdef) and get its name
968
    mp_parse_node_struct_t *pns_body = (mp_parse_node_struct_t*)pns->nodes[1];
Damien's avatar
Damien committed
969
    qstr body_name = 0;
970
    if (MP_PARSE_NODE_STRUCT_KIND(pns_body) == PN_funcdef) {
971
        body_name = compile_funcdef_helper(comp, pns_body, emit_options);
972
    } else if (MP_PARSE_NODE_STRUCT_KIND(pns_body) == PN_classdef) {
973
        body_name = compile_classdef_helper(comp, pns_body, emit_options);
Damien's avatar
Damien committed
974
975
976
977
978
979
    } else {
        // shouldn't happen
        assert(0);
    }

    // call each decorator
980
    for (int i = 0; i < n - num_built_in_decorators; i++) {
981
        EMIT_ARG(call_function, 1, 0, false, false);
Damien's avatar
Damien committed
982
983
984
    }

    // store func/class object into name
985
    EMIT_ARG(store_id, body_name);
Damien's avatar
Damien committed
986
987
}

988
void compile_funcdef(compiler_t *comp, mp_parse_node_struct_t *pns) {
989
    qstr fname = compile_funcdef_helper(comp, pns, comp->scope_cur->emit_options);
Damien's avatar
Damien committed
990
    // store function object into function name
991
    EMIT_ARG(store_id, fname);
Damien's avatar
Damien committed
992
993
}

994
995
void c_del_stmt(compiler_t *comp, mp_parse_node_t pn) {
    if (MP_PARSE_NODE_IS_ID(pn)) {
996
        EMIT_ARG(delete_id, MP_PARSE_NODE_LEAF_ARG(pn));
997
998
    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_power)) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
Damien's avatar
Damien committed
999
1000
1001

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

1002
1003
1004
1005
        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
1006
1007
1008
                for (int i = 0; i < n - 1; i++) {
                    compile_node(comp, pns1->nodes[i]);
                }
1009
1010
                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
1011
            }
1012
            if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_paren) {
Damien's avatar
Damien committed
1013
1014
                // SyntaxError: can't delete a function call
                assert(0);
1015
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_bracket) {
Damien's avatar
Damien committed
1016
1017
                compile_node(comp, pns1->nodes[0]);
                EMIT(delete_subscr);
1018
1019
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_period) {
                assert(MP_PARSE_NODE_IS_ID(pns1->nodes[0]));
1020
                EMIT_ARG(delete_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
1021
1022
1023
1024
1025
1026
1027
1028
1029
            } else {
                // shouldn't happen
                assert(0);
            }
        } else {
            // shouldn't happen
            assert(0);
        }

1030
        if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
Damien's avatar
Damien committed
1031
1032
1033
            // SyntaxError, cannot delete
            assert(0);
        }
1034
1035
1036
1037
    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_atom_paren)) {
        pn = ((mp_parse_node_struct_t*)pn)->nodes[0];
        if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_testlist_comp)) {
            mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
Damien's avatar
Damien committed
1038
1039
            // TODO perhaps factorise testlist_comp code with other uses of PN_testlist_comp

1040
1041
1042
            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_testlist_comp_3b) {
Damien's avatar
Damien committed
1043
                    // sequence of one item, with trailing comma
1044
                    assert(MP_PARSE_NODE_IS_NULL(pns1->nodes[0]));
Damien's avatar
Damien committed
1045
                    c_del_stmt(comp, pns->nodes[0]);
1046
                } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_testlist_comp_3c) {
Damien's avatar
Damien committed
1047
                    // sequence of many items
1048
                    int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns1);
Damien's avatar
Damien committed
1049
1050
1051
1052
                    c_del_stmt(comp, pns->nodes[0]);
                    for (int i = 0; i < n; i++) {
                        c_del_stmt(comp, pns1->nodes[i]);
                    }
1053
                } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_comp_for) {
Damien's avatar
Damien committed
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
                    // TODO not implemented; can't del comprehension?
                    assert(0);
                } else {
                    // sequence with 2 items
                    goto sequence_with_2_items;
                }
            } else {
                // sequence with 2 items
                sequence_with_2_items:
                c_del_stmt(comp, pns->nodes[0]);
                c_del_stmt(comp, pns->nodes[1]);
            }
        } else {
            // tuple with 1 element
            c_del_stmt(comp, pn);
        }
    } else {
        // not implemented
        assert(0);
    }
}

1076
void compile_del_stmt(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
1077
1078
1079
    apply_to_single_or_list(comp, pns->nodes[0], PN_exprlist, c_del_stmt);
}

1080
void compile_break_stmt(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
1081
1082
1083
    if (comp->break_label == 0) {
        printf("ERROR: cannot break from here\n");
    }
1084
    EMIT_ARG(break_loop, comp->break_label, comp->cur_except_level - comp->break_continue_except_level);
Damien's avatar
Damien committed
1085
1086
}

1087
void compile_continue_stmt(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
1088
1089
1090
    if (comp->continue_label == 0) {
        printf("ERROR: cannot continue from here\n");
    }
1091
    EMIT_ARG(continue_loop, comp->continue_label, comp->cur_except_level - comp->break_continue_except_level);
Damien's avatar
Damien committed
1092
1093
}

1094
void compile_return_stmt(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
1095
1096
1097
1098
1099
    if (comp->scope_cur->kind != SCOPE_FUNCTION) {
        printf("SyntaxError: 'return' outside function\n");
        comp->had_error = true;
        return;
    }
1100
    if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
1101
        // no argument to 'return', so return None