Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
F
FFmpeg
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container registry
Model registry
Operate
Environments
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
libremedia
Tethys
FFmpeg
Commits
0fedf754
Commit
0fedf754
authored
14 years ago
by
Diego Biurrun
Browse files
Options
Downloads
Patches
Plain Diff
libpostproc: Remove disabled code.
parent
dc900310
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
libpostproc/postprocess.c
+0
-32
0 additions, 32 deletions
libpostproc/postprocess.c
with
0 additions
and
32 deletions
libpostproc/postprocess.c
+
0
−
32
View file @
0fedf754
...
@@ -246,7 +246,6 @@ static inline int isVertDC_C(uint8_t src[], int stride, PPContext *c)
...
@@ -246,7 +246,6 @@ static inline int isVertDC_C(uint8_t src[], int stride, PPContext *c)
static
inline
int
isHorizMinMaxOk_C
(
uint8_t
src
[],
int
stride
,
int
QP
)
static
inline
int
isHorizMinMaxOk_C
(
uint8_t
src
[],
int
stride
,
int
QP
)
{
{
int
i
;
int
i
;
#if 1
for
(
i
=
0
;
i
<
2
;
i
++
){
for
(
i
=
0
;
i
<
2
;
i
++
){
if
((
unsigned
)(
src
[
0
]
-
src
[
5
]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
if
((
unsigned
)(
src
[
0
]
-
src
[
5
]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
src
+=
stride
;
src
+=
stride
;
...
@@ -257,19 +256,11 @@ static inline int isHorizMinMaxOk_C(uint8_t src[], int stride, int QP)
...
@@ -257,19 +256,11 @@ static inline int isHorizMinMaxOk_C(uint8_t src[], int stride, int QP)
if
((
unsigned
)(
src
[
6
]
-
src
[
3
]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
if
((
unsigned
)(
src
[
6
]
-
src
[
3
]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
src
+=
stride
;
src
+=
stride
;
}
}
#else
for
(
i
=
0
;
i
<
8
;
i
++
){
if
((
unsigned
)(
src
[
0
]
-
src
[
7
]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
src
+=
stride
;
}
#endif
return
1
;
return
1
;
}
}
static
inline
int
isVertMinMaxOk_C
(
uint8_t
src
[],
int
stride
,
int
QP
)
static
inline
int
isVertMinMaxOk_C
(
uint8_t
src
[],
int
stride
,
int
QP
)
{
{
#if 1
#if 1
int
x
;
int
x
;
src
+=
stride
*
4
;
src
+=
stride
*
4
;
for
(
x
=
0
;
x
<
BLOCK_SIZE
;
x
+=
4
){
for
(
x
=
0
;
x
<
BLOCK_SIZE
;
x
+=
4
){
...
@@ -278,30 +269,7 @@ static inline int isVertMinMaxOk_C(uint8_t src[], int stride, int QP)
...
@@ -278,30 +269,7 @@ static inline int isVertMinMaxOk_C(uint8_t src[], int stride, int QP)
if
((
unsigned
)(
src
[
2
+
x
+
4
*
stride
]
-
src
[
2
+
x
+
1
*
stride
]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
if
((
unsigned
)(
src
[
2
+
x
+
4
*
stride
]
-
src
[
2
+
x
+
1
*
stride
]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
if
((
unsigned
)(
src
[
3
+
x
+
6
*
stride
]
-
src
[
3
+
x
+
3
*
stride
]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
if
((
unsigned
)(
src
[
3
+
x
+
6
*
stride
]
-
src
[
3
+
x
+
3
*
stride
]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
}
}
#else
int
x
;
src
+=
stride
*
3
;
for
(
x
=
0
;
x
<
BLOCK_SIZE
;
x
++
){
if
((
unsigned
)(
src
[
x
+
stride
]
-
src
[
x
+
(
stride
<<
3
)]
+
2
*
QP
)
>
4
*
QP
)
return
0
;
}
#endif
return
1
;
#else
int
x
;
src
+=
stride
*
4
;
for
(
x
=
0
;
x
<
BLOCK_SIZE
;
x
++
){
int
min
=
255
;
int
max
=
0
;
int
y
;
for
(
y
=
0
;
y
<
8
;
y
++
){
int
v
=
src
[
x
+
y
*
stride
];
if
(
v
>
max
)
max
=
v
;
if
(
v
<
min
)
min
=
v
;
}
if
(
max
-
min
>
2
*
QP
)
return
0
;
}
return
1
;
return
1
;
#endif
}
}
static
inline
int
horizClassify_C
(
uint8_t
src
[],
int
stride
,
PPContext
*
c
)
static
inline
int
horizClassify_C
(
uint8_t
src
[],
int
stride
,
PPContext
*
c
)
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
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