Skip to content
GitLab
Explore
Projects
Groups
Topics
Snippets
Projects
Groups
Topics
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
BC
public
external
libvpx
Commits
39c7b01d
Commit
39c7b01d
authored
11 years ago
by
Dmitry Kovalev
Browse files
Options
Download
Patches
Plain Diff
Cleanup in vp9_init3smotion_compensation.
Change-Id: Ie47f53e76bc9530475c8c6d24e9b7a5a0189de56
parent
24df77e9
v1.14.0-linphone
1.4.X
feature/update_to_v1.9.0-linphone
feature/uwp_nuget
forest
frame_parallel
highbitdepth
indianrunnerduck
javanwhistlingduck
khakicampbell
linphone
linphone-android
linphone-old
longtailedduck
m49-2623
m52-2743
m54-2840
m56-2924
m66-3359
m68-3440
mandarinduck
mcw
mcw2
nextgen
nextgenv2
pcs-2013
playground
sandbox/Jingning/experimental
sandbox/Jingning/transcode
sandbox/Jingning/vpx
sandbox/aconverse@google.com/ansbench
sandbox/debargha/playground
sandbox/hkuang/frame_parallel
sandbox/hkuang@google.com/decode
sandbox/jimbankoski@google.com/proposed-aom
sandbox/jingning@google.com/decoder_test_suite
sandbox/jingning@google.com/experimental
sandbox/jzern@google.com/test
sandbox/wangch@google.com/vp9
sandbox/yaowu@google.com/mergeaom
v1.12.0-linphone
v1.6.1_linphone
v1.7.0-linphone
v1.9.0-linphone
v1.9.0
v1.9.0-rc1
v1.8.2
v1.8.1
v1.8.0
v1.7.0
v1.6.1
v1.6.0
v1.5.0
v1.4.0
v1.3.0
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
vp9/encoder/vp9_mcomp.c
+15
-55
vp9/encoder/vp9_mcomp.c
with
15 additions
and
55 deletions
vp9/encoder/vp9_mcomp.c
+
15
−
55
View file @
39c7b01d
...
...
@@ -136,66 +136,26 @@ void vp9_init_dsmotion_compensation(MACROBLOCK *x, int stride) {
}
void
vp9_init3smotion_compensation
(
MACROBLOCK
*
x
,
int
stride
)
{
int
len
;
int
search_site_count
=
0
;
int
len
,
ss_count
=
1
;
// Generate offsets for 8 search sites per step.
x
->
ss
[
search_site_count
].
mv
.
col
=
0
;
x
->
ss
[
search_site_count
].
mv
.
row
=
0
;
x
->
ss
[
search_site_count
].
offset
=
0
;
search_site_count
++
;
x
->
ss
[
0
].
mv
.
col
=
x
->
ss
[
0
].
mv
.
row
=
0
;
x
->
ss
[
0
].
offset
=
0
;
for
(
len
=
MAX_FIRST_STEP
;
len
>
0
;
len
/=
2
)
{
// Compute offsets for search sites.
x
->
ss
[
search_site_count
].
mv
.
col
=
0
;
x
->
ss
[
search_site_count
].
mv
.
row
=
-
len
;
x
->
ss
[
search_site_count
].
offset
=
-
len
*
stride
;
search_site_count
++
;
// Compute offsets for search sites.
x
->
ss
[
search_site_count
].
mv
.
col
=
0
;
x
->
ss
[
search_site_count
].
mv
.
row
=
len
;
x
->
ss
[
search_site_count
].
offset
=
len
*
stride
;
search_site_count
++
;
// Compute offsets for search sites.
x
->
ss
[
search_site_count
].
mv
.
col
=
-
len
;
x
->
ss
[
search_site_count
].
mv
.
row
=
0
;
x
->
ss
[
search_site_count
].
offset
=
-
len
;
search_site_count
++
;
// Compute offsets for search sites.
x
->
ss
[
search_site_count
].
mv
.
col
=
len
;
x
->
ss
[
search_site_count
].
mv
.
row
=
0
;
x
->
ss
[
search_site_count
].
offset
=
len
;
search_site_count
++
;
// Compute offsets for search sites.
x
->
ss
[
search_site_count
].
mv
.
col
=
-
len
;
x
->
ss
[
search_site_count
].
mv
.
row
=
-
len
;
x
->
ss
[
search_site_count
].
offset
=
-
len
*
stride
-
len
;
search_site_count
++
;
// Compute offsets for search sites.
x
->
ss
[
search_site_count
].
mv
.
col
=
len
;
x
->
ss
[
search_site_count
].
mv
.
row
=
-
len
;
x
->
ss
[
search_site_count
].
offset
=
-
len
*
stride
+
len
;
search_site_count
++
;
// Compute offsets for search sites.
x
->
ss
[
search_site_count
].
mv
.
col
=
-
len
;
x
->
ss
[
search_site_count
].
mv
.
row
=
len
;
x
->
ss
[
search_site_count
].
offset
=
len
*
stride
-
len
;
search_site_count
++
;
// Compute offsets for search sites.
x
->
ss
[
search_site_count
].
mv
.
col
=
len
;
x
->
ss
[
search_site_count
].
mv
.
row
=
len
;
x
->
ss
[
search_site_count
].
offset
=
len
*
stride
+
len
;
search_site_count
++
;
// Generate offsets for 8 search sites per step.
const
MV
ss_mvs
[
8
]
=
{
{
0
,
-
len
},
{
0
,
len
},
{
-
len
,
0
},
{
len
,
0
},
{
-
len
,
-
len
},
{
len
,
-
len
},
{
-
len
,
len
},
{
len
,
len
}
};
int
i
;
for
(
i
=
0
;
i
<
8
;
++
i
)
{
search_site
*
const
ss
=
&
x
->
ss
[
ss_count
++
];
ss
->
mv
=
ss_mvs
[
i
];
ss
->
offset
=
ss
->
mv
.
row
*
stride
+
ss
->
mv
.
col
;
}
}
x
->
ss_count
=
s
earch_site
_count
;
x
->
ss_count
=
s
s
_count
;
x
->
searches_per_step
=
8
;
}
...
...
This diff is collapsed.
Click to expand it.
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment
Menu
Explore
Projects
Groups
Topics
Snippets