BReactor.c 29 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042
  1. /**
  2. * @file BReactor.c
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * This file is part of BadVPN.
  8. *
  9. * BadVPN is free software: you can redistribute it and/or modify
  10. * it under the terms of the GNU General Public License version 2
  11. * as published by the Free Software Foundation.
  12. *
  13. * BadVPN is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License along
  19. * with this program; if not, write to the Free Software Foundation, Inc.,
  20. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  21. */
  22. #include <stdlib.h>
  23. #include <string.h>
  24. #include <stdio.h>
  25. #include <stddef.h>
  26. #ifdef BADVPN_USE_WINAPI
  27. #include <windows.h>
  28. #else
  29. #include <limits.h>
  30. #include <sys/types.h>
  31. #include <errno.h>
  32. #include <unistd.h>
  33. #endif
  34. #include <misc/overflow.h>
  35. #include <misc/debug.h>
  36. #include <misc/offset.h>
  37. #include <system/BLog.h>
  38. #include <system/BReactor.h>
  39. #include <generated/blog_channel_BReactor.h>
  40. #define KEVENT_TAG_FD 1
  41. #define KEVENT_TAG_KEVENT 2
  42. static int timer_comparator (void *user, btime_t *val1, btime_t *val2)
  43. {
  44. if (*val1 < *val2) {
  45. return -1;
  46. }
  47. if (*val1 > *val2) {
  48. return 1;
  49. }
  50. return 0;
  51. }
  52. static int move_expired_timers (BReactor *bsys, btime_t now)
  53. {
  54. int moved = 0;
  55. // move timed out timers to the expired list
  56. BHeapNode *heap_node;
  57. while (heap_node = BHeap_GetFirst(&bsys->timers_heap)) {
  58. BTimer *timer = UPPER_OBJECT(heap_node, BTimer, heap_node);
  59. ASSERT(timer->active)
  60. // if it's in the future, stop
  61. if (timer->absTime > now) {
  62. break;
  63. }
  64. moved = 1;
  65. // remove from running timers heap
  66. BHeap_Remove(&bsys->timers_heap, &timer->heap_node);
  67. // add to expired timers list
  68. LinkedList1_Append(&bsys->timers_expired_list, &timer->list_node);
  69. // set expired
  70. timer->expired = 1;
  71. }
  72. return moved;
  73. }
  74. static void move_first_timers (BReactor *bsys)
  75. {
  76. // get the time of the first timer
  77. BHeapNode *heap_node = BHeap_GetFirst(&bsys->timers_heap);
  78. ASSERT(heap_node)
  79. BTimer *first_timer = UPPER_OBJECT(heap_node, BTimer, heap_node);
  80. ASSERT(first_timer->active)
  81. btime_t first_time = first_timer->absTime;
  82. // remove from running timers heap
  83. BHeap_Remove(&bsys->timers_heap, &first_timer->heap_node);
  84. // add to expired timers list
  85. LinkedList1_Append(&bsys->timers_expired_list, &first_timer->list_node);
  86. // set expired
  87. first_timer->expired = 1;
  88. // also move other timers with the same timeout
  89. while (heap_node = BHeap_GetFirst(&bsys->timers_heap)) {
  90. BTimer *timer = UPPER_OBJECT(heap_node, BTimer, heap_node);
  91. ASSERT(timer->active)
  92. ASSERT(timer->absTime >= first_time)
  93. // if it's in the future, stop
  94. if (timer->absTime > first_time) {
  95. break;
  96. }
  97. // remove from running timers heap
  98. BHeap_Remove(&bsys->timers_heap, &timer->heap_node);
  99. // add to expired timers list
  100. LinkedList1_Append(&bsys->timers_expired_list, &timer->list_node);
  101. // set expired
  102. timer->expired = 1;
  103. }
  104. }
  105. #ifdef BADVPN_USE_EPOLL
  106. static void set_epoll_fd_pointers (BReactor *bsys)
  107. {
  108. // Write pointers to our entry pointers into file descriptors.
  109. // If a handler function frees some other file descriptor, the
  110. // free routine will set our pointer to NULL so we don't dispatch it.
  111. for (int i = 0; i < bsys->epoll_results_num; i++) {
  112. struct epoll_event *event = &bsys->epoll_results[i];
  113. ASSERT(event->data.ptr)
  114. BFileDescriptor *bfd = (BFileDescriptor *)event->data.ptr;
  115. ASSERT(bfd->active)
  116. ASSERT(!bfd->epoll_returned_ptr)
  117. bfd->epoll_returned_ptr = (BFileDescriptor **)&event->data.ptr;
  118. }
  119. }
  120. #endif
  121. #ifdef BADVPN_USE_KEVENT
  122. static void set_kevent_fd_pointers (BReactor *bsys)
  123. {
  124. for (int i = 0; i < bsys->kevent_results_num; i++) {
  125. struct kevent *event = &bsys->kevent_results[i];
  126. ASSERT(event->udata)
  127. int *tag = event->udata;
  128. switch (*tag) {
  129. case KEVENT_TAG_FD: {
  130. BFileDescriptor *bfd = UPPER_OBJECT(tag, BFileDescriptor, kevent_tag);
  131. ASSERT(bfd->active)
  132. ASSERT(!bfd->kevent_returned_ptr)
  133. bfd->kevent_returned_ptr = (int **)&event->udata;
  134. } break;
  135. case KEVENT_TAG_KEVENT: {
  136. BReactorKEvent *kev = UPPER_OBJECT(tag, BReactorKEvent, kevent_tag);
  137. ASSERT(kev->reactor == bsys)
  138. ASSERT(!kev->kevent_returned_ptr)
  139. kev->kevent_returned_ptr = (int **)&event->udata;
  140. } break;
  141. default:
  142. ASSERT(0);
  143. }
  144. }
  145. }
  146. static void update_kevent_fd_events (BReactor *bsys, BFileDescriptor *bs, int events)
  147. {
  148. struct kevent event;
  149. if (!(bs->waitEvents & BREACTOR_READ) && (events & BREACTOR_READ)) {
  150. memset(&event, 0, sizeof(event));
  151. event.ident = bs->fd;
  152. event.filter = EVFILT_READ;
  153. event.flags = EV_ADD;
  154. event.udata = &bs->kevent_tag;
  155. ASSERT_FORCE(kevent(bsys->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  156. }
  157. else if ((bs->waitEvents & BREACTOR_READ) && !(events & BREACTOR_READ)) {
  158. memset(&event, 0, sizeof(event));
  159. event.ident = bs->fd;
  160. event.filter = EVFILT_READ;
  161. event.flags = EV_DELETE;
  162. ASSERT_FORCE(kevent(bsys->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  163. }
  164. if (!(bs->waitEvents & BREACTOR_WRITE) && (events & BREACTOR_WRITE)) {
  165. memset(&event, 0, sizeof(event));
  166. event.ident = bs->fd;
  167. event.filter = EVFILT_WRITE;
  168. event.flags = EV_ADD;
  169. event.udata = &bs->kevent_tag;
  170. ASSERT_FORCE(kevent(bsys->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  171. }
  172. else if ((bs->waitEvents & BREACTOR_WRITE) && !(events & BREACTOR_WRITE)) {
  173. memset(&event, 0, sizeof(event));
  174. event.ident = bs->fd;
  175. event.filter = EVFILT_WRITE;
  176. event.flags = EV_DELETE;
  177. ASSERT_FORCE(kevent(bsys->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  178. }
  179. }
  180. #endif
  181. static void wait_for_events (BReactor *bsys)
  182. {
  183. // must have processed all pending events
  184. ASSERT(!BPendingGroup_HasJobs(&bsys->pending_jobs))
  185. ASSERT(LinkedList1_IsEmpty(&bsys->timers_expired_list))
  186. #ifdef BADVPN_USE_WINAPI
  187. ASSERT(!bsys->returned_object)
  188. #endif
  189. #ifdef BADVPN_USE_EPOLL
  190. ASSERT(bsys->epoll_results_pos == bsys->epoll_results_num)
  191. #endif
  192. #ifdef BADVPN_USE_KEVENT
  193. ASSERT(bsys->kevent_results_pos == bsys->kevent_results_num)
  194. #endif
  195. // clean up epoll results
  196. #ifdef BADVPN_USE_EPOLL
  197. bsys->epoll_results_num = 0;
  198. bsys->epoll_results_pos = 0;
  199. #endif
  200. // clean up kevent results
  201. #ifdef BADVPN_USE_KEVENT
  202. bsys->kevent_results_num = 0;
  203. bsys->kevent_results_pos = 0;
  204. #endif
  205. // timeout vars
  206. int have_timeout = 0;
  207. btime_t timeout_abs;
  208. btime_t now;
  209. // compute timeout
  210. BHeapNode *first_node;
  211. if (first_node = BHeap_GetFirst(&bsys->timers_heap)) {
  212. // get current time
  213. now = btime_gettime();
  214. // if some timers have already timed out, return them immediately
  215. if (move_expired_timers(bsys, now)) {
  216. BLog(BLOG_DEBUG, "Got already expired timers");
  217. return;
  218. }
  219. // timeout is first timer, remember absolute time
  220. BTimer *first_timer = UPPER_OBJECT(first_node, BTimer, heap_node);
  221. have_timeout = 1;
  222. timeout_abs = first_timer->absTime;
  223. }
  224. // wait until the timeout is reached or the file descriptor / handle in ready
  225. while (1) {
  226. // compute timeout
  227. btime_t timeout_rel;
  228. btime_t timeout_rel_trunc;
  229. if (have_timeout) {
  230. timeout_rel = timeout_abs - now;
  231. timeout_rel_trunc = timeout_rel;
  232. }
  233. // perform wait
  234. #ifdef BADVPN_USE_WINAPI
  235. if (have_timeout) {
  236. if (timeout_rel_trunc > INFINITE - 1) {
  237. timeout_rel_trunc = INFINITE - 1;
  238. }
  239. }
  240. BLog(BLOG_DEBUG, "Calling WaitForMultipleObjects on %d handles", bsys->enabled_num);
  241. DWORD waitres = WaitForMultipleObjects(bsys->enabled_num, bsys->enabled_handles, FALSE, (have_timeout ? timeout_rel_trunc : INFINITE));
  242. ASSERT_FORCE(waitres != WAIT_FAILED)
  243. ASSERT_FORCE(!(waitres == WAIT_TIMEOUT) || have_timeout)
  244. ASSERT_FORCE(!(waitres != WAIT_TIMEOUT) || (waitres >= WAIT_OBJECT_0 && waitres < WAIT_OBJECT_0 + bsys->enabled_num))
  245. if (waitres != WAIT_TIMEOUT || timeout_rel_trunc == timeout_rel) {
  246. if (waitres != WAIT_TIMEOUT) {
  247. int handle_index = waitres - WAIT_OBJECT_0;
  248. BLog(BLOG_DEBUG, "WaitForMultipleObjects returned handle %d", handle_index);
  249. bsys->returned_object = bsys->enabled_objects[handle_index];
  250. } else {
  251. BLog(BLOG_DEBUG, "WaitForMultipleObjects timed out");
  252. move_first_timers(bsys);
  253. }
  254. break;
  255. }
  256. #endif
  257. #ifdef BADVPN_USE_EPOLL
  258. if (have_timeout) {
  259. if (timeout_rel_trunc > INT_MAX) {
  260. timeout_rel_trunc = INT_MAX;
  261. }
  262. }
  263. BLog(BLOG_DEBUG, "Calling epoll_wait");
  264. int waitres = epoll_wait(bsys->efd, bsys->epoll_results, BSYSTEM_MAX_RESULTS, (have_timeout ? timeout_rel_trunc : -1));
  265. if (waitres < 0) {
  266. int error = errno;
  267. if (error == EINTR) {
  268. BLog(BLOG_DEBUG, "epoll_wait interrupted");
  269. goto try_again;
  270. }
  271. perror("epoll_wait");
  272. ASSERT_FORCE(0)
  273. }
  274. ASSERT_FORCE(!(waitres == 0) || have_timeout)
  275. ASSERT_FORCE(waitres <= BSYSTEM_MAX_RESULTS)
  276. if (waitres != 0 || timeout_rel_trunc == timeout_rel) {
  277. if (waitres != 0) {
  278. BLog(BLOG_DEBUG, "epoll_wait returned %d file descriptors", waitres);
  279. bsys->epoll_results_num = waitres;
  280. set_epoll_fd_pointers(bsys);
  281. } else {
  282. BLog(BLOG_DEBUG, "epoll_wait timed out");
  283. move_first_timers(bsys);
  284. }
  285. break;
  286. }
  287. #endif
  288. #ifdef BADVPN_USE_KEVENT
  289. struct timespec ts;
  290. if (have_timeout) {
  291. if (timeout_rel_trunc > 86400000) {
  292. timeout_rel_trunc = 86400000;
  293. }
  294. ts.tv_sec = timeout_rel_trunc / 1000;
  295. ts.tv_nsec = (timeout_rel_trunc % 1000) * 1000000;
  296. }
  297. BLog(BLOG_DEBUG, "Calling kevent");
  298. int waitres = kevent(bsys->kqueue_fd, NULL, 0, bsys->kevent_results, BSYSTEM_MAX_RESULTS, (have_timeout ? &ts : NULL));
  299. if (waitres < 0) {
  300. int error = errno;
  301. if (error == EINTR) {
  302. BLog(BLOG_DEBUG, "kevent interrupted");
  303. goto try_again;
  304. }
  305. perror("kevent");
  306. ASSERT_FORCE(0)
  307. }
  308. ASSERT_FORCE(!(waitres == 0) || have_timeout)
  309. ASSERT_FORCE(waitres <= BSYSTEM_MAX_RESULTS)
  310. if (waitres != 0 || timeout_rel_trunc == timeout_rel) {
  311. if (waitres != 0) {
  312. BLog(BLOG_DEBUG, "kevent returned %d events", waitres);
  313. bsys->kevent_results_num = waitres;
  314. set_kevent_fd_pointers(bsys);
  315. } else {
  316. BLog(BLOG_DEBUG, "kevent timed out");
  317. move_first_timers(bsys);
  318. }
  319. break;
  320. }
  321. #endif
  322. try_again:
  323. if (have_timeout) {
  324. // get current time
  325. now = btime_gettime();
  326. // check if we already reached the time we're waiting for
  327. if (now >= timeout_abs) {
  328. BLog(BLOG_DEBUG, "already timed out while trying again");
  329. move_first_timers(bsys);
  330. break;
  331. }
  332. }
  333. }
  334. }
  335. #ifdef BADVPN_USE_WINAPI
  336. void BHandle_Init (BHandle *bh, HANDLE handle, BHandle_handler handler, void *user)
  337. {
  338. bh->h = handle;
  339. bh->handler = handler;
  340. bh->user = user;
  341. bh->active = 0;
  342. }
  343. #else
  344. void BFileDescriptor_Init (BFileDescriptor *bs, int fd, BFileDescriptor_handler handler, void *user)
  345. {
  346. bs->fd = fd;
  347. bs->handler = handler;
  348. bs->user = user;
  349. bs->active = 0;
  350. }
  351. #endif
  352. void BTimer_Init (BTimer *bt, btime_t msTime, BTimer_handler handler, void *handler_pointer)
  353. {
  354. bt->msTime = msTime;
  355. bt->handler = handler;
  356. bt->handler_pointer = handler_pointer;
  357. bt->active = 0;
  358. }
  359. int BTimer_IsRunning (BTimer *bt)
  360. {
  361. ASSERT(bt->active == 0 || bt->active == 1)
  362. return bt->active;
  363. }
  364. int BReactor_Init (BReactor *bsys)
  365. {
  366. BLog(BLOG_DEBUG, "Reactor initializing");
  367. bsys->exiting = 0;
  368. // init jobs
  369. BPendingGroup_Init(&bsys->pending_jobs);
  370. // init timers
  371. BHeap_Init(&bsys->timers_heap, OFFSET_DIFF(BTimer, absTime, heap_node), (BHeap_comparator)timer_comparator, NULL);
  372. LinkedList1_Init(&bsys->timers_expired_list);
  373. #ifdef BADVPN_USE_WINAPI
  374. bsys->num_handles = 0;
  375. bsys->enabled_num = 0;
  376. bsys->returned_object = NULL;
  377. #endif
  378. #ifdef BADVPN_USE_EPOLL
  379. // create epoll fd
  380. if ((bsys->efd = epoll_create(10)) < 0) {
  381. BLog(BLOG_ERROR, "epoll_create failed");
  382. goto fail0;
  383. }
  384. // init results array
  385. bsys->epoll_results_num = 0;
  386. bsys->epoll_results_pos = 0;
  387. #endif
  388. #ifdef BADVPN_USE_KEVENT
  389. // create kqueue fd
  390. if ((bsys->kqueue_fd = kqueue()) < 0) {
  391. BLog(BLOG_ERROR, "kqueue failed");
  392. goto fail0;
  393. }
  394. // init results array
  395. bsys->kevent_results_num = 0;
  396. bsys->kevent_results_pos = 0;
  397. #endif
  398. DebugObject_Init(&bsys->d_obj);
  399. #ifndef BADVPN_USE_WINAPI
  400. DebugCounter_Init(&bsys->d_fds_counter);
  401. #endif
  402. #ifdef BADVPN_USE_KEVENT
  403. DebugCounter_Init(&bsys->d_kevent_ctr);
  404. #endif
  405. return 1;
  406. fail0:
  407. BPendingGroup_Free(&bsys->pending_jobs);
  408. BLog(BLOG_ERROR, "Reactor failed to initialize");
  409. return 0;
  410. }
  411. void BReactor_Free (BReactor *bsys)
  412. {
  413. // {pending group has no BPending objects}
  414. ASSERT(!BPendingGroup_HasJobs(&bsys->pending_jobs))
  415. ASSERT(!BHeap_GetFirst(&bsys->timers_heap))
  416. ASSERT(LinkedList1_IsEmpty(&bsys->timers_expired_list))
  417. #ifdef BADVPN_USE_WINAPI
  418. ASSERT(bsys->num_handles == 0)
  419. #endif
  420. DebugObject_Free(&bsys->d_obj);
  421. #ifndef BADVPN_USE_WINAPI
  422. DebugCounter_Free(&bsys->d_fds_counter);
  423. #endif
  424. #ifdef BADVPN_USE_KEVENT
  425. DebugCounter_Free(&bsys->d_kevent_ctr);
  426. #endif
  427. BLog(BLOG_DEBUG, "Reactor freeing");
  428. #ifdef BADVPN_USE_EPOLL
  429. // close epoll fd
  430. ASSERT_FORCE(close(bsys->efd) == 0)
  431. #endif
  432. #ifdef BADVPN_USE_KEVENT
  433. // close kqueue fd
  434. ASSERT_FORCE(close(bsys->kqueue_fd) == 0)
  435. #endif
  436. // free jobs
  437. BPendingGroup_Free(&bsys->pending_jobs);
  438. }
  439. int BReactor_Exec (BReactor *bsys)
  440. {
  441. BLog(BLOG_DEBUG, "Entering event loop");
  442. while (!bsys->exiting) {
  443. // dispatch job
  444. if (BPendingGroup_HasJobs(&bsys->pending_jobs)) {
  445. BPendingGroup_ExecuteJob(&bsys->pending_jobs);
  446. continue;
  447. }
  448. // dispatch timer
  449. LinkedList1Node *list_node = LinkedList1_GetFirst(&bsys->timers_expired_list);
  450. if (list_node) {
  451. BTimer *timer = UPPER_OBJECT(list_node, BTimer, list_node);
  452. ASSERT(timer->active)
  453. ASSERT(timer->expired)
  454. // remove from expired list
  455. LinkedList1_Remove(&bsys->timers_expired_list, &timer->list_node);
  456. // set inactive
  457. timer->active = 0;
  458. // call handler
  459. BLog(BLOG_DEBUG, "Dispatching timer");
  460. timer->handler(timer->handler_pointer);
  461. continue;
  462. }
  463. #ifdef BADVPN_USE_WINAPI
  464. // dispatch handle
  465. if (bsys->returned_object) {
  466. BHandle *bh = bsys->returned_object;
  467. bsys->returned_object = NULL;
  468. ASSERT(bh->active)
  469. ASSERT(bh->position >= 0 && bh->position < bsys->enabled_num)
  470. ASSERT(bh == bsys->enabled_objects[bh->position])
  471. ASSERT(bh->h == bsys->enabled_handles[bh->position])
  472. // call handler
  473. BLog(BLOG_DEBUG, "Dispatching handle");
  474. bh->handler(bh->user);
  475. continue;
  476. }
  477. #endif
  478. #ifdef BADVPN_USE_EPOLL
  479. // dispatch file descriptor
  480. if (bsys->epoll_results_pos < bsys->epoll_results_num) {
  481. // grab event
  482. struct epoll_event *event = &bsys->epoll_results[bsys->epoll_results_pos];
  483. bsys->epoll_results_pos++;
  484. // check if the BFileDescriptor was removed
  485. if (!event->data.ptr) {
  486. continue;
  487. }
  488. // get BFileDescriptor
  489. BFileDescriptor *bfd = (BFileDescriptor *)event->data.ptr;
  490. ASSERT(bfd->active)
  491. ASSERT(bfd->epoll_returned_ptr == (BFileDescriptor **)&event->data.ptr)
  492. // zero pointer to the epoll entry
  493. bfd->epoll_returned_ptr = NULL;
  494. // calculate events to report
  495. int events = 0;
  496. if ((bfd->waitEvents&BREACTOR_READ) && (event->events&EPOLLIN)) {
  497. events |= BREACTOR_READ;
  498. }
  499. if ((bfd->waitEvents&BREACTOR_WRITE) && (event->events&EPOLLOUT)) {
  500. events |= BREACTOR_WRITE;
  501. }
  502. if ((event->events&EPOLLERR) || (event->events&EPOLLHUP)) {
  503. events |= BREACTOR_ERROR;
  504. }
  505. if (!events) {
  506. BLog(BLOG_ERROR, "no events detected?");
  507. continue;
  508. }
  509. // call handler
  510. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  511. bfd->handler(bfd->user, events);
  512. continue;
  513. }
  514. #endif
  515. #ifdef BADVPN_USE_KEVENT
  516. // dispatch kevent
  517. if (bsys->kevent_results_pos < bsys->kevent_results_num) {
  518. // grab event
  519. struct kevent *event = &bsys->kevent_results[bsys->kevent_results_pos];
  520. bsys->kevent_results_pos++;
  521. // check if the event was removed
  522. if (!event->udata) {
  523. continue;
  524. }
  525. // check tag
  526. int *tag = event->udata;
  527. switch (*tag) {
  528. case KEVENT_TAG_FD: {
  529. // get BFileDescriptor
  530. BFileDescriptor *bfd = UPPER_OBJECT(tag, BFileDescriptor, kevent_tag);
  531. ASSERT(bfd->active)
  532. ASSERT(bfd->kevent_returned_ptr == (int **)&event->udata)
  533. // zero pointer to the kevent entry
  534. bfd->kevent_returned_ptr = NULL;
  535. // calculate event to report
  536. int events = 0;
  537. if ((bfd->waitEvents&BREACTOR_READ) && event->filter == EVFILT_READ) {
  538. events |= BREACTOR_READ;
  539. }
  540. if ((bfd->waitEvents&BREACTOR_WRITE) && event->filter == EVFILT_WRITE) {
  541. events |= BREACTOR_WRITE;
  542. }
  543. if (!events) {
  544. BLog(BLOG_ERROR, "no events detected?");
  545. continue;
  546. }
  547. // call handler
  548. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  549. bfd->handler(bfd->user, events);
  550. continue;
  551. } break;
  552. case KEVENT_TAG_KEVENT: {
  553. // get BReactorKEvent
  554. BReactorKEvent *kev = UPPER_OBJECT(tag, BReactorKEvent, kevent_tag);
  555. ASSERT(kev->reactor == bsys)
  556. ASSERT(kev->kevent_returned_ptr == (int **)&event->udata)
  557. // zero pointer to the kevent entry
  558. kev->kevent_returned_ptr = NULL;
  559. // call handler
  560. BLog(BLOG_DEBUG, "Dispatching kevent");
  561. kev->handler(kev->user, event->fflags, event->data);
  562. continue;
  563. } break;
  564. default:
  565. ASSERT(0);
  566. }
  567. }
  568. #endif
  569. wait_for_events(bsys);
  570. }
  571. BLog(BLOG_DEBUG, "Exiting event loop, exit code %d", bsys->exit_code);
  572. return bsys->exit_code;
  573. }
  574. void BReactor_Quit (BReactor *bsys, int code)
  575. {
  576. bsys->exiting = 1;
  577. bsys->exit_code = code;
  578. }
  579. void BReactor_SetTimer (BReactor *bsys, BTimer *bt)
  580. {
  581. BReactor_SetTimerAfter(bsys, bt, bt->msTime);
  582. }
  583. void BReactor_SetTimerAfter (BReactor *bsys, BTimer *bt, btime_t after)
  584. {
  585. btime_t now = btime_gettime();
  586. // handle overflow
  587. int overflows = add_int64_overflows(now, after);
  588. btime_t absTime;
  589. if (overflows != 0) {
  590. if (overflows > 0) {
  591. absTime = INT64_MAX;
  592. } else {
  593. absTime = INT64_MIN;
  594. }
  595. } else {
  596. absTime = now + after;
  597. }
  598. BReactor_SetTimerAbsolute(bsys, bt, absTime);
  599. }
  600. void BReactor_SetTimerAbsolute (BReactor *bsys, BTimer *bt, btime_t time)
  601. {
  602. // unlink it if it's already in the list
  603. BReactor_RemoveTimer(bsys, bt);
  604. // initialize timer
  605. bt->active = 1;
  606. bt->expired = 0;
  607. bt->absTime = time;
  608. // insert to running timers heap
  609. BHeap_Insert(&bsys->timers_heap, &bt->heap_node);
  610. }
  611. void BReactor_RemoveTimer (BReactor *bsys, BTimer *bt)
  612. {
  613. if (!bt->active) {
  614. return;
  615. }
  616. if (bt->expired) {
  617. // remove from expired list
  618. LinkedList1_Remove(&bsys->timers_expired_list, &bt->list_node);
  619. } else {
  620. // remove from running heap
  621. BHeap_Remove(&bsys->timers_heap, &bt->heap_node);
  622. }
  623. // set inactive
  624. bt->active = 0;
  625. }
  626. BPendingGroup * BReactor_PendingGroup (BReactor *bsys)
  627. {
  628. return &bsys->pending_jobs;
  629. }
  630. int BReactor_Synchronize (BReactor *bsys, BPending *ref)
  631. {
  632. ASSERT(ref)
  633. while (!bsys->exiting) {
  634. ASSERT(BPendingGroup_HasJobs(&bsys->pending_jobs))
  635. if (BPendingGroup_PeekJob(&bsys->pending_jobs) == ref) {
  636. return 1;
  637. }
  638. BPendingGroup_ExecuteJob(&bsys->pending_jobs);
  639. }
  640. return 0;
  641. }
  642. #ifdef BADVPN_USE_WINAPI
  643. int BReactor_AddHandle (BReactor *bsys, BHandle *bh)
  644. {
  645. ASSERT(!bh->active)
  646. if (bsys->num_handles >= BSYSTEM_MAX_HANDLES) {
  647. return 0;
  648. }
  649. bh->active = 1;
  650. bh->position = -1;
  651. bsys->num_handles++;
  652. return 1;
  653. }
  654. void BReactor_RemoveHandle (BReactor *bsys, BHandle *bh)
  655. {
  656. ASSERT(bh->active)
  657. if (bh->position >= 0) {
  658. BReactor_DisableHandle(bsys, bh);
  659. }
  660. bh->active = 0;
  661. ASSERT(bsys->num_handles > 0)
  662. bsys->num_handles--;
  663. }
  664. void BReactor_EnableHandle (BReactor *bsys, BHandle *bh)
  665. {
  666. ASSERT(bh->active)
  667. ASSERT(bh->position == -1)
  668. ASSERT(bsys->enabled_num < BSYSTEM_MAX_HANDLES)
  669. bsys->enabled_handles[bsys->enabled_num] = bh->h;
  670. bsys->enabled_objects[bsys->enabled_num] = bh;
  671. bh->position = bsys->enabled_num;
  672. bsys->enabled_num++;
  673. }
  674. void BReactor_DisableHandle (BReactor *bsys, BHandle *bh)
  675. {
  676. ASSERT(bh->active)
  677. ASSERT(bh->position >= 0)
  678. ASSERT(bh->position < bsys->enabled_num)
  679. ASSERT(bh == bsys->enabled_objects[bh->position])
  680. ASSERT(bh->h == bsys->enabled_handles[bh->position])
  681. // if there are more handles after this one, move the last
  682. // one into its position
  683. if (bh->position < bsys->enabled_num - 1) {
  684. int move_position = bsys->enabled_num - 1;
  685. BHandle *move_handle = bsys->enabled_objects[move_position];
  686. ASSERT(move_handle->active)
  687. ASSERT(move_handle->position == move_position)
  688. ASSERT(move_handle->h == bsys->enabled_handles[move_position])
  689. bsys->enabled_handles[bh->position] = move_handle->h;
  690. bsys->enabled_objects[bh->position] = move_handle;
  691. move_handle->position = bh->position;
  692. }
  693. bh->position = -1;
  694. bsys->enabled_num--;
  695. // make sure the handler will not be called
  696. if (bsys->returned_object == bh) {
  697. bsys->returned_object = NULL;
  698. }
  699. }
  700. #else
  701. int BReactor_AddFileDescriptor (BReactor *bsys, BFileDescriptor *bs)
  702. {
  703. ASSERT(!bs->active)
  704. #ifdef BADVPN_USE_EPOLL
  705. // add epoll entry
  706. struct epoll_event event;
  707. memset(&event, 0, sizeof(event));
  708. event.events = 0;
  709. event.data.ptr = bs;
  710. if (epoll_ctl(bsys->efd, EPOLL_CTL_ADD, bs->fd, &event) < 0) {
  711. int error = errno;
  712. BLog(BLOG_ERROR, "epoll_ctl failed: %d", error);
  713. return 0;
  714. }
  715. // set epoll returned pointer
  716. bs->epoll_returned_ptr = NULL;
  717. #endif
  718. #ifdef BADVPN_USE_KEVENT
  719. // set kevent tag
  720. bs->kevent_tag = KEVENT_TAG_FD;
  721. // set kevent returned pointer
  722. bs->kevent_returned_ptr = NULL;
  723. #endif
  724. bs->active = 1;
  725. bs->waitEvents = 0;
  726. DebugCounter_Increment(&bsys->d_fds_counter);
  727. return 1;
  728. }
  729. void BReactor_RemoveFileDescriptor (BReactor *bsys, BFileDescriptor *bs)
  730. {
  731. ASSERT(bs->active)
  732. DebugCounter_Decrement(&bsys->d_fds_counter);
  733. bs->active = 0;
  734. #ifdef BADVPN_USE_EPOLL
  735. // delete epoll entry
  736. ASSERT_FORCE(epoll_ctl(bsys->efd, EPOLL_CTL_DEL, bs->fd, NULL) == 0)
  737. // write through epoll returned pointer
  738. if (bs->epoll_returned_ptr) {
  739. *bs->epoll_returned_ptr = NULL;
  740. }
  741. #endif
  742. #ifdef BADVPN_USE_KEVENT
  743. // delete kevents
  744. update_kevent_fd_events(bsys, bs, 0);
  745. // write through kevent returned pointer
  746. if (bs->kevent_returned_ptr) {
  747. *bs->kevent_returned_ptr = NULL;
  748. }
  749. #endif
  750. }
  751. void BReactor_SetFileDescriptorEvents (BReactor *bsys, BFileDescriptor *bs, int events)
  752. {
  753. ASSERT(bs->active)
  754. ASSERT(!(events&~(BREACTOR_READ|BREACTOR_WRITE)))
  755. if (bs->waitEvents == events) {
  756. return;
  757. }
  758. #ifdef BADVPN_USE_EPOLL
  759. // calculate epoll events
  760. int eevents = 0;
  761. if ((events & BREACTOR_READ)) {
  762. eevents |= EPOLLIN;
  763. }
  764. if ((events & BREACTOR_WRITE)) {
  765. eevents |= EPOLLOUT;
  766. }
  767. // update epoll entry
  768. struct epoll_event event;
  769. memset(&event, 0, sizeof(event));
  770. event.events = eevents;
  771. event.data.ptr = bs;
  772. ASSERT_FORCE(epoll_ctl(bsys->efd, EPOLL_CTL_MOD, bs->fd, &event) == 0)
  773. #endif
  774. #ifdef BADVPN_USE_KEVENT
  775. update_kevent_fd_events(bsys, bs, events);
  776. #endif
  777. // update events
  778. bs->waitEvents = events;
  779. }
  780. #endif
  781. #ifdef BADVPN_USE_KEVENT
  782. int BReactorKEvent_Init (BReactorKEvent *o, BReactor *reactor, BReactorKEvent_handler handler, void *user, uintptr_t ident, short filter, u_int fflags, intptr_t data)
  783. {
  784. DebugObject_Access(&reactor->d_obj);
  785. // init arguments
  786. o->reactor = reactor;
  787. o->handler = handler;
  788. o->user = user;
  789. o->ident = ident;
  790. o->filter = filter;
  791. // add kevent
  792. struct kevent event;
  793. memset(&event, 0, sizeof(event));
  794. event.ident = o->ident;
  795. event.filter = o->filter;
  796. event.flags = EV_ADD;
  797. event.fflags = fflags;
  798. event.data = data;
  799. event.udata = &o->kevent_tag;
  800. if (kevent(o->reactor->kqueue_fd, &event, 1, NULL, 0, NULL) < 0) {
  801. return 0;
  802. }
  803. // set kevent tag
  804. o->kevent_tag = KEVENT_TAG_KEVENT;
  805. // set kevent returned pointer
  806. o->kevent_returned_ptr = NULL;
  807. DebugObject_Init(&o->d_obj);
  808. DebugCounter_Increment(&o->reactor->d_kevent_ctr);
  809. return 1;
  810. }
  811. void BReactorKEvent_Free (BReactorKEvent *o)
  812. {
  813. DebugObject_Free(&o->d_obj);
  814. DebugCounter_Decrement(&o->reactor->d_kevent_ctr);
  815. // write through kevent returned pointer
  816. if (o->kevent_returned_ptr) {
  817. *o->kevent_returned_ptr = NULL;
  818. }
  819. // delete kevent
  820. struct kevent event;
  821. memset(&event, 0, sizeof(event));
  822. event.ident = o->ident;
  823. event.filter = o->filter;
  824. event.flags = EV_DELETE;
  825. ASSERT_FORCE(kevent(o->reactor->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  826. }
  827. #endif