1 /*
2 * Copyright (c) 2011 Pascal Getreuer
3 * Copyright (c) 2016 Paul B Mahol
4 *
5 * Redistribution and use in source and binary forms, with or without modification,
6 * are permitted provided that the following conditions are met:
7 *
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following
12 * disclaimer in the documentation and/or other materials provided
13 * with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
16 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
17 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
18 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
19 * HOLDER BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
20 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
21 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
22 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
23 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
24 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 */
27
28 #ifndef AVFILTER_GBLUR_INIT_H
29 #define AVFILTER_GBLUR_INIT_H
30
31 #include "config.h"
35
38 {
39 for (
int i = 0;
i < length;
i++) {
42 }
43 }
44
46 float nu, float bscale, float *localbuf)
47 {
48 int x;
49 for (
int y = 0; y <
height; y++) {
52 ptr[0] *= bscale;
53
54 /* Filter rightwards */
55 for (x = 1; x <
width; x++)
56 ptr[x] += nu * ptr[x - 1];
57 ptr[x =
width - 1] *= bscale;
58
59 /* Filter leftwards */
60 for (; x > 0; x--)
61 ptr[x - 1] += nu * ptr[x];
62 }
63 }
64 }
65
67 int column_begin, int column_end, int steps,
68 float nu, float boundaryscale, int column_step)
69 {
72 for (int x = column_begin; x < column_end;) {
75 for (int k = 0; k < column_step; k++) {
76 ptr[k] *= boundaryscale;
77 }
78 /* Filter downwards */
80 for (int k = 0; k < column_step; k++) {
81 ptr[
i + k] += nu * ptr[
i -
width + k];
82 }
83 }
85
86 for (int k = 0; k < column_step; k++)
87 ptr[
i + k] *= boundaryscale;
88
89 /* Filter upwards */
91 for (int k = 0; k < column_step; k++)
92 ptr[
i -
width + k] += nu * ptr[
i + k];
93 }
94 }
95 x += column_step;
96 }
97 }
98
100 int slice_start,
int slice_end,
int steps,
101 float nu, float boundaryscale)
102 {
103 int aligned_end = slice_start + (((
slice_end - slice_start) >> 3) << 3);
104 /* Filter vertically along columns (process 8 columns in each step) */
106 steps, nu, boundaryscale, 8);
107 /* Filter un-aligned columns one by one */
109 steps, nu, boundaryscale, 1);
110 }
111
113 {
118 #if ARCH_X86
120 #endif
121 }
122
123 #endif /* AVFILTER_GBLUR_INIT_H */