Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
小白菜888
Ffmpeg
提交
4672503d
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,发现更多精彩内容 >>
提交
4672503d
编写于
2月 19, 2007
作者:
L
Loren Merritt
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
simplify in fill_caches
Originally committed as revision 8026 to
svn://svn.ffmpeg.org/ffmpeg/trunk
上级
9b2bb403
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
16 addition
and
29 deletion
+16
-29
libavcodec/h264.c
libavcodec/h264.c
+16
-29
未找到文件。
libavcodec/h264.c
浏览文件 @
4672503d
...
...
@@ -812,34 +812,21 @@ static void fill_caches(H264Context *h, int mb_type, int for_deblock){
*
(
uint32_t
*
)
&
h
->
ref_cache
[
list
][
scan8
[
0
]
+
0
-
1
*
8
]
=
((
top_type
?
LIST_NOT_USED
:
PART_NOT_AVAILABLE
)
&
0xFF
)
*
0x01010101
;
}
//FIXME unify cleanup or sth
if
(
USES_LIST
(
left_type
[
0
],
list
)){
const
int
b_xy
=
h
->
mb2b_xy
[
left_xy
[
0
]]
+
3
;
const
int
b8_xy
=
h
->
mb2b8_xy
[
left_xy
[
0
]]
+
1
;
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
scan8
[
0
]
-
1
+
0
*
8
]
=
*
(
uint32_t
*
)
s
->
current_picture
.
motion_val
[
list
][
b_xy
+
h
->
b_stride
*
left_block
[
0
]];
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
scan8
[
0
]
-
1
+
1
*
8
]
=
*
(
uint32_t
*
)
s
->
current_picture
.
motion_val
[
list
][
b_xy
+
h
->
b_stride
*
left_block
[
1
]];
h
->
ref_cache
[
list
][
scan8
[
0
]
-
1
+
0
*
8
]
=
s
->
current_picture
.
ref_index
[
list
][
b8_xy
+
h
->
b8_stride
*
(
left_block
[
0
]
>>
1
)];
h
->
ref_cache
[
list
][
scan8
[
0
]
-
1
+
1
*
8
]
=
s
->
current_picture
.
ref_index
[
list
][
b8_xy
+
h
->
b8_stride
*
(
left_block
[
1
]
>>
1
)];
}
else
{
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
scan8
[
0
]
-
1
+
0
*
8
]
=
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
scan8
[
0
]
-
1
+
1
*
8
]
=
0
;
h
->
ref_cache
[
list
][
scan8
[
0
]
-
1
+
0
*
8
]
=
h
->
ref_cache
[
list
][
scan8
[
0
]
-
1
+
1
*
8
]
=
left_type
[
0
]
?
LIST_NOT_USED
:
PART_NOT_AVAILABLE
;
}
if
(
USES_LIST
(
left_type
[
1
],
list
)){
const
int
b_xy
=
h
->
mb2b_xy
[
left_xy
[
1
]]
+
3
;
const
int
b8_xy
=
h
->
mb2b8_xy
[
left_xy
[
1
]]
+
1
;
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
scan8
[
0
]
-
1
+
2
*
8
]
=
*
(
uint32_t
*
)
s
->
current_picture
.
motion_val
[
list
][
b_xy
+
h
->
b_stride
*
left_block
[
2
]];
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
scan8
[
0
]
-
1
+
3
*
8
]
=
*
(
uint32_t
*
)
s
->
current_picture
.
motion_val
[
list
][
b_xy
+
h
->
b_stride
*
left_block
[
3
]];
h
->
ref_cache
[
list
][
scan8
[
0
]
-
1
+
2
*
8
]
=
s
->
current_picture
.
ref_index
[
list
][
b8_xy
+
h
->
b8_stride
*
(
left_block
[
2
]
>>
1
)];
h
->
ref_cache
[
list
][
scan8
[
0
]
-
1
+
3
*
8
]
=
s
->
current_picture
.
ref_index
[
list
][
b8_xy
+
h
->
b8_stride
*
(
left_block
[
3
]
>>
1
)];
}
else
{
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
scan8
[
0
]
-
1
+
2
*
8
]
=
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
scan8
[
0
]
-
1
+
3
*
8
]
=
0
;
h
->
ref_cache
[
list
][
scan8
[
0
]
-
1
+
2
*
8
]
=
h
->
ref_cache
[
list
][
scan8
[
0
]
-
1
+
3
*
8
]
=
left_type
[
0
]
?
LIST_NOT_USED
:
PART_NOT_AVAILABLE
;
assert
((
!
left_type
[
0
])
==
(
!
left_type
[
1
]));
for
(
i
=
0
;
i
<
2
;
i
++
){
int
cache_idx
=
scan8
[
0
]
-
1
+
i
*
2
*
8
;
if
(
USES_LIST
(
left_type
[
i
],
list
)){
const
int
b_xy
=
h
->
mb2b_xy
[
left_xy
[
i
]]
+
3
;
const
int
b8_xy
=
h
->
mb2b8_xy
[
left_xy
[
i
]]
+
1
;
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
cache_idx
]
=
*
(
uint32_t
*
)
s
->
current_picture
.
motion_val
[
list
][
b_xy
+
h
->
b_stride
*
left_block
[
0
+
i
*
2
]];
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
cache_idx
+
8
]
=
*
(
uint32_t
*
)
s
->
current_picture
.
motion_val
[
list
][
b_xy
+
h
->
b_stride
*
left_block
[
1
+
i
*
2
]];
h
->
ref_cache
[
list
][
cache_idx
]
=
s
->
current_picture
.
ref_index
[
list
][
b8_xy
+
h
->
b8_stride
*
(
left_block
[
0
+
i
*
2
]
>>
1
)];
h
->
ref_cache
[
list
][
cache_idx
+
8
]
=
s
->
current_picture
.
ref_index
[
list
][
b8_xy
+
h
->
b8_stride
*
(
left_block
[
1
+
i
*
2
]
>>
1
)];
}
else
{
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
cache_idx
]
=
*
(
uint32_t
*
)
h
->
mv_cache
[
list
][
cache_idx
+
8
]
=
0
;
h
->
ref_cache
[
list
][
cache_idx
]
=
h
->
ref_cache
[
list
][
cache_idx
+
8
]
=
left_type
[
i
]
?
LIST_NOT_USED
:
PART_NOT_AVAILABLE
;
}
}
if
((
for_deblock
||
(
IS_DIRECT
(
mb_type
)
&&
!
h
->
direct_spatial_mv_pred
))
&&
!
FRAME_MBAFF
)
...
...
@@ -3632,7 +3619,7 @@ static void hl_decode_mb(H264Context *h){
const
int
dir
=
h
->
intra4x4_pred_mode_cache
[
scan8
[
i
]
];
const
int
nnz
=
h
->
non_zero_count_cache
[
scan8
[
i
]
];
h
->
pred8x8l
[
dir
](
ptr
,
(
h
->
topleft_samples_available
<<
i
)
&
0x8000
,
(
h
->
topright_samples_available
<<
(
i
+
1
))
&
0x8
000
,
linesize
);
(
h
->
topright_samples_available
<<
i
)
&
0x4
000
,
linesize
);
if
(
nnz
){
if
(
nnz
==
1
&&
h
->
mb
[
i
*
16
])
idct_dc_add
(
ptr
,
h
->
mb
+
i
*
16
,
linesize
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录