Home
last modified time | relevance | path

Searched refs:parent (Results 1 – 18 of 18) sorted by relevance

/block/
Dblk-iolatency.c398 struct iolatency_grp *parent; in check_scale_change() local
406 if (lat_to_blkg(iolat)->parent == NULL) in check_scale_change()
409 parent = blkg_to_lat(lat_to_blkg(iolat)->parent); in check_scale_change()
410 if (!parent) in check_scale_change()
413 lat_info = &parent->child_lat; in check_scale_change()
474 while (blkg && blkg->parent) { in blkcg_iolatency_throttle()
477 blkg = blkg->parent; in blkcg_iolatency_throttle()
484 blkg = blkg->parent; in blkcg_iolatency_throttle()
528 struct iolatency_grp *parent; in iolatency_check_latencies() local
544 parent = blkg_to_lat(blkg->parent); in iolatency_check_latencies()
[all …]
Dblk-cgroup.c97 if (blkg->parent) in __blkg_release()
98 blkg_put(blkg->parent); in __blkg_release()
266 blkg->parent = __blkg_lookup(blkcg_parent(blkcg), q, false); in blkg_create()
267 if (WARN_ON_ONCE(!blkg->parent)) { in blkg_create()
271 blkg_get(blkg->parent); in blkg_create()
350 struct blkcg *parent = blkcg_parent(blkcg); in blkg_lookup_create() local
353 while (parent) { in blkg_lookup_create()
354 blkg = __blkg_lookup(parent, q, false); in blkg_lookup_create()
360 pos = parent; in blkg_lookup_create()
361 parent = blkcg_parent(parent); in blkg_lookup_create()
[all …]
Dbfq-wf2q.c147 struct bfq_entity *group_entity = bfqq->entity.parent; in bfq_bfqq_to_bfqg()
372 struct rb_node *parent = NULL; in bfq_insert() local
375 parent = *node; in bfq_insert()
376 entry = rb_entry(parent, struct bfq_entity, rb_node); in bfq_insert()
379 node = &parent->rb_left; in bfq_insert()
381 node = &parent->rb_right; in bfq_insert()
384 rb_link_node(&entity->rb_node, parent, node); in bfq_insert()
440 struct rb_node *parent; in bfq_update_active_tree() local
445 parent = rb_parent(node); in bfq_update_active_tree()
446 if (!parent) in bfq_update_active_tree()
[all …]
Dblk-crypto-profile.c529 void blk_crypto_intersect_capabilities(struct blk_crypto_profile *parent, in blk_crypto_intersect_capabilities() argument
535 parent->max_dun_bytes_supported = in blk_crypto_intersect_capabilities()
536 min(parent->max_dun_bytes_supported, in blk_crypto_intersect_capabilities()
539 parent->modes_supported[i] &= child->modes_supported[i]; in blk_crypto_intersect_capabilities()
540 parent->key_types_supported &= child->key_types_supported; in blk_crypto_intersect_capabilities()
542 parent->max_dun_bytes_supported = 0; in blk_crypto_intersect_capabilities()
543 memset(parent->modes_supported, 0, in blk_crypto_intersect_capabilities()
544 sizeof(parent->modes_supported)); in blk_crypto_intersect_capabilities()
545 parent->key_types_supported = 0; in blk_crypto_intersect_capabilities()
Dbfq-cgroup.c303 struct blkcg_gq *pblkg = bfqg_to_blkg(bfqg)->parent; in bfqg_parent()
310 struct bfq_entity *group_entity = bfqq->entity.parent; in bfqq_group()
408 struct bfq_group *parent; in bfqg_stats_xfer_dead() local
413 parent = bfqg_parent(bfqg); in bfqg_stats_xfer_dead()
417 if (unlikely(!parent)) in bfqg_stats_xfer_dead()
420 bfqg_stats_add_aux(&parent->stats, &bfqg->stats); in bfqg_stats_xfer_dead()
439 entity->parent = bfqg->my_entity; /* NULL for root group */ in bfq_init_entity()
580 struct bfq_group *parent) in bfq_group_set_parent() argument
585 entity->parent = parent->my_entity; in bfq_group_set_parent()
586 entity->sched_data = &parent->sched_data; in bfq_group_set_parent()
[all …]
Dkeyslot-manager.c466 void blk_ksm_intersect_modes(struct blk_keyslot_manager *parent, in blk_ksm_intersect_modes() argument
472 parent->max_dun_bytes_supported = in blk_ksm_intersect_modes()
473 min(parent->max_dun_bytes_supported, in blk_ksm_intersect_modes()
477 parent->crypto_modes_supported[i] &= in blk_ksm_intersect_modes()
481 parent->max_dun_bytes_supported = 0; in blk_ksm_intersect_modes()
482 memset(parent->crypto_modes_supported, 0, in blk_ksm_intersect_modes()
483 sizeof(parent->crypto_modes_supported)); in blk_ksm_intersect_modes()
Dbfq-iosched.h185 struct bfq_entity *parent; member
1029 for (; entity ; entity = entity->parent)
1037 #define for_each_entity_safe(entity, parent) \ argument
1038 for (; entity && ({ parent = entity->parent; 1; }); entity = parent)
1049 #define for_each_entity_safe(entity, parent) \ argument
1050 for (parent = NULL; entity ; entity = parent)
Dblk-throttle.c305 if (cgroup_subsys_on_dfl(io_cgrp_subsys) && !blkg->parent) in tg_bps_limit()
335 if (cgroup_subsys_on_dfl(io_cgrp_subsys) && !blkg->parent) in tg_iops_limit()
560 if (cgroup_subsys_on_dfl(io_cgrp_subsys) && blkg->parent) in throtl_pd_init()
561 sq->parent_sq = &blkg_to_tg(blkg->parent)->service_queue; in throtl_pd_init()
681 struct rb_node *parent = NULL; in tg_service_queue_add() local
687 parent = *node; in tg_service_queue_add()
688 __tg = rb_entry_tg(parent); in tg_service_queue_add()
691 node = &parent->rb_left; in tg_service_queue_add()
693 node = &parent->rb_right; in tg_service_queue_add()
698 rb_link_node(&tg->rb_node, parent, node); in tg_service_queue_add()
[all …]
Dblk-iocost.c675 return kobject_name(q->kobj.parent); in q_name()
1101 struct ioc_gq *parent = iocg->ancestors[lvl]; in __propagate_weights() local
1106 parent->child_active_sum += (s32)(active - child->active); in __propagate_weights()
1107 parent->child_inuse_sum += (s32)(inuse - child->inuse); in __propagate_weights()
1117 if (parent->child_active_sum) { in __propagate_weights()
1118 parent_active = parent->weight; in __propagate_weights()
1120 parent_active * parent->child_inuse_sum, in __propagate_weights()
1121 parent->child_active_sum); in __propagate_weights()
1125 if (parent_active == parent->active && in __propagate_weights()
1126 parent_inuse == parent->inuse) in __propagate_weights()
[all …]
Dbsg.c186 struct device *parent, const char *name, bsg_sg_io_fn *sg_io_fn) in bsg_register_queue() argument
202 dev_err(parent, "bsg: too many bsg devices\n"); in bsg_register_queue()
208 bd->device.parent = parent; in bsg_register_queue()
Dbfq-iosched.c604 struct rb_node **p, *parent; in bfq_rq_pos_tree_lookup() local
607 parent = NULL; in bfq_rq_pos_tree_lookup()
612 parent = *p; in bfq_rq_pos_tree_lookup()
613 bfqq = rb_entry(parent, struct bfq_queue, pos_node); in bfq_rq_pos_tree_lookup()
629 *ret_parent = parent; in bfq_rq_pos_tree_lookup()
658 struct rb_node **p, *parent; in bfq_pos_tree_add_move() local
685 blk_rq_pos(bfqq->next_rq), &parent, &p); in bfq_pos_tree_add_move()
687 rb_link_node(&bfqq->pos_node, parent, p); in bfq_pos_tree_add_move()
775 struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; in bfq_weights_tree_add() local
797 parent = *new; in bfq_weights_tree_add()
[all …]
Dbio.c314 struct bio *parent = bio->bi_private; in __bio_chain_endio() local
316 if (bio->bi_status && !parent->bi_status) in __bio_chain_endio()
317 parent->bi_status = bio->bi_status; in __bio_chain_endio()
319 return parent; in __bio_chain_endio()
338 void bio_chain(struct bio *bio, struct bio *parent) in bio_chain() argument
342 bio->bi_private = parent; in bio_chain()
344 bio_inc_remaining(parent); in bio_chain()
Delevator.c257 struct rb_node *parent = NULL; in elv_rb_add() local
261 parent = *p; in elv_rb_add()
262 __rq = rb_entry(parent, struct request, rb_node); in elv_rb_add()
270 rb_link_node(&rq->rb_node, parent, p); in elv_rb_add()
Dgenhd.c393 int device_add_disk(struct device *parent, struct gendisk *disk, in device_add_disk() argument
443 ddev->parent = parent; in device_add_disk()
740 else if (dev->parent && dev->parent->driver) in printk_all_partitions()
742 dev->parent->driver->name); in printk_all_partitions()
Dblk-mq-debugfs.c812 static void debugfs_create_files(struct dentry *parent, void *data, in debugfs_create_files() argument
815 if (IS_ERR_OR_NULL(parent)) in debugfs_create_files()
818 d_inode(parent)->i_private = data; in debugfs_create_files()
821 debugfs_create_file(attr->name, attr->mode, parent, in debugfs_create_files()
Dblk-mq-sysfs.c269 WARN_ON_ONCE(!q->kobj.parent); in __blk_mq_register_dev()
Dblk-sysfs.c874 q->debugfs_dir = debugfs_create_dir(kobject_name(q->kobj.parent), in blk_register_queue()
/block/partitions/
Dcore.c373 pdev->parent = ddev; in add_partition()