mirror of
https://github.com/ipfs/kubo.git
synced 2025-08-06 19:44:01 +08:00
185 lines
4.3 KiB
Go
185 lines
4.3 KiB
Go
package blockstore
|
|
|
|
import (
|
|
"sync/atomic"
|
|
"time"
|
|
|
|
"github.com/ipfs/go-ipfs/blocks"
|
|
key "gx/ipfs/QmYEoKZXHoAToWfhGF3vryhMn3WWhE1o2MasQ8uzY5iDi9/go-key"
|
|
|
|
context "context"
|
|
"gx/ipfs/QmRg1gKTHzc3CZXSKzem8aR4E3TubFhbgXwfVuWnSK5CC5/go-metrics-interface"
|
|
bloom "gx/ipfs/QmeiMCBkYHxkDkDfnDadzz4YxY5ruL5Pj499essE4vRsGM/bbloom"
|
|
)
|
|
|
|
// bloomCached returns Blockstore that caches Has requests using Bloom filter
|
|
// Size is size of bloom filter in bytes
|
|
func bloomCached(bs Blockstore, ctx context.Context, bloomSize, hashCount int) (*bloomcache, error) {
|
|
bl, err := bloom.New(float64(bloomSize), float64(hashCount))
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
bc := &bloomcache{blockstore: bs, bloom: bl}
|
|
bc.hits = metrics.NewCtx(ctx, "bloom.hits_total",
|
|
"Number of cache hits in bloom cache").Counter()
|
|
bc.total = metrics.NewCtx(ctx, "bloom_total",
|
|
"Total number of requests to bloom cache").Counter()
|
|
|
|
bc.Invalidate()
|
|
go bc.Rebuild(ctx)
|
|
if metrics.Active() {
|
|
go func() {
|
|
fill := metrics.NewCtx(ctx, "bloom_fill_ratio",
|
|
"Ratio of bloom filter fullnes, (updated once a minute)").Gauge()
|
|
|
|
<-bc.rebuildChan
|
|
t := time.NewTicker(1 * time.Minute)
|
|
for {
|
|
select {
|
|
case <-ctx.Done():
|
|
t.Stop()
|
|
return
|
|
case <-t.C:
|
|
fill.Set(bc.bloom.FillRatio())
|
|
}
|
|
}
|
|
}()
|
|
}
|
|
return bc, nil
|
|
}
|
|
|
|
type bloomcache struct {
|
|
bloom *bloom.Bloom
|
|
active int32
|
|
|
|
// This chan is only used for testing to wait for bloom to enable
|
|
rebuildChan chan struct{}
|
|
blockstore Blockstore
|
|
|
|
// Statistics
|
|
hits metrics.Counter
|
|
total metrics.Counter
|
|
}
|
|
|
|
func (b *bloomcache) Invalidate() {
|
|
b.rebuildChan = make(chan struct{})
|
|
atomic.StoreInt32(&b.active, 0)
|
|
}
|
|
|
|
func (b *bloomcache) BloomActive() bool {
|
|
return atomic.LoadInt32(&b.active) != 0
|
|
}
|
|
|
|
func (b *bloomcache) Rebuild(ctx context.Context) {
|
|
evt := log.EventBegin(ctx, "bloomcache.Rebuild")
|
|
defer evt.Done()
|
|
|
|
ch, err := b.blockstore.AllKeysChan(ctx)
|
|
if err != nil {
|
|
log.Errorf("AllKeysChan failed in bloomcache rebuild with: %v", err)
|
|
return
|
|
}
|
|
finish := false
|
|
for !finish {
|
|
select {
|
|
case key, ok := <-ch:
|
|
if ok {
|
|
b.bloom.AddTS([]byte(key)) // Use binary key, the more compact the better
|
|
} else {
|
|
finish = true
|
|
}
|
|
case <-ctx.Done():
|
|
log.Warning("Cache rebuild closed by context finishing.")
|
|
return
|
|
}
|
|
}
|
|
close(b.rebuildChan)
|
|
atomic.StoreInt32(&b.active, 1)
|
|
}
|
|
|
|
func (b *bloomcache) DeleteBlock(k key.Key) error {
|
|
if has, ok := b.hasCached(k); ok && !has {
|
|
return ErrNotFound
|
|
}
|
|
|
|
return b.blockstore.DeleteBlock(k)
|
|
}
|
|
|
|
// if ok == false has is inconclusive
|
|
// if ok == true then has respons to question: is it contained
|
|
func (b *bloomcache) hasCached(k key.Key) (has bool, ok bool) {
|
|
b.total.Inc()
|
|
if k == "" {
|
|
// Return cache invalid so call to blockstore
|
|
// in case of invalid key is forwarded deeper
|
|
return false, false
|
|
}
|
|
if b.BloomActive() {
|
|
blr := b.bloom.HasTS([]byte(k))
|
|
if blr == false { // not contained in bloom is only conclusive answer bloom gives
|
|
b.hits.Inc()
|
|
return false, true
|
|
}
|
|
}
|
|
return false, false
|
|
}
|
|
|
|
func (b *bloomcache) Has(k key.Key) (bool, error) {
|
|
if has, ok := b.hasCached(k); ok {
|
|
return has, nil
|
|
}
|
|
|
|
return b.blockstore.Has(k)
|
|
}
|
|
|
|
func (b *bloomcache) Get(k key.Key) (blocks.Block, error) {
|
|
if has, ok := b.hasCached(k); ok && !has {
|
|
return nil, ErrNotFound
|
|
}
|
|
|
|
return b.blockstore.Get(k)
|
|
}
|
|
|
|
func (b *bloomcache) Put(bl blocks.Block) error {
|
|
if has, ok := b.hasCached(bl.Key()); ok && has {
|
|
return nil
|
|
}
|
|
|
|
err := b.blockstore.Put(bl)
|
|
if err == nil {
|
|
b.bloom.AddTS([]byte(bl.Key()))
|
|
}
|
|
return err
|
|
}
|
|
|
|
func (b *bloomcache) PutMany(bs []blocks.Block) error {
|
|
// bloom cache gives only conclusive resulty if key is not contained
|
|
// to reduce number of puts we need conclusive infomration if block is contained
|
|
// this means that PutMany can't be improved with bloom cache so we just
|
|
// just do a passthrough.
|
|
err := b.blockstore.PutMany(bs)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for _, bl := range bs {
|
|
b.bloom.AddTS([]byte(bl.Key()))
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (b *bloomcache) AllKeysChan(ctx context.Context) (<-chan key.Key, error) {
|
|
return b.blockstore.AllKeysChan(ctx)
|
|
}
|
|
|
|
func (b *bloomcache) GCLock() Unlocker {
|
|
return b.blockstore.(GCBlockstore).GCLock()
|
|
}
|
|
|
|
func (b *bloomcache) PinLock() Unlocker {
|
|
return b.blockstore.(GCBlockstore).PinLock()
|
|
}
|
|
|
|
func (b *bloomcache) GCRequested() bool {
|
|
return b.blockstore.(GCBlockstore).GCRequested()
|
|
}
|