函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称: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

函数原型:static struct rb_node *bfq_find_deepest(struct rb_node *node)

返回类型:struct rb_node

参数:

类型参数名称
struct rb_node *node
557  如果非rb_right且非rb_leftdeepest等于rb_parent(node)
559  否则如果非rb_rightdeepest等于rb_left
561  否则如果非rb_leftdeepest等于rb_right
563  否则
564  deepest等于rb_next(node)
565  如果rb_rightdeepest等于rb_right
567  否则如果rb_parent(deepest)不等于nodedeepest等于rb_parent(deepest)
571  返回:deepest
调用者
名称描述
bfq_active_extractq_active_extract - remove an entity from the active tree.*@st: the service_tree containing the tree.*@entity: the entity being removed.