Home
last modified time | relevance | path

Searched refs:nritems (Results 1 – 12 of 12) sorted by relevance

/linux/fs/btrfs/
H A Dtree-log.c2345 int nritems;
2382 nritems = btrfs_header_nritems(path->nodes[0]); in find_dir_range()
2384 if (path->slots[0] >= nritems) { in find_dir_range()
2510 int nritems; in check_item_in_log()
2531 nritems = btrfs_header_nritems(wc->subvol_path->nodes[0]); in replay_xattr_deletes()
2532 for (int i = wc->subvol_path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2694 int nritems; in replay_dir_deletes()
2705 nritems = btrfs_header_nritems(wc->subvol_path->nodes[0]); in replay_dir_deletes() local
2706 if (wc->subvol_path->slots[0] >= nritems) { in replay_dir_deletes()
2761 int nritems;
2356 int nritems; find_dir_range() local
2521 int nritems; replay_xattr_deletes() local
2772 int nritems; replay_one_buffer() local
4143 const int nritems = btrfs_header_nritems(path->nodes[0]); process_dir_items_leaf() local
5555 int nritems = btrfs_header_nritems(leaf); btrfs_log_all_xattrs() local
[all...]
H A Ddefrag.c459 u32 nritems; in btrfs_defrag_leaves() local
462 nritems = btrfs_header_nritems(root_node); in btrfs_defrag_leaves()
466 nritems - 1); in btrfs_defrag_leaves()
642 * If btrfs_search_slot() makes path to point beyond nritems, in defrag_get_extent()
H A Dfile-item.c1075 const u32 nritems = btrfs_header_nritems(path->nodes[0]); in find_next_csum_offset()
1080 if (nritems == 0 || slot >= nritems) { in find_next_csum_offset()
1073 const u32 nritems = btrfs_header_nritems(path->nodes[0]); find_next_csum_offset() local
H A Drelocation.c940 u32 nritems; in replace_file_extents()
954 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
955 for (i = 0; i < nritems; i++) { in replace_file_extents()
1325 u32 nritems;
1336 nritems = btrfs_header_nritems(eb); in invalidate_extent_cache()
1337 while (path->slots[i] + 1 < nritems) { in invalidate_extent_cache()
1363 u32 nritems; in invalidate_extent_cache()
1369 nritems = btrfs_header_nritems(eb); in invalidate_extent_cache()
1370 while (path->slots[i] < nritems) { in invalidate_extent_cache()
1376 if (path->slots[i] >= nritems) { in invalidate_extent_cache()
869 u32 nritems; replace_file_extents() local
1254 u32 nritems; walk_up_reloc_tree() local
1292 u32 nritems; walk_down_reloc_tree() local
[all...]
H A Dref-verify.c501 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
503 for (i = 0; i < nritems; i++) { in process_leaf()
H A Dtree-checker.c2404 u32 nritems = btrfs_header_nritems(leaf); in __btrfs_check_leaf()
2427 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in __btrfs_check_node()
2463 if (unlikely(nritems == 0)) in __btrfs_check_node()
2477 for (slot = 0; slot < nritems; slot++) { in __btrfs_check_node()
2581 "corrupt node: root=%llu block=%llu, nritems too %s, have %lu expect range [1,%u]", in btrfs_verify_level_key()
2714 "invalid tree nritems, bytenr=%llu nritems=0 expect >0",
2271 u32 nritems = btrfs_header_nritems(leaf); __btrfs_check_leaf() local
H A Dextent-tree.c447 u32 nritems; in lookup_extent_data_ref() local
480 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
482 if (path->slots[0] >= nritems) { in lookup_extent_data_ref()
491 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
2561 u32 nritems; in __btrfs_mod_ref()
2574 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2589 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
5559 u32 nritems; in reada_walk_down()
5575 nritems = btrfs_header_nritems(eb); in reada_walk_down()
5577 for (slot = path->slots[wc->level]; slot < nritems; slo in reada_walk_down()
2557 u32 nritems; __btrfs_mod_ref() local
5553 u32 nritems; reada_walk_down() local
[all...]
H A Dextent_io.c2256 u32 nritems; in write_one_eb()
2262 /* Set btree blocks beyond nritems with 0 to avoid stale content */ in write_one_eb()
2263 nritems = btrfs_header_nritems(eb); in write_one_eb()
2265 end = btrfs_node_key_ptr_offset(eb, nritems); in write_one_eb()
2272 start = btrfs_item_nr_offset(eb, nritems); in write_one_eb()
2274 if (nritems == 0) in write_one_eb()
2277 end += btrfs_item_offset(eb, nritems - 1); in write_one_eb()
2215 u32 nritems; prepare_eb_write() local
H A Dblock-group.c760 u32 nritems; in load_extent_tree_free()
805 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
813 if (path->slots[0] < nritems) { in load_extent_tree_free()
837 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
732 u32 nritems; load_extent_tree_free() local
H A Dbackref.c112 int nritems; in find_extent_in_eb() local
121 nritems = btrfs_header_nritems(eb); in find_extent_in_eb()
122 for (slot = 0; slot < nritems; ++slot) { in find_extent_in_eb()
497 * slot == nritems. in add_all_parents()
H A Dioctl.c1414 int nritems; in copy_to_sk()
1421 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
1424 i = nritems; in copy_to_sk()
1429 for (i = slot; i < nritems; i++) { in copy_to_sk()
1408 int nritems; copy_to_sk() local
H A Dinode.c3743 u32 nritems = btrfs_header_nritems(leaf); in btrfs_orphan_cleanup()
3758 while (slot < nritems) { in btrfs_orphan_cleanup()
3920 u32 nritems = btrfs_header_nritems(leaf); acls_after_inode_item() local