Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:block\bfq-wf2q.c Create Date:2022-07-28 17:59:30
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:q_find_deepest - find the deepest node that an extraction can modify.*@node: the node being removed.* Do the first step of an extraction in an rb tree, looking for the* node that will replace @node, and returning the deepest node that

Proto:static struct rb_node *bfq_find_deepest(struct rb_node *node)

Type:struct rb_node

Parameter:

TypeParameterName
struct rb_node *node
557  If Not rb_right && Not rb_left Then deepest = rb_parent(node)
559  Else if Not rb_right Then deepest = rb_left
561  Else if Not rb_left Then deepest = rb_right
563  Else
564  deepest = rb_next(node)
565  If rb_right Then deepest = rb_right
567  Else if rb_parent(deepest) != node Then deepest = rb_parent(deepest)
571  Return deepest
Caller
NameDescribe
bfq_active_extractq_active_extract - remove an entity from the active tree.*@st: the service_tree containing the tree.*@entity: the entity being removed.