/* * vim:ts=4:sw=4:expandtab * * © 2016 Sebastian Frysztak * * See LICENSE for licensing information * */ #include "blur.h" #include #include // number of xmm registers needed to store input pixels for given kernel size #define REGISTERS_CNT (KERNEL_SIZE + 4/2) / 4 void blur_impl_horizontal_pass_sse2(uint32_t *src, uint32_t *dst, int width, int height) { printf("height %d by width %d\n", height, width); for (int row = 0; row < height; row++) { printf("row %d\n", row); for (int column = 0; column < width; column++, src++) { printf("\tcol %d\n", column); __m128i rgbaIn[REGISTERS_CNT]; // handle borders int leftBorder = column < HALF_KERNEL; int rightBorder = column > (width - HALF_KERNEL); // +1 to make memory checkers not complain uint32_t _rgbaIn[KERNEL_SIZE + 1] __attribute__((aligned(16))); int i = 0; if (leftBorder) { // for kernel size 8x8 and column == 0, we have: // x x x x P0 P1 P2 P3 // first loop mirrors P{0..4} to fill x's, // second one loads P{0..4} for (; i < HALF_KERNEL - column; i++) _rgbaIn[i] = *(src + (HALF_KERNEL - i)); for (; i < KERNEL_SIZE; i++) _rgbaIn[i] = *(src - (HALF_KERNEL - i)); for (int k = 0; k < REGISTERS_CNT; k++) rgbaIn[k] = _mm_load_si128((__m128i*)(_rgbaIn + 4*k)); } else if (rightBorder) { for (; i < width - column; i++) _rgbaIn[i] = *(src + i); for (int k = 0; i < KERNEL_SIZE; i++, k++) _rgbaIn[i] = *(src - k); for (int k = 0; k < REGISTERS_CNT; k++) rgbaIn[k] = _mm_load_si128((__m128i*)(_rgbaIn + 4*k)); } else { for (int k = 0; k < REGISTERS_CNT; k++) { printf("\t\tk: %d %p\n", k, src); rgbaIn[k] = _mm_load_si128((__m128i*)(src + 4*k - HALF_KERNEL)); } } __m128i zero = _mm_setzero_si128(); __m128i acc = _mm_setzero_si128(); acc = _mm_add_epi16(acc, _mm_unpacklo_epi8(rgbaIn[0], zero)); acc = _mm_add_epi16(acc, _mm_unpackhi_epi8(rgbaIn[0], zero)); acc = _mm_add_epi16(acc, _mm_unpacklo_epi8(rgbaIn[1], zero)); // kernel size equals to 7, but we can only load multiples of 4 pixels // we have to set 8th pixel to zero /* acc = _mm_add_epi16(acc, _mm_andnot_si128(_mm_set_epi32(0xFFFFFFFF, 0xFFFFFFFF, 0, 0), _mm_unpackhi_epi8(rgbaIn[1], zero))); acc = _mm_add_epi32(_mm_unpacklo_epi16(acc, zero), _mm_unpackhi_epi16(acc, zero)); */ // multiplication is significantly faster than division acc = _mm_cvtps_epi32(_mm_mul_ps(_mm_cvtepi32_ps(acc), _mm_set1_ps(1.0/KERNEL_SIZE))); *(dst + height * column + row) = _mm_cvtsi128_si32(_mm_packus_epi16(_mm_packs_epi32(acc, zero), zero)); } } }