| /block/partitions/ |
| A D | check.h | 30 void *read_part_sector(struct parsed_partitions *state, sector_t n, Sector *p);
37 put_partition(struct parsed_partitions *p, int n, sector_t from, sector_t size) in put_partition() argument
39 if (n < p->limit) { in put_partition()
42 p->parts[n].from = from; in put_partition()
43 p->parts[n].size = size; in put_partition()
44 snprintf(tmp, sizeof(tmp), " %s%d", p->name, n); in put_partition()
|
| A D | aix.c | 170 struct lvname *n = NULL; in aix_partition() local
209 n = alloc_lvn(state, vgda_sector + vgda_len - 33); in aix_partition()
210 if (n) { in aix_partition()
260 n[lv_ix].name); in aix_partition()
270 char tmp[sizeof(n[i].name) + 1]; // null char in aix_partition()
272 snprintf(tmp, sizeof(tmp), "%s", n[i].name); in aix_partition()
279 kfree(n); in aix_partition()
|
| A D | msdos.c | 676 sector_t n = 2; in msdos_partition() local
678 n = min(size, max(sector_size, n)); in msdos_partition()
679 put_partition(state, slot, start, n); in msdos_partition()
702 int n; in msdos_partition() local
707 for (n = 0; subtypes[n].parse && id != subtypes[n].id; n++) in msdos_partition()
710 if (!subtypes[n].parse) in msdos_partition()
712 subtypes[n].parse(state, start_sect(p) * sector_size, in msdos_partition()
|
| A D | core.c | 712 void *read_part_sector(struct parsed_partitions *state, sector_t n, Sector *p) in read_part_sector() argument
717 if (n >= get_capacity(state->disk)) { in read_part_sector()
722 folio = read_mapping_folio(mapping, n >> PAGE_SECTORS_SHIFT, NULL); in read_part_sector()
727 return folio_address(folio) + offset_in_folio(folio, n * SECTOR_SIZE); in read_part_sector()
|
| A D | efi.c | 239 sector_t n = lba * in read_lba() local
248 unsigned char *data = read_part_sector(state, n++, §); in read_lba()
|
| /block/ |
| A D | genhd.c | 282 for (n = &major_names[index]; *n; n = &(*n)->next) { in __register_blkdev()
283 if ((*n)->major == major) in __register_blkdev()
286 if (!*n) in __register_blkdev()
287 *n = p; in __register_blkdev()
311 for (n = &major_names[index]; *n; n = &(*n)->next) in unregister_blkdev()
314 if (!*n || strcmp((*n)->name, name)) { in unregister_blkdev()
317 p = *n; in unregister_blkdev()
318 *n = p->next; in unregister_blkdev()
882 for (n = &major_names[major_to_index(major)]; *n; n = &(*n)->next) { in blk_probe_dev()
883 if ((*n)->major == major && (*n)->probe) { in blk_probe_dev()
[all …]
|
| A D | ioctl.c | 447 int ret, n; in blkdev_roset() local
452 if (get_user(n, (int __user *)arg)) in blkdev_roset()
455 ret = bdev->bd_disk->fops->set_read_only(bdev, n); in blkdev_roset()
459 if (n) in blkdev_roset()
539 int ret, n; in blkdev_bszset() local
545 if (get_user(n, argp)) in blkdev_bszset()
549 return set_blocksize(file, n); in blkdev_bszset()
554 ret = set_blocksize(excl_file, n); in blkdev_bszset()
|
| A D | elevator.c | 262 struct rb_node *n = root->rb_node; in elv_rb_find() local
265 while (n) { in elv_rb_find()
266 rq = rb_entry(n, struct request, rb_node); in elv_rb_find()
269 n = n->rb_left; in elv_rb_find()
271 n = n->rb_right; in elv_rb_find()
|
| A D | sed-opal.c | 893 int n) in response_get_token() argument
902 if (n >= resp->num) { in response_get_token()
904 n, resp->num); in response_get_token()
908 tok = &resp->toks[n]; in response_get_token()
1575 int n = *iter; in response_get_column() local
1586 n++; in response_get_column()
1590 n, column); in response_get_column()
1593 n++; in response_get_column()
1596 n++; in response_get_column()
1606 n++; in response_get_column()
[all …]
|
| A D | blk-crypto-sysfs.c | 69 struct attribute *attr, int n) in blk_crypto_is_visible() argument
105 struct attribute *attr, int n) in blk_crypto_mode_is_visible() argument
|
| A D | blk-throttle.c | 376 struct rb_node *n; in throtl_rb_first() local
378 n = rb_first_cached(&parent_sq->pending_tree); in throtl_rb_first()
379 WARN_ON_ONCE(!n); in throtl_rb_first()
380 if (!n) in throtl_rb_first()
382 return rb_entry_tg(n); in throtl_rb_first()
385 static void throtl_rb_erase(struct rb_node *n, in throtl_rb_erase() argument
388 rb_erase_cached(n, &parent_sq->pending_tree); in throtl_rb_erase()
389 RB_CLEAR_NODE(n); in throtl_rb_erase()
|
| A D | blk-flush.c | 206 struct request *rq, *n; in flush_end_io() local
245 list_for_each_entry_safe(rq, n, running, queuelist) { in flush_end_io()
|
| A D | bfq-iosched.c | 740 struct rb_node **n; in bfq_rq_pos_tree_lookup() local
750 n = &(*p)->rb_right; in bfq_rq_pos_tree_lookup()
752 n = &(*p)->rb_left; in bfq_rq_pos_tree_lookup()
755 p = n; in bfq_rq_pos_tree_lookup()
1212 struct hlist_node *n; in bfq_reset_burst_list() local
1239 struct hlist_node *n; in bfq_add_to_burst() local
1263 hlist_for_each_entry_safe(pos, n, &bfqd->burst_list, in bfq_add_to_burst()
5333 struct hlist_node *n; in bfq_put_queue() local
5394 hlist_for_each_entry_safe(item, n, &bfqq->woken_list, in bfq_put_queue()
7166 struct bfq_queue *bfqq, *n; in bfq_exit_queue() local
[all …]
|
| A D | blk-sysfs.c | 742 int n) in queue_attr_visible() argument
756 struct attribute *attr, int n) in blk_mq_queue_attr_visible() argument
|