| /fs/xfs/ |
| D | xfs_fsmap.c | 165 struct xfs_rmap_irec high; /* high rmap key */ member
422 error = xfs_fsmap_owner_to_rmap(&info->high, keys + 1); in xfs_getfsmap_logdev()
425 info->high.rm_startblock = -1U; in xfs_getfsmap_logdev()
426 info->high.rm_owner = ULLONG_MAX; in xfs_getfsmap_logdev()
427 info->high.rm_offset = ULLONG_MAX; in xfs_getfsmap_logdev()
428 info->high.rm_blockcount = 0; in xfs_getfsmap_logdev()
429 info->high.rm_flags = XFS_RMAP_KEY_FLAGS | XFS_RMAP_REC_FLAGS; in xfs_getfsmap_logdev()
433 trace_xfs_fsmap_high_key(mp, info->dev, info->agno, &info->high); in xfs_getfsmap_logdev()
503 info->high.rm_startblock = end_fsb; in __xfs_getfsmap_rtdev()
504 error = xfs_fsmap_owner_to_rmap(&info->high, &keys[1]); in __xfs_getfsmap_rtdev()
[all …]
|
| D | xfs_rtalloc.c | 51 int high, /* high log2 extent size */ in xfs_rtany_summary() argument
68 for (log = low; log <= high; log++) { in xfs_rtany_summary()
|
| /fs/btrfs/ |
| D | async-thread.c | 53 struct __btrfs_workqueue *high; member
149 ret->high = __btrfs_alloc_workqueue(fs_info, name, flags, in btrfs_alloc_workqueue()
151 if (!ret->high) { in btrfs_alloc_workqueue()
374 if (test_bit(WORK_HIGH_PRIO_BIT, &work->flags) && wq->high) in btrfs_queue_work()
375 dest_wq = wq->high; in btrfs_queue_work()
393 if (wq->high) in btrfs_destroy_workqueue()
394 __btrfs_destroy_workqueue(wq->high); in btrfs_destroy_workqueue()
404 if (wq->high) in btrfs_workqueue_set_max()
405 wq->high->limit_active = limit_active; in btrfs_workqueue_set_max()
415 if (wq->high) in btrfs_flush_workqueue()
[all …]
|
| /fs/xfs/libxfs/ |
| D | xfs_rmap.c | 248 struct xfs_rmap_irec high; member
267 if (rec->rm_owner != info->high.rm_owner) in xfs_rmap_find_left_neighbor_helper()
271 rec->rm_offset + rec->rm_blockcount - 1 != info->high.rm_offset) in xfs_rmap_find_left_neighbor_helper()
300 info.high.rm_startblock = bno - 1; in xfs_rmap_find_left_neighbor()
301 info.high.rm_owner = owner; in xfs_rmap_find_left_neighbor()
306 info.high.rm_offset = offset - 1; in xfs_rmap_find_left_neighbor()
308 info.high.rm_offset = 0; in xfs_rmap_find_left_neighbor()
309 info.high.rm_flags = flags; in xfs_rmap_find_left_neighbor()
310 info.high.rm_blockcount = 0; in xfs_rmap_find_left_neighbor()
317 error = xfs_rmap_query_range(cur, &info.high, &info.high, in xfs_rmap_find_left_neighbor()
[all …]
|
| D | xfs_dir2_block.c | 364 int high; /* high index for binary srch */ in xfs_dir2_block_addname() local
452 for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) { in xfs_dir2_block_addname()
453 mid = (low + high) >> 1; in xfs_dir2_block_addname()
459 high = mid - 1; in xfs_dir2_block_addname()
689 int high; /* binary search high index */ in xfs_dir2_block_lookup_int() local
710 for (low = 0, high = be32_to_cpu(btp->count) - 1; ; ) { in xfs_dir2_block_lookup_int()
711 ASSERT(low <= high); in xfs_dir2_block_lookup_int()
712 mid = (low + high) >> 1; in xfs_dir2_block_lookup_int()
718 high = mid - 1; in xfs_dir2_block_lookup_int()
719 if (low > high) { in xfs_dir2_block_lookup_int()
|
| D | xfs_refcount.c | 1692 union xfs_btree_irec high; in xfs_refcount_recover_cow_leftovers() local
1723 memset(&high, 0, sizeof(high)); in xfs_refcount_recover_cow_leftovers()
1725 high.rc.rc_startblock = -1U; in xfs_refcount_recover_cow_leftovers()
1726 error = xfs_btree_query_range(cur, &low, &high, in xfs_refcount_recover_cow_leftovers()
1781 union xfs_btree_irec high; in xfs_refcount_has_record() local
1785 memset(&high, 0xFF, sizeof(high)); in xfs_refcount_has_record()
1786 high.rc.rc_startblock = bno + len - 1; in xfs_refcount_has_record()
1788 return xfs_btree_has_record(cur, &low, &high, exists); in xfs_refcount_has_record()
|
| D | xfs_btree.c | 1854 int high; /* high entry number */ in xfs_btree_lookup() local
1859 high = xfs_btree_get_numrecs(block); in xfs_btree_lookup()
1860 if (!high) { in xfs_btree_lookup()
1876 while (low <= high) { in xfs_btree_lookup()
1883 keyno = (low + high) >> 1; in xfs_btree_lookup()
1899 high = keyno - 1; in xfs_btree_lookup()
1986 union xfs_btree_key *high; in xfs_btree_get_leaf_keys() local
2003 high = xfs_btree_high_key_from_key(cur, key); in xfs_btree_get_leaf_keys()
2004 memcpy(high, &max_hkey, cur->bc_ops->key_len / 2); in xfs_btree_get_leaf_keys()
2017 union xfs_btree_key *high; in xfs_btree_get_node_keys() local
[all …]
|
| D | xfs_ialloc.h | 146 xfs_agino_t high, bool *exists);
|
| D | xfs_dir2_leaf.c | 1542 int high; /* high leaf index */ in xfs_dir2_leaf_search_hash() local
1554 for (lep = leafhdr.ents, low = 0, high = leafhdr.count - 1, in xfs_dir2_leaf_search_hash()
1556 low <= high; ) { in xfs_dir2_leaf_search_hash()
1557 mid = (low + high) >> 1; in xfs_dir2_leaf_search_hash()
1563 high = mid - 1; in xfs_dir2_leaf_search_hash()
|
| D | xfs_ialloc.c | 2693 xfs_agino_t high, in xfs_ialloc_has_inode_record() argument
2707 if (error || irec.ir_startino > high) in xfs_ialloc_has_inode_record()
2717 agino <= high) { in xfs_ialloc_has_inode_record()
2737 xfs_agino_t high; in xfs_ialloc_has_inodes_at_extent() local
2740 high = XFS_AGB_TO_AGINO(cur->bc_mp, bno + len) - 1; in xfs_ialloc_has_inodes_at_extent()
2742 return xfs_ialloc_has_inode_record(cur, low, high, exists); in xfs_ialloc_has_inodes_at_extent()
|
| D | xfs_alloc.c | 3390 union xfs_btree_irec high; in xfs_alloc_has_record() local
3394 memset(&high, 0xFF, sizeof(high)); in xfs_alloc_has_record()
3395 high.a.ar_startblock = bno + len - 1; in xfs_alloc_has_record()
3397 return xfs_btree_has_record(cur, &low, &high, exists); in xfs_alloc_has_record()
|
| D | xfs_btree.h | 512 union xfs_btree_irec *high, bool *exists);
|
| /fs/xfs/scrub/ |
| D | refcount.c | 282 struct xfs_rmap_irec high; in xchk_refcountbt_xref_rmap() local
293 memset(&high, 0xFF, sizeof(high)); in xchk_refcountbt_xref_rmap()
294 high.rm_startblock = bno + len - 1; in xchk_refcountbt_xref_rmap()
297 error = xfs_rmap_query_range(sc->sa.rmap_cur, &low, &high, in xchk_refcountbt_xref_rmap()
|
| /fs/erofs/ |
| D | Kconfig | 11 high-performance read-only requirements, e.g. Android OS
16 compression ratios, which is more useful to achieve high
89 bool "EROFS high priority per-CPU kthread workers"
|
| /fs/ |
| D | fs_parser.c | 321 int low, int high, int special) in validate_constant_table() argument
351 (tbl[i].value < low || tbl[i].value > high)) { in validate_constant_table()
353 i, tbl[i].name, tbl[i].value, low, high); in validate_constant_table()
|
| /fs/adfs/ |
| D | inode.c | 172 unsigned int high, low; in adfs_adfs2unix_time() local
181 high = ADFS_I(inode)->loadaddr & 0xFF; /* top 8 bits of timestamp */ in adfs_adfs2unix_time()
187 nsec = (((s64) high << 32) | (s64) low) * 10000000; /* cs to ns */ in adfs_adfs2unix_time()
|
| /fs/orangefs/ |
| D | Kconfig | 6 Orange is a parallel file system designed for use on high end
|
| /fs/isofs/ |
| D | rock.c | 393 int high, low; in parse_rock_ridge_inode_internal() local
394 high = isonum_733(rr->u.PN.dev_high); in parse_rock_ridge_inode_internal()
406 if ((low & ~0xff) && high == 0) { in parse_rock_ridge_inode_internal()
411 MKDEV(high, low); in parse_rock_ridge_inode_internal()
|
| /fs/dlm/ |
| D | lock.c | 2506 static int grant_pending_convert(struct dlm_rsb *r, int high, int *cw, in grant_pending_convert() argument
2572 return max_t(int, high, hi); in grant_pending_convert()
2575 static int grant_pending_wait(struct dlm_rsb *r, int high, int *cw, in grant_pending_wait() argument
2586 high = max_t(int, lkb->lkb_rqmode, high); in grant_pending_wait()
2592 return high; in grant_pending_wait()
2600 static int lock_requires_bast(struct dlm_lkb *gr, int high, int cw) in lock_requires_bast() argument
2608 if (gr->lkb_highbast < high && in lock_requires_bast()
2609 !__dlm_compat_matrix[gr->lkb_grmode+1][high+1]) in lock_requires_bast()
2617 int high = DLM_LOCK_IV; in grant_pending_locks() local
2626 high = grant_pending_convert(r, high, &cw, count); in grant_pending_locks()
[all …]
|
| /fs/ceph/ |
| D | Kconfig | 13 scalable file system designed to provide high performance,
|
| /fs/squashfs/ |
| D | Kconfig | 132 of zlib are too high.
147 of zlib are too high.
|
| /fs/ext4/ |
| D | Kconfig | 44 allocation, persistent preallocation, high resolution time stamps,
|
| /fs/f2fs/ |
| D | Kconfig | 21 of wandering tree and high cleaning overhead.
|
| /fs/nilfs2/ |
| D | btree.c | 295 int index, low, high, s; in nilfs_btree_node_lookup() local
299 high = nilfs_btree_node_get_nchildren(node) - 1; in nilfs_btree_node_lookup()
302 while (low <= high) { in nilfs_btree_node_lookup()
303 index = (low + high) / 2; in nilfs_btree_node_lookup()
312 high = index - 1; in nilfs_btree_node_lookup()
|
| /fs/overlayfs/ |
| D | Kconfig | 99 unused high bits in undelying filesystem inode numbers to map all
|