Home
last modified time | relevance | path

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

/block/
Dbfq-wf2q.c25 struct rb_node *node = tree->rb_node; in bfq_root_active_entity() local
312 struct bfq_entity *bfq_entity_of(struct rb_node *node) in bfq_entity_of()
371 struct rb_node **node = &root->rb_node; in bfq_insert() local
400 static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node) in bfq_update_min()
419 static void bfq_update_active_node(struct rb_node *node) in bfq_update_active_node()
438 static void bfq_update_active_tree(struct rb_node *node) in bfq_update_active_tree()
473 struct rb_node *node = &entity->rb_node; in bfq_active_insert() local
545 static struct rb_node *bfq_find_deepest(struct rb_node *node) in bfq_find_deepest()
575 struct rb_node *node; in bfq_active_extract() local
1351 struct rb_node *node = st->active.rb_node; in bfq_first_active_entity() local
Dblk-ioc.c250 int create_task_io_context(struct task_struct *task, gfp_t gfp_flags, int node) in create_task_io_context()
305 gfp_t gfp_flags, int node) in get_task_io_context()
Dblk-mq-tag.c465 bool round_robin, int node) in bt_alloc()
474 int node, int alloc_policy) in blk_mq_init_bitmaps()
492 int node, int alloc_policy) in blk_mq_init_bitmap_tags()
538 int node, unsigned int flags) in blk_mq_init_tags()
Dblk-mq.c2402 int node; in blk_mq_alloc_rq_map() local
2433 unsigned int hctx_idx, int node) in blk_mq_init_request()
2452 int node; in blk_mq_alloc_rqs() local
2562 static int blk_mq_hctx_notify_offline(unsigned int cpu, struct hlist_node *node) in blk_mq_hctx_notify_offline()
2595 static int blk_mq_hctx_notify_online(unsigned int cpu, struct hlist_node *node) in blk_mq_hctx_notify_online()
2610 static int blk_mq_hctx_notify_dead(unsigned int cpu, struct hlist_node *node) in blk_mq_hctx_notify_dead()
2766 int node) in blk_mq_alloc_hctx()
3168 int hctx_idx, int node) in blk_mq_alloc_and_init_hctx()
3225 int node; in blk_mq_realloc_hw_ctxs() local
3672 struct list_head node; member
Dmq-deadline.c139 struct rb_node *node = rb_prev(&rq->rb_node); in deadline_earlier_request() local
153 struct rb_node *node = rb_next(&rq->rb_node); in deadline_latter_request() local
168 struct rb_node *node = per_prio->sort_list[data_dir].rb_node; in deadline_from_pos() local
Dblk-flush.c464 struct blk_flush_queue *blk_alloc_flush_queue(int node, int cmd_size, in blk_alloc_flush_queue()
Ddisk-events.c11 struct list_head node; /* all disk_event's */ member
Dblk-zoned.c157 static inline unsigned long *blk_alloc_zone_bitmap(int node, in blk_alloc_zone_bitmap()
Dbfq-cgroup.c1272 struct bfq_group *bfq_create_group_hierarchy(struct bfq_data *bfqd, int node) in bfq_create_group_hierarchy()
1474 struct bfq_group *bfq_create_group_hierarchy(struct bfq_data *bfqd, int node) in bfq_create_group_hierarchy()
Dblk-throttle.c69 struct list_head node; /* service_queue->queued[] */ member
99 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node) argument
680 struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node; in tg_service_queue_add() local
Dgenhd.c1336 struct gendisk *__blk_alloc_disk(int node, struct lock_class_key *lkclass) in __blk_alloc_disk()
Dbio.c643 static int bio_cpu_dead(unsigned int cpu, struct hlist_node *node) in bio_cpu_dead()
Dsed-opal.c220 struct list_head node; member
Dbfq-iosched.c2565 struct rb_node *parent, *node; in bfqq_find_close() local