mirror of
https://github.com/minio/minio.git
synced 2024-12-26 15:15:55 -05:00
7c948adf88
This PR also increases per node bpool memory from 1024 entries to 2048 entries; along with that, it also moves the byte pool centrally instead of being per pool.
88 lines
2.5 KiB
Go
88 lines
2.5 KiB
Go
// Copyright (c) 2015-2023 MinIO, Inc.
|
|
//
|
|
// This file is part of MinIO Object Storage stack
|
|
//
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Affero General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Affero General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Affero General Public License
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package bpool
|
|
|
|
import "github.com/klauspost/reedsolomon"
|
|
|
|
// BytePoolCap implements a leaky pool of []byte in the form of a bounded channel.
|
|
type BytePoolCap struct {
|
|
c chan []byte
|
|
w int
|
|
wcap int
|
|
}
|
|
|
|
// NewBytePoolCap creates a new BytePool bounded to the given maxSize, with new
|
|
// byte arrays sized based on width.
|
|
func NewBytePoolCap(maxSize int, width int, capwidth int) (bp *BytePoolCap) {
|
|
if capwidth > 0 && capwidth < 64 {
|
|
panic("buffer capped with smaller than 64 bytes is not supported")
|
|
}
|
|
if capwidth > 0 && width > capwidth {
|
|
panic("buffer length cannot be > capacity of the buffer")
|
|
}
|
|
return &BytePoolCap{
|
|
c: make(chan []byte, maxSize),
|
|
w: width,
|
|
wcap: capwidth,
|
|
}
|
|
}
|
|
|
|
// Populate - populates and pre-warms the byte pool, this function is non-blocking.
|
|
func (bp *BytePoolCap) Populate() {
|
|
for _, buf := range reedsolomon.AllocAligned(cap(bp.c), bp.wcap) {
|
|
bp.Put(buf[:bp.w])
|
|
}
|
|
}
|
|
|
|
// Get gets a []byte from the BytePool, or creates a new one if none are
|
|
// available in the pool.
|
|
func (bp *BytePoolCap) Get() (b []byte) {
|
|
select {
|
|
case b = <-bp.c:
|
|
// reuse existing buffer
|
|
default:
|
|
// create new aligned buffer
|
|
if bp.wcap > 0 {
|
|
b = reedsolomon.AllocAligned(1, bp.wcap)[0][:bp.w]
|
|
} else {
|
|
b = reedsolomon.AllocAligned(1, bp.w)[0]
|
|
}
|
|
}
|
|
return
|
|
}
|
|
|
|
// Put returns the given Buffer to the BytePool.
|
|
func (bp *BytePoolCap) Put(b []byte) {
|
|
select {
|
|
case bp.c <- b:
|
|
// buffer went back into pool
|
|
default:
|
|
// buffer didn't go back into pool, just discard
|
|
}
|
|
}
|
|
|
|
// Width returns the width of the byte arrays in this pool.
|
|
func (bp *BytePoolCap) Width() (n int) {
|
|
return bp.w
|
|
}
|
|
|
|
// WidthCap returns the cap width of the byte arrays in this pool.
|
|
func (bp *BytePoolCap) WidthCap() (n int) {
|
|
return bp.wcap
|
|
}
|