| /fs/ext4/ |
| D | extents.c | 187 int depth = path->p_depth; in ext4_ext_find_goal() local
207 ex = path[depth].p_ext; in ext4_ext_find_goal()
220 if (path[depth].p_bh) in ext4_ext_find_goal()
221 return path[depth].p_bh->b_blocknr; in ext4_ext_find_goal()
360 ext4_ext_max_entries(struct inode *inode, int depth) in ext4_ext_max_entries() argument
364 if (depth == ext_depth(inode)) { in ext4_ext_max_entries()
365 if (depth == 0) in ext4_ext_max_entries()
370 if (depth == 0) in ext4_ext_max_entries()
405 int depth) in ext4_valid_extent_entries() argument
413 if (depth == 0) { in ext4_valid_extent_entries()
[all …]
|
| D | indirect.c | 144 static Indirect *ext4_get_branch(struct inode *inode, int depth, in ext4_get_branch() argument
158 while (--depth) { in ext4_get_branch()
526 int depth; in ext4_ind_map_blocks() local
533 depth = ext4_block_to_path(inode, map->m_lblk, offsets, in ext4_ind_map_blocks()
536 if (depth == 0) in ext4_ind_map_blocks()
539 partial = ext4_get_branch(inode, depth, offsets, chain, &err); in ext4_ind_map_blocks()
543 first_block = le32_to_cpu(chain[depth - 1].key); in ext4_ind_map_blocks()
549 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext4_ind_map_blocks()
571 for (i = partial - chain + 1; i < depth; i++) in ext4_ind_map_blocks()
607 indirect_blks = (chain + depth) - partial - 1; in ext4_ind_map_blocks()
[all …]
|
| /fs/quota/ |
| D | quota_tree.c | 25 static int __get_index(struct qtree_mem_dqinfo *info, qid_t id, int depth) in __get_index() argument
29 depth = info->dqi_qtree_depth - depth - 1; in __get_index()
30 while (depth--) in __get_index()
35 static int get_index(struct qtree_mem_dqinfo *info, struct kqid qid, int depth) in get_index() argument
39 return __get_index(info, id, depth); in get_index()
298 uint *treeblk, int depth) in do_insert_tree() argument
323 newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in do_insert_tree()
326 if (depth == info->dqi_qtree_depth - 1) { in do_insert_tree()
332 dquot->dq_id, depth)])); in do_insert_tree()
339 ret = do_insert_tree(info, dquot, &newblk, depth+1); in do_insert_tree()
[all …]
|
| /fs/reiserfs/ |
| D | lock.c | 55 int depth; in reiserfs_write_unlock_nested() local
61 depth = sb_i->lock_depth; in reiserfs_write_unlock_nested()
67 return depth; in reiserfs_write_unlock_nested()
70 void reiserfs_write_lock_nested(struct super_block *s, int depth) in reiserfs_write_lock_nested() argument
75 if (depth == -1) in reiserfs_write_lock_nested()
80 sb_i->lock_depth = depth; in reiserfs_write_lock_nested()
|
| D | resize.c | 37 int depth; in reiserfs_resize() local
47 depth = reiserfs_write_unlock_nested(s); in reiserfs_resize()
49 reiserfs_write_lock_nested(s, depth); in reiserfs_resize()
142 int depth; in reiserfs_resize() local
147 depth = reiserfs_write_unlock_nested(s); in reiserfs_resize()
149 reiserfs_write_lock_nested(s, depth); in reiserfs_resize()
160 depth = reiserfs_write_unlock_nested(s); in reiserfs_resize()
162 reiserfs_write_lock_nested(s, depth); in reiserfs_resize()
|
| D | stree.c | 534 int depth = -1; in search_by_key_reada() local
553 if (depth == -1) in search_by_key_reada()
554 depth = reiserfs_write_unlock_nested(s); in search_by_key_reada()
559 return depth; in search_by_key_reada()
655 int depth = -1; in search_by_key() local
658 depth = search_by_key_reada(sb, reada_bh, in search_by_key()
661 if (!buffer_uptodate(bh) && depth == -1) in search_by_key()
662 depth = reiserfs_write_unlock_nested(sb); in search_by_key()
667 if (depth != -1) in search_by_key()
668 reiserfs_write_lock_nested(sb, depth); in search_by_key()
[all …]
|
| D | journal.c | 957 int depth; in reiserfs_async_progress_wait() local
959 depth = reiserfs_write_unlock_nested(s); in reiserfs_async_progress_wait()
961 reiserfs_write_lock_nested(s, depth); in reiserfs_async_progress_wait()
984 int depth; in flush_commit_list() local
1035 depth = reiserfs_write_unlock_nested(s); in flush_commit_list()
1040 reiserfs_write_lock_nested(s, depth); in flush_commit_list()
1060 depth = reiserfs_write_unlock_nested(s); in flush_commit_list()
1062 reiserfs_write_lock_nested(s, depth); in flush_commit_list()
1074 depth = reiserfs_write_unlock_nested(s); in flush_commit_list()
1076 reiserfs_write_lock_nested(s, depth); in flush_commit_list()
[all …]
|
| D | bitmap.c | 461 int depth = reiserfs_write_unlock_nested(s); in _reiserfs_free_block() local
463 reiserfs_write_lock_nested(s, depth); in _reiserfs_free_block()
1202 int depth; in blocknrs_and_prealloc_arrays_from_search_start() local
1212 depth = reiserfs_write_unlock_nested(s); in blocknrs_and_prealloc_arrays_from_search_start()
1216 reiserfs_write_lock_nested(s, depth); in blocknrs_and_prealloc_arrays_from_search_start()
1231 reiserfs_write_lock_nested(s, depth); in blocknrs_and_prealloc_arrays_from_search_start()
1261 depth = reiserfs_write_unlock_nested(s); in blocknrs_and_prealloc_arrays_from_search_start()
1265 reiserfs_write_lock_nested(s, depth); in blocknrs_and_prealloc_arrays_from_search_start()
1297 depth = reiserfs_write_unlock_nested(s); in blocknrs_and_prealloc_arrays_from_search_start()
1302 reiserfs_write_lock_nested(s, depth); in blocknrs_and_prealloc_arrays_from_search_start()
[all …]
|
| D | dir.c | 77 int depth; in reiserfs_readdir_inode() local
208 depth = reiserfs_write_unlock_nested(inode->i_sb); in reiserfs_readdir_inode()
212 reiserfs_write_lock_nested(inode->i_sb, depth); in reiserfs_readdir_inode()
218 reiserfs_write_lock_nested(inode->i_sb, depth); in reiserfs_readdir_inode()
|
| D | inode.c | 71 int depth = reiserfs_write_unlock_nested(inode->i_sb); in reiserfs_evict_inode() local
73 reiserfs_write_lock_nested(inode->i_sb, depth); in reiserfs_evict_inode()
1645 int depth; in reiserfs_iget() local
1649 depth = reiserfs_write_unlock_nested(s); in reiserfs_iget()
1653 reiserfs_write_lock_nested(s, depth); in reiserfs_iget()
1941 int depth; in reiserfs_new_inode() local
1945 depth = reiserfs_write_unlock_nested(sb); in reiserfs_new_inode()
1947 reiserfs_write_lock_nested(sb, depth); in reiserfs_new_inode()
1972 depth = reiserfs_write_unlock_nested(inode->i_sb); in reiserfs_new_inode()
1975 reiserfs_write_lock_nested(inode->i_sb, depth); in reiserfs_new_inode()
[all …]
|
| D | fix_node.c | 1112 int depth = reiserfs_write_unlock_nested(tb->tb_sb); in get_far_parent() local
1114 reiserfs_write_lock_nested(tb->tb_sb, depth); in get_far_parent()
2134 int depth = reiserfs_write_unlock_nested(tb->tb_sb); in get_direct_parent() local
2136 reiserfs_write_lock_nested(tb->tb_sb, depth); in get_direct_parent()
2162 int depth; in get_neighbors() local
2180 depth = reiserfs_write_unlock_nested(tb->tb_sb); in get_neighbors()
2182 reiserfs_write_lock_nested(tb->tb_sb, depth); in get_neighbors()
2220 depth = reiserfs_write_unlock_nested(tb->tb_sb); in get_neighbors()
2222 reiserfs_write_lock_nested(tb->tb_sb, depth); in get_neighbors()
2491 int depth; in wait_tb_buffers_until_unlocked() local
[all …]
|
| D | ioctl.c | 190 int depth = reiserfs_write_unlock_nested(inode->i_sb); in reiserfs_unpack() local
192 reiserfs_write_lock_nested(inode->i_sb, depth); in reiserfs_unpack()
|
| D | super.c | 285 int depth; in finish_unfinished() local
343 depth = reiserfs_write_unlock_nested(inode->i_sb); in finish_unfinished()
345 reiserfs_write_lock_nested(inode->i_sb, depth); in finish_unfinished()
2277 int depth; in reiserfs_write_dquot() local
2285 depth = reiserfs_write_unlock_nested(dquot->dq_sb); in reiserfs_write_dquot()
2287 reiserfs_write_lock_nested(dquot->dq_sb, depth); in reiserfs_write_dquot()
2300 int depth; in reiserfs_acquire_dquot() local
2308 depth = reiserfs_write_unlock_nested(dquot->dq_sb); in reiserfs_acquire_dquot()
2310 reiserfs_write_lock_nested(dquot->dq_sb, depth); in reiserfs_acquire_dquot()
2359 int depth; in reiserfs_write_info() local
[all …]
|
| /fs/minix/ |
| D | itree_common.c | 31 int depth, in get_branch() argument
45 while (--depth) { in get_branch()
154 int depth = block_to_path(inode, block, offsets); in get_block() local
156 if (depth == 0) in get_block()
160 partial = get_branch(inode, depth, offsets, chain, &err); in get_block()
165 map_bh(bh, inode->i_sb, block_to_cpu(chain[depth-1].key)); in get_block()
167 partial = chain+depth-1; /* the whole chain */ in get_block()
190 left = (chain + depth) - partial; in get_block()
218 int depth, in find_shared() argument
227 for (k = depth; k > 1 && !offsets[k-1]; k--) in find_shared()
[all …]
|
| /fs/configfs/ |
| D | symlink.c | 41 int depth = 0; in item_depth() local
42 do { depth++; } while ((p = p->ci_parent) && !configfs_is_root(p)); in item_depth()
43 return depth; in item_depth()
269 int depth, size; in configfs_get_target_path() local
271 depth = item_depth(item); in configfs_get_target_path()
272 size = item_path_length(target) + depth * 3 - 1; in configfs_get_target_path()
276 pr_debug("%s: depth = %d, size = %d\n", __func__, depth, size); in configfs_get_target_path()
278 for (s = path; depth--; s += 3) in configfs_get_target_path()
|
| D | inode.c | 155 int depth = sd->s_depth; in configfs_set_inode_lock_class() local
157 if (depth > 0) { in configfs_set_inode_lock_class()
158 if (depth <= ARRAY_SIZE(default_group_class)) { in configfs_set_inode_lock_class()
160 &default_group_class[depth - 1]); in configfs_set_inode_lock_class()
|
| /fs/sysv/ |
| D | itree.c | 89 int depth, in get_branch() argument
102 while (--depth) { in get_branch()
211 int depth = block_to_path(inode, iblock, offsets); in get_block() local
213 if (depth == 0) in get_block()
218 partial = get_branch(inode, depth, offsets, chain, &err); in get_block()
225 chain[depth-1].key)); in get_block()
227 partial = chain+depth-1; /* the whole chain */ in get_block()
250 left = (chain + depth) - partial; in get_block()
278 int depth, in find_shared() argument
287 for (k = depth; k > 1 && !offsets[k-1]; k--) in find_shared()
[all …]
|
| /fs/ext2/ |
| D | inode.c | 235 int depth, in ext2_get_branch() argument
249 while (--depth) { in ext2_get_branch()
633 int depth; in ext2_get_blocks() local
640 depth = ext2_block_to_path(inode,iblock,offsets,&blocks_to_boundary); in ext2_get_blocks()
642 if (depth == 0) in ext2_get_blocks()
645 partial = ext2_get_branch(inode, depth, offsets, chain, &err); in ext2_get_blocks()
648 first_block = le32_to_cpu(chain[depth - 1].key); in ext2_get_blocks()
654 if (!verify_chain(chain, chain + depth - 1)) { in ext2_get_blocks()
663 partial = chain + depth - 1; in ext2_get_blocks()
666 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext2_get_blocks()
[all …]
|
| /fs/ufs/ |
| D | inode.c | 123 static u64 ufs_frag_map(struct inode *inode, unsigned offsets[4], int depth) in ufs_frag_map() argument
139 if (depth == 0) in ufs_frag_map()
152 while (--depth) { in ufs_frag_map()
176 while (--depth) { in ufs_frag_map()
401 int depth = ufs_block_to_path(inode, fragment >> uspi->s_fpbshift, offsets); in ufs_getfrag_block() local
405 phys64 = ufs_frag_map(inode, offsets, depth); in ufs_getfrag_block()
424 if (unlikely(!depth)) { in ufs_getfrag_block()
440 if (depth == 1) { in ufs_getfrag_block()
447 for (i = 1; i < depth - 1; i++) in ufs_getfrag_block()
450 phys64 = ufs_inode_getblock(inode, phys64, offsets[depth - 1], in ufs_getfrag_block()
[all …]
|
| /fs/overlayfs/ |
| D | inode.c | 430 int depth = inode->i_sb->s_stack_depth - 1; in ovl_lockdep_annotate_inode_mutex_key() local
432 if (WARN_ON_ONCE(depth < 0 || depth >= OVL_MAX_NESTING)) in ovl_lockdep_annotate_inode_mutex_key()
433 depth = 0; in ovl_lockdep_annotate_inode_mutex_key()
436 lockdep_set_class(&inode->i_rwsem, &ovl_i_mutex_dir_key[depth]); in ovl_lockdep_annotate_inode_mutex_key()
438 lockdep_set_class(&inode->i_rwsem, &ovl_i_mutex_key[depth]); in ovl_lockdep_annotate_inode_mutex_key()
|
| /fs/sdcardfs/ |
| D | derived_perm.c | 288 static void __fixup_perms_recursive(struct dentry *dentry, struct limit_search *limit, int depth) in __fixup_perms_recursive() argument
298 WARN(depth > 3, "%s: Max expected depth exceeded!\n", __func__); in __fixup_perms_recursive()
299 spin_lock_nested(&dentry->d_lock, depth); in __fixup_perms_recursive()
308 spin_lock_nested(&child->d_lock, depth + 1); in __fixup_perms_recursive()
321 __fixup_perms_recursive(child, limit, depth + 1); in __fixup_perms_recursive()
|
| /fs/hfs/ |
| D | btree.c | 93 tree->depth = be16_to_cpu(head->depth); in hfs_btree_open()
181 head->depth = cpu_to_be16(tree->depth); in hfs_btree_write()
|
| D | btree.h | 34 unsigned int depth; member
141 __be16 depth; /* (V) The number of levels in this B-tree */ member
|
| /fs/hfsplus/ |
| D | btree.c | 177 tree->depth = be16_to_cpu(head->depth); in hfs_btree_open()
304 head->depth = cpu_to_be16(tree->depth); in hfs_btree_write()
|
| /fs/ocfs2/ |
| D | ocfs2_trace.h | 424 TP_PROTO(unsigned long long owner, int depth),
425 TP_ARGS(owner, depth),
428 __field(int, depth)
432 __entry->depth = depth;
434 TP_printk("%llu %d", __entry->owner, __entry->depth)
439 int depth),
440 TP_ARGS(subtree_root, blkno, depth),
444 __field(int, depth)
449 __entry->depth = depth;
452 __entry->blkno, __entry->depth)
[all …]
|