hlist_is_singular_node(9)
okay so bestie, welcome to the Kernel API Manual page for hlist_is_singular_node(9) β it's short, it's sweet, and it's literally about checking if one node is the whole entire list. π
β¨
πΈ NAME πΈ
hlist_is_singular_node β is node the only element of the specified hlist? π
β¨ SYNOPSIS β¨
bool hlist_is_singular_node (struct hlist_node *n , struct hlist_head *h
);
π ARGUMENTS π
nβ node to check for singularity. That's the main character here. πhβ header for potentially singular list. The maybe-solo-list's header, iykyk. π«Ά
π¦ DESCRIPTION π¦
So the vibe check is: check whether the node is the only node of the head β and it does this without accessing head, thus avoiding unnecessary cache misses. No cap, that's the whole flex. π₯
π SEE ALSO π
Kernel file ./include/linux/list.h β plus the entire reference squad, because this page is not gatekeeping:
LIST_HEAD_INIT(9)LIST_HEAD(9)LIST_HEAD_GUARDED(9)INIT_LIST_HEAD(9)list_add(9)list_add_tail(9)list_add_tail_release(9)list_del(9)list_replace(9)list_replace_init(9)list_swap(9)list_del_init(9)list_move(9)list_move_tail(9)list_bulk_move_tail(9)list_is_first(9)list_is_last(9)list_is_head(9)list_empty(9)list_del_init_careful(9)list_empty_careful(9)list_rotate_left(9)list_rotate_to_front(9)list_is_singular(9)list_cut_position(9)list_cut_before(9)list_splice(9)list_splice_tail(9)list_splice_init(9)list_splice_tail_init(9)list_entry(9)list_first_entry(9)list_last_entry(9)list_first_entry_or_null(9)list_first_entry_or_null_acquire(9)list_last_entry_or_null(9)list_next_entry(9)list_next_entry_circular(9)list_prev_entry(9)list_prev_entry_circular(9)list_for_each(9)list_for_each_continue(9)list_for_each_prev(9)list_for_each_safe(9)list_for_each_prev_safe(9)list_count_nodes(9)list_entry_is_head(9)list_for_each_entry(9)list_for_each_entry_reverse(9)list_prepare_entry(9)list_for_each_entry_continue(9)list_for_each_entry_continue_reverse(9)list_for_each_entry_from(9)list_for_each_entry_from_reverse(9)list_for_each_entry_safe(9)list_for_each_entry_safe_continue(9)list_for_each_entry_safe_from(9)list_for_each_entry_safe_reverse(9)list_safe_reset_next(9)hlist_unhashed(9)hlist_unhashed_lockless(9)hlist_empty(9)hlist_del(9)hlist_del_init(9)hlist_add_head(9)hlist_add_before(9)hlist_add_behind(9)hlist_add_fake(9)hlist_fake(9)hlist_move_list(9)hlist_splice_init(9)hlist_for_each_entry(9)hlist_for_each_entry_continue(9)hlist_for_each_entry_from(9)hlist_for_each_entry_safe(9)hlist_count_nodes(9)
That's the whole page, bestie: source/version ./include/linux, dated October 2026, and it's the hlist_is_singular_node(9) manual page. Mwah ππ
π¦ 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