add.go 2.66 KB
Newer Older
1 2 3
package commands

import (
Juan Batiz-Benet's avatar
Juan Batiz-Benet committed
4
	"errors"
5
	"fmt"
6
	"io"
7 8 9 10 11 12 13
	"io/ioutil"
	"os"
	"path/filepath"

	"github.com/jbenet/go-ipfs/core"
	"github.com/jbenet/go-ipfs/importer"
	dag "github.com/jbenet/go-ipfs/merkledag"
14
	ft "github.com/jbenet/go-ipfs/unixfs"
15 16 17 18 19
)

// Error indicating the max depth has been exceded.
var ErrDepthLimitExceeded = fmt.Errorf("depth limit exceeded")

20
// Add is a command that imports files and directories -- given as arguments -- into ipfs.
21 22
func Add(n *core.IpfsNode, args []string, opts map[string]interface{}, out io.Writer) error {
	depth := 1
23 24

	// if recursive, set depth to reflect so
25 26 27
	if r, ok := opts["r"].(bool); r && ok {
		depth = -1
	}
28 29

	// add every path in args
30
	for _, path := range args {
31 32

		// Add the file
33
		_, err := AddPath(n, path, depth, out)
34
		if err != nil {
Juan Batiz-Benet's avatar
Juan Batiz-Benet committed
35
			if err == ErrDepthLimitExceeded && depth == 1 {
Juan Batiz-Benet's avatar
Juan Batiz-Benet committed
36
				err = errors.New("use -r to recursively add directories")
Juan Batiz-Benet's avatar
Juan Batiz-Benet committed
37
			}
38 39 40 41 42 43 44
			return fmt.Errorf("addFile error: %v", err)
		}

	}
	return nil
}

45
// AddPath adds a particular path to ipfs.
46
func AddPath(n *core.IpfsNode, fpath string, depth int, out io.Writer) (*dag.Node, error) {
47 48 49 50 51 52 53 54 55 56
	if depth == 0 {
		return nil, ErrDepthLimitExceeded
	}

	fi, err := os.Stat(fpath)
	if err != nil {
		return nil, err
	}

	if fi.IsDir() {
57
		return addDir(n, fpath, depth, out)
58 59
	}

60
	return addFile(n, fpath, depth, out)
61 62
}

63
func addDir(n *core.IpfsNode, fpath string, depth int, out io.Writer) (*dag.Node, error) {
64
	tree := &dag.Node{Data: ft.FolderPBData()}
65 66 67 68 69 70 71 72 73

	files, err := ioutil.ReadDir(fpath)
	if err != nil {
		return nil, err
	}

	// construct nodes for containing files.
	for _, f := range files {
		fp := filepath.Join(fpath, f.Name())
74
		nd, err := AddPath(n, fp, depth-1, out)
75 76 77 78 79 80 81 82 83
		if err != nil {
			return nil, err
		}

		if err = tree.AddNodeLink(f.Name(), nd); err != nil {
			return nil, err
		}
	}

84 85 86
	log.Info("adding dir: %s", fpath)

	return tree, addNode(n, tree, fpath, out)
87 88
}

89
func addFile(n *core.IpfsNode, fpath string, depth int, out io.Writer) (*dag.Node, error) {
90 91 92 93 94
	root, err := importer.NewDagFromFile(fpath)
	if err != nil {
		return nil, err
	}

95
	log.Info("adding file: %s", fpath)
Jeromy's avatar
Jeromy committed
96 97

	for _, l := range root.Links {
98
		log.Info("adding subblock: %s %s", l.Name, l.Hash.B58String())
Jeromy's avatar
Jeromy committed
99 100
	}

101
	return root, addNode(n, root, fpath, out)
102 103 104
}

// addNode adds the node to the graph + local storage
105
func addNode(n *core.IpfsNode, nd *dag.Node, fpath string, out io.Writer) error {
106 107 108 109 110 111
	// add the file to the graph + local storage
	err := n.DAG.AddRecursive(nd)
	if err != nil {
		return err
	}

112 113 114 115 116 117 118 119
	k, err := nd.Key()
	if err != nil {
		return err
	}

	// output that we've added this node
	fmt.Fprintf(out, "added %s %s\n", k, fpath)

120
	// ensure we keep it. atm no-op
121
	return n.PinDagNodeRecursively(nd, -1)
122
}