函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\plist.c Create Date:2022-07-27 07:11:36
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：plist_requeue - Requeue @node at end of same-prio entries

函数原型：void plist_requeue(struct plist_node *node, struct plist_head *head)

返回类型：void

参数：

类型参数名称
struct plist_node *node
struct plist_head *head
148  node_next等于node_list
150  plist_check_head(head)
151  BUG_ON(判断链表空)
152  BUG_ON(节点不在链表上)
154  如果node恒等于返回最后的节点则返回
157  iter等于plist_next - get the next entry in list*@pos: the type * to cursor(node)
159  如果prio不等于prio则返回
162  从plist移除节点
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  如果prio不等于prio则
166  node_next等于node_list
167  退出
170  添加链表项
172  plist_check_head(head)
调用者
名称描述
get_swap_pages