opensource/kubo
1
0
Fork 0
mirror of https://github.com/ipfs/kubo.git synced 2025-07-02 12:20:03 +08:00
Code Issues Projects Releases Wiki Activity

Wire ctx to getdag operations in gc.GC

Browse Source 
License: MIT
Signed-off-by: rht <rhtbot@gmail.com>
This commit is contained in:
rht
2016-01-21 14:40:15 +07:00
parent 89a6f01be0
commit fdba13a3e2
2 changed files with 14 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
pin/gc/gc.go
View File

@ -28,7 +28,7 @@ func GC(ctx context.Context, bs bstore.GCBlockstore, pn pin.Pinner) (<-chan key.
bsrv := bserv.New(bs, offline.Exchange(bs)) bsrv := bserv.New(bs, offline.Exchange(bs))
ds := dag.NewDAGService(bsrv) ds := dag.NewDAGService(bsrv)
gcs, err := ColoredSet(pn, ds) gcs, err := ColoredSet(ctx, pn, ds)
if err != nil { if err != nil {
return nil, err return nil, err
} }
@ -69,16 +69,16 @@ func GC(ctx context.Context, bs bstore.GCBlockstore, pn pin.Pinner) (<-chan key.
return output, nil return output, nil
} }
func Descendants(ds dag.DAGService, set key.KeySet, roots []key.Key) error { func Descendants(ctx context.Context, ds dag.DAGService, set key.KeySet, roots []key.Key) error {
for _, k := range roots { for _, k := range roots {
set.Add(k) set.Add(k)
nd, err := ds.Get(context.Background(), k) nd, err := ds.Get(ctx, k)
if err != nil { if err != nil {
return err return err
} }
// EnumerateChildren recursively walks the dag and adds the keys to the given set // EnumerateChildren recursively walks the dag and adds the keys to the given set
err = dag.EnumerateChildren(context.Background(), ds, nd, set) err = dag.EnumerateChildren(ctx, ds, nd, set)
if err != nil { if err != nil {
return err return err
} }
@ -87,11 +87,11 @@ func Descendants(ds dag.DAGService, set key.KeySet, roots []key.Key) error {
return nil return nil
} }
func ColoredSet(pn pin.Pinner, ds dag.DAGService) (key.KeySet, error) { func ColoredSet(ctx context.Context, pn pin.Pinner, ds dag.DAGService) (key.KeySet, error) {
// KeySet currently implemented in memory, in the future, may be bloom filter or // KeySet currently implemented in memory, in the future, may be bloom filter or
// disk backed to conserve memory. // disk backed to conserve memory.
gcs := key.NewKeySet() gcs := key.NewKeySet()
err := Descendants(ds, gcs, pn.RecursiveKeys()) err := Descendants(ctx, ds, gcs, pn.RecursiveKeys())
if err != nil { if err != nil {
return nil, err return nil, err
} }
@ -100,7 +100,7 @@ func ColoredSet(pn pin.Pinner, ds dag.DAGService) (key.KeySet, error) {
gcs.Add(k) gcs.Add(k)
} }
err = Descendants(ds, gcs, pn.InternalPins()) err = Descendants(ctx, ds, gcs, pn.InternalPins())
if err != nil { if err != nil {
return nil, err return nil, err
} }

8
repo/fsrepo/fsrepo.go
View File

@ -562,7 +562,13 @@ func (r *FSRepo) GetStorageUsage() (uint64, error) {
var du uint64 var du uint64
err = filepath.Walk(pth, func(p string, f os.FileInfo, err error) error { err = filepath.Walk(pth, func(p string, f os.FileInfo, err error) error {
du += uint64(f.Size()) if err != nil {
log.Debugf("filepath.Walk error: %s", err)
return nil
}
if f != nil {
du += uint64(f.Size())
}
return nil return nil
}) })
return du, err return du, err