//-----------------------------------------------------------------
// AOS -> SOA
//
// pBgr: b0,g0,r0, b1,g1,r1, b2,g2,r2, b3,g3,r3, b4,g4,r4, ...
// ->
// pBlu: b0, b1, b2, b3, b4, ...
// pGrn: g0, g1, g2, g3, g4, ...
// pRed: r0, r1, r2, r3, r4, ...
void
aos2soa(float *pBgr, float *pBlu, float *pGrn, float *pRed, const size_t length)
{
__m128 *bgr = (__m128 *)pBgr;
float *b = pBlu;
float *g = pGrn;
float *r = pRed;
for (size_t i = 0; i < length; i += 24, b += 8, g += 8, r += 8)
{
__m256 m03 = _mm256_castps128_ps256(*bgr++); // 下半分のロード
__m256 m14 = _mm256_castps128_ps256(*bgr++);
__m256 m25 = _mm256_castps128_ps256(*bgr++);
m03 = _mm256_insertf128_ps(m03, *bgr++, 1); // 上半分のロード
m14 = _mm256_insertf128_ps(m14, *bgr++, 1);
m25 = _mm256_insertf128_ps(m25, *bgr++, 1);
__m256 bg = _mm256_shuffle_ps(m14, m25, _MM_SHUFFLE(2, 1, 3, 2)); // b と g の上部分
__m256 gr = _mm256_shuffle_ps(m03, m14, _MM_SHUFFLE(1, 0, 2, 1)); // g と r の下部分
__m256 bb = _mm256_shuffle_ps(m03, bg, _MM_SHUFFLE(2, 0, 3, 0));
__m256 gg = _mm256_shuffle_ps(gr, bg, _MM_SHUFFLE(3, 1, 2, 0));
__m256 rr = _mm256_shuffle_ps(gr, m25, _MM_SHUFFLE(3, 0, 3, 1));
_mm256_store_ps(b, bb);
_mm256_store_ps(g, gg);
_mm256_store_ps(r, rr);
}
}
void DoubleToComplex(double *srcI, double *srcQ, Complex *dst, const unsigned int len)
{
__m256d avxR_D, avxI_D, avxX_D, avxY_D, avxA_D, avxB_D;
__m128 avxA, avxB;
#if 1
__m256 avxD;
#endif
for (unsigned int i=0; i+4<=len; i+=4) {
avxR_D = _mm256_loadu_pd(srcI + i);
avxI_D = _mm256_loadu_pd(srcQ + i);
avxX_D = _mm256_unpacklo_pd(avxR_D, avxI_D); //swizzle
avxY_D = _mm256_unpackhi_pd(avxR_D, avxI_D);
avxA_D = _mm256_permute2f128_pd(avxX_D, avxY_D, 0x20);
avxB_D = _mm256_permute2f128_pd(avxX_D, avxY_D, 0x31);
avxA = _mm256_cvtpd_ps(avxA_D); //double to float
avxB = _mm256_cvtpd_ps(avxB_D);
#if 0
avxD = _mm256_castps128_ps256(avxA);
avxD = _mm256_insertf128_ps(avxD, avxB, 1);
_mm256_storeu_ps((float*)(dst+i), avxD);
#else
_mm_maskstore_ps((float*)(dst+i), _mm_set_epi32(SET_1, SET_1, SET_1, SET_1), avxA);
_mm_maskstore_ps((float*)(dst+i+2), _mm_set_epi32(SET_1, SET_1, SET_1, SET_1), avxB);
#endif
}
for (unsigned int i=len-(len & 0x03); i<len; ++i) {
dst[i].m_real = static_cast<float>(srcI[i]);
dst[i].m_imag = static_cast<float>(srcQ[i]);
}
}
__m256 exp_256(
const __m256& x) {
//! Clip the value
__m256 y = _mm256_max_ps(_mm256_min_ps(x, _mm256_set1_ps(88.3762626647949f)),
_mm256_set1_ps(-88.3762626647949f));
//! Express exp(x) as exp(g + n * log(2))
__m256 fx = y * _mm256_set1_ps(1.44269504088896341) + _mm256_set1_ps(0.5f);
//! Floor
const __m256 tmp = _mm256_round_ps(fx, _MM_FROUND_TO_ZERO);
//! If greater, substract 1
const __m256 mask = _mm256_and_ps(_mm256_cmp_ps(tmp, fx, _CMP_GT_OS),
_mm256_set1_ps(1.f));
fx = tmp - mask;
y -= fx * _mm256_set1_ps(0.693359375 - 2.12194440e-4);
const __m256 z = y * y;
const __m256 t = (((((_mm256_set1_ps(1.9875691500E-4) * y +
_mm256_set1_ps(1.3981999507E-3)) * y +
_mm256_set1_ps(8.3334519073E-3)) * y +
_mm256_set1_ps(4.1665795894E-2)) * y +
_mm256_set1_ps(1.6666665459E-1)) * y +
_mm256_set1_ps(5.0000001201E-1)) * z + y +
_mm256_set1_ps(1.f);
//! Build 2^n (split it into two SSE array, since AVX2 equivalent functions
//! aren't available.
const __m128i emm0 = _mm_add_epi32(_mm_cvttps_epi32(_mm256_castps256_ps128(fx)), _mm_set1_epi32(0x7f));
const __m128i emm1 = _mm_add_epi32(_mm_cvttps_epi32(_mm256_extractf128_ps(fx, 1)), _mm_set1_epi32(0x7f));
fx = _mm256_castps128_ps256(_mm_castsi128_ps(_mm_slli_epi32(emm0, 23)));
fx = _mm256_insertf128_ps(fx, _mm_castsi128_ps(_mm_slli_epi32(emm1, 23)), 1);
//! Return the result
return t * fx;
}
double bst_compute_129_m256_maskstore_root_aligned( void*_bst_obj, double* p, double* q, size_t nn ) {
segments_t* mem = (segments_t*) _bst_obj;
int n, i, r, l_end, j, l_end_pre;
double t, e_tmp;
double* e = mem->e, *w = mem->w;
int* root = mem->r;
__m256d v_tmp;
__m256d v00, v01, v02, v03;
__m256d v10, v11, v12, v13;
__m256d v20, v21, v22, v23;
__m256d v30, v31, v32, v33;
__m256i v_cur_roots;
__m256 v_rootmask0, v_rootmask1;
// initialization
// mem->n = nn;
n = nn; // subtractions with n potentially negative. say hello to all the bugs
int idx1, idx1_root;
int idx2;
int idx3, idx3_root;
int pad_root, pad, pad_r;
idx1 = ((int) mem->e_sz) - 1;
idx1_root = ((int) mem->r_sz);
// the conventio is that iteration i, idx1 points to the first element of line i+1
e[idx1++] = q[n];
// pad contains the padding for row i+1
// for row n it's always 3
pad = 3;
pad_root = 7;
for (i = n-1; i >= 0; --i) {
idx1 -= 2*(n-i)+1 + pad;
idx1_root -= 2*(n-i)+1 + pad_root;
idx2 = idx1 + 1;
e[idx1] = q[i];
w[idx1] = q[i];
for (j = i+1; j < n+1; ++j,++idx2) {
e[idx2] = INFINITY;
w[idx2] = w[idx2-1] + p[j-1] + q[j];
}
idx2 += pad; // padding of line i+1
// idx2 now points to the first element of the next line
idx3 = idx1;
idx3_root = idx1_root;
pad_r = pad;
for (r = i; r < n; ++r) {
pad_r = (pad_r+1)&3; // padding of line r+1
idx1 = idx3;
idx1_root = idx3_root;
l_end = idx2 + (n-r);
// l_end points to the first entry after the current row
e_tmp = e[idx1++];
idx1_root++;
// calculate until a multiple of 8 doubles is left
// 8 = 4 * 2 128-bit vectors
l_end_pre = idx2 + ((n-r)&15);
for( ; (idx2 < l_end_pre) && (idx2 < l_end); ++idx2 ) {
t = e_tmp + e[idx2] + w[idx1];
if (t < e[idx1]) {
e[idx1] = t;
root[idx1_root] = r;
}
idx1++;
idx1_root++;
}
v_tmp = _mm256_set_pd( e_tmp, e_tmp, e_tmp, e_tmp );
// execute the shit for 4 vectors of size 2
v_cur_roots = _mm256_set_epi32(r, r, r, r, r, r, r, r);
for( ; idx2 < l_end; idx2 += 16 ) {
v01 = _mm256_load_pd( &w[idx1 ] );
v11 = _mm256_load_pd( &w[idx1+ 4] );
v21 = _mm256_load_pd( &w[idx1+ 8] );
v31 = _mm256_load_pd( &w[idx1+12] );
v00 = _mm256_load_pd( &e[idx2 ] );
v01 = _mm256_add_pd( v01, v_tmp );
v10 = _mm256_load_pd( &e[idx2+ 4] );
v11 = _mm256_add_pd( v11, v_tmp );
v20 = _mm256_load_pd( &e[idx2+ 8] );
v21 = _mm256_add_pd( v21, v_tmp );
v30 = _mm256_load_pd( &e[idx2+12] );
v31 = _mm256_add_pd( v31, v_tmp );
v01 = _mm256_add_pd( v01, v00 );
v03 = _mm256_load_pd( &e[idx1 ] );
v11 = _mm256_add_pd( v11, v10 );
v13 = _mm256_load_pd( &e[idx1+ 4] );
v21 = _mm256_add_pd( v21, v20 );
v23 = _mm256_load_pd( &e[idx1+ 8] );
v31 = _mm256_add_pd( v31, v30 );
v33 = _mm256_load_pd( &e[idx1+12] );
v02 = _mm256_cmp_pd( v01, v03, _CMP_LT_OQ );
v12 = _mm256_cmp_pd( v11, v13, _CMP_LT_OQ );
v22 = _mm256_cmp_pd( v21, v23, _CMP_LT_OQ );
v32 = _mm256_cmp_pd( v31, v33, _CMP_LT_OQ );
_mm256_maskstore_pd( &e[idx1 ],
_mm256_castpd_si256( v02 ), v01 );
_mm256_maskstore_pd( &e[idx1+ 4],
_mm256_castpd_si256( v12 ), v11 );
v_rootmask0 = _mm256_insertf128_ps(
_mm256_castps128_ps256(
_mm256_cvtpd_ps(v02)),
_mm256_cvtpd_ps(v12) , 1
);
_mm256_maskstore_pd( &e[idx1+ 8],
_mm256_castpd_si256( v22 ), v21 );
_mm256_maskstore_pd( &e[idx1+12],
_mm256_castpd_si256( v32 ), v31 );
v_rootmask1 = _mm256_insertf128_ps(
_mm256_castps128_ps256(
_mm256_cvtpd_ps(v22)),
_mm256_cvtpd_ps(v32) , 1
);
_mm256_maskstore_ps( &root[idx1_root ],
_mm256_castps_si256( v_rootmask0 ),
_mm256_castsi256_ps( v_cur_roots ) );
_mm256_maskstore_ps( &root[idx1_root + 8],
_mm256_castps_si256( v_rootmask1 ),
_mm256_castsi256_ps( v_cur_roots ) );
idx1 += 16;
idx1_root += 16;
}
idx2 += pad_r;
idx3++;
idx3_root++;
}
pad = (pad -1)&3;
pad_root = (pad_root-1)&7;
}
// the index of the last item of the first row is ((n/4)+1)*4-1, due to the padding
// if n is even, the total number of entries in the first
// row of the table is odd, so we need padding
return e[ ((n/4)+1)*4 - 1 ];
}
