fec_manager.cpp 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925
  1. /*
  2. * fec_manager.cpp
  3. *
  4. * Created on: Sep 27, 2017
  5. * Author: root
  6. */
  7. #include "fec_manager.h"
  8. #include "log.h"
  9. #include "common.h"
  10. #include "lib/rs.h"
  11. #include "fd_manager.h"
  12. //int g_fec_data_num=20;
  13. //int g_fec_redundant_num=10;
  14. //int g_fec_mtu=1250;
  15. //int g_fec_queue_len=200;
  16. //int g_fec_timeout=8*1000; //8ms
  17. //int g_fec_mode=0;
  18. fec_parameter_t g_fec_par;
  19. int debug_fec_enc=0;
  20. int debug_fec_dec=0;
  21. //int dynamic_update_fec=1;
  22. const int encode_fast_send=1;
  23. const int decode_fast_send=1;
  24. int short_packet_optimize=1;
  25. int header_overhead=40;
  26. u32_t fec_buff_num=2000;// how many packet can fec_decode_manager hold. shouldnt be very large,or it will cost huge memory
  27. blob_encode_t::blob_encode_t()
  28. {
  29. clear();
  30. }
  31. int blob_encode_t::clear()
  32. {
  33. counter=0;
  34. current_len=(int)sizeof(u32_t);
  35. return 0;
  36. }
  37. int blob_encode_t::get_num()
  38. {
  39. return counter;
  40. }
  41. int blob_encode_t::get_shard_len(int n)
  42. {
  43. return round_up_div(current_len,n);
  44. }
  45. int blob_encode_t::get_shard_len(int n,int next_packet_len)
  46. {
  47. return round_up_div(current_len+(int)sizeof(u16_t)+next_packet_len,n);
  48. }
  49. int blob_encode_t::input(char *s,int len)
  50. {
  51. assert(current_len+len+sizeof(u16_t) +100<sizeof(input_buf));
  52. assert(len<=65535&&len>=0);
  53. counter++;
  54. assert(counter<=max_blob_packet_num);
  55. write_u16(input_buf+current_len,len);
  56. current_len+=sizeof(u16_t);
  57. memcpy(input_buf+current_len,s,len);
  58. current_len+=len;
  59. return 0;
  60. }
  61. int blob_encode_t::output(int n,char ** &s_arr,int & len)
  62. {
  63. len=round_up_div(current_len,n);
  64. write_u32(input_buf,counter);
  65. for(int i=0;i<n;i++)
  66. {
  67. output_buf[i]=input_buf+len*i;
  68. }
  69. s_arr=output_buf;
  70. return 0;
  71. }
  72. blob_decode_t::blob_decode_t()
  73. {
  74. clear();
  75. }
  76. int blob_decode_t::clear()
  77. {
  78. current_len=0;
  79. last_len=-1;
  80. counter=0;
  81. return 0;
  82. }
  83. int blob_decode_t::input(char *s,int len)
  84. {
  85. if(last_len!=-1)
  86. {
  87. assert(last_len==len);
  88. }
  89. counter++;
  90. assert(counter<=max_fec_packet_num);
  91. last_len=len;
  92. assert(current_len+len+100<(int)sizeof(input_buf));//avoid overflow
  93. memcpy(input_buf+current_len,s,len);
  94. current_len+=len;
  95. return 0;
  96. }
  97. int blob_decode_t::output(int &n,char ** &s_arr,int *&len_arr)
  98. {
  99. int parser_pos=0;
  100. if(parser_pos+(int)sizeof(u32_t)>current_len) {mylog(log_info,"failed 0\n");return -1;}
  101. n=(int)read_u32(input_buf+parser_pos);
  102. if(n>max_blob_packet_num) {mylog(log_info,"failed 1\n");return -1;}
  103. s_arr=output_buf;
  104. len_arr=output_len;
  105. parser_pos+=sizeof(u32_t);
  106. for(int i=0;i<n;i++)
  107. {
  108. if(parser_pos+(int)sizeof(u16_t)>current_len) {mylog(log_info,"failed2 \n");return -1;}
  109. len_arr[i]=(int)read_u16(input_buf+parser_pos);
  110. parser_pos+=(int)sizeof(u16_t);
  111. if(parser_pos+len_arr[i]>current_len) {mylog(log_info,"failed 3 %d %d %d\n",parser_pos,len_arr[i],current_len);return -1;}
  112. s_arr[i]=input_buf+parser_pos;
  113. parser_pos+=len_arr[i];
  114. }
  115. return 0;
  116. }
  117. fec_encode_manager_t::~fec_encode_manager_t()
  118. {
  119. clear_all();
  120. //fd_manager.fd64_close(timer_fd64);
  121. }
  122. /*
  123. u64_t fec_encode_manager_t::get_timer_fd64()
  124. {
  125. return timer_fd64;
  126. }*/
  127. fec_encode_manager_t::fec_encode_manager_t()
  128. {
  129. //int timer_fd;
  130. /*
  131. if ((timer_fd = timerfd_create(CLOCK_MONOTONIC, TFD_NONBLOCK)) < 0)
  132. {
  133. mylog(log_fatal,"timer_fd create error");
  134. myexit(1);
  135. }
  136. timer_fd64=fd_manager.create(timer_fd);*/
  137. /////reset_fec_parameter(g_fec_data_num,g_fec_redundant_num,g_fec_mtu,g_fec_queue_len,g_fec_timeout,g_fec_mode);
  138. fec_par.clone(g_fec_par);
  139. clear_data();
  140. }
  141. /*
  142. int fec_encode_manager_t::reset_fec_parameter(int data_num,int redundant_num,int mtu,int queue_len,int timeout,int mode)
  143. {
  144. fec_data_num=data_num;
  145. fec_redundant_num=redundant_num;
  146. fec_mtu=mtu;
  147. fec_queue_len=queue_len;
  148. fec_timeout=timeout;
  149. fec_mode=mode;
  150. assert(data_num+redundant_num<max_fec_packet_num);
  151. //clear();
  152. clear_data();
  153. return 0;
  154. }*/
  155. int fec_encode_manager_t::append(char *s,int len/*,int &is_first_packet*/)
  156. {
  157. if(counter==0)
  158. {
  159. first_packet_time=get_current_time_us();
  160. ev_timer_stop(loop, &timer);
  161. ev_timer_set(&timer, fec_par.timeout/1000000.0 ,0 );
  162. ev_timer_start(loop, &timer);
  163. }
  164. if(fec_par.mode==0)//for type 0 use blob
  165. {
  166. assert(blob_encode.input(s,len)==0);
  167. }
  168. else if(fec_par.mode==1)//for tpe 1 use input_buf and counter
  169. {
  170. mylog(log_trace,"counter=%d\n",counter);
  171. assert(len<=65535&&len>=0);
  172. //assert(len<=fec_mtu);//relax this limitation
  173. char * p=input_buf[counter]+sizeof(u32_t)+4*sizeof(char);//copy directly to final position,avoid unnecessary copy.
  174. //remember to change this,if protocol is modified
  175. write_u16(p,(u16_t)((u32_t)len)); //TODO omit this u16 for data packet while sending
  176. p+=sizeof(u16_t);
  177. memcpy(p,s,len);
  178. input_len[counter]=len+sizeof(u16_t);
  179. }
  180. else
  181. {
  182. assert(0==1);
  183. }
  184. counter++;
  185. return 0;
  186. }
  187. int fec_encode_manager_t::input(char *s,int len/*,int &is_first_packet*/)
  188. {
  189. if(counter==0&&fec_par.version!=g_fec_par.version)
  190. {
  191. fec_par.clone(g_fec_par);
  192. }
  193. int about_to_fec=0;
  194. int delayed_append=0;
  195. //int counter_back=counter;
  196. assert(fec_par.mode==0||fec_par.mode==1);
  197. if(fec_par.mode==0&& s!=0 &&counter==0)
  198. {
  199. int out_len=blob_encode.get_shard_len(fec_par.get_tail().x,len);
  200. if(out_len>fec_par.mtu)
  201. {
  202. mylog(log_warn,"message too long ori_len=%d out_len=%d fec_mtu=%d,ignored\n",len,out_len,fec_par.mtu);
  203. return -1;
  204. }
  205. }
  206. if(fec_par.mode==1&&s!=0&&len>fec_par.mtu)
  207. {
  208. mylog(log_warn,"mode==1,message len=%d,len>fec_mtu,fec_mtu=%d,packet may not be delivered\n",len,fec_par.mtu);
  209. //return -1;
  210. }
  211. if(s==0&&counter==0)
  212. {
  213. mylog(log_warn,"unexpected s==0&&counter==0\n");
  214. return -1;
  215. }
  216. if(s==0) about_to_fec=1;//now
  217. if(fec_par.mode==0&& blob_encode.get_shard_len(fec_par.get_tail().x,len)>fec_par.mtu) {about_to_fec=1; delayed_append=1;}//fec then add packet
  218. if(fec_par.mode==0) assert(counter<fec_par.queue_len);//counter will never equal fec_pending_num,if that happens fec should already been done.
  219. if(fec_par.mode==1) assert(counter<fec_par.get_tail().x);
  220. if(s!=0&&!delayed_append)
  221. {
  222. append(s,len);
  223. }
  224. if(fec_par.mode==0&& counter==fec_par.queue_len) about_to_fec=1;
  225. if(fec_par.mode==1&& counter==fec_par.get_tail().x) about_to_fec=1;
  226. if(about_to_fec)
  227. {
  228. char ** blob_output=0;
  229. int fec_len=-1;
  230. mylog(log_trace,"counter=%d\n",counter);
  231. if(counter==0)
  232. {
  233. mylog(log_warn,"unexpected counter==0 here\n");
  234. return -1;
  235. }
  236. int actual_data_num;
  237. int actual_redundant_num;
  238. if(fec_par.mode==0)
  239. {
  240. int tail_x=fec_par.get_tail().x;
  241. int tail_y=fec_par.get_tail().y;
  242. actual_data_num=tail_x;
  243. actual_redundant_num=tail_y;
  244. if(short_packet_optimize)
  245. {
  246. u32_t best_len=(blob_encode.get_shard_len(tail_x,0)+header_overhead)*(tail_x+tail_y);
  247. int best_data_num=tail_x;
  248. assert(tail_x<=fec_par.rs_cnt);
  249. for(int i=1;i<tail_x;i++)
  250. {
  251. assert(fec_par.rs_par[i-1].x==i);
  252. int tmp_x=fec_par.rs_par[i-1].x;
  253. int tmp_y=fec_par.rs_par[i-1].y;
  254. assert(tmp_x==i);
  255. u32_t shard_len=blob_encode.get_shard_len(tmp_x,0);
  256. if(shard_len>(u32_t)fec_par.mtu) continue;
  257. u32_t new_len=(shard_len+header_overhead)*(tmp_x+tmp_y);
  258. if(new_len<best_len)
  259. {
  260. best_len=new_len;
  261. best_data_num=tmp_x;
  262. }
  263. }
  264. actual_data_num=best_data_num;
  265. assert(best_data_num>=1&&best_data_num<=fec_par.rs_cnt);
  266. actual_redundant_num=fec_par.rs_par[best_data_num-1].y;
  267. }
  268. assert(blob_encode.output(actual_data_num,blob_output,fec_len)==0);
  269. if(debug_fec_enc)
  270. mylog(log_debug,"[enc]seq=%08x x=%d y=%d len=%d cnt=%d\n",seq,actual_data_num,actual_redundant_num,fec_len,counter);
  271. else
  272. mylog(log_trace,"[enc]seq=%08x x=%d y=%d len=%d cnt=%d\n",seq,actual_data_num,actual_redundant_num,fec_len,counter);
  273. }
  274. else
  275. {
  276. assert(counter<=fec_par.rs_cnt);
  277. actual_data_num=counter;
  278. actual_redundant_num=fec_par.rs_par[counter-1].y;
  279. int sum_ori=0;
  280. for(int i=0;i<counter;i++)
  281. {
  282. sum_ori+=input_len[i];
  283. assert(input_len[i]>=0);
  284. if(input_len[i]>fec_len) fec_len=input_len[i];
  285. }
  286. int sum=fec_len*counter;
  287. if(debug_fec_enc)
  288. mylog(log_debug,"[enc]seq=%08x x=%d y=%d len=%d sum_ori=%d sum=%d\n",seq,actual_data_num,actual_redundant_num,fec_len,sum_ori,sum);
  289. else
  290. mylog(log_trace,"[enc]seq=%08x x=%d y=%d len=%d sum_ori=%d sum=%d\n",seq,actual_data_num,actual_redundant_num,fec_len,sum_ori,sum);
  291. }
  292. //mylog(log_trace,"%d %d %d\n",actual_data_num,actual_redundant_num,fec_len);
  293. char *tmp_output_buf[max_fec_packet_num+5]={0};
  294. for(int i=0;i<actual_data_num+actual_redundant_num;i++)
  295. {
  296. int tmp_idx=0;
  297. write_u32(input_buf[i] + tmp_idx, seq);
  298. tmp_idx += sizeof(u32_t);
  299. input_buf[i][tmp_idx++] = (unsigned char) fec_par.mode;
  300. if (fec_par.mode == 1 && i < actual_data_num)
  301. {
  302. input_buf[i][tmp_idx++] = (unsigned char) 0;
  303. input_buf[i][tmp_idx++] = (unsigned char) 0;
  304. } else
  305. {
  306. input_buf[i][tmp_idx++] = (unsigned char) actual_data_num;
  307. input_buf[i][tmp_idx++] = (unsigned char) actual_redundant_num;
  308. }
  309. input_buf[i][tmp_idx++] = (unsigned char) i;
  310. tmp_output_buf[i]=input_buf[i]+tmp_idx; //////caution ,trick here.
  311. if(fec_par.mode==0)
  312. {
  313. output_len[i]=tmp_idx+fec_len;
  314. if(i<actual_data_num)
  315. {
  316. memcpy(input_buf[i]+tmp_idx,blob_output[i],fec_len);
  317. }
  318. }
  319. else
  320. {
  321. if(i<actual_data_num)
  322. {
  323. output_len[i]=tmp_idx+input_len[i];
  324. memset(tmp_output_buf[i]+input_len[i],0,fec_len-input_len[i]);
  325. }
  326. else
  327. output_len[i]=tmp_idx+fec_len;
  328. }
  329. output_buf[i]=input_buf[i];//output_buf points to same block of memory with different offset
  330. }
  331. if(0)
  332. {
  333. printf("seq=%u,fec_len=%d,%d %d,before fec\n",seq,fec_len,actual_data_num,actual_redundant_num);
  334. for(int i=0;i<actual_data_num;i++)
  335. {
  336. printf("{");
  337. for(int j=0;j<8+fec_len;j++)
  338. {
  339. log_bare(log_warn,"0x%02x,",(u32_t)(unsigned char)input_buf[i][j]);
  340. }
  341. printf("},\n");
  342. //log_bare(log_warn,"")
  343. }
  344. }
  345. //output_len=blob_len+sizeof(u32_t)+4*sizeof(char);/////remember to change this 4,if modified the protocol
  346. rs_encode2(actual_data_num,actual_data_num+actual_redundant_num,tmp_output_buf,fec_len);
  347. if(0)
  348. {
  349. printf("seq=%u,fec_len=%d,%d %d,after fec\n",seq,fec_len,actual_data_num,actual_redundant_num);
  350. for(int i=0;i<actual_data_num+actual_redundant_num;i++)
  351. {
  352. printf("{");
  353. for(int j=0;j<8+fec_len;j++)
  354. {
  355. log_bare(log_warn,"0x%02x,",(u32_t)(unsigned char)output_buf[i][j]);
  356. }
  357. printf("},\n");
  358. //log_bare(log_warn,"")
  359. }
  360. }
  361. //mylog(log_trace,"!!! s= %d\n");
  362. assert(ready_for_output==0);
  363. ready_for_output=1;
  364. first_packet_time_for_output=first_packet_time;
  365. first_packet_time=0;
  366. seq++;
  367. counter=0;
  368. output_n=actual_data_num+actual_redundant_num;
  369. blob_encode.clear();
  370. my_itimerspec its;
  371. memset(&its,0,sizeof(its));
  372. ev_timer_stop(loop, &timer);
  373. //timerfd_settime(timer_fd,TFD_TIMER_ABSTIME,&its,0);
  374. if(encode_fast_send&&fec_par.mode==1)
  375. {
  376. int packet_to_send[max_fec_packet_num+5]={0};
  377. int packet_to_send_counter=0;
  378. //assert(counter!=0);
  379. if(s!=0)
  380. packet_to_send[packet_to_send_counter++]=actual_data_num-1;
  381. for(int i=actual_data_num;i<actual_data_num+actual_redundant_num;i++)
  382. {
  383. packet_to_send[packet_to_send_counter++]=i;
  384. }
  385. output_n=packet_to_send_counter;//re write
  386. for(int i=0;i<packet_to_send_counter;i++)
  387. {
  388. output_buf[i]=output_buf[packet_to_send[i]];
  389. output_len[i]=output_len[packet_to_send[i]];
  390. }
  391. }
  392. }
  393. else
  394. {
  395. if(encode_fast_send&&s!=0&&fec_par.mode==1)
  396. {
  397. assert(counter>=1);
  398. assert(counter<=255);
  399. int input_buf_idx=counter-1;
  400. assert(ready_for_output==0);
  401. ready_for_output=1;
  402. first_packet_time_for_output=0;
  403. output_n=1;
  404. int tmp_idx=0;
  405. write_u32(input_buf[input_buf_idx]+tmp_idx,seq);
  406. tmp_idx+=sizeof(u32_t);
  407. input_buf[input_buf_idx][tmp_idx++]=(unsigned char)fec_par.mode;
  408. input_buf[input_buf_idx][tmp_idx++]=(unsigned char)0;
  409. input_buf[input_buf_idx][tmp_idx++]=(unsigned char)0;
  410. input_buf[input_buf_idx][tmp_idx++]=(unsigned char)((u32_t)input_buf_idx);
  411. output_len[0]=input_len[input_buf_idx]+tmp_idx;
  412. output_buf[0]=input_buf[input_buf_idx];
  413. if(0)
  414. {
  415. printf("seq=%u,buf_idx=%d\n",seq,input_buf_idx);
  416. for(int j=0;j<output_len[0];j++)
  417. {
  418. log_bare(log_warn,"0x%02x,",(u32_t)(unsigned char)output_buf[0][j]);
  419. }
  420. printf("\n");
  421. }
  422. }
  423. }
  424. if(s!=0&&delayed_append)
  425. {
  426. assert(fec_par.mode!=1);
  427. append(s,len);
  428. }
  429. return 0;
  430. }
  431. int fec_encode_manager_t::output(int &n,char ** &s_arr,int *&len)
  432. {
  433. if(!ready_for_output)
  434. {
  435. n=-1;
  436. len=0;
  437. s_arr=0;
  438. }
  439. else
  440. {
  441. n=output_n;
  442. len=output_len;
  443. s_arr=output_buf;
  444. ready_for_output=0;
  445. }
  446. return 0;
  447. }
  448. /*
  449. int fec_decode_manager_t::re_init()
  450. {
  451. clear();
  452. return 0;
  453. }*/
  454. int fec_decode_manager_t::input(char *s,int len)
  455. {
  456. assert(s!=0);
  457. assert(len+100<buf_len);//guarenteed by upper level
  458. int tmp_idx=0;
  459. int tmp_header_len=sizeof(u32_t)+sizeof(char)*4;
  460. if(len<tmp_header_len)
  461. {
  462. mylog(log_warn,"len =%d\n",len);
  463. return -1;
  464. }
  465. u32_t seq=read_u32(s+tmp_idx);
  466. tmp_idx+=sizeof(u32_t);
  467. int type=(unsigned char)s[tmp_idx++];
  468. int data_num=(unsigned char)s[tmp_idx++];
  469. int redundant_num=(unsigned char)s[tmp_idx++];
  470. int inner_index=(unsigned char)s[tmp_idx++];
  471. len=len-tmp_idx;
  472. //mylog(log_trace,"input\n");
  473. if(len<0)
  474. {
  475. mylog(log_warn,"len<0\n");
  476. return -1;
  477. }
  478. if(type==1)
  479. {
  480. if(len<(int)sizeof(u16_t))
  481. {
  482. mylog(log_warn,"type==1&&len<2\n");
  483. return -1;
  484. }
  485. if(data_num==0&&(int)( read_u16(s+tmp_idx)+sizeof(u16_t))!=len)
  486. {
  487. mylog(log_warn,"inner_index<data_num&&read_u16(s+tmp_idx)+sizeof(u16_t)!=len %d %d\n",(int)( read_u16(s+tmp_idx)+sizeof(u16_t)),len);
  488. return -1;
  489. }
  490. }
  491. if(type==0&&data_num==0)
  492. {
  493. mylog(log_warn,"unexpected type==0&&data_num==0\n");
  494. return -1;
  495. }
  496. if(data_num+redundant_num>=max_fec_packet_num)
  497. {
  498. mylog(log_warn,"data_num+redundant_num>=max_fec_packet_num\n");
  499. return -1;
  500. }
  501. if(!anti_replay.is_vaild(seq))
  502. {
  503. mylog(log_trace,"!anti_replay.is_vaild(seq) ,seq =%u\n",seq);
  504. return 0;
  505. }
  506. if(mp[seq].fec_done!=0)
  507. {
  508. mylog(log_debug,"fec already done, ignore, seq=%u\n",seq);
  509. return -1;
  510. }
  511. if(mp[seq].group_mp.find(inner_index)!=mp[seq].group_mp.end() )
  512. {
  513. mylog(log_debug,"dup fec index\n");//duplicate can happen on a normal network, so its just log_debug
  514. return -1;
  515. }
  516. if(mp[seq].type==-1)
  517. mp[seq].type=type;
  518. else
  519. {
  520. if(mp[seq].type!=type)
  521. {
  522. mylog(log_warn,"type mismatch\n");
  523. return -1;
  524. }
  525. }
  526. if(data_num!=0)
  527. {
  528. //mp[seq].data_counter++;
  529. if(mp[seq].data_num==-1)
  530. {
  531. mp[seq].data_num=data_num;
  532. mp[seq].redundant_num=redundant_num;
  533. mp[seq].len=len;
  534. }
  535. else
  536. {
  537. if(mp[seq].data_num!=data_num||mp[seq].redundant_num!=redundant_num||mp[seq].len!=len)
  538. {
  539. mylog(log_warn,"unexpected mp[seq].data_num!=data_num||mp[seq].redundant_num!=redundant_num||mp[seq].len!=len\n");
  540. return -1;
  541. }
  542. }
  543. }
  544. //mylog(log_info,"mp.size()=%d index=%d\n",mp.size(),index);
  545. if(fec_data[index].used!=0)
  546. {
  547. u32_t tmp_seq=fec_data[index].seq;
  548. anti_replay.set_invaild(tmp_seq);
  549. auto tmp_it=mp.find(tmp_seq);
  550. if(tmp_it!=mp.end())
  551. {
  552. int x=tmp_it->second.data_num;
  553. int y=tmp_it->second.redundant_num;
  554. int cnt=tmp_it->second.group_mp.size();
  555. if(cnt<x)
  556. {
  557. if(debug_fec_dec)
  558. mylog(log_debug,"[dec][failed]seq=%08x x=%d y=%d cnt=%d\n",tmp_seq,x,y,cnt);
  559. else
  560. mylog(log_trace,"[dec][failed]seq=%08x x=%d y=%d cnt=%d\n",tmp_seq,x,y,cnt);
  561. }
  562. mp.erase(tmp_it);
  563. }
  564. if(tmp_seq==seq)
  565. {
  566. mylog(log_warn,"unexpected tmp_seq==seq ,seq=%d\n",seq);
  567. return -1;
  568. }
  569. }
  570. fec_data[index].used=1;
  571. fec_data[index].seq=seq;
  572. fec_data[index].type=type;
  573. fec_data[index].data_num=data_num;
  574. fec_data[index].redundant_num=redundant_num;
  575. fec_data[index].idx=inner_index;
  576. fec_data[index].len=len;
  577. assert(0<=index&&index<(int)fec_buff_num);
  578. assert(len+100<buf_len);
  579. memcpy(fec_data[index].buf,s+tmp_idx,len);
  580. mp[seq].group_mp[inner_index]=index;
  581. //index++ at end of function
  582. map<int,int> &inner_mp=mp[seq].group_mp;
  583. int about_to_fec=0;
  584. if(type==0)
  585. {
  586. //assert((int)inner_mp.size()<=data_num);
  587. if((int)inner_mp.size()>data_num)
  588. {
  589. mylog(log_warn,"inner_mp.size()>data_num\n");
  590. anti_replay.set_invaild(seq);
  591. goto end;
  592. }
  593. if((int)inner_mp.size()==data_num)
  594. about_to_fec=1;
  595. }
  596. else
  597. {
  598. if(mp[seq].data_num!=-1)
  599. {
  600. if((int)inner_mp.size()>mp[seq].data_num+1)
  601. {
  602. mylog(log_warn,"inner_mp.size()>data_num+1\n");
  603. anti_replay.set_invaild(seq);
  604. goto end;
  605. }
  606. if((int)inner_mp.size()>=mp[seq].data_num)
  607. {
  608. about_to_fec=1;
  609. }
  610. }
  611. }
  612. if(about_to_fec)
  613. {
  614. int group_data_num=mp[seq].data_num;
  615. int group_redundant_num=mp[seq].redundant_num;
  616. int x_got=0;
  617. int y_got=0;
  618. //mylog(log_error,"fec here!\n");
  619. if(type==0)
  620. {
  621. char *fec_tmp_arr[max_fec_packet_num+5]={0};
  622. for(auto it=inner_mp.begin();it!=inner_mp.end();it++)
  623. {
  624. if(it->first <group_data_num)
  625. x_got++;
  626. else
  627. y_got++;
  628. fec_tmp_arr[it->first]=fec_data[it->second].buf;
  629. }
  630. assert(rs_decode2(group_data_num,group_data_num+group_redundant_num,fec_tmp_arr,len)==0); //the input data has been modified in-place
  631. //this line should always succeed
  632. mp[seq].fec_done=1;
  633. if(debug_fec_dec)
  634. mylog(log_debug,"[dec]seq=%08x x=%d y=%d len=%d cnt=%d X=%d Y=%d\n",seq,group_data_num,group_redundant_num,len,int(inner_mp.size()),x_got,y_got);
  635. else
  636. mylog(log_trace,"[dec]seq=%08x x=%d y=%d len=%d cnt=%d X=%d Y=%d\n",seq,group_data_num,group_redundant_num,len,int(inner_mp.size()),x_got,y_got);
  637. blob_decode.clear();
  638. for(int i=0;i<group_data_num;i++)
  639. {
  640. blob_decode.input(fec_tmp_arr[i],len);
  641. }
  642. if(blob_decode.output(output_n,output_s_arr,output_len_arr)!=0)
  643. {
  644. mylog(log_warn,"blob_decode failed\n");
  645. //ready_for_output=0;
  646. anti_replay.set_invaild(seq);
  647. goto end;
  648. }
  649. assert(ready_for_output==0);
  650. ready_for_output=1;
  651. anti_replay.set_invaild(seq);
  652. }
  653. else//type==1
  654. {
  655. int max_len=-1;
  656. int fec_result_ok=1;
  657. int data_check_ok=1;
  658. int debug_num=inner_mp.size();
  659. int missed_packet[max_fec_packet_num+5];
  660. int missed_packet_counter=0;
  661. //outupt_s_arr_buf[max_fec_packet_num+5]={0};
  662. //memset(output_s_arr_buf,0,sizeof(output_s_arr_buf));//in efficient
  663. for(int i=0;i<group_data_num+group_redundant_num;i++)
  664. {
  665. output_s_arr_buf[i]=0;
  666. }
  667. for(auto it=inner_mp.begin();it!=inner_mp.end();it++)
  668. {
  669. if(it->first <group_data_num)
  670. x_got++;
  671. else
  672. y_got++;
  673. output_s_arr_buf[it->first]=fec_data[it->second].buf;
  674. if(fec_data[it->second].len<(int)sizeof(u16_t))
  675. {
  676. mylog(log_warn,"fec_data[it->second].len<(int)sizeof(u16_t)");
  677. data_check_ok=0;
  678. }
  679. if(fec_data[it->second].len > max_len)
  680. max_len=fec_data[it->second].len;
  681. }
  682. if(max_len!=mp[seq].len)
  683. {
  684. data_check_ok=0;
  685. mylog(log_warn,"max_len!=mp[seq].len");
  686. }
  687. if(data_check_ok==0)
  688. {
  689. //ready_for_output=0;
  690. mylog(log_warn,"data_check_ok==0\n");
  691. anti_replay.set_invaild(seq);
  692. goto end;
  693. }
  694. for(auto it=inner_mp.begin();it!=inner_mp.end();it++)
  695. {
  696. int tmp_idx=it->second;
  697. assert(max_len>=fec_data[tmp_idx].len);//guarenteed by data_check_ok
  698. memset(fec_data[tmp_idx].buf+fec_data[tmp_idx].len,0,max_len-fec_data[tmp_idx].len);
  699. }
  700. for(int i=0;i<group_data_num;i++)
  701. {
  702. if(output_s_arr_buf[i]==0 ||i==inner_index) //only missed packet +current packet
  703. {
  704. missed_packet[missed_packet_counter++]=i;
  705. }
  706. }
  707. mylog(log_trace,"fec done,%d %d,missed_packet_counter=%d\n",group_data_num,group_redundant_num,missed_packet_counter);
  708. assert(rs_decode2(group_data_num,group_data_num+group_redundant_num,output_s_arr_buf,max_len)==0);//this should always succeed
  709. mp[seq].fec_done=1;
  710. int sum_ori=0;
  711. for(int i=0;i<group_data_num;i++)
  712. {
  713. output_len_arr_buf[i]=read_u16(output_s_arr_buf[i]);
  714. sum_ori+=output_len_arr_buf[i];
  715. output_s_arr_buf[i]+=sizeof(u16_t);
  716. if(output_len_arr_buf[i]>max_data_len)
  717. {
  718. mylog(log_warn,"invaild len %d,seq= %u,data_num= %d r_num= %d,i= %d\n",output_len_arr_buf[i],seq,group_data_num,group_redundant_num,i);
  719. fec_result_ok=0;
  720. for(int i=0;i<missed_packet_counter;i++)
  721. {
  722. log_bare(log_warn,"%d ",missed_packet[i]);
  723. }
  724. log_bare(log_warn,"\n");
  725. //break;
  726. }
  727. }
  728. int sum=max_len*group_data_num;
  729. if(debug_fec_dec)
  730. mylog(log_debug,"[dec]seq=%08x x=%d y=%d len=%d sum_ori=%d sum=%d X=%d Y=%d\n",seq,group_data_num,group_redundant_num,max_len,sum_ori,sum,x_got,y_got);
  731. else
  732. mylog(log_trace,"[dec]seq=%08x x=%d y=%d len=%d sum_ori=%d sum=%d X=%d Y=%d\n",seq,group_data_num,group_redundant_num,max_len,sum_ori,sum,x_got,y_got);
  733. if(fec_result_ok)
  734. {
  735. output_n=group_data_num;
  736. if(decode_fast_send)
  737. {
  738. output_n=missed_packet_counter;
  739. for(int i=0;i<missed_packet_counter;i++)
  740. {
  741. output_s_arr_buf[i]=output_s_arr_buf[missed_packet[i]];
  742. output_len_arr_buf[i]=output_len_arr_buf[missed_packet[i]];
  743. }
  744. }
  745. output_s_arr=output_s_arr_buf;
  746. output_len_arr=output_len_arr_buf;
  747. assert(ready_for_output==0);
  748. ready_for_output=1;
  749. }
  750. else
  751. {
  752. //fec_not_ok:
  753. ready_for_output=0;
  754. }
  755. anti_replay.set_invaild(seq);
  756. }// end of type==1
  757. }
  758. else //not about_to_fec
  759. {
  760. if(decode_fast_send)
  761. {
  762. if(type==1&&data_num==0)
  763. {
  764. assert(ready_for_output==0);
  765. output_n=1;
  766. int check_len=read_u16(fec_data[index].buf);
  767. output_s_arr_buf[0]=fec_data[index].buf+sizeof(u16_t);
  768. output_len_arr_buf[0]=fec_data[index].len-sizeof(u16_t);
  769. if(output_len_arr_buf[0]!=check_len)
  770. {
  771. mylog(log_warn,"len mismatch %d %d\n",output_len_arr_buf[0],check_len);
  772. }
  773. output_s_arr=output_s_arr_buf;
  774. output_len_arr=output_len_arr_buf;
  775. ready_for_output=1;
  776. }
  777. }
  778. }
  779. end:
  780. index++;
  781. if(index==int(fec_buff_num)) index=0;
  782. return 0;
  783. }
  784. int fec_decode_manager_t::output(int &n,char ** &s_arr,int* &len_arr)
  785. {
  786. if(!ready_for_output)
  787. {
  788. n=-1;
  789. s_arr=0;
  790. len_arr=0;
  791. }
  792. else
  793. {
  794. ready_for_output=0;
  795. n=output_n;
  796. s_arr=output_s_arr;
  797. len_arr=output_len_arr;
  798. }
  799. return 0;
  800. }