fec_manager.cpp 20 KB

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