Home
last modified time | relevance | path

Searched defs:node (Results 1 – 13 of 13) sorted by relevance

/block/
Dbfq-wf2q.c25 struct rb_node *node = tree->rb_node; in bfq_root_active_entity() local
318 struct bfq_entity *bfq_entity_of(struct rb_node *node) in bfq_entity_of()
377 struct rb_node **node = &root->rb_node; in bfq_insert() local
406 static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node) in bfq_update_min()
425 static void bfq_update_active_node(struct rb_node *node) in bfq_update_active_node()
444 static void bfq_update_active_tree(struct rb_node *node) in bfq_update_active_tree()
479 struct rb_node *node = &entity->rb_node; in bfq_active_insert() local
551 static struct rb_node *bfq_find_deepest(struct rb_node *node) in bfq_find_deepest()
581 struct rb_node *node; in bfq_active_extract() local
1354 struct rb_node *node = st->active.rb_node; in bfq_first_active_entity() local
Dblk-ioc.c243 int create_task_io_context(struct task_struct *task, gfp_t gfp_flags, int node) in create_task_io_context()
297 gfp_t gfp_flags, int node) in get_task_io_context()
Dblk-mq-tag.c437 bool round_robin, int node) in bt_alloc()
444 int node, int alloc_policy) in blk_mq_init_bitmap_tags()
465 int node, int alloc_policy) in blk_mq_init_tags()
Dblk-mq.c2100 int node; in blk_mq_alloc_rq_map() local
2137 unsigned int hctx_idx, int node) in blk_mq_init_request()
2156 int node; in blk_mq_alloc_rqs() local
2233 static int blk_mq_hctx_notify_dead(unsigned int cpu, struct hlist_node *node) in blk_mq_hctx_notify_dead()
2346 int node) in blk_mq_alloc_hctx()
2754 int hctx_idx, int node) in blk_mq_alloc_and_init_hctx()
2795 int node; in blk_mq_realloc_hw_ctxs() local
3193 struct list_head node; member
Dblk-flush.c476 int node, int cmd_size, gfp_t flags) in blk_alloc_flush_queue()
Dblk-zoned.c326 static inline unsigned long *blk_alloc_zone_bitmap(int node, in blk_alloc_zone_bitmap()
Dblk.h300 static inline struct io_context *create_io_context(gfp_t gfp_mask, int node) in create_io_context()
Dbfq-cgroup.c1185 struct bfq_group *bfq_create_group_hierarchy(struct bfq_data *bfqd, int node) in bfq_create_group_hierarchy()
1383 struct bfq_group *bfq_create_group_hierarchy(struct bfq_data *bfqd, int node) in bfq_create_group_hierarchy()
Dblk-throttle.c68 struct list_head node; /* service_queue->queued[] */ member
98 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node) argument
654 struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node; in tg_service_queue_add() local
Dmq-deadline.c79 struct rb_node *node = rb_next(&rq->rb_node); in deadline_latter_request() local
Dgenhd.c1622 struct list_head node; /* all disk_event's */ member
Dsed-opal.c218 struct list_head node; member
Dbfq-iosched.c2411 struct rb_node *parent, *node; in bfqq_find_close() local