fec_manager.h 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151
  1. /*
  2. * fec_manager.h
  3. *
  4. * Created on: Sep 27, 2017
  5. * Author: root
  6. */
  7. #ifndef FEC_MANAGER_H_
  8. #define FEC_MANAGER_H_
  9. #include "common.h"
  10. #include "log.h"
  11. #include "lib/rs.h"
  12. const int max_normal_packet_num=1000;
  13. const int max_fec_packet_num=255;
  14. const u32_t anti_replay_buff_size=30000;
  15. const u32_t fec_buff_size=3000;
  16. struct anti_replay_t
  17. {
  18. u64_t replay_buffer[anti_replay_buff_size];
  19. unordered_set<u32_t> st;
  20. int index;
  21. anti_replay_t()
  22. {
  23. memset(replay_buffer,-1,sizeof(replay_buffer));
  24. st.rehash(anti_replay_buff_size*10);
  25. index=0;
  26. }
  27. void set_invaild(u32_t seq)
  28. {
  29. if(st.find(seq)!=st.end() )
  30. {
  31. mylog(log_trace,"seq %llx exist\n",seq);
  32. return;
  33. //return 0;
  34. }
  35. if(replay_buffer[index]!=u64_t(i64_t(-1)))
  36. {
  37. assert(st.find(replay_buffer[index])!=st.end());
  38. st.erase(replay_buffer[index]);
  39. }
  40. replay_buffer[index]=seq;
  41. st.insert(seq);
  42. index++;
  43. if(index==int(anti_replay_buff_size)) index=0;
  44. //return 1; //for complier check
  45. }
  46. int is_vaild(u32_t seq)
  47. {
  48. return st.find(seq)==st.end();
  49. }
  50. };
  51. struct blob_encode_t
  52. {
  53. char buf[(max_fec_packet_num+5)*buf_len];
  54. int current_len;
  55. int counter;
  56. char *output_arr[max_fec_packet_num+100];
  57. blob_encode_t();
  58. int clear();
  59. int get_num();
  60. int get_shard_len(int n);
  61. int get_shard_len(int n,int next_packet_len);
  62. int input(char *s,int len); //len=use len=0 for second and following packet
  63. int output(int n,char ** &s_arr,int & len);
  64. };
  65. struct blob_decode_t
  66. {
  67. char buf[(max_fec_packet_num+5)*buf_len];
  68. int current_len;
  69. int last_len;
  70. int counter;
  71. char *s_buf[max_normal_packet_num+100];
  72. int len_buf[max_normal_packet_num+100];
  73. blob_decode_t();
  74. int clear();
  75. int input(char *input,int len);
  76. int output(int &n,char ** &output,int *&len_arr);
  77. };
  78. class fec_encode_manager_t
  79. {
  80. int fec_data_num,fec_redundant_num;
  81. int fec_mtu;
  82. int fec_pending_num;
  83. int fec_pending_time;
  84. char buf[max_fec_packet_num+5][buf_len+100];
  85. char *output_buf[max_fec_packet_num+5];
  86. int output_len;
  87. int ready_for_output;
  88. u32_t seq;
  89. int counter;
  90. int timer_fd;
  91. u64_t timer_fd64;
  92. blob_encode_t blob_encode;
  93. public:
  94. fec_encode_manager_t();
  95. u64_t get_timer_fd64();
  96. int re_init(int data_num,int redundant_num,int mtu,int pending_num,int pending_time);
  97. int input(char *s,int len/*,int &is_first_packet*/);
  98. int output(int &n,char ** &s_arr,int &len);
  99. };
  100. struct fec_data_t
  101. {
  102. int used;
  103. u32_t seq;
  104. int type;
  105. int data_num;
  106. int redundant_num;
  107. int idx;
  108. char buf[buf_len];
  109. int len;
  110. };
  111. class fec_decode_manager_t
  112. {
  113. anti_replay_t anti_replay;
  114. fec_data_t fec_data[fec_buff_size];
  115. int index;
  116. unordered_map<u32_t, map<int,int> > mp;
  117. blob_decode_t blob_decode;
  118. int output_n;
  119. char ** output_s_arr;
  120. int * output_len_arr;
  121. int ready_for_output;
  122. public:
  123. fec_decode_manager_t();
  124. int re_init();
  125. int input(char *s,int len);
  126. int output(int &n,char ** &s_arr,int* &len_arr);
  127. };
  128. #endif /* FEC_MANAGER_H_ */