Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Contribute to GitLab
Sign in / Register
Toggle navigation
F
ffmpeg.wasm-core
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Linshizhi
ffmpeg.wasm-core
Commits
3178a865
Commit
3178a865
authored
May 12, 2004
by
Michael Niedermayer
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
support skiped blocks in SVQ1
Originally committed as revision 3127 to
svn://svn.ffmpeg.org/ffmpeg/trunk
parent
5e13a730
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
13 additions
and
6 deletions
+13
-6
svq1.c
libavcodec/svq1.c
+13
-6
No files found.
libavcodec/svq1.c
View file @
3178a865
...
@@ -1649,13 +1649,20 @@ av_log(s->avctx, AV_LOG_INFO, "* level 5 vector @ %d, %d:\n", x * 16, y * 16);
...
@@ -1649,13 +1649,20 @@ av_log(s->avctx, AV_LOG_INFO, "* level 5 vector @ %d, %d:\n", x * 16, y * 16);
score
[
1
]
+=
encode_block
(
s
,
src
+
16
*
x
,
temp
+
16
,
decoded
,
stride
,
5
,
64
,
lambda
,
0
);
score
[
1
]
+=
encode_block
(
s
,
src
+
16
*
x
,
temp
+
16
,
decoded
,
stride
,
5
,
64
,
lambda
,
0
);
best
=
score
[
1
]
<=
score
[
0
];
best
=
score
[
1
]
<=
score
[
0
];
vlc
=
svq1_block_type_vlc
[
SVQ1_BLOCK_SKIP
];
score
[
2
]
=
s
->
dsp
.
sse
[
0
](
NULL
,
src
+
16
*
x
,
ref
,
stride
,
16
);
score
[
2
]
+=
vlc
[
1
]
*
lambda
;
if
(
score
[
2
]
<
score
[
best
]
&&
mx
==
0
&&
my
==
0
){
best
=
2
;
s
->
dsp
.
put_pixels_tab
[
0
][
0
](
decoded
,
ref
,
stride
,
16
);
for
(
i
=
0
;
i
<
6
;
i
++
){
count
[
2
][
i
]
=
0
;
}
}
#if 0
put_bits
(
&
s
->
pb
,
vlc
[
1
],
vlc
[
0
]);
if(skiped_score <= score[best]){
best=3;
...
}
}
#endif
}
if
(
best
==
1
){
if
(
best
==
1
){
for
(
i
=
0
;
i
<
6
;
i
++
){
for
(
i
=
0
;
i
<
6
;
i
++
){
count
[
1
][
i
]
=
put_bits_count
(
&
s
->
reorder_pb
[
i
]);
count
[
1
][
i
]
=
put_bits_count
(
&
s
->
reorder_pb
[
i
]);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment