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

ircd::stringops: Simplify indexof().

Browse source
This commit is contained in:
Jason Volk 2020-08-02 00:36:56 -07:00
parent a4e21ae111
commit 5f28136e2d
1 changed files with 9 additions and 65 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

74
ircd/stringops.cc
View file

@ -8,79 +8,23 @@
// copyright notice and this permission notice is present in all copies. The // copyright notice and this permission notice is present in all copies. The
// full license for this software is available in the LICENSE file. // full license for this software is available in the LICENSE file.
namespace ircd
{
template<class i8xN,
size_t N>
static size_t indexof(const string_view &, const string_view *const &) noexcept;
}
size_t size_t
ircd::indexof(const string_view &s, ircd::indexof(const string_view &in,
const string_views &tab) const string_views &tab)
noexcept noexcept
{ {
#if defined(__AVX__) const auto it
static const size_t N {32};
using i8xN = i8x32;
#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
string_view a[N];
size_t i, j, ret;
for(i = 0; i < tab.size() / N; ++i)
{ {
for(j = 0; j < N; ++j) std::find(tab.begin(), tab.end(), in)
a[j] = tab[i * N + j]; };
if((ret = indexof<i8xN, N>(s, a)) != N) const auto ret
return i * N + ret;
}
for(j = 0; j < tab.size() % N; ++j)
a[j] = tab[i * N + j];
for(; j < N; ++j)
a[j] = string_view{};
ret = i * N + indexof<i8xN, N>(s, a);
return std::min(ret, tab.size());
}
template<class i8xN,
size_t N>
size_t
ircd::indexof(const string_view &s,
const string_view *const &st)
noexcept
{
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) std::distance(begin(tab), it)
for(k = 0; k < N; ++k) };
{
res[k] &= size(st[k]) > i;
ct[k] = res[k]? st[k][i]: 0;
}
res &= ct == s[i]; assert(size_t(ret) <= tab.size());
while(j < N && !res[j]) return ret;
++j;
}
for(i = 0; i < N && !res[i]; ++i);
return i;
} }
ircd::string_view ircd::string_view