| /linux-master/fs/btrfs/ |
| H A D | ctree.c | 1329 u32 nritems; local
1374 nritems = btrfs_header_nritems(node);
1385 if (nr >= nritems)
1410 int nritems; local
1416 nritems = btrfs_header_nritems(parent);
1421 if (slot + 1 < nritems)
1460 u32 nritems; local
1462 nritems = btrfs_header_nritems(path->nodes[i]);
1463 if (nritems < 1 || path->slots[i] >= nritems
2920 int nritems; local
3067 int nritems = btrfs_header_nritems(l); local
3087 int nritems = btrfs_header_nritems(leaf); local
3521 copy_for_split(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct extent_buffer *l, struct extent_buffer *right, int slot, int mid, int nritems) argument
3598 u32 nritems; local
3658 u32 nritems; local
3909 u32 nritems; local
4010 u32 nritems; local
4102 u32 nritems; local
4173 u32 nritems; local
4384 u32 nritems; local
4473 u32 nritems; local
4622 u32 nritems; local
4804 u32 nritems; local
5015 u32 nritems; local
5056 u32 nritems; local
[all...] |
| H A D | tree-mod-log.c | 371 int nritems)
376 for (i = nritems - 1; i >= 0; i--) {
379 for (j = nritems - 1; j > i; j--)
396 int nritems = 0; local
404 nritems = btrfs_header_nritems(old_root);
405 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *),
411 for (i = 0; i < nritems; i++) {
450 ret = tree_mod_log_free_eb(fs_info, tm_list, nritems);
464 for (i = 0; i < nritems; i++)
672 int nritems local
369 tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, struct tree_mod_elem **tm_list, int nritems) argument
[all...] |
| H A D | reflink.c | 346 u32 nritems; local
398 nritems = btrfs_header_nritems(path->nodes[0]);
400 if (path->slots[0] >= nritems) {
406 nritems = btrfs_header_nritems(path->nodes[0]);
|
| H A D | tree-log.c | 2027 int nritems; local
2064 nritems = btrfs_header_nritems(path->nodes[0]);
2066 if (path->slots[0] >= nritems) {
2179 int nritems; local
2194 nritems = btrfs_header_nritems(path->nodes[0]);
2195 for (i = path->slots[0]; i < nritems; i++) {
2324 int nritems; local
2330 nritems = btrfs_header_nritems(path->nodes[0]);
2331 if (path->slots[0] >= nritems) {
2385 int nritems; local
3699 const int nritems = btrfs_header_nritems(path->nodes[0]); local
5070 int nritems = btrfs_header_nritems(leaf); local
[all...] |
| H A D | relocation.c | 1074 u32 nritems; local
1089 nritems = btrfs_header_nritems(leaf);
1090 for (i = 0; i < nritems; i++) {
1443 u32 nritems; local
1454 nritems = btrfs_header_nritems(eb);
1455 while (path->slots[i] + 1 < nritems) {
1481 u32 nritems; local
1487 nritems = btrfs_header_nritems(eb);
1488 while (path->slots[i] < nritems) {
1494 if (path->slots[i] >= nritems) {
[all...] |
| H A D | defrag.c | 477 u32 nritems; local
480 nritems = btrfs_header_nritems(root_node);
484 nritems - 1);
660 * If btrfs_search_slot() makes path to point beyond nritems,
|
| H A D | file-item.c | 1008 const u32 nritems = btrfs_header_nritems(path->nodes[0]); local
1013 if (nritems == 0 || slot >= nritems) {
|
| H A D | tree-checker.c | 1790 u32 nritems = btrfs_header_nritems(leaf); local
1808 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) {
1844 if (unlikely(nritems == 0))
1858 for (slot = 0; slot < nritems; slot++) {
1968 "corrupt node: root=%llu block=%llu, nritems too %s, have %lu expect range [1,%u]",
2103 "invalid tree nritems, bytenr=%llu nritems=0 expect >0",
|
| H A D | ref-verify.c | 514 int nritems = btrfs_header_nritems(leaf); local
516 for (i = 0; i < nritems; i++) {
|
| H A D | extent-tree.c | 450 u32 nritems; local
479 nritems = btrfs_header_nritems(leaf);
481 if (path->slots[0] >= nritems) {
489 nritems = btrfs_header_nritems(leaf);
2499 u32 nritems; local
2513 nritems = btrfs_header_nritems(buf);
2528 for (i = 0; i < nritems; i++) {
5269 u32 nritems; local
5286 nritems = btrfs_header_nritems(eb);
5288 for (slot = path->slots[wc->level]; slot < nritems; slo
[all...] |
| H A D | accessors.h | 689 BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
695 BTRFS_SETGET_STACK_FUNCS(stack_header_nritems, struct btrfs_header, nritems, 32);
|
| H A D | extent_io.c | 1664 u32 nritems; local
1670 /* Set btree blocks beyond nritems with 0 to avoid stale content */
1671 nritems = btrfs_header_nritems(eb);
1673 end = btrfs_node_key_ptr_offset(eb, nritems);
1680 start = btrfs_item_nr_offset(eb, nritems);
1682 if (nritems == 0)
1685 end += btrfs_item_offset(eb, nritems - 1);
|
| H A D | block-group.c | 712 u32 nritems; local
752 nritems = btrfs_header_nritems(leaf);
760 if (path->slots[0] < nritems) {
784 nritems = btrfs_header_nritems(leaf);
|
| H A D | ioctl.c | 1583 int nritems; local
1590 nritems = btrfs_header_nritems(leaf);
1593 i = nritems;
1598 for (i = slot; i < nritems; i++) {
|
| H A D | send.c | 7441 const int nritems = btrfs_header_nritems(parent); local
7460 for (slot++; slot < nritems && reada_done < reada_max; slot++) {
7481 int nritems; local
7482 nritems = btrfs_header_nritems(path->nodes[*level]);
7486 while (path->slots[*level] >= nritems) {
7488 path->slots[*level] = nritems - 1;
7499 nritems = btrfs_header_nritems(path->nodes[*level]);
|
| H A D | backref.c | 112 int nritems; local
121 nritems = btrfs_header_nritems(eb);
122 for (slot = 0; slot < nritems; ++slot) {
498 * slot == nritems.
|
| H A D | inode.c | 3701 u32 nritems = btrfs_header_nritems(leaf); local
3716 while (slot < nritems) {
|
| /linux-master/include/uapi/linux/ |
| H A D | btrfs_tree.h | 494 __le32 nritems; member in struct:btrfs_header
|