Lines Matching defs:leaf
670 struct extent_buffer *leaf;
695 leaf = path->nodes[0];
696 qgroup_info = btrfs_item_ptr(leaf, path->slots[0],
698 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid);
699 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0);
700 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0);
701 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0);
702 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0);
704 btrfs_mark_buffer_dirty(trans, leaf);
714 leaf = path->nodes[0];
715 qgroup_limit = btrfs_item_ptr(leaf, path->slots[0],
717 btrfs_set_qgroup_limit_flags(leaf, qgroup_limit, 0);
718 btrfs_set_qgroup_limit_max_rfer(leaf, qgroup_limit, 0);
719 btrfs_set_qgroup_limit_max_excl(leaf, qgroup_limit, 0);
720 btrfs_set_qgroup_limit_rsv_rfer(leaf, qgroup_limit, 0);
721 btrfs_set_qgroup_limit_rsv_excl(leaf, qgroup_limit, 0);
723 btrfs_mark_buffer_dirty(trans, leaf);
915 struct extent_buffer *leaf = NULL;
931 leaf = path->nodes[0];
932 nr = btrfs_header_nritems(leaf);
936 * delete the leaf one by one
959 struct extent_buffer *leaf;
1062 leaf = path->nodes[0];
1063 ptr = btrfs_item_ptr(leaf, path->slots[0],
1065 btrfs_set_qgroup_status_generation(leaf, ptr, trans->transid);
1066 btrfs_set_qgroup_status_version(leaf, ptr, BTRFS_QGROUP_STATUS_VERSION);
1069 btrfs_set_qgroup_status_flags(leaf, ptr, fs_info->qgroup_flags &
1071 btrfs_set_qgroup_status_rescan(leaf, ptr, 0);
1073 btrfs_mark_buffer_dirty(trans, leaf);
1090 leaf = path->nodes[0];
1091 btrfs_item_key_to_cpu(leaf, &found_key, slot);
1968 * nodes which have had all slots visited. If a node (leaf or
2165 /* Record leaf file extents */
2415 * When we reach a leaf, we account for file extent items in it,
3279 * Check if the leaf is the last leaf. Which means all node pointers