| /fs/adfs/ |
| D | inode.c | 172 unsigned int high, low; in adfs_adfs2unix_time() local
184 low = ADFS_I(inode)->execaddr; /* bottom 32 bits of timestamp */ in adfs_adfs2unix_time()
189 nsec = (((s64) high << 32) | (s64) low) * 10000000; /* cs to ns */ in adfs_adfs2unix_time()
217 unsigned int high, low; in adfs_unix2adfs_time() local
221 low = (secs & 255) * 100; in adfs_unix2adfs_time()
222 high = (secs / 256) * 100 + (low >> 8) + 0x336e996a; in adfs_unix2adfs_time()
226 ADFS_I(inode)->execaddr = (low & 255) | (high << 8); in adfs_unix2adfs_time()
|
| /fs/xfs/ |
| D | xfs_dir2_block.c | 351 int low; /* low index for binary srch */ in xfs_dir2_block_addname() local
436 for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) { in xfs_dir2_block_addname()
437 mid = (low + high) >> 1; in xfs_dir2_block_addname()
441 low = mid + 1; in xfs_dir2_block_addname()
765 int low; /* binary search low index */ in xfs_dir2_block_lookup_int() local
787 for (low = 0, high = be32_to_cpu(btp->count) - 1; ; ) { in xfs_dir2_block_lookup_int()
788 ASSERT(low <= high); in xfs_dir2_block_lookup_int()
789 mid = (low + high) >> 1; in xfs_dir2_block_lookup_int()
793 low = mid + 1; in xfs_dir2_block_lookup_int()
796 if (low > high) { in xfs_dir2_block_lookup_int()
|
| D | xfs_inode.c | 3667 int low; /* lower boundary in search */ in xfs_iext_bno_to_ext() local
3676 low = 0; in xfs_iext_bno_to_ext()
3688 while (low <= high) { in xfs_iext_bno_to_ext()
3689 idx = (low + high) >> 1; in xfs_iext_bno_to_ext()
3696 low = idx + 1; in xfs_iext_bno_to_ext()
3737 int low; /* binary search lower limit */ in xfs_iext_bno_to_irec() local
3742 low = 0; in xfs_iext_bno_to_irec()
3744 while (low <= high) { in xfs_iext_bno_to_irec()
3745 erp_idx = (low + high) >> 1; in xfs_iext_bno_to_irec()
3752 low = erp_idx + 1; in xfs_iext_bno_to_irec()
[all …]
|
| D | xfs_dir2_leaf.c | 1966 int low; /* low leaf index */ in xfs_dir2_leaf_search_hash() local
1985 for (lep = ents, low = 0, high = leafhdr.count - 1, in xfs_dir2_leaf_search_hash()
1987 low <= high; ) { in xfs_dir2_leaf_search_hash()
1988 mid = (low + high) >> 1; in xfs_dir2_leaf_search_hash()
1992 low = mid + 1; in xfs_dir2_leaf_search_hash()
|
| D | xfs_btree.c | 1737 int low; /* low entry number */ in xfs_btree_lookup() local
1740 low = 1; in xfs_btree_lookup()
1753 while (low <= high) { in xfs_btree_lookup()
1760 keyno = (low + high) >> 1; in xfs_btree_lookup()
1774 low = keyno + 1; in xfs_btree_lookup()
|
| D | xfs_rtalloc.c | 809 int low, /* low log2 extent size */ in xfs_rtany_summary() argument
823 for (log = low; log <= high; log++) { in xfs_rtany_summary()
|
| /fs/isofs/ |
| D | rock.c | 372 int high, low; in parse_rock_ridge_inode_internal() local
374 low = isonum_733(rr->u.PN.dev_low); in parse_rock_ridge_inode_internal()
385 if ((low & ~0xff) && high == 0) { in parse_rock_ridge_inode_internal()
387 MKDEV(low >> 8, low & 0xff); in parse_rock_ridge_inode_internal()
390 MKDEV(high, low); in parse_rock_ridge_inode_internal()
|
| /fs/dlm/ |
| D | member.c | 536 int i, error, neg = 0, low = -1; in dlm_recover_members() local
578 if (low == -1 || memb->nodeid < low) in dlm_recover_members()
579 low = memb->nodeid; in dlm_recover_members()
581 ls->ls_low_nodeid = low; in dlm_recover_members()
|
| /fs/nilfs2/ |
| D | btree.c | 305 int index, low, high, s; in nilfs_btree_node_lookup() local
308 low = 0; in nilfs_btree_node_lookup()
312 while (low <= high) { in nilfs_btree_node_lookup()
313 index = (low + high) / 2; in nilfs_btree_node_lookup()
319 low = index + 1; in nilfs_btree_node_lookup()
|
| /fs/ocfs2/ |
| D | xattr.c | 1794 int low = 0, high = count - 1, tmp; in ocfs2_xa_bucket_add_entry() local
1801 while (low <= high && count) { in ocfs2_xa_bucket_add_entry()
1802 tmp = (low + high) / 2; in ocfs2_xa_bucket_add_entry()
1806 low = tmp + 1; in ocfs2_xa_bucket_add_entry()
1810 low = tmp; in ocfs2_xa_bucket_add_entry()
1815 if (low != count) in ocfs2_xa_bucket_add_entry()
1816 memmove(&xh->xh_entries[low + 1], in ocfs2_xa_bucket_add_entry()
1817 &xh->xh_entries[low], in ocfs2_xa_bucket_add_entry()
1818 ((count - low) * sizeof(struct ocfs2_xattr_entry))); in ocfs2_xa_bucket_add_entry()
1821 loc->xl_entry = &xh->xh_entries[low]; in ocfs2_xa_bucket_add_entry()
|
| /fs/ |
| D | read_write.c | 812 static inline loff_t pos_from_hilo(unsigned long high, unsigned long low) in pos_from_hilo() argument
815 return (((loff_t)high << HALF_LONG_BITS) << HALF_LONG_BITS) | low; in pos_from_hilo()
|
| /fs/squashfs/ |
| D | Kconfig | 17 embedded systems where low overhead is needed. Further information
|
| /fs/btrfs/ |
| D | ctree.c | 1633 int low = 0; in generic_bin_search() local
1645 while (low < high) { in generic_bin_search()
1646 mid = (low + high) / 2; in generic_bin_search()
1673 low = mid + 1; in generic_bin_search()
1681 *slot = low; in generic_bin_search()
|
| /fs/cifs/ |
| D | CHANGES | 546 to better handle low memory problems (and potential deadlocks).
564 allocation and low memory situations.
|