hloop.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390
  1. #include "hloop.h"
  2. #include "hevent.h"
  3. #include "iowatcher.h"
  4. #include "hdef.h"
  5. #include "hlog.h"
  6. #include "hmath.h"
  7. #define PAUSE_TIME 10 // ms
  8. #define MAX_BLOCK_TIME 1000 // ms
  9. #define IO_ARRAY_INIT_SIZE 64
  10. static void hio_init(hio_t* io);
  11. static void hio_deinit(hio_t* io);
  12. static void hio_free(hio_t* io);
  13. static int timers_compare(const struct heap_node* lhs, const struct heap_node* rhs) {
  14. return TIMER_ENTRY(lhs)->next_timeout < TIMER_ENTRY(rhs)->next_timeout;
  15. }
  16. static int hloop_process_idles(hloop_t* loop) {
  17. int nidles = 0;
  18. struct list_node* node = loop->idles.next;
  19. hidle_t* idle = NULL;
  20. while (node != &loop->idles) {
  21. idle = IDLE_ENTRY(node);
  22. if (idle->destroy) goto destroy;
  23. if (!idle->active) goto next;
  24. if (idle->repeat == 0) {
  25. hidle_del(idle);
  26. //goto next;
  27. goto destroy;
  28. }
  29. if (idle->repeat != INFINITE) {
  30. --idle->repeat;
  31. }
  32. EVENT_PENDING(idle);
  33. ++nidles;
  34. next:
  35. node = node->next;
  36. continue;
  37. destroy:
  38. node = node->next;
  39. list_del(node->prev);
  40. free(idle);
  41. }
  42. return nidles;
  43. }
  44. static int hloop_process_timers(hloop_t* loop) {
  45. int ntimers = 0;
  46. htimer_t* timer = NULL;
  47. uint64_t now_hrtime = hloop_now_hrtime(loop);
  48. while (loop->timers.root) {
  49. timer = TIMER_ENTRY(loop->timers.root);
  50. if (timer->destroy) goto destroy;
  51. if (timer->repeat == 0) {
  52. htimer_del(timer);
  53. goto destroy;
  54. }
  55. if (timer->next_timeout > now_hrtime) {
  56. break;
  57. }
  58. if (timer->repeat != INFINITE) {
  59. --timer->repeat;
  60. }
  61. heap_dequeue(&loop->timers);
  62. if (timer->event_type == HEVENT_TYPE_TIMEOUT) {
  63. timer->next_timeout += ((htimeout_t*)timer)->timeout*1000;
  64. }
  65. else if (timer->event_type == HEVENT_TYPE_PERIOD) {
  66. hperiod_t* period = (hperiod_t*)timer;
  67. timer->next_timeout = calc_next_timeout(period->minute, period->hour, period->day,
  68. period->week, period->month) * 1e6;
  69. }
  70. heap_insert(&loop->timers, &timer->node);
  71. EVENT_PENDING(timer);
  72. ++ntimers;
  73. continue;
  74. destroy:
  75. heap_dequeue(&loop->timers);
  76. free(timer);
  77. }
  78. return ntimers;
  79. }
  80. static int hloop_process_ios(hloop_t* loop, int timeout) {
  81. int nevents = iowatcher_poll_events(loop, timeout);
  82. if (nevents < 0) {
  83. hloge("poll_events error=%d", -nevents);
  84. }
  85. return nevents < 0 ? 0 : nevents;
  86. }
  87. static int hloop_process_pendings(hloop_t* loop) {
  88. if (loop->npendings == 0) return 0;
  89. hevent_t* prev = NULL;
  90. hevent_t* next = NULL;
  91. int ncbs = 0;
  92. for (int i = HEVENT_PRIORITY_SIZE-1; i >= 0; --i) {
  93. next = loop->pendings[i];
  94. while (next) {
  95. if (next->active && next->cb) {
  96. next->cb(next);
  97. ++ncbs;
  98. }
  99. prev = next;
  100. next = next->pending_next;
  101. prev->pending = 0;
  102. prev->pending_next = NULL;
  103. }
  104. loop->pendings[i] = NULL;
  105. }
  106. loop->npendings = 0;
  107. return ncbs;
  108. }
  109. static int hloop_process_events(hloop_t* loop) {
  110. // ios -> timers -> idles
  111. int nios, ntimers, nidles;
  112. nios = ntimers = nidles = 0;
  113. int32_t blocktime = MAX_BLOCK_TIME;
  114. hloop_update_time(loop);
  115. if (loop->timers.root) {
  116. uint64_t next_min_timeout = TIMER_ENTRY(loop->timers.root)->next_timeout;
  117. blocktime = next_min_timeout - hloop_now_hrtime(loop);
  118. if (blocktime <= 0) goto process_timers;
  119. blocktime /= 1000;
  120. ++blocktime;
  121. blocktime = MIN(blocktime, MAX_BLOCK_TIME);
  122. }
  123. if (loop->nios) {
  124. nios = hloop_process_ios(loop, blocktime);
  125. }
  126. else {
  127. msleep(blocktime);
  128. }
  129. hloop_update_time(loop);
  130. process_timers:
  131. if (loop->ntimers) {
  132. ntimers = hloop_process_timers(loop);
  133. }
  134. if (loop->npendings == 0) {
  135. if (loop->nidles) {
  136. nidles= hloop_process_idles(loop);
  137. }
  138. }
  139. printd("blocktime=%d nios=%d ntimers=%d nidles=%d nactives=%d npendings=%d\n", blocktime, nios, ntimers, nidles, loop->nactives, loop->npendings);
  140. return hloop_process_pendings(loop);
  141. }
  142. int hloop_init(hloop_t* loop) {
  143. memset(loop, 0, sizeof(hloop_t));
  144. loop->status = HLOOP_STATUS_STOP;
  145. // idles
  146. list_init(&loop->idles);
  147. // timers
  148. heap_init(&loop->timers, timers_compare);
  149. // ios: init when hio_add
  150. //io_array_init(&loop->ios, IO_ARRAY_INIT_SIZE);
  151. // iowatcher: init when iowatcher_add_event
  152. //iowatcher_init(loop);
  153. // time
  154. time(&loop->start_time);
  155. loop->start_hrtime = loop->cur_hrtime = gethrtime();
  156. return 0;
  157. }
  158. void hloop_cleanup(hloop_t* loop) {
  159. // pendings
  160. for (int i = 0; i < HEVENT_PRIORITY_SIZE; ++i) {
  161. loop->pendings[i] = NULL;
  162. }
  163. // idles
  164. struct list_node* node = loop->idles.next;
  165. hidle_t* idle;
  166. while (node != &loop->idles) {
  167. idle = IDLE_ENTRY(node);
  168. node = node->next;
  169. free(idle);
  170. }
  171. list_init(&loop->idles);
  172. // timers
  173. htimer_t* timer;
  174. while (loop->timers.root) {
  175. timer = TIMER_ENTRY(node);
  176. heap_dequeue(&loop->timers);
  177. free(timer);
  178. }
  179. heap_init(&loop->timers, NULL);
  180. // ios
  181. for (int i = 0; i < loop->ios.maxsize; ++i) {
  182. hio_t* io = loop->ios.ptr[i];
  183. if (io) {
  184. hio_free(io);
  185. }
  186. }
  187. io_array_cleanup(&loop->ios);
  188. // iowatcher
  189. iowatcher_cleanup(loop);
  190. };
  191. int hloop_run(hloop_t* loop) {
  192. loop->loop_cnt = 0;
  193. loop->status = HLOOP_STATUS_RUNNING;
  194. while (loop->status != HLOOP_STATUS_STOP) {
  195. if (loop->status == HLOOP_STATUS_PAUSE) {
  196. msleep(PAUSE_TIME);
  197. hloop_update_time(loop);
  198. continue;
  199. }
  200. ++loop->loop_cnt;
  201. if (loop->nactives == 0) break;
  202. hloop_process_events(loop);
  203. }
  204. loop->status = HLOOP_STATUS_STOP;
  205. loop->end_hrtime = gethrtime();
  206. hloop_cleanup(loop);
  207. return 0;
  208. };
  209. int hloop_stop(hloop_t* loop) {
  210. loop->status = HLOOP_STATUS_STOP;
  211. return 0;
  212. }
  213. int hloop_pause(hloop_t* loop) {
  214. if (loop->status == HLOOP_STATUS_RUNNING) {
  215. loop->status = HLOOP_STATUS_PAUSE;
  216. }
  217. return 0;
  218. }
  219. int hloop_resume(hloop_t* loop) {
  220. if (loop->status == HLOOP_STATUS_PAUSE) {
  221. loop->status = HLOOP_STATUS_RUNNING;
  222. }
  223. return 0;
  224. }
  225. hidle_t* hidle_add(hloop_t* loop, hidle_cb cb, uint32_t repeat) {
  226. hidle_t* idle = (hidle_t*)malloc(sizeof(hidle_t));
  227. memset(idle, 0, sizeof(hidle_t));
  228. idle->event_type = HEVENT_TYPE_IDLE;
  229. idle->priority = HEVENT_LOWEST_PRIORITY;
  230. idle->repeat = repeat;
  231. list_add(&idle->node, &loop->idles);
  232. EVENT_ADD(loop, idle, cb);
  233. loop->nidles++;
  234. return idle;
  235. }
  236. void hidle_del(hidle_t* idle) {
  237. if (idle->destroy) return;
  238. idle->loop->nidles--;
  239. EVENT_DEL(idle);
  240. }
  241. htimer_t* htimer_add(hloop_t* loop, htimer_cb cb, uint64_t timeout, uint32_t repeat) {
  242. if (timeout == 0) return NULL;
  243. htimeout_t* timer = (htimeout_t*)malloc(sizeof(htimeout_t));
  244. memset(timer, 0, sizeof(htimeout_t));
  245. timer->event_type = HEVENT_TYPE_TIMEOUT;
  246. timer->priority = HEVENT_HIGHEST_PRIORITY;
  247. timer->repeat = repeat;
  248. timer->timeout = timeout;
  249. hloop_update_time(loop);
  250. timer->next_timeout = hloop_now_hrtime(loop) + timeout*1000;
  251. heap_insert(&loop->timers, &timer->node);
  252. EVENT_ADD(loop, timer, cb);
  253. loop->ntimers++;
  254. return (htimer_t*)timer;
  255. }
  256. htimer_t* htimer_add_period(hloop_t* loop, htimer_cb cb,
  257. int8_t minute, int8_t hour, int8_t day,
  258. int8_t week, int8_t month, uint32_t repeat) {
  259. if (minute > 59 || hour > 23 || day > 31 || week > 6 || month > 12) {
  260. return NULL;
  261. }
  262. hperiod_t* timer = (hperiod_t*)malloc(sizeof(hperiod_t));
  263. memset(timer, 0, sizeof(hperiod_t));
  264. timer->event_type = HEVENT_TYPE_PERIOD;
  265. timer->priority = HEVENT_HIGH_PRIORITY;
  266. timer->repeat = repeat;
  267. timer->minute = minute;
  268. timer->hour = hour;
  269. timer->day = day;
  270. timer->month = month;
  271. timer->week = week;
  272. timer->next_timeout = calc_next_timeout(minute, hour, day, week, month) * 1e6;
  273. heap_insert(&loop->timers, &timer->node);
  274. EVENT_ADD(loop, timer, cb);
  275. loop->ntimers++;
  276. return (htimer_t*)timer;
  277. }
  278. void htimer_del(htimer_t* timer) {
  279. if (timer->destroy) return;
  280. timer->loop->ntimers--;
  281. EVENT_DEL(timer);
  282. }
  283. void hio_init(hio_t* io) {
  284. memset(io, 0, sizeof(hio_t));
  285. io->event_type = HEVENT_TYPE_IO;
  286. io->event_index[0] = io->event_index[1] = -1;
  287. // write_queue init when hwrite try_write failed
  288. //write_queue_init(&io->write_queue, 4);;
  289. }
  290. void hio_deinit(hio_t* io) {
  291. offset_buf_t* pbuf = NULL;
  292. while (!write_queue_empty(&io->write_queue)) {
  293. pbuf = write_queue_front(&io->write_queue);
  294. SAFE_FREE(pbuf->base);
  295. write_queue_pop_front(&io->write_queue);
  296. }
  297. write_queue_cleanup(&io->write_queue);
  298. }
  299. void hio_free(hio_t* io) {
  300. if (io == NULL) return;
  301. hio_deinit(io);
  302. SAFE_FREE(io->localaddr);
  303. SAFE_FREE(io->peeraddr);
  304. free(io);
  305. }
  306. hio_t* hio_add(hloop_t* loop, hio_cb cb, int fd, int events) {
  307. if (loop->ios.maxsize == 0) {
  308. io_array_init(&loop->ios, IO_ARRAY_INIT_SIZE);
  309. }
  310. if (fd >= loop->ios.maxsize) {
  311. int newsize = ceil2e(fd);
  312. io_array_resize(&loop->ios, newsize > fd ? newsize : 2*fd);
  313. }
  314. hio_t* io = loop->ios.ptr[fd];
  315. if (io == NULL) {
  316. io = (hio_t*)malloc(sizeof(hio_t));
  317. memset(io, 0, sizeof(hio_t));
  318. loop->ios.ptr[fd] = io;
  319. }
  320. if (!io->active || io->destroy) {
  321. hio_init(io);
  322. EVENT_ADD(loop, io, cb);
  323. loop->nios++;
  324. }
  325. io->fd = fd;
  326. if (cb) {
  327. io->cb = (hevent_cb)cb;
  328. }
  329. iowatcher_add_event(loop, fd, events);
  330. io->events |= events;
  331. return io;
  332. }
  333. void hio_del(hio_t* io, int events) {
  334. if (io->destroy) return;
  335. iowatcher_del_event(io->loop, io->fd, events);
  336. io->events &= ~events;
  337. if (io->events == 0) {
  338. io->loop->nios--;
  339. hio_deinit(io);
  340. EVENT_DEL(io);
  341. }
  342. }
  343. #include "hsocket.h"
  344. hio_t* hlisten (hloop_t* loop, int port, haccept_cb accept_cb) {
  345. int listenfd = Listen(port);
  346. if (listenfd < 0) {
  347. return NULL;
  348. }
  349. hio_t* io = haccept(loop, listenfd, accept_cb);
  350. if (io == NULL) {
  351. closesocket(listenfd);
  352. }
  353. return io;
  354. }