github/wangyu-UDPspeeder
1
0
Fork 0
mirror of https://github.com/wangyu-/UDPspeeder.git synced 2025-01-19 06:19:34 +08:00
Code Issues Packages Projects Releases Wiki Activity

add expire time for anti_replay

Browse Source
This commit is contained in:
root 2018-07-05 07:53:19 +00:00
parent 90edcfb59c
commit b00d8e6927
3 changed files with 34 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
common.cpp
View File

@ -211,6 +211,11 @@ u64_t get_current_time()//ms
return (u64_t)(ev_time()*1000); return (u64_t)(ev_time()*1000);
} }
u64_t get_current_time_rough()//ms
{
return (u64_t)(ev_now(ev_default_loop(0))*1000);
}
u64_t get_current_time_us() u64_t get_current_time_us()
{ {
//timespec tmp_time; //timespec tmp_time;

1
common.h
View File

@ -220,6 +220,7 @@ struct pseudo_header {
}; };
u64_t get_current_time(); u64_t get_current_time();
u64_t get_current_time_rough();
u64_t get_current_time_us(); u64_t get_current_time_us();
u64_t pack_u64(u32_t a,u32_t b); u64_t pack_u64(u32_t a,u32_t b);

36
fec_manager.h
View File

@ -29,12 +29,19 @@ extern int g_fec_mode;
extern int dynamic_update_fec; extern int dynamic_update_fec;
/*end for first time init or dynamic update*/ /*end for first time init or dynamic update*/
const int anti_replay_timeout=60*1000;// 60s
struct anti_replay_t struct anti_replay_t
{ {
struct info_t
{
my_time_t my_time;
int index;
};
u64_t replay_buffer[anti_replay_buff_size]; u64_t replay_buffer[anti_replay_buff_size];
unordered_set<u32_t> st; unordered_map<u32_t,info_t> mp;
int index; int index;
anti_replay_t() anti_replay_t()
{ {
@ -43,34 +50,47 @@ struct anti_replay_t
int clear() int clear()
{ {
memset(replay_buffer,-1,sizeof(replay_buffer)); memset(replay_buffer,-1,sizeof(replay_buffer));
st.clear(); mp.clear();
st.rehash(anti_replay_buff_size*3); mp.rehash(anti_replay_buff_size*3);
index=0; index=0;
return 0; return 0;
} }
void set_invaild(u32_t seq) void set_invaild(u32_t seq)
{ {
if(st.find(seq)!=st.end() ) if(is_vaild(seq)==0)
{ {
mylog(log_trace,"seq %u exist\n",seq); mylog(log_trace,"seq %u exist\n",seq);
assert(mp.find(seq)!=mp.end());
mp[seq].my_time=get_current_time_rough();
return; return;
//return 0; //return 0;
} }
if(replay_buffer[index]!=u64_t(i64_t(-1))) if(replay_buffer[index]!=u64_t(i64_t(-1)))
{ {
assert(st.find(replay_buffer[index])!=st.end()); assert(mp.find(replay_buffer[index])!=mp.end());
st.erase(replay_buffer[index]); mp.erase(replay_buffer[index]);
} }
replay_buffer[index]=seq; replay_buffer[index]=seq;
st.insert(seq); assert(mp.find(seq)==mp.end());
mp[seq].my_time=get_current_time_rough();
mp[seq].index=index;
index++; index++;
if(index==int(anti_replay_buff_size)) index=0; if(index==int(anti_replay_buff_size)) index=0;
//return 1; //for complier check //return 1; //for complier check
} }
int is_vaild(u32_t seq) int is_vaild(u32_t seq)
{ {
return st.find(seq)==st.end(); if(mp.find(seq)==mp.end()) return 1;
if(get_current_time_rough()-mp[seq].my_time>anti_replay_timeout)
{
replay_buffer[mp[seq].index]=u64_t(i64_t(-1));
mp.erase(seq);
return 1;
}
return 0;
} }
}; };