| /fs/xfs/ |
| D | xfs_fsmap.c | 165 struct xfs_rmap_irec high; /* high rmap key */ member
411 error = xfs_fsmap_owner_to_rmap(&info->high, keys + 1); in xfs_getfsmap_logdev()
414 info->high.rm_startblock = -1U; in xfs_getfsmap_logdev()
415 info->high.rm_owner = ULLONG_MAX; in xfs_getfsmap_logdev()
416 info->high.rm_offset = ULLONG_MAX; in xfs_getfsmap_logdev()
417 info->high.rm_blockcount = 0; in xfs_getfsmap_logdev()
418 info->high.rm_flags = XFS_RMAP_KEY_FLAGS | XFS_RMAP_REC_FLAGS; in xfs_getfsmap_logdev()
422 trace_xfs_fsmap_high_key(mp, info->dev, info->agno, &info->high); in xfs_getfsmap_logdev()
492 info->high.rm_startblock = end_fsb; in __xfs_getfsmap_rtdev()
493 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
151 ret->high = __btrfs_alloc_workqueue(fs_info, name, flags, in btrfs_alloc_workqueue()
153 if (!ret->high) { in btrfs_alloc_workqueue()
367 if (test_bit(WORK_HIGH_PRIO_BIT, &work->flags) && wq->high) in btrfs_queue_work()
368 dest_wq = wq->high; in btrfs_queue_work()
386 if (wq->high) in btrfs_destroy_workqueue()
387 __btrfs_destroy_workqueue(wq->high); in btrfs_destroy_workqueue()
397 if (wq->high) in btrfs_workqueue_set_max()
398 wq->high->limit_active = limit_active; in btrfs_workqueue_set_max()
|
| /fs/adfs/ |
| D | inode.c | 169 unsigned int high, low; in adfs_adfs2unix_time() local
180 high = ADFS_I(inode)->loadaddr & 0xFF; /* top 8 bits of timestamp */ in adfs_adfs2unix_time()
186 nsec = (((s64) high << 32) | (s64) low) * 10000000; /* cs to ns */ in adfs_adfs2unix_time()
214 unsigned int high, low; in adfs_unix2adfs_time() local
219 high = (secs / 256) * 100 + (low >> 8) + 0x336e996a; in adfs_unix2adfs_time()
221 ADFS_I(inode)->loadaddr = (high >> 24) | in adfs_unix2adfs_time()
223 ADFS_I(inode)->execaddr = (low & 255) | (high << 8); in adfs_unix2adfs_time()
|
| /fs/xfs/libxfs/ |
| D | xfs_rmap.c | 236 struct xfs_rmap_irec high; member
255 if (rec->rm_owner != info->high.rm_owner) in xfs_rmap_find_left_neighbor_helper()
259 rec->rm_offset + rec->rm_blockcount - 1 != info->high.rm_offset) in xfs_rmap_find_left_neighbor_helper()
288 info.high.rm_startblock = bno - 1; in xfs_rmap_find_left_neighbor()
289 info.high.rm_owner = owner; in xfs_rmap_find_left_neighbor()
294 info.high.rm_offset = offset - 1; in xfs_rmap_find_left_neighbor()
296 info.high.rm_offset = 0; in xfs_rmap_find_left_neighbor()
297 info.high.rm_flags = flags; in xfs_rmap_find_left_neighbor()
298 info.high.rm_blockcount = 0; in xfs_rmap_find_left_neighbor()
305 error = xfs_rmap_query_range(cur, &info.high, &info.high, in xfs_rmap_find_left_neighbor()
[all …]
|
| D | xfs_dir2_block.c | 335 int high; /* high index for binary srch */ in xfs_dir2_block_addname() local
423 for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) { in xfs_dir2_block_addname()
424 mid = (low + high) >> 1; in xfs_dir2_block_addname()
430 high = mid - 1; in xfs_dir2_block_addname()
660 int high; /* binary search high index */ in xfs_dir2_block_lookup_int() local
683 for (low = 0, high = be32_to_cpu(btp->count) - 1; ; ) { in xfs_dir2_block_lookup_int()
684 ASSERT(low <= high); in xfs_dir2_block_lookup_int()
685 mid = (low + high) >> 1; in xfs_dir2_block_lookup_int()
691 high = mid - 1; in xfs_dir2_block_lookup_int()
692 if (low > high) { in xfs_dir2_block_lookup_int()
|
| D | xfs_refcount.c | 1616 union xfs_btree_irec high; in xfs_refcount_recover_cow_leftovers() local
1651 memset(&high, 0, sizeof(high)); in xfs_refcount_recover_cow_leftovers()
1653 high.rc.rc_startblock = -1U; in xfs_refcount_recover_cow_leftovers()
1654 error = xfs_btree_query_range(cur, &low, &high, in xfs_refcount_recover_cow_leftovers()
1709 union xfs_btree_irec high; in xfs_refcount_has_record() local
1713 memset(&high, 0xFF, sizeof(high)); in xfs_refcount_has_record()
1714 high.rc.rc_startblock = bno + len - 1; in xfs_refcount_has_record()
1716 return xfs_btree_has_record(cur, &low, &high, exists); in xfs_refcount_has_record()
|
| D | xfs_ialloc.h | 146 xfs_agino_t high, bool *exists);
|
| D | xfs_btree.c | 1901 int high; /* high entry number */ in xfs_btree_lookup() local
1906 high = xfs_btree_get_numrecs(block); in xfs_btree_lookup()
1907 if (!high) { in xfs_btree_lookup()
1923 while (low <= high) { in xfs_btree_lookup()
1930 keyno = (low + high) >> 1; in xfs_btree_lookup()
1946 high = keyno - 1; in xfs_btree_lookup()
2032 union xfs_btree_key *high; in xfs_btree_get_leaf_keys() local
2049 high = xfs_btree_high_key_from_key(cur, key); in xfs_btree_get_leaf_keys()
2050 memcpy(high, &max_hkey, cur->bc_ops->key_len / 2); in xfs_btree_get_leaf_keys()
2063 union xfs_btree_key *high; in xfs_btree_get_node_keys() local
[all …]
|
| D | xfs_dir2_leaf.c | 1502 int high; /* high leaf index */ in xfs_dir2_leaf_search_hash() local
1518 for (lep = ents, low = 0, high = leafhdr.count - 1, in xfs_dir2_leaf_search_hash()
1520 low <= high; ) { in xfs_dir2_leaf_search_hash()
1521 mid = (low + high) >> 1; in xfs_dir2_leaf_search_hash()
1527 high = mid - 1; in xfs_dir2_leaf_search_hash()
|
| D | xfs_ialloc.c | 2652 xfs_agino_t high, in xfs_ialloc_has_inode_record() argument
2666 if (error || irec.ir_startino > high) in xfs_ialloc_has_inode_record()
2676 agino <= high) { in xfs_ialloc_has_inode_record()
2696 xfs_agino_t high; in xfs_ialloc_has_inodes_at_extent() local
2699 high = XFS_AGB_TO_AGINO(cur->bc_mp, bno + len) - 1; in xfs_ialloc_has_inodes_at_extent()
2701 return xfs_ialloc_has_inode_record(cur, low, high, exists); in xfs_ialloc_has_inodes_at_extent()
|
| D | xfs_alloc.c | 3128 union xfs_btree_irec high; in xfs_alloc_has_record() local
3132 memset(&high, 0xFF, sizeof(high)); in xfs_alloc_has_record()
3133 high.a.ar_startblock = bno + len - 1; in xfs_alloc_has_record()
3135 return xfs_btree_has_record(cur, &low, &high, exists); in xfs_alloc_has_record()
|
| D | xfs_btree.h | 514 union xfs_btree_irec *high, bool *exists);
|
| /fs/xfs/scrub/ |
| D | refcount.c | 284 struct xfs_rmap_irec high; in xchk_refcountbt_xref_rmap() local
295 memset(&high, 0xFF, sizeof(high)); in xchk_refcountbt_xref_rmap()
296 high.rm_startblock = bno + len - 1; in xchk_refcountbt_xref_rmap()
299 error = xfs_rmap_query_range(sc->sa.rmap_cur, &low, &high, in xchk_refcountbt_xref_rmap()
|
| /fs/ |
| D | fs_parser.c | 316 int low, int high, int special) in validate_constant_table() argument
346 (tbl[i].value < low || tbl[i].value > high)) { in validate_constant_table()
348 i, tbl[i].name, tbl[i].value, low, high); in validate_constant_table()
|
| /fs/erofs/ |
| D | Kconfig | 10 high-performance read-only requirements, e.g. Android OS
15 compression ratios, which is more useful to achieve high
|
| /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 | 2503 static int grant_pending_convert(struct dlm_rsb *r, int high, int *cw, in grant_pending_convert() argument
2569 return max_t(int, high, hi); in grant_pending_convert()
2572 static int grant_pending_wait(struct dlm_rsb *r, int high, int *cw, in grant_pending_wait() argument
2583 high = max_t(int, lkb->lkb_rqmode, high); in grant_pending_wait()
2589 return high; in grant_pending_wait()
2597 static int lock_requires_bast(struct dlm_lkb *gr, int high, int cw) in lock_requires_bast() argument
2605 if (gr->lkb_highbast < high && in lock_requires_bast()
2606 !__dlm_compat_matrix[gr->lkb_grmode+1][high+1]) in lock_requires_bast()
2614 int high = DLM_LOCK_IV; in grant_pending_locks() local
2623 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/f2fs/ |
| D | Kconfig | 13 of wandering tree and high cleaning overhead.
|
| /fs/ext4/ |
| D | Kconfig | 49 allocation, persistent preallocation, high resolution time stamps,
|
| /fs/pstore/ |
| D | Kconfig | 45 This option enables LZ4HC (high compression) mode algorithm.
|
| /fs/nilfs2/ |
| D | btree.c | 294 int index, low, high, s; in nilfs_btree_node_lookup() local
298 high = nilfs_btree_node_get_nchildren(node) - 1; in nilfs_btree_node_lookup()
301 while (low <= high) { in nilfs_btree_node_lookup()
302 index = (low + high) / 2; in nilfs_btree_node_lookup()
311 high = index - 1; in nilfs_btree_node_lookup()
|