/* * Copyright (c) 2018, Alliance for Open Media. All rights reserved. * * This source code is subject to the terms of the BSD 2 Clause License and * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License * was not distributed with this source code in the LICENSE file, you can * obtain it at www.aomedia.org/license/software. 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 www.aomedia.org/license/patent.
*/
// Accumulate sum of 32-bit elements in the vector staticinline int32_t mm256_accumulate_epi32(__m256i vec_a) {
__m128i vtmp1 = _mm256_extracti128_si256(vec_a, 1);
__m128i vtmp2 = _mm256_castsi256_si128(vec_a);
vtmp1 = _mm_add_epi32(vtmp1, vtmp2);
vtmp2 = _mm_srli_si128(vtmp1, 8);
vtmp1 = _mm_add_epi32(vtmp1, vtmp2);
vtmp2 = _mm_srli_si128(vtmp1, 4);
vtmp1 = _mm_add_epi32(vtmp1, vtmp2); return _mm_cvtsi128_si32(vtmp1);
}
uint64_t aom_var_2d_u8_avx2(uint8_t *src, int src_stride, int width, int height) {
uint8_t *srcp;
uint64_t s = 0, ss = 0;
__m256i vzero = _mm256_setzero_si256();
__m256i v_acc_sum = vzero;
__m256i v_acc_sqs = vzero; int i, j;
// Process 32 elements in a row for (i = 0; i < width - 31; i += 32) {
srcp = src + i; // Process 8 columns at a time for (j = 0; j < height - 7; j += 8) {
__m256i vsrc[8]; for (int k = 0; k < 8; k++) {
vsrc[k] = _mm256_loadu_si256((__m256i *)srcp);
srcp += src_stride;
} for (int k = 0; k < 8; k++) {
__m256i vsrc0 = _mm256_unpacklo_epi8(vsrc[k], vzero);
__m256i vsrc1 = _mm256_unpackhi_epi8(vsrc[k], vzero);
v_acc_sum = _mm256_add_epi16(v_acc_sum, vsrc0);
v_acc_sum = _mm256_add_epi16(v_acc_sum, vsrc1);
// Update total sum and clear the vectors
s += mm256_accumulate_epi16(v_acc_sum);
ss += mm256_accumulate_epi32(v_acc_sqs);
v_acc_sum = vzero;
v_acc_sqs = vzero;
}
// Process remaining rows (height not a multiple of 8) for (; j < height; j++) {
__m256i vsrc = _mm256_loadu_si256((__m256i *)srcp);
__m256i vsrc0 = _mm256_unpacklo_epi8(vsrc, vzero);
__m256i vsrc1 = _mm256_unpackhi_epi8(vsrc, vzero);
v_acc_sum = _mm256_add_epi16(v_acc_sum, vsrc0);
v_acc_sum = _mm256_add_epi16(v_acc_sum, vsrc1);
// Update total sum and clear the vectors
s += mm256_accumulate_epi16(v_acc_sum);
ss += mm256_accumulate_epi32(v_acc_sqs);
v_acc_sum = vzero;
v_acc_sqs = vzero;
}
// Process the remaining area using C
srcp = src; for (int k = 0; k < height; k++) { for (int m = i; m < width; m++) {
uint8_t val = srcp[m];
s += val;
ss += val * val;
}
srcp += src_stride;
} return (ss - s * s / (width * height));
}
#if CONFIG_AV1_HIGHBITDEPTH
uint64_t aom_var_2d_u16_avx2(uint8_t *src, int src_stride, int width, int height) {
uint16_t *srcp1 = CONVERT_TO_SHORTPTR(src), *srcp;
uint64_t s = 0, ss = 0;
__m256i vzero = _mm256_setzero_si256();
__m256i v_acc_sum = vzero;
__m256i v_acc_sqs = vzero; int i, j;
// Process 16 elements in a row for (i = 0; i < width - 15; i += 16) {
srcp = srcp1 + i; // Process 8 columns at a time for (j = 0; j < height - 8; j += 8) {
__m256i vsrc[8]; for (int k = 0; k < 8; k++) {
vsrc[k] = _mm256_loadu_si256((__m256i *)srcp);
srcp += src_stride;
} for (int k = 0; k < 8; k++) {
__m256i vsrc0 = _mm256_unpacklo_epi16(vsrc[k], vzero);
__m256i vsrc1 = _mm256_unpackhi_epi16(vsrc[k], vzero);
v_acc_sum = _mm256_add_epi32(vsrc0, v_acc_sum);
v_acc_sum = _mm256_add_epi32(vsrc1, v_acc_sum);
// Update total sum and clear the vectors
s += mm256_accumulate_epi32(v_acc_sum);
ss += mm256_accumulate_epi32(v_acc_sqs);
v_acc_sum = vzero;
v_acc_sqs = vzero;
}
// Process remaining rows (height not a multiple of 8) for (; j < height; j++) {
__m256i vsrc = _mm256_loadu_si256((__m256i *)srcp);
__m256i vsrc0 = _mm256_unpacklo_epi16(vsrc, vzero);
__m256i vsrc1 = _mm256_unpackhi_epi16(vsrc, vzero);
v_acc_sum = _mm256_add_epi32(vsrc0, v_acc_sum);
v_acc_sum = _mm256_add_epi32(vsrc1, v_acc_sum);
// Update total sum and clear the vectors
s += mm256_accumulate_epi32(v_acc_sum);
ss += mm256_accumulate_epi32(v_acc_sqs);
v_acc_sum = vzero;
v_acc_sqs = vzero;
}
// Process the remaining area using C
srcp = srcp1; for (int k = 0; k < height; k++) { for (int m = i; m < width; m++) {
uint16_t val = srcp[m];
s += val;
ss += val * val;
}
srcp += src_stride;
} return (ss - s * s / (width * height));
} #endif// CONFIG_AV1_HIGHBITDEPTH
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.