Skip to content

memoCacheGet using pnext #9728

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
david-arm wants to merge 1 commit into
base: master
Choose a base branch
from
+21 −0
Draft

memoCacheGet using pnext #9728

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions third-party/folly/src/folly/container/detail/F14Table.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,6 +16,8 @@

#pragma once

#define FOLLY_PURE_SVE 1

#include <cstddef>
#include <cstdint>
#include <cstring>
Expand Down Expand Up @@ -1701,6 +1703,24 @@ class F14Table : public Policy {
if (prefetch == Prefetch::ENABLED && sizeof(Chunk) > 64) {
prefetchAddr(chunk->itemAddr(8));
}
#if FOLLY_PURE_SVE
svuint8_t tagV = svld1_u8(pred, &chunk->tags_[0]);
svbool_t eqV = svcmpeq_n_u8(pred, tagV, static_cast<uint8_t>(hp.second));
if (svptest_any(eqV, eqV)) {
svbool_t nextBit = svpnext_b8(eqV, svpfalse());
do {
svbool_t maskUpToBit = svbrkb_b_z(svptrue_b8(), nextBit);
uint64_t i = svcntp_b8(maskUpToBit, maskUpToBit);
if (FOLLY_LIKELY(this->keyMatchesItem(key, chunk->item(i)))) {
// Tag match and key match were both successful. The chance
// of a false tag match is 1/128 for each key in the chunk
// (with a proper hash function).
return ItemIter{chunk, i};
}
nextBit = svpnext_b8(eqV, nextBit);
} while (svptest_any(eqV, nextBit));
}
#else
#if FOLLY_ARM_FEATURE_NEON_SVE_BRIDGE
auto hits = chunk->tagMatchIter(needleV, pred);
#else
Expand All @@ -1715,6 +1735,7 @@ class F14Table : public Policy {
return ItemIter{chunk, i};
}
}
#endif
if (FOLLY_LIKELY(chunk->outboundOverflowCount() == 0)) {
// No keys that wanted to be placed in this chunk were denied
// entry, so our search is over. This is the common case.
Expand Down