| /fs/nilfs2/ |
| D | btree.c | 26 int level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_alloc_path() local
32 for (; level < NILFS_BTREE_LEVEL_MAX; level++) { in nilfs_btree_alloc_path()
33 path[level].bp_bh = NULL; in nilfs_btree_alloc_path()
34 path[level].bp_sib_bh = NULL; in nilfs_btree_alloc_path()
35 path[level].bp_index = 0; in nilfs_btree_alloc_path()
36 path[level].bp_oldreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path()
37 path[level].bp_newreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path()
38 path[level].bp_op = NULL; in nilfs_btree_alloc_path()
47 int level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_free_path() local
49 for (; level < NILFS_BTREE_LEVEL_MAX; level++) in nilfs_btree_free_path()
[all …]
|
| /fs/xfs/scrub/ |
| D | btree.c | 28 int level, in __xchk_btree_process_error() argument
49 trace_xchk_ifork_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
52 trace_xchk_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
63 int level, in xchk_btree_process_error() argument
66 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
74 int level, in xchk_btree_xref_process_error() argument
77 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
86 int level, in __xchk_btree_set_corrupt() argument
93 trace_xchk_ifork_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
96 trace_xchk_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
[all …]
|
| D | dabtree.c | 32 int level, in xchk_da_process_error() argument
54 ds->state->path.blk[level].blkno), in xchk_da_process_error()
68 int level) in xchk_da_set_corrupt() argument
76 ds->state->path.blk[level].blkno), in xchk_da_set_corrupt()
84 int level, in xchk_da_btree_entry() argument
92 blk = &ds->state->path.blk[level]; in xchk_da_btree_entry()
120 int level, in xchk_da_btree_hash() argument
130 if (hash < ds->hashes[level]) in xchk_da_btree_hash()
131 xchk_da_set_corrupt(ds, level); in xchk_da_btree_hash()
132 ds->hashes[level] = hash; in xchk_da_btree_hash()
[all …]
|
| D | attr.c | 244 int level, in xchk_xattr_entry() argument
262 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
266 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
272 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
283 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
289 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
292 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
295 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
304 int level) in xchk_xattr_block() argument
308 struct xfs_da_state_blk *blk = &ds->state->path.blk[level]; in xchk_xattr_block()
[all …]
|
| D | trace.h | 323 int level, int error, void *ret_ip),
324 TP_ARGS(sc, cur, level, error, ret_ip),
329 __field(int, level)
337 xfs_fsblock_t fsbno = xchk_btree_cur_fsbno(cur, level);
342 __entry->level = level;
345 __entry->ptr = cur->bc_ptrs[level];
353 __entry->level,
363 int level, int error, void *ret_ip),
364 TP_ARGS(sc, cur, level, error, ret_ip),
371 __field(int, level)
[all …]
|
| D | trace.c | 21 int level) in xchk_btree_cur_fsbno() argument
23 if (level < cur->bc_nlevels && cur->bc_bufs[level]) in xchk_btree_cur_fsbno()
24 return XFS_DADDR_TO_FSB(cur->bc_mp, cur->bc_bufs[level]->b_bn); in xchk_btree_cur_fsbno()
25 else if (level == cur->bc_nlevels - 1 && in xchk_btree_cur_fsbno()
|
| D | dabtree.h | 32 int level, void *rec);
35 bool xchk_da_process_error(struct xchk_da_btree *ds, int level, int *error);
38 void xchk_da_set_corrupt(struct xchk_da_btree *ds, int level);
40 int xchk_da_btree_hash(struct xchk_da_btree *ds, int level, __be32 *hashp);
|
| D | btree.h | 13 struct xfs_btree_cur *cur, int level, int *error);
17 struct xfs_btree_cur *cur, int level, int *error);
21 struct xfs_btree_cur *cur, int level);
25 struct xfs_btree_cur *cur, int level);
|
| /fs/xfs/libxfs/ |
| D | xfs_btree.c | 60 int level, in __xfs_btree_check_lblock() argument
79 if (be16_to_cpu(block->bb_level) != level) in __xfs_btree_check_lblock()
82 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
86 level + 1)) in __xfs_btree_check_lblock()
90 level + 1)) in __xfs_btree_check_lblock()
101 int level, in xfs_btree_check_lblock() argument
107 fa = __xfs_btree_check_lblock(cur, block, level, bp); in xfs_btree_check_lblock()
126 int level, in __xfs_btree_check_sblock() argument
143 if (be16_to_cpu(block->bb_level) != level) in __xfs_btree_check_sblock()
146 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_sblock()
[all …]
|
| D | xfs_btree.h | 123 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
124 int (*get_maxrecs)(struct xfs_btree_cur *cur, int level);
127 int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level);
247 struct xfs_btree_block *block, int level, struct xfs_buf *bp);
249 struct xfs_btree_block *block, int level, struct xfs_buf *bp);
258 int level, /* level of the btree block */
268 int level); /* btree block level */
277 int level); /* btree block level */
323 int level); /* level to check */
381 __u16 level,
[all …]
|
| D | xfs_bmap_btree.c | 300 int level) in xfs_bmbt_get_minrecs() argument
302 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_minrecs()
309 ifp->if_broot_bytes, level == 0) / 2; in xfs_bmbt_get_minrecs()
312 return cur->bc_mp->m_bmap_dmnr[level != 0]; in xfs_bmbt_get_minrecs()
318 int level) in xfs_bmbt_get_maxrecs() argument
320 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_maxrecs()
327 ifp->if_broot_bytes, level == 0); in xfs_bmbt_get_maxrecs()
330 return cur->bc_mp->m_bmap_dmxr[level != 0]; in xfs_bmbt_get_maxrecs()
346 int level) in xfs_bmbt_get_dmaxrecs() argument
348 if (level != cur->bc_nlevels - 1) in xfs_bmbt_get_dmaxrecs()
[all …]
|
| D | xfs_iext_tree.c | 307 int level) in xfs_iext_find_level() argument
315 for (height = ifp->if_height; height > level; height--) { in xfs_iext_find_level()
430 int level, in xfs_iext_update_node() argument
436 for (height = ifp->if_height; height > level; height--) { in xfs_iext_update_node()
497 int level) in xfs_iext_insert_node() argument
503 if (ifp->if_height < level) in xfs_iext_insert_node()
507 node = xfs_iext_find_level(ifp, offset, level); in xfs_iext_insert_node()
522 xfs_iext_update_node(ifp, node->keys[0], offset, level, node); in xfs_iext_insert_node()
534 level++; in xfs_iext_insert_node()
729 int level = 2, pos, nr_entries, i; in xfs_iext_remove_node() local
[all …]
|
| /fs/verity/ |
| D | verify.c | 26 pgoff_t dindex, unsigned int level, pgoff_t *hindex, in hash_at_level() argument
32 position = dindex >> (level * params->log_arity); in hash_at_level()
35 *hindex = params->level_start[level] + (position >> params->log_arity); in hash_at_level()
54 pgoff_t index, int level) in cmp_hashes() argument
63 index, level, in cmp_hashes()
92 int level; in verify_page() local
110 for (level = 0; level < params->num_levels; level++) { in verify_page()
115 hash_at_level(params, index, level, &hindex, &hoffset); in verify_page()
118 level, hindex, hoffset); in verify_page()
140 hpages[level] = hpage; in verify_page()
[all …]
|
| D | enable.c | 16 static int build_merkle_tree_level(struct inode *inode, unsigned int level, in build_merkle_tree_level() argument
31 if (level < params->num_levels) { in build_merkle_tree_level()
32 dst_block_num = params->level_start[level]; in build_merkle_tree_level()
44 i + 1, num_blocks_to_hash, level); in build_merkle_tree_level()
46 if (level == 0) { in build_merkle_tree_level()
59 params->level_start[level - 1] + i); in build_merkle_tree_level()
64 err, params->level_start[level - 1] + i); in build_merkle_tree_level()
76 if (level == params->num_levels) /* Root hash? */ in build_merkle_tree_level()
120 unsigned int level; in build_merkle_tree() local
141 for (level = 0; level <= params->num_levels; level++) { in build_merkle_tree()
[all …]
|
| /fs/btrfs/ |
| D | ctree.c | 19 *root, struct btrfs_path *path, int level);
30 int level, int slot);
226 int level; in btrfs_copy_root() local
234 level = btrfs_header_level(buf); in btrfs_copy_root()
235 if (level == 0) in btrfs_copy_root()
241 &disk_key, level, buf->start, 0); in btrfs_copy_root()
284 u8 level; member
654 tm->old_root.level = btrfs_header_level(old_root); in tree_mod_log_insert_root()
971 int level = btrfs_header_level(buf); in update_ref_for_cow() local
976 new_flags, level, 0); in update_ref_for_cow()
[all …]
|
| D | zstd.c | 31 static ZSTD_parameters zstd_get_btrfs_parameters(unsigned int level, in zstd_get_btrfs_parameters() argument
34 ZSTD_parameters params = ZSTD_getParams(level, src_len, 0); in zstd_get_btrfs_parameters()
46 unsigned int level; member
95 static struct list_head *zstd_alloc_workspace(unsigned int level);
119 unsigned int level; in zstd_reclaim_timer_fn() local
128 level = victim->level; in zstd_reclaim_timer_fn()
133 if (list_empty(&wsm.idle_ws[level - 1])) in zstd_reclaim_timer_fn()
134 clear_bit(level - 1, &wsm.active_map); in zstd_reclaim_timer_fn()
156 unsigned int level; in zstd_calc_ws_mem_sizes() local
158 for (level = 1; level <= ZSTD_BTRFS_MAX_LEVEL; level++) { in zstd_calc_ws_mem_sizes()
[all …]
|
| D | extent-tree.c | 54 static int find_next_key(struct btrfs_path *path, int level,
783 static int find_next_key(struct btrfs_path *path, int level, in find_next_key() argument
787 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
788 if (!path->nodes[level]) in find_next_key()
790 if (path->slots[level] + 1 >= in find_next_key()
791 btrfs_header_nritems(path->nodes[level])) in find_next_key()
793 if (level == 0) in find_next_key()
794 btrfs_item_key_to_cpu(path->nodes[level], key, in find_next_key()
795 path->slots[level] + 1); in find_next_key()
797 btrfs_node_key_to_cpu(path->nodes[level], key, in find_next_key()
[all …]
|
| D | relocation.c | 55 unsigned int level:8; member
135 unsigned int level:8; member
474 int level = 0; in update_backref_cache() local
507 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
508 list_for_each_entry(node, &cache->pending[level], list) { in update_backref_cache()
684 int level, u64 bytenr) in build_backref_tree() argument
724 node->level = level; in build_backref_tree()
857 upper->level = cur->level + 1; in build_backref_tree()
898 if (btrfs_root_level(&root->root_item) == cur->level) { in build_backref_tree()
909 level = cur->level + 1; in build_backref_tree()
[all …]
|
| D | ref-verify.c | 308 u64 parent, u64 bytenr, int level) in add_tree_block() argument
323 ref->owner = level; in add_tree_block()
550 int level, u64 *bytenr, u64 *num_bytes) in walk_down_tree() argument
557 while (level >= 0) { in walk_down_tree()
558 if (level) { in walk_down_tree()
561 block_bytenr = btrfs_node_blockptr(path->nodes[level], in walk_down_tree()
562 path->slots[level]); in walk_down_tree()
563 gen = btrfs_node_ptr_generation(path->nodes[level], in walk_down_tree()
564 path->slots[level]); in walk_down_tree()
565 btrfs_node_key_to_cpu(path->nodes[level], &first_key, in walk_down_tree()
[all …]
|
| /fs/ocfs2/dlmfs/ |
| D | userdlm.c | 102 static inline int user_highest_compat_lock_level(int level) in user_highest_compat_lock_level() argument
106 if (level == DLM_LOCK_EX) in user_highest_compat_lock_level()
108 else if (level == DLM_LOCK_PR) in user_highest_compat_lock_level()
201 static void user_bast(struct ocfs2_dlm_lksb *lksb, int level) in user_bast() argument
206 lockres->l_namelen, lockres->l_name, level, lockres->l_level); in user_bast()
210 if (level > lockres->l_blocking) in user_bast()
211 lockres->l_blocking = level; in user_bast()
386 int level) in user_dlm_inc_holders() argument
388 switch(level) { in user_dlm_inc_holders()
413 int level, in user_dlm_cluster_lock() argument
[all …]
|
| /fs/ubifs/ |
| D | tnc_misc.c | 33 int level, iip, level_search = 0; in ubifs_tnc_levelorder_next() local
42 if (znode->level == 0) in ubifs_tnc_levelorder_next()
47 level = znode->level; in ubifs_tnc_levelorder_next()
51 ubifs_assert(c, znode->level <= zr->level); in ubifs_tnc_levelorder_next()
65 level -= 1; in ubifs_tnc_levelorder_next()
66 if (level_search || level < 0) in ubifs_tnc_levelorder_next()
90 while (zn->level != level) { in ubifs_tnc_levelorder_next()
104 ubifs_assert(c, zn->level >= 0); in ubifs_tnc_levelorder_next()
174 while (znode->level > 0) { in ubifs_tnc_postorder_first()
234 if (zn->level > 0 && in ubifs_destroy_tnc_subtree()
[all …]
|
| D | tnc.c | 205 if (znode->level != 0) { in copy_znode()
625 while (znode->level != 0) { in tnc_next()
669 while (znode->level != 0) { in tnc_prev()
1098 if (c->zroot.znode->level > BOTTOM_UP_HEIGHT) { in dirty_cow_bottom_up()
1100 c->bottom_up_buf = kmalloc_array(c->zroot.znode->level, in dirty_cow_bottom_up()
1107 if (c->zroot.znode->level) { in dirty_cow_bottom_up()
1116 ubifs_assert(c, p < c->zroot.znode->level); in dirty_cow_bottom_up()
1194 if (znode->level == 0) in ubifs_lookup_level0()
1215 dbg_tnc("found %d, lvl %d, n %d", exact, znode->level, *n); in ubifs_lookup_level0()
1264 dbg_tnc("found 0, lvl %d, n -1", znode->level); in ubifs_lookup_level0()
[all …]
|
| /fs/ocfs2/ |
| D | dlmglue.c | 112 static void ocfs2_dump_meta_lvb_info(u64 level, in ocfs2_dump_meta_lvb_info() argument
119 mlog(level, "LVB information for %s (called from %s:%u):\n", in ocfs2_dump_meta_lvb_info()
121 mlog(level, "version: %u, clusters: %u, generation: 0x%x\n", in ocfs2_dump_meta_lvb_info()
124 mlog(level, "size: %llu, uid %u, gid %u, mode 0x%x\n", in ocfs2_dump_meta_lvb_info()
128 mlog(level, "nlink %u, atime_packed 0x%llx, ctime_packed 0x%llx, " in ocfs2_dump_meta_lvb_info()
336 int level,
342 int level, unsigned long caller_ip);
345 int level) in ocfs2_cluster_unlock() argument
347 __ocfs2_cluster_unlock(osb, lockres, level, _RET_IP_); in ocfs2_cluster_unlock()
353 static int ocfs2_generic_handle_bast(struct ocfs2_lock_res *lockres, int level);
[all …]
|
| /fs/xfs/ |
| D | xfs_message.c | 19 const char *level, in __xfs_printk() argument
24 printk("%sXFS (%s): %pV\n", level, mp->m_fsname, vaf); in __xfs_printk()
27 printk("%sXFS: %pV\n", level, vaf); in __xfs_printk()
35 int level; \
45 if (!kstrtoint(kern_level, 0, &level) && \
46 level <= LOGLEVEL_ERR && \
|
| /fs/f2fs/ |
| D | dir.c | 24 static unsigned int dir_buckets(unsigned int level, int dir_level) in dir_buckets() argument
26 if (level + dir_level < MAX_DIR_HASH_DEPTH / 2) in dir_buckets()
27 return 1 << (level + dir_level); in dir_buckets()
32 static unsigned int bucket_blocks(unsigned int level) in bucket_blocks() argument
34 if (level < MAX_DIR_HASH_DEPTH / 2) in bucket_blocks()
73 static unsigned long dir_block_index(unsigned int level, in dir_block_index() argument
79 for (i = 0; i < level; i++) in dir_block_index()
81 bidx += idx * bucket_blocks(level); in dir_block_index()
254 unsigned int level, in find_in_level() argument
268 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level); in find_in_level()
[all …]
|