Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
小白菜888
Ffmpeg
提交
621f9a40
F
Ffmpeg
项目概览
小白菜888
/
Ffmpeg
通知
3
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
F
Ffmpeg
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
621f9a40
编写于
2月 12, 2010
作者:
D
David Conrad
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Cosmetics: reindent
Originally committed as revision 21779 to
svn://svn.ffmpeg.org/ffmpeg/trunk
上级
256c0662
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
48 addition
and
48 deletion
+48
-48
libavcodec/vp3.c
libavcodec/vp3.c
+48
-48
未找到文件。
libavcodec/vp3.c
浏览文件 @
621f9a40
...
...
@@ -1394,60 +1394,60 @@ static void apply_loop_filter(Vp3DecodeContext *s, int plane, int ystart, int ye
int
x
,
y
;
int
*
bounding_values
=
s
->
bounding_values_array
+
127
;
int
width
=
s
->
fragment_width
>>
!!
plane
;
int
height
=
s
->
fragment_height
>>
!!
plane
;
int
fragment
=
s
->
fragment_start
[
plane
]
+
ystart
*
width
;
int
stride
=
s
->
current_frame
.
linesize
[
plane
];
uint8_t
*
plane_data
=
s
->
current_frame
.
data
[
plane
];
if
(
!
s
->
flipped_image
)
stride
=
-
stride
;
for
(
y
=
ystart
;
y
<
yend
;
y
++
)
{
for
(
x
=
0
;
x
<
width
;
x
++
)
{
/* This code basically just deblocks on the edges of coded blocks.
* However, it has to be much more complicated because of the
* braindamaged deblock ordering used in VP3/Theora. Order matters
* because some pixels get filtered twice. */
if
(
s
->
all_fragments
[
fragment
].
coding_method
!=
MODE_COPY
)
{
/* do not perform left edge filter for left columns frags */
if
(
x
>
0
)
{
s
->
dsp
.
vp3_h_loop_filter
(
plane_data
+
s
->
all_fragments
[
fragment
].
first_pixel
,
stride
,
bounding_values
);
}
/* do not perform top edge filter for top row fragments */
if
(
y
>
0
)
{
s
->
dsp
.
vp3_v_loop_filter
(
plane_data
+
s
->
all_fragments
[
fragment
].
first_pixel
,
stride
,
bounding_values
);
}
int
width
=
s
->
fragment_width
>>
!!
plane
;
int
height
=
s
->
fragment_height
>>
!!
plane
;
int
fragment
=
s
->
fragment_start
[
plane
]
+
ystart
*
width
;
int
stride
=
s
->
current_frame
.
linesize
[
plane
];
uint8_t
*
plane_data
=
s
->
current_frame
.
data
[
plane
];
if
(
!
s
->
flipped_image
)
stride
=
-
stride
;
for
(
y
=
ystart
;
y
<
yend
;
y
++
)
{
for
(
x
=
0
;
x
<
width
;
x
++
)
{
/* This code basically just deblocks on the edges of coded blocks.
* However, it has to be much more complicated because of the
* braindamaged deblock ordering used in VP3/Theora. Order matters
* because some pixels get filtered twice. */
if
(
s
->
all_fragments
[
fragment
].
coding_method
!=
MODE_COPY
)
{
/* do not perform left edge filter for left columns frags */
if
(
x
>
0
)
{
s
->
dsp
.
vp3_h_loop_filter
(
plane_data
+
s
->
all_fragments
[
fragment
].
first_pixel
,
stride
,
bounding_values
);
}
/* do not perform right edge filter for right column
* fragments or if right fragment neighbor is also coded
* in this frame (it will be filtered in next iteration) */
if
((
x
<
width
-
1
)
&&
(
s
->
all_fragments
[
fragment
+
1
].
coding_method
==
MODE_COPY
))
{
s
->
dsp
.
vp3_h_loop_filter
(
plane_data
+
s
->
all_fragments
[
fragment
+
1
].
first_pixel
,
stride
,
bounding_values
);
}
/* do not perform top edge filter for top row fragments */
if
(
y
>
0
)
{
s
->
dsp
.
vp3_v_loop_filter
(
plane_data
+
s
->
all_fragments
[
fragment
].
first_pixel
,
stride
,
bounding_values
);
}
/* do not perform bottom edge filter for bottom row
* fragments or if bottom fragment neighbor is also coded
* in this frame (it will be filtered in the next row) */
if
((
y
<
height
-
1
)
&&
(
s
->
all_fragments
[
fragment
+
width
].
coding_method
==
MODE_COPY
))
{
s
->
dsp
.
vp3_v_loop_filter
(
plane_data
+
s
->
all_fragments
[
fragment
+
width
].
first_pixel
,
stride
,
bounding_values
);
}
/* do not perform right edge filter for right column
* fragments or if right fragment neighbor is also coded
* in this frame (it will be filtered in next iteration) */
if
((
x
<
width
-
1
)
&&
(
s
->
all_fragments
[
fragment
+
1
].
coding_method
==
MODE_COPY
))
{
s
->
dsp
.
vp3_h_loop_filter
(
plane_data
+
s
->
all_fragments
[
fragment
+
1
].
first_pixel
,
stride
,
bounding_values
);
}
fragment
++
;
/* do not perform bottom edge filter for bottom row
* fragments or if bottom fragment neighbor is also coded
* in this frame (it will be filtered in the next row) */
if
((
y
<
height
-
1
)
&&
(
s
->
all_fragments
[
fragment
+
width
].
coding_method
==
MODE_COPY
))
{
s
->
dsp
.
vp3_v_loop_filter
(
plane_data
+
s
->
all_fragments
[
fragment
+
width
].
first_pixel
,
stride
,
bounding_values
);
}
}
fragment
++
;
}
}
}
/*
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录