Lines Matching defs:leaf
645 struct extent_buffer *leaf;
670 leaf = path->nodes[0];
671 qgroup_info = btrfs_item_ptr(leaf, path->slots[0],
673 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid);
674 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0);
675 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0);
676 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0);
677 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0);
679 btrfs_mark_buffer_dirty(leaf);
689 leaf = path->nodes[0];
690 qgroup_limit = btrfs_item_ptr(leaf, path->slots[0],
692 btrfs_set_qgroup_limit_flags(leaf, qgroup_limit, 0);
693 btrfs_set_qgroup_limit_max_rfer(leaf, qgroup_limit, 0);
694 btrfs_set_qgroup_limit_max_excl(leaf, qgroup_limit, 0);
695 btrfs_set_qgroup_limit_rsv_rfer(leaf, qgroup_limit, 0);
696 btrfs_set_qgroup_limit_rsv_excl(leaf, qgroup_limit, 0);
698 btrfs_mark_buffer_dirty(leaf);
889 struct extent_buffer *leaf = NULL;
907 leaf = path->nodes[0];
908 nr = btrfs_header_nritems(leaf);
912 * delete the leaf one by one
935 struct extent_buffer *leaf;
1032 leaf = path->nodes[0];
1033 ptr = btrfs_item_ptr(leaf, path->slots[0],
1035 btrfs_set_qgroup_status_generation(leaf, ptr, trans->transid);
1036 btrfs_set_qgroup_status_version(leaf, ptr, BTRFS_QGROUP_STATUS_VERSION);
1039 btrfs_set_qgroup_status_flags(leaf, ptr, fs_info->qgroup_flags);
1040 btrfs_set_qgroup_status_rescan(leaf, ptr, 0);
1042 btrfs_mark_buffer_dirty(leaf);
1059 leaf = path->nodes[0];
1060 btrfs_item_key_to_cpu(leaf, &found_key, slot);
1892 * nodes which have had all slots visited. If a node (leaf or
2102 /* Record leaf file extents */
2338 * When we reach a leaf, we account for file extent items in it,
3218 * Check if the leaf is the last leaf. Which means all node pointers