list_for_each_prev (9) Linux Manual Page
list_for_each_prev – iterate over a list backwards Synopsis list_for_each_prev(pos, head); Arguments pos the struct list_head to use as a loop cursor. head the head for your list. Copyright
The Linux Manuals (man pages) document is an important part of Linux documents. Linux Manuals are organized as several sections. Each section has a group of commands for a specific area in Linux usage, administration or development.
list_for_each_prev – iterate over a list backwards Synopsis list_for_each_prev(pos, head); Arguments pos the struct list_head to use as a loop cursor. head the head for your list. Copyright
list_for_each_entry_safe_reverse – iterate backwards over list safe against removal Synopsis list_for_each_entry_safe_reverse(pos, n, head, member); Arguments pos the type * to use as a loop cursor. n another type * to use as temporary storage head the head for your list. member the name of the list_head within the struct. Description Iterate backwards over list of…
list_for_each_entry_safe_from – iterate over list from current point safe against removal Synopsis list_for_each_entry_safe_from(pos, n, head, member); Arguments pos the type * to use as a loop cursor. n another type * to use as temporary storage head the head for your list. member the name of the list_head within the struct. Description Iterate over list…
list_for_each_entry_safe_continue – continue list iteration safe against removal Synopsis list_for_each_entry_safe_continue(pos, n, head, member); Arguments pos the type * to use as a loop cursor. n another type * to use as temporary storage head the head for your list. member the name of the list_head within the struct. Description Iterate over list of given type,…
list_for_each_entry_safe – iterate over list of given type safe against removal of list entry Synopsis list_for_each_entry_safe(pos, n, head, member); Arguments pos the type * to use as a loop cursor. n another type * to use as temporary storage head the head for your list. member the name of the list_head within the struct. Copyright
list_for_each_entry_reverse – iterate backwards over list of given type. Synopsis list_for_each_entry_reverse(pos, head, member); Arguments pos the type * to use as a loop cursor. head the head for your list. member the name of the list_head within the struct. Copyright
list_for_each_entry_from – iterate over list of given type from the current point Synopsis list_for_each_entry_from(pos, head, member); Arguments pos the type * to use as a loop cursor. head the head for your list. member the name of the list_head within the struct. Description Iterate over list of given type, continuing from current position. Copyright
list_for_each_entry_continue_reverse – iterate backwards from the given point Synopsis list_for_each_entry_continue_reverse(pos, head, member); Arguments pos the type * to use as a loop cursor. head the head for your list. member the name of the list_head within the struct. Description Start to iterate over list of given type backwards, continuing after the current position. Copyright
list_for_each_entry_continue – continue iteration over list of given type Synopsis list_for_each_entry_continue(pos, head, member); Arguments pos the type * to use as a loop cursor. head the head for your list. member the name of the list_head within the struct. Description Continue to iterate over list of given type, continuing after the current position. Copyright
list_for_each_entry – iterate over list of given type Synopsis list_for_each_entry(pos, head, member); Arguments pos the type * to use as a loop cursor. head the head for your list. member the name of the list_head within the struct. Copyright
list_for_each – iterate over a list Synopsis list_for_each(pos, head); Arguments pos the struct list_head to use as a loop cursor. head the head for your list. Copyright
list_first_entry_or_null – get the first element from a list Synopsis list_first_entry_or_null(ptr, type, member); Arguments ptr the list head to take the element from. type the type of the struct this is embedded in. member the name of the list_head within the struct. Description Note that if the list is empty, it returns NULL. Copyright
list_first_entry – get the first element from a list Synopsis list_first_entry(ptr, type, member); Arguments ptr the list head to take the element from. type the type of the struct this is embedded in. member the name of the list_head within the struct. Description Note, that list is expected to be not empty. Copyright
list_entry – get the struct for this entry Synopsis list_entry(ptr, type, member); Arguments ptr the struct list_head pointer. type the type of the struct this is embedded in. member the name of the list_head within the struct. Copyright
list_empty_careful – tests whether a list is empty and not being modified Synopsis int list_empty_careful(const struct list_head *head); Arguments head the list to test Description tests whether a list is empty _and_ checks that no other CPU might be in the process of modifying either member (next or prev) Note using list_empty_careful without synchronization can…
list_empty – tests whether a list is empty Synopsis int list_empty(const struct list_head *head); Arguments head the list to test. Copyright
list_del_init – deletes entry from list and reinitialize it. Synopsis void list_del_init(struct list_head *entry); Arguments entry the element to delete from the list. Copyright
list_cut_position – cut a list into two Synopsis void list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry); Arguments list a new list to add all removed entries head a list with entries entry an entry within head, could be the head itself and if so we won’t cut the list Description This helper moves…
list_add_tail – add a new entry Synopsis void list_add_tail(struct list_head *new, struct list_head *head); Arguments new new entry to be added head list head to add it before Description Insert a new entry before the specified head. This is useful for implementing queues. Copyright
list_add – add a new entry Synopsis void list_add(struct list_head *new, struct list_head *head); Arguments new new entry to be added head list head to add it after Description Insert a new entry after the specified head. This is good for implementing stacks. Copyright