| /fs/xfs/ |
| D | xfs_fsmap.c | 164 struct xfs_rmap_irec low; /* low rmap key */ member
263 if (xfs_rmap_compare(rec, &info->low) < 0) { in xfs_getfsmap_helper()
414 info->low.rm_startblock = XFS_BB_TO_FSBT(mp, keys[0].fmr_physical); in xfs_getfsmap_logdev()
415 info->low.rm_offset = XFS_BB_TO_FSBT(mp, keys[0].fmr_offset); in xfs_getfsmap_logdev()
416 error = xfs_fsmap_owner_to_rmap(&info->low, keys); in xfs_getfsmap_logdev()
419 info->low.rm_blockcount = 0; in xfs_getfsmap_logdev()
420 xfs_getfsmap_set_irec_flags(&info->low, &keys[0]); in xfs_getfsmap_logdev()
432 trace_xfs_fsmap_low_key(mp, info->dev, info->agno, &info->low); in xfs_getfsmap_logdev()
495 info->low.rm_startblock = start_fsb; in __xfs_getfsmap_rtdev()
496 error = xfs_fsmap_owner_to_rmap(&info->low, &keys[0]); in __xfs_getfsmap_rtdev()
[all …]
|
| D | xfs_rtalloc.c | 50 int low, /* low log2 extent size */ in xfs_rtany_summary() argument
62 if (mp->m_rsum_cache && low < mp->m_rsum_cache[bbno]) in xfs_rtany_summary()
63 low = mp->m_rsum_cache[bbno]; in xfs_rtany_summary()
68 for (log = low; log <= high; log++) { in xfs_rtany_summary()
|
| /fs/xfs/scrub/ |
| D | refcount.c | 281 struct xfs_rmap_irec low; in xchk_refcountbt_xref_rmap() local
291 memset(&low, 0, sizeof(low)); in xchk_refcountbt_xref_rmap()
292 low.rm_startblock = bno; in xchk_refcountbt_xref_rmap()
297 error = xfs_rmap_query_range(sc->sa.rmap_cur, &low, &high, in xchk_refcountbt_xref_rmap()
|
| /fs/xfs/libxfs/ |
| D | xfs_dir2_block.c | 369 int low; /* low 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()
457 low = mid + 1; in xfs_dir2_block_addname()
690 int low; /* binary search low 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()
716 low = mid + 1; in xfs_dir2_block_lookup_int()
719 if (low > high) { in xfs_dir2_block_lookup_int()
|
| D | xfs_refcount.c | 1691 union xfs_btree_irec low; in xfs_refcount_recover_cow_leftovers() local
1722 memset(&low, 0, sizeof(low)); in xfs_refcount_recover_cow_leftovers()
1724 low.rc.rc_startblock = XFS_REFC_COW_START; in xfs_refcount_recover_cow_leftovers()
1726 error = xfs_btree_query_range(cur, &low, &high, in xfs_refcount_recover_cow_leftovers()
1780 union xfs_btree_irec low; in xfs_refcount_has_record() local
1783 memset(&low, 0, sizeof(low)); in xfs_refcount_has_record()
1784 low.rc.rc_startblock = bno; in xfs_refcount_has_record()
1788 return xfs_btree_has_record(cur, &low, &high, exists); in xfs_refcount_has_record()
|
| D | xfs_ialloc.h | 145 int xfs_ialloc_has_inode_record(struct xfs_btree_cur *cur, xfs_agino_t low,
|
| D | xfs_rmap.c | 2643 union xfs_btree_irec low; in xfs_rmap_has_record() local
2646 memset(&low, 0, sizeof(low)); in xfs_rmap_has_record()
2647 low.r.rm_startblock = bno; in xfs_rmap_has_record()
2651 return xfs_btree_has_record(cur, &low, &high, exists); in xfs_rmap_has_record()
2735 struct xfs_rmap_irec low = {0}; in xfs_rmap_has_other_keys() local
2743 low.rm_startblock = bno; in xfs_rmap_has_other_keys()
2747 error = xfs_rmap_query_range(cur, &low, &high, in xfs_rmap_has_other_keys()
|
| D | xfs_dir2_leaf.c | 1543 int low; /* low 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()
1561 low = mid + 1; in xfs_dir2_leaf_search_hash()
|
| D | xfs_ialloc.c | 2692 xfs_agino_t low, in xfs_ialloc_has_inode_record() argument
2704 error = xfs_inobt_lookup(cur, low, XFS_LOOKUP_LE, &has_record); in xfs_ialloc_has_inode_record()
2716 if (agino + XFS_INODES_PER_HOLEMASK_BIT > low && in xfs_ialloc_has_inode_record()
2736 xfs_agino_t low; in xfs_ialloc_has_inodes_at_extent() local
2739 low = XFS_AGB_TO_AGINO(cur->bc_mp, bno); 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 | 3389 union xfs_btree_irec low; in xfs_alloc_has_record() local
3392 memset(&low, 0, sizeof(low)); in xfs_alloc_has_record()
3393 low.a.ar_startblock = bno; in xfs_alloc_has_record()
3397 return xfs_btree_has_record(cur, &low, &high, exists); in xfs_alloc_has_record()
|
| D | xfs_btree.c | 1855 int low; /* low entry number */ in xfs_btree_lookup() local
1858 low = 1; in xfs_btree_lookup()
1876 while (low <= high) { in xfs_btree_lookup()
1883 keyno = (low + high) >> 1; in xfs_btree_lookup()
1897 low = keyno + 1; in xfs_btree_lookup()
4895 union xfs_btree_irec *low, in xfs_btree_has_record() argument
4901 error = xfs_btree_query_range(cur, low, high, in xfs_btree_has_record()
|
| D | xfs_btree.h | 511 int xfs_btree_has_record(struct xfs_btree_cur *cur, union xfs_btree_irec *low,
|
| /fs/isofs/ |
| D | rock.c | 393 int high, low; in parse_rock_ridge_inode_internal() local
395 low = isonum_733(rr->u.PN.dev_low); in parse_rock_ridge_inode_internal()
406 if ((low & ~0xff) && high == 0) { in parse_rock_ridge_inode_internal()
408 MKDEV(low >> 8, low & 0xff); in parse_rock_ridge_inode_internal()
411 MKDEV(high, low); in parse_rock_ridge_inode_internal()
|
| /fs/dlm/ |
| D | member.c | 528 int i, error, neg = 0, low = -1; in dlm_recover_members() local
570 if (low == -1 || memb->nodeid < low) in dlm_recover_members()
571 low = memb->nodeid; in dlm_recover_members()
573 ls->ls_low_nodeid = low; in dlm_recover_members()
|
| /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()
|
| D | read_write.c | 994 static inline loff_t pos_from_hilo(unsigned long high, unsigned long low) in pos_from_hilo() argument
997 return (((loff_t)high << HALF_LONG_BITS) << HALF_LONG_BITS) | low; in pos_from_hilo()
|
| /fs/adfs/ |
| D | inode.c | 172 unsigned int high, low; in adfs_adfs2unix_time() local
182 low = ADFS_I(inode)->execaddr; /* bottom 32 bits of timestamp */ in adfs_adfs2unix_time()
187 nsec = (((s64) high << 32) | (s64) low) * 10000000; /* cs to ns */ in adfs_adfs2unix_time()
|
| /fs/cramfs/ |
| D | Kconfig | 20 purpose to remain small and low on RAM usage. It is most suitable
|
| /fs/erofs/ |
| D | Kconfig | 84 async decompression for low latencies on some architectures.
|
| /fs/nilfs2/ |
| D | btree.c | 295 int index, low, high, s; in nilfs_btree_node_lookup() local
298 low = 0; in nilfs_btree_node_lookup()
302 while (low <= high) { in nilfs_btree_node_lookup()
303 index = (low + high) / 2; in nilfs_btree_node_lookup()
309 low = index + 1; in nilfs_btree_node_lookup()
|
| /fs/ocfs2/ |
| D | xattr.c | 1815 int low = 0, high = count - 1, tmp; in ocfs2_xa_bucket_add_entry() local
1822 while (low <= high && count) { in ocfs2_xa_bucket_add_entry()
1823 tmp = (low + high) / 2; in ocfs2_xa_bucket_add_entry()
1827 low = tmp + 1; in ocfs2_xa_bucket_add_entry()
1831 low = tmp; in ocfs2_xa_bucket_add_entry()
1836 if (low != count) in ocfs2_xa_bucket_add_entry()
1837 memmove(&xh->xh_entries[low + 1], in ocfs2_xa_bucket_add_entry()
1838 &xh->xh_entries[low], in ocfs2_xa_bucket_add_entry()
1839 ((count - low) * sizeof(struct ocfs2_xattr_entry))); in ocfs2_xa_bucket_add_entry()
1842 loc->xl_entry = &xh->xh_entries[low]; in ocfs2_xa_bucket_add_entry()
|
| /fs/btrfs/ |
| D | ctree.c | 1726 int low = 0; in generic_bin_search() local
1731 if (low > high) { in generic_bin_search()
1734 __func__, low, high, eb->start, in generic_bin_search()
1739 while (low < high) { in generic_bin_search()
1746 mid = (low + high) / 2; in generic_bin_search()
1763 low = mid + 1; in generic_bin_search()
1771 *slot = low; in generic_bin_search()
|
| /fs/squashfs/ |
| D | Kconfig | 18 embedded systems where low overhead is needed. Further information
|