Lines Matching defs:nr
44 u32 total_data, u32 total_size, int nr);
729 u32 nr = btrfs_header_nritems(leaf);
730 if (nr == 0)
732 return btrfs_item_offset_nr(leaf, nr - 1);
1360 u32 nr;
1383 nr = slot;
1386 if (nr == 0)
1388 nr--;
1390 nr++;
1391 if (nr >= nritems)
1395 btrfs_node_key(node, &disk_key, nr);
1399 search = btrfs_node_blockptr(node, nr);
1403 btrfs_node_ptr_generation(node, nr));
2269 * and nr indicate which items in the leaf to check. This totals up the
2272 static int leaf_space_used(struct extent_buffer *l, int start, int nr)
2276 int end = min(nritems, start + nr) - 1;
2278 if (!nr)
2282 data_len += sizeof(struct btrfs_item) * nr;
2327 u32 nr;
2333 nr = 0;
2335 nr = max_t(u32, 1, min_slot);
2342 while (i >= nr) {
2557 u32 nr;
2566 nr = min(right_nritems, max_slot);
2568 nr = min(right_nritems - 1, max_slot);
2570 for (i = 0; i < nr; i++) {
2655 printk(KERN_CRIT "push items %d nr %u\n", push_items,
3530 int nr)
3544 for (i = 0; i < nr; i++) {
3548 nr = i;
3553 BUG_ON(nr == 0);
3567 for (i = nr; i >= 0; i--) {
3573 nr = i;
3587 for (i = 1; i < nr; i++) {
3592 nr = i;
3626 memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + nr),
3642 nr = 1;
3646 for (i = 0; i < nr; i++) {
3654 btrfs_set_header_nritems(leaf, nritems + nr);
3669 ret = nr;
3682 u32 total_data, u32 total_size, int nr)
3741 memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + nr),
3753 for (i = 0; i < nr; i++) {
3762 btrfs_set_header_nritems(leaf, nritems + nr);
3788 int nr)
3797 for (i = 0; i < nr; i++)
3800 total_size = total_data + (nr * sizeof(struct btrfs_item));
3812 total_data, total_size, nr);
3922 struct btrfs_path *path, int slot, int nr)
3934 last_off = btrfs_item_offset_nr(leaf, slot + nr - 1);
3936 for (i = 0; i < nr; i++)
3941 if (slot + nr != nritems) {
3949 for (i = slot + nr; i < nritems; i++) {
3970 btrfs_item_nr_offset(slot + nr),
3972 (nritems - slot - nr));
3974 btrfs_set_header_nritems(leaf, nritems - nr);
3975 nritems -= nr;