theine

Apr 4, 2024 GO-2024-2826

  GO-2024-2826: Denial of service attack by triggering unbounded memory usage in vitess.io/vitess

Apr 4, 2024 GO-2024-2826

  GO-2024-2826: Denial of service attack by triggering unbounded memory usage in vitess.io/vitess

Mar 14, 2024 GO-2024-2826

  GO-2024-2826: Denial of service attack by triggering unbounded memory usage in vitess.io/vitess

Mar 6, 2024 GO-2024-2826

  GO-2024-2826: Denial of service attack by triggering unbounded memory usage in vitess.io/vitess

Apr 4, 2024 GO-2024-2826

  GO-2024-2826: Denial of service attack by triggering unbounded memory usage in vitess.io/vitess

Mar 14, 2024 GO-2024-2826

  GO-2024-2826: Denial of service attack by triggering unbounded memory usage in vitess.io/vitess

Dec 20, 2023 GO-2024-2826

  GO-2024-2826: Denial of service attack by triggering unbounded memory usage in vitess.io/vitess

Nov 22, 2023 GO-2024-2826

  GO-2024-2826: Denial of service attack by triggering unbounded memory usage in vitess.io/vitess

Nov 6, 2023 GO-2024-2826

  GO-2024-2826: Denial of service attack by triggering unbounded memory usage in vitess.io/vitess

Changes in this version

+ const LIST_PROBATION

+ const LIST_PROTECTED

+ const MaxReadBuffSize

+ const MaxWriteBuffSize

+ const MinWriteBuffSize

+ const NEW

+ const REMOVE

+ const UPDATE

+ type CountMinSketch struct

+ Additions uint

+ BlockMask uint

+ SampleSize uint

+ Table []uint64

+ func NewCountMinSketch() *CountMinSketch

+ func (s *CountMinSketch) Add(h uint64) bool

+ func (s *CountMinSketch) EnsureCapacity(size uint)

+ func (s *CountMinSketch) Estimate(h uint64) uint

+ type Entry struct

+ func NewEntry(key K, value V, cost int64) *Entry[K, V]

+ func (e *Entry[K, V]) Next() *Entry[K, V]

+ func (e *Entry[K, V]) Prev() *Entry[K, V]

+ type Group struct

+ func NewGroup() *Group[K, V]

+ func (g *Group[K, V]) Do(key K, fn func() (V, error)) (v V, err error, shared bool)

+ type HashKey256 [32]byte

+ func (h HashKey256) Hash() uint64

+ func (h HashKey256) Hash2() (uint64, uint64)

+ type List struct

+ func NewList(size uint, listType uint8) *List[K, V]

+ func (l *List[K, V]) Back() *Entry[K, V]

+ func (l *List[K, V]) Contains(entry *Entry[K, V]) bool

+ func (l *List[K, V]) Front() *Entry[K, V]

+ func (l *List[K, V]) Len() int

+ func (l *List[K, V]) MoveAfter(e, mark *Entry[K, V])

+ func (l *List[K, V]) MoveBefore(e, mark *Entry[K, V])

+ func (l *List[K, V]) MoveToBack(e *Entry[K, V])

+ func (l *List[K, V]) MoveToFront(e *Entry[K, V])

+ func (l *List[K, V]) PopTail() *Entry[K, V]

+ func (l *List[K, V]) PushBack(e *Entry[K, V]) *Entry[K, V]

+ func (l *List[K, V]) PushFront(e *Entry[K, V]) *Entry[K, V]

+ func (l *List[K, V]) Remove(e *Entry[K, V])

+ func (l *List[K, V]) Reset()

+ type MetaData struct

+ type Metrics struct

+ func (m *Metrics) Accesses() int64

+ func (m *Metrics) Evicted() int64

+ func (m *Metrics) Hits() int64

+ func (m *Metrics) Misses() int64

+ type Queue struct

+ func NewQueue() *Queue[V]

+ func (q *Queue[V]) Empty() bool

+ func (q *Queue[V]) Pop() (V, bool)

+ func (q *Queue[V]) Push(x V)

+ type ReadBufItem struct

+ type RemoveReason uint8

+ const EVICTED

+ const EXPIRED

+ const REMOVED

+ type Result struct

+ Err error

+ Shared bool

+ Val interface{}

+ type Shard struct

+ func NewShard(size uint, qsize uint, doorkeeper bool) *Shard[K, V]

+ type Slru struct

+ func NewSlru(size uint) *Slru[K, V]

+ type Store struct

+ Metrics Metrics

+ OnRemoval func(K, V, RemoveReason)

+ func NewStore(maxsize int64, doorkeeper bool) *Store[K, V]

+ func (s *Store[K, V]) Close()

+ func (s *Store[K, V]) Delete(key K)

+ func (s *Store[K, V]) EnsureOpen()

+ func (s *Store[K, V]) Get(key K, epoch uint32) (V, bool)

+ func (s *Store[K, V]) GetOrLoad(key K, epoch uint32, load func() (V, error)) (V, bool, error)

+ func (s *Store[K, V]) Len() int

+ func (s *Store[K, V]) MaxCapacity() int

+ func (s *Store[K, V]) Range(epoch uint32, f func(key K, value V) bool)

+ func (s *Store[K, V]) Set(key K, value V, cost int64, epoch uint32) bool

+ func (s *Store[K, V]) UsedCapacity() int

+ type StringKey string

+ func (h StringKey) Hash() uint64

+ func (h StringKey) Hash2() (uint64, uint64)

+ type TinyLfu struct

+ func NewTinyLfu(size uint) *TinyLfu[K, V]

+ func (t *TinyLfu[K, V]) Access(item ReadBufItem[K, V])

+ func (t *TinyLfu[K, V]) EvictEntries() []*Entry[K, V]

+ func (t *TinyLfu[K, V]) Remove(entry *Entry[K, V])

+ func (t *TinyLfu[K, V]) Set(entry *Entry[K, V]) *Entry[K, V]

+ func (t *TinyLfu[K, V]) UpdateCost(entry *Entry[K, V], delta int64)

+ func (t *TinyLfu[K, V]) UpdateThreshold()

+ type WriteBufItem struct