Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 1 | #include <stdlib.h> |
| 2 | #include <stdint.h> |
| 3 | #include <string.h> |
| 4 | #include <assert.h> |
| 5 | |
| 6 | #include "nlr.h" |
| 7 | #include "misc.h" |
| 8 | #include "mpconfig.h" |
Damien George | eb7bfcb | 2014-01-04 15:57:35 +0000 | [diff] [blame] | 9 | #include "mpqstr.h" |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 10 | #include "obj.h" |
| 11 | #include "runtime.h" |
| 12 | #include "bc.h" |
| 13 | |
| 14 | /******************************************************************************/ |
| 15 | /* generator wrapper */ |
| 16 | |
| 17 | typedef struct _mp_obj_gen_wrap_t { |
| 18 | mp_obj_base_t base; |
Damien George | 0ff8839 | 2014-01-02 20:57:05 +0000 | [diff] [blame] | 19 | uint n_state; |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 20 | mp_obj_t *fun; |
| 21 | } mp_obj_gen_wrap_t; |
| 22 | |
| 23 | // args are in reverse order in the array |
| 24 | mp_obj_t gen_wrap_call_n(mp_obj_t self_in, int n_args, const mp_obj_t *args) { |
| 25 | mp_obj_gen_wrap_t *self = self_in; |
| 26 | mp_obj_t self_fun = self->fun; |
| 27 | assert(MP_OBJ_IS_TYPE(self_fun, &fun_bc_type)); |
| 28 | int bc_n_args; |
| 29 | uint bc_n_state; |
| 30 | const byte *bc_code; |
| 31 | mp_obj_fun_bc_get(self_fun, &bc_n_args, &bc_n_state, &bc_code); |
| 32 | if (n_args != bc_n_args) { |
Damien George | eb7bfcb | 2014-01-04 15:57:35 +0000 | [diff] [blame] | 33 | nlr_jump(mp_obj_new_exception_msg_2_args(MP_QSTR_TypeError, "function takes %d positional arguments but %d were given", (const char*)(machine_int_t)bc_n_args, (const char*)(machine_int_t)n_args)); |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 34 | } |
Damien George | 6baf76e | 2013-12-30 22:32:17 +0000 | [diff] [blame] | 35 | |
Damien George | 0ff8839 | 2014-01-02 20:57:05 +0000 | [diff] [blame] | 36 | return mp_obj_new_gen_instance(bc_code, self->n_state, n_args, args); |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 37 | } |
| 38 | |
| 39 | const mp_obj_type_t gen_wrap_type = { |
| 40 | { &mp_const_type }, |
| 41 | "generator", |
| 42 | NULL, // print |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 43 | NULL, // make_new |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 44 | gen_wrap_call_n, // call_n |
| 45 | NULL, // unary_op |
| 46 | NULL, // binary_op |
| 47 | NULL, // getiter |
| 48 | NULL, // iternext |
Paul Sokolovsky | 860ffb0 | 2014-01-05 22:34:09 +0200 | [diff] [blame] | 49 | .methods = {{NULL, NULL},}, |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 50 | }; |
| 51 | |
Damien George | 6baf76e | 2013-12-30 22:32:17 +0000 | [diff] [blame] | 52 | mp_obj_t mp_obj_new_gen_wrap(uint n_locals, uint n_stack, mp_obj_t fun) { |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 53 | mp_obj_gen_wrap_t *o = m_new_obj(mp_obj_gen_wrap_t); |
| 54 | o->base.type = &gen_wrap_type; |
| 55 | // we have at least 3 locals so the bc can write back fast[0,1,2] safely; should improve how this is done |
Damien George | 6baf76e | 2013-12-30 22:32:17 +0000 | [diff] [blame] | 56 | o->n_state = (n_locals < 3 ? 3 : n_locals) + n_stack; |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 57 | o->fun = fun; |
| 58 | return o; |
| 59 | } |
| 60 | |
| 61 | /******************************************************************************/ |
| 62 | /* generator instance */ |
| 63 | |
| 64 | typedef struct _mp_obj_gen_instance_t { |
| 65 | mp_obj_base_t base; |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 66 | const byte *ip; |
| 67 | mp_obj_t *sp; |
Damien George | 0ff8839 | 2014-01-02 20:57:05 +0000 | [diff] [blame] | 68 | mp_obj_t state[]; |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 69 | } mp_obj_gen_instance_t; |
| 70 | |
| 71 | void gen_instance_print(void (*print)(void *env, const char *fmt, ...), void *env, mp_obj_t self_in) { |
| 72 | print(env, "<generator object 'fun-name' at %p>", self_in); |
| 73 | } |
| 74 | |
| 75 | mp_obj_t gen_instance_getiter(mp_obj_t self_in) { |
| 76 | return self_in; |
| 77 | } |
| 78 | |
| 79 | mp_obj_t gen_instance_iternext(mp_obj_t self_in) { |
| 80 | mp_obj_gen_instance_t *self = self_in; |
Damien George | 0ff8839 | 2014-01-02 20:57:05 +0000 | [diff] [blame] | 81 | bool yield = mp_execute_byte_code_2(&self->ip, &self->state[0], &self->sp); |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 82 | if (yield) { |
| 83 | return *self->sp; |
| 84 | } else { |
| 85 | if (*self->sp == mp_const_none) { |
| 86 | return mp_const_stop_iteration; |
| 87 | } else { |
| 88 | // TODO return StopIteration with value *self->sp |
| 89 | return mp_const_stop_iteration; |
| 90 | } |
| 91 | } |
| 92 | } |
| 93 | |
| 94 | const mp_obj_type_t gen_instance_type = { |
| 95 | { &mp_const_type }, |
| 96 | "generator", |
| 97 | gen_instance_print, // print |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 98 | NULL, // make_new |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 99 | NULL, // call_n |
| 100 | NULL, // unary_op |
| 101 | NULL, // binary_op |
| 102 | gen_instance_getiter, // getiter |
| 103 | gen_instance_iternext, // iternext |
Paul Sokolovsky | 860ffb0 | 2014-01-05 22:34:09 +0200 | [diff] [blame] | 104 | .methods = {{NULL, NULL},}, |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 105 | }; |
| 106 | |
Damien George | 0ff8839 | 2014-01-02 20:57:05 +0000 | [diff] [blame] | 107 | // args are in reverse order in the array |
| 108 | mp_obj_t mp_obj_new_gen_instance(const byte *bytecode, uint n_state, int n_args, const mp_obj_t *args) { |
| 109 | mp_obj_gen_instance_t *o = m_new_obj_var(mp_obj_gen_instance_t, mp_obj_t, n_state); |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 110 | o->base.type = &gen_instance_type; |
Damien George | 0ff8839 | 2014-01-02 20:57:05 +0000 | [diff] [blame] | 111 | o->ip = bytecode; |
| 112 | o->sp = o->state + n_state; |
| 113 | |
| 114 | // copy args (which are in reverse order) to start of state array |
| 115 | for (int i = 0; i < n_args; i++) { |
| 116 | o->state[i] = args[n_args - 1 - i]; |
| 117 | } |
| 118 | |
| 119 | // TODO |
| 120 | // prelude for making cells (closed over variables) |
| 121 | // for now we just make sure there are no cells variables |
| 122 | // need to work out how to implement closed over variables in generators |
| 123 | assert(o->ip[0] == 0); |
| 124 | o->ip += 1; |
| 125 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 126 | return o; |
| 127 | } |