fixup_overlap_contain(9)

💖 NAME 💖

okay bestie, welcome to the fixup_overlap_contain(9) page from the Kernel API Manual — and it’s literally about handling the case where a new key completely contains an existing key. periodt. 🎀

fixup_overlap_contain — handles the case where the new key completely contains an existing key.

---

✨ SYNOPSIS ✨

int fixup_overlap_contain (struct pcache_cache_key *key , struct pcache_cache_key *key_tmp , struct pcache_cache_subtree_walk_ctx *ctx );

---

🎀 ARGUMENTS 🎀

• key — pointer to the new cache key that’s being inserted. 👑
• key_tmp — pointer to the existing key that is being contained. 🫶
• ctx — pointer to the context for walking the cache tree. 🌸

---

🦋 DESCRIPTION 🦋

So here’s the tea ☕: when the new key completely contains the existing key (key_tmp), this function deletes that existing key (key_tmp). 💅

Then it returns SUBTREE_WALK_RET_RESEARCH to indicate that the tree structure may have changed, necessitating a re-insertion of the new key. no cap, that’s the whole vibe. ✨

---

🌈 SEE ALSO 🌈

The related lore lives in the kernel file ./drivers/md/dm-pcache/cache_key.c, and the whole squad is:

• cache_key_get(9)
• cache_key_destroy(9)
• cache_key_append(9)
• cache_subtree_walk(9)
• cache_subtree_search(9)
• fixup_overlap_tail(9)
• fixup_overlap_contained(9)
• fixup_overlap_head(9)
• cache_key_insert(9)
• clean_fn(9)

---

fixup_overlap_contain(9) is signing off from source/version ./drivers/md/dm-pcache, dated October 2026. stay slay, bestie 💖🫶