| /fs/nilfs2/ |
| A D | btree.c | 32 for (; level < NILFS_BTREE_LEVEL_MAX; level++) { in nilfs_btree_alloc_path()
49 for (; level < NILFS_BTREE_LEVEL_MAX; level++) in nilfs_btree_free_path()
628 for (level--; level > 0; level--) { in nilfs_btree_do_lookup_last()
667 for (level = minlevel; level <= maxlevel; level++) { in nilfs_btree_get_next_key()
873 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_carry_left()
1003 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_grow()
1197 for (level--; level > NILFS_BTREE_LEVEL_DATA; level--) { in nilfs_btree_prepare_insert()
1224 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { in nilfs_btree_commit_insert()
1560 for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) { in nilfs_btree_prepare_delete()
1575 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { in nilfs_btree_commit_delete()
[all …]
|
| /fs/xfs/scrub/ |
| A D | btree.c | 29 int level, in __xchk_btree_process_error() argument
65 int level, in xchk_btree_process_error() argument
76 int level, in xchk_btree_xref_process_error() argument
88 int level, in __xchk_btree_set_corrupt() argument
106 int level) in xchk_btree_set_corrupt() argument
116 int level) in xchk_btree_xref_set_corrupt() argument
126 int level) in xchk_btree_set_preen() argument
188 int level) in xchk_btree_key() argument
452 co->level = level; in xchk_btree_check_owner()
769 level++; in xchk_btree()
[all …]
|
| A D | dabtree.c | 32 int level, in xchk_da_process_error() argument
69 int level) in xchk_da_set_corrupt() argument
85 int level) in xchk_da_set_preen() argument
100 int level) in xchk_da_btree_node_entry() argument
147 int level, in xchk_da_btree_ptr_ok() argument
534 level = 0; in xchk_da_btree()
550 while (level >= 0 && level < XFS_DA_NODE_MAXDEPTH) { in xchk_da_btree()
554 if (blks[level].index >= ds->maxrecs[level]) { in xchk_da_btree()
576 if (blks[level].index >= ds->maxrecs[level]) { in xchk_da_btree()
592 level++; in xchk_da_btree()
[all …]
|
| A D | attr.c | 323 int level, in xchk_xattr_entry() argument
341 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
345 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
351 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
371 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
374 xchk_da_set_corrupt(ds, level); in xchk_xattr_entry()
383 int level) in xchk_xattr_block() argument
430 xchk_da_set_preen(ds, level); in xchk_xattr_block()
435 xchk_da_set_corrupt(ds, level); in xchk_xattr_block()
443 xchk_da_set_preen(ds, level); in xchk_xattr_block()
[all …]
|
| /fs/bcachefs/ |
| A D | btree_locking.h | 41 unsigned level) in btree_node_locked_type() argument
47 unsigned level) in btree_node_locked_type_nowrite() argument
76 unsigned level, in mark_btree_node_locked_noreset() argument
89 unsigned level, in mark_btree_node_locked() argument
100 return level < path->locks_want in __btree_lock_want()
108 if (level < path->level) in btree_lock_want()
110 if (level < path->locks_want) in btree_lock_want()
112 if (level == path->level) in btree_lock_want()
271 unsigned level, in btree_node_lock_increment() argument
290 unsigned level, in btree_node_lock() argument
[all …]
|
| A D | btree_journal_iter.c | 240 new_key->level == iter->level) in journal_iters_fix()
265 .level = level, in bch2_journal_key_insert_take()
375 keys->data[idx].level == level && in bch2_key_deleted_in_journal()
450 keys->data[idx].level == level && in bch2_journal_key_overwritten()
504 iter->level = level; in bch2_journal_iter_init()
534 unsigned level = iter.journal.level; in btree_and_journal_iter_prefetch() local
537 ? (level > 1 ? 0 : 2) in btree_and_journal_iter_prefetch()
538 : (level > 1 ? 1 : 16); in btree_and_journal_iter_prefetch()
753 .level = entry->level, in bch2_journal_keys_sort()
795 i->level >= level_min && in bch2_shoot_down_journal_keys()
[all …]
|
| A D | btree_locking.c | 23 unsigned level) in bch2_btree_node_lock_counts() argument
65 u8 level; member
337 top->level = 0; in bch2_check_for_deadlock()
342 top->level < BTREE_MAX_DEPTH; in bch2_check_for_deadlock()
462 unsigned l = path->level; in btree_path_get_locks()
542 struct btree *b = path->l[level].b; in bch2_btree_node_upgrade()
544 if (!is_btree_node(path, level)) in bch2_btree_node_upgrade()
547 switch (btree_lock_want(path, level)) { in bch2_btree_node_upgrade()
566 if (btree_node_locked(path, level) in bch2_btree_node_upgrade()
594 for (l = path->level; in bch2_btree_path_relock_intent()
[all …]
|
| A D | btree_iter.c | 154 if (!level) in __bch2_btree_path_verify_level()
172 p = level in __bch2_btree_path_verify_level()
648 i->level == b->c.level && in bch2_trans_revalidate_updates_in_node()
706 unsigned i, level = b->c.level; in bch2_trans_node_drop() local
752 path->level = READ_ONCE(b->c.level); in btree_path_lock_root()
777 b->c.level == path->level && in btree_path_lock_root()
952 unsigned level = path->level - 1; in btree_path_down() local
993 path->level = level; in btree_path_down()
1332 if (unlikely(level != path->level)) { in __bch2_btree_path_set_pos()
1770 trans->paths[path_pos].level == level && in bch2_path_get()
[all …]
|
| A D | btree_cache.c | 295 b->c.level = level; in bch2_btree_node_hash_insert()
901 unsigned level, in bch2_btree_node_fill() argument
911 level, BTREE_MAX_DEPTH); in bch2_btree_node_fill()
1060 level, lock_type, true); in __bch2_btree_node_get()
1080 b->c.level != level || in __bch2_btree_node_get()
1196 b->c.level != level || in bch2_btree_node_get()
1240 unsigned level, in bch2_btree_node_get_noiter() argument
1262 level, SIX_LOCK_read, true); in bch2_btree_node_get_noiter()
1284 b->c.level != level)) { in bch2_btree_node_get_noiter()
1330 BUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_prefetch()
[all …]
|
| A D | btree_update_interior.c | 90 if (!b->c.level) in bch2_btree_node_check_topology()
387 b->c.level = level; in bch2_btree_node_alloc()
894 BUG_ON(!b->c.level); in btree_update_updated_node()
1396 .level = b->c.level, in bch2_insert_fixup_btree_ptr()
1527 if (b->c.level && in __btree_split_node()
2325 BUG_ON(!level); in bch2_btree_node_rewrite_pos()
2359 unsigned level; member
2394 a->level = b->c.level; in bch2_btree_node_rewrite_async()
2504 BUG_ON(path2->level != b->c.level); in __bch2_btree_node_update_key()
2664 b->c.level = level; in bch2_btree_root_alloc_fake_trans()
[all …]
|
| /fs/xfs/libxfs/ |
| A D | xfs_btree.c | 128 int level, in __xfs_btree_check_lblock_hdr() argument
162 int level, in __xfs_btree_check_fsblock() argument
202 int level, in __xfs_btree_check_memblock() argument
230 int level, in __xfs_btree_check_agblock() argument
2016 for (level = cur->bc_nlevels - 1, cmp_r = 1; level >= 0; level--) { in xfs_btree_lookup()
2279 for (level++; level < cur->bc_nlevels; level++) { in __xfs_btree_updkeys()
2347 for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) { in xfs_btree_update_keys()
3075 args.level = level; in xfs_btree_split()
4569 for (level = 0, i = 2; i == 2; level++) { in xfs_btree_delete()
4588 for (level = 1; level < cur->bc_nlevels; level++) { in xfs_btree_delete()
[all …]
|
| A D | xfs_btree_staging.c | 287 unsigned int level, in xfs_btree_bload_prep_block() argument
299 if (xfs_btree_at_iroot(cur, level)) { in xfs_btree_bload_prep_block()
439 unsigned int level) in xfs_btree_bload_max_npb() argument
447 if (level == 0) in xfs_btree_bload_max_npb()
463 unsigned int level) in xfs_btree_bload_desired_npb() argument
468 if (level == cur->bc_nlevels - 1) in xfs_btree_bload_desired_npb()
484 unsigned int level, in xfs_btree_bload_level_geometry() argument
547 int level) in xfs_btree_bload_ensure_slack() argument
612 if ((level != 0 || in xfs_btree_bload_compute_geometry()
690 unsigned int level = 0; in xfs_btree_bload() local
[all …]
|
| A D | xfs_rtrefcount_btree.c | 54 int level) in xfs_rtrefcountbt_get_minrecs() argument
56 if (level == cur->bc_nlevels - 1) { in xfs_rtrefcountbt_get_minrecs()
60 level == 0) / 2; in xfs_rtrefcountbt_get_minrecs()
69 int level) in xfs_rtrefcountbt_get_maxrecs() argument
75 level == 0); in xfs_rtrefcountbt_get_maxrecs()
109 int level) in xfs_rtrefcountbt_get_dmaxrecs() argument
111 if (level != cur->bc_nlevels - 1) in xfs_rtrefcountbt_get_dmaxrecs()
193 int level; in xfs_rtrefcountbt_verify() local
337 if (level > 0) in xfs_rtrefcountbt_broot_realloc()
356 if (level > 0) in xfs_rtrefcountbt_broot_realloc()
[all …]
|
| A D | xfs_rtrmap_btree.c | 56 int level) in xfs_rtrmapbt_get_minrecs() argument
62 level == 0) / 2; in xfs_rtrmapbt_get_minrecs()
71 int level) in xfs_rtrmapbt_get_maxrecs() argument
77 level == 0); in xfs_rtrmapbt_get_maxrecs()
109 int level) in xfs_rtrmapbt_get_dmaxrecs() argument
111 if (level != cur->bc_nlevels - 1) in xfs_rtrmapbt_get_dmaxrecs()
248 int level; in xfs_rtrmapbt_verify() local
438 if (level > 0) in xfs_rtrmapbt_broot_realloc()
457 if (level > 0) in xfs_rtrmapbt_broot_realloc()
538 unsigned int level; in xfs_rtrmapbt_mem_verify() local
[all …]
|
| /fs/verity/ |
| A D | verify.c | 97 int level; in verify_data_block() local
143 for (level = 0; level < params->num_levels; level++) { in verify_data_block()
189 hblocks[level].page = hpage; in verify_data_block()
190 hblocks[level].addr = haddr; in verify_data_block()
191 hblocks[level].index = hblock_idx; in verify_data_block()
192 hblocks[level].hoffset = hoffset; in verify_data_block()
199 for (; level > 0; level--) { in verify_data_block()
232 data_pos, level - 1, in verify_data_block()
236 for (; level > 0; level--) { in verify_data_block()
237 kunmap_local(hblocks[level - 1].addr); in verify_data_block()
[all …]
|
| A D | enable.c | 79 int level; in build_merkle_tree() local
94 for (level = -1; level < num_levels; level++) { in build_merkle_tree()
96 if (!buffers[level].data) { in build_merkle_tree()
129 for (level = 0; level < num_levels; level++) { in build_merkle_tree()
141 buffers[level].data, in build_merkle_tree()
142 level_offset[level], in build_merkle_tree()
146 level_offset[level]++; in build_merkle_tree()
155 for (level = 0; level < num_levels; level++) { in build_merkle_tree()
161 buffers[level].data, in build_merkle_tree()
175 for (level = -1; level < num_levels; level++) in build_merkle_tree()
[all …]
|
| /fs/btrfs/ |
| A D | ctree.c | 250 int level; in btrfs_copy_root() local
837 check.level = level - 1; in btrfs_read_node_slot()
1995 int level; in btrfs_search_slot() local
2248 int level; in btrfs_search_old_slot() local
3037 path->slots[level + 1] + 1, level + 1); in split_node()
4605 int level; in btrfs_search_forward() local
4727 level++; in btrfs_find_next_key()
4773 int level; in btrfs_next_old_leaf() local
4796 level = 1; in btrfs_next_old_leaf()
4865 level++; in btrfs_next_old_leaf()
[all …]
|
| A D | zstd.c | 49 int level; member
100 return max(0, level - 1); in clip_level()
130 int level; in zstd_reclaim_timer_fn() local
139 level = victim->level; in zstd_reclaim_timer_fn()
167 int level; in zstd_calc_ws_mem_sizes() local
169 for (level = ZSTD_BTRFS_MIN_LEVEL; level <= ZSTD_BTRFS_MAX_LEVEL; level++) { in zstd_calc_ws_mem_sizes()
170 if (level == 0) in zstd_calc_ws_mem_sizes()
256 if (clip_level(level) == workspace->level) in zstd_find_workspace()
285 if (!level) in zstd_get_workspace()
286 level = 1; in zstd_get_workspace()
[all …]
|
| A D | extent-tree.c | 5295 int level = wc->level; in visit_node_for_delete() local
5428 int level = wc->level; in walk_down_proc() local
5578 int level = wc->level; in check_next_block_uptodate() local
5628 int level = wc->level; in maybe_drop_reference() local
5714 int level = wc->level; in do_walk_down() local
5783 wc->level = level; in do_walk_down()
5822 int level = wc->level; in walk_up_proc() local
5984 level = wc->level; in walk_down_tree()
6016 wc->level = level; in walk_up_tree()
6171 wc->level = level; in btrfs_drop_snapshot()
[all …]
|
| A D | relocation.c | 125 u8 level; member
1039 int level; in replace_path() local
1179 path->nodes[level], path->slots[level], in replace_path()
1429 level++; in find_next_key()
1530 int level; in merge_reloc_root() local
2107 if (!next || next->level <= node->level) in select_one_root()
2381 int level; in finish_pending_nodes() local
2384 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in finish_pending_nodes()
2448 .level = block->level, in get_tree_block_key()
3141 block->level = level; in add_tree_block()
[all …]
|
| /fs/ocfs2/dlmfs/ |
| A D | userdlm.c | 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()
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
418 if (level != DLM_LOCK_EX && in user_dlm_cluster_lock()
419 level != DLM_LOCK_PR) { in user_dlm_cluster_lock()
503 int level) in user_dlm_dec_holders() argument
505 switch(level) { in user_dlm_dec_holders()
520 int level) in user_dlm_cluster_unlock() argument
[all …]
|
| /fs/ubifs/ |
| A 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()
174 while (znode->level > 0) { in ubifs_tnc_postorder_first()
234 if (zn->level > 0 && in ubifs_destroy_tnc_subtree()
314 znode->level = le16_to_cpu(idx->level); in read_znode()
[all …]
|
| /fs/ntfs3/ |
| A D | index.c | 1155 e = fnd->level ? fnd->de[fnd->level - 1] : fnd->root_de; in indx_find()
1208 int level = fnd->level; in indx_find_sort() local
1287 level = fnd->level; in indx_find_sort()
1804 e = fnd->level - 1 == level ? fnd->de[level] : NULL; in indx_insert_into_buffer()
2195 level = fnd->level - 1; in indx_get_entry_to_replace()
2309 level = fnd->level; in indx_delete_entry()
2408 level = fnd->level; in indx_delete_entry()
2445 for (level = 0; level < fnd2->level; level++) { in indx_delete_entry()
2446 fnd_push(fnd, fnd2->nodes[level], fnd2->de[level]); in indx_delete_entry()
2452 for (level = fnd->level; level; level--) { in indx_delete_entry()
[all …]
|
| /fs/smb/server/ |
| A D | oplock.c | 43 opinfo->level = SMB2_OPLOCK_LEVEL_NONE; in alloc_opinfo()
243 opinfo->level = SMB2_OPLOCK_LEVEL_II; in opinfo_write_to_read()
261 opinfo->level = SMB2_OPLOCK_LEVEL_II; in opinfo_read_handle_to_read()
360 opinfo->level = SMB2_OPLOCK_LEVEL_II; in lease_none_upgrade()
596 if (opinfo->level <= req_op_level) { in oplock_break_pending()
707 br_info->level = opinfo->level; in smb2_oplock_break_noti()
864 brk_opinfo->level); in oplock_break()
1023 op2->level = op1->level; in copy_lease()
1066 switch (level) { in set_oplock_level()
1362 } else if (brk_op->level != in smb_break_all_levII_oplock()
[all …]
|
| /fs/ocfs2/ |
| A D | dlmglue.c | 336 int level,
345 int level) in ocfs2_cluster_unlock() argument
844 switch(level) { in ocfs2_inc_holders()
861 switch(level) { in ocfs2_dec_holders()
1335 level, in ocfs2_lock_create()
1471 int level, in __ocfs2_cluster_lock() argument
1583 level, in __ocfs2_cluster_lock()
1685 int level, in __ocfs2_cluster_unlock() argument
2605 *level = 1; in ocfs2_inode_lock_atime()
2610 *level = 0; in ocfs2_inode_lock_atime()
[all …]
|