allow double shufti to share buckets

This commit is contained in:
Alex Coyte
2016-04-04 11:02:59 +10:00
committed by Matthew Barr
parent 6c7ee12bb9
commit c0a5b037a1
3 changed files with 194 additions and 50 deletions

View File

@@ -32,6 +32,7 @@
#include "shufticompile.h"
#include "ue2common.h"
#include "util/charreach.h"
#include "util/container.h"
#include "util/ue2_containers.h"
#include <array>
@@ -107,13 +108,35 @@ int shuftiBuildMasks(const CharReach &c, m128 *lo, m128 *hi) {
return bit_index;
}
void shuftiBuildDoubleMasks(const CharReach &onechar,
static
array<u16, 4> or_array(array<u16, 4> a, const array<u16, 4> &b) {
a[0] |= b[0];
a[1] |= b[1];
a[2] |= b[2];
a[3] |= b[3];
return a;
}
#define MAX_BUCKETS 8
static
void set_buckets_from_mask(u16 nibble_mask, u32 bucket,
array<u8, 16> &byte_mask) {
assert(bucket < MAX_BUCKETS);
u32 mask = nibble_mask;
while (mask) {
u32 n = findAndClearLSB_32(&mask);
byte_mask[n] &= ~(1 << bucket);
}
}
bool shuftiBuildDoubleMasks(const CharReach &onechar,
const flat_set<pair<u8, u8>> &twochar,
m128 *lo1, m128 *hi1, m128 *lo2, m128 *hi2) {
DEBUG_PRINTF("unibytes %zu dibytes %zu\n", onechar.size(),
twochar.size());
assert(onechar.count() + twochar.size() <= 8);
array<u8, 16> lo1_a;
array<u8, 16> lo2_a;
array<u8, 16> hi1_a;
@@ -124,43 +147,63 @@ void shuftiBuildDoubleMasks(const CharReach &onechar,
hi1_a.fill(0xff);
hi2_a.fill(0xff);
u32 i = 0;
// two-byte literals
for (flat_set<pair<u8, u8>>::const_iterator it = twochar.begin();
it != twochar.end(); ++it, i++) {
DEBUG_PRINTF("%u: %02hhx %02hhx\n", i, it->first, it->second);
u8 b1 = it->first & 0xf;
u8 t1 = it->first >> 4;
u8 b2 = it->second & 0xf;
u8 t2 = it->second >> 4;
lo1_a[b1] &= ~(1 << i);
hi1_a[t1] &= ~(1 << i);
lo2_a[b2] &= ~(1 << i);
hi2_a[t2] &= ~(1 << i);
vector<array<u16, 4>> nibble_masks;
for (const auto &p : twochar) {
DEBUG_PRINTF("%02hhx %02hhx\n", p.first, p.second);
u16 a_lo = 1U << (p.first & 0xf);
u16 a_hi = 1U << (p.first >> 4);
u16 b_lo = 1U << (p.second & 0xf);
u16 b_hi = 1U << (p.second >> 4);
nibble_masks.push_back({a_lo, a_hi, b_lo, b_hi});
}
// one-byte literals (second byte is a wildcard)
for (size_t it = onechar.find_first(); it != CharReach::npos;
it = onechar.find_next(it), i++) {
DEBUG_PRINTF("%u: %02hhx\n", i, (u8)it);
u8 b1 = it & 0xf;
u8 t1 = it >> 4;
it = onechar.find_next(it)) {
DEBUG_PRINTF("%02hhx\n", (u8)it);
nibble_masks.push_back({(u16)(1U << (it & 0xf)), (u16)(1U << (it >> 4)),
0xffff, 0xffff});
}
lo1_a[b1] &= ~(1 << i);
hi1_a[t1] &= ~(1 << i);
for (int j = 0; j < 16; j++) {
lo2_a[j] &= ~(1 << i);
hi2_a[j] &= ~(1 << i);
// try to merge strings into shared buckets
for (u32 i = 0; i < 4; i++) {
map<array<u16, 4>, array<u16, 4>> new_masks;
for (const auto &a : nibble_masks) {
auto key = a;
key[i] = 0;
if (!contains(new_masks, key)) {
new_masks[key] = a;
} else {
new_masks[key] = or_array(new_masks[key], a);
}
}
nibble_masks.clear();
for (const auto &e : new_masks) {
nibble_masks.push_back(e.second);
}
}
if (nibble_masks.size() > MAX_BUCKETS) {
DEBUG_PRINTF("too many buckets needed (%zu)\n", nibble_masks.size());
return false;
}
u32 i = 0;
for (const auto &a : nibble_masks) {
set_buckets_from_mask(a[0], i, lo1_a);
set_buckets_from_mask(a[1], i, hi1_a);
set_buckets_from_mask(a[2], i, lo2_a);
set_buckets_from_mask(a[3], i, hi2_a);
i++;
}
memcpy(lo1, lo1_a.data(), sizeof(m128));
memcpy(lo2, lo2_a.data(), sizeof(m128));
memcpy(hi1, hi1_a.data(), sizeof(m128));
memcpy(hi2, hi2_a.data(), sizeof(m128));
return true;
}
#ifdef DUMP_SUPPORT

View File

@@ -50,7 +50,11 @@ namespace ue2 {
*/
int shuftiBuildMasks(const CharReach &chars, m128 *lo, m128 *hi);
void shuftiBuildDoubleMasks(const CharReach &onechar,
/** \brief Double-byte variant
*
* Returns false if we are unable to build the masks (too many buckets required)
*/
bool shuftiBuildDoubleMasks(const CharReach &onechar,
const flat_set<std::pair<u8, u8>> &twochar,
m128 *lo1, m128 *hi1, m128 *lo2, m128 *hi2);