BReactor.c 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239
  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/debug.h>
  35. #include <misc/offset.h>
  36. #include <misc/balloc.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. #ifdef BADVPN_USE_POLL
  182. static void set_poll_fd_pointers (BReactor *bsys)
  183. {
  184. for (int i = 0; i < bsys->poll_results_num; i++) {
  185. BFileDescriptor *bfd = bsys->poll_results_bfds[i];
  186. ASSERT(bfd)
  187. ASSERT(bfd->active)
  188. ASSERT(bfd->poll_returned_index == -1)
  189. bfd->poll_returned_index = i;
  190. }
  191. }
  192. #endif
  193. static void wait_for_events (BReactor *bsys)
  194. {
  195. // must have processed all pending events
  196. ASSERT(!BPendingGroup_HasJobs(&bsys->pending_jobs))
  197. ASSERT(LinkedList1_IsEmpty(&bsys->timers_expired_list))
  198. #ifdef BADVPN_USE_WINAPI
  199. ASSERT(!bsys->returned_object)
  200. #endif
  201. #ifdef BADVPN_USE_EPOLL
  202. ASSERT(bsys->epoll_results_pos == bsys->epoll_results_num)
  203. #endif
  204. #ifdef BADVPN_USE_KEVENT
  205. ASSERT(bsys->kevent_results_pos == bsys->kevent_results_num)
  206. #endif
  207. #ifdef BADVPN_USE_POLL
  208. ASSERT(bsys->poll_results_pos == bsys->poll_results_num)
  209. #endif
  210. // clean up epoll results
  211. #ifdef BADVPN_USE_EPOLL
  212. bsys->epoll_results_num = 0;
  213. bsys->epoll_results_pos = 0;
  214. #endif
  215. // clean up kevent results
  216. #ifdef BADVPN_USE_KEVENT
  217. bsys->kevent_results_num = 0;
  218. bsys->kevent_results_pos = 0;
  219. #endif
  220. // clean up poll results
  221. #ifdef BADVPN_USE_POLL
  222. bsys->poll_results_num = 0;
  223. bsys->poll_results_pos = 0;
  224. #endif
  225. // timeout vars
  226. int have_timeout = 0;
  227. btime_t timeout_abs;
  228. btime_t now;
  229. // compute timeout
  230. BHeapNode *first_node;
  231. if (first_node = BHeap_GetFirst(&bsys->timers_heap)) {
  232. // get current time
  233. now = btime_gettime();
  234. // if some timers have already timed out, return them immediately
  235. if (move_expired_timers(bsys, now)) {
  236. BLog(BLOG_DEBUG, "Got already expired timers");
  237. return;
  238. }
  239. // timeout is first timer, remember absolute time
  240. BTimer *first_timer = UPPER_OBJECT(first_node, BTimer, heap_node);
  241. have_timeout = 1;
  242. timeout_abs = first_timer->absTime;
  243. }
  244. // wait until the timeout is reached or the file descriptor / handle in ready
  245. while (1) {
  246. // compute timeout
  247. btime_t timeout_rel;
  248. btime_t timeout_rel_trunc;
  249. if (have_timeout) {
  250. timeout_rel = timeout_abs - now;
  251. timeout_rel_trunc = timeout_rel;
  252. }
  253. // perform wait
  254. #ifdef BADVPN_USE_WINAPI
  255. if (have_timeout) {
  256. if (timeout_rel_trunc > INFINITE - 1) {
  257. timeout_rel_trunc = INFINITE - 1;
  258. }
  259. }
  260. BLog(BLOG_DEBUG, "Calling WaitForMultipleObjects on %d handles", bsys->enabled_num);
  261. DWORD waitres = WaitForMultipleObjects(bsys->enabled_num, bsys->enabled_handles, FALSE, (have_timeout ? timeout_rel_trunc : INFINITE));
  262. ASSERT_FORCE(waitres != WAIT_FAILED)
  263. ASSERT_FORCE(!(waitres == WAIT_TIMEOUT) || have_timeout)
  264. ASSERT_FORCE(!(waitres != WAIT_TIMEOUT) || (waitres >= WAIT_OBJECT_0 && waitres < WAIT_OBJECT_0 + bsys->enabled_num))
  265. if (waitres != WAIT_TIMEOUT || timeout_rel_trunc == timeout_rel) {
  266. if (waitres != WAIT_TIMEOUT) {
  267. int handle_index = waitres - WAIT_OBJECT_0;
  268. BLog(BLOG_DEBUG, "WaitForMultipleObjects returned handle %d", handle_index);
  269. bsys->returned_object = bsys->enabled_objects[handle_index];
  270. } else {
  271. BLog(BLOG_DEBUG, "WaitForMultipleObjects timed out");
  272. move_first_timers(bsys);
  273. }
  274. break;
  275. }
  276. #endif
  277. #ifdef BADVPN_USE_EPOLL
  278. if (have_timeout) {
  279. if (timeout_rel_trunc > INT_MAX) {
  280. timeout_rel_trunc = INT_MAX;
  281. }
  282. }
  283. BLog(BLOG_DEBUG, "Calling epoll_wait");
  284. int waitres = epoll_wait(bsys->efd, bsys->epoll_results, BSYSTEM_MAX_RESULTS, (have_timeout ? timeout_rel_trunc : -1));
  285. if (waitres < 0) {
  286. int error = errno;
  287. if (error == EINTR) {
  288. BLog(BLOG_DEBUG, "epoll_wait interrupted");
  289. goto try_again;
  290. }
  291. perror("epoll_wait");
  292. ASSERT_FORCE(0)
  293. }
  294. ASSERT_FORCE(!(waitres == 0) || have_timeout)
  295. ASSERT_FORCE(waitres <= BSYSTEM_MAX_RESULTS)
  296. if (waitres != 0 || timeout_rel_trunc == timeout_rel) {
  297. if (waitres != 0) {
  298. BLog(BLOG_DEBUG, "epoll_wait returned %d file descriptors", waitres);
  299. bsys->epoll_results_num = waitres;
  300. set_epoll_fd_pointers(bsys);
  301. } else {
  302. BLog(BLOG_DEBUG, "epoll_wait timed out");
  303. move_first_timers(bsys);
  304. }
  305. break;
  306. }
  307. #endif
  308. #ifdef BADVPN_USE_KEVENT
  309. struct timespec ts;
  310. if (have_timeout) {
  311. if (timeout_rel_trunc > 86400000) {
  312. timeout_rel_trunc = 86400000;
  313. }
  314. ts.tv_sec = timeout_rel_trunc / 1000;
  315. ts.tv_nsec = (timeout_rel_trunc % 1000) * 1000000;
  316. }
  317. BLog(BLOG_DEBUG, "Calling kevent");
  318. int waitres = kevent(bsys->kqueue_fd, NULL, 0, bsys->kevent_results, BSYSTEM_MAX_RESULTS, (have_timeout ? &ts : NULL));
  319. if (waitres < 0) {
  320. int error = errno;
  321. if (error == EINTR) {
  322. BLog(BLOG_DEBUG, "kevent interrupted");
  323. goto try_again;
  324. }
  325. perror("kevent");
  326. ASSERT_FORCE(0)
  327. }
  328. ASSERT_FORCE(!(waitres == 0) || have_timeout)
  329. ASSERT_FORCE(waitres <= BSYSTEM_MAX_RESULTS)
  330. if (waitres != 0 || timeout_rel_trunc == timeout_rel) {
  331. if (waitres != 0) {
  332. BLog(BLOG_DEBUG, "kevent returned %d events", waitres);
  333. bsys->kevent_results_num = waitres;
  334. set_kevent_fd_pointers(bsys);
  335. } else {
  336. BLog(BLOG_DEBUG, "kevent timed out");
  337. move_first_timers(bsys);
  338. }
  339. break;
  340. }
  341. #endif
  342. #ifdef BADVPN_USE_POLL
  343. if (have_timeout) {
  344. if (timeout_rel_trunc > INT_MAX) {
  345. timeout_rel_trunc = INT_MAX;
  346. }
  347. }
  348. ASSERT(bsys->poll_num_enabled_fds >= 0)
  349. ASSERT(bsys->poll_num_enabled_fds <= BSYSTEM_MAX_POLL_FDS)
  350. int num_fds = 0;
  351. LinkedList1Node *list_node = LinkedList1_GetFirst(&bsys->poll_enabled_fds_list);
  352. while (list_node) {
  353. BFileDescriptor *bfd = UPPER_OBJECT(list_node, BFileDescriptor, poll_enabled_fds_list_node);
  354. ASSERT(bfd->active)
  355. ASSERT(bfd->poll_returned_index == -1)
  356. // calculate poll events
  357. int pevents = 0;
  358. if ((bfd->waitEvents & BREACTOR_READ)) {
  359. pevents |= POLLIN;
  360. }
  361. if ((bfd->waitEvents & BREACTOR_WRITE)) {
  362. pevents |= POLLOUT;
  363. }
  364. // write pollfd entry
  365. struct pollfd *pfd = &bsys->poll_results_pollfds[num_fds];
  366. pfd->fd = bfd->fd;
  367. pfd->events = pevents;
  368. pfd->revents = 0;
  369. // write BFileDescriptor reference entry
  370. bsys->poll_results_bfds[num_fds] = bfd;
  371. // increment number of fds in array
  372. num_fds++;
  373. list_node = LinkedList1Node_Next(list_node);
  374. }
  375. BLog(BLOG_DEBUG, "Calling poll");
  376. int waitres = poll(bsys->poll_results_pollfds, num_fds, (have_timeout ? timeout_rel_trunc : -1));
  377. if (waitres < 0) {
  378. int error = errno;
  379. if (error == EINTR) {
  380. BLog(BLOG_DEBUG, "poll interrupted");
  381. goto try_again;
  382. }
  383. perror("poll");
  384. ASSERT_FORCE(0)
  385. }
  386. ASSERT_FORCE(!(waitres == 0) || have_timeout)
  387. if (waitres != 0 || timeout_rel_trunc == timeout_rel) {
  388. if (waitres != 0) {
  389. BLog(BLOG_DEBUG, "poll returned %d file descriptors", waitres);
  390. bsys->poll_results_num = num_fds;
  391. bsys->poll_results_pos = 0;
  392. set_poll_fd_pointers(bsys);
  393. } else {
  394. BLog(BLOG_DEBUG, "poll timed out");
  395. move_first_timers(bsys);
  396. }
  397. break;
  398. }
  399. #endif
  400. try_again:
  401. if (have_timeout) {
  402. // get current time
  403. now = btime_gettime();
  404. // check if we already reached the time we're waiting for
  405. if (now >= timeout_abs) {
  406. BLog(BLOG_DEBUG, "already timed out while trying again");
  407. move_first_timers(bsys);
  408. break;
  409. }
  410. }
  411. }
  412. }
  413. #ifdef BADVPN_USE_WINAPI
  414. void BHandle_Init (BHandle *bh, HANDLE handle, BHandle_handler handler, void *user)
  415. {
  416. bh->h = handle;
  417. bh->handler = handler;
  418. bh->user = user;
  419. bh->active = 0;
  420. }
  421. #else
  422. void BFileDescriptor_Init (BFileDescriptor *bs, int fd, BFileDescriptor_handler handler, void *user)
  423. {
  424. bs->fd = fd;
  425. bs->handler = handler;
  426. bs->user = user;
  427. bs->active = 0;
  428. }
  429. #endif
  430. void BTimer_Init (BTimer *bt, btime_t msTime, BTimer_handler handler, void *handler_pointer)
  431. {
  432. bt->msTime = msTime;
  433. bt->handler = handler;
  434. bt->handler_pointer = handler_pointer;
  435. bt->active = 0;
  436. }
  437. int BTimer_IsRunning (BTimer *bt)
  438. {
  439. ASSERT(bt->active == 0 || bt->active == 1)
  440. return bt->active;
  441. }
  442. int BReactor_Init (BReactor *bsys)
  443. {
  444. BLog(BLOG_DEBUG, "Reactor initializing");
  445. bsys->exiting = 0;
  446. // init jobs
  447. BPendingGroup_Init(&bsys->pending_jobs);
  448. // init timers
  449. BHeap_Init(&bsys->timers_heap, OFFSET_DIFF(BTimer, absTime, heap_node), (BHeap_comparator)timer_comparator, NULL);
  450. LinkedList1_Init(&bsys->timers_expired_list);
  451. #ifdef BADVPN_USE_WINAPI
  452. bsys->num_handles = 0;
  453. bsys->enabled_num = 0;
  454. bsys->returned_object = NULL;
  455. #endif
  456. #ifdef BADVPN_USE_EPOLL
  457. // create epoll fd
  458. if ((bsys->efd = epoll_create(10)) < 0) {
  459. BLog(BLOG_ERROR, "epoll_create failed");
  460. goto fail0;
  461. }
  462. // init results array
  463. bsys->epoll_results_num = 0;
  464. bsys->epoll_results_pos = 0;
  465. #endif
  466. #ifdef BADVPN_USE_KEVENT
  467. // create kqueue fd
  468. if ((bsys->kqueue_fd = kqueue()) < 0) {
  469. BLog(BLOG_ERROR, "kqueue failed");
  470. goto fail0;
  471. }
  472. // init results array
  473. bsys->kevent_results_num = 0;
  474. bsys->kevent_results_pos = 0;
  475. #endif
  476. #ifdef BADVPN_USE_POLL
  477. // init enabled fds list
  478. LinkedList1_Init(&bsys->poll_enabled_fds_list);
  479. // set zero enabled fds
  480. bsys->poll_num_enabled_fds = 0;
  481. // allocate results arrays
  482. if (!(bsys->poll_results_pollfds = BAllocArray(BSYSTEM_MAX_POLL_FDS, sizeof(bsys->poll_results_pollfds[0])))) {
  483. BLog(BLOG_ERROR, "BAllocArray failed");
  484. goto fail0;
  485. }
  486. if (!(bsys->poll_results_bfds = BAllocArray(BSYSTEM_MAX_POLL_FDS, sizeof(bsys->poll_results_bfds[0])))) {
  487. BLog(BLOG_ERROR, "BAllocArray failed");
  488. goto fail1;
  489. }
  490. // init results array
  491. bsys->poll_results_num = 0;
  492. bsys->poll_results_pos = 0;
  493. #endif
  494. DebugObject_Init(&bsys->d_obj);
  495. #ifndef BADVPN_USE_WINAPI
  496. DebugCounter_Init(&bsys->d_fds_counter);
  497. #endif
  498. #ifdef BADVPN_USE_KEVENT
  499. DebugCounter_Init(&bsys->d_kevent_ctr);
  500. #endif
  501. return 1;
  502. #ifdef BADVPN_USE_POLL
  503. fail1:
  504. BFree(bsys->poll_results_pollfds);
  505. #endif
  506. fail0:
  507. BPendingGroup_Free(&bsys->pending_jobs);
  508. BLog(BLOG_ERROR, "Reactor failed to initialize");
  509. return 0;
  510. }
  511. void BReactor_Free (BReactor *bsys)
  512. {
  513. // {pending group has no BPending objects}
  514. ASSERT(!BPendingGroup_HasJobs(&bsys->pending_jobs))
  515. ASSERT(!BHeap_GetFirst(&bsys->timers_heap))
  516. ASSERT(LinkedList1_IsEmpty(&bsys->timers_expired_list))
  517. #ifdef BADVPN_USE_WINAPI
  518. ASSERT(bsys->num_handles == 0)
  519. #endif
  520. DebugObject_Free(&bsys->d_obj);
  521. #ifndef BADVPN_USE_WINAPI
  522. DebugCounter_Free(&bsys->d_fds_counter);
  523. #endif
  524. #ifdef BADVPN_USE_KEVENT
  525. DebugCounter_Free(&bsys->d_kevent_ctr);
  526. #endif
  527. #ifdef BADVPN_USE_POLL
  528. ASSERT(bsys->poll_num_enabled_fds == 0)
  529. ASSERT(LinkedList1_IsEmpty(&bsys->poll_enabled_fds_list))
  530. #endif
  531. BLog(BLOG_DEBUG, "Reactor freeing");
  532. #ifdef BADVPN_USE_EPOLL
  533. // close epoll fd
  534. ASSERT_FORCE(close(bsys->efd) == 0)
  535. #endif
  536. #ifdef BADVPN_USE_KEVENT
  537. // close kqueue fd
  538. ASSERT_FORCE(close(bsys->kqueue_fd) == 0)
  539. #endif
  540. #ifdef BADVPN_USE_POLL
  541. // free results arrays
  542. BFree(bsys->poll_results_bfds);
  543. BFree(bsys->poll_results_pollfds);
  544. #endif
  545. // free jobs
  546. BPendingGroup_Free(&bsys->pending_jobs);
  547. }
  548. int BReactor_Exec (BReactor *bsys)
  549. {
  550. BLog(BLOG_DEBUG, "Entering event loop");
  551. while (!bsys->exiting) {
  552. // dispatch job
  553. if (BPendingGroup_HasJobs(&bsys->pending_jobs)) {
  554. BPendingGroup_ExecuteJob(&bsys->pending_jobs);
  555. continue;
  556. }
  557. // dispatch timer
  558. LinkedList1Node *list_node = LinkedList1_GetFirst(&bsys->timers_expired_list);
  559. if (list_node) {
  560. BTimer *timer = UPPER_OBJECT(list_node, BTimer, list_node);
  561. ASSERT(timer->active)
  562. ASSERT(timer->expired)
  563. // remove from expired list
  564. LinkedList1_Remove(&bsys->timers_expired_list, &timer->list_node);
  565. // set inactive
  566. timer->active = 0;
  567. // call handler
  568. BLog(BLOG_DEBUG, "Dispatching timer");
  569. timer->handler(timer->handler_pointer);
  570. continue;
  571. }
  572. #ifdef BADVPN_USE_WINAPI
  573. // dispatch handle
  574. if (bsys->returned_object) {
  575. BHandle *bh = bsys->returned_object;
  576. bsys->returned_object = NULL;
  577. ASSERT(bh->active)
  578. ASSERT(bh->position >= 0 && bh->position < bsys->enabled_num)
  579. ASSERT(bh == bsys->enabled_objects[bh->position])
  580. ASSERT(bh->h == bsys->enabled_handles[bh->position])
  581. // call handler
  582. BLog(BLOG_DEBUG, "Dispatching handle");
  583. bh->handler(bh->user);
  584. continue;
  585. }
  586. #endif
  587. #ifdef BADVPN_USE_EPOLL
  588. // dispatch file descriptor
  589. if (bsys->epoll_results_pos < bsys->epoll_results_num) {
  590. // grab event
  591. struct epoll_event *event = &bsys->epoll_results[bsys->epoll_results_pos];
  592. bsys->epoll_results_pos++;
  593. // check if the BFileDescriptor was removed
  594. if (!event->data.ptr) {
  595. continue;
  596. }
  597. // get BFileDescriptor
  598. BFileDescriptor *bfd = (BFileDescriptor *)event->data.ptr;
  599. ASSERT(bfd->active)
  600. ASSERT(bfd->epoll_returned_ptr == (BFileDescriptor **)&event->data.ptr)
  601. // zero pointer to the epoll entry
  602. bfd->epoll_returned_ptr = NULL;
  603. // calculate events to report
  604. int events = 0;
  605. if ((bfd->waitEvents&BREACTOR_READ) && (event->events&EPOLLIN)) {
  606. events |= BREACTOR_READ;
  607. }
  608. if ((bfd->waitEvents&BREACTOR_WRITE) && (event->events&EPOLLOUT)) {
  609. events |= BREACTOR_WRITE;
  610. }
  611. if ((event->events&EPOLLERR) || (event->events&EPOLLHUP)) {
  612. events |= BREACTOR_ERROR;
  613. }
  614. if (!events) {
  615. BLog(BLOG_ERROR, "no events detected?");
  616. continue;
  617. }
  618. // call handler
  619. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  620. bfd->handler(bfd->user, events);
  621. continue;
  622. }
  623. #endif
  624. #ifdef BADVPN_USE_KEVENT
  625. // dispatch kevent
  626. if (bsys->kevent_results_pos < bsys->kevent_results_num) {
  627. // grab event
  628. struct kevent *event = &bsys->kevent_results[bsys->kevent_results_pos];
  629. bsys->kevent_results_pos++;
  630. // check if the event was removed
  631. if (!event->udata) {
  632. continue;
  633. }
  634. // check tag
  635. int *tag = event->udata;
  636. switch (*tag) {
  637. case KEVENT_TAG_FD: {
  638. // get BFileDescriptor
  639. BFileDescriptor *bfd = UPPER_OBJECT(tag, BFileDescriptor, kevent_tag);
  640. ASSERT(bfd->active)
  641. ASSERT(bfd->kevent_returned_ptr == (int **)&event->udata)
  642. // zero pointer to the kevent entry
  643. bfd->kevent_returned_ptr = NULL;
  644. // calculate event to report
  645. int events = 0;
  646. if ((bfd->waitEvents&BREACTOR_READ) && event->filter == EVFILT_READ) {
  647. events |= BREACTOR_READ;
  648. }
  649. if ((bfd->waitEvents&BREACTOR_WRITE) && event->filter == EVFILT_WRITE) {
  650. events |= BREACTOR_WRITE;
  651. }
  652. if (!events) {
  653. BLog(BLOG_ERROR, "no events detected?");
  654. continue;
  655. }
  656. // call handler
  657. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  658. bfd->handler(bfd->user, events);
  659. continue;
  660. } break;
  661. case KEVENT_TAG_KEVENT: {
  662. // get BReactorKEvent
  663. BReactorKEvent *kev = UPPER_OBJECT(tag, BReactorKEvent, kevent_tag);
  664. ASSERT(kev->reactor == bsys)
  665. ASSERT(kev->kevent_returned_ptr == (int **)&event->udata)
  666. // zero pointer to the kevent entry
  667. kev->kevent_returned_ptr = NULL;
  668. // call handler
  669. BLog(BLOG_DEBUG, "Dispatching kevent");
  670. kev->handler(kev->user, event->fflags, event->data);
  671. continue;
  672. } break;
  673. default:
  674. ASSERT(0);
  675. }
  676. }
  677. #endif
  678. #ifdef BADVPN_USE_POLL
  679. if (bsys->poll_results_pos < bsys->poll_results_num) {
  680. // grab event
  681. struct pollfd *pfd = &bsys->poll_results_pollfds[bsys->poll_results_pos];
  682. BFileDescriptor *bfd = bsys->poll_results_bfds[bsys->poll_results_pos];
  683. bsys->poll_results_pos++;
  684. // skip removed entry
  685. if (!bfd) {
  686. continue;
  687. }
  688. ASSERT(bfd->active)
  689. ASSERT(bfd->poll_returned_index == bsys->poll_results_pos - 1)
  690. // remove result reference
  691. bfd->poll_returned_index = -1;
  692. // calculate events to report
  693. int events = 0;
  694. if ((bfd->waitEvents & BREACTOR_READ) && (pfd->revents & POLLIN)) {
  695. events |= BREACTOR_READ;
  696. }
  697. if ((bfd->waitEvents & BREACTOR_WRITE) && (pfd->revents & POLLOUT)) {
  698. events |= BREACTOR_WRITE;
  699. }
  700. if ((pfd->revents & POLLERR) || (pfd->revents & POLLHUP)) {
  701. events |= BREACTOR_ERROR;
  702. }
  703. if (!events) {
  704. continue;
  705. }
  706. // call handler
  707. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  708. bfd->handler(bfd->user, events);
  709. continue;
  710. }
  711. #endif
  712. wait_for_events(bsys);
  713. }
  714. BLog(BLOG_DEBUG, "Exiting event loop, exit code %d", bsys->exit_code);
  715. return bsys->exit_code;
  716. }
  717. void BReactor_Quit (BReactor *bsys, int code)
  718. {
  719. bsys->exiting = 1;
  720. bsys->exit_code = code;
  721. }
  722. void BReactor_SetTimer (BReactor *bsys, BTimer *bt)
  723. {
  724. BReactor_SetTimerAfter(bsys, bt, bt->msTime);
  725. }
  726. void BReactor_SetTimerAfter (BReactor *bsys, BTimer *bt, btime_t after)
  727. {
  728. BReactor_SetTimerAbsolute(bsys, bt, btime_add(btime_gettime(), after));
  729. }
  730. void BReactor_SetTimerAbsolute (BReactor *bsys, BTimer *bt, btime_t time)
  731. {
  732. // unlink it if it's already in the list
  733. BReactor_RemoveTimer(bsys, bt);
  734. // initialize timer
  735. bt->active = 1;
  736. bt->expired = 0;
  737. bt->absTime = time;
  738. // insert to running timers heap
  739. BHeap_Insert(&bsys->timers_heap, &bt->heap_node);
  740. }
  741. void BReactor_RemoveTimer (BReactor *bsys, BTimer *bt)
  742. {
  743. if (!bt->active) {
  744. return;
  745. }
  746. if (bt->expired) {
  747. // remove from expired list
  748. LinkedList1_Remove(&bsys->timers_expired_list, &bt->list_node);
  749. } else {
  750. // remove from running heap
  751. BHeap_Remove(&bsys->timers_heap, &bt->heap_node);
  752. }
  753. // set inactive
  754. bt->active = 0;
  755. }
  756. BPendingGroup * BReactor_PendingGroup (BReactor *bsys)
  757. {
  758. return &bsys->pending_jobs;
  759. }
  760. int BReactor_Synchronize (BReactor *bsys, BPending *ref)
  761. {
  762. ASSERT(ref)
  763. while (!bsys->exiting) {
  764. ASSERT(BPendingGroup_HasJobs(&bsys->pending_jobs))
  765. if (BPendingGroup_PeekJob(&bsys->pending_jobs) == ref) {
  766. return 1;
  767. }
  768. BPendingGroup_ExecuteJob(&bsys->pending_jobs);
  769. }
  770. return 0;
  771. }
  772. #ifdef BADVPN_USE_WINAPI
  773. int BReactor_AddHandle (BReactor *bsys, BHandle *bh)
  774. {
  775. ASSERT(!bh->active)
  776. if (bsys->num_handles >= BSYSTEM_MAX_HANDLES) {
  777. return 0;
  778. }
  779. bh->active = 1;
  780. bh->position = -1;
  781. bsys->num_handles++;
  782. return 1;
  783. }
  784. void BReactor_RemoveHandle (BReactor *bsys, BHandle *bh)
  785. {
  786. ASSERT(bh->active)
  787. if (bh->position >= 0) {
  788. BReactor_DisableHandle(bsys, bh);
  789. }
  790. bh->active = 0;
  791. ASSERT(bsys->num_handles > 0)
  792. bsys->num_handles--;
  793. }
  794. void BReactor_EnableHandle (BReactor *bsys, BHandle *bh)
  795. {
  796. ASSERT(bh->active)
  797. ASSERT(bh->position == -1)
  798. ASSERT(bsys->enabled_num < BSYSTEM_MAX_HANDLES)
  799. bsys->enabled_handles[bsys->enabled_num] = bh->h;
  800. bsys->enabled_objects[bsys->enabled_num] = bh;
  801. bh->position = bsys->enabled_num;
  802. bsys->enabled_num++;
  803. }
  804. void BReactor_DisableHandle (BReactor *bsys, BHandle *bh)
  805. {
  806. ASSERT(bh->active)
  807. ASSERT(bh->position >= 0)
  808. ASSERT(bh->position < bsys->enabled_num)
  809. ASSERT(bh == bsys->enabled_objects[bh->position])
  810. ASSERT(bh->h == bsys->enabled_handles[bh->position])
  811. // if there are more handles after this one, move the last
  812. // one into its position
  813. if (bh->position < bsys->enabled_num - 1) {
  814. int move_position = bsys->enabled_num - 1;
  815. BHandle *move_handle = bsys->enabled_objects[move_position];
  816. ASSERT(move_handle->active)
  817. ASSERT(move_handle->position == move_position)
  818. ASSERT(move_handle->h == bsys->enabled_handles[move_position])
  819. bsys->enabled_handles[bh->position] = move_handle->h;
  820. bsys->enabled_objects[bh->position] = move_handle;
  821. move_handle->position = bh->position;
  822. }
  823. bh->position = -1;
  824. bsys->enabled_num--;
  825. // make sure the handler will not be called
  826. if (bsys->returned_object == bh) {
  827. bsys->returned_object = NULL;
  828. }
  829. }
  830. #else
  831. int BReactor_AddFileDescriptor (BReactor *bsys, BFileDescriptor *bs)
  832. {
  833. ASSERT(!bs->active)
  834. #ifdef BADVPN_USE_EPOLL
  835. // add epoll entry
  836. struct epoll_event event;
  837. memset(&event, 0, sizeof(event));
  838. event.events = 0;
  839. event.data.ptr = bs;
  840. if (epoll_ctl(bsys->efd, EPOLL_CTL_ADD, bs->fd, &event) < 0) {
  841. int error = errno;
  842. BLog(BLOG_ERROR, "epoll_ctl failed: %d", error);
  843. return 0;
  844. }
  845. // set epoll returned pointer
  846. bs->epoll_returned_ptr = NULL;
  847. #endif
  848. #ifdef BADVPN_USE_KEVENT
  849. // set kevent tag
  850. bs->kevent_tag = KEVENT_TAG_FD;
  851. // set kevent returned pointer
  852. bs->kevent_returned_ptr = NULL;
  853. #endif
  854. #ifdef BADVPN_USE_POLL
  855. if (bsys->poll_num_enabled_fds == BSYSTEM_MAX_POLL_FDS) {
  856. BLog(BLOG_ERROR, "too many fds");
  857. return 0;
  858. }
  859. // append to enabled fds list
  860. LinkedList1_Append(&bsys->poll_enabled_fds_list, &bs->poll_enabled_fds_list_node);
  861. bsys->poll_num_enabled_fds++;
  862. // set not returned
  863. bs->poll_returned_index = -1;
  864. #endif
  865. bs->active = 1;
  866. bs->waitEvents = 0;
  867. DebugCounter_Increment(&bsys->d_fds_counter);
  868. return 1;
  869. }
  870. void BReactor_RemoveFileDescriptor (BReactor *bsys, BFileDescriptor *bs)
  871. {
  872. ASSERT(bs->active)
  873. DebugCounter_Decrement(&bsys->d_fds_counter);
  874. bs->active = 0;
  875. #ifdef BADVPN_USE_EPOLL
  876. // delete epoll entry
  877. ASSERT_FORCE(epoll_ctl(bsys->efd, EPOLL_CTL_DEL, bs->fd, NULL) == 0)
  878. // write through epoll returned pointer
  879. if (bs->epoll_returned_ptr) {
  880. *bs->epoll_returned_ptr = NULL;
  881. }
  882. #endif
  883. #ifdef BADVPN_USE_KEVENT
  884. // delete kevents
  885. update_kevent_fd_events(bsys, bs, 0);
  886. // write through kevent returned pointer
  887. if (bs->kevent_returned_ptr) {
  888. *bs->kevent_returned_ptr = NULL;
  889. }
  890. #endif
  891. #ifdef BADVPN_USE_POLL
  892. // invalidate results entry
  893. if (bs->poll_returned_index != -1) {
  894. ASSERT(bs->poll_returned_index >= bsys->poll_results_pos)
  895. ASSERT(bs->poll_returned_index < bsys->poll_results_num)
  896. ASSERT(bsys->poll_results_bfds[bs->poll_returned_index] == bs)
  897. bsys->poll_results_bfds[bs->poll_returned_index] = NULL;
  898. }
  899. // remove from enabled fds list
  900. LinkedList1_Remove(&bsys->poll_enabled_fds_list, &bs->poll_enabled_fds_list_node);
  901. bsys->poll_num_enabled_fds--;
  902. #endif
  903. }
  904. void BReactor_SetFileDescriptorEvents (BReactor *bsys, BFileDescriptor *bs, int events)
  905. {
  906. ASSERT(bs->active)
  907. ASSERT(!(events&~(BREACTOR_READ|BREACTOR_WRITE)))
  908. if (bs->waitEvents == events) {
  909. return;
  910. }
  911. #ifdef BADVPN_USE_EPOLL
  912. // calculate epoll events
  913. int eevents = 0;
  914. if ((events & BREACTOR_READ)) {
  915. eevents |= EPOLLIN;
  916. }
  917. if ((events & BREACTOR_WRITE)) {
  918. eevents |= EPOLLOUT;
  919. }
  920. // update epoll entry
  921. struct epoll_event event;
  922. memset(&event, 0, sizeof(event));
  923. event.events = eevents;
  924. event.data.ptr = bs;
  925. ASSERT_FORCE(epoll_ctl(bsys->efd, EPOLL_CTL_MOD, bs->fd, &event) == 0)
  926. #endif
  927. #ifdef BADVPN_USE_KEVENT
  928. update_kevent_fd_events(bsys, bs, events);
  929. #endif
  930. // update events
  931. bs->waitEvents = events;
  932. }
  933. #endif
  934. #ifdef BADVPN_USE_KEVENT
  935. int BReactorKEvent_Init (BReactorKEvent *o, BReactor *reactor, BReactorKEvent_handler handler, void *user, uintptr_t ident, short filter, u_int fflags, intptr_t data)
  936. {
  937. DebugObject_Access(&reactor->d_obj);
  938. // init arguments
  939. o->reactor = reactor;
  940. o->handler = handler;
  941. o->user = user;
  942. o->ident = ident;
  943. o->filter = filter;
  944. // add kevent
  945. struct kevent event;
  946. memset(&event, 0, sizeof(event));
  947. event.ident = o->ident;
  948. event.filter = o->filter;
  949. event.flags = EV_ADD;
  950. event.fflags = fflags;
  951. event.data = data;
  952. event.udata = &o->kevent_tag;
  953. if (kevent(o->reactor->kqueue_fd, &event, 1, NULL, 0, NULL) < 0) {
  954. return 0;
  955. }
  956. // set kevent tag
  957. o->kevent_tag = KEVENT_TAG_KEVENT;
  958. // set kevent returned pointer
  959. o->kevent_returned_ptr = NULL;
  960. DebugObject_Init(&o->d_obj);
  961. DebugCounter_Increment(&o->reactor->d_kevent_ctr);
  962. return 1;
  963. }
  964. void BReactorKEvent_Free (BReactorKEvent *o)
  965. {
  966. DebugObject_Free(&o->d_obj);
  967. DebugCounter_Decrement(&o->reactor->d_kevent_ctr);
  968. // write through kevent returned pointer
  969. if (o->kevent_returned_ptr) {
  970. *o->kevent_returned_ptr = NULL;
  971. }
  972. // delete kevent
  973. struct kevent event;
  974. memset(&event, 0, sizeof(event));
  975. event.ident = o->ident;
  976. event.filter = o->filter;
  977. event.flags = EV_DELETE;
  978. ASSERT_FORCE(kevent(o->reactor->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  979. }
  980. #endif