btrfs: Split off btrfstree and btrfsprim sub-packages

1 files changed, 0 insertions, 128 deletions

diff --git a/lib/btrfs/btree_path.go b/lib/btrfs/btree_path.go
deleted file mode 100644
index 0124aea..0000000
--- a/lib/btrfs/btree_path.go
+++ /dev/null
@@ -1,128 +0,0 @@
-// Copyright (C) 2022  Luke Shumaker <lukeshu@lukeshu.com>
-//
-// SPDX-License-Identifier: GPL-2.0-or-later
-
-package btrfs
-
-import (
-	"fmt"
-	"io"
-	"strings"
-
-	"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfsitem"
-	"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfsvol"
-)
-
-// - The first element will always have an ItemIdx of -1.
-//
-//   - For .Item() callbacks, the last element will always have a
-//     NodeAddr of 0.
-//
-// For example, a path through a tree, with the associated PathElems:
-//
-//	[superblock: tree=B, lvl=3, gen=6]
-//	     |
-//	     | <------------------------------------------ pathElem={from_tree:B, from_gen=6, from_idx=-1,
-//	     |                                                       to_addr:0x01, to_lvl=3}
-//	  +[0x01]-------------+
-//	  | lvl=3 gen=6 own=B |
-//	  +-+-+-+-+-+-+-+-+-+-+
-//	  |0|1|2|3|4|5|6|7|8|9|
-//	  +-+-+-+-+-+-+-+-+-+-+
-//	                 |
-//	                 | <------------------------------ pathElem:{from_tree:B, from_gen:6, from_idx:7,
-//	                 |                                           to_addr:0x02, to_lvl:2}
-//	              +[0x02]--------------+
-//	              | lvl=2 gen=5 own=B  |
-//	              +-+-+-+-+-+-+-+-+-+-+
-//	              |0|1|2|3|4|5|6|7|8|9|
-//	              +-+-+-+-+-+-+-+-+-+-+
-//	                           |
-//	                           | <-------------------- pathElem={from_tree:B, from_gen:5, from_idx:6,
-//	                           |                                 to_addr:0x03, to_lvl:1}
-//	                        +[0x03]-------------+
-//	                        | lvl=1 gen=5 own=A |
-//	                        +-+-+-+-+-+-+-+-+-+-+
-//	                        |0|1|2|3|4|5|6|7|8|9|
-//	                        +-+-+-+-+-+-+-+-+-+-+
-//	                               |
-//	                               | <---------------- pathElem={from_tree:A, from_gen:5, from_idx:3,
-//	                               |                             to_addr:0x04, to_lvl:0}
-//	                             +[0x04]-------------+
-//	                             | lvl=0 gen=2 own=A |
-//	                             +-+-+-+-+-+-+-+-+-+-+
-//	                             |0|1|2|3|4|5|6|7|8|9|
-//	                             +-+-+-+-+-+-+-+-+-+-+
-//	                                |
-//	                                | <--------------- pathElem={from_tree:A, from_gen:2, from_idx:1,
-//	                                |                            to_addr:0, to_lvl:0}
-//	                              [item]
-type TreePath []TreePathElem
-
-// A TreePathElem essentially represents a KeyPointer.  If there is an
-// error looking up the tree root, everything but FromTree is zero.
-type TreePathElem struct {
-	// FromTree is the owning tree ID of the parent node; or the
-	// well-known tree ID if this is the root.
-	FromTree ObjID
-	// FromGeneration is the generation of the parent node the
-	// parent node; or generation stored in the superblock if this
-	// is the root.
-	FromGeneration Generation
-	// FromItemIdx is the index of this KeyPointer in the parent
-	// Node; or -1 if this is the root and there is no KeyPointer.
-	FromItemIdx int
-
-	// ToNodeAddr is the address of the node that the KeyPointer
-	// points at, or 0 if this is a leaf item and nothing is being
-	// pointed at.
-	ToNodeAddr btrfsvol.LogicalAddr
-	// ToNodeLevel is the expected or actual level of the node at
-	// ToNodeAddr, or 0 if this is a leaf item and nothing is
-	// being pointed at.
-	ToNodeLevel uint8
-}
-
-func (elem TreePathElem) writeNodeTo(w io.Writer) {
-	fmt.Fprintf(w, "node:%d@%v", elem.ToNodeLevel, elem.ToNodeAddr)
-}
-
-func (path TreePath) String() string {
-	if len(path) == 0 {
-		return "(empty-path)"
-	} else {
-		var ret strings.Builder
-		fmt.Fprintf(&ret, "%s->", path[0].FromTree.Format(btrfsitem.ROOT_ITEM_KEY))
-		if len(path) == 1 && path[0] == (TreePathElem{FromTree: path[0].FromTree}) {
-			ret.WriteString("(empty-path)")
-		} else {
-			path[0].writeNodeTo(&ret)
-		}
-		for _, elem := range path[1:] {
-			fmt.Fprintf(&ret, "[%v]", elem.FromItemIdx)
-			if elem.ToNodeAddr != 0 {
-				ret.WriteString("->")
-				elem.writeNodeTo(&ret)
-			}
-		}
-		return ret.String()
-	}
-}
-
-func (path TreePath) DeepCopy() TreePath {
-	return append(TreePath(nil), path...)
-}
-
-func (path TreePath) Parent() TreePath {
-	return path[:len(path)-1]
-}
-
-// path.Node(x) is like &path[x], but negative values of x move down
-// from the end of path (similar to how lists work in many other
-// languages, such as Python).
-func (path TreePath) Node(x int) *TreePathElem {
-	if x < 0 {
-		x += len(path)
-	}
-	return &path[x]
-}