BReactor.c 37 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313
  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 <base/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. // reset limit objects
  413. LinkedList1Node *list_node;
  414. while (list_node = LinkedList1_GetFirst(&bsys->active_limits_list)) {
  415. BReactorLimit *limit = UPPER_OBJECT(list_node, BReactorLimit, active_limits_list_node);
  416. ASSERT(limit->count > 0)
  417. limit->count = 0;
  418. LinkedList1_Remove(&bsys->active_limits_list, &limit->active_limits_list_node);
  419. }
  420. }
  421. #ifdef BADVPN_USE_WINAPI
  422. void BHandle_Init (BHandle *bh, HANDLE handle, BHandle_handler handler, void *user)
  423. {
  424. bh->h = handle;
  425. bh->handler = handler;
  426. bh->user = user;
  427. bh->active = 0;
  428. }
  429. #else
  430. void BFileDescriptor_Init (BFileDescriptor *bs, int fd, BFileDescriptor_handler handler, void *user)
  431. {
  432. bs->fd = fd;
  433. bs->handler = handler;
  434. bs->user = user;
  435. bs->active = 0;
  436. }
  437. #endif
  438. void BTimer_Init (BTimer *bt, btime_t msTime, BTimer_handler handler, void *handler_pointer)
  439. {
  440. bt->msTime = msTime;
  441. bt->handler = handler;
  442. bt->handler_pointer = handler_pointer;
  443. bt->active = 0;
  444. }
  445. int BTimer_IsRunning (BTimer *bt)
  446. {
  447. ASSERT(bt->active == 0 || bt->active == 1)
  448. return bt->active;
  449. }
  450. int BReactor_Init (BReactor *bsys)
  451. {
  452. BLog(BLOG_DEBUG, "Reactor initializing");
  453. // set not exiting
  454. bsys->exiting = 0;
  455. // init jobs
  456. BPendingGroup_Init(&bsys->pending_jobs);
  457. // init timers
  458. BHeap_Init(&bsys->timers_heap, OFFSET_DIFF(BTimer, absTime, heap_node), (BHeap_comparator)timer_comparator, NULL);
  459. LinkedList1_Init(&bsys->timers_expired_list);
  460. // init limits
  461. LinkedList1_Init(&bsys->active_limits_list);
  462. #ifdef BADVPN_USE_WINAPI
  463. bsys->num_handles = 0;
  464. bsys->enabled_num = 0;
  465. bsys->returned_object = NULL;
  466. #endif
  467. #ifdef BADVPN_USE_EPOLL
  468. // create epoll fd
  469. if ((bsys->efd = epoll_create(10)) < 0) {
  470. BLog(BLOG_ERROR, "epoll_create failed");
  471. goto fail0;
  472. }
  473. // init results array
  474. bsys->epoll_results_num = 0;
  475. bsys->epoll_results_pos = 0;
  476. #endif
  477. #ifdef BADVPN_USE_KEVENT
  478. // create kqueue fd
  479. if ((bsys->kqueue_fd = kqueue()) < 0) {
  480. BLog(BLOG_ERROR, "kqueue failed");
  481. goto fail0;
  482. }
  483. // init results array
  484. bsys->kevent_results_num = 0;
  485. bsys->kevent_results_pos = 0;
  486. #endif
  487. #ifdef BADVPN_USE_POLL
  488. // init enabled fds list
  489. LinkedList1_Init(&bsys->poll_enabled_fds_list);
  490. // set zero enabled fds
  491. bsys->poll_num_enabled_fds = 0;
  492. // allocate results arrays
  493. if (!(bsys->poll_results_pollfds = BAllocArray(BSYSTEM_MAX_POLL_FDS, sizeof(bsys->poll_results_pollfds[0])))) {
  494. BLog(BLOG_ERROR, "BAllocArray failed");
  495. goto fail0;
  496. }
  497. if (!(bsys->poll_results_bfds = BAllocArray(BSYSTEM_MAX_POLL_FDS, sizeof(bsys->poll_results_bfds[0])))) {
  498. BLog(BLOG_ERROR, "BAllocArray failed");
  499. goto fail1;
  500. }
  501. // init results array
  502. bsys->poll_results_num = 0;
  503. bsys->poll_results_pos = 0;
  504. #endif
  505. DebugObject_Init(&bsys->d_obj);
  506. #ifndef BADVPN_USE_WINAPI
  507. DebugCounter_Init(&bsys->d_fds_counter);
  508. #endif
  509. #ifdef BADVPN_USE_KEVENT
  510. DebugCounter_Init(&bsys->d_kevent_ctr);
  511. #endif
  512. DebugCounter_Init(&bsys->d_limits_ctr);
  513. return 1;
  514. #ifdef BADVPN_USE_POLL
  515. fail1:
  516. BFree(bsys->poll_results_pollfds);
  517. #endif
  518. fail0:
  519. BPendingGroup_Free(&bsys->pending_jobs);
  520. BLog(BLOG_ERROR, "Reactor failed to initialize");
  521. return 0;
  522. }
  523. void BReactor_Free (BReactor *bsys)
  524. {
  525. // {pending group has no BPending objects}
  526. ASSERT(!BPendingGroup_HasJobs(&bsys->pending_jobs))
  527. ASSERT(!BHeap_GetFirst(&bsys->timers_heap))
  528. ASSERT(LinkedList1_IsEmpty(&bsys->timers_expired_list))
  529. ASSERT(LinkedList1_IsEmpty(&bsys->active_limits_list))
  530. #ifdef BADVPN_USE_WINAPI
  531. ASSERT(bsys->num_handles == 0)
  532. #endif
  533. DebugObject_Free(&bsys->d_obj);
  534. #ifndef BADVPN_USE_WINAPI
  535. DebugCounter_Free(&bsys->d_fds_counter);
  536. #endif
  537. #ifdef BADVPN_USE_KEVENT
  538. DebugCounter_Free(&bsys->d_kevent_ctr);
  539. #endif
  540. DebugCounter_Free(&bsys->d_limits_ctr);
  541. #ifdef BADVPN_USE_POLL
  542. ASSERT(bsys->poll_num_enabled_fds == 0)
  543. ASSERT(LinkedList1_IsEmpty(&bsys->poll_enabled_fds_list))
  544. #endif
  545. BLog(BLOG_DEBUG, "Reactor freeing");
  546. #ifdef BADVPN_USE_EPOLL
  547. // close epoll fd
  548. ASSERT_FORCE(close(bsys->efd) == 0)
  549. #endif
  550. #ifdef BADVPN_USE_KEVENT
  551. // close kqueue fd
  552. ASSERT_FORCE(close(bsys->kqueue_fd) == 0)
  553. #endif
  554. #ifdef BADVPN_USE_POLL
  555. // free results arrays
  556. BFree(bsys->poll_results_bfds);
  557. BFree(bsys->poll_results_pollfds);
  558. #endif
  559. // free jobs
  560. BPendingGroup_Free(&bsys->pending_jobs);
  561. }
  562. int BReactor_Exec (BReactor *bsys)
  563. {
  564. BLog(BLOG_DEBUG, "Entering event loop");
  565. while (!bsys->exiting) {
  566. // dispatch job
  567. if (BPendingGroup_HasJobs(&bsys->pending_jobs)) {
  568. BPendingGroup_ExecuteJob(&bsys->pending_jobs);
  569. continue;
  570. }
  571. // dispatch timer
  572. LinkedList1Node *list_node = LinkedList1_GetFirst(&bsys->timers_expired_list);
  573. if (list_node) {
  574. BTimer *timer = UPPER_OBJECT(list_node, BTimer, list_node);
  575. ASSERT(timer->active)
  576. ASSERT(timer->expired)
  577. // remove from expired list
  578. LinkedList1_Remove(&bsys->timers_expired_list, &timer->list_node);
  579. // set inactive
  580. timer->active = 0;
  581. // call handler
  582. BLog(BLOG_DEBUG, "Dispatching timer");
  583. timer->handler(timer->handler_pointer);
  584. continue;
  585. }
  586. #ifdef BADVPN_USE_WINAPI
  587. // dispatch handle
  588. if (bsys->returned_object) {
  589. BHandle *bh = bsys->returned_object;
  590. bsys->returned_object = NULL;
  591. ASSERT(bh->active)
  592. ASSERT(bh->position >= 0 && bh->position < bsys->enabled_num)
  593. ASSERT(bh == bsys->enabled_objects[bh->position])
  594. ASSERT(bh->h == bsys->enabled_handles[bh->position])
  595. // call handler
  596. BLog(BLOG_DEBUG, "Dispatching handle");
  597. bh->handler(bh->user);
  598. continue;
  599. }
  600. #endif
  601. #ifdef BADVPN_USE_EPOLL
  602. // dispatch file descriptor
  603. if (bsys->epoll_results_pos < bsys->epoll_results_num) {
  604. // grab event
  605. struct epoll_event *event = &bsys->epoll_results[bsys->epoll_results_pos];
  606. bsys->epoll_results_pos++;
  607. // check if the BFileDescriptor was removed
  608. if (!event->data.ptr) {
  609. continue;
  610. }
  611. // get BFileDescriptor
  612. BFileDescriptor *bfd = (BFileDescriptor *)event->data.ptr;
  613. ASSERT(bfd->active)
  614. ASSERT(bfd->epoll_returned_ptr == (BFileDescriptor **)&event->data.ptr)
  615. // zero pointer to the epoll entry
  616. bfd->epoll_returned_ptr = NULL;
  617. // calculate events to report
  618. int events = 0;
  619. if ((bfd->waitEvents&BREACTOR_READ) && (event->events&EPOLLIN)) {
  620. events |= BREACTOR_READ;
  621. }
  622. if ((bfd->waitEvents&BREACTOR_WRITE) && (event->events&EPOLLOUT)) {
  623. events |= BREACTOR_WRITE;
  624. }
  625. if ((event->events&EPOLLERR) || (event->events&EPOLLHUP)) {
  626. events |= BREACTOR_ERROR;
  627. }
  628. if (!events) {
  629. BLog(BLOG_ERROR, "no events detected?");
  630. continue;
  631. }
  632. // call handler
  633. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  634. bfd->handler(bfd->user, events);
  635. continue;
  636. }
  637. #endif
  638. #ifdef BADVPN_USE_KEVENT
  639. // dispatch kevent
  640. if (bsys->kevent_results_pos < bsys->kevent_results_num) {
  641. // grab event
  642. struct kevent *event = &bsys->kevent_results[bsys->kevent_results_pos];
  643. bsys->kevent_results_pos++;
  644. // check if the event was removed
  645. if (!event->udata) {
  646. continue;
  647. }
  648. // check tag
  649. int *tag = event->udata;
  650. switch (*tag) {
  651. case KEVENT_TAG_FD: {
  652. // get BFileDescriptor
  653. BFileDescriptor *bfd = UPPER_OBJECT(tag, BFileDescriptor, kevent_tag);
  654. ASSERT(bfd->active)
  655. ASSERT(bfd->kevent_returned_ptr == (int **)&event->udata)
  656. // zero pointer to the kevent entry
  657. bfd->kevent_returned_ptr = NULL;
  658. // calculate event to report
  659. int events = 0;
  660. if ((bfd->waitEvents&BREACTOR_READ) && event->filter == EVFILT_READ) {
  661. events |= BREACTOR_READ;
  662. }
  663. if ((bfd->waitEvents&BREACTOR_WRITE) && event->filter == EVFILT_WRITE) {
  664. events |= BREACTOR_WRITE;
  665. }
  666. if (!events) {
  667. BLog(BLOG_ERROR, "no events detected?");
  668. continue;
  669. }
  670. // call handler
  671. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  672. bfd->handler(bfd->user, events);
  673. continue;
  674. } break;
  675. case KEVENT_TAG_KEVENT: {
  676. // get BReactorKEvent
  677. BReactorKEvent *kev = UPPER_OBJECT(tag, BReactorKEvent, kevent_tag);
  678. ASSERT(kev->reactor == bsys)
  679. ASSERT(kev->kevent_returned_ptr == (int **)&event->udata)
  680. // zero pointer to the kevent entry
  681. kev->kevent_returned_ptr = NULL;
  682. // call handler
  683. BLog(BLOG_DEBUG, "Dispatching kevent");
  684. kev->handler(kev->user, event->fflags, event->data);
  685. continue;
  686. } break;
  687. default:
  688. ASSERT(0);
  689. }
  690. }
  691. #endif
  692. #ifdef BADVPN_USE_POLL
  693. if (bsys->poll_results_pos < bsys->poll_results_num) {
  694. // grab event
  695. struct pollfd *pfd = &bsys->poll_results_pollfds[bsys->poll_results_pos];
  696. BFileDescriptor *bfd = bsys->poll_results_bfds[bsys->poll_results_pos];
  697. bsys->poll_results_pos++;
  698. // skip removed entry
  699. if (!bfd) {
  700. continue;
  701. }
  702. ASSERT(bfd->active)
  703. ASSERT(bfd->poll_returned_index == bsys->poll_results_pos - 1)
  704. // remove result reference
  705. bfd->poll_returned_index = -1;
  706. // calculate events to report
  707. int events = 0;
  708. if ((bfd->waitEvents & BREACTOR_READ) && (pfd->revents & POLLIN)) {
  709. events |= BREACTOR_READ;
  710. }
  711. if ((bfd->waitEvents & BREACTOR_WRITE) && (pfd->revents & POLLOUT)) {
  712. events |= BREACTOR_WRITE;
  713. }
  714. if ((pfd->revents & POLLERR) || (pfd->revents & POLLHUP)) {
  715. events |= BREACTOR_ERROR;
  716. }
  717. if (!events) {
  718. continue;
  719. }
  720. // call handler
  721. BLog(BLOG_DEBUG, "Dispatching file descriptor");
  722. bfd->handler(bfd->user, events);
  723. continue;
  724. }
  725. #endif
  726. wait_for_events(bsys);
  727. }
  728. BLog(BLOG_DEBUG, "Exiting event loop, exit code %d", bsys->exit_code);
  729. return bsys->exit_code;
  730. }
  731. void BReactor_Quit (BReactor *bsys, int code)
  732. {
  733. bsys->exiting = 1;
  734. bsys->exit_code = code;
  735. }
  736. void BReactor_SetTimer (BReactor *bsys, BTimer *bt)
  737. {
  738. BReactor_SetTimerAfter(bsys, bt, bt->msTime);
  739. }
  740. void BReactor_SetTimerAfter (BReactor *bsys, BTimer *bt, btime_t after)
  741. {
  742. BReactor_SetTimerAbsolute(bsys, bt, btime_add(btime_gettime(), after));
  743. }
  744. void BReactor_SetTimerAbsolute (BReactor *bsys, BTimer *bt, btime_t time)
  745. {
  746. // unlink it if it's already in the list
  747. BReactor_RemoveTimer(bsys, bt);
  748. // initialize timer
  749. bt->active = 1;
  750. bt->expired = 0;
  751. bt->absTime = time;
  752. // insert to running timers heap
  753. BHeap_Insert(&bsys->timers_heap, &bt->heap_node);
  754. }
  755. void BReactor_RemoveTimer (BReactor *bsys, BTimer *bt)
  756. {
  757. if (!bt->active) {
  758. return;
  759. }
  760. if (bt->expired) {
  761. // remove from expired list
  762. LinkedList1_Remove(&bsys->timers_expired_list, &bt->list_node);
  763. } else {
  764. // remove from running heap
  765. BHeap_Remove(&bsys->timers_heap, &bt->heap_node);
  766. }
  767. // set inactive
  768. bt->active = 0;
  769. }
  770. BPendingGroup * BReactor_PendingGroup (BReactor *bsys)
  771. {
  772. return &bsys->pending_jobs;
  773. }
  774. int BReactor_Synchronize (BReactor *bsys, BPending *ref)
  775. {
  776. ASSERT(ref)
  777. while (!bsys->exiting) {
  778. ASSERT(BPendingGroup_HasJobs(&bsys->pending_jobs))
  779. if (BPendingGroup_PeekJob(&bsys->pending_jobs) == ref) {
  780. return 1;
  781. }
  782. BPendingGroup_ExecuteJob(&bsys->pending_jobs);
  783. }
  784. return 0;
  785. }
  786. #ifdef BADVPN_USE_WINAPI
  787. int BReactor_AddHandle (BReactor *bsys, BHandle *bh)
  788. {
  789. ASSERT(!bh->active)
  790. if (bsys->num_handles >= BSYSTEM_MAX_HANDLES) {
  791. return 0;
  792. }
  793. bh->active = 1;
  794. bh->position = -1;
  795. bsys->num_handles++;
  796. return 1;
  797. }
  798. void BReactor_RemoveHandle (BReactor *bsys, BHandle *bh)
  799. {
  800. ASSERT(bh->active)
  801. if (bh->position >= 0) {
  802. BReactor_DisableHandle(bsys, bh);
  803. }
  804. bh->active = 0;
  805. ASSERT(bsys->num_handles > 0)
  806. bsys->num_handles--;
  807. }
  808. void BReactor_EnableHandle (BReactor *bsys, BHandle *bh)
  809. {
  810. ASSERT(bh->active)
  811. ASSERT(bh->position == -1)
  812. ASSERT(bsys->enabled_num < BSYSTEM_MAX_HANDLES)
  813. bsys->enabled_handles[bsys->enabled_num] = bh->h;
  814. bsys->enabled_objects[bsys->enabled_num] = bh;
  815. bh->position = bsys->enabled_num;
  816. bsys->enabled_num++;
  817. }
  818. void BReactor_DisableHandle (BReactor *bsys, BHandle *bh)
  819. {
  820. ASSERT(bh->active)
  821. ASSERT(bh->position >= 0)
  822. ASSERT(bh->position < bsys->enabled_num)
  823. ASSERT(bh == bsys->enabled_objects[bh->position])
  824. ASSERT(bh->h == bsys->enabled_handles[bh->position])
  825. // if there are more handles after this one, move the last
  826. // one into its position
  827. if (bh->position < bsys->enabled_num - 1) {
  828. int move_position = bsys->enabled_num - 1;
  829. BHandle *move_handle = bsys->enabled_objects[move_position];
  830. ASSERT(move_handle->active)
  831. ASSERT(move_handle->position == move_position)
  832. ASSERT(move_handle->h == bsys->enabled_handles[move_position])
  833. bsys->enabled_handles[bh->position] = move_handle->h;
  834. bsys->enabled_objects[bh->position] = move_handle;
  835. move_handle->position = bh->position;
  836. }
  837. bh->position = -1;
  838. bsys->enabled_num--;
  839. // make sure the handler will not be called
  840. if (bsys->returned_object == bh) {
  841. bsys->returned_object = NULL;
  842. }
  843. }
  844. #else
  845. int BReactor_AddFileDescriptor (BReactor *bsys, BFileDescriptor *bs)
  846. {
  847. ASSERT(!bs->active)
  848. #ifdef BADVPN_USE_EPOLL
  849. // add epoll entry
  850. struct epoll_event event;
  851. memset(&event, 0, sizeof(event));
  852. event.events = 0;
  853. event.data.ptr = bs;
  854. if (epoll_ctl(bsys->efd, EPOLL_CTL_ADD, bs->fd, &event) < 0) {
  855. int error = errno;
  856. BLog(BLOG_ERROR, "epoll_ctl failed: %d", error);
  857. return 0;
  858. }
  859. // set epoll returned pointer
  860. bs->epoll_returned_ptr = NULL;
  861. #endif
  862. #ifdef BADVPN_USE_KEVENT
  863. // set kevent tag
  864. bs->kevent_tag = KEVENT_TAG_FD;
  865. // set kevent returned pointer
  866. bs->kevent_returned_ptr = NULL;
  867. #endif
  868. #ifdef BADVPN_USE_POLL
  869. if (bsys->poll_num_enabled_fds == BSYSTEM_MAX_POLL_FDS) {
  870. BLog(BLOG_ERROR, "too many fds");
  871. return 0;
  872. }
  873. // append to enabled fds list
  874. LinkedList1_Append(&bsys->poll_enabled_fds_list, &bs->poll_enabled_fds_list_node);
  875. bsys->poll_num_enabled_fds++;
  876. // set not returned
  877. bs->poll_returned_index = -1;
  878. #endif
  879. bs->active = 1;
  880. bs->waitEvents = 0;
  881. DebugCounter_Increment(&bsys->d_fds_counter);
  882. return 1;
  883. }
  884. void BReactor_RemoveFileDescriptor (BReactor *bsys, BFileDescriptor *bs)
  885. {
  886. ASSERT(bs->active)
  887. DebugCounter_Decrement(&bsys->d_fds_counter);
  888. bs->active = 0;
  889. #ifdef BADVPN_USE_EPOLL
  890. // delete epoll entry
  891. ASSERT_FORCE(epoll_ctl(bsys->efd, EPOLL_CTL_DEL, bs->fd, NULL) == 0)
  892. // write through epoll returned pointer
  893. if (bs->epoll_returned_ptr) {
  894. *bs->epoll_returned_ptr = NULL;
  895. }
  896. #endif
  897. #ifdef BADVPN_USE_KEVENT
  898. // delete kevents
  899. update_kevent_fd_events(bsys, bs, 0);
  900. // write through kevent returned pointer
  901. if (bs->kevent_returned_ptr) {
  902. *bs->kevent_returned_ptr = NULL;
  903. }
  904. #endif
  905. #ifdef BADVPN_USE_POLL
  906. // invalidate results entry
  907. if (bs->poll_returned_index != -1) {
  908. ASSERT(bs->poll_returned_index >= bsys->poll_results_pos)
  909. ASSERT(bs->poll_returned_index < bsys->poll_results_num)
  910. ASSERT(bsys->poll_results_bfds[bs->poll_returned_index] == bs)
  911. bsys->poll_results_bfds[bs->poll_returned_index] = NULL;
  912. }
  913. // remove from enabled fds list
  914. LinkedList1_Remove(&bsys->poll_enabled_fds_list, &bs->poll_enabled_fds_list_node);
  915. bsys->poll_num_enabled_fds--;
  916. #endif
  917. }
  918. void BReactor_SetFileDescriptorEvents (BReactor *bsys, BFileDescriptor *bs, int events)
  919. {
  920. ASSERT(bs->active)
  921. ASSERT(!(events&~(BREACTOR_READ|BREACTOR_WRITE)))
  922. if (bs->waitEvents == events) {
  923. return;
  924. }
  925. #ifdef BADVPN_USE_EPOLL
  926. // calculate epoll events
  927. int eevents = 0;
  928. if ((events & BREACTOR_READ)) {
  929. eevents |= EPOLLIN;
  930. }
  931. if ((events & BREACTOR_WRITE)) {
  932. eevents |= EPOLLOUT;
  933. }
  934. // update epoll entry
  935. struct epoll_event event;
  936. memset(&event, 0, sizeof(event));
  937. event.events = eevents;
  938. event.data.ptr = bs;
  939. ASSERT_FORCE(epoll_ctl(bsys->efd, EPOLL_CTL_MOD, bs->fd, &event) == 0)
  940. #endif
  941. #ifdef BADVPN_USE_KEVENT
  942. update_kevent_fd_events(bsys, bs, events);
  943. #endif
  944. // update events
  945. bs->waitEvents = events;
  946. }
  947. #endif
  948. void BReactorLimit_Init (BReactorLimit *o, BReactor *reactor, int limit)
  949. {
  950. DebugObject_Access(&reactor->d_obj);
  951. ASSERT(limit > 0)
  952. // init arguments
  953. o->reactor = reactor;
  954. o->limit = limit;
  955. // set count zero
  956. o->count = 0;
  957. DebugCounter_Increment(&reactor->d_limits_ctr);
  958. DebugObject_Init(&o->d_obj);
  959. }
  960. void BReactorLimit_Free (BReactorLimit *o)
  961. {
  962. BReactor *reactor = o->reactor;
  963. DebugObject_Free(&o->d_obj);
  964. DebugCounter_Decrement(&reactor->d_limits_ctr);
  965. // remove from active limits list
  966. if (o->count > 0) {
  967. LinkedList1_Remove(&reactor->active_limits_list, &o->active_limits_list_node);
  968. }
  969. }
  970. int BReactorLimit_Increment (BReactorLimit *o)
  971. {
  972. BReactor *reactor = o->reactor;
  973. DebugObject_Access(&o->d_obj);
  974. // check count against limit
  975. if (o->count >= o->limit) {
  976. return 0;
  977. }
  978. // increment count
  979. o->count++;
  980. // if limit was zero, add to active limits list
  981. if (o->count == 1) {
  982. LinkedList1_Append(&reactor->active_limits_list, &o->active_limits_list_node);
  983. }
  984. return 1;
  985. }
  986. void BReactorLimit_SetLimit (BReactorLimit *o, int limit)
  987. {
  988. DebugObject_Access(&o->d_obj);
  989. ASSERT(limit > 0)
  990. // set limit
  991. o->limit = limit;
  992. }
  993. #ifdef BADVPN_USE_KEVENT
  994. int BReactorKEvent_Init (BReactorKEvent *o, BReactor *reactor, BReactorKEvent_handler handler, void *user, uintptr_t ident, short filter, u_int fflags, intptr_t data)
  995. {
  996. DebugObject_Access(&reactor->d_obj);
  997. // init arguments
  998. o->reactor = reactor;
  999. o->handler = handler;
  1000. o->user = user;
  1001. o->ident = ident;
  1002. o->filter = filter;
  1003. // add kevent
  1004. struct kevent event;
  1005. memset(&event, 0, sizeof(event));
  1006. event.ident = o->ident;
  1007. event.filter = o->filter;
  1008. event.flags = EV_ADD;
  1009. event.fflags = fflags;
  1010. event.data = data;
  1011. event.udata = &o->kevent_tag;
  1012. if (kevent(o->reactor->kqueue_fd, &event, 1, NULL, 0, NULL) < 0) {
  1013. return 0;
  1014. }
  1015. // set kevent tag
  1016. o->kevent_tag = KEVENT_TAG_KEVENT;
  1017. // set kevent returned pointer
  1018. o->kevent_returned_ptr = NULL;
  1019. DebugObject_Init(&o->d_obj);
  1020. DebugCounter_Increment(&o->reactor->d_kevent_ctr);
  1021. return 1;
  1022. }
  1023. void BReactorKEvent_Free (BReactorKEvent *o)
  1024. {
  1025. DebugObject_Free(&o->d_obj);
  1026. DebugCounter_Decrement(&o->reactor->d_kevent_ctr);
  1027. // write through kevent returned pointer
  1028. if (o->kevent_returned_ptr) {
  1029. *o->kevent_returned_ptr = NULL;
  1030. }
  1031. // delete kevent
  1032. struct kevent event;
  1033. memset(&event, 0, sizeof(event));
  1034. event.ident = o->ident;
  1035. event.filter = o->filter;
  1036. event.flags = EV_DELETE;
  1037. ASSERT_FORCE(kevent(o->reactor->kqueue_fd, &event, 1, NULL, 0, NULL) == 0)
  1038. }
  1039. #endif