d_add(9)

📦 version 7.3.1, in nixpkgs unstable

💖 d_add(9) — add dentry to hash queues 💖

okay bestie, welcome to the Kernel API Manual, section d_add(9). this one's short and sweet — a little two-ingredient recipe for putting a dentry where the kernel can find it later. no cap, it's like the "file it in the right drawer" function of the dcache. 🗂️✨

🌸 NAME 🌸

d_add — add dentry to hash queues. that's it, that's the whole vibe. it hashes the dentry and blesses it with an inode. slay.

✨ SYNOPSIS ✨

void d_add (struct dentry *entry , struct inode *inode );

return type void, meaning it gives you nothing back and honestly? iconic. it just does the thing and leaves. 💅

🎀 ARGUMENTS 🎀

  • entry — the dentry you're adding, bestie. this is the dentry to add. she's the main character here. 👑
  • inode — the inode to attach to this dentry. they're getting linked up, it's giving soulmate energy fr fr. 🫶

🦋 DESCRIPTION 🦋

so what does it actually do? two things, and honestly they're both kind of a big deal:

  • it adds the entry to the hash queues, so future lookups can actually find her instead of wandering around lost 😭
  • it initializes inode — your inode argument gets attached to the dentry

and the little lore drop you need to know: the entry was actually filled in earlier during d_alloc. so by the time you get here, the dentry's already been built — you're not creating anything, you're just filing her. lowkey efficient. ⭐

not me emphasizing this: the filling-in already happened in d_alloc. d_add doesn't build the dentry, it just hashes it and hooks up the inode. don't come for me if you skip the d_alloc step, i warned you 🙈

🌈 SEE ALSO 🌈

the whole friend group, in order, no one gets left out 💜:

and that's the page!! 🎀 this lil gem comes to you from source ./fs, dated October 2026 — so yeah, mark your calendar bestie, future vibes only. go forth and hash those dentries, i'm literally obsessed with you 💖✨🦋🌸🫶

📦 where this page comes from