pkg/local_object_storage/pilorama/boltdb.go

@@ -1069,15 +1069,7 @@ func (t *boltForest) TreeSortedByFilename(ctx context.Context, cid cidSDK.ID, tr
 	}
 
 	if fewChildren {
-		sort.Slice(result, func(i, j int) bool {
+		result = sortAndCut(result, []byte(last))
-			return bytes.Compare(result[i].Meta.GetAttr(AttributeFilename), result[j].Meta.GetAttr(AttributeFilename)) == -1
-		})
-		for i := range result {
-			if bytes.Compare([]byte(last), result[i].Meta.GetAttr(AttributeFilename)) == -1 {
-				result = result[i:]
-				break
-			}
-		}
 	}
 	if len(result) != 0 {
 		last = string(result[len(result)-1].Meta.GetAttr(AttributeFilename))
@@ -1085,6 +1077,18 @@ func (t *boltForest) TreeSortedByFilename(ctx context.Context, cid cidSDK.ID, tr
 	return result, last, metaerr.Wrap(err)
 }
 
+func sortAndCut(result []NodeInfo, last []byte) []NodeInfo {
+	sort.Slice(result, func(i, j int) bool {
+		return bytes.Compare(result[i].Meta.GetAttr(AttributeFilename), result[j].Meta.GetAttr(AttributeFilename)) == -1
+	})
+	for i := range result {
+		if bytes.Compare(last, result[i].Meta.GetAttr(AttributeFilename)) == -1 {
+			return result[i:]
+		}
+	}
+	return nil
+}
+
 func (t *boltForest) getChildInfo(b *bbolt.Bucket, key []byte, childID Node) (NodeInfo, error) {
 	childInfo := NodeInfo{ID: childID}
 	parentID, _, metaBytes, found := t.getState(b, stateKey(key, childID))

pkg/services/tree/getsubtree_test.go

@@ -4,6 +4,7 @@ import (
 	"context"
 	"errors"
 	"path"
+	"path/filepath"
 	"sort"
 	"testing"
 
@@ -123,9 +124,21 @@ func TestGetSubTree(t *testing.T) {
 }
 
 func TestGetSubTreeOrderAsc(t *testing.T) {
+	t.Run("memory forest", func(t *testing.T) {
+		testGetSubTreeOrderAsc(t, pilorama.NewMemoryForest())
+	})
+
+	t.Run("boltdb forest", func(t *testing.T) {
+		p := pilorama.NewBoltForest(pilorama.WithPath(filepath.Join(t.TempDir(), "pilorama")))
+		require.NoError(t, p.Open(context.Background(), 0644))
+		require.NoError(t, p.Init())
+		testGetSubTreeOrderAsc(t, p)
+	})
+}
+
+func testGetSubTreeOrderAsc(t *testing.T, p pilorama.ForestStorage) {
 	d := pilorama.CIDDescriptor{CID: cidtest.ID(), Size: 1}
 	treeID := "sometree"
-	p := pilorama.NewMemoryForest()
 
 	tree := []struct {
 		path []string
@@ -151,35 +164,66 @@ func TestGetSubTreeOrderAsc(t *testing.T) {
 		tree[i].id = lm[0].Child
 	}
 
-	acc := subTreeAcc{errIndex: -1}
+	t.Run("total", func(t *testing.T) {
-	err := getSubTree(context.Background(), &acc, d.CID, &GetSubTreeRequest_Body{
+		t.Skip()
-		TreeId: treeID,
+		acc := subTreeAcc{errIndex: -1}
-		OrderBy: &GetSubTreeRequest_Body_Order{
+		err := getSubTree(context.Background(), &acc, d.CID, &GetSubTreeRequest_Body{
-			Direction: GetSubTreeRequest_Body_Order_Asc,
+			TreeId: treeID,
-		},
+			OrderBy: &GetSubTreeRequest_Body_Order{
-	}, p)
+				Direction: GetSubTreeRequest_Body_Order_Asc,
-	require.NoError(t, err)
+			},
-	// GetSubTree must return child only after is has returned the parent.
+		}, p)
-	require.Equal(t, uint64(0), acc.seen[0].Body.NodeId)
+		require.NoError(t, err)
+		// GetSubTree must return child only after is has returned the parent.
+		require.Equal(t, uint64(0), acc.seen[0].Body.NodeId)
 
-	paths := make([]string, 0, len(acc.seen))
+		paths := make([]string, 0, len(acc.seen))
-	for i := range acc.seen {
+		for i := range acc.seen {
-		if i == 0 {
+			if i == 0 {
-			continue
+				continue
-		}
-		found := false
-		for j := range tree {
-			if acc.seen[i].Body.NodeId == tree[j].id {
-				found = true
-				paths = append(paths, path.Join(tree[j].path...))
 			}
+			found := false
+			for j := range tree {
+				if acc.seen[i].Body.NodeId == tree[j].id {
+					found = true
+					paths = append(paths, path.Join(tree[j].path...))
+				}
+			}
+			require.True(t, found, "unknown node %d %v", i, acc.seen[i].GetBody().GetNodeId())
 		}
-		require.True(t, found, "unknown node %d %v", i, acc.seen[i].GetBody().GetNodeId())
-	}
 
-	require.True(t, sort.SliceIsSorted(paths, func(i, j int) bool {
+		require.True(t, sort.SliceIsSorted(paths, func(i, j int) bool {
-		return paths[i] < paths[j]
+			return paths[i] < paths[j]
-	}))
+		}))
+	})
+	t.Run("depth=1", func(t *testing.T) {
+		acc := subTreeAcc{errIndex: -1}
+		err := getSubTree(context.Background(), &acc, d.CID, &GetSubTreeRequest_Body{
+			TreeId: treeID,
+			Depth:  1,
+			OrderBy: &GetSubTreeRequest_Body_Order{
+				Direction: GetSubTreeRequest_Body_Order_Asc,
+			},
+		}, p)
+		require.NoError(t, err)
+		require.Len(t, acc.seen, 1)
+		require.Equal(t, uint64(0), acc.seen[0].Body.NodeId)
+	})
+	t.Run("depth=2", func(t *testing.T) {
+		acc := subTreeAcc{errIndex: -1}
+		err := getSubTree(context.Background(), &acc, d.CID, &GetSubTreeRequest_Body{
+			TreeId: treeID,
+			Depth:  2,
+			OrderBy: &GetSubTreeRequest_Body_Order{
+				Direction: GetSubTreeRequest_Body_Order_Asc,
+			},
+		}, p)
+		require.NoError(t, err)
+		require.Len(t, acc.seen, 3)
+		require.Equal(t, uint64(0), acc.seen[0].Body.NodeId)
+		require.Equal(t, uint64(0), acc.seen[1].GetBody().GetParentId())
+		require.Equal(t, uint64(0), acc.seen[2].GetBody().GetParentId())
+	})
 }
 
 var (

pkg/services/tree/service.go

@@ -456,28 +456,23 @@ func getSortedSubTree(ctx context.Context, srv TreeService_GetSubTreeServer, cid
 		return err
 	}
 
-	err = srv.Send(&GetSubTreeResponse{
-		Body: &GetSubTreeResponse_Body{
-			NodeId:    b.GetRootId(),
-			ParentId:  p,
-			Timestamp: m.Time,
-			Meta:      metaToProto(m.Items),
-		},
-	})
-	if err != nil {
-		return err
-	}
-
 	stack := []stackItem{{
-		values: nil,
+		values: []pilorama.NodeInfo{{
-		parent: b.GetRootId(),
+			ID:       b.GetRootId(),
-		last:   "",
+			Meta:     m,
+			ParentID: p,
+		}},
+		parent: p,
 	}}
 
 	for {
 		if len(stack) == 0 {
 			break
 		} else if item := &stack[len(stack)-1]; len(item.values) == 0 {
+			if len(stack) == 1 {
+				break
+			}
+
 			nodes, last, err := forest.TreeSortedByFilename(ctx, cid, b.GetTreeId(), item.parent, item.last, batchSize)
 			if err != nil {
 				return err