Home
last modified time | relevance | path

Searched refs:depth (Results 1 – 25 of 46) sorted by relevance

12

/fs/ext4/
Dextents.c181 int depth = path->p_depth; in ext4_ext_find_goal() local
201 ex = path[depth].p_ext; in ext4_ext_find_goal()
214 if (path[depth].p_bh) in ext4_ext_find_goal()
215 return path[depth].p_bh->b_blocknr; in ext4_ext_find_goal()
354 ext4_ext_max_entries(struct inode *inode, int depth) in ext4_ext_max_entries() argument
358 if (depth == ext_depth(inode)) { in ext4_ext_max_entries()
359 if (depth == 0) in ext4_ext_max_entries()
364 if (depth == 0) in ext4_ext_max_entries()
399 int depth) in ext4_valid_extent_entries() argument
407 if (depth == 0) { in ext4_valid_extent_entries()
[all …]
Dindirect.c142 static Indirect *ext4_get_branch(struct inode *inode, int depth, in ext4_get_branch() argument
156 while (--depth) { in ext4_get_branch()
524 int depth; in ext4_ind_map_blocks() local
531 depth = ext4_block_to_path(inode, map->m_lblk, offsets, in ext4_ind_map_blocks()
534 if (depth == 0) in ext4_ind_map_blocks()
537 partial = ext4_get_branch(inode, depth, offsets, chain, &err); in ext4_ind_map_blocks()
541 first_block = le32_to_cpu(chain[depth - 1].key); in ext4_ind_map_blocks()
547 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext4_ind_map_blocks()
583 indirect_blks = (chain + depth) - partial - 1; in ext4_ind_map_blocks()
616 map->m_pblk = le32_to_cpu(chain[depth-1].key); in ext4_ind_map_blocks()
[all …]
/fs/reiserfs/
Dlock.c54 int depth; in reiserfs_write_unlock_nested() local
60 depth = sb_i->lock_depth; in reiserfs_write_unlock_nested()
66 return depth; in reiserfs_write_unlock_nested()
69 void reiserfs_write_lock_nested(struct super_block *s, int depth) in reiserfs_write_lock_nested() argument
74 if (depth == -1) in reiserfs_write_lock_nested()
79 sb_i->lock_depth = depth; in reiserfs_write_lock_nested()
Dresize.c37 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()
Dstree.c533 int depth = -1; in search_by_key_reada() local
552 if (depth == -1) in search_by_key_reada()
553 depth = reiserfs_write_unlock_nested(s); in search_by_key_reada()
558 return depth; in search_by_key_reada()
654 int depth = -1; in search_by_key() local
657 depth = search_by_key_reada(sb, reada_bh, in search_by_key()
660 if (!buffer_uptodate(bh) && depth == -1) in search_by_key()
661 depth = reiserfs_write_unlock_nested(sb); in search_by_key()
666 if (depth != -1) in search_by_key()
667 reiserfs_write_lock_nested(sb, depth); in search_by_key()
[all …]
Djournal.c958 int depth; in reiserfs_async_progress_wait() local
960 depth = reiserfs_write_unlock_nested(s); in reiserfs_async_progress_wait()
962 reiserfs_write_lock_nested(s, depth); in reiserfs_async_progress_wait()
985 int depth; in flush_commit_list() local
1036 depth = reiserfs_write_unlock_nested(s); in flush_commit_list()
1041 reiserfs_write_lock_nested(s, depth); in flush_commit_list()
1061 depth = reiserfs_write_unlock_nested(s); in flush_commit_list()
1063 reiserfs_write_lock_nested(s, depth); in flush_commit_list()
1075 depth = reiserfs_write_unlock_nested(s); in flush_commit_list()
1077 reiserfs_write_lock_nested(s, depth); in flush_commit_list()
[all …]
Dbitmap.c461 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 …]
Ddir.c77 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()
Dinode.c70 int depth = reiserfs_write_unlock_nested(inode->i_sb); in reiserfs_evict_inode() local
72 reiserfs_write_lock_nested(inode->i_sb, depth); in reiserfs_evict_inode()
1646 int depth; in reiserfs_iget() local
1650 depth = reiserfs_write_unlock_nested(s); in reiserfs_iget()
1654 reiserfs_write_lock_nested(s, depth); in reiserfs_iget()
1942 int depth; in reiserfs_new_inode() local
1946 depth = reiserfs_write_unlock_nested(sb); in reiserfs_new_inode()
1948 reiserfs_write_lock_nested(sb, depth); in reiserfs_new_inode()
1973 depth = reiserfs_write_unlock_nested(inode->i_sb); in reiserfs_new_inode()
1976 reiserfs_write_lock_nested(inode->i_sb, depth); in reiserfs_new_inode()
[all …]
Dfix_node.c1112 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 …]
Dsuper.c251 int depth; in finish_unfinished() local
309 depth = reiserfs_write_unlock_nested(inode->i_sb); in finish_unfinished()
311 reiserfs_write_lock_nested(inode->i_sb, depth); in finish_unfinished()
2208 int depth; in reiserfs_write_dquot() local
2216 depth = reiserfs_write_unlock_nested(dquot->dq_sb); in reiserfs_write_dquot()
2218 reiserfs_write_lock_nested(dquot->dq_sb, depth); in reiserfs_write_dquot()
2231 int depth; in reiserfs_acquire_dquot() local
2239 depth = reiserfs_write_unlock_nested(dquot->dq_sb); in reiserfs_acquire_dquot()
2241 reiserfs_write_lock_nested(dquot->dq_sb, depth); in reiserfs_acquire_dquot()
2290 int depth; in reiserfs_write_info() local
[all …]
/fs/minix/
Ditree_common.c30 int depth, in get_branch() argument
44 while (--depth) { in get_branch()
153 int depth = block_to_path(inode, block, offsets); in get_block() local
155 if (depth == 0) in get_block()
159 partial = get_branch(inode, depth, offsets, chain, &err); in get_block()
164 map_bh(bh, inode->i_sb, block_to_cpu(chain[depth-1].key)); in get_block()
166 partial = chain+depth-1; /* the whole chain */ in get_block()
189 left = (chain + depth) - partial; in get_block()
217 int depth, in find_shared() argument
226 for (k = depth; k > 1 && !offsets[k-1]; k--) in find_shared()
[all …]
/fs/quota/
Dquota_tree.c25 static int get_index(struct qtree_mem_dqinfo *info, struct kqid qid, int depth) in get_index() argument
30 depth = info->dqi_qtree_depth - depth - 1; in get_index()
31 while (depth--) in get_index()
292 uint *treeblk, int depth) in do_insert_tree() argument
317 newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in do_insert_tree()
320 if (depth == info->dqi_qtree_depth - 1) { in do_insert_tree()
326 dquot->dq_id, depth)])); in do_insert_tree()
333 ret = do_insert_tree(info, dquot, &newblk, depth+1); in do_insert_tree()
336 ref[get_index(info, dquot->dq_id, depth)] = in do_insert_tree()
461 uint *blk, int depth) in remove_tree() argument
[all …]
/fs/configfs/
Dsymlink.c41 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()
238 int depth, size; in configfs_get_target_path() local
240 depth = item_depth(item); in configfs_get_target_path()
241 size = item_path_length(target) + depth * 3 - 1; in configfs_get_target_path()
245 pr_debug("%s: depth = %d, size = %d\n", __func__, depth, size); in configfs_get_target_path()
247 for (s = path; depth--; s += 3) in configfs_get_target_path()
Dinode.c160 int depth = sd->s_depth; in configfs_set_inode_lock_class() local
162 if (depth > 0) { in configfs_set_inode_lock_class()
163 if (depth <= ARRAY_SIZE(default_group_class)) { in configfs_set_inode_lock_class()
165 &default_group_class[depth - 1]); in configfs_set_inode_lock_class()
/fs/sysv/
Ditree.c88 int depth, in get_branch() argument
101 while (--depth) { in get_branch()
210 int depth = block_to_path(inode, iblock, offsets); in get_block() local
212 if (depth == 0) in get_block()
217 partial = get_branch(inode, depth, offsets, chain, &err); in get_block()
224 chain[depth-1].key)); in get_block()
226 partial = chain+depth-1; /* the whole chain */ in get_block()
249 left = (chain + depth) - partial; in get_block()
277 int depth, in find_shared() argument
286 for (k = depth; k > 1 && !offsets[k-1]; k--) in find_shared()
[all …]
/fs/ext2/
Dinode.c232 int depth, in ext2_get_branch() argument
246 while (--depth) { in ext2_get_branch()
630 int depth; in ext2_get_blocks() local
637 depth = ext2_block_to_path(inode,iblock,offsets,&blocks_to_boundary); in ext2_get_blocks()
639 if (depth == 0) in ext2_get_blocks()
642 partial = ext2_get_branch(inode, depth, offsets, chain, &err); in ext2_get_blocks()
645 first_block = le32_to_cpu(chain[depth - 1].key); in ext2_get_blocks()
652 if (!verify_chain(chain, chain + depth - 1)) { in ext2_get_blocks()
663 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext2_get_blocks()
695 partial = ext2_get_branch(inode, depth, offsets, chain, &err); in ext2_get_blocks()
[all …]
/fs/sdcardfs/
Dderived_perm.c284 static void __fixup_perms_recursive(struct dentry *dentry, struct limit_search *limit, int depth) in __fixup_perms_recursive() argument
294 WARN(depth > 3, "%s: Max expected depth exceeded!\n", __func__); in __fixup_perms_recursive()
295 spin_lock_nested(&dentry->d_lock, depth); in __fixup_perms_recursive()
304 spin_lock_nested(&child->d_lock, depth + 1); in __fixup_perms_recursive()
317 __fixup_perms_recursive(child, limit, depth + 1); in __fixup_perms_recursive()
/fs/ext3/
Dinode.c410 static Indirect *ext3_get_branch(struct inode *inode, int depth, int *offsets, in ext3_get_branch() argument
422 while (--depth) { in ext3_get_branch()
869 int depth; in ext3_get_blocks_handle() local
877 depth = ext3_block_to_path(inode,iblock,offsets,&blocks_to_boundary); in ext3_get_blocks_handle()
879 if (depth == 0) in ext3_get_blocks_handle()
882 partial = ext3_get_branch(inode, depth, offsets, chain, &err); in ext3_get_blocks_handle()
886 first_block = le32_to_cpu(chain[depth - 1].key); in ext3_get_blocks_handle()
893 if (!verify_chain(chain, chain + depth - 1)) { in ext3_get_blocks_handle()
905 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext3_get_blocks_handle()
942 partial = ext3_get_branch(inode, depth, offsets, chain, &err); in ext3_get_blocks_handle()
[all …]
/fs/hfsplus/
Dbtree.c176 tree->depth = be16_to_cpu(head->depth); in hfs_btree_open()
303 head->depth = cpu_to_be16(tree->depth); in hfs_btree_write()
/fs/hfs/
Dbtree.c92 tree->depth = be16_to_cpu(head->depth); in hfs_btree_open()
180 head->depth = cpu_to_be16(tree->depth); in hfs_btree_write()
Dbtree.h33 unsigned int depth; member
139 __be16 depth; /* (V) The number of levels in this B-tree */ member
/fs/ocfs2/
Docfs2_trace.h423 TP_PROTO(unsigned long long owner, int depth),
424 TP_ARGS(owner, depth),
427 __field(int, depth)
431 __entry->depth = depth;
433 TP_printk("%llu %d", __entry->owner, __entry->depth)
438 int depth),
439 TP_ARGS(subtree_root, blkno, depth),
443 __field(int, depth)
448 __entry->depth = depth;
451 __entry->blkno, __entry->depth)
[all …]
/fs/gfs2/
Dglops.c322 u16 height, depth; in gfs2_dinode_in() local
363 depth = be16_to_cpu(str->di_depth); in gfs2_dinode_in()
364 if (unlikely(depth > GFS2_DIR_MAX_DEPTH)) in gfs2_dinode_in()
366 ip->i_depth = (u8)depth; in gfs2_dinode_in()
/fs/afs/
Dvnode.c21 int depth, char lr)
30 bad = dump_tree_aux(node->rb_left, node, depth + 2, '/');
35 depth, depth, "", lr,
43 bad |= dump_tree_aux(node->rb_right, node, depth + 2, '\\');

12