av1_convolve_horiz_rs_sse4.c |
|
9858 |
av1_convolve_scale_sse4.c |
|
21492 |
av1_inv_txfm_avx2.c |
|
89944 |
av1_inv_txfm_avx2.h |
|
2615 |
av1_inv_txfm_ssse3.c |
|
113947 |
av1_inv_txfm_ssse3.h |
|
8958 |
av1_txfm_sse2.h |
|
13142 |
av1_txfm_sse4.c |
|
891 |
av1_txfm_sse4.h |
|
2392 |
cdef_block_avx2.c |
partial A is a 16-bit vector of the form:
[x8 - - x1 | x16 - - x9] and partial B has the form:
[0 y1 - y7 | 0 y9 - y15].
This function computes (x1^2+y1^2)*C1 + (x2^2+y2^2)*C2 + ...
(x7^2+y2^7)*C7 + (x8^2+0^2)*C8 on each 128-bit lane. Here the C1..C8 constants
are in const1 and const2. |
15611 |
cdef_block_sse4.c |
|
1672 |
cdef_block_ssse3.c |
|
2094 |
cfl_avx2.c |
4x4 |
21371 |
cfl_simd.h |
|
14836 |
cfl_sse2.c |
|
3572 |
cfl_ssse3.c |
Adds 4 pixels (in a 2x2 grid) and multiplies them by 2. Resulting in a more
precise version of a box filter 4:2:0 pixel subsampling in Q3.
The CfL prediction buffer is always of size CFL_BUF_SQUARE. However, the
active area is specified using width and height.
Note: We don't need to worry about going over the active area, as long as we
stay inside the CfL prediction buffer.
|
16985 |
convolve_2d_avx2.c |
|
6254 |
convolve_2d_sse2.c |
Horizontal filter |
23806 |
convolve_avx2.c |
rounding code |
39341 |
convolve_sse2.c |
[4] |
19959 |
filterintra_sse4.c |
arbitrary pack arg |
15286 |
highbd_convolve_2d_avx2.c |
Horizontal filter |
8311 |
highbd_convolve_2d_sse4.c |
|
18236 |
highbd_convolve_2d_ssse3.c |
Horizontal filter |
17060 |
highbd_inv_txfm_avx2.c |
|
169528 |
highbd_inv_txfm_sse4.c |
SSE4.1 |
223749 |
highbd_jnt_convolve_avx2.c |
|
36206 |
highbd_jnt_convolve_sse4.c |
Vertical filter |
16617 |
highbd_txfm_utility_sse4.h |
SSE4.1 |
5596 |
highbd_warp_affine_avx2.c |
|
29102 |
highbd_warp_plane_sse4.c |
|
27682 |
highbd_wiener_convolve_avx2.c |
Horizontal filter |
11601 |
highbd_wiener_convolve_ssse3.c |
Horizontal filter |
8617 |
intra_edge_sse4.c |
|
11605 |
jnt_convolve_avx2.c |
|
53960 |
jnt_convolve_sse2.c |
|
15507 |
jnt_convolve_ssse3.c |
Horizontal filter |
9982 |
reconinter_avx2.c |
|
27620 |
reconinter_sse4.c |
SSE4.1 |
6232 |
reconinter_ssse3.c |
|
4758 |
resize_avx2.c |
g0... g15 | i0... i15 |
18470 |
resize_ssse3.c |
|
39069 |
selfguided_avx2.c |
|
28679 |
selfguided_sse4.c |
|
26474 |
warp_plane_avx2.c |
|
53825 |
warp_plane_sse4.c |
This is a modified version of 'av1_warped_filter' from warped_motion.c:
Each coefficient is stored in 8 bits instead of 16 bits
The coefficients are rearranged in the column order 0, 2, 4, 6, 1, 3, 5, 7
This is done in order to avoid overflow: Since the tap with the largest
coefficient could be any of taps 2, 3, 4 or 5, we can't use the summation
order ((0 + 1) + (4 + 5)) + ((2 + 3) + (6 + 7)) used in the regular
convolve functions.
Instead, we use the summation order
((0 + 2) + (4 + 6)) + ((1 + 3) + (5 + 7)).
The rearrangement of coefficients in this table is so that we can get the
coefficients into the correct order more quickly.
|
41998 |
wiener_convolve_avx2.c |
|
9955 |
wiener_convolve_sse2.c |
Horizontal filter |
8847 |