pub_soft/abseil-cpp
3
0
Fork 0
mirror of https://github.com/abseil/abseil-cpp.git synced 2026-06-04 12:07:05 +08:00
Code Issues Packages Projects Releases Wiki Activity

Refactor find_or_prepare_insert_large to use a single return statement using a lambda.

Browse Source 
This way, we deduplicate the generated code for iterator/pair construction.

PiperOrigin-RevId: 802249759
Change-Id: If30a6d01ef4ae3ce899807b42dfc3d0da9b03536
This commit is contained in:
Evan Brown
2025-09-02 12:35:51 -07:00
committed by Copybara-Service
parent f040e96b93
commit f2f4fa2ca3
1 changed files with 32 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
absl/container/internal/raw_hash_set.h
View File

@@ -3184,31 +3184,41 @@ class raw_hash_set {
auto seq = probe(common(), hash);
const h2_t h2 = H2(hash);
const ctrl_t* ctrl = control();
while (true) {
size_t index;
bool inserted;
// We use a lambda function to be able to exit from the nested loop without
// duplicating generated code for the return statement (e.g. iterator_at).
[&] {
while (true) {
#ifndef ABSL_HAVE_MEMORY_SANITIZER
absl::PrefetchToLocalCache(slot_array() + seq.offset());
absl::PrefetchToLocalCache(slot_array() + seq.offset());
#endif
Group g{ctrl + seq.offset()};
for (uint32_t i : g.Match(h2)) {
if (ABSL_PREDICT_TRUE(equal_to(key, slot_array() + seq.offset(i))))
return {iterator_at(seq.offset(i)), false};
Group g{ctrl + seq.offset()};
for (uint32_t i : g.Match(h2)) {
if (ABSL_PREDICT_TRUE(equal_to(key, slot_array() + seq.offset(i)))) {
index = seq.offset(i);
inserted = false;
return;
}
}
auto mask_empty = g.MaskEmpty();
if (ABSL_PREDICT_TRUE(mask_empty)) {
size_t target = seq.offset(mask_empty.LowestBitSet());
index = SwisstableGenerationsEnabled()
? PrepareInsertLargeGenerationsEnabled(
common(), GetPolicyFunctions(), hash,
FindInfo{target, seq.index()},
HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})
: PrepareInsertLarge(common(), GetPolicyFunctions(), hash,
FindInfo{target, seq.index()});
inserted = true;
return;
}
seq.next();
ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
}
auto mask_empty = g.MaskEmpty();
if (ABSL_PREDICT_TRUE(mask_empty)) {
size_t target = seq.offset(mask_empty.LowestBitSet());
size_t index =
SwisstableGenerationsEnabled()
? PrepareInsertLargeGenerationsEnabled(
common(), GetPolicyFunctions(), hash,
FindInfo{target, seq.index()},
HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})
: PrepareInsertLarge(common(), GetPolicyFunctions(), hash,
FindInfo{target, seq.index()});
return {iterator_at(index), true};
}
seq.next();
ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
}
}();
return {iterator_at(index), inserted};
}
protected: