Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 1 | #include <stdlib.h> |
| 2 | #include <stdint.h> |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 3 | #include <assert.h> |
| 4 | |
| 5 | #include "nlr.h" |
| 6 | #include "misc.h" |
| 7 | #include "mpconfig.h" |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 8 | #include "mpqstr.h" |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 9 | #include "obj.h" |
| 10 | #include "runtime0.h" |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 11 | #include "runtime.h" |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 12 | |
| 13 | typedef struct _mp_obj_tuple_t { |
| 14 | mp_obj_base_t base; |
| 15 | machine_uint_t len; |
| 16 | mp_obj_t items[]; |
| 17 | } mp_obj_tuple_t; |
| 18 | |
| 19 | static mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur); |
| 20 | |
| 21 | /******************************************************************************/ |
| 22 | /* tuple */ |
| 23 | |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 24 | static void tuple_print(void (*print)(void *env, const char *fmt, ...), void *env, mp_obj_t o_in) { |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 25 | mp_obj_tuple_t *o = o_in; |
| 26 | print(env, "("); |
| 27 | for (int i = 0; i < o->len; i++) { |
| 28 | if (i > 0) { |
| 29 | print(env, ", "); |
| 30 | } |
| 31 | mp_obj_print_helper(print, env, o->items[i]); |
| 32 | } |
| 33 | if (o->len == 1) { |
| 34 | print(env, ","); |
| 35 | } |
| 36 | print(env, ")"); |
| 37 | } |
| 38 | |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 39 | // args are in reverse order in the array |
| 40 | static mp_obj_t tuple_make_new(mp_obj_t type_in, int n_args, const mp_obj_t *args) { |
| 41 | switch (n_args) { |
| 42 | case 0: |
| 43 | // return a empty tuple |
| 44 | return mp_const_empty_tuple; |
| 45 | |
| 46 | case 1: |
| 47 | { |
| 48 | // 1 argument, an iterable from which we make a new tuple |
| 49 | if (MP_OBJ_IS_TYPE(args[0], &tuple_type)) { |
| 50 | return args[0]; |
| 51 | } |
| 52 | |
| 53 | // TODO optimise for cases where we know the length of the iterator |
| 54 | |
| 55 | uint alloc = 4; |
| 56 | uint len = 0; |
| 57 | mp_obj_t *items = m_new(mp_obj_t, alloc); |
| 58 | |
| 59 | mp_obj_t iterable = rt_getiter(args[0]); |
| 60 | mp_obj_t item; |
| 61 | while ((item = rt_iternext(iterable)) != mp_const_stop_iteration) { |
| 62 | if (len >= alloc) { |
| 63 | items = m_renew(mp_obj_t, items, alloc, alloc * 2); |
| 64 | alloc *= 2; |
| 65 | } |
| 66 | items[len++] = item; |
| 67 | } |
| 68 | |
| 69 | mp_obj_t tuple = mp_obj_new_tuple(len, items); |
| 70 | m_free(items, alloc); |
| 71 | |
| 72 | return tuple; |
| 73 | } |
| 74 | |
| 75 | default: |
| 76 | nlr_jump(mp_obj_new_exception_msg_1_arg(MP_QSTR_TypeError, "tuple takes at most 1 argument, %d given", (void*)(machine_int_t)n_args)); |
| 77 | } |
| 78 | } |
| 79 | |
| 80 | static mp_obj_t tuple_binary_op(int op, mp_obj_t lhs, mp_obj_t rhs) { |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 81 | mp_obj_tuple_t *o = lhs; |
| 82 | switch (op) { |
| 83 | case RT_BINARY_OP_SUBSCR: |
| 84 | { |
| 85 | // tuple load |
| 86 | uint index = mp_get_index(o->base.type, o->len, rhs); |
| 87 | return o->items[index]; |
| 88 | } |
| 89 | default: |
| 90 | // op not supported |
| 91 | return NULL; |
| 92 | } |
| 93 | } |
| 94 | |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 95 | static mp_obj_t tuple_getiter(mp_obj_t o_in) { |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 96 | return mp_obj_new_tuple_iterator(o_in, 0); |
| 97 | } |
| 98 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 99 | const mp_obj_type_t tuple_type = { |
John R. Lenton | c06763a | 2014-01-07 17:29:16 +0000 | [diff] [blame^] | 100 | .base = { &mp_const_type }, |
| 101 | .name = "tuple", |
Paul Sokolovsky | 860ffb0 | 2014-01-05 22:34:09 +0200 | [diff] [blame] | 102 | .print = tuple_print, |
| 103 | .make_new = tuple_make_new, |
| 104 | .binary_op = tuple_binary_op, |
| 105 | .getiter = tuple_getiter, |
| 106 | .methods = {{NULL, NULL},}, |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 107 | }; |
| 108 | |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 109 | // the zero-length tuple |
| 110 | static const mp_obj_tuple_t empty_tuple_obj = {{&tuple_type}, 0}; |
| 111 | const mp_obj_t mp_const_empty_tuple = (mp_obj_t)&empty_tuple_obj; |
| 112 | |
John R. Lenton | c06763a | 2014-01-07 17:29:16 +0000 | [diff] [blame^] | 113 | mp_obj_t mp_obj_new_tuple(uint n, const mp_obj_t *items) { |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 114 | if (n == 0) { |
| 115 | return mp_const_empty_tuple; |
| 116 | } |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 117 | mp_obj_tuple_t *o = m_new_obj_var(mp_obj_tuple_t, mp_obj_t, n); |
| 118 | o->base.type = &tuple_type; |
| 119 | o->len = n; |
| 120 | for (int i = 0; i < n; i++) { |
| 121 | o->items[i] = items[i]; |
| 122 | } |
| 123 | return o; |
| 124 | } |
| 125 | |
John R. Lenton | c06763a | 2014-01-07 17:29:16 +0000 | [diff] [blame^] | 126 | mp_obj_t mp_obj_new_tuple_reverse(uint n, const mp_obj_t *items) { |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 127 | if (n == 0) { |
| 128 | return mp_const_empty_tuple; |
| 129 | } |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 130 | mp_obj_tuple_t *o = m_new_obj_var(mp_obj_tuple_t, mp_obj_t, n); |
| 131 | o->base.type = &tuple_type; |
| 132 | o->len = n; |
| 133 | for (int i = 0; i < n; i++) { |
| 134 | o->items[i] = items[n - i - 1]; |
| 135 | } |
| 136 | return o; |
| 137 | } |
| 138 | |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 139 | void mp_obj_tuple_get(mp_obj_t self_in, uint *len, mp_obj_t **items) { |
| 140 | mp_obj_tuple_t *self = self_in; |
| 141 | *len = self->len; |
| 142 | *items = &self->items[0]; |
| 143 | } |
| 144 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 145 | /******************************************************************************/ |
| 146 | /* tuple iterator */ |
| 147 | |
| 148 | typedef struct _mp_obj_tuple_it_t { |
| 149 | mp_obj_base_t base; |
| 150 | mp_obj_tuple_t *tuple; |
| 151 | machine_uint_t cur; |
| 152 | } mp_obj_tuple_it_t; |
| 153 | |
Damien George | 71c5181 | 2014-01-04 20:21:15 +0000 | [diff] [blame] | 154 | static mp_obj_t tuple_it_iternext(mp_obj_t self_in) { |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 155 | mp_obj_tuple_it_t *self = self_in; |
| 156 | if (self->cur < self->tuple->len) { |
| 157 | mp_obj_t o_out = self->tuple->items[self->cur]; |
| 158 | self->cur += 1; |
| 159 | return o_out; |
| 160 | } else { |
| 161 | return mp_const_stop_iteration; |
| 162 | } |
| 163 | } |
| 164 | |
| 165 | static const mp_obj_type_t tuple_it_type = { |
John R. Lenton | c06763a | 2014-01-07 17:29:16 +0000 | [diff] [blame^] | 166 | .base = { &mp_const_type }, |
| 167 | .name = "tuple_iterator", |
Paul Sokolovsky | 860ffb0 | 2014-01-05 22:34:09 +0200 | [diff] [blame] | 168 | .iternext = tuple_it_iternext, |
| 169 | .methods = {{NULL, NULL},}, |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 170 | }; |
| 171 | |
| 172 | static mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur) { |
| 173 | mp_obj_tuple_it_t *o = m_new_obj(mp_obj_tuple_it_t); |
| 174 | o->base.type = &tuple_it_type; |
| 175 | o->tuple = tuple; |
| 176 | o->cur = cur; |
| 177 | return o; |
| 178 | } |