compile.c 124 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

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

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

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

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

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

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

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

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

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

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

            case PN_factor_2:
151
152
153
154
155
156
157
158
                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
159
160
161
162
163
164
165
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

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

    return pn;
}

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

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

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

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

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

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

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

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

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

280
static void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
281
282
    uint len;
    const byte *str = qstr_data(qstr, &len);
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
318
319
    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, "'");
    }
}

320
321
322
323
324
325
326
327
328
329
330
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
331
            switch (arg) {
332
333
334
                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
335
336
337
338
339
340
341
                default: assert(0);
            }
            break;
        default: assert(0);
    }
}

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

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

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

421
422
423
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
424
425
}

426
427
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
428
429
}

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

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

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

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

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

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

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

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

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

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

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

        testlist_comp:
        // lhs is a sequence
718
719
720
        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
721
                // sequence of one item, with trailing comma
722
                assert(MP_PARSE_NODE_IS_NULL(pns2->nodes[0]));
Damien's avatar
Damien committed
723
                c_assign_tuple(comp, 1, &pns->nodes[0]);
724
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns2) == PN_testlist_comp_3c) {
Damien's avatar
Damien committed
725
726
                // sequence of many items
                // TODO call c_assign_tuple instead
727
                int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns2);
728
                EMIT_ARG(unpack_sequence, 1 + n);
Damien's avatar
Damien committed
729
730
731
732
                c_assign(comp, pns->nodes[0], ASSIGN_STORE);
                for (int i = 0; i < n; i++) {
                    c_assign(comp, pns2->nodes[i], ASSIGN_STORE);
                }
733
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_comp_for) {
Damien's avatar
Damien committed
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
                // 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
756
    // ensure they are closed over in the order defined in the outer scope (mainly to agree with CPython)
Damien's avatar
Damien committed
757
758
    int nfree = 0;
    if (comp->scope_cur->kind != SCOPE_MODULE) {
759
760
761
762
763
764
        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
765
#if MICROPY_EMIT_CPYTHON
766
                        EMIT_ARG(load_closure, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
767
768
#else
                        // in Micro Python we load closures using LOAD_FAST
769
                        EMIT_ARG(load_fast, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
770
#endif
771
772
773
                        nfree += 1;
                    }
                }
Damien's avatar
Damien committed
774
775
776
777
            }
        }
    }
    if (nfree > 0) {
778
        EMIT_ARG(build_tuple, nfree);
Damien's avatar
Damien committed
779
780
781
782
    }

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

789
790
791
792
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
793
794
795
796
797
            // 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) {
798
                    EMIT_ARG(load_const_id, MP_PARSE_NODE_LEAF_ARG(pns->nodes[0]));
Damien's avatar
Damien committed
799
800
801
802
803
804
805
806
807
                    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]);
                }
            }
        }
808
809
810
    } 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
811
812
813
814
815
816
817
818
            // bare star
            comp->have_bare_star = true;
        }
    }
}

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

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

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

    // nodes[1] has parent classes, if any
883
    if (MP_PARSE_NODE_IS_NULL(pns->nodes[1])) {
Damien's avatar
Damien committed
884
        // no parent classes
885
        EMIT_ARG(call_function, 2, 0, false, false);
Damien's avatar
Damien committed
886
887
888
889
    } 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]);
890
        EMIT_ARG(call_function, 2 + list_len(pns->nodes[1], PN_arglist), 0, false, false);
Damien's avatar
Damien committed
891
892
893
894
895
896
    }

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

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

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

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

    return true;
}

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

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

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

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

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

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

    // store func/class object into name
988
    EMIT_ARG(store_id, body_name);
Damien's avatar
Damien committed
989
990
}

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

997
998
void c_del_stmt(compiler_t *comp, mp_parse_node_t pn) {
    if (MP_PARSE_NODE_IS_ID(pn)) {
999
        EMIT_ARG(delete_id, MP_PARSE_NODE_LEAF_ARG(pn));
1000
1001
    } 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
1002
1003
1004

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

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

1033
        if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
Damien's avatar
Damien committed
1034
1035
1036
            // SyntaxError, cannot delete
            assert(0);
        }
1037
1038
1039
1040
    } 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
1041
1042
            // TODO perhaps factorise testlist_comp code with other uses of PN_testlist_comp

1043
1044
1045
            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
1046
                    // sequence of one item, with trailing comma
1047
                    assert(MP_PARSE_NODE_IS_NULL(pns1->nodes[0]));
Damien's avatar
Damien committed
1048
                    c_del_stmt(comp, pns->nodes[0]);
1049
                } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_testlist_comp_3c) {
Damien's avatar
Damien committed
1050
                    // sequence of many items
1051
                    int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns1);
Damien's avatar
Damien committed
1052
1053
1054
1055
                    c_del_stmt(comp, pns->nodes[0]);
                    for (int i = 0; i < n; i++) {
                        c_del_stmt(comp, pns1->nodes[i]);
                    }
1056
                } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_comp_for) {
Damien's avatar
Damien committed
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
                    // 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);
    }
}

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

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

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

1097
void compile_return_stmt(compiler_t *comp, mp_parse_node_struct_t *pns) {