summaryrefslogtreecommitdiffhomepage
path: root/pkg/buffer/buffer.go
blob: c6d089fd9f970eab5c203195ce469e72ce1e28e1 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
// Copyright 2020 The gVisor Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

// Package buffer provides the implementation of a buffer view.
//
// A view is an flexible buffer, backed by a pool, supporting the safecopy
// operations natively as well as the ability to grow via either prepend or
// append, as well as shrink.
package buffer

import (
	"sync"
)

const bufferSize = 8144 // See below.

// buffer encapsulates a queueable byte buffer.
//
// Note that the total size is slightly less than two pages. This is done
// intentionally to ensure that the buffer object aligns with runtime
// internals. We have no hard size or alignment requirements. This two page
// size will effectively minimize internal fragmentation, but still have a
// large enough chunk to limit excessive segmentation.
//
// +stateify savable
type buffer struct {
	data  [bufferSize]byte
	read  int
	write int
	bufferEntry
}

// reset resets internal data.
//
// This must be called before returning the buffer to the pool.
func (b *buffer) Reset() {
	b.read = 0
	b.write = 0
}

// Full indicates the buffer is full.
//
// This indicates there is no capacity left to write.
func (b *buffer) Full() bool {
	return b.write == len(b.data)
}

// ReadSize returns the number of bytes available for reading.
func (b *buffer) ReadSize() int {
	return b.write - b.read
}

// ReadMove advances the read index by the given amount.
func (b *buffer) ReadMove(n int) {
	b.read += n
}

// ReadSlice returns the read slice for this buffer.
func (b *buffer) ReadSlice() []byte {
	return b.data[b.read:b.write]
}

// WriteSize returns the number of bytes available for writing.
func (b *buffer) WriteSize() int {
	return len(b.data) - b.write
}

// WriteMove advances the write index by the given amount.
func (b *buffer) WriteMove(n int) {
	b.write += n
}

// WriteSlice returns the write slice for this buffer.
func (b *buffer) WriteSlice() []byte {
	return b.data[b.write:]
}

// bufferPool is a pool for buffers.
var bufferPool = sync.Pool{
	New: func() interface{} {
		return new(buffer)
	},
}