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

#include "misc.h"
9
#include "mpconfig.h"
10
#include "qstr.h"
Damien's avatar
Damien committed
11
12
13
#include "lexer.h"
#include "parse.h"
#include "scope.h"
14
#include "runtime0.h"
Damien's avatar
Damien committed
15
#include "emit.h"
16
#include "emitglue.h"
17
18
19
#include "obj.h"
#include "compile.h"
#include "runtime.h"
20
#include "smallint.h"
Damien's avatar
Damien committed
21
22
23

// TODO need to mangle __attr names

24
25
#define MICROPY_EMIT_NATIVE (MICROPY_EMIT_X64 || MICROPY_EMIT_THUMB)

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

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

typedef struct _compiler_t {
40
    qstr source_file;
41
42
43
44
    uint8_t is_repl;
    uint8_t pass; // holds enum type pass_kind_t
    uint8_t had_error; // try to keep compiler clean from nlr
    uint8_t func_arg_is_super; // used to compile special case of super() function call
Damien's avatar
Damien committed
45

46
    uint next_label;
47

48
49
    uint break_label;
    uint continue_label;
50
    int break_continue_except_level;
51
    uint16_t cur_except_level; // increased for SETUP_EXCEPT, SETUP_FINALLY; decreased for POP_BLOCK, POP_EXCEPT
Damien's avatar
Damien committed
52

53
    uint16_t n_arg_keyword;
54
    uint8_t star_flags;
55
56
57
58
    uint8_t have_bare_star;
    uint8_t param_pass;
    uint16_t param_pass_num_dict_params;
    uint16_t param_pass_num_default_params;
Damien's avatar
Damien committed
59
60
61
62

    scope_t *scope_head;
    scope_t *scope_cur;

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

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

70
STATIC void compile_syntax_error(compiler_t *comp, mp_parse_node_t pn, const char *msg) {
71
    // TODO store the error message to a variable in compiler_t instead of printing it
72
73
74
75
76
    if (MP_PARSE_NODE_IS_STRUCT(pn)) {
        printf("  File \"%s\", line " UINT_FMT "\n", qstr_str(comp->source_file), (machine_uint_t)((mp_parse_node_struct_t*)pn)->source_line);
    } else {
        printf("  File \"%s\"\n", qstr_str(comp->source_file));
    }
77
78
79
80
    printf("SyntaxError: %s\n", msg);
    comp->had_error = true;
}

81
82
83
84
85
86
87
88
89
90
91
92
93
STATIC const mp_map_elem_t mp_constants_table[] = {
    // Extra constants as defined by a port
    MICROPY_EXTRA_CONSTANTS
};

STATIC const mp_map_t mp_constants_map = {
    .all_keys_are_qstrs = 1,
    .table_is_fixed_array = 1,
    .used = sizeof(mp_constants_table) / sizeof(mp_map_elem_t),
    .alloc = sizeof(mp_constants_table) / sizeof(mp_map_elem_t),
    .table = (mp_map_elem_t*)mp_constants_table,
};

94
95
96
97
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
98
99
100
101
102
103

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

104
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
Damien's avatar
Damien committed
105
            case PN_shift_expr:
106
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
107
108
                    int arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    int arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
109
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_LESS)) {
110
#if MICROPY_EMIT_CPYTHON
111
                        // can overflow; enabled only to compare with CPython
112
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 << arg1);
113
#endif
114
115
                    } 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
116
117
118
119
120
121
122
123
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

            case PN_arith_expr:
124
                // overflow checking here relies on SMALL_INT being strictly smaller than machine_int_t
125
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
126
127
                    machine_int_t arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    machine_int_t arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
128
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PLUS)) {
129
                        arg0 += arg1;
130
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_MINUS)) {
131
                        arg0 -= arg1;
Damien's avatar
Damien committed
132
133
134
                    } else {
                        // shouldn't happen
                        assert(0);
135
                    }
136
137
                    if (MP_PARSE_FITS_SMALL_INT(arg0)) {
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0);
Damien's avatar
Damien committed
138
139
140
141
142
                    }
                }
                break;

            case PN_term:
143
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
144
145
                    machine_int_t arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    machine_int_t arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
146
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_STAR)) {
147
148
149
150
151
152
                        if (!mp_small_int_mul_overflow(arg0, arg1)) {
                            arg0 *= arg1;
                            if (MP_PARSE_FITS_SMALL_INT(arg0)) {
                                pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0);
                            }
                        }
153
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_SLASH)) {
Damien's avatar
Damien committed
154
                        ; // pass
155
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PERCENT)) {
156
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, mp_small_int_modulo(arg0, arg1));
157
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_SLASH)) {
158
                        if (arg1 != 0) {
159
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, mp_small_int_floor_divide(arg0, arg1));
160
                        }
Damien's avatar
Damien committed
161
162
163
164
165
166
167
168
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

            case PN_factor_2:
169
                if (MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[1])) {
170
                    machine_int_t arg = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[1]);
171
172
173
174
175
176
                    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
177
178
179
180
181
182
183
184
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

            case PN_power:
185
186
187
188
189
                if (0) {
#if MICROPY_EMIT_CPYTHON
                } else 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])) {
                    // int**x
                    // can overflow; enabled only to compare with CPython
190
191
                    mp_parse_node_struct_t* pns2 = (mp_parse_node_struct_t*)pns->nodes[2];
                    if (MP_PARSE_NODE_IS_SMALL_INT(pns2->nodes[0])) {
192
                        int power = MP_PARSE_NODE_LEAF_SMALL_INT(pns2->nodes[0]);
Damien's avatar
Damien committed
193
194
                        if (power >= 0) {
                            int ans = 1;
195
                            int base = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
Damien's avatar
Damien committed
196
197
198
                            for (; power > 0; power--) {
                                ans *= base;
                            }
199
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, ans);
Damien's avatar
Damien committed
200
201
                        }
                    }
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
#endif
                } else if (MP_PARSE_NODE_IS_ID(pns->nodes[0]) && MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[1], PN_trailer_period) && MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
                    // id.id
                    // look it up in constant table, see if it can be replaced with an integer
                    mp_parse_node_struct_t* pns1 = (mp_parse_node_struct_t*)pns->nodes[1];
                    assert(MP_PARSE_NODE_IS_ID(pns1->nodes[0]));
                    qstr q_base = MP_PARSE_NODE_LEAF_ARG(pns->nodes[0]);
                    qstr q_attr = MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]);
                    mp_map_elem_t *elem = mp_map_lookup((mp_map_t*)&mp_constants_map, MP_OBJ_NEW_QSTR(q_base), MP_MAP_LOOKUP);
                    if (elem != NULL) {
                        mp_obj_t dest[2];
                        mp_load_method_maybe(elem->value, q_attr, dest);
                        if (MP_OBJ_IS_SMALL_INT(dest[0]) && dest[1] == NULL) {
                            machine_int_t val = MP_OBJ_SMALL_INT_VALUE(dest[0]);
                            if (MP_PARSE_FITS_SMALL_INT(val)) {
                                pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, val);
                            }
                        }
                    }
Damien's avatar
Damien committed
221
222
223
224
225
226
227
228
                }
                break;
        }
    }

    return pn;
}

229
STATIC void compile_trailer_paren_helper(compiler_t *comp, mp_parse_node_t pn_arglist, bool is_method_call, int n_positional_extra);
230
STATIC void compile_node(compiler_t *comp, mp_parse_node_t pn);
Damien's avatar
Damien committed
231

232
STATIC uint comp_next_label(compiler_t *comp) {
233
234
235
    return comp->next_label++;
}

236
237
238
239
240
241
242
243
244
245
246
247
STATIC void compile_increase_except_level(compiler_t *comp) {
    comp->cur_except_level += 1;
    if (comp->cur_except_level > comp->scope_cur->exc_stack_size) {
        comp->scope_cur->exc_stack_size = comp->cur_except_level;
    }
}

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

248
STATIC scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
249
    scope_t *scope = scope_new(kind, pn, comp->source_file, mp_emit_glue_get_unique_code_id(), emit_options);
Damien's avatar
Damien committed
250
251
252
253
254
255
256
257
258
259
260
261
262
263
    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;
}

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

279
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)) {
280
281
282
    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
283
284
285
        for (int i = 0; i < num_nodes; i++) {
            f(comp, pns->nodes[i]);
        }
286
    } else if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
287
288
289
290
        f(comp, pn);
    }
}

291
STATIC int list_get(mp_parse_node_t *pn, int pn_kind, mp_parse_node_t **nodes) {
292
    if (MP_PARSE_NODE_IS_NULL(*pn)) {
Damien's avatar
Damien committed
293
294
        *nodes = NULL;
        return 0;
295
    } else if (MP_PARSE_NODE_IS_LEAF(*pn)) {
Damien's avatar
Damien committed
296
297
298
        *nodes = pn;
        return 1;
    } else {
299
300
        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
301
302
303
304
            *nodes = pn;
            return 1;
        } else {
            *nodes = pns->nodes;
305
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
306
307
308
309
        }
    }
}

310
void compile_do_nothing(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
311
312
}

313
314
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
315
316
317
318
319
    for (int i = 0; i < num_nodes; i++) {
        compile_node(comp, pns->nodes[i]);
    }
}

320
#if MICROPY_EMIT_CPYTHON
321
STATIC bool cpython_c_tuple_is_const(mp_parse_node_t pn) {
322
    if (!MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
323
324
        return false;
    }
325
    if (MP_PARSE_NODE_IS_ID(pn)) {
Damien's avatar
Damien committed
326
327
328
329
330
        return false;
    }
    return true;
}

331
STATIC void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
332
333
    uint len;
    const byte *str = qstr_data(qstr, &len);
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
    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, "'");
    }
}

371
STATIC void cpython_c_tuple_emit_const(compiler_t *comp, mp_parse_node_t pn, vstr_t *vstr) {
372
    assert(MP_PARSE_NODE_IS_LEAF(pn));
373
374
375
376
377
    if (MP_PARSE_NODE_IS_SMALL_INT(pn)) {
        vstr_printf(vstr, INT_FMT, MP_PARSE_NODE_LEAF_SMALL_INT(pn));
        return;
    }

378
379
380
381
382
383
384
385
    int arg = MP_PARSE_NODE_LEAF_ARG(pn);
    switch (MP_PARSE_NODE_LEAF_KIND(pn)) {
        case MP_PARSE_NODE_ID: assert(0);
        case MP_PARSE_NODE_INTEGER: vstr_printf(vstr, "%s", qstr_str(arg)); break;
        case MP_PARSE_NODE_DECIMAL: vstr_printf(vstr, "%s", qstr_str(arg)); break;
        case MP_PARSE_NODE_STRING: cpython_c_print_quoted_str(vstr, arg, false); break;
        case MP_PARSE_NODE_BYTES: cpython_c_print_quoted_str(vstr, arg, true); break;
        case MP_PARSE_NODE_TOKEN:
Damien's avatar
Damien committed
386
            switch (arg) {
387
388
389
                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;
390
                default: assert(0); // shouldn't happen
Damien's avatar
Damien committed
391
392
393
394
395
396
            }
            break;
        default: assert(0);
    }
}

397
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
398
399
    int n = 0;
    if (pns_list != NULL) {
400
        n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
Damien's avatar
Damien committed
401
402
403
    }
    int total = n;
    bool is_const = true;
404
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
405
        total += 1;
406
        if (!cpython_c_tuple_is_const(pn)) {
Damien's avatar
Damien committed
407
408
409
410
            is_const = false;
        }
    }
    for (int i = 0; i < n; i++) {
411
        if (!cpython_c_tuple_is_const(pns_list->nodes[i])) {
Damien's avatar
Damien committed
412
413
414
415
416
417
            is_const = false;
            break;
        }
    }
    if (total > 0 && is_const) {
        bool need_comma = false;
418
419
        vstr_t *vstr = vstr_new();
        vstr_printf(vstr, "(");
420
        if (!MP_PARSE_NODE_IS_NULL(pn)) {
421
            cpython_c_tuple_emit_const(comp, pn, vstr);
Damien's avatar
Damien committed
422
423
424
425
            need_comma = true;
        }
        for (int i = 0; i < n; i++) {
            if (need_comma) {
426
                vstr_printf(vstr, ", ");
Damien's avatar
Damien committed
427
            }
428
            cpython_c_tuple_emit_const(comp, pns_list->nodes[i], vstr);
Damien's avatar
Damien committed
429
430
431
            need_comma = true;
        }
        if (total == 1) {
432
            vstr_printf(vstr, ",)");
Damien's avatar
Damien committed
433
        } else {
434
            vstr_printf(vstr, ")");
Damien's avatar
Damien committed
435
        }
436
        EMIT_ARG(load_const_verbatim_str, vstr_str(vstr));
437
        vstr_free(vstr);
Damien's avatar
Damien committed
438
    } else {
439
        if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
440
441
442
443
444
            compile_node(comp, pn);
        }
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
445
        EMIT_ARG(build_tuple, total);
Damien's avatar
Damien committed
446
447
    }
}
448
449
450
#endif

// funnelling all tuple creations through this function is purely so we can optionally agree with CPython
451
void c_tuple(compiler_t *comp, mp_parse_node_t pn, mp_parse_node_struct_t *pns_list) {
452
#if MICROPY_EMIT_CPYTHON
453
454
455
    cpython_c_tuple(comp, pn, pns_list);
#else
    int total = 0;
456
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
457
458
459
460
        compile_node(comp, pn);
        total += 1;
    }
    if (pns_list != NULL) {
461
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
462
463
464
465
466
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
        total += n;
    }
467
    EMIT_ARG(build_tuple, total);
468
469
#endif
}
Damien's avatar
Damien committed
470

471
void compile_generic_tuple(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
472
    // a simple tuple expression
473
    c_tuple(comp, MP_PARSE_NODE_NULL, pns);
Damien's avatar
Damien committed
474
475
}

476
STATIC bool node_is_const_false(mp_parse_node_t pn) {
477
    return MP_PARSE_NODE_IS_TOKEN_KIND(pn, MP_TOKEN_KW_FALSE);
478
    // untested: || (MP_PARSE_NODE_IS_SMALL_INT(pn) && MP_PARSE_NODE_LEAF_SMALL_INT(pn) == 0);
Damien's avatar
Damien committed
479
480
}

481
STATIC bool node_is_const_true(mp_parse_node_t pn) {
482
    return MP_PARSE_NODE_IS_TOKEN_KIND(pn, MP_TOKEN_KW_TRUE) || (MP_PARSE_NODE_IS_SMALL_INT(pn) && MP_PARSE_NODE_LEAF_SMALL_INT(pn) == 1);
Damien's avatar
Damien committed
483
484
}

485
#if MICROPY_EMIT_CPYTHON
486
// the is_nested variable is purely to match with CPython, which doesn't fully optimise not's
487
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
488
489
    if (node_is_const_false(pn)) {
        if (jump_if == false) {
490
            EMIT_ARG(jump, label);
Damien's avatar
Damien committed
491
492
493
494
        }
        return;
    } else if (node_is_const_true(pn)) {
        if (jump_if == true) {
495
            EMIT_ARG(jump, label);
Damien's avatar
Damien committed
496
497
        }
        return;
498
499
500
501
    } 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
502
            if (jump_if == false) {
503
                uint label2 = comp_next_label(comp);
Damien's avatar
Damien committed
504
                for (int i = 0; i < n - 1; i++) {
505
                    cpython_c_if_cond(comp, pns->nodes[i], true, label2, true);
Damien's avatar
Damien committed
506
                }
507
                cpython_c_if_cond(comp, pns->nodes[n - 1], false, label, true);
508
                EMIT_ARG(label_assign, label2);
Damien's avatar
Damien committed
509
510
            } else {
                for (int i = 0; i < n; i++) {
511
                    cpython_c_if_cond(comp, pns->nodes[i], true, label, true);
Damien's avatar
Damien committed
512
513
514
                }
            }
            return;
515
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_and_test) {
Damien's avatar
Damien committed
516
517
            if (jump_if == false) {
                for (int i = 0; i < n; i++) {
518
                    cpython_c_if_cond(comp, pns->nodes[i], false, label, true);
Damien's avatar
Damien committed
519
520
                }
            } else {
521
                uint label2 = comp_next_label(comp);
Damien's avatar
Damien committed
522
                for (int i = 0; i < n - 1; i++) {
523
                    cpython_c_if_cond(comp, pns->nodes[i], false, label2, true);
Damien's avatar
Damien committed
524
                }
525
                cpython_c_if_cond(comp, pns->nodes[n - 1], true, label, true);
526
                EMIT_ARG(label_assign, label2);
Damien's avatar
Damien committed
527
528
            }
            return;
529
        } else if (!is_nested && MP_PARSE_NODE_STRUCT_KIND(pns) == PN_not_test_2) {
530
            cpython_c_if_cond(comp, pns->nodes[0], !jump_if, label, true);
Damien's avatar
Damien committed
531
532
533
534
535
536
537
            return;
        }
    }

    // nothing special, fall back to default compiling for node and jump
    compile_node(comp, pn);
    if (jump_if == false) {
538
        EMIT_ARG(pop_jump_if_false, label);
Damien's avatar
Damien committed
539
    } else {
540
        EMIT_ARG(pop_jump_if_true, label);
Damien's avatar
Damien committed
541
542
    }
}
543
#endif
Damien's avatar
Damien committed
544

545
STATIC void c_if_cond(compiler_t *comp, mp_parse_node_t pn, bool jump_if, int label) {
546
#if MICROPY_EMIT_CPYTHON
547
548
549
550
    cpython_c_if_cond(comp, pn, jump_if, label, false);
#else
    if (node_is_const_false(pn)) {
        if (jump_if == false) {
551
            EMIT_ARG(jump, label);
552
553
554
555
        }
        return;
    } else if (node_is_const_true(pn)) {
        if (jump_if == true) {
556
            EMIT_ARG(jump, label);
557
558
        }
        return;
559
560
561
562
    } 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) {
563
            if (jump_if == false) {
564
                uint label2 = comp_next_label(comp);
565
566
567
568
                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);
569
                EMIT_ARG(label_assign, label2);
570
571
572
573
574
575
            } else {
                for (int i = 0; i < n; i++) {
                    c_if_cond(comp, pns->nodes[i], true, label);
                }
            }
            return;
576
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_and_test) {
577
578
579
580
581
            if (jump_if == false) {
                for (int i = 0; i < n; i++) {
                    c_if_cond(comp, pns->nodes[i], false, label);
                }
            } else {
582
                uint label2 = comp_next_label(comp);
583
584
585
586
                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);
587
                EMIT_ARG(label_assign, label2);
588
589
            }
            return;
590
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_not_test_2) {
591
592
593
594
595
596
597
598
            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) {
599
        EMIT_ARG(pop_jump_if_false, label);
600
    } else {
601
        EMIT_ARG(pop_jump_if_true, label);
602
603
    }
#endif
Damien's avatar
Damien committed
604
605
606
}

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

609
void c_assign_power(compiler_t *comp, mp_parse_node_struct_t *pns, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
610
611
612
613
    if (assign_kind != ASSIGN_AUG_STORE) {
        compile_node(comp, pns->nodes[0]);
    }

614
615
616
617
    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
618
619
620
621
622
            if (assign_kind != ASSIGN_AUG_STORE) {
                for (int i = 0; i < n - 1; i++) {
                    compile_node(comp, pns1->nodes[i]);
                }
            }
623
624
            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
625
        }
626
        if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_paren) {
627
            goto cannot_assign;
628
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_bracket) {
Damien's avatar
Damien committed
629
630
631
632
633
634
635
            if (assign_kind == ASSIGN_AUG_STORE) {
                EMIT(rot_three);
                EMIT(store_subscr);
            } else {
                compile_node(comp, pns1->nodes[0]);
                if (assign_kind == ASSIGN_AUG_LOAD) {
                    EMIT(dup_top_two);
Damien George's avatar
Damien George committed
636
                    EMIT_ARG(binary_op, MP_BINARY_OP_SUBSCR);
Damien's avatar
Damien committed
637
638
639
640
                } else {
                    EMIT(store_subscr);
                }
            }
641
642
        } 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
643
644
            if (assign_kind == ASSIGN_AUG_LOAD) {
                EMIT(dup_top);
645
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
646
647
648
649
            } else {
                if (assign_kind == ASSIGN_AUG_STORE) {
                    EMIT(rot_two);
                }
650
                EMIT_ARG(store_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
651
652
            }
        } else {
653
            goto cannot_assign;
Damien's avatar
Damien committed
654
655
        }
    } else {
656
        goto cannot_assign;
Damien's avatar
Damien committed
657
658
    }

659
    if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
660
        goto cannot_assign;
Damien's avatar
Damien committed
661
    }
662
663
664
665
666

    return;

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

669
670
671
672
673
// we need to allow for a caller passing in 1 initial node (node_head) followed by an array of nodes (nodes_tail)
void c_assign_tuple(compiler_t *comp, mp_parse_node_t node_head, uint num_tail, mp_parse_node_t *nodes_tail) {
    uint num_head = (node_head == MP_PARSE_NODE_NULL) ? 0 : 1;

    // look for star expression
Damien's avatar
Damien committed
674
    int have_star_index = -1;
675
676
677
678
679
680
    if (num_head != 0 && MP_PARSE_NODE_IS_STRUCT_KIND(node_head, PN_star_expr)) {
        EMIT_ARG(unpack_ex, 0, num_tail);
        have_star_index = 0;
    }
    for (int i = 0; i < num_tail; i++) {
        if (MP_PARSE_NODE_IS_STRUCT_KIND(nodes_tail[i], PN_star_expr)) {
Damien's avatar
Damien committed
681
            if (have_star_index < 0) {
682
683
                EMIT_ARG(unpack_ex, num_head + i, num_tail - i - 1);
                have_star_index = num_head + i;
Damien's avatar
Damien committed
684
            } else {
685
                compile_syntax_error(comp, nodes_tail[i], "two starred expressions in assignment");
Damien's avatar
Damien committed
686
687
688
689
690
                return;
            }
        }
    }
    if (have_star_index < 0) {
691
        EMIT_ARG(unpack_sequence, num_head + num_tail);
Damien's avatar
Damien committed
692
    }
693
694
695
    if (num_head != 0) {
        if (0 == have_star_index) {
            c_assign(comp, ((mp_parse_node_struct_t*)node_head)->nodes[0], ASSIGN_STORE);
Damien's avatar
Damien committed
696
        } else {
697
698
699
700
701
702
703
704
            c_assign(comp, node_head, ASSIGN_STORE);
        }
    }
    for (int i = 0; i < num_tail; i++) {
        if (num_head + i == have_star_index) {
            c_assign(comp, ((mp_parse_node_struct_t*)nodes_tail[i])->nodes[0], ASSIGN_STORE);
        } else {
            c_assign(comp, nodes_tail[i], ASSIGN_STORE);
Damien's avatar
Damien committed
705
706
707
708
709
        }
    }
}

// assigns top of stack to pn
710
void c_assign(compiler_t *comp, mp_parse_node_t pn, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
711
    tail_recursion:
712
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
713
        assert(0);
714
715
716
    } 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
717
718
719
            switch (assign_kind) {
                case ASSIGN_STORE:
                case ASSIGN_AUG_STORE:
720
                    EMIT_ARG(store_id, arg);
Damien's avatar
Damien committed
721
722
                    break;
                case ASSIGN_AUG_LOAD:
723
                    EMIT_ARG(load_id, arg);
Damien's avatar
Damien committed
724
725
726
                    break;
            }
        } else {
727
            compile_syntax_error(comp, pn, "can't assign to literal");
Damien's avatar
Damien committed
728
729
730
            return;
        }
    } else {
731
732
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
Damien's avatar
Damien committed
733
734
735
736
737
738
739
740
741
742
743
            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;
                }
744
                c_assign_tuple(comp, MP_PARSE_NODE_NULL, MP_PARSE_NODE_STRUCT_NUM_NODES(pns), pns->nodes);
Damien's avatar
Damien committed
745
746
747
748
                break;

            case PN_atom_paren:
                // lhs is something in parenthesis
749
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
750
                    // empty tuple
751
                    compile_syntax_error(comp, pn, "can't assign to ()");
Damien's avatar
Damien committed
752
                    return;
753
754
                } 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
755
756
757
758
759
760
761
762
763
764
765
766
767
                    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;
                }
768
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
769
                    // empty list, assignment allowed
770
                    c_assign_tuple(comp, MP_PARSE_NODE_NULL, 0, NULL);
771
772
                } 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
773
774
775
                    goto testlist_comp;
                } else {
                    // brackets around 1 item
776
                    c_assign_tuple(comp, pns->nodes[0], 0, NULL);
Damien's avatar
Damien committed
777
778
779
780
                }
                break;

            default:
781
782
                compile_syntax_error(comp, (mp_parse_node_t)pns, "can't assign to expression");
                return;
Damien's avatar
Damien committed
783
784
785
786
787
        }
        return;

        testlist_comp:
        // lhs is a sequence
788
789
790
        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
791
                // sequence of one item, with trailing comma
792
                assert(MP_PARSE_NODE_IS_NULL(pns2->nodes[0]));
793
                c_assign_tuple(comp, pns->nodes[0], 0, NULL);
794
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns2) == PN_testlist_comp_3c) {
Damien's avatar
Damien committed
795
                // sequence of many items
796
797
                uint n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns2);
                c_assign_tuple(comp, pns->nodes[0], n, pns2->nodes);
798
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_comp_for) {
799
800
801
                // TODO can we ever get here? can it be compiled?
                compile_syntax_error(comp, (mp_parse_node_t)pns, "can't assign to expression");
                return;
Damien's avatar
Damien committed
802
803
804
805
806
807
808
            } else {
                // sequence with 2 items
                goto sequence_with_2_items;
            }
        } else {
            // sequence with 2 items
            sequence_with_2_items:
809
            c_assign_tuple(comp, MP_PARSE_NODE_NULL, 2, pns->nodes);
Damien's avatar
Damien committed
810
811
812
813
814
815
        }
        return;
    }
    return;

    bad_aug:
816
    compile_syntax_error(comp, pn, "illegal expression for augmented assignment");
Damien's avatar
Damien committed
817
818
819
}

// stuff for lambda and comprehensions and generators
820
821
822
823
// if we are not in CPython compatibility mode then:
//  if n_pos_defaults > 0 then there is a tuple on the stack with the positional defaults
//  if n_kw_defaults > 0 then there is a dictionary on the stack with the keyword defaults
//  if both exist, the tuple is above the dictionary (ie the first pop gets the tuple)
824
825
826
827
void close_over_variables_etc(compiler_t *comp, scope_t *this_scope, int n_pos_defaults, int n_kw_defaults) {
    assert(n_pos_defaults >= 0);
    assert(n_kw_defaults >= 0);

Damien's avatar
Damien committed
828
    // make closed over variables, if any
829
    // ensure they are closed over in the order defined in the outer scope (mainly to agree with CPython)
Damien's avatar
Damien committed
830
831
    int nfree = 0;
    if (comp->scope_cur->kind != SCOPE_MODULE) {
832
833
834
835
836
837
        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
838
#if MICROPY_EMIT_CPYTHON
839
                        EMIT_ARG(load_closure, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
840
841
#else
                        // in Micro Python we load closures using LOAD_FAST
842
                        EMIT_ARG(load_fast, id->qstr, id->flags, id->local_num);
Damien George's avatar
Damien George committed
843
#endif
844
845
846
                        nfree += 1;
                    }
                }
Damien's avatar
Damien committed
847
848
849
850
851
852
            }
        }
    }

    // make the function/closure
    if (nfree == 0) {
853
        EMIT_ARG(make_function, this_scope, n_pos_defaults, n_kw_defaults);
Damien's avatar
Damien committed
854
    } else {
855
        EMIT_ARG(build_tuple, nfree);
856
        EMIT_ARG(make_closure, this_scope, n_pos_defaults, n_kw_defaults);
Damien's avatar
Damien committed
857
858
859
    }
}

860
void compile_funcdef_param(compiler_t *comp, mp_parse_node_t pn) {
861
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_star)) {
862
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
        if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
            // bare star
            comp->have_bare_star = true;
        }

    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_dbl_star)) {
        // TODO do we need to do anything with this?

    } else {
        mp_parse_node_t pn_id;
        mp_parse_node_t pn_colon;
        mp_parse_node_t pn_equal;
        if (MP_PARSE_NODE_IS_ID(pn)) {
            // this parameter is just an id

            pn_id = pn;
            pn_colon = MP_PARSE_NODE_NULL;
            pn_equal = MP_PARSE_NODE_NULL;

        } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_name)) {
            // this parameter has a colon and/or equal specifier

            mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
            pn_id = pns->nodes[0];
            pn_colon = pns->nodes[1];
            pn_equal = pns->nodes[2];

        } else {
891
            // XXX what to do here?
892
893
894
895
896
897
898
899
900
            assert(0);
            return;
        }

        if (MP_PARSE_NODE_IS_NULL(pn_equal)) {
            // this parameter does not have a default value

            // check for non-default parameters given after default parameters (allowed by parser, but not syntactically valid)
            if (!comp->have_bare_star && comp->param_pass_num_default_params != 0) {
901
                compile_syntax_error(comp, pn, "non-default argument follows default argument");
902
903
904
905
                return;
            }

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

Damien's avatar
Damien committed
909
910
911
            if (comp->have_bare_star) {
                comp->param_pass_num_dict_params += 1;
                if (comp->param_pass == 1) {
912
913
914
915
916
917
918
#if !MICROPY_EMIT_CPYTHON
                    // in Micro Python we put the default dict parameters into a dictionary using the bytecode
                    if (comp->param_pass_num_dict_params == 1) {
                        // first default dict param, so make the map
                        EMIT_ARG(build_map, 0);
                    }
#endif
919
920
                    EMIT_ARG(load_const_id, MP_PARSE_NODE_LEAF_ARG(pn_id));
                    compile_node(comp, pn_equal);
921
922
923
924
#if !MICROPY_EMIT_CPYTHON
                    // in Micro Python we put the default dict parameters into a dictionary using the bytecode
                    EMIT(store_map);
#endif
Damien's avatar
Damien committed
925
926
927
928
                }
            } else {
                comp->param_pass_num_default_params += 1;
                if (comp->param_pass == 2) {
929
                    compile_node(comp, pn_equal);
Damien's avatar
Damien committed
930
931
932
                }
            }
        }
933
934
935

        // TODO pn_colon not implemented
        (void)pn_colon;
Damien's avatar
Damien committed
936
937
938
939
940
    }
}

// leaves function object on stack
// returns function name
941
qstr compile_funcdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
942
943
    if (comp->pass == PASS_1) {
        // create a new scope for this function
944
        scope_t *s = scope_new_and_link(comp, SCOPE_FUNCTION, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
945
        // store the function scope so the compiling function can use it at each pass
946
        pns->nodes[4] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
947
948
949
    }

    // save variables (probably don't need to do this, since we can't have nested definitions..?)
950
951
952
953
    uint old_have_bare_star = comp->have_bare_star;
    uint old_param_pass = comp->param_pass;
    uint old_param_pass_num_dict_params = comp->param_pass_num_dict_params;
    uint old_param_pass_num_default_params = comp->param_pass_num_default_params;
Damien's avatar
Damien committed
954
955

    // compile default parameters
956
957

    // pass 1 does any default parameters after bare star
Damien's avatar
Damien committed
958
    comp->have_bare_star = false;
959
    comp->param_pass = 1;
Damien's avatar
Damien committed
960
961
962
    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);
963
964
965
966
967
968

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

    // pass 2 does any default parameters before bare star
Damien's avatar
Damien committed
969
    comp->have_bare_star = false;
970
    comp->param_pass = 2;
Damien's avatar
Damien committed
971
972
973
974
    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);

975
976
977
978
979
980
981
#if !MICROPY_EMIT_CPYTHON
    // in Micro Python we put the default positional parameters into a tuple using the bytecode
    if (comp->param_pass_num_default_params > 0) {
        EMIT_ARG(build_tuple, comp->param_pass_num_default_params);
    }
#endif

Damien's avatar
Damien committed
982
983
984
985
    // get the scope for this function
    scope_t *fscope = (scope_t*)pns->nodes[4];

    // make the function
986
    close_over_variables_etc(comp, fscope, comp->param_pass_num_default_params, comp->param_pass_num_dict_params);
Damien's avatar
Damien committed
987
988
989
990
991
992
993
994
995
996
997
998
999

    // 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
1000
qstr compile_classdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
1001
1002
    if (comp->pass == PASS_1) {
        // create a new scope for this class
1003
        scope_t *s = scope_new_and_link(comp, SCOPE_CLASS, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
1004
        // store the class scope so the compiling function can use it at each pass
1005
        pns->nodes[3] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
    }

    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
1017
    EMIT_ARG(load_const_id, cscope->simple_name);
Damien's avatar
Damien committed
1018
1019

    // nodes[1] has parent classes, if any
1020
1021
1022
1023
1024
    // empty parenthesis (eg class C():) gets here as an empty PN_classdef_2 and needs special handling
    mp_parse_node_t parents = pns->nodes[1];
    if (MP_PARSE_NODE_IS_STRUCT_KIND(parents, PN_classdef_2)) {
        parents = MP_PARSE_NODE_NULL;
    }
1025
    comp->func_arg_is_super = false;
1026
    compile_trailer_paren_helper(comp, parents, false, 2);
Damien's avatar
Damien committed
1027
1028
1029
1030
1031

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

1032
// returns true if it was a built-in decorator (even if the built-in had an error)
1033
STATIC bool compile_built_in_decorator(compiler_t *comp, int name_len, mp_parse_node_t *name_nodes, uint *emit_options) {
1034
    if (MP_PARSE_NODE_LEAF_ARG(name_nodes[0]) != MP_QSTR_micropython) {
1035
1036
1037
1038
        return false;
    }

    if (name_len != 2) {
1039
        compile_syntax_error(comp, name_nodes[0], "invalid micropython decorator");
1040
1041
1042
        return true;
    }