Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:latch_tree_insert() - insert @node into the trees @root*@node: nodes to insert*@root: trees to insert @node into*@ops: operators defining the node order* It inserts @node into @root in an ordered fashion such that we can always* observe one complete tree

Proto:static __always_inline void latch_tree_insert(struct latch_tree_node *node, struct latch_tree_root *root, const struct latch_tree_ops *ops)

Type:void

Parameter:

TypeParameterName
struct latch_tree_node *node
struct latch_tree_root *root
const struct latch_tree_ops *ops
148  aw_write_seqcount_latch - redirect readers to even/odd copy*@s: pointer to seqcount_t* The latch technique is a multiversion concurrency control method that allows* queries during non-atomic modifications. If you can guarantee queries never
149  __lt_insert(node, root, 0, less)
150  aw_write_seqcount_latch - redirect readers to even/odd copy*@s: pointer to seqcount_t* The latch technique is a multiversion concurrency control method that allows* queries during non-atomic modifications. If you can guarantee queries never
151  __lt_insert(node, root, 1, less)