/fs/btrfs/ |
D | print-tree.c | 128 static void print_uuid_item(struct extent_buffer *l, unsigned long offset, in print_uuid_item() argument 139 read_extent_buffer(l, &subvol_id, offset, sizeof(subvol_id)); in print_uuid_item() 166 void btrfs_print_leaf(struct extent_buffer *l) in btrfs_print_leaf() argument 183 if (!l) in btrfs_print_leaf() 186 fs_info = l->fs_info; in btrfs_print_leaf() 187 nr = btrfs_header_nritems(l); in btrfs_print_leaf() 191 btrfs_header_bytenr(l), btrfs_header_generation(l), nr, in btrfs_print_leaf() 192 btrfs_leaf_free_space(l), btrfs_header_owner(l)); in btrfs_print_leaf() 193 print_eb_refs_lock(l); in btrfs_print_leaf() 196 btrfs_item_key_to_cpu(l, &key, i); in btrfs_print_leaf() [all …]
|
D | check-integrity.c | 271 struct btrfsic_block_link *l, 273 static void btrfsic_block_link_hashtable_remove(struct btrfsic_block_link *l); 343 const struct btrfsic_block_link *l); 345 const struct btrfsic_block_link *l); 429 static void btrfsic_block_link_init(struct btrfsic_block_link *l) in btrfsic_block_link_init() argument 431 l->magic_num = BTRFSIC_BLOCK_LINK_MAGIC_NUMBER; in btrfsic_block_link_init() 432 l->ref_cnt = 1; in btrfsic_block_link_init() 433 INIT_LIST_HEAD(&l->node_ref_to); in btrfsic_block_link_init() 434 INIT_LIST_HEAD(&l->node_ref_from); in btrfsic_block_link_init() 435 INIT_LIST_HEAD(&l->collision_resolving_node); in btrfsic_block_link_init() [all …]
|
D | root-tree.c | 71 struct extent_buffer *l; in btrfs_find_root() local 90 l = path->nodes[0]; in btrfs_find_root() 93 btrfs_item_key_to_cpu(l, &found_key, slot); in btrfs_find_root() 101 btrfs_read_root_item(l, slot, root_item); in btrfs_find_root() 126 struct extent_buffer *l; in btrfs_update_root() local 150 l = path->nodes[0]; in btrfs_update_root() 152 ptr = btrfs_item_ptr_offset(l, slot); in btrfs_update_root() 153 old_len = btrfs_item_size_nr(l, slot); in btrfs_update_root() 181 l = path->nodes[0]; in btrfs_update_root() 183 ptr = btrfs_item_ptr_offset(l, slot); in btrfs_update_root() [all …]
|
D | ref-verify.c | 593 int l; in walk_up_tree() local 595 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree() 596 if (!path->nodes[l]) in walk_up_tree() 598 if (l) { in walk_up_tree() 599 path->slots[l]++; in walk_up_tree() 600 if (path->slots[l] < in walk_up_tree() 601 btrfs_header_nritems(path->nodes[l])) { in walk_up_tree() 602 *level = l; in walk_up_tree() 606 btrfs_tree_unlock_rw(path->nodes[l], path->locks[l]); in walk_up_tree() 607 free_extent_buffer(path->nodes[l]); in walk_up_tree() [all …]
|
D | qgroup.c | 333 struct extent_buffer *l; in btrfs_read_qgroup_config() local 371 l = path->nodes[0]; in btrfs_read_qgroup_config() 372 btrfs_item_key_to_cpu(l, &found_key, slot); in btrfs_read_qgroup_config() 377 ptr = btrfs_item_ptr(l, slot, in btrfs_read_qgroup_config() 380 if (btrfs_qgroup_status_version(l, ptr) != in btrfs_read_qgroup_config() 386 if (btrfs_qgroup_status_generation(l, ptr) != in btrfs_read_qgroup_config() 392 fs_info->qgroup_flags = btrfs_qgroup_status_flags(l, in btrfs_read_qgroup_config() 394 rescan_progress = btrfs_qgroup_status_rescan(l, ptr); in btrfs_read_qgroup_config() 419 ptr = btrfs_item_ptr(l, slot, in btrfs_read_qgroup_config() 421 qgroup->rfer = btrfs_qgroup_info_rfer(l, ptr); in btrfs_read_qgroup_config() [all …]
|
D | scrub.c | 1814 u64 l = min_t(u64, len, PAGE_SIZE); in scrub_checksum_data() local 1816 crypto_shash_update(shash, buffer, l); in scrub_checksum_data() 1818 len -= l; in scrub_checksum_data() 1884 u64 l = min_t(u64, len, mapped_size); in scrub_checksum_tree_block() local 1886 crypto_shash_update(shash, p, l); in scrub_checksum_tree_block() 1888 len -= l; in scrub_checksum_tree_block() 1947 u64 l = min_t(u64, len, mapped_size); in scrub_checksum_super() local 1949 crypto_shash_update(shash, p, l); in scrub_checksum_super() 1951 len -= l; in scrub_checksum_super() 2245 u64 l = min_t(u64, len, PAGE_SIZE); in scrub_pages() local [all …]
|
/fs/ceph/ |
D | ioctl.c | 20 struct ceph_ioctl_layout l; in ceph_ioctl_get_layout() local 25 l.stripe_unit = ci->i_layout.stripe_unit; in ceph_ioctl_get_layout() 26 l.stripe_count = ci->i_layout.stripe_count; in ceph_ioctl_get_layout() 27 l.object_size = ci->i_layout.object_size; in ceph_ioctl_get_layout() 28 l.data_pool = ci->i_layout.pool_id; in ceph_ioctl_get_layout() 29 l.preferred_osd = -1; in ceph_ioctl_get_layout() 30 if (copy_to_user(arg, &l, sizeof(l))) in ceph_ioctl_get_layout() 38 struct ceph_ioctl_layout *l) in __validate_layout() argument 43 if ((l->object_size & ~PAGE_MASK) || in __validate_layout() 44 (l->stripe_unit & ~PAGE_MASK) || in __validate_layout() [all …]
|
D | locks.c | 398 int l = 0; in ceph_encode_locks_to_buffer() local 413 err = lock_to_ceph_filelock(lock, &flocks[l]); in ceph_encode_locks_to_buffer() 416 ++l; in ceph_encode_locks_to_buffer() 424 err = lock_to_ceph_filelock(lock, &flocks[l]); in ceph_encode_locks_to_buffer() 427 ++l; in ceph_encode_locks_to_buffer()
|
/fs/hfsplus/ |
D | bnode.c | 25 int l; in hfs_bnode_read() local 31 l = min_t(int, len, PAGE_SIZE - off); in hfs_bnode_read() 32 memcpy(buf, kmap(*pagep) + off, l); in hfs_bnode_read() 35 while ((len -= l) != 0) { in hfs_bnode_read() 36 buf += l; in hfs_bnode_read() 37 l = min_t(int, len, PAGE_SIZE); in hfs_bnode_read() 38 memcpy(buf, kmap(*++pagep), l); in hfs_bnode_read() 78 int l; in hfs_bnode_write() local 84 l = min_t(int, len, PAGE_SIZE - off); in hfs_bnode_write() 85 memcpy(kmap(*pagep) + off, buf, l); in hfs_bnode_write() [all …]
|
/fs/nls/ |
D | nls_euc-jp.c | 17 #define IS_SJIS_LOW_BYTE(l) ((0x40 <= (l)) && ((l) <= 0xFC) && ((l) != 0x7F)) argument 19 #define IS_SJIS_JISX0208(h, l) ((((0x81 <= (h)) && ((h) <= 0x9F)) \ argument 21 && IS_SJIS_LOW_BYTE(l)) 23 #define IS_SJIS_UDC_LOW(h, l) (((0xF0 <= (h)) && ((h) <= 0xF4)) \ argument 24 && IS_SJIS_LOW_BYTE(l)) 25 #define IS_SJIS_UDC_HI(h, l) (((0xF5 <= (h)) && ((h) <= 0xF9)) \ argument 26 && IS_SJIS_LOW_BYTE(l)) 27 #define IS_SJIS_IBM(h, l) (((0xFA <= (h)) && ((h) <= 0xFC)) \ argument 28 && IS_SJIS_LOW_BYTE(l)) 29 #define IS_SJIS_NECIBM(h, l) (((0xED <= (h)) && ((h) <= 0xEE)) \ argument [all …]
|
D | nls_base.c | 57 unsigned long l; in utf8_to_utf32() local 63 l = c0; in utf8_to_utf32() 67 l &= t->lmask; in utf8_to_utf32() 68 if (l < t->lval || l > UNICODE_MAX || in utf8_to_utf32() 69 (l & SURROGATE_MASK) == SURROGATE_PAIR) in utf8_to_utf32() 71 *pu = (unicode_t) l; in utf8_to_utf32() 80 l = (l << 6) | c; in utf8_to_utf32() 88 unsigned long l; in utf32_to_utf8() local 95 l = u; in utf32_to_utf8() 96 if (l > UNICODE_MAX || (l & SURROGATE_MASK) == SURROGATE_PAIR) in utf32_to_utf8() [all …]
|
/fs/hpfs/ |
D | dentry.c | 20 unsigned l = qstr->len; in hpfs_hash_dentry() local 22 if (l == 1) if (qstr->name[0]=='.') goto x; in hpfs_hash_dentry() 23 if (l == 2) if (qstr->name[0]=='.' || qstr->name[1]=='.') goto x; in hpfs_hash_dentry() 24 hpfs_adjust_length(qstr->name, &l); in hpfs_hash_dentry() 31 for (i = 0; i < l; i++) in hpfs_hash_dentry()
|
D | anode.c | 344 unsigned l; in hpfs_ea_read() local 353 l = 0x200 - (pos & 0x1ff); if (l > len) l = len; in hpfs_ea_read() 354 memcpy(buf, data + (pos & 0x1ff), l); in hpfs_ea_read() 356 buf += l; pos += l; len -= l; in hpfs_ea_read() 367 unsigned l; in hpfs_ea_write() local 376 l = 0x200 - (pos & 0x1ff); if (l > len) l = len; in hpfs_ea_write() 377 memcpy(data + (pos & 0x1ff), buf, l); in hpfs_ea_write() 380 buf += l; pos += l; len -= l; in hpfs_ea_write()
|
/fs/xfs/ |
D | xfs_rtalloc.h | 139 # define xfs_rtallocate_extent(t,b,min,max,l,f,p,rb) (ENOSYS) argument 140 # define xfs_rtfree_extent(t,b,l) (ENOSYS) argument 141 # define xfs_rtpick_extent(m,t,l,rb) (ENOSYS) argument 143 # define xfs_rtalloc_query_range(t,l,h,f,p) (ENOSYS) argument 147 # define xfs_rtalloc_extent_is_free(m,t,s,l,i) (ENOSYS) argument
|
D | xfs_rtalloc.c | 625 int l; /* level number (loop control) */ in xfs_rtallocate_extent_size() local 640 for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) { in xfs_rtallocate_extent_size() 648 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, in xfs_rtallocate_extent_size() 698 for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) { in xfs_rtallocate_extent_size() 707 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, in xfs_rtallocate_extent_size() 723 XFS_RTMAX(minlen, 1 << l), in xfs_rtallocate_extent_size() 724 XFS_RTMIN(maxlen, (1 << (l + 1)) - 1), in xfs_rtallocate_extent_size()
|
D | xfs_message.h | 60 extern void assfail(char *expr, char *f, int l); 61 extern void asswarn(char *expr, char *f, int l);
|
/fs/xfs/libxfs/ |
D | xfs_btree.c | 68 if (!uuid_equal(&block->bb_u.l.bb_uuid, &mp->m_sb.sb_meta_uuid)) in __xfs_btree_check_lblock() 70 if (block->bb_u.l.bb_blkno != in __xfs_btree_check_lblock() 73 if (block->bb_u.l.bb_pad != cpu_to_be32(0)) in __xfs_btree_check_lblock() 84 if (block->bb_u.l.bb_leftsib != cpu_to_be64(NULLFSBLOCK) && in __xfs_btree_check_lblock() 85 !xfs_btree_check_lptr(cur, be64_to_cpu(block->bb_u.l.bb_leftsib), in __xfs_btree_check_lblock() 88 if (block->bb_u.l.bb_rightsib != cpu_to_be64(NULLFSBLOCK) && in __xfs_btree_check_lblock() 89 !xfs_btree_check_lptr(cur, be64_to_cpu(block->bb_u.l.bb_rightsib), in __xfs_btree_check_lblock() 234 if (xfs_btree_check_lptr(cur, be64_to_cpu((&ptr->l)[index]), in xfs_btree_check_ptr() 279 block->bb_u.l.bb_lsn = cpu_to_be64(bip->bli_item.li_lsn); in xfs_btree_lblock_calc_crc() 291 if (!xfs_log_check_lsn(mp, be64_to_cpu(block->bb_u.l.bb_lsn))) in xfs_btree_lblock_verify_crc() [all …]
|
D | xfs_bmap_btree.c | 141 ASSERT(uuid_equal(&rblock->bb_u.l.bb_uuid, in xfs_bmbt_to_bmdr() 143 ASSERT(rblock->bb_u.l.bb_blkno == in xfs_bmbt_to_bmdr() 147 ASSERT(rblock->bb_u.l.bb_leftsib == cpu_to_be64(NULLFSBLOCK)); in xfs_bmbt_to_bmdr() 148 ASSERT(rblock->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK)); in xfs_bmbt_to_bmdr() 212 args.fsbno = be64_to_cpu(start->l); in xfs_bmbt_alloc_block() 268 new->l = cpu_to_be64(args.fsbno); in xfs_bmbt_alloc_block() 385 ptr->l = 0; in xfs_bmbt_init_ptr_from_cur()
|
/fs/udf/ |
D | partition.c | 158 int i, j, k, l; in udf_relocate_blocks() local 228 for (l = k; l < reallocationTableLen; l++) { in udf_relocate_blocks() 229 struct sparingEntry *entry = &st->mapEntry[l]; in udf_relocate_blocks() 241 mapEntry = st->mapEntry[l]; in udf_relocate_blocks() 246 (l - k) * in udf_relocate_blocks()
|
/fs/ufs/ |
D | namei.c | 112 unsigned l = strlen(symname)+1; in ufs_symlink() local 115 if (l > sb->s_blocksize) in ufs_symlink() 123 if (l > UFS_SB(sb)->s_uspi->s_maxsymlinklen) { in ufs_symlink() 128 err = page_symlink(inode, symname, l); in ufs_symlink() 135 memcpy(inode->i_link, symname, l); in ufs_symlink() 136 inode->i_size = l-1; in ufs_symlink()
|
/fs/ext2/ |
D | namei.c | 153 unsigned l = strlen(symname)+1; in ext2_symlink() local 156 if (l > sb->s_blocksize) in ext2_symlink() 168 if (l > sizeof (EXT2_I(inode)->i_data)) { in ext2_symlink() 176 err = page_symlink(inode, symname, l); in ext2_symlink() 183 memcpy(inode->i_link, symname, l); in ext2_symlink() 184 inode->i_size = l-1; in ext2_symlink()
|
/fs/9p/ |
D | fid.c | 106 int i, n, l, clone, access; in v9fs_fid_lookup_with_uid() local 166 l = min(n - i, P9_MAXWELEM); in v9fs_fid_lookup_with_uid() 171 fid = p9_client_walk(fid, l, &wnames[i], clone); in v9fs_fid_lookup_with_uid() 185 i += l; in v9fs_fid_lookup_with_uid()
|
/fs/dlm/ |
D | memory.h | 20 void dlm_free_lkb(struct dlm_lkb *l); 22 void dlm_free_lvb(char *l);
|
/fs/unicode/ |
D | mkutf8data.c | 1374 static int nfdi_equal(void *l, void *r) in nfdi_equal() argument 1376 struct unicode_data *left = l; in nfdi_equal() 1391 static int nfdicf_equal(void *l, void *r) in nfdicf_equal() argument 1393 struct unicode_data *left = l; in nfdicf_equal() 1415 static void nfdi_print(void *l, int indent) in nfdi_print() argument 1417 struct unicode_data *leaf = l; in nfdi_print() 1430 static void nfdicf_print(void *l, int indent) in nfdicf_print() argument 1432 struct unicode_data *leaf = l; in nfdicf_print() 1446 static int nfdi_mark(void *l) in nfdi_mark() argument 1451 static int nfdicf_mark(void *l) in nfdicf_mark() argument [all …]
|
/fs/ |
D | locks.c | 519 struct flock64 *l) in flock64_to_posix_lock() argument 521 switch (l->l_whence) { in flock64_to_posix_lock() 534 if (l->l_start > OFFSET_MAX - fl->fl_start) in flock64_to_posix_lock() 536 fl->fl_start += l->l_start; in flock64_to_posix_lock() 542 if (l->l_len > 0) { in flock64_to_posix_lock() 543 if (l->l_len - 1 > OFFSET_MAX - fl->fl_start) in flock64_to_posix_lock() 545 fl->fl_end = fl->fl_start + l->l_len - 1; in flock64_to_posix_lock() 547 } else if (l->l_len < 0) { in flock64_to_posix_lock() 548 if (fl->fl_start + l->l_len < 0) in flock64_to_posix_lock() 551 fl->fl_start += l->l_len; in flock64_to_posix_lock() [all …]
|