rb_for_each(9)
β¨ NAME β¨
Okay so bestie, this is rb_for_each(9) from the Kernel API Manual π
β and its whole thing is that it iterates a subtree matching @key β¨. That's the vibe. Slay.
πΈ SYNOPSIS πΈ
rb_for_each (node , key , tree , cmp );
π ARGUMENTS π
nodeβ the iterator π. It's the little main character doing the iterating.keyβ key to match π. The subtree situation is matching on this, no cap.treeβ tree to search π³. This is the tree you're searching, periodt.cmpβ operator defining node order π§. It's the operator that defines node order, iykyk.
π¦ SEE ALSO π¦
- Kernel file
./tools/include/linux/rbtree.hπ rbtree_postorder_for_each_entry_safe(9)πrb_add_cached(9)βrb_add(9)πrb_find_add(9)π«Άrb_find(9)π₯rb_find_first(9)πrb_next_match(9)π
That's the whole page, bestie ππ«Ά. This one's source/version is ./tools/include/linux, and the date on the cute little footer is October 2026 β¨π.
π¦ where this page comes from
- nixpkgs unstable: linux-manual 7.3.1
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms