yuv 0.8.13

High performance utilities for YUV format handling and conversion.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287

/*
 * Copyright (c) Radzivon Bartoshyk, 10/2024. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 *
 * 1.  Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * 2.  Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 *
 * 3.  Neither the name of the copyright holder nor the names of its
 * contributors may be used to endorse or promote products derived from
 * this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
use crate::internals::ProcessedOffset;
use crate::neon::ar30_utils::vzipq_4_ar30;
use crate::neon::utils::vldq_s16_endian;
use crate::neon::yuv_nv_p10_to_rgba::deinterleave_10_bit_uv;
use crate::yuv_support::{CbCrInverseTransform, YuvChromaRange, YuvChromaSubsampling};
use std::arch::aarch64::*;

pub(crate) unsafe fn neon_yuv_nv12_p10_to_ar30_row<
    const NV_ORDER: u8,
    const SAMPLING: u8,
    const ENDIANNESS: u8,
    const BYTES_POSITION: u8,
    const AR30_LAYOUT: usize,
    const AR30_STORE: usize,
    const BIT_DEPTH: usize,
>(
    y_plane: &[u16],
    uv_plane: &[u16],
    ar30: &mut [u8],
    width: u32,
    range: &YuvChromaRange,
    transform: &CbCrInverseTransform<i32>,
    start_cx: usize,
    start_ux: usize,
) -> ProcessedOffset {
    const CN: usize = 4;
    let chroma_subsampling: YuvChromaSubsampling = SAMPLING.into();

    let bias_y = range.bias_y as i32;
    let bias_uv = range.bias_uv as i32;

    let y_corr = vdupq_n_u16(bias_y as u16);
    let uv_corr_q = vdupq_n_s16(bias_uv as i16);

    const PRECISION: i32 = 14;

    // CbCoeff is almost always overflowing using 14 bits of precision, so we dividing it into 2 parts
    // to avoid overflow
    // y_value + cb_coef * cb_value instead will be used:
    // y_value + (cb_coef - i16::MAX) * cb_value + i16::MAX * cb_value

    let weights_arr: [i16; 8] = [
        transform.y_coef as i16,
        transform.cr_coef as i16,
        (transform.cb_coef - i16::MAX as i32) as i16,
        i16::MAX,
        -transform.g_coeff_1 as i16,
        -transform.g_coeff_2 as i16,
        0,
        0,
    ];

    let v_weights = vld1q_s16(weights_arr.as_ptr());

    let base_val = vdupq_n_s32(1 << (PRECISION - 1));

    let mut cx = start_cx;
    let mut ux = start_ux;

    while cx + 8 <= width as usize {
        let y_vl = vreinterpretq_u16_s16(vldq_s16_endian::<ENDIANNESS, BYTES_POSITION, BIT_DEPTH>(
            y_plane.get_unchecked(cx..).as_ptr(),
        ));

        let y_values: int16x8_t = vreinterpretq_s16_u16(vqsubq_u16(y_vl, y_corr));

        let (u_low, v_low, u_high, v_high) =
            deinterleave_10_bit_uv::<NV_ORDER, SAMPLING, ENDIANNESS, BYTES_POSITION, BIT_DEPTH>(
                uv_plane.get_unchecked(ux..),
                uv_corr_q,
            );

        let y_high = vmlal_high_laneq_s16::<0>(base_val, y_values, v_weights);
        let y_low = vmlal_laneq_s16::<0>(base_val, vget_low_s16(y_values), v_weights);

        let mut bh = vmlal_laneq_s16::<2>(y_high, u_high, v_weights);
        let rh = vmlal_laneq_s16::<1>(y_high, v_high, v_weights);
        let gh = vmlal_laneq_s16::<4>(y_high, v_high, v_weights);
        bh = vmlal_laneq_s16::<3>(bh, u_high, v_weights);
        let mut bl = vmlal_laneq_s16::<2>(y_low, u_low, v_weights);
        let rl = vmlal_laneq_s16::<1>(y_low, v_low, v_weights);
        let gl = vmlal_laneq_s16::<4>(y_low, v_low, v_weights);
        bl = vmlal_laneq_s16::<3>(bl, u_low, v_weights);
        let ghi = vmlal_laneq_s16::<5>(gh, u_high, v_weights);

        let r_high = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(rh)
        } else {
            vqshrun_n_s32::<16>(rh)
        };
        let b_high = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(bh)
        } else {
            vqshrun_n_s32::<16>(bh)
        };
        let g_high = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(ghi)
        } else {
            vqshrun_n_s32::<16>(ghi)
        };

        let glv = vmlal_laneq_s16::<5>(gl, u_low, v_weights);

        let r_low = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(rl)
        } else {
            vqshrun_n_s32::<16>(rl)
        };
        let b_low = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(bl)
        } else {
            vqshrun_n_s32::<16>(bl)
        };
        let g_low = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(glv)
        } else {
            vqshrun_n_s32::<16>(glv)
        };

        let v_max = vdupq_n_u16((1 << BIT_DEPTH) - 1);

        let rw = vminq_u16(vcombine_u16(r_low, r_high), v_max);
        let gw = vminq_u16(vcombine_u16(g_low, g_high), v_max);
        let bw = vminq_u16(vcombine_u16(b_low, b_high), v_max);

        let zipped_ar30 = vzipq_4_ar30::<AR30_LAYOUT, AR30_STORE>(uint16x8x3_t(rw, gw, bw));

        vst1q_u32(
            ar30.get_unchecked_mut(cx * CN..).as_mut_ptr() as *mut _,
            zipped_ar30.0,
        );
        vst1q_u32(
            ar30.get_unchecked_mut((cx + 4) * CN..).as_mut_ptr() as *mut _,
            zipped_ar30.1,
        );

        cx += 8;

        match chroma_subsampling {
            YuvChromaSubsampling::Yuv420 | YuvChromaSubsampling::Yuv422 => {
                ux += 8;
            }
            YuvChromaSubsampling::Yuv444 => {
                ux += 16;
            }
        }
    }

    if cx < width as usize {
        let diff = width as usize - cx;

        assert!(diff <= 8);

        let mut dst_buffer: [u8; 8 * 4] = [0; 8 * 4];
        let mut y_buffer: [u16; 8] = [0; 8];
        let mut uv_buffer: [u16; 8 * 2] = [0; 8 * 2];

        std::ptr::copy_nonoverlapping(
            y_plane.get_unchecked(cx..).as_ptr(),
            y_buffer.as_mut_ptr().cast(),
            diff,
        );

        let ux_size = match chroma_subsampling {
            YuvChromaSubsampling::Yuv420 | YuvChromaSubsampling::Yuv422 => diff.div_ceil(2) * 2,
            YuvChromaSubsampling::Yuv444 => diff * 2,
        };

        std::ptr::copy_nonoverlapping(
            uv_plane.get_unchecked(ux..).as_ptr(),
            uv_buffer.as_mut_ptr().cast(),
            ux_size,
        );

        let y_vl = vreinterpretq_u16_s16(vldq_s16_endian::<ENDIANNESS, BYTES_POSITION, BIT_DEPTH>(
            y_buffer.as_ptr().cast(),
        ));

        let (u_low, v_low, u_high, v_high) =
            deinterleave_10_bit_uv::<NV_ORDER, SAMPLING, ENDIANNESS, BYTES_POSITION, BIT_DEPTH>(
                uv_buffer.as_slice(),
                uv_corr_q,
            );

        let y_values: int16x8_t = vreinterpretq_s16_u16(vqsubq_u16(y_vl, y_corr));

        let y_high = vmlal_high_laneq_s16::<0>(base_val, y_values, v_weights);
        let y_low = vmlal_laneq_s16::<0>(base_val, vget_low_s16(y_values), v_weights);

        let mut bh = vmlal_laneq_s16::<2>(y_high, u_high, v_weights);
        let rh = vmlal_laneq_s16::<1>(y_high, v_high, v_weights);
        let gh = vmlal_laneq_s16::<4>(y_high, v_high, v_weights);
        bh = vmlal_laneq_s16::<3>(bh, u_high, v_weights);
        let mut bl = vmlal_laneq_s16::<2>(y_low, u_low, v_weights);
        let rl = vmlal_laneq_s16::<1>(y_low, v_low, v_weights);
        let gl = vmlal_laneq_s16::<4>(y_low, v_low, v_weights);
        bl = vmlal_laneq_s16::<3>(bl, u_low, v_weights);
        let ghi = vmlal_laneq_s16::<5>(gh, u_high, v_weights);

        let r_high = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(rh)
        } else {
            vqshrun_n_s32::<16>(rh)
        };
        let b_high = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(bh)
        } else {
            vqshrun_n_s32::<16>(bh)
        };
        let g_high = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(ghi)
        } else {
            vqshrun_n_s32::<16>(ghi)
        };

        let glv = vmlal_laneq_s16::<5>(gl, u_low, v_weights);

        let r_low = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(rl)
        } else {
            vqshrun_n_s32::<16>(rl)
        };
        let b_low = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(bl)
        } else {
            vqshrun_n_s32::<16>(bl)
        };
        let g_low = if BIT_DEPTH == 10 {
            vqshrun_n_s32::<PRECISION>(glv)
        } else {
            vqshrun_n_s32::<16>(glv)
        };

        let v_max = vdupq_n_u16((1 << BIT_DEPTH) - 1);

        let rw = vminq_u16(vcombine_u16(r_low, r_high), v_max);
        let gw = vminq_u16(vcombine_u16(g_low, g_high), v_max);
        let bw = vminq_u16(vcombine_u16(b_low, b_high), v_max);

        let zipped_ar30 = vzipq_4_ar30::<AR30_LAYOUT, AR30_STORE>(uint16x8x3_t(rw, gw, bw));

        vst1q_u32(dst_buffer.as_mut_ptr() as *mut _, zipped_ar30.0);
        vst1q_u32(
            dst_buffer.get_unchecked_mut(CN * 4..).as_mut_ptr() as *mut _,
            zipped_ar30.1,
        );

        std::ptr::copy_nonoverlapping(
            dst_buffer.as_mut_ptr().cast(),
            ar30.get_unchecked_mut(cx * CN..).as_mut_ptr(),
            diff * CN,
        );

        cx += diff;
        ux += ux_size;
    }

    ProcessedOffset { cx, ux }
}