delay_manager.cpp 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113
  1. /*
  2. * delay_manager.cpp
  3. *
  4. * Created on: Sep 15, 2017
  5. * Author: root
  6. */
  7. #include "delay_manager.h"
  8. #include "log.h"
  9. #include "packet.h"
  10. int delay_data_t::handle() {
  11. return my_send(dest, data, len) >= 0;
  12. }
  13. delay_manager_t::delay_manager_t() {
  14. capacity = 0;
  15. // if ((timer_fd = timerfd_create(CLOCK_MONOTONIC, TFD_NONBLOCK)) < 0)
  16. //{
  17. // mylog(log_fatal,"timer_fd create error");
  18. // myexit(1);
  19. // }
  20. // itimerspec zero_its;
  21. // memset(&zero_its, 0, sizeof(zero_its));
  22. // timerfd_settime(timer_fd, TFD_TIMER_ABSTIME, &zero_its, 0);
  23. }
  24. delay_manager_t::~delay_manager_t() {
  25. // TODO ,we currently dont need to deconstruct it
  26. }
  27. /*
  28. int delay_manager_t::get_timer_fd()
  29. {
  30. return timer_fd;
  31. }*/
  32. // int add(my_time_t delay,const dest_t &dest,const char *data,int len);
  33. int delay_manager_t::add(my_time_t delay, const dest_t &dest, char *data, int len) {
  34. delay_data_t delay_data;
  35. delay_data.dest = dest;
  36. // delay_data.data=data;
  37. delay_data.len = len;
  38. if (capacity != 0 && int(delay_mp.size()) >= capacity) {
  39. mylog(log_warn, "max pending packet reached,ignored\n");
  40. return -1;
  41. }
  42. if (delay == 0) {
  43. static char buf[buf_len];
  44. delay_data.data = buf;
  45. memcpy(buf, data, len);
  46. int ret = delay_data.handle();
  47. if (ret != 0) {
  48. mylog(log_trace, "handle() return %d\n", ret);
  49. }
  50. return 0;
  51. }
  52. delay_data_t tmp = delay_data;
  53. tmp.data = (char *)malloc(delay_data.len + 100);
  54. if (!tmp.data) {
  55. mylog(log_warn, "malloc() returned null in delay_manager_t::add()");
  56. return -1;
  57. }
  58. memcpy(tmp.data, data, delay_data.len);
  59. my_time_t tmp_time = get_current_time_us();
  60. tmp_time += delay;
  61. delay_mp.insert(make_pair(tmp_time, tmp));
  62. ////check(); check everytime when add, is it better ??
  63. return 0;
  64. }
  65. int delay_manager_t::check() {
  66. if (!delay_mp.empty()) {
  67. my_time_t current_time;
  68. multimap<my_time_t, delay_data_t>::iterator it;
  69. while (1) {
  70. int ret = 0;
  71. it = delay_mp.begin();
  72. if (it == delay_mp.end()) break;
  73. current_time = get_current_time_us();
  74. if (it->first <= current_time) {
  75. ret = it->second.handle();
  76. if (ret != 0) {
  77. mylog(log_trace, "handle() return %d\n", ret);
  78. }
  79. free(it->second.data);
  80. delay_mp.erase(it);
  81. } else {
  82. break;
  83. }
  84. }
  85. if (!delay_mp.empty()) {
  86. const double m = 1000 * 1000;
  87. double timer_value = delay_mp.begin()->first / m - get_current_time_us() / m; // be aware of negative value, and be aware of uint
  88. if (timer_value < 0) timer_value = 0; // set it to 0 if negative, although libev support negative value
  89. ev_timer_stop(loop, &timer);
  90. ev_timer_set(&timer, timer_value, 0);
  91. ev_timer_start(loop, &timer);
  92. } else {
  93. ev_timer_stop(loop, &timer); // not necessary
  94. }
  95. }
  96. return 0;
  97. }