MirrorHub/construct
0
0
Fork 0
mirror of https://github.com/matrix-construct/construct synced 2024-11-26 00:32:35 +01:00
Code Issues Releases Wiki Activity

ircd: Add vectorized multi-string match tool.

Browse source
This commit is contained in:
Jason Volk 2020-03-14 17:20:12 -07:00
parent 0eb66b52d4
commit 344510086b
2 changed files with 66 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
include/ircd/stringops.h
View file

@ -22,8 +22,8 @@ namespace ircd
inline size_t ifind(const string_view &s, const string_view &t); inline size_t ifind(const string_view &s, const string_view &t);
// Multi-string table suite; returns index past the end on no-match // Multi-string table suite; returns index past the end on no-match
using string_table = vector_view<const string_view>; using string_views = vector_view<const string_view>;
size_t indexof(const string_view &, const string_table &); size_t indexof(const string_view &, const string_views &);
// return view without any trailing characters contained in c // return view without any trailing characters contained in c
string_view rstripa(const string_view &str, const string_view &c); string_view rstripa(const string_view &str, const string_view &c);

69
ircd/stringops.cc
View file

@ -10,15 +10,74 @@
#include <ircd/simd.h> #include <ircd/simd.h>
namespace ircd
{
template<class i8xN,
size_t N>
static size_t indexof(const string_view &, const std::array<string_view, N> &);
}
size_t size_t
ircd::indexof(const string_view &s, ircd::indexof(const string_view &s,
const string_table &tab) const string_views &tab)
{ {
size_t i(0); #if defined(__AVX__)
for(; i < tab.size(); ++i) static const size_t N {32};
if(s == tab[i]) using i8xN = i8x32;
break; #elif defined(__SSE__)
static const size_t N {16};
using i8xN = i8x16;
#else
static const size_t N {1};
using i8xN = char __attribute__((vector_size(1)));
#endif
size_t i, j, ret;
std::array<string_view, N> a;
for(i = 0; i < tab.size() / N; ++i)
{
for(j = 0; j < N; ++j)
a[j] = tab[i * N + j];
if((ret = indexof<i8xN, N>(s, a)) != N)
return i * N + ret;
}
#pragma clang loop unroll (disable)
for(j = 0; j < N; ++j)
a[j] = i * N + j < tab.size()?
tab[i * N + j]:
string_view{};
return i * N + indexof<i8xN, N>(s, a);
}
template<class i8xN,
size_t N>
size_t
ircd::indexof(const string_view &s,
const std::array<string_view, N> &st)
{
i8xN ct, res;
size_t i, j, k;
for(i = 0; i < N; ++i)
res[i] = true;
const size_t max(s.size());
for(i = 0, j = 0; i < max; i = (j < N)? i + 1 : max)
{
#pragma clang loop unroll (disable)
for(k = 0; k < N; ++k)
{
res[k] &= size(st[k]) > i;
ct[k] = res[k]? st[k][i]: 0;
}
res &= ct == s[i];
for(; j < N && !res[j]; ++j);
}
for(i = 0; i < N && !res[i]; ++i);
return i; return i;
} }