/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 | 143 static Indirect *ext4_get_branch(struct inode *inode, int depth, in ext4_get_branch() argument 157 while (--depth) { in ext4_get_branch() 525 int depth; in ext4_ind_map_blocks() local 532 depth = ext4_block_to_path(inode, map->m_lblk, offsets, in ext4_ind_map_blocks() 535 if (depth == 0) in ext4_ind_map_blocks() 538 partial = ext4_get_branch(inode, depth, offsets, chain, &err); in ext4_ind_map_blocks() 542 first_block = le32_to_cpu(chain[depth - 1].key); in ext4_ind_map_blocks() 548 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext4_ind_map_blocks() 565 for (i = 0; partial + i != chain + depth - 1; i++) in ext4_ind_map_blocks() 600 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 | 54 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()
|
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 | 533 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 …]
|
D | journal.c | 956 int depth; in reiserfs_async_progress_wait() local 958 depth = reiserfs_write_unlock_nested(s); in reiserfs_async_progress_wait() 960 reiserfs_write_lock_nested(s, depth); in reiserfs_async_progress_wait() 983 int depth; in flush_commit_list() local 1034 depth = reiserfs_write_unlock_nested(s); in flush_commit_list() 1039 reiserfs_write_lock_nested(s, depth); in flush_commit_list() 1059 depth = reiserfs_write_unlock_nested(s); in flush_commit_list() 1061 reiserfs_write_lock_nested(s, depth); in flush_commit_list() 1073 depth = reiserfs_write_unlock_nested(s); in flush_commit_list() 1075 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 | 70 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() 1647 int depth; in reiserfs_iget() local 1651 depth = reiserfs_write_unlock_nested(s); in reiserfs_iget() 1655 reiserfs_write_lock_nested(s, depth); in reiserfs_iget() 1943 int depth; in reiserfs_new_inode() local 1947 depth = reiserfs_write_unlock_nested(sb); in reiserfs_new_inode() 1949 reiserfs_write_lock_nested(sb, depth); in reiserfs_new_inode() 1974 depth = reiserfs_write_unlock_nested(inode->i_sb); in reiserfs_new_inode() 1977 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 | 191 int depth = reiserfs_write_unlock_nested(inode->i_sb); in reiserfs_unpack() local 193 reiserfs_write_lock_nested(inode->i_sb, depth); in reiserfs_unpack()
|
D | super.c | 271 int depth; in finish_unfinished() local 329 depth = reiserfs_write_unlock_nested(inode->i_sb); in finish_unfinished() 331 reiserfs_write_lock_nested(inode->i_sb, depth); in finish_unfinished() 2247 int depth; in reiserfs_write_dquot() local 2255 depth = reiserfs_write_unlock_nested(dquot->dq_sb); in reiserfs_write_dquot() 2257 reiserfs_write_lock_nested(dquot->dq_sb, depth); in reiserfs_write_dquot() 2270 int depth; in reiserfs_acquire_dquot() local 2278 depth = reiserfs_write_unlock_nested(dquot->dq_sb); in reiserfs_acquire_dquot() 2280 reiserfs_write_lock_nested(dquot->dq_sb, depth); in reiserfs_acquire_dquot() 2329 int depth; in reiserfs_write_info() local [all …]
|
/fs/minix/ |
D | itree_common.c | 30 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/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() 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()
|
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 | 88 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/ufs/ |
D | inode.c | 122 static u64 ufs_frag_map(struct inode *inode, unsigned offsets[4], int depth) in ufs_frag_map() argument 138 if (depth == 0) in ufs_frag_map() 151 while (--depth) { in ufs_frag_map() 175 while (--depth) { in ufs_frag_map() 400 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() 416 if (unlikely(!depth)) { in ufs_getfrag_block() 432 if (depth == 1) { in ufs_getfrag_block() 439 for (i = 1; i < depth - 1; i++) in ufs_getfrag_block() 442 phys64 = ufs_inode_getblock(inode, phys64, offsets[depth - 1], in ufs_getfrag_block() [all …]
|
/fs/ext2/ |
D | inode.c | 234 int depth, in ext2_get_branch() argument 248 while (--depth) { in ext2_get_branch() 632 int depth; in ext2_get_blocks() local 639 depth = ext2_block_to_path(inode,iblock,offsets,&blocks_to_boundary); in ext2_get_blocks() 641 if (depth == 0) in ext2_get_blocks() 644 partial = ext2_get_branch(inode, depth, offsets, chain, &err); in ext2_get_blocks() 647 first_block = le32_to_cpu(chain[depth - 1].key); in ext2_get_blocks() 653 if (!verify_chain(chain, chain + depth - 1)) { in ext2_get_blocks() 664 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext2_get_blocks() 696 partial = ext2_get_branch(inode, depth, offsets, chain, &err); in ext2_get_blocks() [all …]
|
/fs/sdcardfs/ |
D | derived_perm.c | 284 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/hfs/ |
D | btree.c | 92 tree->depth = be16_to_cpu(head->depth); in hfs_btree_open() 180 head->depth = cpu_to_be16(tree->depth); in hfs_btree_write()
|
D | btree.h | 33 unsigned int depth; member 139 __be16 depth; /* (V) The number of levels in this B-tree */ member
|
/fs/hfsplus/ |
D | btree.c | 176 tree->depth = be16_to_cpu(head->depth); in hfs_btree_open() 303 head->depth = cpu_to_be16(tree->depth); in hfs_btree_write()
|
/fs/ocfs2/ |
D | ocfs2_trace.h | 423 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/ |
D | glops.c | 326 u16 height, depth; in gfs2_dinode_in() local 367 depth = be16_to_cpu(str->di_depth); in gfs2_dinode_in() 368 if (unlikely(depth > GFS2_DIR_MAX_DEPTH)) in gfs2_dinode_in() 370 ip->i_depth = (u8)depth; in gfs2_dinode_in()
|