Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:include\linux\list.h Create Date:2022-07-28 05:34:28
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:Insert a new entry between two known consecutive entries.* This is only for internal list manipulation where we know* the prev/next entries already!

Proto:static inline void __list_add(struct list_head *new, struct list_head *prev, struct list_head *next)

Type:void

Parameter:

TypeParameterName
struct list_head *new
struct list_head *prev
struct list_head *next
60  If Not __list_add_valid(new, prev, next) Then Return
63  prev = new
64  next = next
65  prev = prev
66  WRITE_ONCE(next, new)
Caller
NameDescribe
list_addlist_add - add a new entry*@new: new entry to be added*@head: list head to add it after* Insert a new entry after the specified head.* This is good for implementing stacks.
list_add_taillist_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.