mirror of https://github.com/grpc/grpc-go.git
				
				
				
			
		
			
				
	
	
		
			235 lines
		
	
	
		
			6.9 KiB
		
	
	
	
		
			Go
		
	
	
	
			
		
		
	
	
			235 lines
		
	
	
		
			6.9 KiB
		
	
	
	
		
			Go
		
	
	
	
| /*
 | |
|  *
 | |
|  * Copyright 2014, Google Inc.
 | |
|  * All rights reserved.
 | |
|  *
 | |
|  * Redistribution and use in source and binary forms, with or without
 | |
|  * modification, are permitted provided that the following conditions are
 | |
|  * met:
 | |
|  *
 | |
|  *     * Redistributions of source code must retain the above copyright
 | |
|  * notice, this list of conditions and the following disclaimer.
 | |
|  *     * Redistributions in binary form must reproduce the above
 | |
|  * copyright notice, this list of conditions and the following disclaimer
 | |
|  * in the documentation and/or other materials provided with the
 | |
|  * distribution.
 | |
|  *     * Neither the name of Google Inc. nor the names of its
 | |
|  * contributors may be used to endorse or promote products derived from
 | |
|  * this software without specific prior written permission.
 | |
|  *
 | |
|  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 | |
|  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 | |
|  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 | |
|  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 | |
|  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 | |
|  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 | |
|  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 | |
|  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 | |
|  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 | |
|  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 | |
|  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 | |
|  *
 | |
|  */
 | |
| 
 | |
| package grpc
 | |
| 
 | |
| import (
 | |
| 	"bytes"
 | |
| 	"io"
 | |
| 	"math"
 | |
| 	"reflect"
 | |
| 	"testing"
 | |
| 
 | |
| 	"github.com/golang/protobuf/proto"
 | |
| 	"golang.org/x/net/context"
 | |
| 	"google.golang.org/grpc/codes"
 | |
| 	perfpb "google.golang.org/grpc/test/codec_perf"
 | |
| 	"google.golang.org/grpc/transport"
 | |
| )
 | |
| 
 | |
| func TestSimpleParsing(t *testing.T) {
 | |
| 	bigMsg := bytes.Repeat([]byte{'x'}, 1<<24)
 | |
| 	for _, test := range []struct {
 | |
| 		// input
 | |
| 		p []byte
 | |
| 		// outputs
 | |
| 		err error
 | |
| 		b   []byte
 | |
| 		pt  payloadFormat
 | |
| 	}{
 | |
| 		{nil, io.EOF, nil, compressionNone},
 | |
| 		{[]byte{0, 0, 0, 0, 0}, nil, nil, compressionNone},
 | |
| 		{[]byte{0, 0, 0, 0, 1, 'a'}, nil, []byte{'a'}, compressionNone},
 | |
| 		{[]byte{1, 0}, io.ErrUnexpectedEOF, nil, compressionNone},
 | |
| 		{[]byte{0, 0, 0, 0, 10, 'a'}, io.ErrUnexpectedEOF, nil, compressionNone},
 | |
| 		// Check that messages with length >= 2^24 are parsed.
 | |
| 		{append([]byte{0, 1, 0, 0, 0}, bigMsg...), nil, bigMsg, compressionNone},
 | |
| 	} {
 | |
| 		buf := bytes.NewReader(test.p)
 | |
| 		parser := &parser{r: buf}
 | |
| 		pt, b, err := parser.recvMsg(math.MaxInt32)
 | |
| 		if err != test.err || !bytes.Equal(b, test.b) || pt != test.pt {
 | |
| 			t.Fatalf("parser{%v}.recvMsg(_) = %v, %v, %v\nwant %v, %v, %v", test.p, pt, b, err, test.pt, test.b, test.err)
 | |
| 		}
 | |
| 	}
 | |
| }
 | |
| 
 | |
| func TestMultipleParsing(t *testing.T) {
 | |
| 	// Set a byte stream consists of 3 messages with their headers.
 | |
| 	p := []byte{0, 0, 0, 0, 1, 'a', 0, 0, 0, 0, 2, 'b', 'c', 0, 0, 0, 0, 1, 'd'}
 | |
| 	b := bytes.NewReader(p)
 | |
| 	parser := &parser{r: b}
 | |
| 
 | |
| 	wantRecvs := []struct {
 | |
| 		pt   payloadFormat
 | |
| 		data []byte
 | |
| 	}{
 | |
| 		{compressionNone, []byte("a")},
 | |
| 		{compressionNone, []byte("bc")},
 | |
| 		{compressionNone, []byte("d")},
 | |
| 	}
 | |
| 	for i, want := range wantRecvs {
 | |
| 		pt, data, err := parser.recvMsg(math.MaxInt32)
 | |
| 		if err != nil || pt != want.pt || !reflect.DeepEqual(data, want.data) {
 | |
| 			t.Fatalf("after %d calls, parser{%v}.recvMsg(_) = %v, %v, %v\nwant %v, %v, <nil>",
 | |
| 				i, p, pt, data, err, want.pt, want.data)
 | |
| 		}
 | |
| 	}
 | |
| 
 | |
| 	pt, data, err := parser.recvMsg(math.MaxInt32)
 | |
| 	if err != io.EOF {
 | |
| 		t.Fatalf("after %d recvMsgs calls, parser{%v}.recvMsg(_) = %v, %v, %v\nwant _, _, %v",
 | |
| 			len(wantRecvs), p, pt, data, err, io.EOF)
 | |
| 	}
 | |
| }
 | |
| 
 | |
| func TestEncode(t *testing.T) {
 | |
| 	for _, test := range []struct {
 | |
| 		// input
 | |
| 		msg proto.Message
 | |
| 		cp  Compressor
 | |
| 		// outputs
 | |
| 		b   []byte
 | |
| 		err error
 | |
| 	}{
 | |
| 		{nil, nil, []byte{0, 0, 0, 0, 0}, nil},
 | |
| 	} {
 | |
| 		b, err := encode(protoCodec{}, test.msg, nil, nil, nil)
 | |
| 		if err != test.err || !bytes.Equal(b, test.b) {
 | |
| 			t.Fatalf("encode(_, _, %v, _) = %v, %v\nwant %v, %v", test.cp, b, err, test.b, test.err)
 | |
| 		}
 | |
| 	}
 | |
| }
 | |
| 
 | |
| func TestCompress(t *testing.T) {
 | |
| 	for _, test := range []struct {
 | |
| 		// input
 | |
| 		data []byte
 | |
| 		cp   Compressor
 | |
| 		dc   Decompressor
 | |
| 		// outputs
 | |
| 		err error
 | |
| 	}{
 | |
| 		{make([]byte, 1024), &gzipCompressor{}, &gzipDecompressor{}, nil},
 | |
| 	} {
 | |
| 		b := new(bytes.Buffer)
 | |
| 		if err := test.cp.Do(b, test.data); err != test.err {
 | |
| 			t.Fatalf("Compressor.Do(_, %v) = %v, want %v", test.data, err, test.err)
 | |
| 		}
 | |
| 		if b.Len() >= len(test.data) {
 | |
| 			t.Fatalf("The compressor fails to compress data.")
 | |
| 		}
 | |
| 		if p, err := test.dc.Do(b); err != nil || !bytes.Equal(test.data, p) {
 | |
| 			t.Fatalf("Decompressor.Do(%v) = %v, %v, want %v, <nil>", b, p, err, test.data)
 | |
| 		}
 | |
| 	}
 | |
| }
 | |
| 
 | |
| func TestToRPCErr(t *testing.T) {
 | |
| 	for _, test := range []struct {
 | |
| 		// input
 | |
| 		errIn error
 | |
| 		// outputs
 | |
| 		errOut *rpcError
 | |
| 	}{
 | |
| 		{transport.StreamError{codes.Unknown, ""}, Errorf(codes.Unknown, "").(*rpcError)},
 | |
| 		{transport.ErrConnClosing, Errorf(codes.Internal, transport.ErrConnClosing.Desc).(*rpcError)},
 | |
| 	} {
 | |
| 		err := toRPCErr(test.errIn)
 | |
| 		rpcErr, ok := err.(*rpcError)
 | |
| 		if !ok {
 | |
| 			t.Fatalf("toRPCErr{%v} returned type %T, want %T", test.errIn, err, rpcError{})
 | |
| 		}
 | |
| 		if *rpcErr != *test.errOut {
 | |
| 			t.Fatalf("toRPCErr{%v} = %v \nwant %v", test.errIn, err, test.errOut)
 | |
| 		}
 | |
| 	}
 | |
| }
 | |
| 
 | |
| func TestContextErr(t *testing.T) {
 | |
| 	for _, test := range []struct {
 | |
| 		// input
 | |
| 		errIn error
 | |
| 		// outputs
 | |
| 		errOut transport.StreamError
 | |
| 	}{
 | |
| 		{context.DeadlineExceeded, transport.StreamError{codes.DeadlineExceeded, context.DeadlineExceeded.Error()}},
 | |
| 		{context.Canceled, transport.StreamError{codes.Canceled, context.Canceled.Error()}},
 | |
| 	} {
 | |
| 		err := transport.ContextErr(test.errIn)
 | |
| 		if err != test.errOut {
 | |
| 			t.Fatalf("ContextErr{%v} = %v \nwant %v", test.errIn, err, test.errOut)
 | |
| 		}
 | |
| 	}
 | |
| }
 | |
| 
 | |
| func TestErrorsWithSameParameters(t *testing.T) {
 | |
| 	const description = "some description"
 | |
| 	e1 := Errorf(codes.AlreadyExists, description).(*rpcError)
 | |
| 	e2 := Errorf(codes.AlreadyExists, description).(*rpcError)
 | |
| 	if e1 == e2 {
 | |
| 		t.Fatalf("Error interfaces should not be considered equal - e1: %p - %v  e2: %p - %v", e1, e1, e2, e2)
 | |
| 	}
 | |
| 	if Code(e1) != Code(e2) || ErrorDesc(e1) != ErrorDesc(e2) {
 | |
| 		t.Fatalf("Expected errors to have same code and description - e1: %p - %v  e2: %p - %v", e1, e1, e2, e2)
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // bmEncode benchmarks encoding a Protocol Buffer message containing mSize
 | |
| // bytes.
 | |
| func bmEncode(b *testing.B, mSize int) {
 | |
| 	msg := &perfpb.Buffer{Body: make([]byte, mSize)}
 | |
| 	encoded, _ := encode(protoCodec{}, msg, nil, nil, nil)
 | |
| 	encodedSz := int64(len(encoded))
 | |
| 	b.ReportAllocs()
 | |
| 	b.ResetTimer()
 | |
| 	for i := 0; i < b.N; i++ {
 | |
| 		encode(protoCodec{}, msg, nil, nil, nil)
 | |
| 	}
 | |
| 	b.SetBytes(encodedSz)
 | |
| }
 | |
| 
 | |
| func BenchmarkEncode1B(b *testing.B) {
 | |
| 	bmEncode(b, 1)
 | |
| }
 | |
| 
 | |
| func BenchmarkEncode1KiB(b *testing.B) {
 | |
| 	bmEncode(b, 1024)
 | |
| }
 | |
| 
 | |
| func BenchmarkEncode8KiB(b *testing.B) {
 | |
| 	bmEncode(b, 8*1024)
 | |
| }
 | |
| 
 | |
| func BenchmarkEncode64KiB(b *testing.B) {
 | |
| 	bmEncode(b, 64*1024)
 | |
| }
 | |
| 
 | |
| func BenchmarkEncode512KiB(b *testing.B) {
 | |
| 	bmEncode(b, 512*1024)
 | |
| }
 | |
| 
 | |
| func BenchmarkEncode1MiB(b *testing.B) {
 | |
| 	bmEncode(b, 1024*1024)
 | |
| }
 |