epoll.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817
  1. /*
  2. * Copyright (c) 2006-2023, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2023-07-29 zmq810150896 first version
  9. */
  10. #include <rtthread.h>
  11. #include <fcntl.h>
  12. #include <stdint.h>
  13. #include <unistd.h>
  14. #include <dfs_file.h>
  15. #include "sys/epoll.h"
  16. #include "poll.h"
  17. #include <lwp_signal.h>
  18. #define EPOLL_MUTEX_NAME "EVENTEPOLL"
  19. #define EFD_SHARED_EPOLL_TYPE (EPOLL_CTL_ADD | EPOLL_CTL_DEL | EPOLL_CTL_MOD)
  20. #define EPOLLINOUT_BITS (EPOLLIN | EPOLLOUT | EPOLLRDNORM | EPOLLWRNORM)
  21. #define EPOLLEXCLUSIVE_BITS (EPOLLINOUT_BITS | EPOLLERR | EPOLLHUP | \
  22. EPOLLET | EPOLLEXCLUSIVE)
  23. static struct rt_spinlock spinlock;
  24. struct rt_eventpoll;
  25. /* Monitor queue */
  26. struct rt_fd_list
  27. {
  28. rt_uint32_t revents; /* Monitored events */
  29. struct epoll_event epev;
  30. rt_pollreq_t req;
  31. struct rt_eventpoll *ep;
  32. struct rt_wqueue_node wqn;
  33. int fd;
  34. struct rt_fd_list *next;
  35. };
  36. struct rt_ready_list
  37. {
  38. int exclusive;/* If triggered horizontally, a check is made to see if the data has been read, and if there is any data left to read, the readability event is returned in the next epoll_wait */
  39. struct rt_fd_list *rdl_event; /* rdl: ready list */
  40. struct rt_ready_list *next;
  41. };
  42. struct rt_eventpoll
  43. {
  44. rt_uint32_t tirggered; /* the waited thread whether triggered */
  45. rt_wqueue_t epoll_read;
  46. rt_thread_t polling_thread;
  47. struct rt_mutex lock;
  48. struct rt_fd_list *fdlist; /* Monitor list */
  49. int eventpoll_num; /* Number of ready lists */
  50. rt_pollreq_t req;
  51. struct rt_ready_list *rdlist; /* ready list */
  52. };
  53. static int epoll_close(struct dfs_file *file);
  54. static int epoll_poll(struct dfs_file *file, struct rt_pollreq *req);
  55. static int epoll_get_event(struct rt_fd_list *fl, rt_pollreq_t *req);
  56. static int epoll_do_ctl(int epfd, int op, int fd, struct epoll_event *event);
  57. static const struct dfs_file_ops epoll_fops =
  58. {
  59. .close = epoll_close,
  60. .poll = epoll_poll,
  61. };
  62. static int epoll_close_fdlist(struct rt_fd_list *fdlist)
  63. {
  64. struct rt_fd_list *fre_node, *list;
  65. if (fdlist != RT_NULL)
  66. {
  67. list = fdlist;
  68. while (list->next != RT_NULL)
  69. {
  70. fre_node = list->next;
  71. rt_wqueue_remove(&fre_node->wqn);
  72. list->next = fre_node->next;
  73. rt_free(fre_node);
  74. }
  75. rt_free(fdlist);
  76. }
  77. return 0;
  78. }
  79. static int epoll_close_rdlist(struct rt_ready_list *rdlist)
  80. {
  81. struct rt_ready_list *list, *fre_node;
  82. list = rdlist;
  83. if (list)
  84. {
  85. while (list->next != RT_NULL)
  86. {
  87. fre_node = list->next;
  88. list->next = fre_node->next;
  89. rt_free(fre_node);
  90. }
  91. rt_free(rdlist);
  92. }
  93. return 0;
  94. }
  95. static int epoll_close(struct dfs_file *file)
  96. {
  97. struct rt_eventpoll *ep;
  98. if (file->vnode->ref_count != 1)
  99. return 0;
  100. if (file->vnode)
  101. {
  102. if (file->vnode->data)
  103. {
  104. ep = file->vnode->data;
  105. if (ep)
  106. {
  107. rt_mutex_take(&ep->lock, RT_WAITING_FOREVER);
  108. if (ep->fdlist)
  109. {
  110. epoll_close_fdlist(ep->fdlist);
  111. }
  112. if (ep->rdlist)
  113. {
  114. epoll_close_rdlist(ep->rdlist);
  115. }
  116. rt_mutex_release(&ep->lock);
  117. rt_mutex_detach(&ep->lock);
  118. rt_free(ep);
  119. }
  120. }
  121. }
  122. return 0;
  123. }
  124. static int epoll_poll(struct dfs_file *file, struct rt_pollreq *req)
  125. {
  126. struct rt_eventpoll *ep;
  127. struct rt_fd_list *fdlist;
  128. int mask;
  129. int events = 0;
  130. if (file->vnode->data)
  131. {
  132. ep = file->vnode->data;
  133. ep->req._key = req->_key;
  134. rt_poll_add(&ep->epoll_read, req);
  135. fdlist = ep->fdlist;
  136. if (fdlist)
  137. {
  138. while (fdlist->next != RT_NULL)
  139. {
  140. fdlist = fdlist->next;
  141. mask = epoll_get_event(fdlist, &fdlist->req);
  142. if (mask & fdlist->revents)
  143. {
  144. events |= mask | POLLIN | EPOLLRDNORM;
  145. break;
  146. }
  147. }
  148. }
  149. }
  150. return events;
  151. }
  152. static int epoll_rdlist_add(struct rt_fd_list *fdl, rt_uint32_t revents)
  153. {
  154. struct rt_ready_list *rdlist = RT_NULL;
  155. struct rt_eventpoll *ep;
  156. int isexist = 0;
  157. int res = -1;
  158. ep = fdl->ep;
  159. if (revents & ep->req._key)
  160. {
  161. rt_wqueue_wakeup(&ep->epoll_read, (void*)POLLIN);
  162. }
  163. rt_mutex_take(&ep->lock, RT_WAITING_FOREVER);
  164. if (ep->rdlist == RT_NULL)
  165. {
  166. ep->rdlist = (struct rt_ready_list *)rt_malloc(sizeof(struct rt_ready_list));
  167. if (ep->rdlist == RT_NULL)
  168. {
  169. return -1;
  170. }
  171. ep->rdlist->next = RT_NULL;
  172. }
  173. rdlist = ep->rdlist;
  174. while (rdlist->next != RT_NULL)
  175. {
  176. rdlist = rdlist->next;
  177. if (rdlist->rdl_event->fd == fdl->fd)
  178. {
  179. isexist = 1;
  180. res = 0;
  181. break;
  182. }
  183. }
  184. if (!isexist)
  185. {
  186. rdlist = RT_NULL;
  187. rdlist = (struct rt_ready_list *)rt_malloc(sizeof(struct rt_ready_list));
  188. if (rdlist != RT_NULL)
  189. {
  190. rdlist->rdl_event = fdl;
  191. rdlist->rdl_event->epev.events = fdl->revents & revents;
  192. rdlist->next = ep->rdlist->next;
  193. rdlist->exclusive = 0;
  194. ep->rdlist->next = rdlist;
  195. ep->eventpoll_num ++;
  196. res = 0;
  197. }
  198. }
  199. ep->tirggered = 1;
  200. rt_mutex_release(&ep->lock);
  201. return res;
  202. }
  203. static int epoll_wqueue_callback(struct rt_wqueue_node *wait, void *key)
  204. {
  205. struct rt_fd_list *fdlist;
  206. if (key && !((rt_ubase_t)key & wait->key))
  207. return -1;
  208. fdlist = rt_container_of(wait, struct rt_fd_list, wqn);
  209. if (fdlist->revents)
  210. {
  211. epoll_rdlist_add(fdlist, (rt_ubase_t)key);
  212. }
  213. return __wqueue_default_wake(wait, key);
  214. }
  215. static void epoll_wqueue_add_callback(rt_wqueue_t *wq, rt_pollreq_t *req)
  216. {
  217. struct rt_fd_list *fdlist;
  218. struct rt_eventpoll *ep;
  219. fdlist = rt_container_of(req, struct rt_fd_list, req);
  220. ep = fdlist->ep;
  221. fdlist->wqn.key = req->_key;
  222. rt_list_init(&(fdlist->wqn.list));
  223. fdlist->wqn.polling_thread = ep->polling_thread;
  224. fdlist->wqn.wakeup = epoll_wqueue_callback;
  225. rt_wqueue_add(wq, &fdlist->wqn);
  226. }
  227. static void epoll_ctl_install(struct rt_fd_list *fdlist, struct rt_eventpoll *ep)
  228. {
  229. rt_uint32_t mask = 0;
  230. fdlist->req._key = fdlist->revents;
  231. mask = epoll_get_event(fdlist, &fdlist->req);
  232. if (mask & fdlist->revents)
  233. {
  234. epoll_rdlist_add(fdlist, mask);
  235. }
  236. }
  237. static void epoll_member_init(struct rt_eventpoll *ep)
  238. {
  239. ep->tirggered = 0;
  240. ep->eventpoll_num = 0;
  241. ep->polling_thread = rt_thread_self();
  242. ep->rdlist = RT_NULL;
  243. ep->fdlist = RT_NULL;
  244. ep->req._key = 0;
  245. rt_wqueue_init(&ep->epoll_read);
  246. rt_spin_lock_init(&spinlock);
  247. }
  248. static int epoll_epf_init(int fd)
  249. {
  250. struct dfs_file *df;
  251. struct rt_eventpoll *ep;
  252. rt_err_t ret = 0;
  253. df = fd_get(fd);
  254. if (df)
  255. {
  256. ep = (struct rt_eventpoll *)rt_malloc(sizeof(struct rt_eventpoll));
  257. if (ep)
  258. {
  259. epoll_member_init(ep);
  260. rt_mutex_init(&ep->lock, EPOLL_MUTEX_NAME, RT_IPC_FLAG_FIFO);
  261. #ifdef RT_USING_DFS_V2
  262. df->fops = &epoll_fops;
  263. #endif
  264. df->vnode = (struct dfs_vnode *)rt_malloc(sizeof(struct dfs_vnode));
  265. if (df->vnode)
  266. {
  267. ep->fdlist = (struct rt_fd_list *)rt_malloc(sizeof(struct rt_fd_list));
  268. if (ep->fdlist)
  269. {
  270. ep->fdlist->next = RT_NULL;
  271. ep->fdlist->fd = fd;
  272. ep->fdlist->ep = ep;
  273. dfs_vnode_init(df->vnode, FT_REGULAR, &epoll_fops);
  274. df->vnode->data = ep;
  275. }
  276. else
  277. {
  278. ret = -ENOMEM;
  279. rt_free(df->vnode);
  280. rt_free(ep);
  281. }
  282. }
  283. else
  284. {
  285. ret = -ENOMEM;
  286. rt_free(ep);
  287. }
  288. }
  289. else
  290. {
  291. ret = -ENOMEM;
  292. }
  293. }
  294. return ret;
  295. }
  296. static int epoll_do_create(int size)
  297. {
  298. rt_err_t ret = -1;
  299. int status;
  300. int fd;
  301. if (size < 0)
  302. {
  303. rt_set_errno(EINVAL);
  304. }
  305. else
  306. {
  307. fd = fd_new();
  308. if (fd >= 0)
  309. {
  310. ret = fd;
  311. status = epoll_epf_init(fd);
  312. if (status < 0)
  313. {
  314. fd_release(fd);
  315. rt_set_errno(-status);
  316. }
  317. }
  318. else
  319. {
  320. rt_set_errno(-fd);
  321. }
  322. }
  323. return ret;
  324. }
  325. static int epoll_ctl_add(struct dfs_file *df, int fd, struct epoll_event *event)
  326. {
  327. struct rt_fd_list *fdlist;
  328. struct rt_eventpoll *ep;
  329. rt_err_t ret = -EINVAL;
  330. if (df->vnode->data)
  331. {
  332. ep = df->vnode->data;
  333. fdlist = ep->fdlist;
  334. ret = 0;
  335. while (fdlist->next != RT_NULL)
  336. {
  337. if (fdlist->next->fd == fd)
  338. {
  339. return 0;
  340. }
  341. fdlist = fdlist->next;
  342. }
  343. fdlist = (struct rt_fd_list *)rt_malloc(sizeof(struct rt_fd_list));
  344. if (fdlist)
  345. {
  346. fdlist->fd = fd;
  347. memcpy(&fdlist->epev.data, &event->data, sizeof(event->data));
  348. fdlist->epev.events = event->events;
  349. fdlist->ep = ep;
  350. fdlist->req._proc = epoll_wqueue_add_callback;
  351. fdlist->next = ep->fdlist->next;
  352. fdlist->revents = event->events;
  353. ep->fdlist->next = fdlist;
  354. epoll_ctl_install(fdlist, ep);
  355. }
  356. else
  357. {
  358. ret = -ENOMEM;
  359. }
  360. }
  361. return ret;
  362. }
  363. static int epoll_ctl_del(struct dfs_file *df, int fd)
  364. {
  365. struct rt_fd_list *fdlist, *fre_fd;
  366. struct rt_eventpoll *ep = RT_NULL;
  367. struct rt_ready_list *rdlist, *fre_rdl;
  368. rt_err_t ret = -EINVAL;
  369. if (df->vnode->data)
  370. {
  371. ep = df->vnode->data;
  372. fdlist = ep->fdlist;
  373. while (fdlist->next != RT_NULL)
  374. {
  375. if (fdlist->next->fd == fd)
  376. {
  377. fre_fd = fdlist->next;
  378. fdlist->next = fdlist->next->next;
  379. if (fre_fd->epev.events != 0)
  380. {
  381. rt_wqueue_remove(&fre_fd->wqn);
  382. }
  383. rt_free(fre_fd);
  384. break;
  385. }
  386. else
  387. {
  388. fdlist = fdlist->next;
  389. }
  390. }
  391. if (ep->rdlist)
  392. {
  393. rdlist = ep->rdlist;
  394. while (rdlist->next != RT_NULL)
  395. {
  396. if (rdlist->next->rdl_event->fd == fd)
  397. {
  398. fre_rdl = rdlist->next;
  399. rdlist->next = rdlist->next->next;
  400. ep->eventpoll_num --;
  401. rt_free(fre_rdl);
  402. break;
  403. }
  404. else
  405. {
  406. rdlist = rdlist->next;
  407. }
  408. }
  409. }
  410. ret = 0;
  411. }
  412. return ret;
  413. }
  414. static int epoll_ctl_mod(struct dfs_file *df, int fd, struct epoll_event *event)
  415. {
  416. struct rt_fd_list *fdlist;
  417. struct rt_eventpoll *ep = RT_NULL;
  418. rt_err_t ret = -EINVAL;
  419. if (df->vnode->data)
  420. {
  421. ep = df->vnode->data;
  422. fdlist = ep->fdlist;
  423. while (fdlist->next != RT_NULL)
  424. {
  425. if (fdlist->next->fd == fd)
  426. {
  427. memcpy(&fdlist->next->epev.data, &event->data, sizeof(event->data));
  428. fdlist->next->revents = event->events;
  429. rt_wqueue_remove(&fdlist->next->wqn);
  430. epoll_ctl_install(fdlist->next, ep);
  431. break;
  432. }
  433. fdlist = fdlist->next;
  434. }
  435. ret = 0;
  436. }
  437. return ret;
  438. }
  439. static int epoll_do_ctl(int epfd, int op, int fd, struct epoll_event *event)
  440. {
  441. struct dfs_file *epdf;
  442. struct rt_eventpoll *ep;
  443. rt_err_t ret = 0;
  444. if (op & ~EFD_SHARED_EPOLL_TYPE)
  445. {
  446. rt_set_errno(EINVAL);
  447. return -1;
  448. }
  449. if ((epfd == fd) || (epfd < 0))
  450. {
  451. rt_set_errno(EINVAL);
  452. return -1;
  453. }
  454. if (!(event->events & EPOLLEXCLUSIVE_BITS))
  455. {
  456. rt_set_errno(EINVAL);
  457. return -1;
  458. }
  459. if (!fd_get(fd))
  460. {
  461. rt_set_errno(EBADF);
  462. return -1;
  463. }
  464. epdf = fd_get(epfd);
  465. if (epdf->vnode->data)
  466. {
  467. ep = epdf->vnode->data;
  468. event->events |= EPOLLERR | EPOLLHUP;
  469. rt_mutex_take(&ep->lock, RT_WAITING_FOREVER);
  470. switch (op)
  471. {
  472. case EPOLL_CTL_ADD:
  473. ret = epoll_ctl_add(epdf, fd, event);
  474. break;
  475. case EPOLL_CTL_DEL:
  476. ret = epoll_ctl_del(epdf, fd);
  477. break;
  478. case EPOLL_CTL_MOD:
  479. ret = epoll_ctl_mod(epdf, fd, event);
  480. break;
  481. default:
  482. rt_set_errno(EINVAL);
  483. break;
  484. }
  485. if (ret < 0)
  486. {
  487. rt_set_errno(-ret);
  488. ret = -1;
  489. }
  490. else
  491. {
  492. ep->polling_thread = rt_thread_self();
  493. }
  494. rt_mutex_release(&ep->lock);
  495. }
  496. return ret;
  497. }
  498. static int epoll_wait_timeout(struct rt_eventpoll *ep, int msec)
  499. {
  500. rt_int32_t timeout;
  501. struct rt_thread *thread;
  502. rt_base_t level;
  503. int ret = 0;
  504. thread = ep->polling_thread;
  505. timeout = rt_tick_from_millisecond(msec);
  506. level = rt_spin_lock_irqsave(&spinlock);
  507. if (timeout != 0 && !ep->tirggered)
  508. {
  509. if (rt_thread_suspend_with_flag(thread, RT_KILLABLE) == RT_EOK)
  510. {
  511. if (timeout > 0)
  512. {
  513. rt_timer_control(&(thread->thread_timer),
  514. RT_TIMER_CTRL_SET_TIME,
  515. &timeout);
  516. rt_timer_start(&(thread->thread_timer));
  517. }
  518. rt_spin_unlock_irqrestore(&spinlock, level);
  519. rt_schedule();
  520. level = rt_spin_lock_irqsave(&spinlock);
  521. }
  522. }
  523. ret = !ep->tirggered;
  524. rt_spin_unlock_irqrestore(&spinlock, level);
  525. return ret;
  526. }
  527. static int epoll_get_event(struct rt_fd_list *fl, rt_pollreq_t *req)
  528. {
  529. struct dfs_file *df;
  530. int mask = 0;
  531. int fd = 0;
  532. fd = fl->fd;
  533. if (fd >= 0)
  534. {
  535. df = fd_get(fd);
  536. if (df)
  537. {
  538. if (df->vnode->fops->poll)
  539. {
  540. req->_key = fl->revents | POLLERR | POLLHUP;
  541. mask = df->vnode->fops->poll(df, req);
  542. if (mask < 0)
  543. return mask;
  544. }
  545. mask &= fl->revents | EPOLLOUT | POLLERR;
  546. }
  547. }
  548. return mask;
  549. }
  550. static int epoll_do(struct rt_eventpoll *ep, struct epoll_event *events, int maxevents, int timeout)
  551. {
  552. struct rt_ready_list *rdlist, *pre_rdlist;
  553. int event_num = 0;
  554. int istimeout = 0;
  555. int isn_add = 0;
  556. int isfree = 0;
  557. int mask = 0;
  558. while (1)
  559. {
  560. rt_mutex_take(&ep->lock, RT_WAITING_FOREVER);
  561. if (ep->eventpoll_num > 0)
  562. {
  563. rdlist = ep->rdlist;
  564. while (rdlist->next != RT_NULL)
  565. {
  566. isfree = 0;
  567. isn_add = 0;
  568. pre_rdlist = rdlist;
  569. rdlist = rdlist->next;
  570. if (event_num < maxevents)
  571. {
  572. rt_wqueue_remove(&rdlist->rdl_event->wqn);
  573. mask = epoll_get_event(rdlist->rdl_event, &rdlist->rdl_event->req);
  574. if (mask & rdlist->rdl_event->revents)
  575. {
  576. rdlist->rdl_event->epev.events = mask & rdlist->rdl_event->revents;
  577. }
  578. else
  579. {
  580. isfree = 1;
  581. isn_add = 1;
  582. }
  583. if (rdlist->rdl_event->revents & EPOLLONESHOT)
  584. {
  585. rdlist->rdl_event->revents = 0;
  586. isfree = 1;
  587. rt_wqueue_remove(&rdlist->rdl_event->wqn);
  588. }
  589. else
  590. {
  591. if (rdlist->rdl_event->revents & EPOLLET)
  592. {
  593. isfree = 1;
  594. }
  595. else
  596. {
  597. if (rdlist->exclusive != 1)
  598. {
  599. rdlist->exclusive = 1;
  600. }
  601. }
  602. }
  603. if (!isn_add)
  604. {
  605. memcpy(&events[event_num], &rdlist->rdl_event->epev, sizeof(rdlist->rdl_event->epev));
  606. event_num ++;
  607. }
  608. if (isfree)
  609. {
  610. pre_rdlist->next = rdlist->next;
  611. rt_free(rdlist);
  612. ep->eventpoll_num --;
  613. rdlist = pre_rdlist;
  614. }
  615. }
  616. else
  617. {
  618. break;
  619. }
  620. }
  621. }
  622. rt_mutex_release(&ep->lock);
  623. if (event_num || istimeout)
  624. {
  625. ep->tirggered = 0;
  626. break;
  627. }
  628. if (epoll_wait_timeout(ep, timeout))
  629. {
  630. istimeout = 1;
  631. }
  632. }
  633. return event_num;
  634. }
  635. static int epoll_do_wait(int epfd, struct epoll_event *events, int maxevents, int timeout, const sigset_t *ss)
  636. {
  637. struct rt_eventpoll *ep;
  638. struct dfs_file *df;
  639. lwp_sigset_t old_sig, new_sig;
  640. rt_err_t ret = 0;
  641. if (ss)
  642. {
  643. memcpy(&new_sig, ss, sizeof(lwp_sigset_t));
  644. lwp_thread_signal_mask(rt_thread_self(), LWP_SIG_MASK_CMD_BLOCK, &new_sig, &old_sig);
  645. }
  646. if ((maxevents > 0) && (epfd >=0))
  647. {
  648. df = fd_get(epfd);
  649. if (df && df->vnode)
  650. {
  651. ep = (struct rt_eventpoll *)df->vnode->data;
  652. if (ep)
  653. {
  654. ret = epoll_do(ep, events, maxevents, timeout);
  655. }
  656. }
  657. }
  658. if (ss)
  659. {
  660. lwp_thread_signal_mask(rt_thread_self(), LWP_SIG_MASK_CMD_SET_MASK, &old_sig, RT_NULL);
  661. }
  662. if (ret < 0)
  663. {
  664. rt_set_errno(-ret);
  665. ret = -1;
  666. }
  667. return ret;
  668. }
  669. int epoll_create(int size)
  670. {
  671. return epoll_do_create(size);
  672. }
  673. int epoll_ctl(int epfd, int op, int fd, struct epoll_event *event)
  674. {
  675. return epoll_do_ctl(epfd, op, fd, event);
  676. }
  677. int epoll_wait(int epfd, struct epoll_event *events, int maxevents, int timeout)
  678. {
  679. return epoll_do_wait(epfd, events, maxevents, timeout, RT_NULL);
  680. }
  681. int epoll_pwait(int epfd, struct epoll_event *events, int maxevents, int timeout, const sigset_t *ss)
  682. {
  683. return epoll_do_wait(epfd, events, maxevents, timeout, ss);
  684. }
  685. int epoll_pwait2(int epfd, struct epoll_event *events, int maxevents, int timeout, const sigset_t *ss)
  686. {
  687. return epoll_do_wait(epfd, events, maxevents, timeout, ss);
  688. }