fec_manager.cpp 20 KB

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