Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\plist.c Create Date:2022-07-28 06:14:19
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:plist_requeue - Requeue @node at end of same-prio entries

Proto:void plist_requeue(struct plist_node *node, struct plist_head *head)

Type:void

Parameter:

TypeParameterName
struct plist_node *node
struct plist_head *head
148  node_next = node_list
150  plist_check_head(head)
151  BUG_ON(plist_head_empty - return !0 if a plist_head is empty*@head: &struct plist_head pointer)
152  BUG_ON(plist_node_empty - return !0 if plist_node is not on a list*@node: &struct plist_node pointer)
154  If node == plist_last - return the last node (and thus, lowest priority)*@head: the &struct plist_head pointer* Assumes the plist is _not_ empty. Then Return
157  iter = plist_next - get the next entry in list*@pos: the type * to cursor(node)
159  If prio != prio Then Return
162  plist_del - Remove a @node from plist.*@node: &struct plist_node pointer - entry to be removed*@head: &struct plist_head pointer - list head
164  plist_for_each_continue - continue iteration over the plist*@pos: the type * to use as a loop cursor*@head: the head for your list* Continue to iterate over plist, continuing after the current position.(iter, head)
165  If prio != prio Then
166  node_next = node_list
167  Break
170  list_add_tail - add a new entry*@new: new entry to be added*@head: list head to add it before* Insert a new entry before the specified head.* This is useful for implementing queues.
172  plist_check_head(head)