Skip to content
项目
群组
代码片段
帮助
正在加载...
登录
切换导航
F
freeswitch
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
张华
freeswitch
Commits
64a44ed3
提交
64a44ed3
authored
12月 21, 2016
作者:
colm
提交者:
Mike Jerris
1月 25, 2017
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
FS-9775: Improve dht route table query performance
上级
8be2251b
全部展开
隐藏空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
201 行增加
和
40 行删除
+201
-40
ks_dht_bucket.c
libs/libks/src/dht/ks_dht_bucket.c
+84
-33
testbuckets.c
libs/libks/test/testbuckets.c
+117
-7
没有找到文件。
libs/libks/src/dht/ks_dht_bucket.c
浏览文件 @
64a44ed3
差异被折叠。
点击展开。
libs/libks/test/testbuckets.c
浏览文件 @
64a44ed3
...
...
@@ -178,33 +178,45 @@ void test03()
enum
ks_afflags_t
both
=
ifboth
;
ks_status_t
status
;
int
ipv4_remote
=
0
;
int
ipv4_local
=
0
;
for
(
int
i
=
0
;
i
<
200
;
++
i
)
{
if
(
i
%
10
==
0
)
{
++
nodeid
.
id
[
0
];
nodeid
.
id
[
1
]
=
0
;
}
else
{
++
nodeid
.
id
[
1
];
}
ks_dhtrt_create_node
(
rt
,
nodeid
,
KS_DHT_REMOTE
,
ipv4
,
port
,
&
peer
);
ks_dhtrt_touch_node
(
rt
,
nodeid
);
ks_status_t
s0
=
ks_dhtrt_create_node
(
rt
,
nodeid
,
KS_DHT_REMOTE
,
ipv4
,
port
,
&
peer
);
if
(
s0
==
KS_STATUS_SUCCESS
)
{
ks_dhtrt_touch_node
(
rt
,
nodeid
);
++
ipv4_remote
;
}
}
for
(
int
i
=
0
;
i
<
2
;
++
i
)
{
if
(
i
%
10
==
0
)
{
++
nodeid
.
id
[
0
];
nodeid
.
id
[
1
]
=
0
;
}
else
{
++
nodeid
.
id
[
1
];
}
ks_dhtrt_create_node
(
rt
,
nodeid
,
KS_DHT_LOCAL
,
ipv4
,
port
,
&
peer
);
ks_dhtrt_touch_node
(
rt
,
nodeid
);
ks_status_t
s0
=
ks_dhtrt_create_node
(
rt
,
nodeid
,
KS_DHT_LOCAL
,
ipv4
,
port
,
&
peer
);
if
(
s0
==
KS_STATUS_SUCCESS
)
{
ks_dhtrt_touch_node
(
rt
,
nodeid
);
++
ipv4_local
;
}
}
for
(
int
i
=
0
;
i
<
201
;
++
i
)
{
if
(
i
%
10
==
0
)
{
++
nodeid
.
id
[
0
];
nodeid
.
id
[
1
]
=
0
;
}
else
{
++
nodeid
.
id
[
1
];
...
...
@@ -214,8 +226,12 @@ void test03()
}
ks_dhtrt_dump
(
rt
,
7
);
int
qcount
=
doquery
(
rt
,
nodeid
.
id
,
KS_DHT_LOCAL
,
both
);
printf
(
"
\n
** local query count expected 2, actual %d
\n
"
,
qcount
);
fflush
(
stdout
);
printf
(
"
\n
** local query count expected 2, actual %d, max %d
\n
"
,
qcount
,
ipv4_local
);
fflush
(
stdout
);
qcount
=
doquery
(
rt
,
nodeid
.
id
,
KS_DHT_REMOTE
,
both
);
printf
(
"
\n
*** remote query count expected 20, actual %d
\n
"
,
qcount
);
fflush
(
stdout
);
qcount
=
doquery
(
rt
,
nodeid
.
id
,
KS_DHT_BOTH
,
both
);
...
...
@@ -230,7 +246,7 @@ void test03()
printf
(
"
\n
*** AF_INET6 count expected 20, actual %d
\n
"
,
qcount
);
fflush
(
stdout
);
qcount
=
doquery
(
rt
,
nodeid
.
id
,
KS_DHT_REMOTE
,
ifv4
);
printf
(
"
\n
*** remote AF_INET query count expected 20, actual %d
\n
"
,
qcount
);
fflush
(
stdout
);
printf
(
"
\n
*** remote AF_INET query count expected 20, actual %d
max %d
\n
"
,
qcount
,
ipv4_remote
);
fflush
(
stdout
);
qcount
=
doquery
(
rt
,
nodeid
.
id
,
KS_DHT_REMOTE
,
ifv6
);
printf
(
"
\n
*** remote AF_INET6 query count expected 20, actual %d
\n
"
,
qcount
);
fflush
(
stdout
);
...
...
@@ -452,6 +468,88 @@ void test06()
}
void
test30
()
{
printf
(
"*** testbuckets - test03 start
\n
"
);
fflush
(
stdout
);
ks_dht_node_t
*
peer
;
ks_dht_nodeid_t
nodeid
;
memset
(
nodeid
.
id
,
0xef
,
KS_DHT_NODEID_SIZE
);
char
ipv6
[]
=
"1234:1234:1234:1234"
;
char
ipv4
[]
=
"123.123.123.123"
;
unsigned
short
port
=
7000
;
enum
ks_afflags_t
both
=
ifboth
;
ks_status_t
status
;
int
ipv4_remote
=
0
;
int
ipv4_local
=
0
;
for
(
int
i
=
0
;
i
<
200
;
++
i
)
{
if
(
i
%
10
==
0
)
{
++
nodeid
.
id
[
0
];
nodeid
.
id
[
1
]
=
0
;
}
else
{
++
nodeid
.
id
[
1
];
}
ks_status_t
s0
=
ks_dhtrt_create_node
(
rt
,
nodeid
,
KS_DHT_REMOTE
,
ipv4
,
port
,
&
peer
);
if
(
s0
==
KS_STATUS_SUCCESS
)
{
ks_dhtrt_touch_node
(
rt
,
nodeid
);
++
ipv4_remote
;
}
}
for
(
int
i
=
0
;
i
<
2
;
++
i
)
{
if
(
i
%
10
==
0
)
{
++
nodeid
.
id
[
0
];
nodeid
.
id
[
1
]
=
0
;
}
else
{
++
nodeid
.
id
[
1
];
}
ks_status_t
s0
=
ks_dhtrt_create_node
(
rt
,
nodeid
,
KS_DHT_LOCAL
,
ipv4
,
port
,
&
peer
);
if
(
s0
==
KS_STATUS_SUCCESS
)
{
ks_dhtrt_touch_node
(
rt
,
nodeid
);
++
ipv4_local
;
}
}
for
(
int
i
=
0
;
i
<
201
;
++
i
)
{
if
(
i
%
10
==
0
)
{
++
nodeid
.
id
[
0
];
nodeid
.
id
[
1
]
=
0
;
}
else
{
++
nodeid
.
id
[
1
];
}
ks_dhtrt_create_node
(
rt
,
nodeid
,
KS_DHT_REMOTE
,
ipv6
,
port
,
&
peer
);
ks_dhtrt_touch_node
(
rt
,
nodeid
);
}
ks_dhtrt_dump
(
rt
,
7
);
int
qcount
=
doquery
(
rt
,
nodeid
.
id
,
KS_DHT_LOCAL
,
both
);
printf
(
"
\n
** local query count expected 2, actual %d, max %d
\n
"
,
qcount
,
ipv4_local
);
fflush
(
stdout
);
qcount
=
doquery
(
rt
,
nodeid
.
id
,
KS_DHT_LOCAL
,
both
);
printf
(
"
\n
** local query count expected 2, actual %d, max %d
\n
"
,
qcount
,
ipv4_local
);
fflush
(
stdout
);
qcount
=
doquery
(
rt
,
nodeid
.
id
,
KS_DHT_BOTH
,
both
);
printf
(
"
\n
** local query count expected 20, actual %d, max %d
\n
"
,
qcount
,
ipv4_local
);
fflush
(
stdout
);
return
;
}
/* test resue of node memory */
void
test50
()
{
...
...
@@ -610,8 +708,11 @@ int main(int argc, char* argv[]) {
ks_dht_create
(
&
dht
,
NULL
,
NULL
);
ks_thread_pool_create
(
&
tpool
,
0
,
KS_DHT_TPOOL_MAX
,
KS_DHT_TPOOL_STACK
,
KS_PRI_NORMAL
,
KS_DHT_TPOOL_IDLE
);
// ks_thread_pool_create(&tpool, 0, KS_DHT_TPOOL_MAX, KS_DHT_TPOOL_STACK, KS_PRI_NORMAL, KS_DHT_TPOOL_IDLE);
tpool
=
0
;
ks_status_t
status
;
char
*
str
=
NULL
;
int
bytes
=
1024
;
...
...
@@ -675,6 +776,15 @@ int main(int argc, char* argv[]) {
continue
;
}
if
(
tests
[
tix
]
==
30
)
{
ks_dhtrt_initroute
(
&
rt
,
dht
,
pool
,
tpool
);
test30
();
ks_dhtrt_deinitroute
(
&
rt
);
continue
;
}
if
(
tests
[
tix
]
==
50
)
{
ks_dhtrt_initroute
(
&
rt
,
dht
,
pool
,
tpool
);
test50
();
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论