Home
last modified time | relevance | path

Searched refs:level (Results 1 – 25 of 145) sorted by relevance

123456

/fs/nilfs2/
Dbtree.c26 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/
Dbtree.c29 int level, in __xchk_btree_process_error() argument
50 trace_xchk_ifork_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
53 trace_xchk_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
64 int level, in xchk_btree_process_error() argument
67 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
75 int level, in xchk_btree_xref_process_error() argument
78 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
87 int level, in __xchk_btree_set_corrupt() argument
94 trace_xchk_ifork_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
97 trace_xchk_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
[all …]
Ddabtree.c32 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()
83 int level) in xchk_da_btree_node_entry() argument
85 struct xfs_da_state_blk *blk = &ds->state->path.blk[level]; in xchk_da_btree_node_entry()
98 int level, in xchk_da_btree_hash() argument
107 if (hash < ds->hashes[level]) in xchk_da_btree_hash()
108 xchk_da_set_corrupt(ds, level); in xchk_da_btree_hash()
109 ds->hashes[level] = hash; in xchk_da_btree_hash()
[all …]
Dattr.c244 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 …]
Dtrace.h329 int level, int error, void *ret_ip),
330 TP_ARGS(sc, cur, level, error, ret_ip),
335 __field(int, level)
343 xfs_fsblock_t fsbno = xchk_btree_cur_fsbno(cur, level);
348 __entry->level = level;
351 __entry->ptr = cur->bc_ptrs[level];
359 __entry->level,
369 int level, int error, void *ret_ip),
370 TP_ARGS(sc, cur, level, error, ret_ip),
377 __field(int, level)
[all …]
Dtrace.c22 int level) in xchk_btree_cur_fsbno() argument
24 if (level < cur->bc_nlevels && cur->bc_bufs[level]) in xchk_btree_cur_fsbno()
26 xfs_buf_daddr(cur->bc_bufs[level])); in xchk_btree_cur_fsbno()
27 if (level == cur->bc_nlevels - 1 && cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_cur_fsbno()
/fs/xfs/libxfs/
Dxfs_btree.c69 int level, in xfs_btree_check_lblock_siblings() argument
81 if (level >= 0) { in xfs_btree_check_lblock_siblings()
82 if (!xfs_btree_check_lptr(cur, sibling, level + 1)) in xfs_btree_check_lblock_siblings()
96 int level, in xfs_btree_check_sblock_siblings() argument
109 if (level >= 0) { in xfs_btree_check_sblock_siblings()
110 if (!xfs_btree_check_sptr(cur, sibling, level + 1)) in xfs_btree_check_sblock_siblings()
127 int level, in __xfs_btree_check_lblock() argument
148 if (be16_to_cpu(block->bb_level) != level) in __xfs_btree_check_lblock()
151 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
157 fa = xfs_btree_check_lblock_siblings(mp, cur, level, fsb, in __xfs_btree_check_lblock()
[all …]
Dxfs_btree_staging.c367 unsigned int level, in xfs_btree_bload_prep_block() argument
380 level == cur->bc_nlevels - 1) { in xfs_btree_bload_prep_block()
393 XFS_BUF_DADDR_NULL, cur->bc_btnum, level, in xfs_btree_bload_prep_block()
424 xfs_btree_init_block_cur(cur, new_bp, level, nr_this_block); in xfs_btree_bload_prep_block()
517 unsigned int level) in xfs_btree_bload_max_npb() argument
521 if (level == cur->bc_nlevels - 1 && cur->bc_ops->get_dmaxrecs) in xfs_btree_bload_max_npb()
522 return cur->bc_ops->get_dmaxrecs(cur, level); in xfs_btree_bload_max_npb()
524 ret = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_max_npb()
525 if (level == 0) in xfs_btree_bload_max_npb()
541 unsigned int level) in xfs_btree_bload_desired_npb() argument
[all …]
Dxfs_btree.h125 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
126 int (*get_maxrecs)(struct xfs_btree_cur *cur, int level);
129 int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level);
275 struct xfs_btree_block *block, int level, struct xfs_buf *bp);
277 struct xfs_btree_block *block, int level, struct xfs_buf *bp);
286 int level, /* level of the btree block */
296 int level); /* btree block level */
305 int level); /* btree block level */
380 __u16 level,
390 __u16 level,
[all …]
Dxfs_bmap_btree.c300 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 …]
/fs/verity/
Dverify.c26 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()
93 int level; in verify_page() local
111 for (level = 0; level < params->num_levels; level++) { in verify_page()
116 hash_at_level(params, index, level, &hindex, &hoffset); in verify_page()
119 level, hindex, hoffset); in verify_page()
122 level == 0 ? level0_ra_pages : 0); in verify_page()
[all …]
Denable.c44 static int build_merkle_tree_level(struct file *filp, unsigned int level, in build_merkle_tree_level() argument
61 if (level < params->num_levels) { in build_merkle_tree_level()
62 dst_block_num = params->level_start[level]; in build_merkle_tree_level()
76 i + 1, num_blocks_to_hash, level); in build_merkle_tree_level()
78 if (level == 0) { in build_merkle_tree_level()
96 params->level_start[level - 1] + i, in build_merkle_tree_level()
102 err, params->level_start[level - 1] + i); in build_merkle_tree_level()
114 if (level == params->num_levels) /* Root hash? */ in build_merkle_tree_level()
159 unsigned int level; in build_merkle_tree() local
182 for (level = 0; level <= params->num_levels; level++) { in build_merkle_tree()
[all …]
/fs/btrfs/
Dctree.c20 *root, struct btrfs_path *path, int level);
31 int level, int slot);
187 int level; in btrfs_copy_root() local
195 level = btrfs_header_level(buf); in btrfs_copy_root()
196 if (level == 0) in btrfs_copy_root()
202 &disk_key, level, buf->start, 0, in btrfs_copy_root()
341 int level = btrfs_header_level(buf); in update_ref_for_cow() local
344 new_flags, level, 0); in update_ref_for_cow()
390 int level, ret; in __btrfs_cow_block() local
405 level = btrfs_header_level(buf); in __btrfs_cow_block()
[all …]
Dzstd.c31 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 struct list_head *zstd_alloc_workspace(unsigned int level);
118 unsigned int level; in zstd_reclaim_timer_fn() local
127 level = victim->level; in zstd_reclaim_timer_fn()
132 if (list_empty(&wsm.idle_ws[level - 1])) in zstd_reclaim_timer_fn()
133 clear_bit(level - 1, &wsm.active_map); in zstd_reclaim_timer_fn()
155 unsigned int level; in zstd_calc_ws_mem_sizes() local
157 for (level = 1; level <= ZSTD_BTRFS_MAX_LEVEL; level++) { in zstd_calc_ws_mem_sizes()
[all …]
Dextent-tree.c58 static int find_next_key(struct btrfs_path *path, int level,
747 static int find_next_key(struct btrfs_path *path, int level, in find_next_key() argument
751 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
752 if (!path->nodes[level]) in find_next_key()
754 if (path->slots[level] + 1 >= in find_next_key()
755 btrfs_header_nritems(path->nodes[level])) in find_next_key()
757 if (level == 0) in find_next_key()
758 btrfs_item_key_to_cpu(path->nodes[level], key, in find_next_key()
759 path->slots[level] + 1); in find_next_key()
761 btrfs_node_key_to_cpu(path->nodes[level], key, in find_next_key()
[all …]
Drelocation.c103 unsigned int level:8; member
162 if (node->level == 0 || in mark_block_processed()
245 int level = 0; in update_backref_cache() local
278 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
279 list_for_each_entry(node, &cache->pending[level], list) { in update_backref_cache()
432 if (cur->level > 0) { in handle_useless_nodes()
459 int level, u64 bytenr) in build_backref_tree() argument
480 node = btrfs_backref_alloc_node(cache, bytenr, level); in build_backref_tree()
575 node->level); in clone_backref_node()
1179 struct btrfs_path *path, int level) in memcmp_node_keys() argument
[all …]
Dlocking.c44 #define DEFINE_LEVEL(stem, level) \ argument
45 .names[level] = "btrfs-" stem "-0" #level,
80 void btrfs_set_buffer_lockdep_class(u64 objectid, struct extent_buffer *eb, int level) in btrfs_set_buffer_lockdep_class() argument
84 BUG_ON(level >= ARRAY_SIZE(ks->keys)); in btrfs_set_buffer_lockdep_class()
91 lockdep_set_class_and_name(&eb->lock, &ks->keys[level], ks->names[level]); in btrfs_set_buffer_lockdep_class()
225 void btrfs_unlock_up_safe(struct btrfs_path *path, int level) in btrfs_unlock_up_safe() argument
232 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()
Dcompression.c907 static struct list_head *alloc_heuristic_ws(unsigned int level) in alloc_heuristic_ws() argument
946 static struct list_head *alloc_workspace(int type, unsigned int level) in alloc_workspace() argument
949 case BTRFS_COMPRESS_NONE: return alloc_heuristic_ws(level); in alloc_workspace()
950 case BTRFS_COMPRESS_ZLIB: return zlib_alloc_workspace(level); in alloc_workspace()
951 case BTRFS_COMPRESS_LZO: return lzo_alloc_workspace(level); in alloc_workspace()
952 case BTRFS_COMPRESS_ZSTD: return zstd_alloc_workspace(level); in alloc_workspace()
1024 struct list_head *btrfs_get_workspace(int type, unsigned int level) in btrfs_get_workspace() argument
1072 workspace = alloc_workspace(type, level); in btrfs_get_workspace()
1103 static struct list_head *get_workspace(int type, int level) in get_workspace() argument
1106 case BTRFS_COMPRESS_NONE: return btrfs_get_workspace(type, level); in get_workspace()
[all …]
/fs/ocfs2/dlmfs/
Duserdlm.c100 static inline int user_highest_compat_lock_level(int level) in user_highest_compat_lock_level() argument
104 if (level == DLM_LOCK_EX) in user_highest_compat_lock_level()
106 else if (level == DLM_LOCK_PR) in user_highest_compat_lock_level()
199 static void user_bast(struct ocfs2_dlm_lksb *lksb, int level) in user_bast() argument
204 lockres->l_namelen, lockres->l_name, level, lockres->l_level); in user_bast()
208 if (level > lockres->l_blocking) in user_bast()
209 lockres->l_blocking = level; in user_bast()
384 int level) in user_dlm_inc_holders() argument
386 switch(level) { in user_dlm_inc_holders()
411 int level, in user_dlm_cluster_lock() argument
[all …]
/fs/ubifs/
Dtnc_misc.c33 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 …]
/fs/ntfs3/
Dindex.c659 for (i = fnd->level - 1; i >= 0; i--) { in fnd_clear()
668 fnd->level = 0; in fnd_clear()
677 i = fnd->level; in fnd_push()
682 fnd->level += 1; in fnd_push()
689 int i = fnd->level; in fnd_pop()
694 fnd->level = i; in fnd_pop()
701 if (!fnd->level) in fnd_is_empty()
704 return !fnd->de[fnd->level - 1]; in fnd_is_empty()
1160 e = fnd->level ? fnd->de[fnd->level - 1] : fnd->root_de; in indx_find()
1215 int level = fnd->level; in indx_find_sort() local
[all …]
/fs/ksmbd/
Doplock.c43 opinfo->level = SMB2_OPLOCK_LEVEL_NONE; in alloc_opinfo()
262 if (!(opinfo->level == SMB2_OPLOCK_LEVEL_BATCH || in opinfo_write_to_read()
263 opinfo->level == SMB2_OPLOCK_LEVEL_EXCLUSIVE)) { in opinfo_write_to_read()
264 pr_err("bad oplock(0x%x)\n", opinfo->level); in opinfo_write_to_read()
269 opinfo->level = SMB2_OPLOCK_LEVEL_II; in opinfo_write_to_read()
287 opinfo->level = SMB2_OPLOCK_LEVEL_II; in opinfo_read_handle_to_read()
301 if (!(opinfo->level == SMB2_OPLOCK_LEVEL_BATCH || in opinfo_write_to_none()
302 opinfo->level == SMB2_OPLOCK_LEVEL_EXCLUSIVE)) { in opinfo_write_to_none()
303 pr_err("bad oplock(0x%x)\n", opinfo->level); in opinfo_write_to_none()
308 opinfo->level = SMB2_OPLOCK_LEVEL_NONE; in opinfo_write_to_none()
[all …]
/fs/ocfs2/
Ddlmglue.c111 static void ocfs2_dump_meta_lvb_info(u64 level, in ocfs2_dump_meta_lvb_info() argument
118 mlog(level, "LVB information for %s (called from %s:%u):\n", in ocfs2_dump_meta_lvb_info()
120 mlog(level, "version: %u, clusters: %u, generation: 0x%x\n", in ocfs2_dump_meta_lvb_info()
123 mlog(level, "size: %llu, uid %u, gid %u, mode 0x%x\n", in ocfs2_dump_meta_lvb_info()
127 mlog(level, "nlink %u, atime_packed 0x%llx, ctime_packed 0x%llx, " in ocfs2_dump_meta_lvb_info()
335 int level,
341 int level, unsigned long caller_ip);
344 int level) in ocfs2_cluster_unlock() argument
346 __ocfs2_cluster_unlock(osb, lockres, level, _RET_IP_); in ocfs2_cluster_unlock()
352 static int ocfs2_generic_handle_bast(struct ocfs2_lock_res *lockres, int level);
[all …]
/fs/xfs/
Dxfs_message.c19 const char *level, in __xfs_printk() argument
24 printk("%sXFS (%s): %pV\n", level, mp->m_super->s_id, 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/
Ddir.c29 static unsigned int dir_buckets(unsigned int level, int dir_level) in dir_buckets() argument
31 if (level + dir_level < MAX_DIR_HASH_DEPTH / 2) in dir_buckets()
32 return 1 << (level + dir_level); in dir_buckets()
37 static unsigned int bucket_blocks(unsigned int level) in bucket_blocks() argument
39 if (level < MAX_DIR_HASH_DEPTH / 2) in bucket_blocks()
186 static unsigned long dir_block_index(unsigned int level, in dir_block_index() argument
192 for (i = 0; i < level; i++) in dir_block_index()
194 bidx += idx * bucket_blocks(level); in dir_block_index()
334 unsigned int level, in find_in_level() argument
346 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level); in find_in_level()
[all …]

123456