Home
last modified time | relevance | path

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

/linux/fs/btrfs/
H A Dctree.c1298 u32 nritems; in reada_for_search() local
1343 nritems = btrfs_header_nritems(node); in reada_for_search()
1354 if (nr >= nritems) in reada_for_search()
1379 int nritems; in reada_for_balance() local
1385 nritems = btrfs_header_nritems(parent); in reada_for_balance()
1390 if (slot + 1 < nritems) in reada_for_balance()
1429 u32 nritems; in unlock_up() local
1431 nritems = btrfs_header_nritems(path->nodes[i]); in unlock_up()
1432 if (nritems < 1 || path->slots[i] >= nritems - 1) { in unlock_up()
2944 int nritems; in insert_ptr() local
[all …]
H A Dreflink.c406 u32 nritems; in btrfs_clone() local
455 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
457 if (path->slots[0] >= nritems) { in btrfs_clone()
463 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
H A Dtree-log.c2328 int nritems; in find_dir_range() local
2365 nritems = btrfs_header_nritems(path->nodes[0]); in find_dir_range()
2367 if (path->slots[0] >= nritems) { in find_dir_range()
2493 int nritems; in replay_xattr_deletes() local
2514 nritems = btrfs_header_nritems(wc->subvol_path->nodes[0]); in replay_xattr_deletes()
2515 for (int i = wc->subvol_path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2677 int nritems; in replay_dir_deletes() local
2688 nritems = btrfs_header_nritems(wc->subvol_path->nodes[0]); in replay_dir_deletes()
2689 if (wc->subvol_path->slots[0] >= nritems) { in replay_dir_deletes()
2744 int nritems; in replay_one_buffer() 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()
H A Dfile-item.c1099 const u32 nritems = btrfs_header_nritems(path->nodes[0]); in find_next_csum_offset() local
1104 if (nritems == 0 || slot >= nritems) { in find_next_csum_offset()
H A Drelocation.c947 u32 nritems; in replace_file_extents() local
961 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
962 for (i = 0; i < nritems; i++) { in replace_file_extents()
1332 u32 nritems; in walk_up_reloc_tree() local
1343 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1344 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1370 u32 nritems; in walk_down_reloc_tree() local
1376 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1377 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1383 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
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 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() local
2574 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2589 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
5560 u32 nritems; in reada_walk_down() local
5576 nritems = btrfs_header_nritems(eb); in reada_walk_down()
5578 for (slot = path->slots[wc->level]; slot < nritems; slot++) { in reada_walk_down()
H A Dtree-checker.c2410 u32 nritems = btrfs_header_nritems(leaf); in __btrfs_check_leaf() local
2433 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in __btrfs_check_leaf()
2469 if (unlikely(nritems == 0)) in __btrfs_check_leaf()
2483 for (slot = 0; slot < nritems; slot++) { in __btrfs_check_leaf()
H A Dextent_io.c2419 u32 nritems; in prepare_eb_write() local
2426 nritems = btrfs_header_nritems(eb); in prepare_eb_write()
2428 end = btrfs_node_key_ptr_offset(eb, nritems); in prepare_eb_write()
2435 start = btrfs_item_nr_offset(eb, nritems); in prepare_eb_write()
2437 if (nritems == 0) in prepare_eb_write()
2440 end += btrfs_item_offset(eb, nritems - 1); in prepare_eb_write()
H A Dsend.c7324 const int nritems = btrfs_header_nritems(parent); in tree_move_down() local
7343 for (slot++; slot < nritems && reada_done < reada_max; slot++) { in tree_move_down()
7364 int nritems; in tree_move_next_or_upnext() local
7365 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
7369 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
7371 path->slots[*level] = nritems - 1; in tree_move_next_or_upnext()
7382 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
H A Dblock-group.c760 u32 nritems; in load_extent_tree_free() local
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()
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()
H A Dioctl.c1425 int nritems; in copy_to_sk() local
1432 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
1435 i = nritems; in copy_to_sk()
1440 for (i = slot; i < nritems; i++) { in copy_to_sk()
H A Dinode.c3929 u32 nritems = btrfs_header_nritems(leaf); in acls_after_inode_item() local
3944 while (slot < nritems) { in acls_after_inode_item()