32 uchar8 min_val = min(a, b); \ 33 uchar8 max_val = max(a, b); \ 50 inline uchar8
sort5(uchar8 p0, uchar8 p1, uchar8 p2, uchar8 p3, uchar8 p4)
78 inline uchar8
sort9(uchar8 p0, uchar8 p1, uchar8 p2, uchar8 p3, uchar8 p4, uchar8 p5, uchar8 p6, uchar8 p7, uchar8 p8)
111 return min(val.s01234567, min(val.s12345678, val.s23456789));
122 return max(val.s01234567, max(val.s12345678, val.s23456789));
133 return min(val.s01234567, min(min(val.s12345678, val.s23456789), min(val.s3456789A, val.s456789AB)));
144 return max(val.s01234567, max(max(val.s12345678, val.s23456789), max(val.s3456789A, val.s456789AB)));
uchar8 row_reduce_min_5(uchar16 val)
Calculate the minimum of a sliding window of size 5.
#define SORT(a, b)
Sorts element-wise two vectors.
uchar8 row_reduce_max_5(uchar16 val)
Calculate the maximum of a sliding window of size 5.
uchar8 sort5(uchar8 p0, uchar8 p1, uchar8 p2, uchar8 p3, uchar8 p4)
Sorting network to sort 5 vectors of 8 elements and return their median.
uchar8 row_reduce_max_3(uchar16 val)
Calculate the maximum of a sliding window of size 3.
uchar8 sort9(uchar8 p0, uchar8 p1, uchar8 p2, uchar8 p3, uchar8 p4, uchar8 p5, uchar8 p6, uchar8 p7, uchar8 p8)
Sorting network to sort 9 vectors of 8 elements and return their median.
uchar8 row_reduce_min_3(uchar16 val)
Calculate the minimum of a sliding window of size 3.