Enum TreeBlock 

pub enum TreeBlock {
    Node {
        header: Header,
        ptrs: Vec<KeyPtr>,
    },
    Leaf {
        header: Header,
        items: Vec<Item>,
        data: Vec<u8>,
    },
}

A parsed btrfs tree block: either an internal node or a leaf.

Nodes (level > 0) contain sorted key pointers to child blocks. Leaves (level == 0) contain sorted items whose data payloads can be parsed with crate::items::parse_item_payload.

Variants

Node

Internal node (level > 0): contains key pointers to child blocks.

Fields

header: Header

The tree block header.

ptrs: Vec<KeyPtr>

Sorted key pointers to child blocks.

Leaf

Leaf node (level == 0): contains items with data payloads.

Fields

header: Header

The tree block header.

items: Vec<Item>

Sorted item descriptors (key + offset/size into the data area).

data: Vec<u8>

The full block data, so item formatters can extract payloads.

Implementations

impl TreeBlock

pub fn parse(buf: &[u8]) -> Self

Parse a tree block from a nodesize-length buffer.

pub fn header(&self) -> &Header

Return a reference to the header.

pub fn item_data(&self, index: usize) -> Option<&[u8]>

For a leaf block, get the data slice for item at index.

The item’s offset field is relative to the start of the data area, which begins right after the header. So the absolute offset in the block buffer is HEADER_SIZE + item.offset.