2017-09-28 05:21:53 -05:00
|
|
|
/*
|
|
|
|
* fec_manager.cpp
|
|
|
|
*
|
|
|
|
* Created on: Sep 27, 2017
|
|
|
|
* Author: root
|
|
|
|
*/
|
|
|
|
|
2017-10-05 12:21:06 -05:00
|
|
|
#include "fec_manager.h"
|
|
|
|
#include "log.h"
|
|
|
|
#include "common.h"
|
|
|
|
#include "lib/rs.h"
|
2017-09-28 05:21:53 -05:00
|
|
|
|
|
|
|
|
2017-10-05 12:21:06 -05:00
|
|
|
blob_encode_t::blob_encode_t()
|
|
|
|
{
|
|
|
|
clear();
|
|
|
|
}
|
|
|
|
int blob_encode_t::clear()
|
|
|
|
{
|
|
|
|
counter=0;
|
|
|
|
current_len=(int)sizeof(u32_t);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int blob_encode_t::get_num()
|
|
|
|
{
|
|
|
|
return counter;
|
|
|
|
}
|
|
|
|
int blob_encode_t::get_shard_len(int n)
|
|
|
|
{
|
|
|
|
return round_up_div(current_len,n);
|
|
|
|
}
|
|
|
|
|
|
|
|
int blob_encode_t::get_shard_len(int n,int next_packet_len)
|
|
|
|
{
|
|
|
|
return round_up_div(current_len+(int)sizeof(u16_t)+next_packet_len,n);
|
|
|
|
}
|
|
|
|
|
|
|
|
int blob_encode_t::input(char *s,int len)
|
|
|
|
{
|
|
|
|
assert(current_len+len+sizeof(u16_t) <=256*buf_len);
|
|
|
|
assert(len<=65535&&len>=0);
|
|
|
|
counter++;
|
|
|
|
assert(counter<=max_packet_num);
|
|
|
|
write_u16(buf+current_len,len);
|
|
|
|
current_len+=sizeof(u16_t);
|
|
|
|
memcpy(buf+current_len,s,len);
|
|
|
|
current_len+=len;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int blob_encode_t::output(int n,char ** &s_arr,int & len)
|
|
|
|
{
|
|
|
|
static char *output_arr[256+100];
|
|
|
|
len=round_up_div(current_len,n);
|
|
|
|
write_u32(buf,counter);
|
|
|
|
for(int i=0;i<n;i++)
|
|
|
|
{
|
|
|
|
output_arr[i]=buf+len*i;
|
|
|
|
}
|
|
|
|
s_arr=output_arr;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
blob_decode_t::blob_decode_t()
|
|
|
|
{
|
|
|
|
clear();
|
|
|
|
}
|
|
|
|
int blob_decode_t::clear()
|
|
|
|
{
|
|
|
|
current_len=0;
|
|
|
|
last_len=-1;
|
|
|
|
counter=0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
int blob_decode_t::input(char *s,int len)
|
|
|
|
{
|
|
|
|
if(last_len!=-1)
|
|
|
|
{
|
|
|
|
assert(last_len==len);
|
|
|
|
}
|
|
|
|
counter++;
|
|
|
|
assert(counter<=256);
|
|
|
|
last_len=len;
|
|
|
|
assert(current_len+len+100<(int)sizeof(buf));
|
|
|
|
memcpy(buf+current_len,s,len);
|
|
|
|
current_len+=len;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
int blob_decode_t::output(int &n,char ** &s_arr,int *&len_arr)
|
|
|
|
{
|
|
|
|
static char *s_buf[max_packet_num+100];
|
|
|
|
static int len_buf[max_packet_num+100];
|
|
|
|
|
|
|
|
int parser_pos=0;
|
|
|
|
|
|
|
|
if(parser_pos+(int)sizeof(u32_t)>current_len) return -1;
|
|
|
|
|
|
|
|
n=(int)read_u32(buf+parser_pos);
|
|
|
|
if(n>max_packet_num) {mylog(log_info,"failed 1\n");return -1;}
|
|
|
|
s_arr=s_buf;
|
|
|
|
len_arr=len_buf;
|
|
|
|
|
|
|
|
parser_pos+=sizeof(u32_t);
|
|
|
|
for(int i=0;i<n;i++)
|
|
|
|
{
|
|
|
|
if(parser_pos+(int)sizeof(u16_t)>current_len) {mylog(log_info,"failed2 \n");return -1;}
|
|
|
|
len_arr[i]=(int)read_u16(buf+parser_pos);
|
|
|
|
parser_pos+=(int)sizeof(u16_t);
|
|
|
|
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;}
|
|
|
|
s_arr[i]=buf+parser_pos;
|
|
|
|
parser_pos+=len_arr[i];
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
fec_encode_manager_t::fec_encode_manager_t()
|
|
|
|
{
|
2017-10-06 09:23:54 -05:00
|
|
|
re_init(4,2,1200);
|
2017-10-05 12:21:06 -05:00
|
|
|
}
|
2017-10-06 09:23:54 -05:00
|
|
|
int fec_encode_manager_t::re_init(int data_num,int redundant_num,int mtu)
|
2017-10-05 12:21:06 -05:00
|
|
|
{
|
2017-10-06 09:23:54 -05:00
|
|
|
fec_data_num=data_num;
|
|
|
|
fec_redundant_num=redundant_num;
|
|
|
|
fec_mtu=mtu;
|
2017-10-05 12:21:06 -05:00
|
|
|
|
|
|
|
counter=0;
|
|
|
|
blob_encode.clear();
|
|
|
|
ready_for_output=0;
|
2017-10-06 09:23:54 -05:00
|
|
|
seq=0;
|
2017-10-05 12:21:06 -05:00
|
|
|
return 0;
|
|
|
|
}
|
2017-10-06 09:23:54 -05:00
|
|
|
int fec_encode_manager_t::input(char *s,int len/*,int &is_first_packet*/)
|
2017-10-05 12:21:06 -05:00
|
|
|
{
|
|
|
|
if(s==0 ||blob_encode.get_shard_len(fec_data_num,len)>=fec_mtu)
|
|
|
|
{
|
|
|
|
char ** blob_output;
|
|
|
|
int blob_len;
|
2017-10-06 09:23:54 -05:00
|
|
|
if(counter==0)
|
|
|
|
{
|
|
|
|
if(s==0) return 0;//relax this restriction temporarily
|
|
|
|
else mylog(log_warn,"message too long,ignored\n");
|
|
|
|
}
|
2017-10-05 12:21:06 -05:00
|
|
|
blob_encode.output(fec_data_num,blob_output,blob_len);
|
|
|
|
for(int i=0;i<fec_data_num+fec_redundant_num;i++)
|
|
|
|
{
|
|
|
|
int tmp_idx=0;
|
|
|
|
write_u32(buf[i]+tmp_idx,seq);
|
|
|
|
tmp_idx+=sizeof(u32_t);
|
2017-10-06 09:23:54 -05:00
|
|
|
buf[i][tmp_idx++]=(unsigned char)0;
|
2017-10-05 12:21:06 -05:00
|
|
|
buf[i][tmp_idx++]=(unsigned char)fec_data_num;
|
|
|
|
buf[i][tmp_idx++]=(unsigned char)fec_redundant_num;
|
|
|
|
buf[i][tmp_idx++]=(unsigned char)i;
|
2017-10-06 09:23:54 -05:00
|
|
|
output_buf[i]=buf[i]+tmp_idx;
|
2017-10-05 12:21:06 -05:00
|
|
|
if(i<fec_data_num)
|
|
|
|
{
|
|
|
|
memcpy(buf[i]+tmp_idx,blob_output[i],blob_len);
|
|
|
|
tmp_idx+=blob_len;
|
|
|
|
}
|
|
|
|
}
|
2017-10-06 09:23:54 -05:00
|
|
|
output_len=blob_len+sizeof(u32_t)+4*sizeof(char);/////remember to change this 4,if modified the protocol
|
|
|
|
|
2017-10-05 12:21:06 -05:00
|
|
|
rs_encode2(fec_data_num,fec_data_num+fec_redundant_num,output_buf,blob_len);
|
|
|
|
for(int i=0;i<fec_data_num+fec_redundant_num;i++)
|
|
|
|
{
|
|
|
|
output_buf[i]=buf[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
ready_for_output=1;
|
|
|
|
seq++;
|
|
|
|
counter=0;
|
|
|
|
blob_encode.clear();
|
|
|
|
}
|
|
|
|
if(s!=0)
|
|
|
|
{
|
2017-10-06 09:23:54 -05:00
|
|
|
//if(counter==0) is_first_packet=1;
|
2017-10-05 12:21:06 -05:00
|
|
|
blob_encode.input(s,len);
|
|
|
|
counter++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int fec_encode_manager_t::output(int &n,char ** &s_arr,int &len)
|
|
|
|
{
|
|
|
|
if(!ready_for_output)
|
|
|
|
{
|
|
|
|
n=-1;
|
|
|
|
len=-1;
|
|
|
|
s_arr=0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
n=fec_data_num+fec_redundant_num;
|
|
|
|
len=output_len;
|
|
|
|
s_arr=output_buf;
|
|
|
|
ready_for_output=0;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-10-06 09:23:54 -05:00
|
|
|
fec_decode_manager_t::fec_decode_manager_t()
|
2017-10-05 12:21:06 -05:00
|
|
|
{
|
2017-10-06 09:23:54 -05:00
|
|
|
re_init();
|
2017-10-05 12:21:06 -05:00
|
|
|
}
|
|
|
|
|
2017-10-06 09:23:54 -05:00
|
|
|
int fec_decode_manager_t::re_init()
|
2017-10-05 12:21:06 -05:00
|
|
|
{
|
2017-10-06 09:23:54 -05:00
|
|
|
for(int i=0;i<(int)fec_buff_size;i++)
|
|
|
|
fec_data[i].used=0;
|
|
|
|
ready_for_output=0;
|
2017-10-05 12:21:06 -05:00
|
|
|
return 0;
|
2017-10-06 09:23:54 -05:00
|
|
|
}
|
2017-10-05 12:21:06 -05:00
|
|
|
|
2017-10-06 09:23:54 -05:00
|
|
|
int fec_decode_manager_t::input(char *s,int len)
|
|
|
|
{
|
|
|
|
assert(s!=0);
|
|
|
|
int tmp_idx=0;
|
|
|
|
u32_t seq=read_u32(s+tmp_idx);
|
|
|
|
tmp_idx+=sizeof(u32_t);
|
|
|
|
int type=(unsigned char)s[tmp_idx++];
|
|
|
|
int data_num=(unsigned char)s[tmp_idx++];
|
|
|
|
int redundant_num=(unsigned char)s[tmp_idx++];
|
|
|
|
int inner_index=(unsigned char)s[tmp_idx++];
|
|
|
|
len=len-tmp_idx;
|
|
|
|
if(len<0)
|
|
|
|
{
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
if(data_num+redundant_num>255)
|
|
|
|
{
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
if(!anti_replay.is_vaild(seq))
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if(!mp[seq].empty())
|
|
|
|
{
|
|
|
|
int first_idx=mp[seq].begin()->second;
|
|
|
|
int ok=1;
|
|
|
|
if(fec_data[first_idx].data_num!=data_num)
|
|
|
|
ok=0;
|
|
|
|
if(fec_data[first_idx].redundant_num!=redundant_num)
|
|
|
|
ok=0;
|
|
|
|
if(fec_data[first_idx].len!=len)
|
|
|
|
ok=0;
|
|
|
|
if(ok==0)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(fec_data[index].used!=0)
|
|
|
|
{
|
|
|
|
int tmp_seq=fec_data[index].seq;
|
|
|
|
anti_replay.set_invaild(tmp_seq);
|
|
|
|
if(mp.find(tmp_seq)!=mp.end())
|
|
|
|
{
|
|
|
|
mp.erase(tmp_seq);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fec_data[index].used=1;
|
|
|
|
fec_data[index].seq=seq;
|
|
|
|
fec_data[index].type=type;
|
|
|
|
fec_data[index].data_num=data_num;
|
|
|
|
fec_data[index].redundant_num=redundant_num;
|
|
|
|
fec_data[index].idx=inner_index;
|
|
|
|
fec_data[index].len=len;
|
|
|
|
memcpy(fec_data[index].buf,s+tmp_idx,len);
|
|
|
|
mp[seq][inner_index]=index;
|
|
|
|
|
|
|
|
index++;
|
|
|
|
if(index==int(anti_replay_buff_size)) index=0;
|
|
|
|
|
|
|
|
map<int,int> &inner_mp=mp[seq];
|
|
|
|
assert((int)inner_mp.size()<=data_num);
|
|
|
|
if((int)inner_mp.size()==data_num)
|
|
|
|
{
|
|
|
|
|
|
|
|
char *fec_tmp_arr[256+5]={0};
|
|
|
|
for(auto it=inner_mp.begin();it!=inner_mp.end();it++)
|
|
|
|
{
|
|
|
|
fec_tmp_arr[it->first]=fec_data[it->second].buf;
|
|
|
|
}
|
|
|
|
rs_decode2(data_num,data_num+redundant_num,fec_tmp_arr,len); //the input data has been modified in-place
|
|
|
|
blob_decode.clear();
|
|
|
|
for(int i=0;i<data_num;i++)
|
|
|
|
{
|
|
|
|
blob_decode.input(fec_tmp_arr[i],len);
|
|
|
|
}
|
|
|
|
blob_decode.output(output_n,output_s_arr,output_len_arr);
|
|
|
|
ready_for_output=1;
|
|
|
|
anti_replay.set_invaild(seq);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
int fec_decode_manager_t::output(int &n,char ** &s_arr,int* &len_arr)
|
|
|
|
{
|
|
|
|
if(!ready_for_output)
|
|
|
|
{
|
|
|
|
n=-1;
|
|
|
|
s_arr=0;
|
|
|
|
len_arr=0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
ready_for_output=0;
|
|
|
|
n=output_n;
|
|
|
|
s_arr=output_s_arr;
|
|
|
|
len_arr=output_len_arr;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|