radix_tree_...kup_tag_slot(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

πŸ’… radix_tree_gang_lookup_tag_slot(9) β€” the Kernel API Manual, bestie edition πŸŽ€

okay so this is a page from the Kernel API Manual (yes, the (9) section, we're in kernel-land now 🌸) and it's all about radix_tree_gang_lookup_tag_slot and honestly? she's a baddie. let's get into it ✨


✨ NAME ✨

radix_tree_gang_lookup_tag_slot β€” perform multiple slot lookup on a radix tree based on a tag πŸ¦‹

like, you're grabbing a whole gang of slots (not just one, we're extra here) out of a radix tree, and the filter is a tag. very main character energy, no cap πŸ’…


πŸ”₯ SYNOPSIS πŸ”₯

unsigned int radix_tree_gang_lookup_tag_slot (const struct
       radix_tree_root *root , void __rcu ***results , unsigned long
       first_index , unsigned int max_items , unsigned int tag );

that triple-pointer ***results is not a typo bestie, she's real, she's iconic, she's giving pointer inception πŸ’€


🌈 ARGUMENTS 🌈

  • root β€” radix tree root. the actual tree you're digging through, your starting point, your home base 🏑
  • results β€” where the results of the lookup are placed. this is the lil basket you're collecting your findings in 🧺
  • first_index β€” start the lookup from this key. you're not starting from the beginning, you're picking up from here πŸ‘‘
  • max_items β€” place up to this many items at *results. a hard cap, a limit, a "know when to stop" moment πŸ›‘
  • tag β€” the tag index (< RADIX_TREE_MAX_TAGS). important!! it's gotta be less than RADIX_TREE_MAX_TAGS or like, don't πŸ™ˆ

πŸ’– DESCRIPTION πŸ’–

so what she does: Performs an index-ascending scan of the tree for present items which have the tag indexed by tag set. πŸ¦‹

read that again. index-ascending. she goes up, in order, scanning the tree, and she only picks up the present items that have that tag set. picky? no. selective. there's a difference πŸ’…

then she Places the slots at *results β€” like, the actual slots, not just the items, okay, that's important β€” and returns the number of slots which were placed at *results. so the return value is literally "how many did I find and put in your basket" 🧺✨ count them, that's your number, periodt.


🫢 SEE ALSO 🫢

the whole friend group, fr fr. first up, the Kernel file ./lib/radix-tree.c β€” that's where she lives, that's her address 🏠 β€” and then all her mutuals:

ngl that's a lot of friends but she knows every single one of them by name πŸ˜­πŸ’œ


a lil vibe check before you go: tag has to be < RADIX_TREE_MAX_TAGS. that's not a suggestion, that's the rule. respect it πŸ™ˆ

and that's the page!! sign-off time πŸŽ€ β€” this came out of the ./lib source, dated October 2026, and it's the radix_tree_...kup_tag_slot(9) page, so yeah, the title got a lil truncated in the header and honestly she ate anyway πŸ’…βœ¨ go forth and gang-lookup, bestie πŸ¦‹πŸ’–

πŸ“¦ where this page comes from