/* * Copyright (c) 2017 The WebM project authors. All Rights Reserved. * * Use of this source code is governed by a BSD-style license * that can be found in the LICENSE file in the root of the source * tree. An additional intellectual property rights grant can be found * in the file PATENTS. All contributing project authors may * be found in the AUTHORS file in the root of the source tree.
*/
void vpx_comp_avg_pred_sse2(uint8_t *comp_pred, const uint8_t *pred, int width, int height, const uint8_t *ref, int ref_stride) { /* comp_pred and pred must be 16 byte aligned. */
assert(((intptr_t)comp_pred & 0xf) == 0);
assert(((intptr_t)pred & 0xf) == 0); if (width > 8) { int x, y; for (y = 0; y < height; ++y) { for (x = 0; x < width; x += 16) { const __m128i p = _mm_load_si128((const __m128i *)(pred + x)); const __m128i r = _mm_loadu_si128((const __m128i *)(ref + x)); const __m128i avg = _mm_avg_epu8(p, r);
_mm_store_si128((__m128i *)(comp_pred + x), avg);
}
comp_pred += width;
pred += width;
ref += ref_stride;
}
} else { // width must be 4 or 8. int i; // Process 16 elements at a time. comp_pred and pred have width == stride // and therefore live in contigious memory. 4*4, 4*8, 8*4, 8*8, and 8*16 are // all divisible by 16 so just ref needs to be massaged when loading. for (i = 0; i < width * height; i += 16) { const __m128i p = _mm_load_si128((const __m128i *)pred);
__m128i r;
__m128i avg; if (width == ref_stride) {
r = _mm_loadu_si128((const __m128i *)ref);
ref += 16;
} elseif (width == 4) {
r = _mm_set_epi32(loadu_int32(ref + 3 * ref_stride),
loadu_int32(ref + 2 * ref_stride),
loadu_int32(ref + ref_stride), loadu_int32(ref));
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.