blob: 8c1320a5f740caf464d9224d41095308ffcbe3a1 [file] [log] [blame]
Paul Sokolovsky9ed54352014-02-02 03:42:07 +02001#include <string.h>
Damiend99b0522013-12-21 18:17:45 +00002#include <stdlib.h>
3#include <stdint.h>
Damiend99b0522013-12-21 18:17:45 +00004#include <assert.h>
5
6#include "nlr.h"
7#include "misc.h"
8#include "mpconfig.h"
Damien George55baff42014-01-21 21:40:13 +00009#include "qstr.h"
Damiend99b0522013-12-21 18:17:45 +000010#include "obj.h"
11#include "runtime0.h"
Damien George71c51812014-01-04 20:21:15 +000012#include "runtime.h"
Paul Sokolovsky8eec8bc2014-01-12 23:23:10 +020013#include "objtuple.h"
Damiend99b0522013-12-21 18:17:45 +000014
15static mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur);
16
17/******************************************************************************/
18/* tuple */
19
Paul Sokolovsky76d982e2014-01-13 19:19:16 +020020void tuple_print(void (*print)(void *env, const char *fmt, ...), void *env, mp_obj_t o_in, mp_print_kind_t kind) {
Damiend99b0522013-12-21 18:17:45 +000021 mp_obj_tuple_t *o = o_in;
22 print(env, "(");
23 for (int i = 0; i < o->len; i++) {
24 if (i > 0) {
25 print(env, ", ");
26 }
Paul Sokolovsky76d982e2014-01-13 19:19:16 +020027 mp_obj_print_helper(print, env, o->items[i], PRINT_REPR);
Damiend99b0522013-12-21 18:17:45 +000028 }
29 if (o->len == 1) {
30 print(env, ",");
31 }
32 print(env, ")");
33}
34
Damien George20006db2014-01-18 14:10:48 +000035static mp_obj_t tuple_make_new(mp_obj_t type_in, uint n_args, uint n_kw, const mp_obj_t *args) {
36 // TODO check n_kw == 0
37
Damien George71c51812014-01-04 20:21:15 +000038 switch (n_args) {
39 case 0:
40 // return a empty tuple
41 return mp_const_empty_tuple;
42
43 case 1:
44 {
45 // 1 argument, an iterable from which we make a new tuple
46 if (MP_OBJ_IS_TYPE(args[0], &tuple_type)) {
47 return args[0];
48 }
49
50 // TODO optimise for cases where we know the length of the iterator
51
52 uint alloc = 4;
53 uint len = 0;
54 mp_obj_t *items = m_new(mp_obj_t, alloc);
55
56 mp_obj_t iterable = rt_getiter(args[0]);
57 mp_obj_t item;
58 while ((item = rt_iternext(iterable)) != mp_const_stop_iteration) {
59 if (len >= alloc) {
60 items = m_renew(mp_obj_t, items, alloc, alloc * 2);
61 alloc *= 2;
62 }
63 items[len++] = item;
64 }
65
66 mp_obj_t tuple = mp_obj_new_tuple(len, items);
67 m_free(items, alloc);
68
69 return tuple;
70 }
71
72 default:
73 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));
74 }
75}
76
Paul Sokolovskye827e982014-02-08 22:55:00 +020077// Don't pass RT_BINARY_OP_NOT_EQUAL here
78static bool tuple_cmp_helper(int op, mp_obj_t self_in, mp_obj_t another_in) {
79 assert(MP_OBJ_IS_TYPE(self_in, &tuple_type));
80 if (!MP_OBJ_IS_TYPE(another_in, &tuple_type)) {
81 return false;
82 }
83 mp_obj_tuple_t *self = self_in;
84 mp_obj_tuple_t *another = another_in;
85
86 return mp_seq_cmp_objs(op, self->items, self->len, another->items, another->len);
87}
88
Damien George4e8dc8c2014-01-27 23:15:32 +000089static mp_obj_t tuple_unary_op(int op, mp_obj_t self_in) {
90 mp_obj_tuple_t *self = self_in;
91 switch (op) {
Paul Sokolovskyc1d9bbc2014-01-30 04:37:19 +020092 case RT_UNARY_OP_BOOL: return MP_BOOL(self->len != 0);
93 case RT_UNARY_OP_LEN: return MP_OBJ_NEW_SMALL_INT(self->len);
Damien George4e8dc8c2014-01-27 23:15:32 +000094 default: return MP_OBJ_NULL; // op not supported for None
95 }
96}
97
Damien George71c51812014-01-04 20:21:15 +000098static mp_obj_t tuple_binary_op(int op, mp_obj_t lhs, mp_obj_t rhs) {
Damiend99b0522013-12-21 18:17:45 +000099 mp_obj_tuple_t *o = lhs;
100 switch (op) {
101 case RT_BINARY_OP_SUBSCR:
102 {
Paul Sokolovsky9ed54352014-02-02 03:42:07 +0200103#if MICROPY_ENABLE_SLICE
104 if (MP_OBJ_IS_TYPE(rhs, &slice_type)) {
105 machine_uint_t start, stop;
Paul Sokolovskyea2509d2014-02-02 08:57:05 +0200106 if (!m_seq_get_fast_slice_indexes(o->len, rhs, &start, &stop)) {
107 assert(0);
108 }
Paul Sokolovsky9ed54352014-02-02 03:42:07 +0200109 mp_obj_tuple_t *res = mp_obj_new_tuple(stop - start, NULL);
110 m_seq_copy(res->items, o->items + start, res->len, mp_obj_t);
111 return res;
112 }
113#endif
Damiend99b0522013-12-21 18:17:45 +0000114 uint index = mp_get_index(o->base.type, o->len, rhs);
115 return o->items[index];
116 }
Paul Sokolovskye827e982014-02-08 22:55:00 +0200117 case RT_BINARY_OP_EQUAL:
118 case RT_BINARY_OP_LESS:
119 case RT_BINARY_OP_LESS_EQUAL:
120 case RT_BINARY_OP_MORE:
121 case RT_BINARY_OP_MORE_EQUAL:
122 return MP_BOOL(tuple_cmp_helper(op, lhs, rhs));
123 case RT_BINARY_OP_NOT_EQUAL:
124 return MP_BOOL(!tuple_cmp_helper(RT_BINARY_OP_EQUAL, lhs, rhs));
125
Damiend99b0522013-12-21 18:17:45 +0000126 default:
127 // op not supported
128 return NULL;
129 }
130}
131
Damien George71c51812014-01-04 20:21:15 +0000132static mp_obj_t tuple_getiter(mp_obj_t o_in) {
Damiend99b0522013-12-21 18:17:45 +0000133 return mp_obj_new_tuple_iterator(o_in, 0);
134}
135
Damiend99b0522013-12-21 18:17:45 +0000136const mp_obj_type_t tuple_type = {
John R. Lenton3391e192014-01-07 18:06:34 +0000137 { &mp_const_type },
138 "tuple",
Paul Sokolovsky860ffb02014-01-05 22:34:09 +0200139 .print = tuple_print,
140 .make_new = tuple_make_new,
Damien George4e8dc8c2014-01-27 23:15:32 +0000141 .unary_op = tuple_unary_op,
Paul Sokolovsky860ffb02014-01-05 22:34:09 +0200142 .binary_op = tuple_binary_op,
143 .getiter = tuple_getiter,
Damiend99b0522013-12-21 18:17:45 +0000144};
145
Damien George71c51812014-01-04 20:21:15 +0000146// the zero-length tuple
147static const mp_obj_tuple_t empty_tuple_obj = {{&tuple_type}, 0};
148const mp_obj_t mp_const_empty_tuple = (mp_obj_t)&empty_tuple_obj;
149
John R. Lentonc06763a2014-01-07 17:29:16 +0000150mp_obj_t mp_obj_new_tuple(uint n, const mp_obj_t *items) {
Damien George71c51812014-01-04 20:21:15 +0000151 if (n == 0) {
152 return mp_const_empty_tuple;
153 }
Damiend99b0522013-12-21 18:17:45 +0000154 mp_obj_tuple_t *o = m_new_obj_var(mp_obj_tuple_t, mp_obj_t, n);
155 o->base.type = &tuple_type;
156 o->len = n;
John R. Lenton07205ec2014-01-13 02:31:00 +0000157 if (items) {
158 for (int i = 0; i < n; i++) {
159 o->items[i] = items[i];
160 }
Damiend99b0522013-12-21 18:17:45 +0000161 }
162 return o;
163}
164
Damien George71c51812014-01-04 20:21:15 +0000165void mp_obj_tuple_get(mp_obj_t self_in, uint *len, mp_obj_t **items) {
Damien George004cdce2014-01-09 21:43:51 +0000166 assert(MP_OBJ_IS_TYPE(self_in, &tuple_type));
Damien George71c51812014-01-04 20:21:15 +0000167 mp_obj_tuple_t *self = self_in;
John R. Lenton07205ec2014-01-13 02:31:00 +0000168 if (len) {
169 *len = self->len;
170 }
171 if (items) {
172 *items = &self->items[0];
173 }
174}
175
176void mp_obj_tuple_del(mp_obj_t self_in) {
177 assert(MP_OBJ_IS_TYPE(self_in, &tuple_type));
178 mp_obj_tuple_t *self = self_in;
179 m_del_var(mp_obj_tuple_t, mp_obj_t, self->len, self);
Damien George71c51812014-01-04 20:21:15 +0000180}
181
Damiend99b0522013-12-21 18:17:45 +0000182/******************************************************************************/
183/* tuple iterator */
184
185typedef struct _mp_obj_tuple_it_t {
186 mp_obj_base_t base;
187 mp_obj_tuple_t *tuple;
188 machine_uint_t cur;
189} mp_obj_tuple_it_t;
190
Damien George71c51812014-01-04 20:21:15 +0000191static mp_obj_t tuple_it_iternext(mp_obj_t self_in) {
Damiend99b0522013-12-21 18:17:45 +0000192 mp_obj_tuple_it_t *self = self_in;
193 if (self->cur < self->tuple->len) {
194 mp_obj_t o_out = self->tuple->items[self->cur];
195 self->cur += 1;
196 return o_out;
197 } else {
198 return mp_const_stop_iteration;
199 }
200}
201
202static const mp_obj_type_t tuple_it_type = {
John R. Lenton3391e192014-01-07 18:06:34 +0000203 { &mp_const_type },
204 "tuple_iterator",
Paul Sokolovsky860ffb02014-01-05 22:34:09 +0200205 .iternext = tuple_it_iternext,
Damiend99b0522013-12-21 18:17:45 +0000206};
207
208static mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur) {
209 mp_obj_tuple_it_t *o = m_new_obj(mp_obj_tuple_it_t);
210 o->base.type = &tuple_it_type;
211 o->tuple = tuple;
212 o->cur = cur;
213 return o;
214}