BReactor_badvpn.c 39 KB

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