函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：q_idle_extract - extract an entity from the idle tree.*@st: the service tree of the owning @entity.*@entity: the entity being removed.

函数原型：static void bfq_idle_extract(struct bfq_service_tree *st, struct bfq_entity *entity)

返回类型：void

参数：

类型参数名称
struct bfq_service_tree *st
struct bfq_entity *entity
347  bfqq等于bfq_entity_to_bfqq(entity)
350  如果entity恒等于dle entity with minimum F_i 则
351  next等于rb_next( & service_tree member )
352  dle entity with minimum F_i 等于q_entity_of - get an entity from a node.*@node: the node field of the entity.* Convert a node pointer to the relative entity. This is used only* to simplify the logic of some functions and not as the generic* conversion mechanism because, e
355  如果entity恒等于dle entity with maximum F_i 则
356  next等于rb_prev( & service_tree member )
357  dle entity with maximum F_i 等于q_entity_of - get an entity from a node.*@node: the node field of the entity.* Convert a node pointer to the relative entity. This is used only* to simplify the logic of some functions and not as the generic* conversion mechanism because, e
360  q_extract - remove an entity from a tree.*@root: the tree root.*@entity: the entity to remove.
362  如果bfqq则删除链表项
调用者
名称描述
bfq_put_idle_entityq_put_idle_entity - release the idle tree ref of an entity.*@st: service tree for the entity.*@entity: the entity being released.
__bfq_activate_entity__bfq_activate_entity - handle activation of entity.*@entity: the entity being activated.*@non_blocking_wait_rq: true if entity was waiting for a request* Called for a 'true' activation, i.e., if entity is not active and
__bfq_deactivate_entity__bfq_deactivate_entity - update sched_data and service trees for* entity, so as to represent entity as inactive*@entity: the entity being deactivated.*@ins_into_idle_tree: if false, the entity will not be put into the* idle tree.