codec/proto: reuse of marshal byte buffers (#3167)

Performance benchmarks can be found below. Obviously, a 8 KiB
request/response is tailored to showcase this improvement as this is
where codec buffer reuse shines, but I've run other benchmarks too (like
1-byte requests and responses) and there's no discernable impact on
performance.

We do not allow reuse of buffers when stat handlers or binlogs are
turned on. This is because those two may need access to the data and
payload even after the data has been written to the wire. In such cases,
we never return the data back to the pool.

A buffer reuse threshold of 1 KiB was determined after several
experiments. There's diminished returns when buffer reuse is enabled for
smaller messages (actually, a negative impact).

unary-networkMode_none-bufConn_false-keepalive_false-benchTime_40s-trace_false-latency_0s-kbps_0-MTU_0-maxConcurrentCalls_6-reqSize_8192B-respSize_8192B-compressor_off-channelz_false-preloader_false
               Title       Before        After Percentage
            TotalOps       839638       906223     7.93%
             SendOps            0            0      NaN%
             RecvOps            0            0      NaN%
            Bytes/op    103788.29     80592.47   -22.35%
           Allocs/op       183.33       189.30     3.27%
             ReqT/op 1375662899.20 1484755763.20     7.93%
            RespT/op 1375662899.20 1484755763.20     7.93%
            50th-Lat    238.746µs    225.019µs    -5.75%
            90th-Lat    514.253µs    456.439µs   -11.24%
            99th-Lat    711.083µs    702.466µs    -1.21%
             Avg-Lat     285.45µs    264.456µs    -7.35%
This commit is contained in:
Adhityaa Chandrasekar 2019-12-20 09:41:23 -08:00 committed by Doug Fawley
parent ffcdcbc762
commit 642675125e
14 changed files with 341 additions and 89 deletions

View File

@ -8,8 +8,13 @@ into bytes and vice-versa for the purposes of network transmission.
## Codecs (Serialization and Deserialization)
A `Codec` contains code to serialize a message into a byte slice (`Marshal`) and
deserialize a byte slice back into a message (`Unmarshal`). `Codec`s are
registered by name into a global registry maintained in the `encoding` package.
deserialize a byte slice back into a message (`Unmarshal`). Optionally, a
`ReturnBuffer` method to potentially reuse the byte slice returned by the
`Marshal` method may also be implemented; note that this is an experimental
feature with an API that is still in flux.
`Codec`s are registered by name into a global registry maintained in the
`encoding` package.
### Implementing a `Codec`

View File

@ -31,6 +31,20 @@ type baseCodec interface {
Unmarshal(data []byte, v interface{}) error
}
// A bufferReturner requires a ReturnBuffer method to be implemented. Once a
// Marshal caller is done with the returned byte buffer, they can choose to
// return it back to the encoding library for re-use using this method.
type bufferReturner interface {
// If implemented in a codec, this function may be called with the byte
// buffer returned by Marshal after gRPC is done with the buffer.
//
// gRPC will not call ReturnBuffer after it's done with the buffer if any of
// the following is true:
// 1. Stats handlers are used.
// 2. Binlogs are enabled.
ReturnBuffer(buf []byte)
}
var _ baseCodec = Codec(nil)
var _ baseCodec = encoding.Codec(nil)

View File

@ -75,6 +75,11 @@ func GetCompressor(name string) Compressor {
// Codec defines the interface gRPC uses to encode and decode messages. Note
// that implementations of this interface must be thread safe; a Codec's
// methods can be called from concurrent goroutines.
//
// Optionally, if a ReturnBuffer(buf []byte) is implemented, it may be called
// to return the byte slice it received from the Marshal function after gRPC is
// done with it. The codec may reuse this byte slice in a future Marshal
// operation to reduce the application's memory footprint.
type Codec interface {
// Marshal returns the wire format of v.
Marshal(v interface{}) ([]byte, error)

View File

@ -21,7 +21,6 @@
package proto
import (
"math"
"sync"
"github.com/golang/protobuf/proto"
@ -38,29 +37,16 @@ func init() {
// codec is a Codec implementation with protobuf. It is the default codec for gRPC.
type codec struct{}
type cachedProtoBuffer struct {
lastMarshaledSize uint32
proto.Buffer
}
func capToMaxInt32(val int) uint32 {
if val > math.MaxInt32 {
return uint32(math.MaxInt32)
}
return uint32(val)
}
func marshal(v interface{}, cb *cachedProtoBuffer) ([]byte, error) {
func marshal(v interface{}, pb *proto.Buffer) ([]byte, error) {
protoMsg := v.(proto.Message)
newSlice := make([]byte, 0, cb.lastMarshaledSize)
newSlice := returnBufferPool.Get().([]byte)
cb.SetBuf(newSlice)
cb.Reset()
if err := cb.Marshal(protoMsg); err != nil {
pb.SetBuf(newSlice)
pb.Reset()
if err := pb.Marshal(protoMsg); err != nil {
return nil, err
}
out := cb.Bytes()
cb.lastMarshaledSize = capToMaxInt32(len(out))
out := pb.Bytes()
return out, nil
}
@ -70,12 +56,12 @@ func (codec) Marshal(v interface{}) ([]byte, error) {
return pm.Marshal()
}
cb := protoBufferPool.Get().(*cachedProtoBuffer)
out, err := marshal(v, cb)
pb := protoBufferPool.Get().(*proto.Buffer)
out, err := marshal(v, pb)
// put back buffer and lose the ref to the slice
cb.SetBuf(nil)
protoBufferPool.Put(cb)
pb.SetBuf(nil)
protoBufferPool.Put(pb)
return out, err
}
@ -88,23 +74,39 @@ func (codec) Unmarshal(data []byte, v interface{}) error {
return pu.Unmarshal(data)
}
cb := protoBufferPool.Get().(*cachedProtoBuffer)
cb.SetBuf(data)
err := cb.Unmarshal(protoMsg)
cb.SetBuf(nil)
protoBufferPool.Put(cb)
pb := protoBufferPool.Get().(*proto.Buffer)
pb.SetBuf(data)
err := pb.Unmarshal(protoMsg)
pb.SetBuf(nil)
protoBufferPool.Put(pb)
return err
}
func (codec) ReturnBuffer(data []byte) {
// Make sure we set the length of the buffer to zero so that future appends
// will start from the zeroeth byte, not append to the previous, stale data.
//
// Apparently, sync.Pool with non-pointer objects (slices, in this case)
// causes small allocations because of how interface{} works under the hood.
// This isn't a problem for us, however, because we're more concerned with
// _how_ much that allocation is. Ideally, we'd be using bytes.Buffer as the
// Marshal return value to remove even that allocation, but we can't change
// the Marshal interface at this point.
returnBufferPool.Put(data[:0])
}
func (codec) Name() string {
return Name
}
var protoBufferPool = &sync.Pool{
New: func() interface{} {
return &cachedProtoBuffer{
Buffer: proto.Buffer{},
lastMarshaledSize: 16,
}
return &proto.Buffer{}
},
}
var returnBufferPool = &sync.Pool{
New: func() interface{} {
return make([]byte, 0, 16)
},
}

View File

@ -127,3 +127,53 @@ func TestStaggeredMarshalAndUnmarshalUsingSamePool(t *testing.T) {
}
}
}
func TestBufferReuse(t *testing.T) {
c := codec{}
marshal := func(toMarshal []byte) []byte {
protoIn := &codec_perf.Buffer{Body: toMarshal}
b, err := c.Marshal(protoIn)
if err != nil {
t.Errorf("codec.Marshal(%v) failed: %v", protoIn, err)
}
// We cannot expect the actual pointer to be the same because sync.Pool
// during GC pauses.
bc := append([]byte(nil), b...)
c.ReturnBuffer(b)
return bc
}
unmarshal := func(b []byte) []byte {
protoOut := &codec_perf.Buffer{}
if err := c.Unmarshal(b, protoOut); err != nil {
t.Errorf("codec.Unarshal(%v) failed: %v", protoOut, err)
}
return protoOut.GetBody()
}
check := func(in []byte, out []byte) {
if len(in) != len(out) {
t.Errorf("unequal lengths: len(in=%v)=%d, len(out=%v)=%d", in, len(in), out, len(out))
}
for i := 0; i < len(in); i++ {
if in[i] != out[i] {
t.Errorf("unequal values: in[%d] = %v, out[%d] = %v", i, in[i], i, out[i])
}
}
}
// To test that the returned buffer does not have unexpected data at the end,
// we use a second input data that is smaller than the first.
in1 := []byte{1, 2, 3}
b1 := marshal(in1)
in2 := []byte{4, 5}
b2 := marshal(in2)
out1 := unmarshal(b1)
out2 := unmarshal(b2)
check(in1, out1)
check(in2, out2)
}

View File

@ -25,6 +25,7 @@ import (
"runtime"
"sort"
"strings"
"sync/atomic"
"time"
)
@ -74,11 +75,24 @@ func ignore(g string) bool {
return false
}
var lastStacktraceSize uint32 = 4 << 10
// interestingGoroutines returns all goroutines we care about for the purpose of
// leak checking. It excludes testing or runtime ones.
func interestingGoroutines() (gs []string) {
buf := make([]byte, 2<<20)
buf = buf[:runtime.Stack(buf, true)]
n := atomic.LoadUint32(&lastStacktraceSize)
buf := make([]byte, n)
for {
nb := uint32(runtime.Stack(buf, true))
if nb < uint32(len(buf)) {
buf = buf[:nb]
break
}
n <<= 1
buf = make([]byte, n)
}
atomic.StoreUint32(&lastStacktraceSize, n)
for _, g := range strings.Split(string(buf), "\n\n") {
if !ignore(g) {
gs = append(gs, g)

View File

@ -34,8 +34,9 @@ var updateHeaderTblSize = func(e *hpack.Encoder, v uint32) {
}
type itemNode struct {
it interface{}
next *itemNode
it interface{}
onDequeue func()
next *itemNode
}
type itemList struct {
@ -43,8 +44,8 @@ type itemList struct {
tail *itemNode
}
func (il *itemList) enqueue(i interface{}) {
n := &itemNode{it: i}
func (il *itemList) enqueue(i interface{}, onDequeue func()) {
n := &itemNode{it: i, onDequeue: onDequeue}
if il.tail == nil {
il.head, il.tail = n, n
return
@ -63,11 +64,14 @@ func (il *itemList) dequeue() interface{} {
if il.head == nil {
return nil
}
i := il.head.it
i, onDequeue := il.head.it, il.head.onDequeue
il.head = il.head.next
if il.head == nil {
il.tail = nil
}
if onDequeue != nil {
onDequeue()
}
return i
}
@ -136,6 +140,7 @@ type dataFrame struct {
// onEachWrite is called every time
// a part of d is written out.
onEachWrite func()
rb *ReturnBuffer
}
func (*dataFrame) isTransportResponseFrame() bool { return false }
@ -329,7 +334,7 @@ func (c *controlBuffer) executeAndPut(f func(it interface{}) bool, it cbItem) (b
wakeUp = true
c.consumerWaiting = false
}
c.list.enqueue(it)
c.list.enqueue(it, nil)
if it.isTransportResponseFrame() {
c.transportResponseFrames++
if c.transportResponseFrames == maxQueuedTransportResponseFrames {
@ -616,7 +621,7 @@ func (l *loopyWriter) headerHandler(h *headerFrame) error {
if str.state != empty { // either active or waiting on stream quota.
// add it str's list of items.
str.itl.enqueue(h)
str.itl.enqueue(h, nil)
return nil
}
if err := l.writeHeader(h.streamID, h.endStream, h.hf, h.onWrite); err != nil {
@ -631,7 +636,7 @@ func (l *loopyWriter) headerHandler(h *headerFrame) error {
itl: &itemList{},
wq: h.wq,
}
str.itl.enqueue(h)
str.itl.enqueue(h, nil)
return l.originateStream(str)
}
@ -702,7 +707,11 @@ func (l *loopyWriter) preprocessData(df *dataFrame) error {
}
// If we got data for a stream it means that
// stream was originated and the headers were sent out.
str.itl.enqueue(df)
var onDequeue func()
if df.rb != nil {
onDequeue = df.rb.Done
}
str.itl.enqueue(df, onDequeue)
if str.state == empty {
str.state = active
l.activeStreams.enqueue(str)
@ -726,6 +735,12 @@ func (l *loopyWriter) outFlowControlSizeRequestHandler(o *outFlowControlSizeRequ
func (l *loopyWriter) cleanupStreamHandler(c *cleanupStream) error {
c.onWrite()
if str, ok := l.estdStreams[c.streamID]; ok {
// Dequeue all items from the stream's item list. This would call any pending onDequeue functions.
if str.state == active {
for !str.itl.isEmpty() {
str.itl.dequeue()
}
}
// On the server side it could be a trailers-only response or
// a RST_STREAM before stream initialization thus the stream might
// not be established yet.

View File

@ -846,6 +846,7 @@ func (t *http2Client) Write(s *Stream, hdr []byte, data []byte, opts *Options) e
df := &dataFrame{
streamID: s.id,
endStream: opts.Last,
rb: opts.ReturnBuffer,
}
if hdr != nil || data != nil { // If it's not an empty data frame.
// Add some data to grpc message header so that we can equally
@ -862,6 +863,9 @@ func (t *http2Client) Write(s *Stream, hdr []byte, data []byte, opts *Options) e
return err
}
}
if df.rb != nil {
df.rb.Add(1)
}
return t.controlBuf.put(df)
}

View File

@ -923,6 +923,7 @@ func (t *http2Server) Write(s *Stream, hdr []byte, data []byte, opts *Options) e
h: hdr,
d: data,
onEachWrite: t.setResetPingStrikes,
rb: opts.ReturnBuffer,
}
if err := s.wq.get(int32(len(hdr) + len(data))); err != nil {
select {
@ -932,6 +933,9 @@ func (t *http2Server) Write(s *Stream, hdr []byte, data []byte, opts *Options) e
}
return ContextErr(s.ctx.Err())
}
if df.rb != nil {
df.rb.Add(1)
}
return t.controlBuf.put(df)
}

View File

@ -33,6 +33,7 @@ import (
"google.golang.org/grpc/codes"
"google.golang.org/grpc/credentials"
"google.golang.org/grpc/grpclog"
"google.golang.org/grpc/keepalive"
"google.golang.org/grpc/metadata"
"google.golang.org/grpc/stats"
@ -587,6 +588,9 @@ type Options struct {
// Last indicates whether this write is the last piece for
// this stream.
Last bool
// If non-nil, ReturnBuffer.Done() should be called in order to return some
// allocated buffer back to a sync pool.
ReturnBuffer *ReturnBuffer
}
// CallHdr carries the information of a particular RPC.
@ -806,3 +810,37 @@ func ContextErr(err error) error {
}
return status.Errorf(codes.Internal, "Unexpected error from context packet: %v", err)
}
// ReturnBuffer contains a function holding a closure that can return a byte
// slice back to the encoder for reuse. This function is called when the
// counter c reaches 0, which happens when all Add calls have called their
// corresponding Done calls. All operations on ReturnBuffer are
// concurrency-safe.
type ReturnBuffer struct {
c int32
f func()
}
// NewReturnBuffer allocates and returns a *ReturnBuffer.
func NewReturnBuffer(c int32, f func()) *ReturnBuffer {
return &ReturnBuffer{c: c, f: f}
}
// Add increments an internal counter atomically.
func (rb *ReturnBuffer) Add(n int32) {
atomic.AddInt32(&rb.c, n)
}
// Done decrements the internal counter and executes the closured ReturnBuffer
// function if the internal counter reaches zero.
func (rb *ReturnBuffer) Done() {
nc := atomic.AddInt32(&rb.c, -1)
if nc < 0 {
// Same behaviour as sync.WaitGroup, this should NEVER happen. And if it
// does happen, it's better to terminate early than silently continue with
// corrupt data.
grpclog.Fatalln("grpc: ReturnBuffer negative counter")
} else if nc == 0 {
rb.f()
}
}

View File

@ -28,9 +28,10 @@ import (
// This API is EXPERIMENTAL.
type PreparedMsg struct {
// Struct for preparing msg before sending them
encodedData []byte
hdr []byte
payload []byte
encodedData []byte
hdr []byte
payload []byte
returnBuffer func()
}
// Encode marshalls and compresses the message using the codec and compressor for the stream.
@ -55,6 +56,14 @@ func (p *PreparedMsg) Encode(s Stream, msg interface{}) error {
return err
}
p.encodedData = data
if cap(data) >= bufferReuseThreshold {
if bcodec, ok := rpcInfo.preloaderInfo.codec.(bufferReturner); ok {
p.returnBuffer = func() {
bcodec.ReturnBuffer(data)
}
}
}
compData, err := compress(data, rpcInfo.preloaderInfo.cp, rpcInfo.preloaderInfo.comp)
if err != nil {
return err

View File

@ -841,12 +841,22 @@ func (s *Server) incrCallsFailed() {
atomic.AddInt64(&s.czData.callsFailed, 1)
}
func (s *Server) sendResponse(t transport.ServerTransport, stream *transport.Stream, msg interface{}, cp Compressor, opts *transport.Options, comp encoding.Compressor) error {
data, err := encode(s.getCodec(stream.ContentSubtype()), msg)
func (s *Server) sendResponse(t transport.ServerTransport, stream *transport.Stream, msg interface{}, cp Compressor, opts *transport.Options, comp encoding.Compressor, attemptBufferReuse bool) error {
codec := s.getCodec(stream.ContentSubtype())
data, err := encode(codec, msg)
if err != nil {
grpclog.Errorln("grpc: server failed to encode response: ", err)
return err
}
if attemptBufferReuse && len(data) >= bufferReuseThreshold {
if bcodec, ok := codec.(bufferReturner); ok {
opts.ReturnBuffer = transport.NewReturnBuffer(1, func() {
bcodec.ReturnBuffer(data)
})
}
}
compData, err := compress(data, cp, comp)
if err != nil {
grpclog.Errorln("grpc: server failed to compress response: ", err)
@ -1055,8 +1065,11 @@ func (s *Server) processUnaryRPC(t transport.ServerTransport, stream *transport.
trInfo.tr.LazyLog(stringer("OK"), false)
}
opts := &transport.Options{Last: true}
if err := s.sendResponse(t, stream, reply, cp, opts, comp); err != nil {
err = s.sendResponse(t, stream, reply, cp, opts, comp, sh == nil && binlog == nil)
if opts.ReturnBuffer != nil {
defer opts.ReturnBuffer.Done()
}
if err != nil {
if err == io.EOF {
// The entire stream is done (for unary RPC only).
return err
@ -1197,6 +1210,17 @@ func (s *Server) processStreamingRPC(t transport.ServerTransport, stream *transp
ss.binlog.Log(logEntry)
}
// Stats handlers and binlog handlers are allowed to retain references to
// this slice internally. We may not, therefore, return this to the pool.
if ss.statsHandler == nil && ss.binlog == nil {
ss.attemptBufferReuse = true
defer func() {
for _, rb := range ss.returnBuffers {
rb.Done()
}
}()
}
// If dc is set and matches the stream's compression, use it. Otherwise, try
// to find a matching registered compressor for decomp.
if rc := stream.RecvCompress(); s.opts.dc != nil && s.opts.dc.Type() == rc {

138
stream.go
View File

@ -278,6 +278,10 @@ func newClientStream(ctx context.Context, desc *StreamDesc, cc *ClientConn, meth
}
cs.binlog = binarylog.GetMethodLogger(method)
// Stats handlers and binlog handlers are allowed to retain references to
// this slice internally. We may not, therefore, return this to the pool.
cs.attemptBufferReuse = sh == nil && cs.binlog == nil
cs.callInfo.stream = cs
// Only this initial attempt has stats/tracing.
// TODO(dfawley): move to newAttempt when per-attempt stats are implemented.
@ -422,6 +426,12 @@ type clientStream struct {
committed bool // active attempt committed for retry?
buffer []func(a *csAttempt) error // operations to replay on retry
bufferSize int // current size of buffer
// This is per-stream array instead of a per-attempt one because there may be
// multiple attempts working on the same data, but we may not free the same
// buffer twice.
returnBuffers []*transport.ReturnBuffer
attemptBufferReuse bool
}
// csAttempt implements a single transport stream attempt within a
@ -448,8 +458,12 @@ type csAttempt struct {
}
func (cs *clientStream) commitAttemptLocked() {
cs.committed = true
cs.buffer = nil
cs.committed = true
for _, rb := range cs.returnBuffers {
rb.Done()
}
cs.returnBuffers = nil
}
func (cs *clientStream) commitAttempt() {
@ -696,18 +710,26 @@ func (cs *clientStream) SendMsg(m interface{}) (err error) {
}
// load hdr, payload, data
hdr, payload, data, err := prepareMsg(m, cs.codec, cs.cp, cs.comp)
hdr, payload, data, f, err := prepareMsg(m, cs.codec, cs.cp, cs.comp, cs.attemptBufferReuse)
if err != nil {
return err
}
var rb *transport.ReturnBuffer
if f != nil {
rb = transport.NewReturnBuffer(1, f)
// We can assume mutual exclusion on this slice as only one SendMsg is
// supported concurrently.
cs.returnBuffers = append(cs.returnBuffers, rb)
}
// TODO(dfawley): should we be checking len(data) instead?
if len(payload) > *cs.callInfo.maxSendMessageSize {
return status.Errorf(codes.ResourceExhausted, "trying to send message larger than max (%d vs. %d)", len(payload), *cs.callInfo.maxSendMessageSize)
}
msgBytes := data // Store the pointer before setting to nil. For binary logging.
op := func(a *csAttempt) error {
err := a.sendMsg(m, hdr, payload, data)
err := a.sendMsg(m, hdr, payload, data, rb)
// nil out the message and uncomp when replaying; they are only needed for
// stats which is disabled for subsequent attempts.
m, data = nil, nil
@ -798,6 +820,7 @@ func (cs *clientStream) finish(err error) {
cs.mu.Unlock()
return
}
cs.finished = true
cs.commitAttemptLocked()
cs.mu.Unlock()
@ -833,7 +856,7 @@ func (cs *clientStream) finish(err error) {
cs.cancel()
}
func (a *csAttempt) sendMsg(m interface{}, hdr, payld, data []byte) error {
func (a *csAttempt) sendMsg(m interface{}, hdr, payld, data []byte, rb *transport.ReturnBuffer) error {
cs := a.cs
if a.trInfo != nil {
a.mu.Lock()
@ -842,7 +865,8 @@ func (a *csAttempt) sendMsg(m interface{}, hdr, payld, data []byte) error {
}
a.mu.Unlock()
}
if err := a.t.Write(a.s, hdr, payld, &transport.Options{Last: !cs.desc.ClientStreams}); err != nil {
if err := a.t.Write(a.s, hdr, payld, &transport.Options{Last: !cs.desc.ClientStreams, ReturnBuffer: rb}); err != nil {
if !cs.desc.ClientStreams {
// For non-client-streaming RPCs, we return nil instead of EOF on error
// because the generated code requires it. finish is not called; RecvMsg()
@ -1095,25 +1119,26 @@ func newNonRetryClientStream(ctx context.Context, desc *StreamDesc, method strin
}
type addrConnStream struct {
s *transport.Stream
ac *addrConn
callHdr *transport.CallHdr
cancel context.CancelFunc
opts []CallOption
callInfo *callInfo
t transport.ClientTransport
ctx context.Context
sentLast bool
desc *StreamDesc
codec baseCodec
cp Compressor
comp encoding.Compressor
decompSet bool
dc Decompressor
decomp encoding.Compressor
p *parser
mu sync.Mutex
finished bool
s *transport.Stream
ac *addrConn
callHdr *transport.CallHdr
cancel context.CancelFunc
opts []CallOption
callInfo *callInfo
t transport.ClientTransport
ctx context.Context
sentLast bool
desc *StreamDesc
codec baseCodec
cp Compressor
comp encoding.Compressor
decompSet bool
dc Decompressor
decomp encoding.Compressor
p *parser
mu sync.Mutex
finished bool
returnBuffers []*transport.ReturnBuffer
}
func (as *addrConnStream) Header() (metadata.MD, error) {
@ -1165,18 +1190,29 @@ func (as *addrConnStream) SendMsg(m interface{}) (err error) {
as.sentLast = true
}
// load hdr, payload, data
hdr, payld, _, err := prepareMsg(m, as.codec, as.cp, as.comp)
// load hdr, payload, data, returnBuffer
hdr, payld, _, f, err := prepareMsg(m, as.codec, as.cp, as.comp, true)
if err != nil {
return err
}
var rb *transport.ReturnBuffer
if f != nil {
// addrConnStream does not have retries, so there's no point waiting for
// the query to be committed. As a result, we use a initial counter of 0
// instead of 1 like in serverStream and clientStream.
rb = transport.NewReturnBuffer(0, f)
// We can assume mutual exclusion on this slice as only one SendMsg is
// supported concurrently.
as.returnBuffers = append(as.returnBuffers, rb)
}
// TODO(dfawley): should we be checking len(data) instead?
if len(payld) > *as.callInfo.maxSendMessageSize {
return status.Errorf(codes.ResourceExhausted, "trying to send message larger than max (%d vs. %d)", len(payld), *as.callInfo.maxSendMessageSize)
}
if err := as.t.Write(as.s, hdr, payld, &transport.Options{Last: !as.desc.ClientStreams}); err != nil {
if err := as.t.Write(as.s, hdr, payld, &transport.Options{Last: !as.desc.ClientStreams, ReturnBuffer: rb}); err != nil {
if !as.desc.ClientStreams {
// For non-client-streaming RPCs, we return nil instead of EOF on error
// because the generated code requires it. finish is not called; RecvMsg()
@ -1347,6 +1383,9 @@ type serverStream struct {
serverHeaderBinlogged bool
mu sync.Mutex // protects trInfo.tr after the service handler runs.
returnBuffers []*transport.ReturnBuffer
attemptBufferReuse bool
}
func (ss *serverStream) Context() context.Context {
@ -1408,17 +1447,25 @@ func (ss *serverStream) SendMsg(m interface{}) (err error) {
}
}()
// load hdr, payload, data
hdr, payload, data, err := prepareMsg(m, ss.codec, ss.cp, ss.comp)
// load hdr, payload, returnBuffer, data
hdr, payload, data, f, err := prepareMsg(m, ss.codec, ss.cp, ss.comp, ss.attemptBufferReuse)
if err != nil {
return err
}
var rb *transport.ReturnBuffer
if f != nil {
rb = transport.NewReturnBuffer(1, f)
// We can assume mutual exclusion on this slice as only one SendMsg is
// supported concurrently.
ss.returnBuffers = append(ss.returnBuffers, rb)
}
// TODO(dfawley): should we be checking len(data) instead?
if len(payload) > ss.maxSendMessageSize {
return status.Errorf(codes.ResourceExhausted, "trying to send message larger than max (%d vs. %d)", len(payload), ss.maxSendMessageSize)
}
if err := ss.t.Write(ss.s, hdr, payload, &transport.Options{Last: false}); err != nil {
if err := ss.t.Write(ss.s, hdr, payload, &transport.Options{Last: false, ReturnBuffer: rb}); err != nil {
return toRPCErr(err)
}
if ss.binlog != nil {
@ -1507,23 +1554,44 @@ func MethodFromServerStream(stream ServerStream) (string, bool) {
return Method(stream.Context())
}
// Threshold beyond which buffer reuse should apply.
//
// TODO(adtac): make this an option in the future so that the user can
// configure it per-RPC or even per-message?
const bufferReuseThreshold = 1024
// prepareMsg returns the hdr, payload and data
// using the compressors passed or using the
// passed preparedmsg
func prepareMsg(m interface{}, codec baseCodec, cp Compressor, comp encoding.Compressor) (hdr, payload, data []byte, err error) {
func prepareMsg(m interface{}, codec baseCodec, cp Compressor, comp encoding.Compressor, attemptBufferReuse bool) (hdr, payload, data []byte, returnBuffer func(), err error) {
if preparedMsg, ok := m.(*PreparedMsg); ok {
return preparedMsg.hdr, preparedMsg.payload, preparedMsg.encodedData, nil
f := preparedMsg.returnBuffer
if !attemptBufferReuse {
f = nil
}
return preparedMsg.hdr, preparedMsg.payload, preparedMsg.encodedData, f, nil
}
// The input interface is not a prepared msg.
// Marshal and Compress the data at this point
data, err = encode(codec, m)
if err != nil {
return nil, nil, nil, err
return nil, nil, nil, nil, err
}
if attemptBufferReuse && cap(data) >= bufferReuseThreshold {
if bcodec, ok := codec.(bufferReturner); ok {
returnBuffer = func() {
bcodec.ReturnBuffer(data)
}
}
}
compData, err := compress(data, cp, comp)
if err != nil {
return nil, nil, nil, err
return nil, nil, nil, nil, err
}
hdr, payload = msgHeader(data, compData)
return hdr, payload, data, nil
return hdr, payload, data, returnBuffer, nil
}

2
vet.sh
View File

@ -117,7 +117,7 @@ fi
# TODO(dfawley): don't use deprecated functions in examples or first-party
# plugins.
SC_OUT="$(mktemp)"
staticcheck -go 1.9 -checks 'inherit,-ST1015' ./... > "${SC_OUT}" || true
staticcheck -go 1.9 -checks 'inherit,-ST1015,-SA6002' ./... > "${SC_OUT}" || true
# Error if anything other than deprecation warnings are printed.
(! grep -v "is deprecated:.*SA1019" "${SC_OUT}")
# Only ignore the following deprecated types/fields/functions.