| /fs/ext4/ |
| D | extents.c | 155 int depth; in ext4_ext_find_goal() local
159 depth = path->p_depth; in ext4_ext_find_goal()
162 ex = path[depth].p_ext; in ext4_ext_find_goal()
168 if (path[depth].p_bh) in ext4_ext_find_goal()
169 return path[depth].p_bh->b_blocknr; in ext4_ext_find_goal()
285 ext4_ext_max_entries(struct inode *inode, int depth) in ext4_ext_max_entries() argument
289 if (depth == ext_depth(inode)) { in ext4_ext_max_entries()
290 if (depth == 0) in ext4_ext_max_entries()
295 if (depth == 0) in ext4_ext_max_entries()
306 int depth) in __ext4_ext_check_header() argument
[all …]
|
| D | inode.c | 404 static Indirect *ext4_get_branch(struct inode *inode, int depth, in ext4_get_branch() argument
417 while (--depth) { in ext4_get_branch()
873 int depth; in ext4_get_blocks_handle() local
882 depth = ext4_block_to_path(inode, iblock, offsets, in ext4_get_blocks_handle()
885 if (depth == 0) in ext4_get_blocks_handle()
888 partial = ext4_get_branch(inode, depth, offsets, chain, &err); in ext4_get_blocks_handle()
892 first_block = le32_to_cpu(chain[depth - 1].key); in ext4_get_blocks_handle()
899 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext4_get_blocks_handle()
919 indirect_blks = (chain + depth) - partial - 1; in ext4_get_blocks_handle()
961 map_bh(bh_result, inode->i_sb, le32_to_cpu(chain[depth-1].key)); in ext4_get_blocks_handle()
[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/ |
| D | quota_tree.c | 27 static int get_index(struct qtree_mem_dqinfo *info, qid_t id, int depth) in get_index() argument
31 depth = info->dqi_qtree_depth - depth - 1; in get_index()
32 while (depth--) in get_index()
285 uint *treeblk, int depth) in do_insert_tree() argument
310 newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in do_insert_tree()
313 if (depth == info->dqi_qtree_depth - 1) { in do_insert_tree()
319 dquot->dq_id, depth)])); in do_insert_tree()
326 ret = do_insert_tree(info, dquot, &newblk, depth+1); in do_insert_tree()
329 ref[get_index(info, dquot->dq_id, depth)] = in do_insert_tree()
453 uint *blk, int depth) in remove_tree() argument
[all …]
|
| D | namei.c | 572 if (nd->depth || res || nd->last_type!=LAST_NORM) in __vfs_follow_link()
651 BUG_ON(nd->depth >= MAX_NESTED_LINKS); in do_follow_link()
658 nd->depth++; in do_follow_link()
661 nd->depth--; in do_follow_link()
839 if (nd->depth) in __link_path_walk()
1026 nd->depth = 0; in do_path_lookup()
1106 nd->depth = 0; in vfs_path_lookup()
2753 nd.depth = 0; in generic_readlink()
|
| /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/configfs/ |
| D | symlink.c | 40 int depth = 0; in item_depth() local
41 do { depth++; } while ((p = p->ci_parent) && !configfs_is_root(p)); in item_depth()
42 return depth; in item_depth()
242 int depth, size; in configfs_get_target_path() local
244 depth = item_depth(item); in configfs_get_target_path()
245 size = item_path_length(target) + depth * 3 - 1; in configfs_get_target_path()
249 pr_debug("%s: depth = %d, size = %d\n", __func__, depth, size); in configfs_get_target_path()
251 for (s = path; depth--; s += 3) in configfs_get_target_path()
|
| /fs/ext2/ |
| D | inode.c | 200 int depth, in ext2_get_branch() argument
214 while (--depth) { in ext2_get_branch()
584 int depth; in ext2_get_blocks() local
589 depth = ext2_block_to_path(inode,iblock,offsets,&blocks_to_boundary); in ext2_get_blocks()
591 if (depth == 0) in ext2_get_blocks()
594 partial = ext2_get_branch(inode, depth, offsets, chain, &err); in ext2_get_blocks()
598 first_block = le32_to_cpu(chain[depth - 1].key); in ext2_get_blocks()
615 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext2_get_blocks()
640 indirect_blks = (chain + depth) - partial - 1; in ext2_get_blocks()
663 le32_to_cpu(chain[depth-1].key)); in ext2_get_blocks()
[all …]
|
| /fs/hfsplus/ |
| D | btree.c | 58 tree->depth = be16_to_cpu(head->depth); in hfs_btree_open()
142 head->depth = cpu_to_be16(tree->depth); in hfs_btree_write()
|
| D | brec.c | 441 if (!tree->depth) { in hfs_btree_inc_height()
452 new_node->height = ++tree->depth; in hfs_btree_inc_height()
|
| D | bfind.c | 98 height = tree->depth; in hfs_brec_find()
|
| D | hfsplus_raw.h | 155 __be16 depth; member
|
| D | bnode.c | 365 tree->depth = 0; in hfs_bnode_unlink()
519 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
|
| /fs/hfs/ |
| D | btree.c | 77 tree->depth = be16_to_cpu(head->depth); in hfs_btree_open()
164 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
|
| D | bnode.c | 205 tree->depth = 0; in hfs_bnode_unlink()
359 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
|
| D | brec.c | 468 if (!tree->depth) { in hfs_btree_inc_height()
479 new_node->height = ++tree->depth; in hfs_btree_inc_height()
|
| D | bfind.c | 107 height = tree->depth; in hfs_brec_find()
|
| /fs/ext3/ |
| D | inode.c | 356 static Indirect *ext3_get_branch(struct inode *inode, int depth, int *offsets, in ext3_get_branch() argument
368 while (--depth) { in ext3_get_branch()
800 int depth; in ext3_get_blocks_handle() local
807 depth = ext3_block_to_path(inode,iblock,offsets,&blocks_to_boundary); in ext3_get_blocks_handle()
809 if (depth == 0) in ext3_get_blocks_handle()
812 partial = ext3_get_branch(inode, depth, offsets, chain, &err); in ext3_get_blocks_handle()
816 first_block = le32_to_cpu(chain[depth - 1].key); in ext3_get_blocks_handle()
835 blk = le32_to_cpu(*(chain[depth-1].p + count)); in ext3_get_blocks_handle()
869 partial = ext3_get_branch(inode, depth, offsets, chain, &err); in ext3_get_blocks_handle()
890 indirect_blks = (chain + depth) - partial - 1; in ext3_get_blocks_handle()
[all …]
|
| /fs/afs/ |
| D | vnode.c | 22 int depth, char lr)
31 bad = dump_tree_aux(node->rb_left, node, depth + 2, '/');
36 depth, depth, "", lr,
44 bad |= dump_tree_aux(node->rb_right, node, depth + 2, '\\');
|
| /fs/ufs/ |
| D | inode.c | 94 int depth = ufs_block_to_path(inode, frag >> uspi->s_fpbshift, offsets); in ufs_frag_map() local
101 UFSD(": frag = %llu depth = %d\n", (unsigned long long)frag, depth); in ufs_frag_map()
106 if (depth == 0) in ufs_frag_map()
118 while (--depth) { in ufs_frag_map()
138 while (--depth) { in ufs_frag_map()
|
| /fs/gfs2/ |
| D | dir.c | 803 static struct gfs2_leaf *new_leaf(struct inode *inode, struct buffer_head **pbh, u16 depth) in new_leaf() argument
818 leaf->lf_depth = cpu_to_be16(depth); in new_leaf()
1261 filldir_t filldir, int *copied, unsigned *depth, in gfs2_dir_read_leaf() argument
1283 *depth = be16_to_cpu(lf->lf_depth); in gfs2_dir_read_leaf()
1370 unsigned depth = 0; in dir_e_read() local
1402 &copied, &depth, in dir_e_read()
1407 len = 1 << (dip->i_depth - depth); in dir_e_read()
|
| D | inode.c | 252 u16 height, depth; in gfs2_dinode_in() local
297 depth = be16_to_cpu(str->di_depth); in gfs2_dinode_in()
298 if (unlikely(depth > GFS2_DIR_MAX_DEPTH)) in gfs2_dinode_in()
300 ip->i_depth = (u8)depth; in gfs2_dinode_in()
|
| /fs/ocfs2/ |
| D | alloc.c | 428 int i, start = 0, depth = 0; in ocfs2_reinit_path() local
448 depth = le16_to_cpu(path_root_el(path)->l_tree_depth); in ocfs2_reinit_path()
452 path->p_tree_depth = depth; in ocfs2_reinit_path()
1341 int depth = le16_to_cpu(el->l_tree_depth); in ocfs2_grow_tree() local
1359 mlog(0, "need to shift tree depth (current = %d)\n", depth); in ocfs2_grow_tree()
1370 depth++; in ocfs2_grow_tree()
1371 if (depth == 1) { in ocfs2_grow_tree()
1400 *final_depth = depth; in ocfs2_grow_tree()
4704 int ret = 0, depth; in ocfs2_split_and_insert() local
4722 depth = le16_to_cpu(rightmost_el->l_tree_depth); in ocfs2_split_and_insert()
[all …]
|
| /fs/cramfs/ |
| D | README | 26 confused with breadth-first); i.e. like depth-first but listing all of
52 The order of <file_data>'s is a depth-first descent of the directory
|