Skip to content
项目
群组
代码片段
帮助
正在加载...
登录
切换导航
F
freeswitch
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
张华
freeswitch
Commits
76f6507e
提交
76f6507e
authored
7月 03, 2014
作者:
Anthony Minessale
提交者:
Ken Rice
7月 03, 2014
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
fix jb endless loop of missing packets
上级
2b62885f
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
45 行增加
和
18 行删除
+45
-18
stfu.c
libs/stfu/stfu.c
+45
-18
没有找到文件。
libs/stfu/stfu.c
浏览文件 @
76f6507e
...
@@ -505,9 +505,9 @@ stfu_status_t stfu_n_add_data(stfu_instance_t *i, uint32_t ts, uint16_t seq, uin
...
@@ -505,9 +505,9 @@ stfu_status_t stfu_n_add_data(stfu_instance_t *i, uint32_t ts, uint16_t seq, uin
if
(
i
->
last_wr_ts
)
{
if
(
i
->
last_wr_ts
)
{
if
(
ts
<
1000
&&
i
->
last_wr_ts
>
(
UINT_MAX
-
1000
))
{
if
(
ts
<
1000
&&
i
->
last_wr_ts
>
(
UINT_MAX
-
1000
))
{
i
->
diff
=
abs
((
(
UINT_MAX
-
i
->
last_wr_ts
)
+
ts
)
/
i
->
samples_per_packet
);
i
->
diff
=
abs
((
int
)(((
UINT_MAX
-
i
->
last_wr_ts
)
+
ts
)
/
i
->
samples_per_packet
)
);
}
else
if
(
ts
)
{
}
else
if
(
ts
)
{
i
->
diff
=
abs
(
i
->
last_wr_ts
-
ts
)
/
i
->
samples_per_packet
;
i
->
diff
=
abs
(
(
int
)(
i
->
last_wr_ts
-
ts
)
)
/
i
->
samples_per_packet
;
}
}
}
}
...
@@ -567,19 +567,30 @@ stfu_status_t stfu_n_add_data(stfu_instance_t *i, uint32_t ts, uint16_t seq, uin
...
@@ -567,19 +567,30 @@ stfu_status_t stfu_n_add_data(stfu_instance_t *i, uint32_t ts, uint16_t seq, uin
return
STFU_IT_WORKED
;
return
STFU_IT_WORKED
;
}
}
static
int
stfu_n_find_any_frame
(
stfu_instance_t
*
in
,
stfu_queue_t
*
queue
,
stfu_frame_t
**
r_frame
)
static
int
stfu_n_find_any_frame
(
stfu_instance_t
*
in
,
stfu_queue_t
*
queue
,
stfu_frame_t
**
r_frame
,
int
force
)
{
{
uint32_t
i
=
0
,
best_index
=
0
;
uint32_t
i
=
0
,
best_index
=
0
;
int
best_diff
=
1000000
,
cur_diff
=
0
;
int
best_diff
=
1000000
,
cur_diff
=
0
;
stfu_frame_t
*
frame
=
NULL
,
*
best_frame
=
NULL
;
stfu_frame_t
*
frame
=
NULL
,
*
best_frame
=
NULL
;
int
newer
=
0
;
stfu_assert
(
r_frame
);
stfu_assert
(
r_frame
);
*
r_frame
=
NULL
;
*
r_frame
=
NULL
;
top:
if
(
force
)
{
in
->
cur_ts
=
0
;
}
for
(
i
=
0
;
i
<
queue
->
real_array_size
;
i
++
)
{
for
(
i
=
0
;
i
<
queue
->
real_array_size
;
i
++
)
{
frame
=
&
queue
->
array
[
i
];
frame
=
&
queue
->
array
[
i
];
cur_diff
=
abs
(
frame
->
ts
-
in
->
cur_ts
);
if
(
!
frame
->
was_read
&&
in
->
cur_ts
&&
frame
->
ts
>
in
->
cur_ts
)
{
newer
++
;
}
cur_diff
=
abs
((
int
)(
frame
->
ts
-
in
->
cur_ts
));
if
(
!
frame
->
was_read
&&
cur_diff
<
best_diff
)
{
if
(
!
frame
->
was_read
&&
cur_diff
<
best_diff
)
{
best_diff
=
cur_diff
;
best_diff
=
cur_diff
;
...
@@ -588,6 +599,11 @@ static int stfu_n_find_any_frame(stfu_instance_t *in, stfu_queue_t *queue, stfu_
...
@@ -588,6 +599,11 @@ static int stfu_n_find_any_frame(stfu_instance_t *in, stfu_queue_t *queue, stfu_
}
}
}
}
if
(
!
force
&&
!
best_frame
&&
newer
)
{
force
=
1
;
goto
top
;
}
if
(
best_frame
)
{
if
(
best_frame
)
{
*
r_frame
=
best_frame
;
*
r_frame
=
best_frame
;
queue
->
last_index
=
best_index
;
queue
->
last_index
=
best_index
;
...
@@ -683,7 +699,7 @@ stfu_frame_t *stfu_n_read_a_frame(stfu_instance_t *i)
...
@@ -683,7 +699,7 @@ stfu_frame_t *stfu_n_read_a_frame(stfu_instance_t *i)
if
(
i
->
sync_out
)
{
if
(
i
->
sync_out
)
{
if
(
!
found
)
{
if
(
!
found
)
{
if
((
found
=
stfu_n_find_any_frame
(
i
,
i
->
out_queue
,
&
rframe
)))
{
if
((
found
=
stfu_n_find_any_frame
(
i
,
i
->
out_queue
,
&
rframe
,
1
)))
{
i
->
cur_ts
=
rframe
->
ts
;
i
->
cur_ts
=
rframe
->
ts
;
i
->
cur_seq
=
rframe
->
seq
;
i
->
cur_seq
=
rframe
->
seq
;
}
}
...
@@ -759,7 +775,7 @@ stfu_frame_t *stfu_n_read_a_frame(stfu_instance_t *i)
...
@@ -759,7 +775,7 @@ stfu_frame_t *stfu_n_read_a_frame(stfu_instance_t *i)
i
->
period_bad_count
++
;
i
->
period_bad_count
++
;
i
->
consecutive_good_count
=
0
;
i
->
consecutive_good_count
=
0
;
}
}
if
(
found
)
{
if
(
found
)
{
i
->
last_frame
=
rframe
;
i
->
last_frame
=
rframe
;
i
->
out_queue
->
wr_len
++
;
i
->
out_queue
->
wr_len
++
;
...
@@ -773,7 +789,13 @@ stfu_frame_t *stfu_n_read_a_frame(stfu_instance_t *i)
...
@@ -773,7 +789,13 @@ stfu_frame_t *stfu_n_read_a_frame(stfu_instance_t *i)
i
->
plc_pt
=
rframe
->
pt
;
i
->
plc_pt
=
rframe
->
pt
;
}
else
{
}
else
{
if
(
stfu_n_find_any_frame
(
i
,
i
->
out_queue
,
&
rframe
))
{
int
force
=
0
;
if
(
i
->
consecutive_bad_count
>
(
i
->
max_qlen
/
2
))
{
force
=
1
;
}
if
(
stfu_n_find_any_frame
(
i
,
i
->
out_queue
,
&
rframe
,
force
))
{
i
->
cur_ts
=
rframe
->
ts
;
i
->
cur_ts
=
rframe
->
ts
;
i
->
cur_seq
=
rframe
->
seq
;
i
->
cur_seq
=
rframe
->
seq
;
i
->
last_wr_ts
=
i
->
cur_ts
;
i
->
last_wr_ts
=
i
->
cur_ts
;
...
@@ -785,17 +807,22 @@ stfu_frame_t *stfu_n_read_a_frame(stfu_instance_t *i)
...
@@ -785,17 +807,22 @@ stfu_frame_t *stfu_n_read_a_frame(stfu_instance_t *i)
}
}
}
else
{
}
else
{
i
->
last_wr_ts
=
i
->
cur_ts
;
if
(
force
)
{
rframe
=
&
i
->
out_queue
->
int_frame
;
stfu_log
(
STFU_LOG_EMERG
,
"%s NO PACKETS HARD RESETTING
\n
"
,
i
->
name
);
rframe
->
dlen
=
i
->
plc_len
;
stfu_n_reset
(
i
);
rframe
->
pt
=
i
->
plc_pt
;
}
else
{
rframe
->
ts
=
i
->
cur_ts
;
i
->
last_wr_ts
=
i
->
cur_ts
;
rframe
->
seq
=
i
->
cur_seq
;
rframe
=
&
i
->
out_queue
->
int_frame
;
i
->
miss_count
++
;
rframe
->
dlen
=
i
->
plc_len
;
rframe
->
pt
=
i
->
plc_pt
;
rframe
->
ts
=
i
->
cur_ts
;
rframe
->
seq
=
i
->
cur_seq
;
i
->
miss_count
++
;
if
(
stfu_log
!=
null_logger
&&
i
->
debug
)
{
if
(
stfu_log
!=
null_logger
&&
i
->
debug
)
{
stfu_log
(
STFU_LOG_EMERG
,
"%s PLC %d/%d %d %ld %u:%u
\n
"
,
i
->
name
,
stfu_log
(
STFU_LOG_EMERG
,
"%s PLC %d/%d %d %ld %u:%u
\n
"
,
i
->
name
,
i
->
miss_count
,
i
->
max_qlen
,
rframe
->
plc
,
rframe
->
dlen
,
rframe
->
ts
,
rframe
->
ts
/
i
->
samples_per_packet
);
i
->
miss_count
,
i
->
max_qlen
,
rframe
->
plc
,
rframe
->
dlen
,
rframe
->
ts
,
rframe
->
ts
/
i
->
samples_per_packet
);
}
}
}
}
}
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论