Searched defs:node (Results 1 – 16 of 16) sorted by relevance
| /block/ |
| D | bfq-wf2q.c | 25 struct rb_node *node = tree->rb_node; in bfq_root_active_entity() local
297 struct bfq_entity *bfq_entity_of(struct rb_node *node) in bfq_entity_of()
356 struct rb_node **node = &root->rb_node; in bfq_insert() local
385 static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node) in bfq_update_min()
404 static void bfq_update_active_node(struct rb_node *node) in bfq_update_active_node()
423 static void bfq_update_active_tree(struct rb_node *node) in bfq_update_active_tree()
458 struct rb_node *node = &entity->rb_node; in bfq_active_insert() local
530 static struct rb_node *bfq_find_deepest(struct rb_node *node) in bfq_find_deepest()
560 struct rb_node *node; in bfq_active_extract() local
1336 struct rb_node *node = st->active.rb_node; in bfq_first_active_entity() local
|
| D | blk-mq-tag.c | 533 bool round_robin, int node) in bt_alloc()
542 int node, int alloc_policy) in blk_mq_init_bitmaps()
561 int node, int alloc_policy) in blk_mq_init_tags()
|
| D | blk-mq.c | 3338 int node = blk_mq_get_hctx_node(set, hctx_idx); in blk_mq_alloc_rq_map() local
3370 unsigned int hctx_idx, int node) in blk_mq_init_request()
3389 int node = blk_mq_get_hctx_node(set, hctx_idx); in blk_mq_alloc_rqs() local
3498 static int blk_mq_hctx_notify_offline(unsigned int cpu, struct hlist_node *node) in blk_mq_hctx_notify_offline()
3531 static int blk_mq_hctx_notify_online(unsigned int cpu, struct hlist_node *node) in blk_mq_hctx_notify_online()
3546 static int blk_mq_hctx_notify_dead(unsigned int cpu, struct hlist_node *node) in blk_mq_hctx_notify_dead()
3696 int node) in blk_mq_alloc_hctx()
4161 int hctx_idx, int node) in blk_mq_alloc_and_init_hctx()
4203 int node = blk_mq_get_hctx_node(set, i); in blk_mq_realloc_hw_ctxs() local
4640 struct list_head node; member
|
| D | blk-ioc.c | 229 static struct io_context *alloc_io_context(gfp_t gfp_flags, int node) in alloc_io_context()
|
| D | blk-flush.c | 471 struct blk_flush_queue *blk_alloc_flush_queue(int node, int cmd_size, in blk_alloc_flush_queue()
|
| D | elevator.h | 170 #define rb_entry_rq(node) rb_entry((node), struct request, rb_node) argument
|
| D | disk-events.c | 11 struct list_head node; /* all disk_event's */ member
|
| D | blk-zoned.c | 160 static inline unsigned long *blk_alloc_zone_bitmap(int node, in blk_alloc_zone_bitmap()
|
| D | blk-throttle.h | 30 struct list_head node; /* service_queue->queued[] */ member
|
| D | mq-deadline.c | 139 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
|
| D | bfq-cgroup.c | 1277 struct bfq_group *bfq_create_group_hierarchy(struct bfq_data *bfqd, int node) in bfq_create_group_hierarchy()
1477 struct bfq_group *bfq_create_group_hierarchy(struct bfq_data *bfqd, int node) in bfq_create_group_hierarchy()
|
| D | blk-throttle.c | 44 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node) argument
532 struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node; in tg_service_queue_add() local
|
| D | genhd.c | 1448 struct gendisk *__blk_alloc_disk(int node, struct lock_class_key *lkclass) in __blk_alloc_disk()
|
| D | bio.c | 700 static int bio_cpu_dead(unsigned int cpu, struct hlist_node *node) in bio_cpu_dead()
|
| D | sed-opal.c | 219 struct list_head node; member
|
| D | bfq-iosched.c | 2700 struct rb_node *parent, *node; in bfqq_find_close() local
|