Home
last modified time | relevance | path

Searched refs:l (Results 1 – 25 of 72) sorted by relevance

123

/fs/btrfs/
Dprint-tree.c168 static void print_uuid_item(struct extent_buffer *l, unsigned long offset, in print_uuid_item() argument
179 read_extent_buffer(l, &subvol_id, offset, sizeof(subvol_id)); in print_uuid_item()
198 void btrfs_print_leaf(struct extent_buffer *l) in btrfs_print_leaf() argument
215 if (!l) in btrfs_print_leaf()
218 fs_info = l->fs_info; in btrfs_print_leaf()
219 nr = btrfs_header_nritems(l); in btrfs_print_leaf()
223 btrfs_header_bytenr(l), btrfs_header_generation(l), nr, in btrfs_print_leaf()
224 btrfs_leaf_free_space(l), btrfs_header_owner(l)); in btrfs_print_leaf()
225 print_eb_refs_lock(l); in btrfs_print_leaf()
228 btrfs_item_key_to_cpu(l, &key, i); in btrfs_print_leaf()
[all …]
Dcheck-integrity.c287 const struct btrfsic_block_link *l);
289 const struct btrfsic_block_link *l);
373 static void btrfsic_block_link_init(struct btrfsic_block_link *l) in btrfsic_block_link_init() argument
375 l->magic_num = BTRFSIC_BLOCK_LINK_MAGIC_NUMBER; in btrfsic_block_link_init()
376 l->ref_cnt = 1; in btrfsic_block_link_init()
377 INIT_LIST_HEAD(&l->node_ref_to); in btrfsic_block_link_init()
378 INIT_LIST_HEAD(&l->node_ref_from); in btrfsic_block_link_init()
379 INIT_LIST_HEAD(&l->collision_resolving_node); in btrfsic_block_link_init()
380 l->block_ref_to = NULL; in btrfsic_block_link_init()
381 l->block_ref_from = NULL; in btrfsic_block_link_init()
[all …]
Droot-tree.c69 struct extent_buffer *l; in btrfs_find_root() local
88 l = path->nodes[0]; in btrfs_find_root()
91 btrfs_item_key_to_cpu(l, &found_key, slot); in btrfs_find_root()
99 btrfs_read_root_item(l, slot, root_item); in btrfs_find_root()
124 struct extent_buffer *l; in btrfs_update_root() local
148 l = path->nodes[0]; in btrfs_update_root()
150 ptr = btrfs_item_ptr_offset(l, slot); in btrfs_update_root()
151 old_len = btrfs_item_size_nr(l, slot); in btrfs_update_root()
179 l = path->nodes[0]; in btrfs_update_root()
181 ptr = btrfs_item_ptr_offset(l, slot); in btrfs_update_root()
[all …]
Dref-verify.c583 int l; in walk_up_tree() local
585 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree()
586 if (!path->nodes[l]) in walk_up_tree()
588 if (l) { in walk_up_tree()
589 path->slots[l]++; in walk_up_tree()
590 if (path->slots[l] < in walk_up_tree()
591 btrfs_header_nritems(path->nodes[l])) { in walk_up_tree()
592 *level = l; in walk_up_tree()
596 btrfs_tree_unlock_rw(path->nodes[l], path->locks[l]); in walk_up_tree()
597 free_extent_buffer(path->nodes[l]); in walk_up_tree()
[all …]
Dqgroup.c335 struct extent_buffer *l; in btrfs_read_qgroup_config() local
376 l = path->nodes[0]; in btrfs_read_qgroup_config()
377 btrfs_item_key_to_cpu(l, &found_key, slot); in btrfs_read_qgroup_config()
382 ptr = btrfs_item_ptr(l, slot, in btrfs_read_qgroup_config()
385 if (btrfs_qgroup_status_version(l, ptr) != in btrfs_read_qgroup_config()
391 if (btrfs_qgroup_status_generation(l, ptr) != in btrfs_read_qgroup_config()
397 fs_info->qgroup_flags = btrfs_qgroup_status_flags(l, in btrfs_read_qgroup_config()
399 rescan_progress = btrfs_qgroup_status_rescan(l, ptr); in btrfs_read_qgroup_config()
428 ptr = btrfs_item_ptr(l, slot, in btrfs_read_qgroup_config()
430 qgroup->rfer = btrfs_qgroup_info_rfer(l, ptr); in btrfs_read_qgroup_config()
[all …]
Dscrub.c2289 u32 l = min(sectorsize, len); in scrub_pages() local
2321 len -= l; in scrub_pages()
2322 logical += l; in scrub_pages()
2323 physical += l; in scrub_pages()
2324 physical_for_dev_replace += l; in scrub_pages()
2572 u32 l = min(len, blocksize); in scrub_extent() local
2581 ret = scrub_pages(sctx, logical, l, physical, dev, flags, gen, in scrub_extent()
2586 len -= l; in scrub_extent()
2587 logical += l; in scrub_extent()
2588 physical += l; in scrub_extent()
[all …]
Dctree.c2707 static int leaf_space_used(struct extent_buffer *l, int start, int nr) in leaf_space_used() argument
2712 int nritems = btrfs_header_nritems(l); in leaf_space_used()
2719 data_len = btrfs_item_offset(l, start_item) + in leaf_space_used()
2720 btrfs_item_size(l, start_item); in leaf_space_used()
2721 data_len = data_len - btrfs_item_offset(l, end_item); in leaf_space_used()
3216 struct extent_buffer *l, in copy_for_split() argument
3229 data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(l); in copy_for_split()
3231 copy_extent_buffer(right, l, btrfs_item_nr_offset(0), in copy_for_split()
3235 copy_extent_buffer(right, l, in copy_for_split()
3238 leaf_data_end(l), data_copy_size); in copy_for_split()
[all …]
/fs/ceph/
Dioctl.c20 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 …]
Dlocks.c418 int l = 0; in ceph_encode_locks_to_buffer() local
433 err = lock_to_ceph_filelock(lock, &flocks[l]); in ceph_encode_locks_to_buffer()
436 ++l; in ceph_encode_locks_to_buffer()
444 err = lock_to_ceph_filelock(lock, &flocks[l]); in ceph_encode_locks_to_buffer()
447 ++l; in ceph_encode_locks_to_buffer()
/fs/hfsplus/
Dbnode.c25 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/
Dnls_euc-jp.c17 #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 …]
Dnls_base.c57 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/nfsd/
Dfilecache.c353 struct nfsd_fcache_disposal *l) in nfsd_file_list_remove_disposal() argument
355 spin_lock(&l->lock); in nfsd_file_list_remove_disposal()
356 list_splice_init(&l->freeme, dst); in nfsd_file_list_remove_disposal()
357 spin_unlock(&l->lock); in nfsd_file_list_remove_disposal()
363 struct nfsd_fcache_disposal *l; in nfsd_file_list_add_disposal() local
366 list_for_each_entry_rcu(l, &laundrettes, list) { in nfsd_file_list_add_disposal()
367 if (l->net == net) { in nfsd_file_list_add_disposal()
368 spin_lock(&l->lock); in nfsd_file_list_add_disposal()
369 list_splice_tail_init(files, &l->freeme); in nfsd_file_list_add_disposal()
370 spin_unlock(&l->lock); in nfsd_file_list_add_disposal()
[all …]
/fs/hpfs/
Ddentry.c20 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()
Danode.c344 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/
Dxfs_rtalloc.h138 # define xfs_rtallocate_extent(t,b,min,max,l,f,p,rb) (ENOSYS) argument
139 # define xfs_rtfree_extent(t,b,l) (ENOSYS) argument
140 # define xfs_rtpick_extent(m,t,l,rb) (ENOSYS) argument
142 # define xfs_rtalloc_query_range(t,l,h,f,p) (ENOSYS) argument
146 # define xfs_rtalloc_extent_is_free(m,t,s,l,i) (ENOSYS) argument
Dxfs_rtalloc.c636 int l; /* level number (loop control) */ in xfs_rtallocate_extent_size() local
651 for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) { in xfs_rtallocate_extent_size()
659 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, in xfs_rtallocate_extent_size()
709 for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) { in xfs_rtallocate_extent_size()
718 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, in xfs_rtallocate_extent_size()
734 XFS_RTMAX(minlen, 1 << l), in xfs_rtallocate_extent_size()
735 XFS_RTMIN(maxlen, (1 << (l + 1)) - 1), in xfs_rtallocate_extent_size()
/fs/xfs/libxfs/
Dxfs_btree.c137 if (!uuid_equal(&block->bb_u.l.bb_uuid, &mp->m_sb.sb_meta_uuid)) in __xfs_btree_check_lblock()
139 if (block->bb_u.l.bb_blkno != in __xfs_btree_check_lblock()
142 if (block->bb_u.l.bb_pad != cpu_to_be32(0)) in __xfs_btree_check_lblock()
158 block->bb_u.l.bb_leftsib); in __xfs_btree_check_lblock()
161 block->bb_u.l.bb_rightsib); in __xfs_btree_check_lblock()
306 if (xfs_btree_check_lptr(cur, be64_to_cpu((&ptr->l)[index]), in xfs_btree_check_ptr()
351 block->bb_u.l.bb_lsn = cpu_to_be64(bip->bli_item.li_lsn); in xfs_btree_lblock_calc_crc()
363 if (!xfs_log_check_lsn(mp, be64_to_cpu(block->bb_u.l.bb_lsn))) in xfs_btree_lblock_verify_crc()
939 xfs_fsblock_t left = be64_to_cpu(block->bb_u.l.bb_leftsib); in xfs_btree_readahead_lblock()
940 xfs_fsblock_t right = be64_to_cpu(block->bb_u.l.bb_rightsib); in xfs_btree_readahead_lblock()
[all …]
Dxfs_bmap_btree.c141 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/
Dpartition.c158 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/
Dnamei.c114 unsigned l = strlen(symname)+1; in ufs_symlink() local
117 if (l > sb->s_blocksize) in ufs_symlink()
125 if (l > UFS_SB(sb)->s_uspi->s_maxsymlinklen) { in ufs_symlink()
130 err = page_symlink(inode, symname, l); in ufs_symlink()
137 memcpy(inode->i_link, symname, l); in ufs_symlink()
138 inode->i_size = l-1; in ufs_symlink()
/fs/ext2/
Dnamei.c162 unsigned l = strlen(symname)+1; in ext2_symlink() local
165 if (l > sb->s_blocksize) in ext2_symlink()
177 if (l > sizeof (EXT2_I(inode)->i_data)) { in ext2_symlink()
185 err = page_symlink(inode, symname, l); in ext2_symlink()
192 memcpy(inode->i_link, symname, l); in ext2_symlink()
193 inode->i_size = l-1; in ext2_symlink()
/fs/dlm/
Dmemory.h20 void dlm_free_lkb(struct dlm_lkb *l);
22 void dlm_free_lvb(char *l);
/fs/9p/
Dfid.c152 int i, n, l, clone, access; in v9fs_fid_lookup_with_uid() local
217 l = min(n - i, P9_MAXWELEM); in v9fs_fid_lookup_with_uid()
222 fid = p9_client_walk(fid, l, &wnames[i], clone); in v9fs_fid_lookup_with_uid()
232 i += l; in v9fs_fid_lookup_with_uid()
/fs/unicode/
Dmkutf8data.c1374 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 …]

123