compile.c 137 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
#include "lexer.h"
#include "parse.h"
13
#include "runtime0.h"
14
#include "obj.h"
15
16
17
#include "emitglue.h"
#include "scope.h"
#include "emit.h"
18
19
#include "compile.h"
#include "runtime.h"
20
#include "builtin.h"
21
#include "smallint.h"
Damien's avatar
Damien committed
22
23
24

// TODO need to mangle __attr names

25
26
#define MICROPY_EMIT_NATIVE (MICROPY_EMIT_X64 || MICROPY_EMIT_THUMB)

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

35
36
37
38
#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
39
40

typedef struct _compiler_t {
41
    qstr source_file;
42
43
44
45
    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
46

47
    uint next_label;
48

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

54
    uint8_t have_star;
55
56
    uint16_t num_dict_params;
    uint16_t num_default_params;
Damien's avatar
Damien committed
57
58
59
60

    scope_t *scope_head;
    scope_t *scope_cur;

61
62
    emit_t *emit;                                   // current emitter
    const emit_method_table_t *emit_method_table;   // current emit method table
63
64
65

    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
66
67
} compiler_t;

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

79
80
81
82
83
84
85
86
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,
87
88
    .used = ARRAY_SIZE(mp_constants_table),
    .alloc = ARRAY_SIZE(mp_constants_table),
89
90
91
    .table = (mp_map_elem_t*)mp_constants_table,
};

92
STATIC mp_parse_node_t fold_constants(mp_parse_node_t pn) {
93
94
95
    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
96
97
98
99
100
101

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

102
        // now try to fold this parse node
103
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
            case PN_atom_paren:
                if (n == 1 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0])) {
                    // (int)
                    pn = pns->nodes[0];
                }
                break;

            case PN_expr:
                if (n == 2 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[1])) {
                    // int | int
                    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[1]);
                    pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 | arg1);
                }
                break;

            case PN_and_expr:
                if (n == 2 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[1])) {
                    // int & int
                    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[1]);
                    pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 & arg1);
                }
                break;

Damien's avatar
Damien committed
129
            case PN_shift_expr:
130
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
131
132
                    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]);
133
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_LESS)) {
134
135
136
137
                        // int << int
                        if (!(arg1 >= BITS_PER_WORD || arg0 > (MP_SMALL_INT_MAX >> arg1) || arg0 < (MP_SMALL_INT_MIN >> arg1))) {
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 << arg1);
                        }
138
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_MORE)) {
139
                        // int >> int
140
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 >> arg1);
Damien's avatar
Damien committed
141
142
143
144
145
146
147
148
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

            case PN_arith_expr:
149
                // overflow checking here relies on SMALL_INT being strictly smaller than machine_int_t
150
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
151
152
                    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]);
153
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PLUS)) {
154
                        // int + int
155
                        arg0 += arg1;
156
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_MINUS)) {
157
                        // int - int
158
                        arg0 -= arg1;
Damien's avatar
Damien committed
159
160
161
                    } else {
                        // shouldn't happen
                        assert(0);
162
                    }
163
                    if (MP_PARSE_FITS_SMALL_INT(arg0)) {
164
                        //printf("%ld + %ld\n", arg0, arg1);
165
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0);
Damien's avatar
Damien committed
166
167
168
169
170
                    }
                }
                break;

            case PN_term:
171
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
172
173
                    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]);
174
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_STAR)) {
175
                        // int * int
176
177
178
179
180
181
                        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);
                            }
                        }
182
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_SLASH)) {
183
184
                        // int / int
                        // pass
185
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PERCENT)) {
186
                        // int%int
187
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, mp_small_int_modulo(arg0, arg1));
188
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_SLASH)) {
189
                        if (arg1 != 0) {
190
                            // int // int
191
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, mp_small_int_floor_divide(arg0, arg1));
192
                        }
Damien's avatar
Damien committed
193
194
195
196
197
198
199
200
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

            case PN_factor_2:
201
                if (MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[1])) {
202
                    machine_int_t arg = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[1]);
203
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[0], MP_TOKEN_OP_PLUS)) {
204
                        // +int
205
206
                        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)) {
207
                        // -int
208
209
                        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)) {
210
                        // ~int
211
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, ~arg);
Damien's avatar
Damien committed
212
213
214
215
216
217
218
219
                    } else {
                        // shouldn't happen
                        assert(0);
                    }
                }
                break;

            case PN_power:
220
221
222
                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])) {
223
                    // int ** x
224
                    // can overflow; enabled only to compare with CPython
225
226
                    mp_parse_node_struct_t* pns2 = (mp_parse_node_struct_t*)pns->nodes[2];
                    if (MP_PARSE_NODE_IS_SMALL_INT(pns2->nodes[0])) {
227
                        int power = MP_PARSE_NODE_LEAF_SMALL_INT(pns2->nodes[0]);
Damien's avatar
Damien committed
228
229
                        if (power >= 0) {
                            int ans = 1;
230
                            int base = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
Damien's avatar
Damien committed
231
232
233
                            for (; power > 0; power--) {
                                ans *= base;
                            }
234
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, ans);
Damien's avatar
Damien committed
235
236
                        }
                    }
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
#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
256
257
258
259
260
261
262
263
                }
                break;
        }
    }

    return pn;
}

264
STATIC void compile_trailer_paren_helper(compiler_t *comp, mp_parse_node_t pn_arglist, bool is_method_call, int n_positional_extra);
265
void compile_comprehension(compiler_t *comp, mp_parse_node_struct_t *pns, scope_kind_t kind);
266
STATIC void compile_node(compiler_t *comp, mp_parse_node_t pn);
Damien's avatar
Damien committed
267

268
STATIC uint comp_next_label(compiler_t *comp) {
269
270
271
    return comp->next_label++;
}

272
273
274
275
276
277
278
279
280
281
282
283
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;
}

284
STATIC scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
285
    scope_t *scope = scope_new(kind, pn, comp->source_file, emit_options);
Damien's avatar
Damien committed
286
287
288
289
290
291
292
293
294
295
296
297
298
299
    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;
}

300
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)) {
301
302
303
    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
304
305
306
        for (int i = 0; i < num_nodes; i++) {
            f(comp, pns->nodes[i]);
        }
307
    } else if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
308
309
310
311
        f(comp, pn);
    }
}

312
STATIC int list_get(mp_parse_node_t *pn, int pn_kind, mp_parse_node_t **nodes) {
313
    if (MP_PARSE_NODE_IS_NULL(*pn)) {
Damien's avatar
Damien committed
314
315
        *nodes = NULL;
        return 0;
316
    } else if (MP_PARSE_NODE_IS_LEAF(*pn)) {
Damien's avatar
Damien committed
317
318
319
        *nodes = pn;
        return 1;
    } else {
320
321
        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
322
323
324
325
            *nodes = pn;
            return 1;
        } else {
            *nodes = pns->nodes;
326
            return MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
327
328
329
330
        }
    }
}

331
void compile_do_nothing(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
332
333
}

334
335
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
336
337
338
339
340
    for (int i = 0; i < num_nodes; i++) {
        compile_node(comp, pns->nodes[i]);
    }
}

341
#if MICROPY_EMIT_CPYTHON
342
STATIC bool cpython_c_tuple_is_const(mp_parse_node_t pn) {
343
    if (!MP_PARSE_NODE_IS_LEAF(pn)) {
Damien's avatar
Damien committed
344
345
        return false;
    }
346
    if (MP_PARSE_NODE_IS_ID(pn)) {
Damien's avatar
Damien committed
347
348
349
350
351
        return false;
    }
    return true;
}

352
STATIC void cpython_c_print_quoted_str(vstr_t *vstr, qstr qstr, bool bytes) {
353
354
    uint len;
    const byte *str = qstr_data(qstr, &len);
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
    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, "'");
    }
}

392
STATIC void cpython_c_tuple_emit_const(compiler_t *comp, mp_parse_node_t pn, vstr_t *vstr) {
393
    assert(MP_PARSE_NODE_IS_LEAF(pn));
394
395
396
397
398
    if (MP_PARSE_NODE_IS_SMALL_INT(pn)) {
        vstr_printf(vstr, INT_FMT, MP_PARSE_NODE_LEAF_SMALL_INT(pn));
        return;
    }

399
400
401
402
403
404
405
406
    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
407
            switch (arg) {
408
409
410
                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;
411
                default: assert(0); // shouldn't happen
Damien's avatar
Damien committed
412
413
414
415
416
417
            }
            break;
        default: assert(0);
    }
}

418
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
419
420
    int n = 0;
    if (pns_list != NULL) {
421
        n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
Damien's avatar
Damien committed
422
423
424
    }
    int total = n;
    bool is_const = true;
425
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
426
        total += 1;
427
        if (!cpython_c_tuple_is_const(pn)) {
Damien's avatar
Damien committed
428
429
430
431
            is_const = false;
        }
    }
    for (int i = 0; i < n; i++) {
432
        if (!cpython_c_tuple_is_const(pns_list->nodes[i])) {
Damien's avatar
Damien committed
433
434
435
436
437
438
            is_const = false;
            break;
        }
    }
    if (total > 0 && is_const) {
        bool need_comma = false;
439
440
        vstr_t *vstr = vstr_new();
        vstr_printf(vstr, "(");
441
        if (!MP_PARSE_NODE_IS_NULL(pn)) {
442
            cpython_c_tuple_emit_const(comp, pn, vstr);
Damien's avatar
Damien committed
443
444
445
446
            need_comma = true;
        }
        for (int i = 0; i < n; i++) {
            if (need_comma) {
447
                vstr_printf(vstr, ", ");
Damien's avatar
Damien committed
448
            }
449
            cpython_c_tuple_emit_const(comp, pns_list->nodes[i], vstr);
Damien's avatar
Damien committed
450
451
452
            need_comma = true;
        }
        if (total == 1) {
453
            vstr_printf(vstr, ",)");
Damien's avatar
Damien committed
454
        } else {
455
            vstr_printf(vstr, ")");
Damien's avatar
Damien committed
456
        }
457
        EMIT_ARG(load_const_verbatim_str, vstr_str(vstr));
458
        vstr_free(vstr);
Damien's avatar
Damien committed
459
    } else {
460
        if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
461
462
463
464
465
            compile_node(comp, pn);
        }
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
466
        EMIT_ARG(build_tuple, total);
Damien's avatar
Damien committed
467
468
    }
}
469
470
471
#endif

// funnelling all tuple creations through this function is purely so we can optionally agree with CPython
472
STATIC void c_tuple(compiler_t *comp, mp_parse_node_t pn, mp_parse_node_struct_t *pns_list) {
473
#if MICROPY_EMIT_CPYTHON
474
475
476
    cpython_c_tuple(comp, pn, pns_list);
#else
    int total = 0;
477
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
478
479
480
481
        compile_node(comp, pn);
        total += 1;
    }
    if (pns_list != NULL) {
482
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
483
484
485
486
487
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
        total += n;
    }
488
    EMIT_ARG(build_tuple, total);
489
490
#endif
}
Damien's avatar
Damien committed
491

492
void compile_generic_tuple(compiler_t *comp, mp_parse_node_struct_t *pns) {
Damien's avatar
Damien committed
493
    // a simple tuple expression
494
    c_tuple(comp, MP_PARSE_NODE_NULL, pns);
Damien's avatar
Damien committed
495
496
}

497
STATIC bool node_is_const_false(mp_parse_node_t pn) {
498
    return MP_PARSE_NODE_IS_TOKEN_KIND(pn, MP_TOKEN_KW_FALSE);
499
    // untested: || (MP_PARSE_NODE_IS_SMALL_INT(pn) && MP_PARSE_NODE_LEAF_SMALL_INT(pn) == 0);
Damien's avatar
Damien committed
500
501
}

502
STATIC bool node_is_const_true(mp_parse_node_t pn) {
503
    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
504
505
}

506
#if MICROPY_EMIT_CPYTHON
507
// the is_nested variable is purely to match with CPython, which doesn't fully optimise not's
508
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
509
510
    if (node_is_const_false(pn)) {
        if (jump_if == false) {
511
            EMIT_ARG(jump, label);
Damien's avatar
Damien committed
512
513
514
515
        }
        return;
    } else if (node_is_const_true(pn)) {
        if (jump_if == true) {
516
            EMIT_ARG(jump, label);
Damien's avatar
Damien committed
517
518
        }
        return;
519
520
521
522
    } 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
523
            if (jump_if == false) {
524
                uint label2 = comp_next_label(comp);
Damien's avatar
Damien committed
525
                for (int i = 0; i < n - 1; i++) {
526
                    cpython_c_if_cond(comp, pns->nodes[i], true, label2, true);
Damien's avatar
Damien committed
527
                }
528
                cpython_c_if_cond(comp, pns->nodes[n - 1], false, label, true);
529
                EMIT_ARG(label_assign, label2);
Damien's avatar
Damien committed
530
531
            } else {
                for (int i = 0; i < n; i++) {
532
                    cpython_c_if_cond(comp, pns->nodes[i], true, label, true);
Damien's avatar
Damien committed
533
534
535
                }
            }
            return;
536
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_and_test) {
Damien's avatar
Damien committed
537
538
            if (jump_if == false) {
                for (int i = 0; i < n; i++) {
539
                    cpython_c_if_cond(comp, pns->nodes[i], false, label, true);
Damien's avatar
Damien committed
540
541
                }
            } else {
542
                uint label2 = comp_next_label(comp);
Damien's avatar
Damien committed
543
                for (int i = 0; i < n - 1; i++) {
544
                    cpython_c_if_cond(comp, pns->nodes[i], false, label2, true);
Damien's avatar
Damien committed
545
                }
546
                cpython_c_if_cond(comp, pns->nodes[n - 1], true, label, true);
547
                EMIT_ARG(label_assign, label2);
Damien's avatar
Damien committed
548
549
            }
            return;
550
        } else if (!is_nested && MP_PARSE_NODE_STRUCT_KIND(pns) == PN_not_test_2) {
551
            cpython_c_if_cond(comp, pns->nodes[0], !jump_if, label, true);
Damien's avatar
Damien committed
552
553
554
555
556
557
558
            return;
        }
    }

    // nothing special, fall back to default compiling for node and jump
    compile_node(comp, pn);
    if (jump_if == false) {
559
        EMIT_ARG(pop_jump_if_false, label);
Damien's avatar
Damien committed
560
    } else {
561
        EMIT_ARG(pop_jump_if_true, label);
Damien's avatar
Damien committed
562
563
    }
}
564
#endif
Damien's avatar
Damien committed
565

566
STATIC void c_if_cond(compiler_t *comp, mp_parse_node_t pn, bool jump_if, int label) {
567
#if MICROPY_EMIT_CPYTHON
568
569
570
571
    cpython_c_if_cond(comp, pn, jump_if, label, false);
#else
    if (node_is_const_false(pn)) {
        if (jump_if == false) {
572
            EMIT_ARG(jump, label);
573
574
575
576
        }
        return;
    } else if (node_is_const_true(pn)) {
        if (jump_if == true) {
577
            EMIT_ARG(jump, label);
578
579
        }
        return;
580
581
582
583
    } 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) {
584
            if (jump_if == false) {
585
                uint label2 = comp_next_label(comp);
586
587
588
589
                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);
590
                EMIT_ARG(label_assign, label2);
591
592
593
594
595
596
            } else {
                for (int i = 0; i < n; i++) {
                    c_if_cond(comp, pns->nodes[i], true, label);
                }
            }
            return;
597
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_and_test) {
598
599
600
601
602
            if (jump_if == false) {
                for (int i = 0; i < n; i++) {
                    c_if_cond(comp, pns->nodes[i], false, label);
                }
            } else {
603
                uint label2 = comp_next_label(comp);
604
605
606
607
                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);
608
                EMIT_ARG(label_assign, label2);
609
610
            }
            return;
611
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_not_test_2) {
612
613
614
615
616
617
618
619
            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) {
620
        EMIT_ARG(pop_jump_if_false, label);
621
    } else {
622
        EMIT_ARG(pop_jump_if_true, label);
623
624
    }
#endif
Damien's avatar
Damien committed
625
626
627
}

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

630
void c_assign_power(compiler_t *comp, mp_parse_node_struct_t *pns, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
631
632
633
634
    if (assign_kind != ASSIGN_AUG_STORE) {
        compile_node(comp, pns->nodes[0]);
    }

635
636
637
638
    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
639
640
641
642
643
            if (assign_kind != ASSIGN_AUG_STORE) {
                for (int i = 0; i < n - 1; i++) {
                    compile_node(comp, pns1->nodes[i]);
                }
            }
644
645
            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
646
        }
647
        if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_paren) {
648
            goto cannot_assign;
649
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_bracket) {
Damien's avatar
Damien committed
650
651
652
653
654
655
656
            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);
657
                    EMIT(load_subscr);
Damien's avatar
Damien committed
658
659
660
661
                } else {
                    EMIT(store_subscr);
                }
            }
662
663
        } 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
664
665
            if (assign_kind == ASSIGN_AUG_LOAD) {
                EMIT(dup_top);
666
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
667
668
669
670
            } else {
                if (assign_kind == ASSIGN_AUG_STORE) {
                    EMIT(rot_two);
                }
671
                EMIT_ARG(store_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
672
673
            }
        } else {
674
            goto cannot_assign;
Damien's avatar
Damien committed
675
676
        }
    } else {
677
        goto cannot_assign;
Damien's avatar
Damien committed
678
679
    }

680
    if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
681
        goto cannot_assign;
Damien's avatar
Damien committed
682
    }
683
684
685
686
687

    return;

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

690
691
692
693
694
// 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
695
    int have_star_index = -1;
696
697
698
699
700
701
    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
702
            if (have_star_index < 0) {
703
704
                EMIT_ARG(unpack_ex, num_head + i, num_tail - i - 1);
                have_star_index = num_head + i;
Damien's avatar
Damien committed
705
            } else {
706
                compile_syntax_error(comp, nodes_tail[i], "two starred expressions in assignment");
Damien's avatar
Damien committed
707
708
709
710
711
                return;
            }
        }
    }
    if (have_star_index < 0) {
712
        EMIT_ARG(unpack_sequence, num_head + num_tail);
Damien's avatar
Damien committed
713
    }
714
715
716
    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
717
        } else {
718
719
720
721
722
723
724
725
            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
726
727
728
729
730
        }
    }
}

// assigns top of stack to pn
731
void c_assign(compiler_t *comp, mp_parse_node_t pn, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
732
    tail_recursion:
733
    if (MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
734
        assert(0);
735
736
737
    } 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
738
739
740
            switch (assign_kind) {
                case ASSIGN_STORE:
                case ASSIGN_AUG_STORE:
741
                    EMIT_ARG(store_id, arg);
Damien's avatar
Damien committed
742
743
                    break;
                case ASSIGN_AUG_LOAD:
744
                    EMIT_ARG(load_id, arg);
Damien's avatar
Damien committed
745
746
747
                    break;
            }
        } else {
748
            compile_syntax_error(comp, pn, "can't assign to literal");
Damien's avatar
Damien committed
749
750
751
            return;
        }
    } else {
752
753
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
Damien's avatar
Damien committed
754
755
756
757
758
759
760
761
762
763
764
            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;
                }
765
                c_assign_tuple(comp, MP_PARSE_NODE_NULL, MP_PARSE_NODE_STRUCT_NUM_NODES(pns), pns->nodes);
Damien's avatar
Damien committed
766
767
768
769
                break;

            case PN_atom_paren:
                // lhs is something in parenthesis
770
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
771
                    // empty tuple
772
                    compile_syntax_error(comp, pn, "can't assign to ()");
Damien's avatar
Damien committed
773
                    return;
774
775
                } 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
776
777
778
779
780
781
782
783
784
785
786
787
788
                    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;
                }
789
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
790
                    // empty list, assignment allowed
791
                    c_assign_tuple(comp, MP_PARSE_NODE_NULL, 0, NULL);
792
793
                } 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
794
795
796
                    goto testlist_comp;
                } else {
                    // brackets around 1 item
797
                    c_assign_tuple(comp, pns->nodes[0], 0, NULL);
Damien's avatar
Damien committed
798
799
800
801
                }
                break;

            default:
802
803
                compile_syntax_error(comp, (mp_parse_node_t)pns, "can't assign to expression");
                return;
Damien's avatar
Damien committed
804
805
806
807
808
        }
        return;

        testlist_comp:
        // lhs is a sequence
809
810
811
        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
812
                // sequence of one item, with trailing comma
813
                assert(MP_PARSE_NODE_IS_NULL(pns2->nodes[0]));
814
                c_assign_tuple(comp, pns->nodes[0], 0, NULL);
815
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns2) == PN_testlist_comp_3c) {
Damien's avatar
Damien committed
816
                // sequence of many items
817
818
                uint n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns2);
                c_assign_tuple(comp, pns->nodes[0], n, pns2->nodes);
819
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_comp_for) {
820
821
822
                // 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
823
824
825
826
827
828
829
            } else {
                // sequence with 2 items
                goto sequence_with_2_items;
            }
        } else {
            // sequence with 2 items
            sequence_with_2_items:
830
            c_assign_tuple(comp, MP_PARSE_NODE_NULL, 2, pns->nodes);
Damien's avatar
Damien committed
831
832
833
834
835
836
        }
        return;
    }
    return;

    bad_aug:
837
    compile_syntax_error(comp, pn, "illegal expression for augmented assignment");
Damien's avatar
Damien committed
838
839
840
}

// stuff for lambda and comprehensions and generators
841
842
843
844
// 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)
845
846
847
848
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
849
    // make closed over variables, if any
850
    // ensure they are closed over in the order defined in the outer scope (mainly to agree with CPython)
Damien's avatar
Damien committed
851
852
    int nfree = 0;
    if (comp->scope_cur->kind != SCOPE_MODULE) {
853
854
855
856
857
858
        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
859
#if MICROPY_EMIT_CPYTHON
860
                        EMIT_ARG(load_closure, id->qstr, id->local_num);
Damien George's avatar
Damien George committed
861
862
#else
                        // in Micro Python we load closures using LOAD_FAST
863
                        EMIT_ARG(load_fast, id->qstr, id->flags, id->local_num);
Damien George's avatar
Damien George committed
864
#endif
865
866
867
                        nfree += 1;
                    }
                }
Damien's avatar
Damien committed
868
869
870
871
872
873
            }
        }
    }

    // make the function/closure
    if (nfree == 0) {
874
        EMIT_ARG(make_function, this_scope, n_pos_defaults, n_kw_defaults);
Damien's avatar
Damien committed
875
    } else {
876
        EMIT_ARG(make_closure, this_scope, nfree, n_pos_defaults, n_kw_defaults);
Damien's avatar
Damien committed
877
878
879
    }
}

880
void compile_funcdef_param(compiler_t *comp, mp_parse_node_t pn) {
881
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_star)) {
882
883
        comp->have_star = true;
        /* don't need to distinguish bare from named star
884
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
885
886
        if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
            // bare star
887
888
        } else {
            // named star
889
        }
890
        */
891
892

    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_dbl_star)) {
893
        // named double star
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
        // 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 {
916
            // XXX what to do here?
917
918
919
920
921
922
923
924
            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)
925
            if (!comp->have_star && comp->num_default_params != 0) {
926
                compile_syntax_error(comp, pn, "non-default argument follows default argument");
927
928
929
930
                return;
            }

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

934
            if (comp->have_star) {
935
                comp->num_dict_params += 1;
936
#if !MICROPY_EMIT_CPYTHON
937
938
                // in Micro Python we put the default dict parameters into a dictionary using the bytecode
                if (comp->num_dict_params == 1) {
939
940
941
942
                    // in Micro Python we put the default positional parameters into a tuple using the bytecode
                    // we need to do this here before we start building the map for the default keywords
                    if (comp->num_default_params > 0) {
                        EMIT_ARG(build_tuple, comp->num_default_params);
943
944
                    } else {
                        EMIT(load_null); // sentinel indicating empty default positional args
945
                    }
946
947
948
                    // first default dict param, so make the map
                    EMIT_ARG(build_map, 0);
                }
949
#endif
950
951
                EMIT_ARG(load_const_id, MP_PARSE_NODE_LEAF_ARG(pn_id));
                compile_node(comp, pn_equal);
952
#if !MICROPY_EMIT_CPYTHON
953
954
                // in Micro Python we put the default dict parameters into a dictionary using the bytecode
                EMIT(store_map);
955
#endif
Damien's avatar
Damien committed
956
            } else {
957
958
                comp->num_default_params += 1;
                compile_node(comp, pn_equal);
Damien's avatar
Damien committed
959
960
            }
        }
961
962
963

        // TODO pn_colon not implemented
        (void)pn_colon;
Damien's avatar
Damien committed
964
965
966
967
968
    }
}

// leaves function object on stack
// returns function name
969
qstr compile_funcdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
970
971
    if (comp->pass == PASS_1) {
        // create a new scope for this function
972
        scope_t *s = scope_new_and_link(comp, SCOPE_FUNCTION, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
973
        // store the function scope so the compiling function can use it at each pass
974
        pns->nodes[4] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
975
976
977
    }

    // save variables (probably don't need to do this, since we can't have nested definitions..?)
978
    uint old_have_star = comp->have_star;
979
980
    uint old_num_dict_params = comp->num_dict_params;
    uint old_num_default_params = comp->num_default_params;
Damien's avatar
Damien committed
981
982

    // compile default parameters
983
    comp->have_star = false;
984
985
    comp->num_dict_params = 0;
    comp->num_default_params = 0;
Damien's avatar
Damien committed
986
    apply_to_single_or_list(comp, pns->nodes[1], PN_typedargslist, compile_funcdef_param);
987
988
989
990
991

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

992
993
#if !MICROPY_EMIT_CPYTHON
    // in Micro Python we put the default positional parameters into a tuple using the bytecode
994
995
    // the default keywords args may have already made the tuple; if not, do it now
    if (comp->num_default_params > 0 && comp->num_dict_params == 0) {
996
        EMIT_ARG(build_tuple, comp->num_default_params);
997
        EMIT(load_null); // sentinel indicating empty default keyword args
998
999
1000
    }
#endif

Damien's avatar
Damien committed
1001
1002
1003
1004
    // get the scope for this function
    scope_t *fscope = (scope_t*)pns->nodes[4];

    // make the function
1005
    close_over_variables_etc(comp, fscope, comp->num_default_params, comp->num_dict_params);
Damien's avatar
Damien committed
1006
1007

    // restore variables
1008
    comp->have_star = old_have_star;
1009
1010
    comp->num_dict_params = old_num_dict_params;
    comp->num_default_params = old_num_default_params;
Damien's avatar
Damien committed
1011
1012
1013
1014
1015
1016
1017

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

// leaves class object on stack
// returns class name
1018
qstr compile_classdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
Damien's avatar
Damien committed
1019
1020
    if (comp->pass == PASS_1) {
        // create a new scope for this class
1021
        scope_t *s = scope_new_and_link(comp, SCOPE_CLASS, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
1022
        // store the class scope so the compiling function can use it at each pass
1023
        pns->nodes[3] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
    }

    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