2012-05-07 00:48:58 +08:00
|
|
|
|
#ifndef __TEST_H__
|
|
|
|
|
#define __TEST_H__
|
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
#include <time.h>
|
|
|
|
|
#include <ctype.h>
|
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
|
|
#include "ikcp.h"
|
|
|
|
|
|
|
|
|
|
#if defined(WIN32) || defined(_WIN32) || defined(WIN64) || defined(_WIN64)
|
|
|
|
|
#include <windows.h>
|
|
|
|
|
#elif !defined(__unix)
|
|
|
|
|
#define __unix
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifdef __unix
|
|
|
|
|
#include <unistd.h>
|
|
|
|
|
#include <sys/time.h>
|
|
|
|
|
#include <sys/wait.h>
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* get system time */
|
|
|
|
|
static inline void itimeofday(long *sec, long *usec)
|
|
|
|
|
{
|
|
|
|
|
#if defined(__unix)
|
|
|
|
|
struct timeval time;
|
|
|
|
|
gettimeofday(&time, NULL);
|
|
|
|
|
if (sec) *sec = time.tv_sec;
|
|
|
|
|
if (usec) *usec = time.tv_usec;
|
|
|
|
|
#else
|
|
|
|
|
static long mode = 0, addsec = 0;
|
|
|
|
|
BOOL retval;
|
|
|
|
|
static IINT64 freq = 1;
|
|
|
|
|
IINT64 qpc;
|
|
|
|
|
if (mode == 0) {
|
|
|
|
|
retval = QueryPerformanceFrequency((LARGE_INTEGER*)&freq);
|
|
|
|
|
freq = (freq == 0)? 1 : freq;
|
|
|
|
|
retval = QueryPerformanceCounter((LARGE_INTEGER*)&qpc);
|
|
|
|
|
addsec = (long)time(NULL);
|
|
|
|
|
addsec = addsec - (long)((qpc / freq) & 0x7fffffff);
|
|
|
|
|
mode = 1;
|
|
|
|
|
}
|
|
|
|
|
retval = QueryPerformanceCounter((LARGE_INTEGER*)&qpc);
|
|
|
|
|
retval = retval * 2;
|
|
|
|
|
if (sec) *sec = (long)(qpc / freq) + addsec;
|
|
|
|
|
if (usec) *usec = (long)((qpc % freq) * 1000000 / freq);
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* get clock in millisecond 64 */
|
|
|
|
|
static inline IINT64 iclock64(void)
|
|
|
|
|
{
|
|
|
|
|
long s, u;
|
|
|
|
|
IINT64 value;
|
|
|
|
|
itimeofday(&s, &u);
|
|
|
|
|
value = ((IINT64)s) * 1000 + (u / 1000);
|
|
|
|
|
return value;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline IUINT32 iclock()
|
|
|
|
|
{
|
|
|
|
|
return (IUINT32)(iclock64() & 0xfffffffful);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* sleep in millisecond */
|
|
|
|
|
static inline void isleep(unsigned long millisecond)
|
|
|
|
|
{
|
|
|
|
|
#ifdef __unix /* usleep( time * 1000 ); */
|
|
|
|
|
struct timespec ts;
|
|
|
|
|
ts.tv_sec = (time_t)(millisecond / 1000);
|
|
|
|
|
ts.tv_nsec = (long)((millisecond % 1000) * 1000000);
|
|
|
|
|
/*nanosleep(&ts, NULL);*/
|
|
|
|
|
usleep((millisecond << 10) - (millisecond << 4) - (millisecond << 3));
|
|
|
|
|
#elif defined(_WIN32)
|
|
|
|
|
Sleep(millisecond);
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
|
#include <list>
|
|
|
|
|
#include <vector>
|
|
|
|
|
|
2017-02-02 12:07:40 +08:00
|
|
|
|
// 带延迟的数据包
|
2012-05-07 00:48:58 +08:00
|
|
|
|
class DelayPacket
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
virtual ~DelayPacket() {
|
|
|
|
|
if (_ptr) delete _ptr;
|
|
|
|
|
_ptr = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
DelayPacket(int size, const void *src = NULL) {
|
|
|
|
|
_ptr = new unsigned char[size];
|
|
|
|
|
_size = size;
|
|
|
|
|
if (src) {
|
|
|
|
|
memcpy(_ptr, src, size);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned char* ptr() { return _ptr; }
|
|
|
|
|
const unsigned char* ptr() const { return _ptr; }
|
|
|
|
|
|
|
|
|
|
int size() const { return _size; }
|
|
|
|
|
IUINT32 ts() const { return _ts; }
|
|
|
|
|
void setts(IUINT32 ts) { _ts = ts; }
|
|
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
unsigned char *_ptr;
|
|
|
|
|
int _size;
|
|
|
|
|
IUINT32 _ts;
|
|
|
|
|
};
|
|
|
|
|
|
2017-02-02 12:07:40 +08:00
|
|
|
|
// 均匀分布的随机数
|
2012-05-07 00:48:58 +08:00
|
|
|
|
class Random
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
Random(int size) {
|
|
|
|
|
this->size = 0;
|
|
|
|
|
seeds.resize(size);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int random() {
|
|
|
|
|
int x, i;
|
|
|
|
|
if (seeds.size() == 0) return 0;
|
|
|
|
|
if (size == 0) {
|
|
|
|
|
for (i = 0; i < (int)seeds.size(); i++) {
|
|
|
|
|
seeds[i] = i;
|
|
|
|
|
}
|
|
|
|
|
size = (int)seeds.size();
|
|
|
|
|
}
|
|
|
|
|
i = rand() % size;
|
|
|
|
|
x = seeds[i];
|
|
|
|
|
seeds[i] = seeds[--size];
|
|
|
|
|
return x;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
int size;
|
|
|
|
|
std::vector<int> seeds;
|
|
|
|
|
};
|
|
|
|
|
|
2017-02-02 12:07:40 +08:00
|
|
|
|
// 网络延迟模拟器
|
2012-05-07 00:48:58 +08:00
|
|
|
|
class LatencySimulator
|
|
|
|
|
{
|
|
|
|
|
public:
|
2016-06-03 20:28:21 +08:00
|
|
|
|
|
2012-05-07 00:48:58 +08:00
|
|
|
|
virtual ~LatencySimulator() {
|
|
|
|
|
clear();
|
|
|
|
|
}
|
|
|
|
|
|
2017-02-02 12:07:40 +08:00
|
|
|
|
// lostrate: 往返一周丢包率的百分比,默认 10%
|
|
|
|
|
// rttmin:rtt最小值,默认 60
|
|
|
|
|
// rttmax:rtt最大值,默认 125
|
2012-05-07 00:48:58 +08:00
|
|
|
|
LatencySimulator(int lostrate = 10, int rttmin = 60, int rttmax = 125, int nmax = 1000):
|
|
|
|
|
r12(100), r21(100) {
|
|
|
|
|
current = iclock();
|
2017-02-02 12:07:40 +08:00
|
|
|
|
this->lostrate = lostrate / 2; // 上面数据是往返丢包率,单程除以2
|
2012-05-07 00:48:58 +08:00
|
|
|
|
this->rttmin = rttmin / 2;
|
|
|
|
|
this->rttmax = rttmax / 2;
|
|
|
|
|
this->nmax = nmax;
|
2016-06-03 20:28:21 +08:00
|
|
|
|
tx1 = tx2 = 0;
|
2012-05-07 00:48:58 +08:00
|
|
|
|
}
|
|
|
|
|
|
2017-02-02 12:07:40 +08:00
|
|
|
|
// 清除数据
|
2012-05-07 00:48:58 +08:00
|
|
|
|
void clear() {
|
|
|
|
|
DelayTunnel::iterator it;
|
|
|
|
|
for (it = p12.begin(); it != p12.end(); it++) {
|
|
|
|
|
delete *it;
|
|
|
|
|
}
|
|
|
|
|
for (it = p21.begin(); it != p21.end(); it++) {
|
|
|
|
|
delete *it;
|
|
|
|
|
}
|
|
|
|
|
p12.clear();
|
|
|
|
|
p21.clear();
|
|
|
|
|
}
|
|
|
|
|
|
2017-02-02 12:07:40 +08:00
|
|
|
|
// 发送数据
|
|
|
|
|
// peer - 端点0/1,从0发送,从1接收;从1发送从0接收
|
2012-05-07 00:48:58 +08:00
|
|
|
|
void send(int peer, const void *data, int size) {
|
|
|
|
|
if (peer == 0) {
|
2016-06-03 20:28:21 +08:00
|
|
|
|
tx1++;
|
2012-05-07 00:48:58 +08:00
|
|
|
|
if (r12.random() < lostrate) return;
|
|
|
|
|
if ((int)p12.size() >= nmax) return;
|
|
|
|
|
} else {
|
2016-06-03 20:28:21 +08:00
|
|
|
|
tx2++;
|
2012-05-07 00:48:58 +08:00
|
|
|
|
if (r21.random() < lostrate) return;
|
|
|
|
|
if ((int)p21.size() >= nmax) return;
|
|
|
|
|
}
|
|
|
|
|
DelayPacket *pkt = new DelayPacket(size, data);
|
|
|
|
|
current = iclock();
|
|
|
|
|
IUINT32 delay = rttmin;
|
|
|
|
|
if (rttmax > rttmin) delay += rand() % (rttmax - rttmin);
|
|
|
|
|
pkt->setts(current + delay);
|
|
|
|
|
if (peer == 0) {
|
|
|
|
|
p12.push_back(pkt);
|
|
|
|
|
} else {
|
|
|
|
|
p21.push_back(pkt);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-02-02 12:07:40 +08:00
|
|
|
|
// 接收数据
|
2012-05-07 00:48:58 +08:00
|
|
|
|
int recv(int peer, void *data, int maxsize) {
|
|
|
|
|
DelayTunnel::iterator it;
|
|
|
|
|
if (peer == 0) {
|
|
|
|
|
it = p21.begin();
|
|
|
|
|
if (p21.size() == 0) return -1;
|
|
|
|
|
} else {
|
|
|
|
|
it = p12.begin();
|
|
|
|
|
if (p12.size() == 0) return -1;
|
|
|
|
|
}
|
|
|
|
|
DelayPacket *pkt = *it;
|
|
|
|
|
current = iclock();
|
|
|
|
|
if (current < pkt->ts()) return -2;
|
|
|
|
|
if (maxsize < pkt->size()) return -3;
|
|
|
|
|
if (peer == 0) {
|
|
|
|
|
p21.erase(it);
|
|
|
|
|
} else {
|
|
|
|
|
p12.erase(it);
|
|
|
|
|
}
|
|
|
|
|
maxsize = pkt->size();
|
|
|
|
|
memcpy(data, pkt->ptr(), maxsize);
|
2014-12-29 00:43:25 +08:00
|
|
|
|
delete pkt;
|
2012-05-07 00:48:58 +08:00
|
|
|
|
return maxsize;
|
|
|
|
|
}
|
|
|
|
|
|
2016-06-03 20:28:21 +08:00
|
|
|
|
public:
|
|
|
|
|
int tx1;
|
|
|
|
|
int tx2;
|
|
|
|
|
|
2012-05-07 00:48:58 +08:00
|
|
|
|
protected:
|
|
|
|
|
IUINT32 current;
|
|
|
|
|
int lostrate;
|
|
|
|
|
int rttmin;
|
|
|
|
|
int rttmax;
|
|
|
|
|
int nmax;
|
|
|
|
|
typedef std::list<DelayPacket*> DelayTunnel;
|
|
|
|
|
DelayTunnel p12;
|
|
|
|
|
DelayTunnel p21;
|
|
|
|
|
Random r12;
|
|
|
|
|
Random r21;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|