将两个向量<bool>与SSE进行比较

use*_*187 6 c++ x86 sse simd

我有两个 vector<bool> A和B.

我想比较它们并计算相等的元素数量:

例如:

A = {0,1,0,1}
B = {0,0,1,1}
Run Code Online (Sandbox Code Playgroud)

结果将等于2.

我可以使用,_mm_cmpeq_epi8但它只比较16个元素(即我应该将0和1转换为char然后进行比较).是否可以每次使用SSE(或SIMD指令)比较128个元素?

Pau*_*l R 2

如果您可以假设vector<bool>使用连续的字节大小的元素进行存储,或者您可以考虑使用类似的东西vector<uint8_t>来代替,那么这个示例应该为您提供一个很好的起点:

static size_t count_equal(const vector<uint8_t> &vec1, const vector<uint8_t> &vec2)
{
    assert(vec1.size() == vec2.size());         // vectors must be same size

    const size_t n = vec1.size();
    const size_t max_block_size = 255 * 16;     // max block size before possible overflow

    __m128i vcount = _mm_setzero_si128();
    size_t i, count = 0;

    for (i = 0; i + 16 <= n; )                  // for each block
    {
        size_t m = std::min(n, i + max_block_size);

        for ( ; i + 16 <= m; i += 16)           // for each vector in block
        {
            __m128i v1 = _mm_loadu_si128((__m128i *)&vec1[i]);
            __m128i v2 = _mm_loadu_si128((__m128i *)&vec2[i]);
            __m128i vcmp = _mm_cmpeq_epi8(v1, v2);
            vcount = _mm_sub_epi8(vcount, vcmp);
        }
        vcount = _mm_sad_epu8(vcount, _mm_setzero_si128());
        count += _mm_extract_epi16(vcount, 0) + _mm_extract_epi16(vcount, 4);
        vcount = _mm_setzero_si128();           // update count from current block
    }
    vcount = _mm_sad_epu8(vcount, _mm_setzero_si128());
    count += _mm_extract_epi16(vcount, 0) + _mm_extract_epi16(vcount, 4);
    for ( ; i < n; ++i)                         // deal with any remaining partial vector
    {
        count += (vec1[i] == vec2[i]);
    }
    return count;
}
Run Code Online (Sandbox Code Playgroud)

请注意,这是使用vector<uint8_t>. 如果您确实必须使用vector<bool>并且可以保证元素始终是连续的且字节大小,那么您只需要以某种方式强制将其转换vector<bool>为 aconst uint8_t *或类似的元素即可。

测试线束:

#include <cassert>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <vector>

#include <emmintrin.h>    // SSE2

using std::vector;

static size_t count_equal_ref(const vector<uint8_t> &vec1, const vector<uint8_t> &vec2)
{
    assert(vec1.size() == vec2.size());

    const size_t n = vec1.size();
    size_t i, count = 0;

    for (i = 0 ; i < n; ++i)
    {
        count += (vec1[i] == vec2[i]);
    }
    return count;
}

static size_t count_equal(const vector<uint8_t> &vec1, const vector<uint8_t> &vec2)
{
    assert(vec1.size() == vec2.size());         // vectors must be same size

    const size_t n = vec1.size();
    const size_t max_block_size = 255 * 16;     // max block size before possible overflow

    __m128i vcount = _mm_setzero_si128();
    size_t i, count = 0;

    for (i = 0; i + 16 <= n; )                  // for each block
    {
        size_t m = std::min(n, i + max_block_size);

        for ( ; i + 16 <= m; i += 16)           // for each vector in block
        {
            __m128i v1 = _mm_loadu_si128((__m128i *)&vec1[i]);
            __m128i v2 = _mm_loadu_si128((__m128i *)&vec2[i]);
            __m128i vcmp = _mm_cmpeq_epi8(v1, v2);
            vcount = _mm_sub_epi8(vcount, vcmp);
        }
        vcount = _mm_sad_epu8(vcount, _mm_setzero_si128());
        count += _mm_extract_epi16(vcount, 0) + _mm_extract_epi16(vcount, 4);
        vcount = _mm_setzero_si128();           // update count from current block
    }
    vcount = _mm_sad_epu8(vcount, _mm_setzero_si128());
    count += _mm_extract_epi16(vcount, 0) + _mm_extract_epi16(vcount, 4);
    for ( ; i < n; ++i)                         // deal with any remaining partial vector
    {
        count += (vec1[i] == vec2[i]);
    }
    return count;
}

int main(int argc, char * argv[])
{
    size_t n = 100;

    if (argc > 1)
    {
        n = atoi(argv[1]);
    }

    vector<uint8_t> vec1(n);
    vector<uint8_t> vec2(n);

    srand((unsigned int)time(NULL));

    for (size_t i = 0; i < n; ++i)
    {
        vec1[i] = rand() & 1;
        vec2[i] = rand() & 1;
    }

    size_t n_ref = count_equal_ref(vec1, vec2);
    size_t n_test = count_equal(vec1, vec2);

    if (n_ref == n_test)
    {
        std::cout << "PASS" << std::endl;
    }
    else
    {
        std::cout << "FAIL: n_ref = " << n_ref << ", n_test = " << n_test << std::endl;
    }

    return 0;
}
Run Code Online (Sandbox Code Playgroud)

编译并运行:

$ g++ -Wall -msse3 -O3 test.cpp && ./a.out
PASS
Run Code Online (Sandbox Code Playgroud)

  • 我们使用 8 位向量元素来计算匹配项,因此当向量中的元素超过 255*16 时可能会溢出。在问题中,您指定了 128 的向量大小,因此我没有费心处理大向量大小,但是我现在已经更新了上面的解决方案以支持任何长度的向量。 (2认同)
  • 每 255 使用一个向量累加器比两个“_mm_extract”更有效。`_mm_sad_epu8` 将高位清零,因此您可以使用 `_mm_add_epi32` 进行累加(如果您不关心它在 Intel Nehalem/Atom/Silvermont 之前的版本上速度较慢,则可以使用 `_mm_add_epi64` 进行累加)。那么最后只需要提取一次即可。 (2认同)