BReactor_badvpn.c 41 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437
  1. /**
  2. * @file BReactor_badvpn.c
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. Neither the name of the author nor the
  15. * names of its contributors may be used to endorse or promote products
  16. * derived from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  20. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  21. * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  22. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  23. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  24. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  25. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  27. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. */
  29. #include <stdlib.h>
  30. #include <string.h>
  31. #include <stdio.h>
  32. #include <stddef.h>
  33. #ifdef BADVPN_USE_WINAPI
  34. #include <windows.h>
  35. #else
  36. #include <limits.h>
  37. #include <sys/types.h>
  38. #include <errno.h>
  39. #include <unistd.h>
  40. #endif
  41. #include <misc/debug.h>
  42. #include <misc/offset.h>
  43. #include <misc/balloc.h>
  44. #include <misc/compare.h>
  45. #include <base/BLog.h>
  46. #include <system/BReactor.h>
  47. #include <generated/blog_channel_BReactor.h>
  48. #define KEVENT_TAG_FD 1
  49. #define KEVENT_TAG_KEVENT 2
  50. #define TIMER_STATE_INACTIVE 1
  51. #define TIMER_STATE_RUNNING 2
  52. #define TIMER_STATE_EXPIRED 3
  53. static int compare_timers (BSmallTimer *t1, BSmallTimer *t2)
  54. {
  55. int cmp = B_COMPARE(t1->absTime, t2->absTime);
  56. if (cmp) {
  57. return cmp;
  58. }
  59. return B_COMPARE((uintptr_t)t1, (uintptr_t)t2);
  60. }
  61. #include "BReactor_badvpn_timerstree.h"
  62. #include <structure/CAvl_impl.h>
  63. static void assert_timer (BSmallTimer *bt)
  64. {
  65. ASSERT(bt->state == TIMER_STATE_INACTIVE || bt->state == TIMER_STATE_RUNNING ||
  66. bt->state == TIMER_STATE_EXPIRED)
  67. }
  68. static int move_expired_timers (BReactor *bsys, btime_t now)
  69. {
  70. int moved = 0;
  71. // move timed out timers to the expired list
  72. BReactor__TimersTreeRef ref;
  73. BSmallTimer *timer;
  74. while (timer = (ref = BReactor__TimersTree_GetFirst(&bsys->timers_tree, 0)).link) {
  75. ASSERT(timer->state == TIMER_STATE_RUNNING)
  76. // if it's in the future, stop
  77. if (timer->absTime > now) {
  78. break;
  79. }
  80. moved = 1;
  81. // remove from running timers tree
  82. BReactor__TimersTree_Remove(&bsys->timers_tree, 0, ref);
  83. // add to expired timers list
  84. LinkedList1_Append(&bsys->timers_expired_list, &timer->u.list_node);
  85. // set expired
  86. timer->state = TIMER_STATE_EXPIRED;
  87. }
  88. return moved;
  89. }
  90. static void move_first_timers (BReactor *bsys)
  91. {
  92. BReactor__TimersTreeRef ref;
  93. // get the time of the first timer
  94. BSmallTimer *first_timer = (ref = BReactor__TimersTree_GetFirst(&bsys->timers_tree, 0)).link;
  95. ASSERT(first_timer)
  96. ASSERT(first_timer->state == TIMER_STATE_RUNNING)
  97. btime_t first_time = first_timer->absTime;
  98. // remove from running timers tree
  99. BReactor__TimersTree_Remove(&bsys->timers_tree, 0, ref);
  100. // add to expired timers list
  101. LinkedList1_Append(&bsys->timers_expired_list, &first_timer->u.list_node);
  102. // set expired
  103. first_timer->state = TIMER_STATE_EXPIRED;
  104. // also move other timers with the same timeout
  105. BSmallTimer *timer;
  106. while (timer = (ref = BReactor__TimersTree_GetFirst(&bsys->timers_tree, 0)).link) {
  107. ASSERT(timer->state == TIMER_STATE_RUNNING)
  108. ASSERT(timer->absTime >= first_time)
  109. // if it's in the future, stop
  110. if (timer->absTime > first_time) {
  111. break;
  112. }
  113. // remove from running timers tree
  114. BReactor__TimersTree_Remove(&bsys->timers_tree, 0, ref);
  115. // add to expired timers list
  116. LinkedList1_Append(&bsys->timers_expired_list, &timer->u.list_node);
  117. // set expired
  118. timer->state = TIMER_STATE_EXPIRED;
  119. }
  120. }
  121. #ifdef BADVPN_USE_WINAPI
  122. static void set_iocp_ready (BReactorIOCPOverlapped *olap, int succeeded, DWORD bytes)
  123. {
  124. BReactor *reactor = olap->reactor;
  125. ASSERT(!olap->is_ready)
  126. // set parameters
  127. olap->ready_succeeded = succeeded;
  128. olap->ready_bytes = bytes;
  129. // insert to IOCP ready list
  130. LinkedList1_Append(&reactor->iocp_ready_list, &olap->ready_list_node);
  131. // set ready
  132. olap->is_ready = 1;
  133. }
  134. #endif
  135. #ifdef BADVPN_USE_EPOLL
  136. static void set_epoll_fd_pointers (BReactor *bsys)
  137. {
  138. // Write pointers to our entry pointers into file descriptors.
  139. // If a handler function frees some other file descriptor, the
  140. // free routine will set our pointer to NULL so we don't dispatch it.
  141. for (int i = 0; i < bsys->epoll_results_num; i++) {
  142. struct epoll_event *event = &bsys->epoll_results[i];
  143. ASSERT(event->data.ptr)
  144. BFileDescriptor *bfd = (BFileDescriptor *)event->data.ptr;
  145. ASSERT(bfd->active)
  146. ASSERT(!bfd->epoll_returned_ptr)
  147. bfd->epoll_returned_ptr = (BFileDescriptor **)&event->data.ptr;
  148. }
  149. }
  150. #endif
  151. #ifdef BADVPN_USE_KEVENT
  152. static void set_kevent_fd_pointers (BReactor *bsys)
  153. {
  154. for (int i = 0; i < bsys->kevent_results_num; i++) {
  155. struct kevent *event = &bsys->kevent_results[i];
  156. ASSERT(event->udata)
  157. int *tag = event->udata;
  158. switch (*tag) {
  159. case KEVENT_TAG_FD: {
  160. BFileDescriptor *bfd = UPPER_OBJECT(tag, BFileDescriptor, kevent_tag);
  161. ASSERT(bfd->active)
  162. bsys->kevent_prev_event[i] = bfd->kevent_last_event;
  163. bfd->kevent_last_event = i;
  164. } break;
  165. case KEVENT_TAG_KEVENT: {
  166. BReactorKEvent *kev = UPPER_OBJECT(tag, BReactorKEvent, kevent_tag);
  167. ASSERT(kev->reactor == bsys)
  168. ASSERT(!kev->kevent_returned_ptr)
  169. kev->kevent_returned_ptr = (int **)&event->udata;
  170. } break;
  171. default:
  172. ASSERT(0);
  173. }
  174. }
  175. }
  176. static void update_kevent_fd_events (BReactor *bsys, BFileDescriptor *bs, int events)
  177. {
  178. struct kevent event;
  179. if (!(bs->waitEvents & BREACTOR_READ) && (events & BREACTOR_READ)) {
  180. memset(&event, 0, sizeof(event));
  181. event.ident = bs->fd;
  182. event.filter = EVFILT_READ;
  183. event.flags = EV_ADD;
  184. event.udata = &bs->kevent_tag;
  185. ASSERT_FORCE(kevent(bsys->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  186. }
  187. else if ((bs->waitEvents & BREACTOR_READ) && !(events & BREACTOR_READ)) {
  188. memset(&event, 0, sizeof(event));
  189. event.ident = bs->fd;
  190. event.filter = EVFILT_READ;
  191. event.flags = EV_DELETE;
  192. ASSERT_FORCE(kevent(bsys->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  193. }
  194. if (!(bs->waitEvents & BREACTOR_WRITE) && (events & BREACTOR_WRITE)) {
  195. memset(&event, 0, sizeof(event));
  196. event.ident = bs->fd;
  197. event.filter = EVFILT_WRITE;
  198. event.flags = EV_ADD;
  199. event.udata = &bs->kevent_tag;
  200. ASSERT_FORCE(kevent(bsys->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  201. }
  202. else if ((bs->waitEvents & BREACTOR_WRITE) && !(events & BREACTOR_WRITE)) {
  203. memset(&event, 0, sizeof(event));
  204. event.ident = bs->fd;
  205. event.filter = EVFILT_WRITE;
  206. event.flags = EV_DELETE;
  207. ASSERT_FORCE(kevent(bsys->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  208. }
  209. }
  210. #endif
  211. #ifdef BADVPN_USE_POLL
  212. static void set_poll_fd_pointers (BReactor *bsys)
  213. {
  214. for (int i = 0; i < bsys->poll_results_num; i++) {
  215. BFileDescriptor *bfd = bsys->poll_results_bfds[i];
  216. ASSERT(bfd)
  217. ASSERT(bfd->active)
  218. ASSERT(bfd->poll_returned_index == -1)
  219. bfd->poll_returned_index = i;
  220. }
  221. }
  222. #endif
  223. static void wait_for_events (BReactor *bsys)
  224. {
  225. // must have processed all pending events
  226. ASSERT(!BPendingGroup_HasJobs(&bsys->pending_jobs))
  227. ASSERT(LinkedList1_IsEmpty(&bsys->timers_expired_list))
  228. #ifdef BADVPN_USE_WINAPI
  229. ASSERT(LinkedList1_IsEmpty(&bsys->iocp_ready_list))
  230. #endif
  231. #ifdef BADVPN_USE_EPOLL
  232. ASSERT(bsys->epoll_results_pos == bsys->epoll_results_num)
  233. #endif
  234. #ifdef BADVPN_USE_KEVENT
  235. ASSERT(bsys->kevent_results_pos == bsys->kevent_results_num)
  236. #endif
  237. #ifdef BADVPN_USE_POLL
  238. ASSERT(bsys->poll_results_pos == bsys->poll_results_num)
  239. #endif
  240. // clean up epoll results
  241. #ifdef BADVPN_USE_EPOLL
  242. bsys->epoll_results_num = 0;
  243. bsys->epoll_results_pos = 0;
  244. #endif
  245. // clean up kevent results
  246. #ifdef BADVPN_USE_KEVENT
  247. bsys->kevent_results_num = 0;
  248. bsys->kevent_results_pos = 0;
  249. #endif
  250. // clean up poll results
  251. #ifdef BADVPN_USE_POLL
  252. bsys->poll_results_num = 0;
  253. bsys->poll_results_pos = 0;
  254. #endif
  255. // timeout vars
  256. int have_timeout = 0;
  257. btime_t timeout_abs;
  258. btime_t now = 0; // to remove warning
  259. // compute timeout
  260. BSmallTimer *first_timer = BReactor__TimersTree_GetFirst(&bsys->timers_tree, 0).link;
  261. if (first_timer) {
  262. ASSERT(first_timer->state == TIMER_STATE_RUNNING)
  263. // get current time
  264. now = btime_gettime();
  265. // if some timers have already timed out, return them immediately
  266. if (move_expired_timers(bsys, now)) {
  267. BLog(BLOG_DEBUG, "Got already expired timers");
  268. return;
  269. }
  270. // timeout is first timer, remember absolute time
  271. have_timeout = 1;
  272. timeout_abs = first_timer->absTime;
  273. }
  274. // wait until the timeout is reached or the file descriptor / handle in ready
  275. while (1) {
  276. // compute timeout
  277. btime_t timeout_rel = 0; // to remove warning
  278. btime_t timeout_rel_trunc = 0; // to remove warning
  279. if (have_timeout) {
  280. timeout_rel = timeout_abs - now;
  281. timeout_rel_trunc = timeout_rel;
  282. }
  283. // perform wait
  284. #ifdef BADVPN_USE_WINAPI
  285. if (have_timeout) {
  286. if (timeout_rel_trunc > INFINITE - 1) {
  287. timeout_rel_trunc = INFINITE - 1;
  288. }
  289. }
  290. DWORD bytes = 0;
  291. ULONG_PTR key;
  292. BReactorIOCPOverlapped *olap = NULL;
  293. BOOL res = GetQueuedCompletionStatus(bsys->iocp_handle, &bytes, &key, (OVERLAPPED **)&olap, (have_timeout ? timeout_rel_trunc : INFINITE));
  294. ASSERT_FORCE(olap || have_timeout)
  295. if (olap || timeout_rel_trunc == timeout_rel) {
  296. if (olap) {
  297. BLog(BLOG_DEBUG, "GetQueuedCompletionStatus returned event");
  298. DebugObject_Access(&olap->d_obj);
  299. ASSERT(olap->reactor == bsys)
  300. ASSERT(!olap->is_ready)
  301. set_iocp_ready(olap, (res == TRUE), bytes);
  302. } else {
  303. BLog(BLOG_DEBUG, "GetQueuedCompletionStatus timed out");
  304. move_first_timers(bsys);
  305. }
  306. break;
  307. }
  308. #endif
  309. #ifdef BADVPN_USE_EPOLL
  310. if (have_timeout) {
  311. if (timeout_rel_trunc > INT_MAX) {
  312. timeout_rel_trunc = INT_MAX;
  313. }
  314. }
  315. BLog(BLOG_DEBUG, "Calling epoll_wait");
  316. int waitres = epoll_wait(bsys->efd, bsys->epoll_results, BSYSTEM_MAX_RESULTS, (have_timeout ? timeout_rel_trunc : -1));
  317. if (waitres < 0) {
  318. int error = errno;
  319. if (error == EINTR) {
  320. BLog(BLOG_DEBUG, "epoll_wait interrupted");
  321. goto try_again;
  322. }
  323. perror("epoll_wait");
  324. ASSERT_FORCE(0)
  325. }
  326. ASSERT_FORCE(!(waitres == 0) || have_timeout)
  327. ASSERT_FORCE(waitres <= BSYSTEM_MAX_RESULTS)
  328. if (waitres != 0 || timeout_rel_trunc == timeout_rel) {
  329. if (waitres != 0) {
  330. BLog(BLOG_DEBUG, "epoll_wait returned %d file descriptors", waitres);
  331. bsys->epoll_results_num = waitres;
  332. set_epoll_fd_pointers(bsys);
  333. } else {
  334. BLog(BLOG_DEBUG, "epoll_wait timed out");
  335. move_first_timers(bsys);
  336. }
  337. break;
  338. }
  339. #endif
  340. #ifdef BADVPN_USE_KEVENT
  341. struct timespec ts;
  342. if (have_timeout) {
  343. if (timeout_rel_trunc > 86400000) {
  344. timeout_rel_trunc = 86400000;
  345. }
  346. ts.tv_sec = timeout_rel_trunc / 1000;
  347. ts.tv_nsec = (timeout_rel_trunc % 1000) * 1000000;
  348. }
  349. BLog(BLOG_DEBUG, "Calling kevent");
  350. int waitres = kevent(bsys->kqueue_fd, NULL, 0, bsys->kevent_results, BSYSTEM_MAX_RESULTS, (have_timeout ? &ts : NULL));
  351. if (waitres < 0) {
  352. int error = errno;
  353. if (error == EINTR) {
  354. BLog(BLOG_DEBUG, "kevent interrupted");
  355. goto try_again;
  356. }
  357. perror("kevent");
  358. ASSERT_FORCE(0)
  359. }
  360. ASSERT_FORCE(!(waitres == 0) || have_timeout)
  361. ASSERT_FORCE(waitres <= BSYSTEM_MAX_RESULTS)
  362. if (waitres != 0 || timeout_rel_trunc == timeout_rel) {
  363. if (waitres != 0) {
  364. BLog(BLOG_DEBUG, "kevent returned %d events", waitres);
  365. bsys->kevent_results_num = waitres;
  366. set_kevent_fd_pointers(bsys);
  367. } else {
  368. BLog(BLOG_DEBUG, "kevent timed out");
  369. move_first_timers(bsys);
  370. }
  371. break;
  372. }
  373. #endif
  374. #ifdef BADVPN_USE_POLL
  375. if (have_timeout) {
  376. if (timeout_rel_trunc > INT_MAX) {
  377. timeout_rel_trunc = INT_MAX;
  378. }
  379. }
  380. ASSERT(bsys->poll_num_enabled_fds >= 0)
  381. ASSERT(bsys->poll_num_enabled_fds <= BSYSTEM_MAX_POLL_FDS)
  382. int num_fds = 0;
  383. LinkedList1Node *list_node = LinkedList1_GetFirst(&bsys->poll_enabled_fds_list);
  384. while (list_node) {
  385. BFileDescriptor *bfd = UPPER_OBJECT(list_node, BFileDescriptor, poll_enabled_fds_list_node);
  386. ASSERT(bfd->active)
  387. ASSERT(bfd->poll_returned_index == -1)
  388. // calculate poll events
  389. int pevents = 0;
  390. if ((bfd->waitEvents & BREACTOR_READ)) {
  391. pevents |= POLLIN;
  392. }
  393. if ((bfd->waitEvents & BREACTOR_WRITE)) {
  394. pevents |= POLLOUT;
  395. }
  396. // write pollfd entry
  397. struct pollfd *pfd = &bsys->poll_results_pollfds[num_fds];
  398. pfd->fd = bfd->fd;
  399. pfd->events = pevents;
  400. pfd->revents = 0;
  401. // write BFileDescriptor reference entry
  402. bsys->poll_results_bfds[num_fds] = bfd;
  403. // increment number of fds in array
  404. num_fds++;
  405. list_node = LinkedList1Node_Next(list_node);
  406. }
  407. BLog(BLOG_DEBUG, "Calling poll");
  408. int waitres = poll(bsys->poll_results_pollfds, num_fds, (have_timeout ? timeout_rel_trunc : -1));
  409. if (waitres < 0) {
  410. int error = errno;
  411. if (error == EINTR) {
  412. BLog(BLOG_DEBUG, "poll interrupted");
  413. goto try_again;
  414. }
  415. perror("poll");
  416. ASSERT_FORCE(0)
  417. }
  418. ASSERT_FORCE(!(waitres == 0) || have_timeout)
  419. if (waitres != 0 || timeout_rel_trunc == timeout_rel) {
  420. if (waitres != 0) {
  421. BLog(BLOG_DEBUG, "poll returned %d file descriptors", waitres);
  422. bsys->poll_results_num = num_fds;
  423. bsys->poll_results_pos = 0;
  424. set_poll_fd_pointers(bsys);
  425. } else {
  426. BLog(BLOG_DEBUG, "poll timed out");
  427. move_first_timers(bsys);
  428. }
  429. break;
  430. }
  431. #endif
  432. try_again:
  433. if (have_timeout) {
  434. // get current time
  435. now = btime_gettime();
  436. // check if we already reached the time we're waiting for
  437. if (now >= timeout_abs) {
  438. BLog(BLOG_DEBUG, "already timed out while trying again");
  439. move_first_timers(bsys);
  440. break;
  441. }
  442. }
  443. }
  444. // reset limit objects
  445. LinkedList1Node *list_node;
  446. while (list_node = LinkedList1_GetFirst(&bsys->active_limits_list)) {
  447. BReactorLimit *limit = UPPER_OBJECT(list_node, BReactorLimit, active_limits_list_node);
  448. ASSERT(limit->count > 0)
  449. limit->count = 0;
  450. LinkedList1_Remove(&bsys->active_limits_list, &limit->active_limits_list_node);
  451. }
  452. }
  453. #ifndef BADVPN_USE_WINAPI
  454. void BFileDescriptor_Init (BFileDescriptor *bs, int fd, BFileDescriptor_handler handler, void *user)
  455. {
  456. bs->fd = fd;
  457. bs->handler = handler;
  458. bs->user = user;
  459. bs->active = 0;
  460. }
  461. #endif
  462. void BSmallTimer_Init (BSmallTimer *bt, BSmallTimer_handler handler)
  463. {
  464. bt->handler.smalll = handler;
  465. bt->state = TIMER_STATE_INACTIVE;
  466. bt->is_small = 1;
  467. }
  468. int BSmallTimer_IsRunning (BSmallTimer *bt)
  469. {
  470. assert_timer(bt);
  471. return (bt->state != TIMER_STATE_INACTIVE);
  472. }
  473. void BTimer_Init (BTimer *bt, btime_t msTime, BTimer_handler handler, void *user)
  474. {
  475. bt->base.handler.heavy = handler;
  476. bt->base.state = TIMER_STATE_INACTIVE;
  477. bt->base.is_small = 0;
  478. bt->user = user;
  479. bt->msTime = msTime;
  480. }
  481. int BTimer_IsRunning (BTimer *bt)
  482. {
  483. return BSmallTimer_IsRunning(&bt->base);
  484. }
  485. int BReactor_Init (BReactor *bsys)
  486. {
  487. BLog(BLOG_DEBUG, "Reactor initializing");
  488. // set not exiting
  489. bsys->exiting = 0;
  490. // init jobs
  491. BPendingGroup_Init(&bsys->pending_jobs);
  492. // init timers
  493. BReactor__TimersTree_Init(&bsys->timers_tree);
  494. LinkedList1_Init(&bsys->timers_expired_list);
  495. // init limits
  496. LinkedList1_Init(&bsys->active_limits_list);
  497. #ifdef BADVPN_USE_WINAPI
  498. // init IOCP list
  499. LinkedList1_Init(&bsys->iocp_list);
  500. // init IOCP handle
  501. if (!(bsys->iocp_handle = CreateIoCompletionPort(INVALID_HANDLE_VALUE, NULL, 0, 1))) {
  502. BLog(BLOG_ERROR, "CreateIoCompletionPort failed");
  503. goto fail0;
  504. }
  505. // init IOCP ready list
  506. LinkedList1_Init(&bsys->iocp_ready_list);
  507. #endif
  508. #ifdef BADVPN_USE_EPOLL
  509. // create epoll fd
  510. if ((bsys->efd = epoll_create(10)) < 0) {
  511. BLog(BLOG_ERROR, "epoll_create failed");
  512. goto fail0;
  513. }
  514. // init results array
  515. bsys->epoll_results_num = 0;
  516. bsys->epoll_results_pos = 0;
  517. #endif
  518. #ifdef BADVPN_USE_KEVENT
  519. // create kqueue fd
  520. if ((bsys->kqueue_fd = kqueue()) < 0) {
  521. BLog(BLOG_ERROR, "kqueue failed");
  522. goto fail0;
  523. }
  524. // init results array
  525. bsys->kevent_results_num = 0;
  526. bsys->kevent_results_pos = 0;
  527. #endif
  528. #ifdef BADVPN_USE_POLL
  529. // init enabled fds list
  530. LinkedList1_Init(&bsys->poll_enabled_fds_list);
  531. // set zero enabled fds
  532. bsys->poll_num_enabled_fds = 0;
  533. // allocate results arrays
  534. if (!(bsys->poll_results_pollfds = BAllocArray(BSYSTEM_MAX_POLL_FDS, sizeof(bsys->poll_results_pollfds[0])))) {
  535. BLog(BLOG_ERROR, "BAllocArray failed");
  536. goto fail0;
  537. }
  538. if (!(bsys->poll_results_bfds = BAllocArray(BSYSTEM_MAX_POLL_FDS, sizeof(bsys->poll_results_bfds[0])))) {
  539. BLog(BLOG_ERROR, "BAllocArray failed");
  540. goto fail1;
  541. }
  542. // init results array
  543. bsys->poll_results_num = 0;
  544. bsys->poll_results_pos = 0;
  545. #endif
  546. DebugObject_Init(&bsys->d_obj);
  547. #ifndef BADVPN_USE_WINAPI
  548. DebugCounter_Init(&bsys->d_fds_counter);
  549. #endif
  550. #ifdef BADVPN_USE_KEVENT
  551. DebugCounter_Init(&bsys->d_kevent_ctr);
  552. #endif
  553. DebugCounter_Init(&bsys->d_limits_ctr);
  554. return 1;
  555. #ifdef BADVPN_USE_POLL
  556. fail1:
  557. BFree(bsys->poll_results_pollfds);
  558. #endif
  559. fail0:
  560. BPendingGroup_Free(&bsys->pending_jobs);
  561. BLog(BLOG_ERROR, "Reactor failed to initialize");
  562. return 0;
  563. }
  564. void BReactor_Free (BReactor *bsys)
  565. {
  566. DebugObject_Access(&bsys->d_obj);
  567. #ifdef BADVPN_USE_WINAPI
  568. while (!LinkedList1_IsEmpty(&bsys->iocp_list)) {
  569. BReactorIOCPOverlapped *olap = UPPER_OBJECT(LinkedList1_GetLast(&bsys->iocp_list), BReactorIOCPOverlapped, iocp_list_node);
  570. ASSERT(olap->reactor == bsys)
  571. olap->handler(olap->user, BREACTOR_IOCP_EVENT_EXITING, 0);
  572. }
  573. #endif
  574. // {pending group has no BPending objects}
  575. ASSERT(!BPendingGroup_HasJobs(&bsys->pending_jobs))
  576. ASSERT(BReactor__TimersTree_IsEmpty(&bsys->timers_tree))
  577. ASSERT(LinkedList1_IsEmpty(&bsys->timers_expired_list))
  578. ASSERT(LinkedList1_IsEmpty(&bsys->active_limits_list))
  579. DebugObject_Free(&bsys->d_obj);
  580. #ifdef BADVPN_USE_WINAPI
  581. ASSERT(LinkedList1_IsEmpty(&bsys->iocp_ready_list))
  582. ASSERT(LinkedList1_IsEmpty(&bsys->iocp_list))
  583. #endif
  584. #ifndef BADVPN_USE_WINAPI
  585. DebugCounter_Free(&bsys->d_fds_counter);
  586. #endif
  587. #ifdef BADVPN_USE_KEVENT
  588. DebugCounter_Free(&bsys->d_kevent_ctr);
  589. #endif
  590. DebugCounter_Free(&bsys->d_limits_ctr);
  591. #ifdef BADVPN_USE_POLL
  592. ASSERT(bsys->poll_num_enabled_fds == 0)
  593. ASSERT(LinkedList1_IsEmpty(&bsys->poll_enabled_fds_list))
  594. #endif
  595. BLog(BLOG_DEBUG, "Reactor freeing");
  596. #ifdef BADVPN_USE_WINAPI
  597. // close IOCP handle
  598. ASSERT_FORCE(CloseHandle(bsys->iocp_handle))
  599. #endif
  600. #ifdef BADVPN_USE_EPOLL
  601. // close epoll fd
  602. ASSERT_FORCE(close(bsys->efd) == 0)
  603. #endif
  604. #ifdef BADVPN_USE_KEVENT
  605. // close kqueue fd
  606. ASSERT_FORCE(close(bsys->kqueue_fd) == 0)
  607. #endif
  608. #ifdef BADVPN_USE_POLL
  609. // free results arrays
  610. BFree(bsys->poll_results_bfds);
  611. BFree(bsys->poll_results_pollfds);
  612. #endif
  613. // free jobs
  614. BPendingGroup_Free(&bsys->pending_jobs);
  615. }
  616. int BReactor_Exec (BReactor *bsys)
  617. {
  618. BLog(BLOG_DEBUG, "Entering event loop");
  619. while (!bsys->exiting) {
  620. // dispatch job
  621. if (BPendingGroup_HasJobs(&bsys->pending_jobs)) {
  622. BPendingGroup_ExecuteJob(&bsys->pending_jobs);
  623. continue;
  624. }
  625. // dispatch timer
  626. LinkedList1Node *list_node = LinkedList1_GetFirst(&bsys->timers_expired_list);
  627. if (list_node) {
  628. BSmallTimer *timer = UPPER_OBJECT(list_node, BSmallTimer, u.list_node);
  629. ASSERT(timer->state == TIMER_STATE_EXPIRED)
  630. // remove from expired list
  631. LinkedList1_Remove(&bsys->timers_expired_list, &timer->u.list_node);
  632. // set inactive
  633. timer->state = TIMER_STATE_INACTIVE;
  634. // call handler
  635. BLog(BLOG_DEBUG, "Dispatching timer");
  636. if (timer->is_small) {
  637. timer->handler.smalll(timer);
  638. } else {
  639. BTimer *btimer = UPPER_OBJECT(timer, BTimer, base);
  640. timer->handler.heavy(btimer->user);
  641. }
  642. continue;
  643. }
  644. #ifdef BADVPN_USE_WINAPI
  645. if (!LinkedList1_IsEmpty(&bsys->iocp_ready_list)) {
  646. BReactorIOCPOverlapped *olap = UPPER_OBJECT(LinkedList1_GetFirst(&bsys->iocp_ready_list), BReactorIOCPOverlapped, ready_list_node);
  647. ASSERT(olap->is_ready)
  648. ASSERT(olap->handler)
  649. // remove from ready list
  650. LinkedList1_Remove(&bsys->iocp_ready_list, &olap->ready_list_node);
  651. // set not ready
  652. olap->is_ready = 0;
  653. int event = (olap->ready_succeeded ? BREACTOR_IOCP_EVENT_SUCCEEDED : BREACTOR_IOCP_EVENT_FAILED);
  654. // call handler
  655. olap->handler(olap->user, event, olap->ready_bytes);
  656. continue;
  657. }
  658. #endif
  659. #ifdef BADVPN_USE_EPOLL
  660. // dispatch file descriptor
  661. if (bsys->epoll_results_pos < bsys->epoll_results_num) {
  662. // grab event
  663. struct epoll_event *event = &bsys->epoll_results[bsys->epoll_results_pos];
  664. bsys->epoll_results_pos++;
  665. // check if the BFileDescriptor was removed
  666. if (!event->data.ptr) {
  667. continue;
  668. }
  669. // get BFileDescriptor
  670. BFileDescriptor *bfd = (BFileDescriptor *)event->data.ptr;
  671. ASSERT(bfd->active)
  672. ASSERT(bfd->epoll_returned_ptr == (BFileDescriptor **)&event->data.ptr)
  673. // zero pointer to the epoll entry
  674. bfd->epoll_returned_ptr = NULL;
  675. // calculate events to report
  676. int events = 0;
  677. if ((bfd->waitEvents&BREACTOR_READ) && (event->events&EPOLLIN)) {
  678. events |= BREACTOR_READ;
  679. }
  680. if ((bfd->waitEvents&BREACTOR_WRITE) && (event->events&EPOLLOUT)) {
  681. events |= BREACTOR_WRITE;
  682. }
  683. if ((event->events&EPOLLERR)) {
  684. events |= BREACTOR_ERROR;
  685. }
  686. if ((event->events&EPOLLHUP)) {
  687. events |= BREACTOR_HUP;
  688. }
  689. if (!events) {
  690. BLog(BLOG_ERROR, "no events detected?");
  691. continue;
  692. }
  693. // call handler
  694. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  695. bfd->handler(bfd->user, events);
  696. continue;
  697. }
  698. #endif
  699. #ifdef BADVPN_USE_KEVENT
  700. // dispatch kevent
  701. if (bsys->kevent_results_pos < bsys->kevent_results_num) {
  702. // grab event
  703. int event_index = bsys->kevent_results_pos;
  704. struct kevent *event = &bsys->kevent_results[event_index];
  705. bsys->kevent_results_pos++;
  706. // check if the event was removed
  707. if (!event->udata) {
  708. continue;
  709. }
  710. // check tag
  711. int *tag = event->udata;
  712. switch (*tag) {
  713. case KEVENT_TAG_FD: {
  714. // get BFileDescriptor
  715. BFileDescriptor *bfd = UPPER_OBJECT(tag, BFileDescriptor, kevent_tag);
  716. ASSERT(bfd->active)
  717. // when we get to the last event for this fd, reset kevent_last_event
  718. if (event_index == bfd->kevent_last_event) {
  719. bfd->kevent_last_event = -1;
  720. }
  721. // calculate event to report
  722. int events = 0;
  723. if ((bfd->waitEvents&BREACTOR_READ) && event->filter == EVFILT_READ) {
  724. events |= BREACTOR_READ;
  725. }
  726. if ((bfd->waitEvents&BREACTOR_WRITE) && event->filter == EVFILT_WRITE) {
  727. events |= BREACTOR_WRITE;
  728. }
  729. if (!events) {
  730. BLog(BLOG_ERROR, "no events detected?");
  731. continue;
  732. }
  733. // call handler
  734. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  735. bfd->handler(bfd->user, events);
  736. continue;
  737. } break;
  738. case KEVENT_TAG_KEVENT: {
  739. // get BReactorKEvent
  740. BReactorKEvent *kev = UPPER_OBJECT(tag, BReactorKEvent, kevent_tag);
  741. ASSERT(kev->reactor == bsys)
  742. ASSERT(kev->kevent_returned_ptr == (int **)&event->udata)
  743. // zero pointer to the kevent entry
  744. kev->kevent_returned_ptr = NULL;
  745. // call handler
  746. BLog(BLOG_DEBUG, "Dispatching kevent");
  747. kev->handler(kev->user, event->fflags, event->data);
  748. continue;
  749. } break;
  750. default:
  751. ASSERT(0);
  752. }
  753. }
  754. #endif
  755. #ifdef BADVPN_USE_POLL
  756. if (bsys->poll_results_pos < bsys->poll_results_num) {
  757. // grab event
  758. struct pollfd *pfd = &bsys->poll_results_pollfds[bsys->poll_results_pos];
  759. BFileDescriptor *bfd = bsys->poll_results_bfds[bsys->poll_results_pos];
  760. bsys->poll_results_pos++;
  761. // skip removed entry
  762. if (!bfd) {
  763. continue;
  764. }
  765. ASSERT(bfd->active)
  766. ASSERT(bfd->poll_returned_index == bsys->poll_results_pos - 1)
  767. // remove result reference
  768. bfd->poll_returned_index = -1;
  769. // calculate events to report
  770. int events = 0;
  771. if ((bfd->waitEvents & BREACTOR_READ) && (pfd->revents & POLLIN)) {
  772. events |= BREACTOR_READ;
  773. }
  774. if ((bfd->waitEvents & BREACTOR_WRITE) && (pfd->revents & POLLOUT)) {
  775. events |= BREACTOR_WRITE;
  776. }
  777. if ((pfd->revents & POLLERR) || (pfd->revents & POLLHUP)) {
  778. events |= BREACTOR_ERROR;
  779. }
  780. if (!events) {
  781. continue;
  782. }
  783. // call handler
  784. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  785. bfd->handler(bfd->user, events);
  786. continue;
  787. }
  788. #endif
  789. wait_for_events(bsys);
  790. }
  791. BLog(BLOG_DEBUG, "Exiting event loop, exit code %d", bsys->exit_code);
  792. return bsys->exit_code;
  793. }
  794. void BReactor_Quit (BReactor *bsys, int code)
  795. {
  796. bsys->exiting = 1;
  797. bsys->exit_code = code;
  798. }
  799. void BReactor_SetSmallTimer (BReactor *bsys, BSmallTimer *bt, int mode, btime_t time)
  800. {
  801. assert_timer(bt);
  802. ASSERT(mode == BTIMER_SET_ABSOLUTE || mode == BTIMER_SET_RELATIVE)
  803. // unlink it if it's already in the list
  804. BReactor_RemoveSmallTimer(bsys, bt);
  805. // if mode is relative, add current time
  806. if (mode == BTIMER_SET_RELATIVE) {
  807. time = btime_add(btime_gettime(), time);
  808. }
  809. // set time
  810. bt->absTime = time;
  811. // set running
  812. bt->state = TIMER_STATE_RUNNING;
  813. // insert to running timers tree
  814. BReactor__TimersTreeRef ref = {bt, bt};
  815. int res = BReactor__TimersTree_Insert(&bsys->timers_tree, 0, ref, NULL);
  816. ASSERT_EXECUTE(res)
  817. }
  818. void BReactor_RemoveSmallTimer (BReactor *bsys, BSmallTimer *bt)
  819. {
  820. assert_timer(bt);
  821. if (bt->state == TIMER_STATE_INACTIVE) {
  822. return;
  823. }
  824. if (bt->state == TIMER_STATE_EXPIRED) {
  825. // remove from expired list
  826. LinkedList1_Remove(&bsys->timers_expired_list, &bt->u.list_node);
  827. } else {
  828. // remove from running tree
  829. BReactor__TimersTreeRef ref = {bt, bt};
  830. BReactor__TimersTree_Remove(&bsys->timers_tree, 0, ref);
  831. }
  832. // set inactive
  833. bt->state = TIMER_STATE_INACTIVE;
  834. }
  835. void BReactor_SetTimer (BReactor *bsys, BTimer *bt)
  836. {
  837. BReactor_SetSmallTimer(bsys, &bt->base, BTIMER_SET_RELATIVE, bt->msTime);
  838. }
  839. void BReactor_SetTimerAfter (BReactor *bsys, BTimer *bt, btime_t after)
  840. {
  841. BReactor_SetSmallTimer(bsys, &bt->base, BTIMER_SET_RELATIVE, after);
  842. }
  843. void BReactor_SetTimerAbsolute (BReactor *bsys, BTimer *bt, btime_t time)
  844. {
  845. BReactor_SetSmallTimer(bsys, &bt->base, BTIMER_SET_ABSOLUTE, time);
  846. }
  847. void BReactor_RemoveTimer (BReactor *bsys, BTimer *bt)
  848. {
  849. return BReactor_RemoveSmallTimer(bsys, &bt->base);
  850. }
  851. BPendingGroup * BReactor_PendingGroup (BReactor *bsys)
  852. {
  853. return &bsys->pending_jobs;
  854. }
  855. int BReactor_Synchronize (BReactor *bsys, BSmallPending *ref)
  856. {
  857. ASSERT(ref)
  858. while (!bsys->exiting) {
  859. ASSERT(BPendingGroup_HasJobs(&bsys->pending_jobs))
  860. if (BPendingGroup_PeekJob(&bsys->pending_jobs) == ref) {
  861. return 1;
  862. }
  863. BPendingGroup_ExecuteJob(&bsys->pending_jobs);
  864. }
  865. return 0;
  866. }
  867. #ifndef BADVPN_USE_WINAPI
  868. int BReactor_AddFileDescriptor (BReactor *bsys, BFileDescriptor *bs)
  869. {
  870. ASSERT(!bs->active)
  871. #ifdef BADVPN_USE_EPOLL
  872. // add epoll entry
  873. struct epoll_event event;
  874. memset(&event, 0, sizeof(event));
  875. event.events = 0;
  876. event.data.ptr = bs;
  877. if (epoll_ctl(bsys->efd, EPOLL_CTL_ADD, bs->fd, &event) < 0) {
  878. int error = errno;
  879. BLog(BLOG_ERROR, "epoll_ctl failed: %d", error);
  880. return 0;
  881. }
  882. // set epoll returned pointer
  883. bs->epoll_returned_ptr = NULL;
  884. #endif
  885. #ifdef BADVPN_USE_KEVENT
  886. // set kevent tag
  887. bs->kevent_tag = KEVENT_TAG_FD;
  888. // have no events
  889. bs->kevent_last_event = -1;
  890. #endif
  891. #ifdef BADVPN_USE_POLL
  892. if (bsys->poll_num_enabled_fds == BSYSTEM_MAX_POLL_FDS) {
  893. BLog(BLOG_ERROR, "too many fds");
  894. return 0;
  895. }
  896. // append to enabled fds list
  897. LinkedList1_Append(&bsys->poll_enabled_fds_list, &bs->poll_enabled_fds_list_node);
  898. bsys->poll_num_enabled_fds++;
  899. // set not returned
  900. bs->poll_returned_index = -1;
  901. #endif
  902. bs->active = 1;
  903. bs->waitEvents = 0;
  904. DebugCounter_Increment(&bsys->d_fds_counter);
  905. return 1;
  906. }
  907. void BReactor_RemoveFileDescriptor (BReactor *bsys, BFileDescriptor *bs)
  908. {
  909. ASSERT(bs->active)
  910. DebugCounter_Decrement(&bsys->d_fds_counter);
  911. bs->active = 0;
  912. #ifdef BADVPN_USE_EPOLL
  913. // delete epoll entry
  914. struct epoll_event event;
  915. memset(&event, 0, sizeof(event));
  916. ASSERT_FORCE(epoll_ctl(bsys->efd, EPOLL_CTL_DEL, bs->fd, &event) == 0)
  917. // write through epoll returned pointer
  918. if (bs->epoll_returned_ptr) {
  919. *bs->epoll_returned_ptr = NULL;
  920. }
  921. #endif
  922. #ifdef BADVPN_USE_KEVENT
  923. // delete kevents
  924. update_kevent_fd_events(bsys, bs, 0);
  925. // invalidate any events
  926. int event_index = bs->kevent_last_event;
  927. while (event_index != -1) {
  928. ASSERT(event_index >= 0 && event_index < bsys->kevent_results_num)
  929. struct kevent *event = &bsys->kevent_results[event_index];
  930. event->udata = NULL;
  931. event_index = bsys->kevent_prev_event[event_index];
  932. }
  933. #endif
  934. #ifdef BADVPN_USE_POLL
  935. // invalidate results entry
  936. if (bs->poll_returned_index != -1) {
  937. ASSERT(bs->poll_returned_index >= bsys->poll_results_pos)
  938. ASSERT(bs->poll_returned_index < bsys->poll_results_num)
  939. ASSERT(bsys->poll_results_bfds[bs->poll_returned_index] == bs)
  940. bsys->poll_results_bfds[bs->poll_returned_index] = NULL;
  941. }
  942. // remove from enabled fds list
  943. LinkedList1_Remove(&bsys->poll_enabled_fds_list, &bs->poll_enabled_fds_list_node);
  944. bsys->poll_num_enabled_fds--;
  945. #endif
  946. }
  947. void BReactor_SetFileDescriptorEvents (BReactor *bsys, BFileDescriptor *bs, int events)
  948. {
  949. ASSERT(bs->active)
  950. ASSERT(!(events&~(BREACTOR_READ|BREACTOR_WRITE)))
  951. if (bs->waitEvents == events) {
  952. return;
  953. }
  954. #ifdef BADVPN_USE_EPOLL
  955. // calculate epoll events
  956. int eevents = 0;
  957. if ((events & BREACTOR_READ)) {
  958. eevents |= EPOLLIN;
  959. }
  960. if ((events & BREACTOR_WRITE)) {
  961. eevents |= EPOLLOUT;
  962. }
  963. // update epoll entry
  964. struct epoll_event event;
  965. memset(&event, 0, sizeof(event));
  966. event.events = eevents;
  967. event.data.ptr = bs;
  968. ASSERT_FORCE(epoll_ctl(bsys->efd, EPOLL_CTL_MOD, bs->fd, &event) == 0)
  969. #endif
  970. #ifdef BADVPN_USE_KEVENT
  971. update_kevent_fd_events(bsys, bs, events);
  972. #endif
  973. // update events
  974. bs->waitEvents = events;
  975. }
  976. #endif
  977. void BReactorLimit_Init (BReactorLimit *o, BReactor *reactor, int limit)
  978. {
  979. DebugObject_Access(&reactor->d_obj);
  980. ASSERT(limit > 0)
  981. // init arguments
  982. o->reactor = reactor;
  983. o->limit = limit;
  984. // set count zero
  985. o->count = 0;
  986. DebugCounter_Increment(&reactor->d_limits_ctr);
  987. DebugObject_Init(&o->d_obj);
  988. }
  989. void BReactorLimit_Free (BReactorLimit *o)
  990. {
  991. BReactor *reactor = o->reactor;
  992. DebugObject_Free(&o->d_obj);
  993. DebugCounter_Decrement(&reactor->d_limits_ctr);
  994. // remove from active limits list
  995. if (o->count > 0) {
  996. LinkedList1_Remove(&reactor->active_limits_list, &o->active_limits_list_node);
  997. }
  998. }
  999. int BReactorLimit_Increment (BReactorLimit *o)
  1000. {
  1001. BReactor *reactor = o->reactor;
  1002. DebugObject_Access(&o->d_obj);
  1003. // check count against limit
  1004. if (o->count >= o->limit) {
  1005. return 0;
  1006. }
  1007. // increment count
  1008. o->count++;
  1009. // if limit was zero, add to active limits list
  1010. if (o->count == 1) {
  1011. LinkedList1_Append(&reactor->active_limits_list, &o->active_limits_list_node);
  1012. }
  1013. return 1;
  1014. }
  1015. void BReactorLimit_SetLimit (BReactorLimit *o, int limit)
  1016. {
  1017. DebugObject_Access(&o->d_obj);
  1018. ASSERT(limit > 0)
  1019. // set limit
  1020. o->limit = limit;
  1021. }
  1022. #ifdef BADVPN_USE_KEVENT
  1023. int BReactorKEvent_Init (BReactorKEvent *o, BReactor *reactor, BReactorKEvent_handler handler, void *user, uintptr_t ident, short filter, u_int fflags, intptr_t data)
  1024. {
  1025. DebugObject_Access(&reactor->d_obj);
  1026. // init arguments
  1027. o->reactor = reactor;
  1028. o->handler = handler;
  1029. o->user = user;
  1030. o->ident = ident;
  1031. o->filter = filter;
  1032. // add kevent
  1033. struct kevent event;
  1034. memset(&event, 0, sizeof(event));
  1035. event.ident = o->ident;
  1036. event.filter = o->filter;
  1037. event.flags = EV_ADD;
  1038. event.fflags = fflags;
  1039. event.data = data;
  1040. event.udata = &o->kevent_tag;
  1041. if (kevent(o->reactor->kqueue_fd, &event, 1, NULL, 0, NULL) < 0) {
  1042. return 0;
  1043. }
  1044. // set kevent tag
  1045. o->kevent_tag = KEVENT_TAG_KEVENT;
  1046. // set kevent returned pointer
  1047. o->kevent_returned_ptr = NULL;
  1048. DebugObject_Init(&o->d_obj);
  1049. DebugCounter_Increment(&o->reactor->d_kevent_ctr);
  1050. return 1;
  1051. }
  1052. void BReactorKEvent_Free (BReactorKEvent *o)
  1053. {
  1054. DebugObject_Free(&o->d_obj);
  1055. DebugCounter_Decrement(&o->reactor->d_kevent_ctr);
  1056. // write through kevent returned pointer
  1057. if (o->kevent_returned_ptr) {
  1058. *o->kevent_returned_ptr = NULL;
  1059. }
  1060. // delete kevent
  1061. struct kevent event;
  1062. memset(&event, 0, sizeof(event));
  1063. event.ident = o->ident;
  1064. event.filter = o->filter;
  1065. event.flags = EV_DELETE;
  1066. ASSERT_FORCE(kevent(o->reactor->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  1067. }
  1068. #endif
  1069. #ifdef BADVPN_USE_WINAPI
  1070. HANDLE BReactor_GetIOCPHandle (BReactor *reactor)
  1071. {
  1072. DebugObject_Access(&reactor->d_obj);
  1073. return reactor->iocp_handle;
  1074. }
  1075. void BReactorIOCPOverlapped_Init (BReactorIOCPOverlapped *o, BReactor *reactor, void *user, BReactorIOCPOverlapped_handler handler)
  1076. {
  1077. DebugObject_Access(&reactor->d_obj);
  1078. // init arguments
  1079. o->reactor = reactor;
  1080. o->user = user;
  1081. o->handler = handler;
  1082. // zero overlapped
  1083. memset(&o->olap, 0, sizeof(o->olap));
  1084. // append to IOCP list
  1085. LinkedList1_Append(&reactor->iocp_list, &o->iocp_list_node);
  1086. // set not ready
  1087. o->is_ready = 0;
  1088. DebugObject_Init(&o->d_obj);
  1089. }
  1090. void BReactorIOCPOverlapped_Free (BReactorIOCPOverlapped *o)
  1091. {
  1092. BReactor *reactor = o->reactor;
  1093. DebugObject_Free(&o->d_obj);
  1094. // remove from IOCP ready list
  1095. if (o->is_ready) {
  1096. LinkedList1_Remove(&reactor->iocp_ready_list, &o->ready_list_node);
  1097. }
  1098. // remove from IOCP list
  1099. LinkedList1_Remove(&reactor->iocp_list, &o->iocp_list_node);
  1100. }
  1101. void BReactorIOCPOverlapped_Wait (BReactorIOCPOverlapped *o, int *out_succeeded, DWORD *out_bytes)
  1102. {
  1103. BReactor *reactor = o->reactor;
  1104. DebugObject_Access(&o->d_obj);
  1105. // wait for IOCP events until we get an event for this olap
  1106. while (!o->is_ready) {
  1107. DWORD bytes = 0;
  1108. ULONG_PTR key;
  1109. BReactorIOCPOverlapped *olap = NULL;
  1110. BOOL res = GetQueuedCompletionStatus(reactor->iocp_handle, &bytes, &key, (OVERLAPPED **)&olap, INFINITE);
  1111. ASSERT_FORCE(olap)
  1112. DebugObject_Access(&olap->d_obj);
  1113. ASSERT(olap->reactor == reactor)
  1114. // regular I/O should be done synchronously, so we shoudln't ever get a second completion before an
  1115. // existing one is dispatched. If however PostQueuedCompletionStatus is being used to signal events,
  1116. // just discard any excess events.
  1117. if (!olap->is_ready) {
  1118. set_iocp_ready(olap, (res == TRUE), bytes);
  1119. }
  1120. }
  1121. // remove from IOCP ready list
  1122. LinkedList1_Remove(&reactor->iocp_ready_list, &o->ready_list_node);
  1123. // set not ready
  1124. o->is_ready = 0;
  1125. if (out_succeeded) {
  1126. *out_succeeded = o->ready_succeeded;
  1127. }
  1128. if (out_bytes) {
  1129. *out_bytes = o->ready_bytes;
  1130. }
  1131. }
  1132. #endif