mirror of
https://github.com/ipfs/kubo.git
synced 2026-02-22 02:47:48 +08:00
758e00bc4c
This extracts the blocks/blockstore package and renames the blocks/blockstore/util package to /blocks/blockstoreutil (because util depends on Pin and I don't plan to extract Pin and its depedencies). The history of blocks/blockstore has been preserved. It has been gx'ed and imported. Imports have been rewritten accordingly and re-ordered. License: MIT Signed-off-by: Hector Sanjuan <hector@protocol.ai>
102 lines
2.3 KiB
Go
102 lines
2.3 KiB
Go
package pin
|
|
|
|
import (
|
|
"context"
|
|
"encoding/binary"
|
|
"testing"
|
|
|
|
bserv "github.com/ipfs/go-ipfs/blockservice"
|
|
offline "github.com/ipfs/go-ipfs/exchange/offline"
|
|
dag "github.com/ipfs/go-ipfs/merkledag"
|
|
|
|
ds "gx/ipfs/QmPpegoMqhAEqjncrzArm7KVWAkCm78rqL2DPuNjhPrshg/go-datastore"
|
|
dsq "gx/ipfs/QmPpegoMqhAEqjncrzArm7KVWAkCm78rqL2DPuNjhPrshg/go-datastore/query"
|
|
blockstore "gx/ipfs/QmTVDM4LCSUMFNQzbDLL9zQwp8usE6QHymFdh3h8vL9v6b/go-ipfs-blockstore"
|
|
cid "gx/ipfs/QmcZfnkapfECQGcLZaf9B79NRg7cRa9EnZh4LSbkCzwNvY/go-cid"
|
|
)
|
|
|
|
func ignoreCids(_ *cid.Cid) {}
|
|
|
|
func objCount(d ds.Datastore) int {
|
|
q := dsq.Query{KeysOnly: true}
|
|
res, err := d.Query(q)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
|
|
var count int
|
|
for {
|
|
_, ok := res.NextSync()
|
|
if !ok {
|
|
break
|
|
}
|
|
|
|
count++
|
|
}
|
|
return count
|
|
}
|
|
|
|
func TestSet(t *testing.T) {
|
|
dst := ds.NewMapDatastore()
|
|
bstore := blockstore.NewBlockstore(dst)
|
|
ds := dag.NewDAGService(bserv.New(bstore, offline.Exchange(bstore)))
|
|
|
|
// this value triggers the creation of a recursive shard.
|
|
// If the recursive sharding is done improperly, this will result in
|
|
// an infinite recursion and crash (OOM)
|
|
limit := uint32((defaultFanout * maxItems) + 1)
|
|
|
|
var inputs []*cid.Cid
|
|
buf := make([]byte, 4)
|
|
for i := uint32(0); i < limit; i++ {
|
|
binary.BigEndian.PutUint32(buf, i)
|
|
c := dag.NewRawNode(buf).Cid()
|
|
inputs = append(inputs, c)
|
|
}
|
|
|
|
_, err := storeSet(context.Background(), ds, inputs[:len(inputs)-1], ignoreCids)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
objs1 := objCount(dst)
|
|
|
|
out, err := storeSet(context.Background(), ds, inputs, ignoreCids)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
objs2 := objCount(dst)
|
|
if objs2-objs1 > 2 {
|
|
t.Fatal("set sharding does not appear to be deterministic")
|
|
}
|
|
|
|
// weird wrapper node because loadSet expects us to pass an
|
|
// object pointing to multiple named sets
|
|
setroot := &dag.ProtoNode{}
|
|
err = setroot.AddNodeLinkClean("foo", out)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
outset, err := loadSet(context.Background(), ds, setroot, "foo", ignoreCids)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
if uint32(len(outset)) != limit {
|
|
t.Fatal("got wrong number", len(outset), limit)
|
|
}
|
|
|
|
seen := cid.NewSet()
|
|
for _, c := range outset {
|
|
seen.Add(c)
|
|
}
|
|
|
|
for _, c := range inputs {
|
|
if !seen.Has(c) {
|
|
t.Fatalf("expected to have '%s', didnt find it", c)
|
|
}
|
|
}
|
|
}
|