moduselect.c 13 KB

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