// Copyright (C) 2022-2023  Luke Shumaker <lukeshu@lukeshu.com>
//
// SPDX-License-Identifier: GPL-2.0-or-later

package btrfs

import (
	"context"
	"fmt"

	"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfsprim"
	"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfstree"
	"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfsvol"
	"git.lukeshu.com/btrfs-progs-ng/lib/containers"
	"git.lukeshu.com/btrfs-progs-ng/lib/textui"
)

// This file is ordered from low-level to high-level.

// btrfstree.NodeSource ////////////////////////////////////////////////////////

type nodeCacheEntry struct {
	node *btrfstree.Node
	err  error
}

// AcquireNode implements btrfstree.NodeSource.
func (fs *FS) AcquireNode(ctx context.Context, addr btrfsvol.LogicalAddr, exp btrfstree.NodeExpectations) (*btrfstree.Node, error) {
	if fs.cacheNodes == nil {
		fs.cacheNodes = containers.NewARCache[btrfsvol.LogicalAddr, nodeCacheEntry](
			textui.Tunable(4*(btrfstree.MaxLevel+1)),
			containers.SourceFunc[btrfsvol.LogicalAddr, nodeCacheEntry](fs.readNode),
		)
	}

	nodeEntry := fs.cacheNodes.Acquire(ctx, addr)
	if nodeEntry.err != nil {
		err := nodeEntry.err
		fs.cacheNodes.Release(addr)
		return nil, err
	}

	if nodeEntry.node != nil {
		if err := exp.Check(nodeEntry.node); err != nil {
			fs.cacheNodes.Release(addr)
			return nil, fmt.Errorf("btrfstree.ReadNode: node@%v: %w", addr, err) // fmt.Errorf("btrfs.FS.AcquireNode: node@%v: %w", addr, err)
		}
	}

	return nodeEntry.node, nil
}

// ReleaseNode implements btrfstree.NodeSource.
func (fs *FS) ReleaseNode(node *btrfstree.Node) {
	if node == nil {
		return
	}
	fs.cacheNodes.Release(node.Head.Addr)
}

func (fs *FS) readNode(_ context.Context, addr btrfsvol.LogicalAddr, nodeEntry *nodeCacheEntry) {
	nodeEntry.node.RawFree()
	nodeEntry.node = nil

	sb, err := fs.Superblock()
	if err != nil {
		nodeEntry.err = err
		return
	}

	nodeEntry.node, nodeEntry.err = btrfstree.ReadNode[btrfsvol.LogicalAddr](fs, *sb, addr)
}

var _ btrfstree.NodeSource = (*FS)(nil)

// btrfstree.TreeOperator //////////////////////////////////////////////////////

// TreeWalk implements btrfstree.TreeOperator.
func (fs *FS) TreeWalk(ctx context.Context, treeID btrfsprim.ObjID, errHandle func(*btrfstree.TreeError), cbs btrfstree.TreeWalkHandler) {
	btrfstree.TreeOperatorImpl{NodeSource: fs}.TreeWalk(ctx, treeID, errHandle, cbs)
}

// TreeLookup implements btrfstree.TreeOperator.
func (fs *FS) TreeLookup(treeID btrfsprim.ObjID, key btrfsprim.Key) (btrfstree.Item, error) {
	return btrfstree.TreeOperatorImpl{NodeSource: fs}.TreeLookup(treeID, key)
}

// TreeSearch implements btrfstree.TreeOperator.
func (fs *FS) TreeSearch(treeID btrfsprim.ObjID, searcher btrfstree.TreeSearcher) (btrfstree.Item, error) {
	return btrfstree.TreeOperatorImpl{NodeSource: fs}.TreeSearch(treeID, searcher)
}

// TreeSearchAll implements btrfstree.TreeOperator.
func (fs *FS) TreeSearchAll(treeID btrfsprim.ObjID, searcher btrfstree.TreeSearcher) ([]btrfstree.Item, error) {
	return btrfstree.TreeOperatorImpl{NodeSource: fs}.TreeSearchAll(treeID, searcher)
}

var _ btrfstree.TreeOperator = (*FS)(nil)