bfq_find_deepest

函数名称：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_left则deepest等于rb_parent(node)

559

否则如果非rb_right则deepest等于rb_left

561

否则如果非rb_left则deepest等于rb_right

563

否则

564

deepest等于rb_next(node)

565

如果rb_right则deepest等于rb_right

567

否则如果rb_parent(deepest)不等于node则deepest等于rb_parent(deepest)

571

返回:deepest

**调用者**
名称	描述
bfq_active_extract	q_active_extract - remove an entity from the active tree.@st: the service_tree containing the tree.@entity: the entity being removed.

源代码转换工具开放的插件接口	X
支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告代码生成和批量转换代码

函数逻辑报告