opensource/kubo
1
0
Fork 0
mirror of https://github.com/ipfs/kubo.git synced 2025-06-26 23:53:19 +08:00
Code Issues Projects Releases Wiki Activity

dag: refactor trickle importer

Browse Source 
License: MIT
Signed-off-by: Lucas Molas <schomatis@gmail.com>
This commit is contained in:
Lucas Molas
2018-02-22 20:51:35 -03:00
parent 28acec2adb
commit 9eb864a1d3
1 changed files with 18 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
importer/trickle/trickledag.go
View File

@ -38,20 +38,9 @@ const layerRepeat = 4
// explanation. // explanation.
func Layout(db *h.DagBuilderHelper) (ipld.Node, error) { func Layout(db *h.DagBuilderHelper) (ipld.Node, error) {
root := db.NewUnixfsNode() root := db.NewUnixfsNode()
if err := db.FillNodeLayer(root); err != nil { if err := fillTrickleRec(db, root, -1); err != nil {
return nil, err return nil, err
} }
for level := 1; !db.Done(); level++ {
for i := 0; i < layerRepeat && !db.Done(); i++ {
next := db.NewUnixfsNode()
if err := fillTrickleRec(db, next, level); err != nil {
return nil, err
}
if err := root.AddChild(next, db); err != nil {
return nil, err
}
}
}
out, err := db.Add(root) out, err := db.Add(root)
if err != nil { if err != nil {
@ -65,25 +54,35 @@ func Layout(db *h.DagBuilderHelper) (ipld.Node, error) {
return out, nil return out, nil
} }
func fillTrickleRec(db *h.DagBuilderHelper, node *h.UnixfsNode, depth int) error { // fillTrickleRec creates a trickle (sub-)tree with an optional maximum specified depth
// in the case maxDepth is greater than zero, or with unlimited depth otherwise
// (where the DAG builder will signal the end of data to end the function).
func fillTrickleRec(db *h.DagBuilderHelper, node *h.UnixfsNode, maxDepth int) error {
// Always do this, even in the base case // Always do this, even in the base case
if err := db.FillNodeLayer(node); err != nil { if err := db.FillNodeLayer(node); err != nil {
return err return err
} }
for i := 1; i < depth && !db.Done(); i++ { for depth := 1; ; depth++ {
for j := 0; j < layerRepeat && !db.Done(); j++ { // Apply depth limit only if the parameter is set (> 0).
next := db.NewUnixfsNode() if maxDepth > 0 && depth == maxDepth {
if err := fillTrickleRec(db, next, i); err != nil { return nil
}
for layer := 0; layer < layerRepeat; layer++ {
if db.Done() {
return nil
}
nextChild := db.NewUnixfsNode()
if err := fillTrickleRec(db, nextChild, depth); err != nil {
return err return err
} }
if err := node.AddChild(next, db); err != nil { if err := node.AddChild(nextChild, db); err != nil {
return err return err
} }
} }
} }
return nil
} }
// Append appends the data in `db` to the dag, using the Trickledag format // Append appends the data in `db` to the dag, using the Trickledag format