compile.c 119 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"
Damien's avatar
Damien committed
10
11
12
13
#include "lexer.h"
#include "parse.h"
#include "scope.h"
#include "compile.h"
14
#include "runtime0.h"
Damien's avatar
Damien committed
15
16
17
18
#include "emit.h"

// TODO need to mangle __attr names

19
20
#define MICROPY_EMIT_NATIVE (MICROPY_EMIT_X64 || MICROPY_EMIT_THUMB)

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

29
#define EMIT(fun, arg...) (comp->emit_method_table->fun(comp->emit, ##arg))
30
#define EMIT_INLINE_ASM(fun, arg...) (comp->emit_inline_asm_method_table->fun(comp->emit_inline_asm, ##arg))
Damien's avatar
Damien committed
31

32
33
34
#define EMIT_OPT_NONE           (0)
#define EMIT_OPT_BYTE_CODE      (1)
#define EMIT_OPT_NATIVE_PYTHON  (2)
Damien's avatar
Damien committed
35
36
#define EMIT_OPT_VIPER          (3)
#define EMIT_OPT_ASM_THUMB      (4)
37

Damien's avatar
Damien committed
38
39
40
41
42
43
44
45
typedef struct _compiler_t {
    qstr qstr___class__;
    qstr qstr___locals__;
    qstr qstr___name__;
    qstr qstr___module__;
    qstr qstr___qualname__;
    qstr qstr___doc__;
    qstr qstr_assertion_error;
46
    qstr qstr_micropython;
Damien's avatar
Damien committed
47
    qstr qstr_byte_code;
48
    qstr qstr_native;
Damien's avatar
Damien committed
49
    qstr qstr_viper;
50
    qstr qstr_asm_thumb;
51
    qstr qstr_range;
Damien's avatar
Damien committed
52

Damien's avatar
Damien committed
53
    bool is_repl;
Damien's avatar
Damien committed
54
    pass_kind_t pass;
Damien's avatar
Damien committed
55
    bool had_error; // try to keep compiler clean from nlr
Damien's avatar
Damien committed
56

57
58
    int next_label;

Damien's avatar
Damien committed
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
    int break_label;
    int continue_label;
    int except_nest_level;

    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;

74
75
    emit_t *emit;                                   // current emitter
    const emit_method_table_t *emit_method_table;   // current emit method table
76
77
78

    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
79
80
} compiler_t;

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

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

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

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

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

            case PN_factor_2:
156
157
158
159
160
161
162
163
                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
164
165
166
167
168
169
170
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

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

    return pn;
}

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

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

202
static scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
Damien's avatar
Damien committed
203
    scope_t *scope = scope_new(kind, pn, rt_get_unique_code_id(kind == SCOPE_MODULE), emit_options);
Damien's avatar
Damien committed
204
205
206
207
208
209
210
211
212
213
214
215
216
217
    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;
}

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

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

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

264
void compile_do_nothing(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
265
266
}

267
268
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
269
270
271
272
273
    for (int i = 0; i < num_nodes; i++) {
        compile_node(comp, pns->nodes[i]);
    }
}

274
#if MICROPY_EMIT_CPYTHON
275
276
static bool cpython_c_tuple_is_const(mp_parse_node_t pn) {
    if (!MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
277
278
        return false;
    }
279
    if (MP_PARSE_NODE_IS_ID(pn)) {
Damien's avatar
Damien committed
280
281
282
283
284
        return false;
    }
    return true;
}

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
320
321
322
323
324
static void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
    const char *str = qstr_str(qstr);
    int len = strlen(str);
    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, "'");
    }
}

325
326
327
328
329
330
331
332
333
334
335
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
336
            switch (arg) {
337
338
339
                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
340
341
342
343
344
345
346
                default: assert(0);
            }
            break;
        default: assert(0);
    }
}

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

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

421
void compile_generic_tuple(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
422
    // a simple tuple expression
423
    c_tuple(comp, MP_PARSE_NODE_NULL, pns);
Damien's avatar
Damien committed
424
425
}

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

431
432
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
433
434
}

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

    // nothing special, fall back to default compiling for node and jump
    compile_node(comp, pn);
    if (jump_if == false) {
        EMIT(pop_jump_if_false, label);
    } else {
        EMIT(pop_jump_if_true, label);
    }
}
493
#endif
Damien's avatar
Damien committed
494

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

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

559
void c_assign_power(compiler_t *comp, mp_parse_node_struct_t *pns, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
560
561
562
563
    if (assign_kind != ASSIGN_AUG_STORE) {
        compile_node(comp, pns->nodes[0]);
    }

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

612
    if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
Damien's avatar
Damien committed
613
614
615
616
617
        // SyntaxError, cannot assign
        assert(0);
    }
}

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

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

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

            default:
716
                printf("unknown assign, %u\n", (uint)MP_PARSE_NODE_STRUCT_KIND(pns));
Damien's avatar
Damien committed
717
718
719
720
721
722
                assert(0);
        }
        return;

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

    // make the function/closure
    if (nfree == 0) {
        EMIT(make_function, this_scope, n_dict_params, n_default_params);
    } else {
        EMIT(make_closure, this_scope, n_dict_params, n_default_params);
    }
}

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(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
880
881
882
    }

    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
    EMIT(load_const_id, cscope->simple_name);

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

    // 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
899
static bool compile_built_in_decorator(compiler_t *comp, int name_len, mp_parse_node_t *name_nodes, uint *emit_options) {
    if (MP_PARSE_NODE_LEAF_ARG(name_nodes[0]) != comp->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]);
Damien's avatar
Damien committed
909
910
    if (attr == comp->qstr_byte_code) {
        *emit_options = EMIT_OPT_BYTE_CODE;
911
912
#if MICROPY_EMIT_NATIVE
    } else if (attr == comp->qstr_native) {
913
        *emit_options = EMIT_OPT_NATIVE_PYTHON;
Damien's avatar
Damien committed
914
915
    } else if (attr == comp->qstr_viper) {
        *emit_options = EMIT_OPT_VIPER;
916
#endif
917
#if MICROPY_EMIT_INLINE_THUMB
918
919
    } else if (attr == comp->qstr_asm_thumb) {
        *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
958
                assert(MP_PARSE_NODE_IS_ID(name_nodes[i])); // should be
                EMIT(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
964
965
                // call the decorator function with the arguments in nodes[1]
                compile_node(comp, pns_decorator->nodes[1]);
            }
Damien's avatar
Damien committed
966
967
968
969
        }
    }

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

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

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

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

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

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

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

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

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

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

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

1089
void compile_continue_stmt(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
    if (comp->continue_label == 0) {
        printf("ERROR: cannot continue from here\n");
    }
    if (comp->except_nest_level > 0) {
        EMIT(continue_loop, comp->continue_label);
    } else {
        EMIT(jump, comp->continue_label);
    }
}

1100
void compile_return_stmt(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
1101
1102
1103
1104
1105
    if (comp->scope_cur->kind != SCOPE_FUNCTION) {
        printf("SyntaxError: 'return' outside function\n");
        comp->had_error = true;
        return;
    }
1106
    if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
1107
        // no argument to 'return', so return None
1108
1109
        EMIT(load_const_tok, MP_TOKEN_KW_NONE);
    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[0], PN_test_if_expr)) {
Damien's avatar
Damien committed
1110
        // special case when returning an if-expression; to match CPython optimisation
1111
1112
        mp_parse_node_struct_t *pns_test_if_expr = (mp_parse_node_struct_t*)pns->nodes[0];
        mp_parse_node_struct_t *pns_test_if_else = (mp_parse_node_struct_t*)pns_test_if_expr->nodes[1];
Damien's avatar
Damien committed
1113

1114
        int l_fail = comp_next_label(comp);
Damien's avatar
Damien committed
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
        c_if_cond(comp, pns_test_if_else->nodes[0], false, l_fail); // condition
        compile_node(comp, pns_test_if_expr->nodes[0]); // success value
        EMIT(return_value);
        EMIT(label_assign, l_fail);
        compile_node(comp, pns_test_if_else->nodes[1]); // failure value
    } else {
        compile_node(comp, pns->nodes[0]);
    }
    EMIT(return_value);
}

1126
void compile_yield_stmt(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
1127
1128
1129
1130
    compile_node(comp, pns->nodes[0]);
    EMIT(pop_top);
}

1131
1132
void compile_raise_stmt(compiler_t *comp, mp_parse_node_struct_t *pns) {
    if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
1133
1134
        // raise
        EMIT(raise_varargs, 0);
1135
    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[0], PN_raise_stmt_arg)) {
Damien's avatar
Damien committed
1136
        // raise x from y
1137
        pns = (mp_parse_node_struct_t*)pns->nodes[0];
Damien's avatar
Damien committed
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
        compile_node(comp, pns->nodes[0]);
        compile_node(comp, pns->nodes[1]);
        EMIT(raise_varargs, 2);
    } else {
        // raise x
        compile_node(comp, pns->nodes[0]);
        EMIT(raise_varargs, 1);
    }
}

// q1 holds the base, q2 the full name
// eg   a -> q1=q2=a
//      a.b.c -> q1=a, q2=a.b.c
1151
void do_import_name(compiler_t *comp, mp_parse_node_t pn, qstr *q1, qstr *q2) {
Damien's avatar
Damien committed
1152
    bool is_as = false;
1153
1154
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_dotted_as_name)) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
Damien's avatar
Damien committed
1155
        // a name of the form x as y; unwrap it
1156
        *q1 = MP_PARSE_NODE_LEAF_ARG(pns->nodes[1]);
Damien's avatar
Damien committed
1157
1158
1159
        pn = pns->nodes[0];
        is_as = true;
    }
1160
    if (MP_PARSE_NODE_IS_ID(pn)) {
Damien's avatar
Damien committed
1161
        // just a simple name
1162
        *q2 = MP_PARSE_NODE_LEAF_ARG(pn);
Damien's avatar
Damien committed
1163
1164
1165
1166
        if (!is_as) {
            *q1 = *q2;
        }
        EMIT(import_name, *q2);
1167
1168
1169
    } else if (MP_PARSE_NODE_IS_STRUCT(pn)) {
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_dotted_name) {
Damien's avatar
Damien committed
1170
1171
            // a name of the form a.b.c
            if (!is_as) {
1172
                *q1 = MP_PARSE_NODE_LEAF_ARG(pns->nodes[0]);
Damien's avatar
Damien committed
1173
            }
1174
            int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
1175
1176
            int len = n - 1;
            for (int i = 0; i < n; i++) {
1177
                len += strlen(qstr_str(MP_PARSE_NODE_LEAF_ARG(pns->nodes[i])));
Damien's avatar
Damien committed
1178
1179
1180
1181
1182
1183
1184
            }
            char *str = m_new(char, len + 1);
            str[0] = 0;
            for (int i = 0; i < n; i++) {
                if (i > 0) {
                    strcat(str, ".");
                }
1185
                strcat(str, qstr_str(MP_PARSE_NODE_LEAF_ARG(pns->nodes[i])));
Damien's avatar
Damien committed
1186
            }
1187
            *q2 = qstr_from_str_take(str, len + 1);
Damien's avatar
Damien committed
1188
1189
1190
            EMIT(import_name, *q2);
            if (is_as) {
                for (int i = 1; i < n; i++) {
1191
                    EMIT(load_attr, MP_PARSE_NODE_LEAF_ARG(pns->nodes[i]));
Damien's avatar
Damien committed
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
                }
            }
        } else {
            // TODO not implemented
            assert(0);
        }
    } else {
        // TODO not implemented
        assert(0);
    }
}

1204
void compile_dotted_as_name(compiler_t *comp, mp_parse_node_t pn) {
Damien's avatar
Damien committed
1205
    EMIT(load_const_small_int, 0); // ??
1206
    EMIT(load_const_tok, MP_TOKEN_KW_NONE);