moduselect.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  1. /*
  2. * This file is part of the MicroPython project, http://micropython.org/
  3. *
  4. * The MIT License (MIT)
  5. *
  6. * Copyright (c) 2014 Damien P. George
  7. *
  8. * Permission is hereby granted, free of charge, to any person obtaining a copy
  9. * of this software and associated documentation files (the "Software"), to deal
  10. * in the Software without restriction, including without limitation the rights
  11. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  12. * copies of the Software, and to permit persons to whom the Software is
  13. * furnished to do so, subject to the following conditions:
  14. *
  15. * The above copyright notice and this permission notice shall be included in
  16. * all copies or substantial portions of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  21. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  22. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  23. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  24. * THE SOFTWARE.
  25. */
  26. #include "py/mpconfig.h"
  27. #if MICROPY_PY_USELECT
  28. #include <stdio.h>
  29. #include "py/runtime.h"
  30. #include "py/obj.h"
  31. #include "py/objlist.h"
  32. #include "py/stream.h"
  33. #include "py/mperrno.h"
  34. #include "py/mphal.h"
  35. // Flags for poll()
  36. #define FLAG_ONESHOT (1)
  37. /// \module select - Provides select function to wait for events on a stream
  38. ///
  39. /// This module provides the select function.
  40. typedef struct _poll_obj_t {
  41. mp_obj_t obj;
  42. mp_uint_t (*ioctl)(mp_obj_t obj, mp_uint_t request, uintptr_t arg, int *errcode);
  43. mp_uint_t flags;
  44. mp_uint_t flags_ret;
  45. } poll_obj_t;
  46. STATIC void poll_map_add(mp_map_t *poll_map, const mp_obj_t *obj, mp_uint_t obj_len, mp_uint_t flags, bool or_flags) {
  47. for (mp_uint_t i = 0; i < obj_len; i++) {
  48. mp_map_elem_t *elem = mp_map_lookup(poll_map, mp_obj_id(obj[i]), MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  49. if (elem->value == MP_OBJ_NULL) {
  50. // object not found; get its ioctl and add it to the poll list
  51. const mp_stream_p_t *stream_p = mp_get_stream_raise(obj[i], MP_STREAM_OP_IOCTL);
  52. poll_obj_t *poll_obj = m_new_obj(poll_obj_t);
  53. poll_obj->obj = obj[i];
  54. poll_obj->ioctl = stream_p->ioctl;
  55. poll_obj->flags = flags;
  56. poll_obj->flags_ret = 0;
  57. elem->value = MP_OBJ_FROM_PTR(poll_obj);
  58. } else {
  59. // object exists; update its flags
  60. if (or_flags) {
  61. ((poll_obj_t*)MP_OBJ_TO_PTR(elem->value))->flags |= flags;
  62. } else {
  63. ((poll_obj_t*)MP_OBJ_TO_PTR(elem->value))->flags = flags;
  64. }
  65. }
  66. }
  67. }
  68. // poll each object in the map
  69. STATIC mp_uint_t poll_map_poll(mp_map_t *poll_map, size_t *rwx_num) {
  70. mp_uint_t n_ready = 0;
  71. for (mp_uint_t i = 0; i < poll_map->alloc; ++i) {
  72. if (!MP_MAP_SLOT_IS_FILLED(poll_map, i)) {
  73. continue;
  74. }
  75. poll_obj_t *poll_obj = MP_OBJ_TO_PTR(poll_map->table[i].value);
  76. int errcode;
  77. mp_int_t ret = poll_obj->ioctl(poll_obj->obj, MP_STREAM_POLL, poll_obj->flags, &errcode);
  78. poll_obj->flags_ret = ret;
  79. if (ret == -1) {
  80. // error doing ioctl
  81. mp_raise_OSError(errcode);
  82. }
  83. if (ret != 0) {
  84. // object is ready
  85. n_ready += 1;
  86. if (rwx_num != NULL) {
  87. if (ret & MP_STREAM_POLL_RD) {
  88. rwx_num[0] += 1;
  89. }
  90. if (ret & MP_STREAM_POLL_WR) {
  91. rwx_num[1] += 1;
  92. }
  93. if ((ret & ~(MP_STREAM_POLL_RD | MP_STREAM_POLL_WR)) != 0) {
  94. rwx_num[2] += 1;
  95. }
  96. }
  97. }
  98. }
  99. return n_ready;
  100. }
  101. /// \function select(rlist, wlist, xlist[, timeout])
  102. STATIC mp_obj_t select_select(uint n_args, const mp_obj_t *args) {
  103. // get array data from tuple/list arguments
  104. size_t rwx_len[3];
  105. mp_obj_t *r_array, *w_array, *x_array;
  106. mp_obj_get_array(args[0], &rwx_len[0], &r_array);
  107. mp_obj_get_array(args[1], &rwx_len[1], &w_array);
  108. mp_obj_get_array(args[2], &rwx_len[2], &x_array);
  109. // get timeout
  110. mp_uint_t timeout = -1;
  111. if (n_args == 4) {
  112. if (args[3] != mp_const_none) {
  113. #if MICROPY_PY_BUILTINS_FLOAT
  114. float timeout_f = mp_obj_get_float(args[3]);
  115. if (timeout_f >= 0) {
  116. timeout = (mp_uint_t)(timeout_f * 1000);
  117. }
  118. #else
  119. timeout = mp_obj_get_int(args[3]) * 1000;
  120. #endif
  121. }
  122. }
  123. // merge separate lists and get the ioctl function for each object
  124. mp_map_t poll_map;
  125. mp_map_init(&poll_map, rwx_len[0] + rwx_len[1] + rwx_len[2]);
  126. poll_map_add(&poll_map, r_array, rwx_len[0], MP_STREAM_POLL_RD, true);
  127. poll_map_add(&poll_map, w_array, rwx_len[1], MP_STREAM_POLL_WR, true);
  128. poll_map_add(&poll_map, x_array, rwx_len[2], MP_STREAM_POLL_ERR | MP_STREAM_POLL_HUP, true);
  129. mp_uint_t start_tick = mp_hal_ticks_ms();
  130. rwx_len[0] = rwx_len[1] = rwx_len[2] = 0;
  131. for (;;) {
  132. // poll the objects
  133. mp_uint_t n_ready = poll_map_poll(&poll_map, rwx_len);
  134. if (n_ready > 0 || (timeout != -1 && mp_hal_ticks_ms() - start_tick >= timeout)) {
  135. // one or more objects are ready, or we had a timeout
  136. mp_obj_t list_array[3];
  137. list_array[0] = mp_obj_new_list(rwx_len[0], NULL);
  138. list_array[1] = mp_obj_new_list(rwx_len[1], NULL);
  139. list_array[2] = mp_obj_new_list(rwx_len[2], NULL);
  140. rwx_len[0] = rwx_len[1] = rwx_len[2] = 0;
  141. for (mp_uint_t i = 0; i < poll_map.alloc; ++i) {
  142. if (!MP_MAP_SLOT_IS_FILLED(&poll_map, i)) {
  143. continue;
  144. }
  145. poll_obj_t *poll_obj = MP_OBJ_TO_PTR(poll_map.table[i].value);
  146. if (poll_obj->flags_ret & MP_STREAM_POLL_RD) {
  147. ((mp_obj_list_t*)MP_OBJ_TO_PTR(list_array[0]))->items[rwx_len[0]++] = poll_obj->obj;
  148. }
  149. if (poll_obj->flags_ret & MP_STREAM_POLL_WR) {
  150. ((mp_obj_list_t*)MP_OBJ_TO_PTR(list_array[1]))->items[rwx_len[1]++] = poll_obj->obj;
  151. }
  152. if ((poll_obj->flags_ret & ~(MP_STREAM_POLL_RD | MP_STREAM_POLL_WR)) != 0) {
  153. ((mp_obj_list_t*)MP_OBJ_TO_PTR(list_array[2]))->items[rwx_len[2]++] = poll_obj->obj;
  154. }
  155. }
  156. mp_map_deinit(&poll_map);
  157. return mp_obj_new_tuple(3, list_array);
  158. }
  159. MICROPY_EVENT_POLL_HOOK
  160. }
  161. }
  162. MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mp_select_select_obj, 3, 4, select_select);
  163. /// \class Poll - poll class
  164. typedef struct _mp_obj_poll_t {
  165. mp_obj_base_t base;
  166. mp_map_t poll_map;
  167. short iter_cnt;
  168. short iter_idx;
  169. int flags;
  170. // callee-owned tuple
  171. mp_obj_t ret_tuple;
  172. } mp_obj_poll_t;
  173. /// \method register(obj[, eventmask])
  174. STATIC mp_obj_t poll_register(uint n_args, const mp_obj_t *args) {
  175. mp_obj_poll_t *self = MP_OBJ_TO_PTR(args[0]);
  176. mp_uint_t flags;
  177. if (n_args == 3) {
  178. flags = mp_obj_get_int(args[2]);
  179. } else {
  180. flags = MP_STREAM_POLL_RD | MP_STREAM_POLL_WR;
  181. }
  182. poll_map_add(&self->poll_map, &args[1], 1, flags, false);
  183. return mp_const_none;
  184. }
  185. MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(poll_register_obj, 2, 3, poll_register);
  186. /// \method unregister(obj)
  187. STATIC mp_obj_t poll_unregister(mp_obj_t self_in, mp_obj_t obj_in) {
  188. mp_obj_poll_t *self = MP_OBJ_TO_PTR(self_in);
  189. mp_map_lookup(&self->poll_map, mp_obj_id(obj_in), MP_MAP_LOOKUP_REMOVE_IF_FOUND);
  190. // TODO raise KeyError if obj didn't exist in map
  191. return mp_const_none;
  192. }
  193. MP_DEFINE_CONST_FUN_OBJ_2(poll_unregister_obj, poll_unregister);
  194. /// \method modify(obj, eventmask)
  195. STATIC mp_obj_t poll_modify(mp_obj_t self_in, mp_obj_t obj_in, mp_obj_t eventmask_in) {
  196. mp_obj_poll_t *self = MP_OBJ_TO_PTR(self_in);
  197. mp_map_elem_t *elem = mp_map_lookup(&self->poll_map, mp_obj_id(obj_in), MP_MAP_LOOKUP);
  198. if (elem == NULL) {
  199. mp_raise_OSError(MP_ENOENT);
  200. }
  201. ((poll_obj_t*)MP_OBJ_TO_PTR(elem->value))->flags = mp_obj_get_int(eventmask_in);
  202. return mp_const_none;
  203. }
  204. MP_DEFINE_CONST_FUN_OBJ_3(poll_modify_obj, poll_modify);
  205. STATIC mp_uint_t poll_poll_internal(uint n_args, const mp_obj_t *args) {
  206. mp_obj_poll_t *self = MP_OBJ_TO_PTR(args[0]);
  207. // work out timeout (its given already in ms)
  208. mp_uint_t timeout = -1;
  209. int flags = 0;
  210. if (n_args >= 2) {
  211. if (args[1] != mp_const_none) {
  212. mp_int_t timeout_i = mp_obj_get_int(args[1]);
  213. if (timeout_i >= 0) {
  214. timeout = timeout_i;
  215. }
  216. }
  217. if (n_args >= 3) {
  218. flags = mp_obj_get_int(args[2]);
  219. }
  220. }
  221. self->flags = flags;
  222. mp_uint_t start_tick = mp_hal_ticks_ms();
  223. mp_uint_t n_ready;
  224. for (;;) {
  225. // poll the objects
  226. n_ready = poll_map_poll(&self->poll_map, NULL);
  227. if (n_ready > 0 || (timeout != -1 && mp_hal_ticks_ms() - start_tick >= timeout)) {
  228. break;
  229. }
  230. MICROPY_EVENT_POLL_HOOK
  231. }
  232. return n_ready;
  233. }
  234. STATIC mp_obj_t poll_poll(size_t n_args, const mp_obj_t *args) {
  235. mp_obj_poll_t *self = MP_OBJ_TO_PTR(args[0]);
  236. mp_uint_t n_ready = poll_poll_internal(n_args, args);
  237. // one or more objects are ready, or we had a timeout
  238. mp_obj_list_t *ret_list = MP_OBJ_TO_PTR(mp_obj_new_list(n_ready, NULL));
  239. n_ready = 0;
  240. for (mp_uint_t i = 0; i < self->poll_map.alloc; ++i) {
  241. if (!MP_MAP_SLOT_IS_FILLED(&self->poll_map, i)) {
  242. continue;
  243. }
  244. poll_obj_t *poll_obj = MP_OBJ_TO_PTR(self->poll_map.table[i].value);
  245. if (poll_obj->flags_ret != 0) {
  246. mp_obj_t tuple[2] = {poll_obj->obj, MP_OBJ_NEW_SMALL_INT(poll_obj->flags_ret)};
  247. ret_list->items[n_ready++] = mp_obj_new_tuple(2, tuple);
  248. if (self->flags & FLAG_ONESHOT) {
  249. // Don't poll next time, until new event flags will be set explicitly
  250. poll_obj->flags = 0;
  251. }
  252. }
  253. }
  254. return MP_OBJ_FROM_PTR(ret_list);
  255. }
  256. MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(poll_poll_obj, 1, 3, poll_poll);
  257. STATIC mp_obj_t poll_ipoll(size_t n_args, const mp_obj_t *args) {
  258. mp_obj_poll_t *self = MP_OBJ_TO_PTR(args[0]);
  259. if (self->ret_tuple == MP_OBJ_NULL) {
  260. self->ret_tuple = mp_obj_new_tuple(2, NULL);
  261. }
  262. int n_ready = poll_poll_internal(n_args, args);
  263. self->iter_cnt = n_ready;
  264. self->iter_idx = 0;
  265. return args[0];
  266. }
  267. MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(poll_ipoll_obj, 1, 3, poll_ipoll);
  268. STATIC mp_obj_t poll_iternext(mp_obj_t self_in) {
  269. mp_obj_poll_t *self = MP_OBJ_TO_PTR(self_in);
  270. if (self->iter_cnt == 0) {
  271. return MP_OBJ_STOP_ITERATION;
  272. }
  273. self->iter_cnt--;
  274. for (mp_uint_t i = self->iter_idx; i < self->poll_map.alloc; ++i) {
  275. self->iter_idx++;
  276. if (!MP_MAP_SLOT_IS_FILLED(&self->poll_map, i)) {
  277. continue;
  278. }
  279. poll_obj_t *poll_obj = MP_OBJ_TO_PTR(self->poll_map.table[i].value);
  280. if (poll_obj->flags_ret != 0) {
  281. mp_obj_tuple_t *t = MP_OBJ_TO_PTR(self->ret_tuple);
  282. t->items[0] = poll_obj->obj;
  283. t->items[1] = MP_OBJ_NEW_SMALL_INT(poll_obj->flags_ret);
  284. if (self->flags & FLAG_ONESHOT) {
  285. // Don't poll next time, until new event flags will be set explicitly
  286. poll_obj->flags = 0;
  287. }
  288. return MP_OBJ_FROM_PTR(t);
  289. }
  290. }
  291. assert(!"inconsistent number of poll active entries");
  292. self->iter_cnt = 0;
  293. return MP_OBJ_STOP_ITERATION;
  294. }
  295. STATIC const mp_rom_map_elem_t poll_locals_dict_table[] = {
  296. { MP_ROM_QSTR(MP_QSTR_register), MP_ROM_PTR(&poll_register_obj) },
  297. { MP_ROM_QSTR(MP_QSTR_unregister), MP_ROM_PTR(&poll_unregister_obj) },
  298. { MP_ROM_QSTR(MP_QSTR_modify), MP_ROM_PTR(&poll_modify_obj) },
  299. { MP_ROM_QSTR(MP_QSTR_poll), MP_ROM_PTR(&poll_poll_obj) },
  300. { MP_ROM_QSTR(MP_QSTR_ipoll), MP_ROM_PTR(&poll_ipoll_obj) },
  301. };
  302. STATIC MP_DEFINE_CONST_DICT(poll_locals_dict, poll_locals_dict_table);
  303. STATIC const mp_obj_type_t mp_type_poll = {
  304. { &mp_type_type },
  305. .name = MP_QSTR_poll,
  306. .getiter = mp_identity_getiter,
  307. .iternext = poll_iternext,
  308. .locals_dict = (void*)&poll_locals_dict,
  309. };
  310. /// \function poll()
  311. STATIC mp_obj_t select_poll(void) {
  312. mp_obj_poll_t *poll = m_new_obj(mp_obj_poll_t);
  313. poll->base.type = &mp_type_poll;
  314. mp_map_init(&poll->poll_map, 0);
  315. poll->iter_cnt = 0;
  316. poll->ret_tuple = MP_OBJ_NULL;
  317. return MP_OBJ_FROM_PTR(poll);
  318. }
  319. MP_DEFINE_CONST_FUN_OBJ_0(mp_select_poll_obj, select_poll);
  320. STATIC const mp_rom_map_elem_t mp_module_select_globals_table[] = {
  321. { MP_ROM_QSTR(MP_QSTR___name__), MP_ROM_QSTR(MP_QSTR_uselect) },
  322. { MP_ROM_QSTR(MP_QSTR_select), MP_ROM_PTR(&mp_select_select_obj) },
  323. { MP_ROM_QSTR(MP_QSTR_poll), MP_ROM_PTR(&mp_select_poll_obj) },
  324. { MP_ROM_QSTR(MP_QSTR_POLLIN), MP_ROM_INT(MP_STREAM_POLL_RD) },
  325. { MP_ROM_QSTR(MP_QSTR_POLLOUT), MP_ROM_INT(MP_STREAM_POLL_WR) },
  326. { MP_ROM_QSTR(MP_QSTR_POLLERR), MP_ROM_INT(MP_STREAM_POLL_ERR) },
  327. { MP_ROM_QSTR(MP_QSTR_POLLHUP), MP_ROM_INT(MP_STREAM_POLL_HUP) },
  328. };
  329. STATIC MP_DEFINE_CONST_DICT(mp_module_select_globals, mp_module_select_globals_table);
  330. const mp_obj_module_t mp_module_uselect = {
  331. .base = { &mp_type_module },
  332. .globals = (mp_obj_dict_t*)&mp_module_select_globals,
  333. };
  334. #endif // MICROPY_PY_USELECT