compile.c 141 KB
Newer Older
1
2
3
4
5
/*
 * This file is part of the Micro Python project, http://micropython.org/
 *
 * The MIT License (MIT)
 *
6
 * Copyright (c) 2013-2015 Damien P. George
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

xbe's avatar
xbe committed
27
#include <stdbool.h>
Damien's avatar
Damien committed
28
29
30
31
32
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>

33
34
35
36
37
38
#include "py/scope.h"
#include "py/emit.h"
#include "py/compile.h"
#include "py/smallint.h"
#include "py/runtime.h"
#include "py/builtin.h"
Damien's avatar
Damien committed
39
40
41
42

// TODO need to mangle __attr names

typedef enum {
43
#define DEF_RULE(rule, comp, kind, ...) PN_##rule,
44
#include "py/grammar.h"
Damien's avatar
Damien committed
45
46
#undef DEF_RULE
    PN_maximum_number_of,
47
    PN_string, // special node for non-interned string
48
    PN_bytes, // special node for non-interned bytes
49
    PN_const_object, // special node for a constant, generic Python object
Damien's avatar
Damien committed
50
51
} pn_kind_t;

52
#define NEED_METHOD_TABLE MICROPY_EMIT_NATIVE
53
54
55
56

#if NEED_METHOD_TABLE

// we need a method table to do the lookup for the emitter functions
57
58
#define EMIT(fun) (comp->emit_method_table->fun(comp->emit))
#define EMIT_ARG(fun, ...) (comp->emit_method_table->fun(comp->emit, __VA_ARGS__))
59
60
#define EMIT_LOAD_FAST(qst, local_num) (comp->emit_method_table->load_id.fast(comp->emit, qst, local_num))
#define EMIT_LOAD_GLOBAL(qst) (comp->emit_method_table->load_id.global(comp->emit, qst))
Damien's avatar
Damien committed
61

62
63
64
65
66
67
68
69
70
71
#else

// if we only have the bytecode emitter enabled then we can do a direct call to the functions
#define EMIT(fun) (mp_emit_bc_##fun(comp->emit))
#define EMIT_ARG(fun, ...) (mp_emit_bc_##fun(comp->emit, __VA_ARGS__))
#define EMIT_LOAD_FAST(qst, local_num) (mp_emit_bc_load_fast(comp->emit, qst, local_num))
#define EMIT_LOAD_GLOBAL(qst) (mp_emit_bc_load_global(comp->emit, qst))

#endif

72
73
74
#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__))

75
// elements in this struct are ordered to make it compact
Damien's avatar
Damien committed
76
typedef struct _compiler_t {
77
    qstr source_file;
78

79
80
81
    uint8_t is_repl;
    uint8_t pass; // holds enum type pass_kind_t
    uint8_t func_arg_is_super; // used to compile special case of super() function call
82
83
84
    uint8_t have_star;

    // try to keep compiler clean from nlr
85
86
    mp_obj_t compile_error; // set to an exception object if there's an error
    mp_uint_t compile_error_line; // set to best guess of line of error
Damien's avatar
Damien committed
87

88
    uint next_label;
89

90
91
92
    uint16_t num_dict_params;
    uint16_t num_default_params;

93
94
    uint16_t break_label; // highest bit set indicates we are breaking out of a for loop
    uint16_t continue_label;
95
    uint16_t cur_except_level; // increased for SETUP_EXCEPT, SETUP_FINALLY; decreased for POP_BLOCK, POP_EXCEPT
96
    uint16_t break_continue_except_level;
Damien's avatar
Damien committed
97
98
99
100

    scope_t *scope_head;
    scope_t *scope_cur;

101
    emit_t *emit;                                   // current emitter
102
    #if NEED_METHOD_TABLE
103
    const emit_method_table_t *emit_method_table;   // current emit method table
104
    #endif
105

106
    #if MICROPY_EMIT_INLINE_THUMB
107
108
    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
109
    #endif
Damien's avatar
Damien committed
110
111
} compiler_t;

112
113
114
115
STATIC void compile_error_set_line(compiler_t *comp, mp_parse_node_t pn) {
    // if the line of the error is unknown then try to update it from the pn
    if (comp->compile_error_line == 0 && MP_PARSE_NODE_IS_STRUCT(pn)) {
        comp->compile_error_line = (mp_uint_t)((mp_parse_node_struct_t*)pn)->source_line;
116
    }
117
118
119
}

STATIC void compile_syntax_error(compiler_t *comp, mp_parse_node_t pn, const char *msg) {
120
121
122
123
124
    // only register the error if there has been no other error
    if (comp->compile_error == MP_OBJ_NULL) {
        comp->compile_error = mp_obj_new_exception_msg(&mp_type_SyntaxError, msg);
        compile_error_set_line(comp, pn);
    }
125
126
}

127
#if MICROPY_COMP_MODULE_CONST
128
STATIC const mp_map_elem_t mp_constants_table[] = {
129
130
131
    #if MICROPY_PY_UCTYPES
    { MP_OBJ_NEW_QSTR(MP_QSTR_uctypes), (mp_obj_t)&mp_module_uctypes },
    #endif
132
    // Extra constants as defined by a port
133
    MICROPY_PORT_CONSTANTS
134
};
135
136
STATIC MP_DEFINE_CONST_MAP(mp_constants_map, mp_constants_table);
#endif
137

138
139
140
141
// this function is essentially a simple preprocessor
STATIC mp_parse_node_t fold_constants(compiler_t *comp, mp_parse_node_t pn, mp_map_t *consts) {
    if (0) {
        // dummy
142
#if MICROPY_COMP_CONST
143
144
145
146
147
148
149
150
151
    } else if (MP_PARSE_NODE_IS_ID(pn)) {
        // lookup identifier in table of dynamic constants
        qstr qst = MP_PARSE_NODE_LEAF_ARG(pn);
        mp_map_elem_t *elem = mp_map_lookup(consts, MP_OBJ_NEW_QSTR(qst), MP_MAP_LOOKUP);
        if (elem != NULL) {
            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, MP_OBJ_SMALL_INT_VALUE(elem->value));
        }
#endif
    } else if (MP_PARSE_NODE_IS_STRUCT(pn)) {
152
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
Damien's avatar
Damien committed
153

154
155
        // fold some parse nodes before folding their arguments
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
156
#if MICROPY_COMP_CONST
157
158
            case PN_expr_stmt:
                if (!MP_PARSE_NODE_IS_NULL(pns->nodes[1])) {
159
160
161
                    if (!(MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[1], PN_expr_stmt_augassign)
                        || MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[1], PN_expr_stmt_assign_list))) {
                        // this node is of the form <x> = <y>
162
                        if (MP_PARSE_NODE_IS_ID(pns->nodes[0])
163
164
165
166
167
                            && MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[1], PN_power)
                            && MP_PARSE_NODE_IS_ID(((mp_parse_node_struct_t*)pns->nodes[1])->nodes[0])
                            && MP_PARSE_NODE_LEAF_ARG(((mp_parse_node_struct_t*)pns->nodes[1])->nodes[0]) == MP_QSTR_const
                            && MP_PARSE_NODE_IS_STRUCT_KIND(((mp_parse_node_struct_t*)pns->nodes[1])->nodes[1], PN_trailer_paren)
                            && MP_PARSE_NODE_IS_NULL(((mp_parse_node_struct_t*)pns->nodes[1])->nodes[2])
168
169
170
171
172
173
174
                            ) {
                            // code to assign dynamic constants: id = const(value)

                            // get the id
                            qstr id_qstr = MP_PARSE_NODE_LEAF_ARG(pns->nodes[0]);

                            // get the value
175
                            mp_parse_node_t pn_value = ((mp_parse_node_struct_t*)((mp_parse_node_struct_t*)pns->nodes[1])->nodes[1])->nodes[0];
176
177
178
179
180
                            pn_value = fold_constants(comp, pn_value, consts);
                            if (!MP_PARSE_NODE_IS_SMALL_INT(pn_value)) {
                                compile_syntax_error(comp, (mp_parse_node_t)pns, "constant must be an integer");
                                break;
                            }
181
                            mp_int_t value = MP_PARSE_NODE_LEAF_SMALL_INT(pn_value);
182
183
184
185
186
187
188
189
190
191

                            // store the value in the table of dynamic constants
                            mp_map_elem_t *elem = mp_map_lookup(consts, MP_OBJ_NEW_QSTR(id_qstr), MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
                            if (elem->value != MP_OBJ_NULL) {
                                compile_syntax_error(comp, (mp_parse_node_t)pns, "constant redefined");
                                break;
                            }
                            elem->value = MP_OBJ_NEW_SMALL_INT(value);

                            // replace const(value) with value
192
                            pns->nodes[1] = pn_value;
193
194
195
196
197
198
199
200

                            // finished folding this assignment
                            return pn;
                        }
                    }
                }
                break;
#endif
201
            case PN_string:
202
            case PN_bytes:
203
            case PN_const_object:
204
                return pn;
205
206
207
208
        }

        // fold arguments
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
209
        for (int i = 0; i < n; i++) {
210
            pns->nodes[i] = fold_constants(comp, pns->nodes[i], consts);
Damien's avatar
Damien committed
211
212
        }

213
        // try to fold this parse node
214
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
215
216
217
218
219
220
221
222
223
224
            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
225
226
                    mp_int_t arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    mp_int_t arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[1]);
227
228
229
230
231
232
233
                    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
234
235
                    mp_int_t arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    mp_int_t arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[1]);
236
237
238
239
                    pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 & arg1);
                }
                break;

Damien's avatar
Damien committed
240
            case PN_shift_expr:
241
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
242
243
                    mp_int_t arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    mp_int_t arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
244
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_LESS)) {
245
                        // int << int
246
                        if (!(arg1 >= (mp_int_t)BITS_PER_WORD || arg0 > (MP_SMALL_INT_MAX >> arg1) || arg0 < (MP_SMALL_INT_MIN >> arg1))) {
247
248
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 << arg1);
                        }
249
250
                    } else {
                        assert(MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_MORE)); // should be
251
                        // int >> int
252
                        if (arg1 >= (mp_int_t)BITS_PER_WORD) {
253
254
255
256
                            // Shifting to big amounts is underfined behavior
                            // in C and is CPU-dependent; propagate sign bit.
                            arg1 = BITS_PER_WORD - 1;
                        }
257
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0 >> arg1);
Damien's avatar
Damien committed
258
259
260
261
262
                    }
                }
                break;

            case PN_arith_expr:
263
                // overflow checking here relies on SMALL_INT being strictly smaller than mp_int_t
264
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
265
266
                    mp_int_t arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    mp_int_t arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
267
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PLUS)) {
268
                        // int + int
269
                        arg0 += arg1;
270
271
                    } else {
                        assert(MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_MINUS)); // should be
272
                        // int - int
273
                        arg0 -= arg1;
274
                    }
275
                    if (MP_SMALL_INT_FITS(arg0)) {
276
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0);
Damien's avatar
Damien committed
277
278
279
280
281
                    }
                }
                break;

            case PN_term:
282
                if (n == 3 && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[0]) && MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[2])) {
283
284
                    mp_int_t arg0 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[0]);
                    mp_int_t arg1 = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[2]);
285
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_STAR)) {
286
                        // int * int
287
288
                        if (!mp_small_int_mul_overflow(arg0, arg1)) {
                            arg0 *= arg1;
289
                            if (MP_SMALL_INT_FITS(arg0)) {
290
291
292
                                pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg0);
                            }
                        }
293
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_SLASH)) {
294
295
                        // int / int
                        // pass
296
                    } else if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_PERCENT)) {
297
                        // int%int
298
299
300
                        if (arg1 != 0) {
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, mp_small_int_modulo(arg0, arg1));
                        }
301
302
                    } else {
                        assert(MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[1], MP_TOKEN_OP_DBL_SLASH)); // should be
303
                        if (arg1 != 0) {
304
                            // int // int
305
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, mp_small_int_floor_divide(arg0, arg1));
306
                        }
Damien's avatar
Damien committed
307
308
309
310
311
                    }
                }
                break;

            case PN_factor_2:
312
                if (MP_PARSE_NODE_IS_SMALL_INT(pns->nodes[1])) {
313
                    mp_int_t arg = MP_PARSE_NODE_LEAF_SMALL_INT(pns->nodes[1]);
314
                    if (MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[0], MP_TOKEN_OP_PLUS)) {
315
                        // +int
316
317
                        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)) {
318
                        // -int
319
320
321
322
                        arg = -arg;
                        if (MP_SMALL_INT_FITS(arg)) {
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, arg);
                        }
323
324
                    } else {
                        assert(MP_PARSE_NODE_IS_TOKEN_KIND(pns->nodes[0], MP_TOKEN_OP_TILDE)); // should be
325
                        // ~int
326
                        pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, ~arg);
Damien's avatar
Damien committed
327
328
329
330
331
                    }
                }
                break;

            case PN_power:
332
                if (0) {
333
#if MICROPY_COMP_MODULE_CONST
334
335
336
                } 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
337
                    mp_parse_node_struct_t *pns1 = (mp_parse_node_struct_t*)pns->nodes[1];
338
339
340
341
342
343
344
345
                    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) {
346
                            mp_int_t val = MP_OBJ_SMALL_INT_VALUE(dest[0]);
347
                            pn = mp_parse_node_new_leaf(MP_PARSE_NODE_SMALL_INT, val);
348
349
                        }
                    }
350
#endif
Damien's avatar
Damien committed
351
352
353
354
355
356
357
358
                }
                break;
        }
    }

    return pn;
}

359
STATIC void compile_trailer_paren_helper(compiler_t *comp, mp_parse_node_t pn_arglist, bool is_method_call, int n_positional_extra);
360
STATIC void compile_comprehension(compiler_t *comp, mp_parse_node_struct_t *pns, scope_kind_t kind);
361
STATIC void compile_node(compiler_t *comp, mp_parse_node_t pn);
Damien's avatar
Damien committed
362

363
STATIC uint comp_next_label(compiler_t *comp) {
364
365
366
    return comp->next_label++;
}

367
368
369
370
371
372
373
374
375
376
377
378
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;
}

379
STATIC scope_t *scope_new_and_link(compiler_t *comp, scope_kind_t kind, mp_parse_node_t pn, uint emit_options) {
380
    scope_t *scope = scope_new(kind, pn, comp->source_file, emit_options);
Damien's avatar
Damien committed
381
382
383
384
385
386
387
388
389
390
391
392
393
394
    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;
}

395
396
397
typedef void (*apply_list_fun_t)(compiler_t *comp, mp_parse_node_t pn);

STATIC void apply_to_single_or_list(compiler_t *comp, mp_parse_node_t pn, pn_kind_t pn_list_kind, apply_list_fun_t f) {
398
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, pn_list_kind)) {
399
400
        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
401
402
403
        for (int i = 0; i < num_nodes; i++) {
            f(comp, pns->nodes[i]);
        }
404
    } else if (!MP_PARSE_NODE_IS_NULL(pn)) {
Damien's avatar
Damien committed
405
406
407
408
        f(comp, pn);
    }
}

409
STATIC void compile_generic_all_nodes(compiler_t *comp, mp_parse_node_struct_t *pns) {
410
    int num_nodes = MP_PARSE_NODE_STRUCT_NUM_NODES(pns);
Damien's avatar
Damien committed
411
412
    for (int i = 0; i < num_nodes; i++) {
        compile_node(comp, pns->nodes[i]);
413
414
415
416
417
        if (comp->compile_error != MP_OBJ_NULL) {
            // add line info for the error in case it didn't have a line number
            compile_error_set_line(comp, pns->nodes[i]);
            return;
        }
Damien's avatar
Damien committed
418
419
420
    }
}

421
422
423
424
STATIC void compile_load_id(compiler_t *comp, qstr qst) {
    if (comp->pass == MP_PASS_SCOPE) {
        mp_emit_common_get_id_for_load(comp->scope_cur, qst);
    } else {
425
        #if NEED_METHOD_TABLE
426
        mp_emit_common_id_op(comp->emit, &comp->emit_method_table->load_id, comp->scope_cur, qst);
427
428
429
        #else
        mp_emit_common_id_op(comp->emit, &mp_emit_bc_method_table_load_id_ops, comp->scope_cur, qst);
        #endif
430
431
432
433
434
435
436
    }
}

STATIC void compile_store_id(compiler_t *comp, qstr qst) {
    if (comp->pass == MP_PASS_SCOPE) {
        mp_emit_common_get_id_for_modification(comp->scope_cur, qst);
    } else {
437
        #if NEED_METHOD_TABLE
438
        mp_emit_common_id_op(comp->emit, &comp->emit_method_table->store_id, comp->scope_cur, qst);
439
440
441
        #else
        mp_emit_common_id_op(comp->emit, &mp_emit_bc_method_table_store_id_ops, comp->scope_cur, qst);
        #endif
442
443
444
445
446
447
448
    }
}

STATIC void compile_delete_id(compiler_t *comp, qstr qst) {
    if (comp->pass == MP_PASS_SCOPE) {
        mp_emit_common_get_id_for_modification(comp->scope_cur, qst);
    } else {
449
        #if NEED_METHOD_TABLE
450
        mp_emit_common_id_op(comp->emit, &comp->emit_method_table->delete_id, comp->scope_cur, qst);
451
452
453
        #else
        mp_emit_common_id_op(comp->emit, &mp_emit_bc_method_table_delete_id_ops, comp->scope_cur, qst);
        #endif
454
455
456
    }
}

457
STATIC void c_tuple(compiler_t *comp, mp_parse_node_t pn, mp_parse_node_struct_t *pns_list) {
458
    int total = 0;
459
    if (!MP_PARSE_NODE_IS_NULL(pn)) {
460
461
462
463
        compile_node(comp, pn);
        total += 1;
    }
    if (pns_list != NULL) {
464
        int n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns_list);
465
466
467
468
469
        for (int i = 0; i < n; i++) {
            compile_node(comp, pns_list->nodes[i]);
        }
        total += n;
    }
470
    EMIT_ARG(build_tuple, total);
471
}
Damien's avatar
Damien committed
472

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

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

483
STATIC bool node_is_const_true(mp_parse_node_t pn) {
484
485
    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) != 0);
Damien's avatar
Damien committed
486
487
}

488
STATIC void c_if_cond(compiler_t *comp, mp_parse_node_t pn, bool jump_if, int label) {
489
490
    if (node_is_const_false(pn)) {
        if (jump_if == false) {
491
            EMIT_ARG(jump, label);
492
493
494
495
        }
        return;
    } else if (node_is_const_true(pn)) {
        if (jump_if == true) {
496
            EMIT_ARG(jump, label);
497
498
        }
        return;
499
500
501
502
    } 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) {
503
            if (jump_if == false) {
504
            and_or_logic1:;
505
                uint label2 = comp_next_label(comp);
506
                for (int i = 0; i < n - 1; i++) {
507
                    c_if_cond(comp, pns->nodes[i], !jump_if, label2);
508
                }
509
                c_if_cond(comp, pns->nodes[n - 1], jump_if, label);
510
                EMIT_ARG(label_assign, label2);
511
            } else {
512
            and_or_logic2:
513
                for (int i = 0; i < n; i++) {
514
                    c_if_cond(comp, pns->nodes[i], jump_if, label);
515
516
517
                }
            }
            return;
518
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_and_test) {
519
            if (jump_if == false) {
520
                goto and_or_logic2;
521
            } else {
522
                goto and_or_logic1;
523
            }
524
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_not_test_2) {
525
526
            c_if_cond(comp, pns->nodes[0], !jump_if, label);
            return;
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_atom_paren) {
            // cond is something in parenthesis
            if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
                // empty tuple, acts as false for the condition
                if (jump_if == false) {
                    EMIT_ARG(jump, label);
                }
            } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[0], PN_testlist_comp)) {
                // non-empty tuple, acts as true for the condition
                if (jump_if == true) {
                    EMIT_ARG(jump, label);
                }
            } else {
                // parenthesis around 1 item, is just that item
                c_if_cond(comp, pns->nodes[0], jump_if, label);
            }
            return;
544
545
546
547
548
        }
    }

    // nothing special, fall back to default compiling for node and jump
    compile_node(comp, pn);
549
    EMIT_ARG(pop_jump_if, jump_if, label);
Damien's avatar
Damien committed
550
551
552
}

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

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

560
561
562
563
    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
564
565
566
567
568
            if (assign_kind != ASSIGN_AUG_STORE) {
                for (int i = 0; i < n - 1; i++) {
                    compile_node(comp, pns1->nodes[i]);
                }
            }
569
570
            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
571
        }
572
        if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_bracket) {
Damien's avatar
Damien committed
573
574
575
576
577
578
579
            if (assign_kind == ASSIGN_AUG_STORE) {
                EMIT(rot_three);
                EMIT(store_subscr);
            } else {
                compile_node(comp, pns1->nodes[0]);
                if (assign_kind == ASSIGN_AUG_LOAD) {
                    EMIT(dup_top_two);
580
                    EMIT(load_subscr);
Damien's avatar
Damien committed
581
582
583
584
                } else {
                    EMIT(store_subscr);
                }
            }
585
586
        } else if (MP_PARSE_NODE_STRUCT_KIND(pns1) == PN_trailer_period) {
            assert(MP_PARSE_NODE_IS_ID(pns1->nodes[0]));
Damien's avatar
Damien committed
587
588
            if (assign_kind == ASSIGN_AUG_LOAD) {
                EMIT(dup_top);
589
                EMIT_ARG(load_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
590
591
592
593
            } else {
                if (assign_kind == ASSIGN_AUG_STORE) {
                    EMIT(rot_two);
                }
594
                EMIT_ARG(store_attr, MP_PARSE_NODE_LEAF_ARG(pns1->nodes[0]));
Damien's avatar
Damien committed
595
596
            }
        } else {
597
            goto cannot_assign;
Damien's avatar
Damien committed
598
599
        }
    } else {
600
        goto cannot_assign;
Damien's avatar
Damien committed
601
602
    }

603
    if (!MP_PARSE_NODE_IS_NULL(pns->nodes[2])) {
604
        goto cannot_assign;
Damien's avatar
Damien committed
605
    }
606
607
608
609
610

    return;

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

613
// we need to allow for a caller passing in 1 initial node (node_head) followed by an array of nodes (nodes_tail)
614
STATIC void c_assign_tuple(compiler_t *comp, mp_parse_node_t node_head, uint num_tail, mp_parse_node_t *nodes_tail) {
615
616
617
    uint num_head = (node_head == MP_PARSE_NODE_NULL) ? 0 : 1;

    // look for star expression
618
    uint have_star_index = -1;
619
620
621
622
    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;
    }
623
    for (uint i = 0; i < num_tail; i++) {
624
        if (MP_PARSE_NODE_IS_STRUCT_KIND(nodes_tail[i], PN_star_expr)) {
625
            if (have_star_index == (uint)-1) {
626
627
                EMIT_ARG(unpack_ex, num_head + i, num_tail - i - 1);
                have_star_index = num_head + i;
Damien's avatar
Damien committed
628
            } else {
629
                compile_syntax_error(comp, nodes_tail[i], "multiple *x in assignment");
Damien's avatar
Damien committed
630
631
632
633
                return;
            }
        }
    }
634
    if (have_star_index == (uint)-1) {
635
        EMIT_ARG(unpack_sequence, num_head + num_tail);
Damien's avatar
Damien committed
636
    }
637
638
639
    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
640
        } else {
641
642
643
            c_assign(comp, node_head, ASSIGN_STORE);
        }
    }
644
    for (uint i = 0; i < num_tail; i++) {
645
646
647
648
        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
649
650
651
652
653
        }
    }
}

// assigns top of stack to pn
654
STATIC void c_assign(compiler_t *comp, mp_parse_node_t pn, assign_kind_t assign_kind) {
Damien's avatar
Damien committed
655
    tail_recursion:
656
657
    assert(!MP_PARSE_NODE_IS_NULL(pn));
    if (MP_PARSE_NODE_IS_LEAF(pn)) {
658
        if (MP_PARSE_NODE_IS_ID(pn)) {
659
            qstr arg = MP_PARSE_NODE_LEAF_ARG(pn);
Damien's avatar
Damien committed
660
661
662
            switch (assign_kind) {
                case ASSIGN_STORE:
                case ASSIGN_AUG_STORE:
663
                    compile_store_id(comp, arg);
Damien's avatar
Damien committed
664
665
                    break;
                case ASSIGN_AUG_LOAD:
666
                default:
667
                    compile_load_id(comp, arg);
Damien's avatar
Damien committed
668
669
670
                    break;
            }
        } else {
671
            compile_syntax_error(comp, pn, "can't assign to literal");
Damien's avatar
Damien committed
672
673
674
            return;
        }
    } else {
675
        // pn must be a struct
676
677
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
        switch (MP_PARSE_NODE_STRUCT_KIND(pns)) {
Damien's avatar
Damien committed
678
679
680
681
682
683
684
685
686
687
688
            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;
                }
689
                c_assign_tuple(comp, MP_PARSE_NODE_NULL, MP_PARSE_NODE_STRUCT_NUM_NODES(pns), pns->nodes);
Damien's avatar
Damien committed
690
691
692
693
                break;

            case PN_atom_paren:
                // lhs is something in parenthesis
694
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
695
                    // empty tuple
696
                    goto cannot_assign;
697
                } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pns->nodes[0], PN_testlist_comp)) {
698
699
700
                    if (assign_kind != ASSIGN_STORE) {
                        goto bad_aug;
                    }
701
                    pns = (mp_parse_node_struct_t*)pns->nodes[0];
Damien's avatar
Damien committed
702
703
704
705
706
707
708
709
710
711
712
713
714
                    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;
                }
715
                if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
Damien's avatar
Damien committed
716
                    // empty list, assignment allowed
717
                    c_assign_tuple(comp, MP_PARSE_NODE_NULL, 0, NULL);
718
719
                } 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
720
721
722
                    goto testlist_comp;
                } else {
                    // brackets around 1 item
723
                    c_assign_tuple(comp, pns->nodes[0], 0, NULL);
Damien's avatar
Damien committed
724
725
726
727
                }
                break;

            default:
728
                goto cannot_assign;
Damien's avatar
Damien committed
729
730
731
732
733
        }
        return;

        testlist_comp:
        // lhs is a sequence
734
735
736
        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
737
                // sequence of one item, with trailing comma
738
                assert(MP_PARSE_NODE_IS_NULL(pns2->nodes[0]));
739
                c_assign_tuple(comp, pns->nodes[0], 0, NULL);
740
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns2) == PN_testlist_comp_3c) {
Damien's avatar
Damien committed
741
                // sequence of many items
742
743
                uint n = MP_PARSE_NODE_STRUCT_NUM_NODES(pns2);
                c_assign_tuple(comp, pns->nodes[0], n, pns2->nodes);
744
            } else if (MP_PARSE_NODE_STRUCT_KIND(pns) == PN_comp_for) {
745
                // TODO can we ever get here? can it be compiled?
746
                goto cannot_assign;
Damien's avatar
Damien committed
747
748
749
750
751
752
753
            } else {
                // sequence with 2 items
                goto sequence_with_2_items;
            }
        } else {
            // sequence with 2 items
            sequence_with_2_items:
754
            c_assign_tuple(comp, MP_PARSE_NODE_NULL, 2, pns->nodes);
Damien's avatar
Damien committed
755
756
757
758
759
        }
        return;
    }
    return;

760
761
762
763
    cannot_assign:
    compile_syntax_error(comp, pn, "can't assign to expression");
    return;

Damien's avatar
Damien committed
764
    bad_aug:
765
    compile_syntax_error(comp, pn, "illegal expression for augmented assignment");
Damien's avatar
Damien committed
766
767
}

768
// stuff for lambda and comprehensions and generators:
769
770
771
//  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)
772
STATIC void close_over_variables_etc(compiler_t *comp, scope_t *this_scope, int n_pos_defaults, int n_kw_defaults) {
773
774
775
    assert(n_pos_defaults >= 0);
    assert(n_kw_defaults >= 0);

Damien's avatar
Damien committed
776
    // make closed over variables, if any
777
    // ensure they are closed over in the order defined in the outer scope (mainly to agree with CPython)
Damien's avatar
Damien committed
778
779
    int nfree = 0;
    if (comp->scope_cur->kind != SCOPE_MODULE) {
780
781
782
783
784
        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];
785
                    if (id2->kind == ID_INFO_KIND_FREE && id->qst == id2->qst) {
Damien George's avatar
Damien George committed
786
                        // in Micro Python we load closures using LOAD_FAST
787
                        EMIT_LOAD_FAST(id->qst, id->local_num);
788
789
790
                        nfree += 1;
                    }
                }
Damien's avatar
Damien committed
791
792
793
794
795
796
            }
        }
    }

    // make the function/closure
    if (nfree == 0) {
797
        EMIT_ARG(make_function, this_scope, n_pos_defaults, n_kw_defaults);
Damien's avatar
Damien committed
798
    } else {
799
        EMIT_ARG(make_closure, this_scope, nfree, n_pos_defaults, n_kw_defaults);
Damien's avatar
Damien committed
800
801
802
    }
}

803
STATIC void compile_funcdef_param(compiler_t *comp, mp_parse_node_t pn) {
804
    if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_star)) {
805
806
        comp->have_star = true;
        /* don't need to distinguish bare from named star
807
        mp_parse_node_struct_t *pns = (mp_parse_node_struct_t*)pn;
808
809
        if (MP_PARSE_NODE_IS_NULL(pns->nodes[0])) {
            // bare star
810
811
        } else {
            // named star
812
        }
813
        */
814
815

    } else if (MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_dbl_star)) {
816
        // named double star
817
818
819
820
821
822
823
824
825
826
827
828
829
        // 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;

830
        } else {
831
832
            // this parameter has a colon and/or equal specifier

833
834
            assert(MP_PARSE_NODE_IS_STRUCT_KIND(pn, PN_typedargslist_name)); // should be

835
836
837
838
839
840
841
842
843
844
            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];
        }

        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)
845
            if (!comp->have_star && comp->num_default_params != 0) {
846
                compile_syntax_error(comp, pn, "non-default argument follows default argument");
847
848
849
850
                return;
            }

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

854
            if (comp->have_star) {
855
856
857
                comp->num_dict_params += 1;
                // in Micro Python we put the default dict parameters into a dictionary using the bytecode
                if (comp->num_dict_params == 1) {
858
859
860
861
                    // 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);
862
863
                    } else {
                        EMIT(load_null); // sentinel indicating empty default positional args
864
                    }
865
866
867
                    // first default dict param, so make the map
                    EMIT_ARG(build_map, 0);
                }
868
869

                // compile value then key, then store it to the dict
870
                compile_node(comp, pn_equal);
871
                EMIT_ARG(load_const_str, MP_PARSE_NODE_LEAF_ARG(pn_id));
872
                EMIT(store_map);
Damien's avatar
Damien committed
873
            } else {
874
875
                comp->num_default_params += 1;
                compile_node(comp, pn_equal);
Damien's avatar
Damien committed
876
877
            }
        }
878
879
880

        // TODO pn_colon not implemented
        (void)pn_colon;
Damien's avatar
Damien committed
881
882
883
884
885
    }
}

// leaves function object on stack
// returns function name
886
STATIC qstr compile_funcdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
887
    if (comp->pass == MP_PASS_SCOPE) {
Damien's avatar
Damien committed
888
        // create a new scope for this function
889
        scope_t *s = scope_new_and_link(comp, SCOPE_FUNCTION, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
890
        // store the function scope so the compiling function can use it at each pass
891
        pns->nodes[4] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
892
893
894
    }

    // save variables (probably don't need to do this, since we can't have nested definitions..?)
895
    uint old_have_star = comp->have_star;
896
897
    uint old_num_dict_params = comp->num_dict_params;
    uint old_num_default_params = comp->num_default_params;
Damien's avatar
Damien committed
898
899

    // compile default parameters
900
    comp->have_star = false;
901
902
    comp->num_dict_params = 0;
    comp->num_default_params = 0;
Damien's avatar
Damien committed
903
    apply_to_single_or_list(comp, pns->nodes[1], PN_typedargslist, compile_funcdef_param);
904

905
    if (comp->compile_error != MP_OBJ_NULL) {
906
907
908
        return MP_QSTR_NULL;
    }

909
    // in Micro Python we put the default positional parameters into a tuple using the bytecode
910
911
    // 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) {
912
        EMIT_ARG(build_tuple, comp->num_default_params);
913
        EMIT(load_null); // sentinel indicating empty default keyword args
914
915
    }

Damien's avatar
Damien committed
916
917
918
919
    // get the scope for this function
    scope_t *fscope = (scope_t*)pns->nodes[4];

    // make the function
920
    close_over_variables_etc(comp, fscope, comp->num_default_params, comp->num_dict_params);
Damien's avatar
Damien committed
921
922

    // restore variables
923
    comp->have_star = old_have_star;
924
925
    comp->num_dict_params = old_num_dict_params;
    comp->num_default_params = old_num_default_params;
Damien's avatar
Damien committed
926
927
928
929
930
931
932

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

// leaves class object on stack
// returns class name
933
STATIC qstr compile_classdef_helper(compiler_t *comp, mp_parse_node_struct_t *pns, uint emit_options) {
934
    if (comp->pass == MP_PASS_SCOPE) {
Damien's avatar
Damien committed
935
        // create a new scope for this class
936
        scope_t *s = scope_new_and_link(comp, SCOPE_CLASS, (mp_parse_node_t)pns, emit_options);
Damien's avatar
Damien committed
937
        // store the class scope so the compiling function can use it at each pass
938
        pns->nodes[3] = (mp_parse_node_t)s;
Damien's avatar
Damien committed
939
940
941
942
943
944
945
946
947
948
949
    }

    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
950
    EMIT_ARG(load_const_str, cscope->simple_name);
Damien's avatar
Damien committed
951
952

    // nodes[1] has parent classes, if any
953
954
955
956
957
    // 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;
    }
958
    comp->func_arg_is_super = false;
959
    compile_trailer_paren_helper(comp, parents, false, 2);
Damien's avatar
Damien committed
960
961
962
963
964