Home
last modified time | relevance | path

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

/block/
Dbfq-wf2q.c34 struct rb_node *node = tree->rb_node; in bfq_root_active_entity() local
317 struct bfq_entity *bfq_entity_of(struct rb_node *node) in bfq_entity_of()
376 struct rb_node **node = &root->rb_node; in bfq_insert() local
405 static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node) in bfq_update_min()
424 static void bfq_update_active_node(struct rb_node *node) in bfq_update_active_node()
443 static void bfq_update_active_tree(struct rb_node *node) in bfq_update_active_tree()
478 struct rb_node *node = &entity->rb_node; in bfq_active_insert() local
553 static struct rb_node *bfq_find_deepest(struct rb_node *node) in bfq_find_deepest()
583 struct rb_node *node; in bfq_active_extract() local
1346 struct rb_node *node = st->active.rb_node; in bfq_first_active_entity() local
Dblk-ioc.c266 int create_task_io_context(struct task_struct *task, gfp_t gfp_flags, int node) in create_task_io_context()
320 gfp_t gfp_flags, int node) in get_task_io_context()
Dblk-mq-tag.c356 bool round_robin, int node) in bt_alloc()
363 int node, int alloc_policy) in blk_mq_init_bitmap_tags()
384 int node, int alloc_policy) in blk_mq_init_tags()
Dbfq-cgroup.c411 static struct blkg_policy_data *bfq_pd_alloc(gfp_t gfp, int node) in bfq_pd_alloc()
1000 struct bfq_group *bfq_create_group_hierarchy(struct bfq_data *bfqd, int node) in bfq_create_group_hierarchy()
1200 struct bfq_group *bfq_create_group_hierarchy(struct bfq_data *bfqd, int node) in bfq_create_group_hierarchy()
Dblk-mq.c1807 int node; in blk_mq_alloc_rq_map() local
1848 int node; in blk_mq_alloc_rqs() local
1928 static int blk_mq_hctx_notify_dead(unsigned int cpu, struct hlist_node *node) in blk_mq_hctx_notify_dead()
2004 int node; in blk_mq_init_hctx() local
2358 int node; in blk_mq_realloc_hw_ctxs() local
Dblk-flush.c547 int node, int cmd_size) in blk_alloc_flush_queue()
Dblk.h319 static inline struct io_context *create_io_context(gfp_t gfp_mask, int node) in create_io_context()
Ddeadline-iosched.c67 struct rb_node *node = rb_next(&rq->rb_node); in deadline_latter_request() local
Dblk-throttle.c70 struct list_head node; /* service_queue->queued[] */ member
101 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node) argument
485 static struct blkg_policy_data *throtl_pd_alloc(gfp_t gfp, int node) in throtl_pd_alloc()
662 struct rb_node **node = &parent_sq->pending_tree.rb_node; in tg_service_queue_add() local
Dmq-deadline.c77 struct rb_node *node = rb_next(&rq->rb_node); in deadline_latter_request() local
Dcfq-iosched.c74 #define rb_entry_cfqg(node) rb_entry((node), struct cfq_group, rb_node) argument
1253 struct rb_node **node = &st->rb.rb_root.rb_node; in __cfq_group_service_tree_add() local
1626 static struct blkg_policy_data *cfq_pd_alloc(gfp_t gfp, int node) in cfq_pd_alloc()
2837 struct rb_node *parent, *node; in cfqq_close() local
Dgenhd.c1519 struct list_head node; /* all disk_event's */ member
Dsed-opal.c224 struct list_head node; member
Dbfq-iosched.c1801 struct rb_node *parent, *node; in bfqq_find_close() local