mirror of
https://github.com/ipfs/kubo.git
synced 2026-02-22 10:57:42 +08:00
9dcec2b3e2
Reverts the changes that allowed small keys (ed25519 keys) to be inlined. License: MIT Signed-off-by: Steven Allen <steven@stebalien.com>
102 lines
2.4 KiB
Go
102 lines
2.4 KiB
Go
package pin
|
|
|
|
import (
|
|
"context"
|
|
"encoding/binary"
|
|
"testing"
|
|
|
|
bserv "gx/ipfs/QmPoh3SrQzFBWtdGK6qmHDV4EanKR6kYPj4DD3J2NLoEmZ/go-blockservice"
|
|
dag "gx/ipfs/QmdV35UHnL1FM52baPkeUo6u7Fxm2CRUkPTLRPxeF8a4Ap/go-merkledag"
|
|
|
|
cid "gx/ipfs/QmR8BauakNcBa3RbE4nbQu76PDiJgoQgz8AJdhJuiU4TAw/go-cid"
|
|
blockstore "gx/ipfs/QmS2aqUZLJp8kF1ihE5rvDGE5LvmKDPnx32w9Z1BW9xLV5/go-ipfs-blockstore"
|
|
offline "gx/ipfs/QmYZwey1thDTynSrvd6qQkX24UpTka6TFhQ2v569UpoqxD/go-ipfs-exchange-offline"
|
|
ds "gx/ipfs/Qmf4xQhNomPNhrtZc67qSnfJSjxjXs9LWvknJtSXwimPrM/go-datastore"
|
|
dsq "gx/ipfs/Qmf4xQhNomPNhrtZc67qSnfJSjxjXs9LWvknJtSXwimPrM/go-datastore/query"
|
|
)
|
|
|
|
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.AddNodeLink("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)
|
|
}
|
|
}
|
|
}
|