|  | /* | 
|  | * Copyright (c) 2021, Alliance for Open Media. All rights reserved | 
|  | * | 
|  | * This source code is subject to the terms of the BSD 3-Clause Clear License | 
|  | * and the Alliance for Open Media Patent License 1.0. If the BSD 3-Clause Clear | 
|  | * License was not distributed with this source code in the LICENSE file, you | 
|  | * can obtain it at aomedia.org/license/software-license/bsd-3-c-c/.  If the | 
|  | * Alliance for Open Media Patent License 1.0 was not distributed with this | 
|  | * source code in the PATENTS file, you can obtain it at | 
|  | * aomedia.org/license/patent-license/. | 
|  | */ | 
|  | #ifndef AOM_AV1_ENCODER_PICKRST_H_ | 
|  | #define AOM_AV1_ENCODER_PICKRST_H_ | 
|  |  | 
|  | #ifdef __cplusplus | 
|  | extern "C" { | 
|  | #endif | 
|  |  | 
|  | #include "av1/encoder/encoder.h" | 
|  | #include "aom_ports/system_state.h" | 
|  |  | 
|  | struct yv12_buffer_config; | 
|  | struct AV1_COMP; | 
|  |  | 
|  | static const uint8_t g_shuffle_stats_data[16] = { | 
|  | 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, | 
|  | }; | 
|  |  | 
|  | static const uint8_t g_shuffle_stats_highbd_data[32] = { | 
|  | 0, 1, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 6, 7, 8, 9, | 
|  | 0, 1, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 6, 7, 8, 9, | 
|  | }; | 
|  |  | 
|  | static INLINE uint8_t find_average(const uint8_t *src, int h_start, int h_end, | 
|  | int v_start, int v_end, int stride) { | 
|  | uint64_t sum = 0; | 
|  | for (int i = v_start; i < v_end; i++) { | 
|  | for (int j = h_start; j < h_end; j++) { | 
|  | sum += src[i * stride + j]; | 
|  | } | 
|  | } | 
|  | uint64_t avg = sum / ((v_end - v_start) * (h_end - h_start)); | 
|  | return (uint8_t)avg; | 
|  | } | 
|  |  | 
|  | static INLINE uint16_t find_average_highbd(const uint16_t *src, int h_start, | 
|  | int h_end, int v_start, int v_end, | 
|  | int stride) { | 
|  | uint64_t sum = 0; | 
|  | for (int i = v_start; i < v_end; i++) { | 
|  | for (int j = h_start; j < h_end; j++) { | 
|  | sum += src[i * stride + j]; | 
|  | } | 
|  | } | 
|  | uint64_t avg = sum / ((v_end - v_start) * (h_end - h_start)); | 
|  | return (uint16_t)avg; | 
|  | } | 
|  |  | 
|  | // Checks if the filters in info and ref are identical | 
|  | static INLINE int check_wiener_eq(const WienerInfo *info, | 
|  | const WienerInfo *ref) { | 
|  | return !memcmp(info->vfilter, ref->vfilter, | 
|  | WIENER_HALFWIN * sizeof(info->vfilter[0])) && | 
|  | !memcmp(info->hfilter, ref->hfilter, | 
|  | WIENER_HALFWIN * sizeof(info->hfilter[0])); | 
|  | } | 
|  | static INLINE int check_sgrproj_eq(const SgrprojInfo *info, | 
|  | const SgrprojInfo *ref) { | 
|  | if (info->ep == ref->ep && !memcmp(info->xqd, ref->xqd, sizeof(info->xqd))) | 
|  | return 1; | 
|  | return 0; | 
|  | } | 
|  |  | 
|  | // Checks if the filter in info matches any in the bank. If it does, the | 
|  | // index of the matching filter is returned, else -1 is returned. | 
|  | static INLINE int check_wiener_bank_eq(const WienerInfoBank *bank, | 
|  | const WienerInfo *info) { | 
|  | for (int k = 0; k < AOMMAX(1, bank->bank_size); ++k) { | 
|  | if (check_wiener_eq(info, av1_constref_from_wiener_bank(bank, k))) return k; | 
|  | } | 
|  | return -1; | 
|  | } | 
|  | static INLINE int check_sgrproj_bank_eq(const SgrprojInfoBank *bank, | 
|  | const SgrprojInfo *info) { | 
|  | for (int k = 0; k < AOMMAX(1, bank->bank_size); ++k) { | 
|  | if (check_sgrproj_eq(info, av1_constref_from_sgrproj_bank(bank, k))) | 
|  | return k; | 
|  | } | 
|  | return -1; | 
|  | } | 
|  |  | 
|  | static INLINE int check_wienerns_eq(const WienerNonsepInfo *info, | 
|  | const WienerNonsepInfo *ref, int num_coeffs, | 
|  | int wiener_class_id) { | 
|  | assert(info->num_classes == ref->num_classes); | 
|  | int c_id_begin = 0; | 
|  | int c_id_end = info->num_classes; | 
|  | if (wiener_class_id != ALL_WIENERNS_CLASSES) { | 
|  | c_id_begin = wiener_class_id; | 
|  | c_id_end = wiener_class_id + 1; | 
|  | } | 
|  | for (int c_id = c_id_begin; c_id < c_id_end; ++c_id) { | 
|  | const int16_t *info_nsfilter = const_nsfilter_taps(info, c_id); | 
|  | const int16_t *ref_nsfilter = const_nsfilter_taps(ref, c_id); | 
|  | if (memcmp(info_nsfilter, ref_nsfilter, | 
|  | num_coeffs * sizeof(*info_nsfilter))) | 
|  | return 0; | 
|  | } | 
|  | return 1; | 
|  | } | 
|  |  | 
|  | static INLINE int check_wienerns_bank_eq(const WienerNonsepInfoBank *bank, | 
|  | const WienerNonsepInfo *info, | 
|  | int num_coeffs, int wiener_class_id, | 
|  | int *refs) { | 
|  | int c_id_begin = 0; | 
|  | int c_id_end = info->num_classes; | 
|  | if (wiener_class_id != ALL_WIENERNS_CLASSES) { | 
|  | c_id_begin = wiener_class_id; | 
|  | c_id_end = wiener_class_id + 1; | 
|  | } | 
|  | int num_equal = 0; | 
|  | for (int c_id = c_id_begin; c_id < c_id_end; ++c_id) { | 
|  | refs[c_id] = -1; | 
|  | for (int k = 0; k < AOMMAX(1, bank->bank_size_for_class[c_id]); ++k) { | 
|  | if (check_wienerns_eq(info, | 
|  | av1_constref_from_wienerns_bank(bank, k, c_id), | 
|  | num_coeffs, c_id)) { | 
|  | refs[c_id] = k; | 
|  | num_equal++; | 
|  | break; | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | return num_equal == (c_id_end - c_id_begin) ? 0 : -1; | 
|  | } | 
|  |  | 
|  | #if CONFIG_COMBINE_PC_NS_WIENER_ADD | 
|  | int count_match_indices_bits(int plane, int num_classes, int num_ref_frames, | 
|  | const int *match_indices, int nopcw); | 
|  | #endif  // CONFIG_COMBINE_PC_NS_WIENER_ADD | 
|  |  | 
|  | static INLINE int wienerns_info_diff( | 
|  | const WienerNonsepInfo *info1, const WienerNonsepInfo *info2, | 
|  | const WienernsFilterParameters *nsfilter_params) { | 
|  | int diff = 0; | 
|  | const int beg_feat = 0; | 
|  | const int end_feat = nsfilter_params->ncoeffs; | 
|  | assert(info1->num_classes == info2->num_classes); | 
|  | for (int c_id = 0; c_id < info1->num_classes; ++c_id) { | 
|  | const int16_t *info1_nsfilter = const_nsfilter_taps(info1, c_id); | 
|  | const int16_t *info2_nsfilter = const_nsfilter_taps(info2, c_id); | 
|  |  | 
|  | for (int k = beg_feat; k < end_feat; ++k) | 
|  | diff += abs(info1_nsfilter[k] - info2_nsfilter[k]); | 
|  | } | 
|  | return diff; | 
|  | } | 
|  |  | 
|  | /*!\brief Algorithm for AV1 loop restoration search and estimation. | 
|  | * | 
|  | * \ingroup in_loop_restoration | 
|  | * This function determines proper restoration filter types and | 
|  | * associated parameters for each restoration unit in a frame. | 
|  | * | 
|  | * \param[in]       sd           Source frame buffer | 
|  | * \param[in,out]   cpi          Top-level encoder structure | 
|  | * | 
|  | * Nothing is returned. Instead, chosen restoration filter | 
|  | * types and parameters are stored per plane in the \c rst_info structure | 
|  | * of type \ref RestorationInfo inside \c cpi->common: | 
|  | * \arg \c rst_info[ \c 0 ]: Chosen parameters for Y plane | 
|  | * \arg \c rst_info[ \c 1 ]: Chosen parameters for U plane if it exists | 
|  | * \arg \c rst_info[ \c 2 ]: Chosen parameters for V plane if it exists | 
|  | * \par | 
|  | * The following fields in each \c rst_info[ \c p], \c p = 0, 1, 2 | 
|  | * are populated: | 
|  | * \arg \c rst_info[ \c p ].\c frame_restoration_type | 
|  | * \arg \c rst_info[ \c p ].\c unit_info[ \c u ], | 
|  | * for each \c u in 0, 1, ..., \c n( \c p ) - 1, | 
|  | * where \c n( \c p ) is the number of restoration units in plane \c p. | 
|  | * \par | 
|  | * The following fields in each \c rst_info[ \c p ].\c unit_info[ \c u ], | 
|  | * \c p = 0, 1, 2 and \c u = 0, 1, ..., \c n( \c p ) - 1, of type | 
|  | * \ref RestorationUnitInfo are populated: | 
|  | * \arg \c rst_info[ \c p ].\c unit_info[ \c u ].\c restoration_type | 
|  | * \arg \c rst_info[ \c p ].\c unit_info[ \c u ].\c wiener_info OR | 
|  | *      \c rst_info[ \c p ].\c unit_info[ \c u ].\c sgrproj_info OR | 
|  | *      neither, depending on | 
|  | *      \c rst_info[ \c p ].\c unit_info[ \c u ].\c restoration_type | 
|  | * | 
|  | */ | 
|  | void av1_pick_filter_restoration(const YV12_BUFFER_CONFIG *sd, AV1_COMP *cpi); | 
|  | #ifdef __cplusplus | 
|  | }  // extern "C" | 
|  | #endif | 
|  |  | 
|  | #endif  // AOM_AV1_ENCODER_PICKRST_H_ |