/fs/xfs/ |
D | xfs_btree_trace.c | 33 __psunsigned_t *low) in xfs_btree_trace_ptr() argument 38 *low = (int)val; in xfs_btree_trace_ptr() 41 *low = be32_to_cpu(ptr.s); in xfs_btree_trace_ptr() 126 __psunsigned_t high, low; in xfs_btree_trace_argipk() local 129 xfs_btree_trace_ptr(cur, ptr, &high, &low); in xfs_btree_trace_argipk() 132 line, i, high, low, in xfs_btree_trace_argipk() 150 __psunsigned_t high, low; in xfs_btree_trace_argipr() local 153 xfs_btree_trace_ptr(cur, ptr, &high, &low); in xfs_btree_trace_argipr() 157 high, low, in xfs_btree_trace_argipr()
|
D | xfs_dir2_block.c | 88 int low; /* low index for binary srch */ in xfs_dir2_block_addname() local 301 for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) { in xfs_dir2_block_addname() 302 mid = (low + high) >> 1; in xfs_dir2_block_addname() 306 low = mid + 1; in xfs_dir2_block_addname() 644 int low; /* binary search low index */ in xfs_dir2_block_lookup_int() local 669 for (low = 0, high = be32_to_cpu(btp->count) - 1; ; ) { in xfs_dir2_block_lookup_int() 670 ASSERT(low <= high); in xfs_dir2_block_lookup_int() 671 mid = (low + high) >> 1; in xfs_dir2_block_lookup_int() 675 low = mid + 1; in xfs_dir2_block_lookup_int() 678 if (low > high) { in xfs_dir2_block_lookup_int()
|
D | xfs_inode.c | 3922 int low; /* lower boundary in search */ in xfs_iext_bno_to_ext() local 3931 low = 0; in xfs_iext_bno_to_ext() 3943 while (low <= high) { in xfs_iext_bno_to_ext() 3944 idx = (low + high) >> 1; in xfs_iext_bno_to_ext() 3951 low = idx + 1; in xfs_iext_bno_to_ext() 3992 int low; /* binary search lower limit */ in xfs_iext_bno_to_irec() local 3997 low = 0; in xfs_iext_bno_to_irec() 3999 while (low <= high) { in xfs_iext_bno_to_irec() 4000 erp_idx = (low + high) >> 1; in xfs_iext_bno_to_irec() 4007 low = erp_idx + 1; in xfs_iext_bno_to_irec() [all …]
|
D | xfs_bmap.h | 133 char low; /* low on space, using seq'l ags */ member
|
D | xfs_dir2_leaf.c | 1645 int low; /* low leaf index */ in xfs_dir2_leaf_search_hash() local 1659 for (lep = leaf->ents, low = 0, high = be16_to_cpu(leaf->hdr.count) - 1, in xfs_dir2_leaf_search_hash() 1661 low <= high; ) { in xfs_dir2_leaf_search_hash() 1662 mid = (low + high) >> 1; in xfs_dir2_leaf_search_hash() 1666 low = mid + 1; in xfs_dir2_leaf_search_hash()
|
D | xfs_btree.c | 1604 int low; /* low entry number */ in xfs_btree_lookup() local 1607 low = 1; in xfs_btree_lookup() 1620 while (low <= high) { in xfs_btree_lookup() 1627 keyno = (low + high) >> 1; in xfs_btree_lookup() 1641 low = keyno + 1; in xfs_btree_lookup()
|
D | xfs_filestream.c | 713 (ap->low ? XFS_PICK_LOWSPACE : 0); in xfs_filestream_new_ag()
|
D | xfs_rtalloc.c | 816 int low, /* low log2 extent size */ in xfs_rtany_summary() argument 830 for (log = low; log <= high; log++) { in xfs_rtany_summary()
|
D | xfs_bmap.c | 2870 } else if (ap->low) { in xfs_bmap_btalloc() 2903 if (!ap->low && ap->aeof) { in xfs_bmap_btalloc() 2991 ap->low = 1; in xfs_bmap_btalloc() 2996 (ap->low && fb_agno < args.agno)); in xfs_bmap_btalloc() 5063 bma.low = flist->xbf_low; in xfs_bmapi() 5087 if ((flist->xbf_low = bma.low)) in xfs_bmapi()
|
/fs/adfs/ |
D | inode.c | 189 unsigned int high, low; in adfs_adfs2unix_time() local 195 low = ADFS_I(inode)->execaddr; in adfs_adfs2unix_time() 197 high |= low >> 8; in adfs_adfs2unix_time() 198 low &= 255; in adfs_adfs2unix_time() 212 tv->tv_sec = (((high % 100) << 8) + low) / 100 + (high / 100 << 8); in adfs_adfs2unix_time() 237 unsigned int high, low; in adfs_unix2adfs_time() local 241 low = (secs & 255) * 100; in adfs_unix2adfs_time() 242 high = (secs / 256) * 100 + (low >> 8) + 0x336e996a; in adfs_unix2adfs_time() 246 ADFS_I(inode)->execaddr = (low & 255) | (high << 8); in adfs_unix2adfs_time()
|
/fs/dlm/ |
D | member.c | 185 int i, error, found, pos = 0, neg = 0, low = -1; in dlm_recover_members() local 241 if (low == -1 || memb->nodeid < low) in dlm_recover_members() 242 low = memb->nodeid; in dlm_recover_members() 244 ls->ls_low_nodeid = low; in dlm_recover_members()
|
/fs/isofs/ |
D | rock.c | 373 int high, low; in parse_rock_ridge_inode_internal() local 375 low = isonum_733(rr->u.PN.dev_low); in parse_rock_ridge_inode_internal() 386 if ((low & ~0xff) && high == 0) { in parse_rock_ridge_inode_internal() 388 MKDEV(low >> 8, low & 0xff); in parse_rock_ridge_inode_internal() 391 MKDEV(high, low); in parse_rock_ridge_inode_internal()
|
/fs/squashfs/ |
D | Kconfig | 18 embedded systems where low overhead is needed. Further information
|
/fs/ocfs2/ |
D | xattr.c | 4597 int low = 0, high = count - 1, tmp; in ocfs2_xattr_set_entry_normal() local 4600 while (low <= high && count) { in ocfs2_xattr_set_entry_normal() 4601 tmp = (low + high) / 2; in ocfs2_xattr_set_entry_normal() 4605 low = tmp + 1; in ocfs2_xattr_set_entry_normal() 4610 low = tmp; in ocfs2_xattr_set_entry_normal() 4615 xe = &xh->xh_entries[low]; in ocfs2_xattr_set_entry_normal() 4616 if (low != count) in ocfs2_xattr_set_entry_normal()
|
/fs/btrfs/ |
D | ctree.c | 786 int low = 0; in generic_bin_search() local 799 while (low < high) { in generic_bin_search() 800 mid = (low + high) / 2; in generic_bin_search() 832 low = mid + 1; in generic_bin_search() 842 *slot = low; in generic_bin_search()
|
/fs/cifs/ |
D | CHANGES | 482 to better handle low memory problems (and potential deadlocks). 500 allocation and low memory situations.
|