queue_runner.pb.go

// Code generated by protoc-gen-gogo. DO NOT EDIT.
// source: queue_runner.proto

package tensorflow

import (
	fmt "fmt"
	proto "github.com/gogo/protobuf/proto"
	io "io"
	math "math"
)

// Reference imports to suppress errors if they are not otherwise used.
var _ = proto.Marshal
var _ = fmt.Errorf
var _ = math.Inf

// This is a compile-time assertion to ensure that this generated file
// is compatible with the proto package it is being compiled against.
// A compilation error at this line likely means your copy of the
// proto package needs to be updated.
const _ = proto.GoGoProtoPackageIsVersion2 // please upgrade the proto package

// Protocol buffer representing a QueueRunner.
type QueueRunnerDef struct {
	// Queue name.
	QueueName string `protobuf:"bytes,1,opt,name=queue_name,json=queueName,proto3" json:"queue_name,omitempty"`
	// A list of enqueue operations.
	EnqueueOpName []string `protobuf:"bytes,2,rep,name=enqueue_op_name,json=enqueueOpName,proto3" json:"enqueue_op_name,omitempty"`
	// The operation to run to close the queue.
	CloseOpName string `protobuf:"bytes,3,opt,name=close_op_name,json=closeOpName,proto3" json:"close_op_name,omitempty"`
	// The operation to run to cancel the queue.
	CancelOpName string `protobuf:"bytes,4,opt,name=cancel_op_name,json=cancelOpName,proto3" json:"cancel_op_name,omitempty"`
	// A list of exception types considered to signal a safely closed queue
	// if raised during enqueue operations.
	QueueClosedExceptionTypes []Code `protobuf:"varint,5,rep,packed,name=queue_closed_exception_types,json=queueClosedExceptionTypes,proto3,enum=tensorflow.error.Code" json:"queue_closed_exception_types,omitempty"`
}

func (m *QueueRunnerDef) Reset()         { *m = QueueRunnerDef{} }
func (m *QueueRunnerDef) String() string { return proto.CompactTextString(m) }
func (*QueueRunnerDef) ProtoMessage()    {}
func (*QueueRunnerDef) Descriptor() ([]byte, []int) {
	return fileDescriptor_4fa241537e66b2d5, []int{0}
}
func (m *QueueRunnerDef) XXX_Unmarshal(b []byte) error {
	return m.Unmarshal(b)
}
func (m *QueueRunnerDef) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
	if deterministic {
		return xxx_messageInfo_QueueRunnerDef.Marshal(b, m, deterministic)
	} else {
		b = b[:cap(b)]
		n, err := m.MarshalTo(b)
		if err != nil {
			return nil, err
		}
		return b[:n], nil
	}
}
func (m *QueueRunnerDef) XXX_Merge(src proto.Message) {
	xxx_messageInfo_QueueRunnerDef.Merge(m, src)
}
func (m *QueueRunnerDef) XXX_Size() int {
	return m.Size()
}
func (m *QueueRunnerDef) XXX_DiscardUnknown() {
	xxx_messageInfo_QueueRunnerDef.DiscardUnknown(m)
}

var xxx_messageInfo_QueueRunnerDef proto.InternalMessageInfo

func (m *QueueRunnerDef) GetQueueName() string {
	if m != nil {
		return m.QueueName
	}
	return ""
}

func (m *QueueRunnerDef) GetEnqueueOpName() []string {
	if m != nil {
		return m.EnqueueOpName
	}
	return nil
}

func (m *QueueRunnerDef) GetCloseOpName() string {
	if m != nil {
		return m.CloseOpName
	}
	return ""
}

func (m *QueueRunnerDef) GetCancelOpName() string {
	if m != nil {
		return m.CancelOpName
	}
	return ""
}

func (m *QueueRunnerDef) GetQueueClosedExceptionTypes() []Code {
	if m != nil {
		return m.QueueClosedExceptionTypes
	}
	return nil
}

func init() {
	proto.RegisterType((*QueueRunnerDef)(nil), "tensorflow.QueueRunnerDef")
}

func init() { proto.RegisterFile("queue_runner.proto", fileDescriptor_4fa241537e66b2d5) }

var fileDescriptor_4fa241537e66b2d5 = []byte{
	// 307 bytes of a gzipped FileDescriptorProto
	0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x4c, 0x90, 0xc1, 0x4e, 0xf2, 0x40,
	0x14, 0x85, 0x99, 0x9f, 0x5f, 0x13, 0x46, 0xc1, 0xd0, 0x85, 0x41, 0xa3, 0x13, 0x24, 0xc6, 0xb0,
	0xb1, 0x24, 0xfa, 0x06, 0xa0, 0x5b, 0xc5, 0xc6, 0xc4, 0xc4, 0x4d, 0x53, 0x86, 0x0b, 0xa2, 0x74,
	0xee, 0x78, 0x3b, 0x0d, 0xfa, 0x16, 0x3e, 0x96, 0x4b, 0x96, 0x2e, 0x0d, 0x7d, 0x09, 0xe3, 0xca,
	0x74, 0xa6, 0x5a, 0xb6, 0x67, 0xbe, 0xef, 0x4c, 0xee, 0xe1, 0xde, 0x73, 0x0a, 0x29, 0x84, 0x94,
	0x2a, 0x05, 0xe4, 0x6b, 0x42, 0x83, 0x1e, 0x37, 0xa0, 0x12, 0xa4, 0xc9, 0x1c, 0x17, 0xfb, 0x4d,
	0x20, 0x42, 0x0a, 0x25, 0x8e, 0x21, 0x71, 0xcf, 0x9d, 0x6f, 0xc6, 0x1b, 0x37, 0xb9, 0x15, 0x58,
	0xe9, 0x02, 0x26, 0xde, 0x21, 0xe7, 0xae, 0x47, 0x45, 0x31, 0xb4, 0x58, 0x9b, 0x75, 0x6b, 0x41,
	0xcd, 0x26, 0x57, 0x51, 0x0c, 0xde, 0x09, 0xdf, 0x01, 0xe5, 0x00, 0xd4, 0x8e, 0xf9, 0xd7, 0xae,
	0x76, 0x6b, 0x41, 0xbd, 0x88, 0xaf, 0xb5, 0xe5, 0x3a, 0xbc, 0x2e, 0xe7, 0x98, 0x94, 0x54, 0xd5,
	0x36, 0x6d, 0xd9, 0xb0, 0x60, 0x8e, 0x79, 0x43, 0x46, 0x4a, 0xc2, 0xfc, 0x0f, 0xfa, 0x6f, 0xa1,
	0x6d, 0x97, 0x16, 0xd4, 0x1d, 0x3f, 0x70, 0xff, 0x59, 0x75, 0x1c, 0xc2, 0x8b, 0x04, 0x6d, 0x66,
	0xa8, 0x42, 0xf3, 0xaa, 0x21, 0x69, 0x6d, 0xb4, 0xab, 0xdd, 0xc6, 0xd9, 0xae, 0x5f, 0x5e, 0xea,
	0xdb, 0x43, 0xfd, 0x01, 0x8e, 0x21, 0xd8, 0xb3, 0xee, 0xc0, 0xaa, 0x97, 0xbf, 0xe6, 0x6d, 0x2e,
	0xf6, 0xe3, 0xf7, 0x95, 0x60, 0xcb, 0x95, 0x60, 0x9f, 0x2b, 0xc1, 0xde, 0x32, 0x51, 0x59, 0x66,
	0xa2, 0xf2, 0x91, 0x89, 0x0a, 0x6f, 0x21, 0x4d, 0xd7, 0xfb, 0x26, 0x14, 0xc5, 0xb0, 0x40, 0x7a,
	0xea, 0x37, 0xd7, 0xd6, 0x1a, 0xe6, 0x13, 0x26, 0x43, 0x76, 0x7f, 0x34, 0x9d, 0x99, 0x87, 0x74,
	0xe4, 0x4b, 0x8c, 0x7b, 0x14, 0xcd, 0x4e, 0x35, 0xe1, 0x23, 0x48, 0xd3, 0x2b, 0x1b, 0xbe, 0x18,
	0x1b, 0x6d, 0xda, 0xc9, 0xcf, 0x7f, 0x02, 0x00, 0x00, 0xff, 0xff, 0x63, 0x66, 0x11, 0x08, 0xa7,
	0x01, 0x00, 0x00,
}

func (m *QueueRunnerDef) Marshal() (dAtA []byte, err error) {
	size := m.Size()
	dAtA = make([]byte, size)
	n, err := m.MarshalTo(dAtA)
	if err != nil {
		return nil, err
	}
	return dAtA[:n], nil
}

func (m *QueueRunnerDef) MarshalTo(dAtA []byte) (int, error) {
	var i int
	_ = i
	var l int
	_ = l
	if len(m.QueueName) > 0 {
		dAtA[i] = 0xa
		i++
		i = encodeVarintQueueRunner(dAtA, i, uint64(len(m.QueueName)))
		i += copy(dAtA[i:], m.QueueName)
	}
	if len(m.EnqueueOpName) > 0 {
		for _, s := range m.EnqueueOpName {
			dAtA[i] = 0x12
			i++
			l = len(s)
			for l >= 1<<7 {
				dAtA[i] = uint8(uint64(l)&0x7f | 0x80)
				l >>= 7
				i++
			}
			dAtA[i] = uint8(l)
			i++
			i += copy(dAtA[i:], s)
		}
	}
	if len(m.CloseOpName) > 0 {
		dAtA[i] = 0x1a
		i++
		i = encodeVarintQueueRunner(dAtA, i, uint64(len(m.CloseOpName)))
		i += copy(dAtA[i:], m.CloseOpName)
	}
	if len(m.CancelOpName) > 0 {
		dAtA[i] = 0x22
		i++
		i = encodeVarintQueueRunner(dAtA, i, uint64(len(m.CancelOpName)))
		i += copy(dAtA[i:], m.CancelOpName)
	}
	if len(m.QueueClosedExceptionTypes) > 0 {
		dAtA2 := make([]byte, len(m.QueueClosedExceptionTypes)*10)
		var j1 int
		for _, num := range m.QueueClosedExceptionTypes {
			for num >= 1<<7 {
				dAtA2[j1] = uint8(uint64(num)&0x7f | 0x80)
				num >>= 7
				j1++
			}
			dAtA2[j1] = uint8(num)
			j1++
		}
		dAtA[i] = 0x2a
		i++
		i = encodeVarintQueueRunner(dAtA, i, uint64(j1))
		i += copy(dAtA[i:], dAtA2[:j1])
	}
	return i, nil
}

func encodeVarintQueueRunner(dAtA []byte, offset int, v uint64) int {
	for v >= 1<<7 {
		dAtA[offset] = uint8(v&0x7f | 0x80)
		v >>= 7
		offset++
	}
	dAtA[offset] = uint8(v)
	return offset + 1
}
func (m *QueueRunnerDef) Size() (n int) {
	if m == nil {
		return 0
	}
	var l int
	_ = l
	l = len(m.QueueName)
	if l > 0 {
		n += 1 + l + sovQueueRunner(uint64(l))
	}
	if len(m.EnqueueOpName) > 0 {
		for _, s := range m.EnqueueOpName {
			l = len(s)
			n += 1 + l + sovQueueRunner(uint64(l))
		}
	}
	l = len(m.CloseOpName)
	if l > 0 {
		n += 1 + l + sovQueueRunner(uint64(l))
	}
	l = len(m.CancelOpName)
	if l > 0 {
		n += 1 + l + sovQueueRunner(uint64(l))
	}
	if len(m.QueueClosedExceptionTypes) > 0 {
		l = 0
		for _, e := range m.QueueClosedExceptionTypes {
			l += sovQueueRunner(uint64(e))
		}
		n += 1 + sovQueueRunner(uint64(l)) + l
	}
	return n
}

func sovQueueRunner(x uint64) (n int) {
	for {
		n++
		x >>= 7
		if x == 0 {
			break
		}
	}
	return n
}
func sozQueueRunner(x uint64) (n int) {
	return sovQueueRunner(uint64((x << 1) ^ uint64((int64(x) >> 63))))
}
func (m *QueueRunnerDef) Unmarshal(dAtA []byte) error {
	l := len(dAtA)
	iNdEx := 0
	for iNdEx < l {
		preIndex := iNdEx
		var wire uint64
		for shift := uint(0); ; shift += 7 {
			if shift >= 64 {
				return ErrIntOverflowQueueRunner
			}
			if iNdEx >= l {
				return io.ErrUnexpectedEOF
			}
			b := dAtA[iNdEx]
			iNdEx++
			wire |= uint64(b&0x7F) << shift
			if b < 0x80 {
				break
			}
		}
		fieldNum := int32(wire >> 3)
		wireType := int(wire & 0x7)
		if wireType == 4 {
			return fmt.Errorf("proto: QueueRunnerDef: wiretype end group for non-group")
		}
		if fieldNum <= 0 {
			return fmt.Errorf("proto: QueueRunnerDef: illegal tag %d (wire type %d)", fieldNum, wire)
		}
		switch fieldNum {
		case 1:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field QueueName", wireType)
			}
			var stringLen uint64
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowQueueRunner
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				stringLen |= uint64(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			intStringLen := int(stringLen)
			if intStringLen < 0 {
				return ErrInvalidLengthQueueRunner
			}
			postIndex := iNdEx + intStringLen
			if postIndex < 0 {
				return ErrInvalidLengthQueueRunner
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			m.QueueName = string(dAtA[iNdEx:postIndex])
			iNdEx = postIndex
		case 2:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field EnqueueOpName", wireType)
			}
			var stringLen uint64
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowQueueRunner
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				stringLen |= uint64(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			intStringLen := int(stringLen)
			if intStringLen < 0 {
				return ErrInvalidLengthQueueRunner
			}
			postIndex := iNdEx + intStringLen
			if postIndex < 0 {
				return ErrInvalidLengthQueueRunner
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			m.EnqueueOpName = append(m.EnqueueOpName, string(dAtA[iNdEx:postIndex]))
			iNdEx = postIndex
		case 3:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field CloseOpName", wireType)
			}
			var stringLen uint64
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowQueueRunner
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				stringLen |= uint64(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			intStringLen := int(stringLen)
			if intStringLen < 0 {
				return ErrInvalidLengthQueueRunner
			}
			postIndex := iNdEx + intStringLen
			if postIndex < 0 {
				return ErrInvalidLengthQueueRunner
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			m.CloseOpName = string(dAtA[iNdEx:postIndex])
			iNdEx = postIndex
		case 4:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field CancelOpName", wireType)
			}
			var stringLen uint64
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowQueueRunner
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				stringLen |= uint64(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			intStringLen := int(stringLen)
			if intStringLen < 0 {
				return ErrInvalidLengthQueueRunner
			}
			postIndex := iNdEx + intStringLen
			if postIndex < 0 {
				return ErrInvalidLengthQueueRunner
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			m.CancelOpName = string(dAtA[iNdEx:postIndex])
			iNdEx = postIndex
		case 5:
			if wireType == 0 {
				var v Code
				for shift := uint(0); ; shift += 7 {
					if shift >= 64 {
						return ErrIntOverflowQueueRunner
					}
					if iNdEx >= l {
						return io.ErrUnexpectedEOF
					}
					b := dAtA[iNdEx]
					iNdEx++
					v |= Code(b&0x7F) << shift
					if b < 0x80 {
						break
					}
				}
				m.QueueClosedExceptionTypes = append(m.QueueClosedExceptionTypes, v)
			} else if wireType == 2 {
				var packedLen int
				for shift := uint(0); ; shift += 7 {
					if shift >= 64 {
						return ErrIntOverflowQueueRunner
					}
					if iNdEx >= l {
						return io.ErrUnexpectedEOF
					}
					b := dAtA[iNdEx]
					iNdEx++
					packedLen |= int(b&0x7F) << shift
					if b < 0x80 {
						break
					}
				}
				if packedLen < 0 {
					return ErrInvalidLengthQueueRunner
				}
				postIndex := iNdEx + packedLen
				if postIndex < 0 {
					return ErrInvalidLengthQueueRunner
				}
				if postIndex > l {
					return io.ErrUnexpectedEOF
				}
				var elementCount int
				if elementCount != 0 && len(m.QueueClosedExceptionTypes) == 0 {
					m.QueueClosedExceptionTypes = make([]Code, 0, elementCount)
				}
				for iNdEx < postIndex {
					var v Code
					for shift := uint(0); ; shift += 7 {
						if shift >= 64 {
							return ErrIntOverflowQueueRunner
						}
						if iNdEx >= l {
							return io.ErrUnexpectedEOF
						}
						b := dAtA[iNdEx]
						iNdEx++
						v |= Code(b&0x7F) << shift
						if b < 0x80 {
							break
						}
					}
					m.QueueClosedExceptionTypes = append(m.QueueClosedExceptionTypes, v)
				}
			} else {
				return fmt.Errorf("proto: wrong wireType = %d for field QueueClosedExceptionTypes", wireType)
			}
		default:
			iNdEx = preIndex
			skippy, err := skipQueueRunner(dAtA[iNdEx:])
			if err != nil {
				return err
			}
			if skippy < 0 {
				return ErrInvalidLengthQueueRunner
			}
			if (iNdEx + skippy) < 0 {
				return ErrInvalidLengthQueueRunner
			}
			if (iNdEx + skippy) > l {
				return io.ErrUnexpectedEOF
			}
			iNdEx += skippy
		}
	}

	if iNdEx > l {
		return io.ErrUnexpectedEOF
	}
	return nil
}
func skipQueueRunner(dAtA []byte) (n int, err error) {
	l := len(dAtA)
	iNdEx := 0
	for iNdEx < l {
		var wire uint64
		for shift := uint(0); ; shift += 7 {
			if shift >= 64 {
				return 0, ErrIntOverflowQueueRunner
			}
			if iNdEx >= l {
				return 0, io.ErrUnexpectedEOF
			}
			b := dAtA[iNdEx]
			iNdEx++
			wire |= (uint64(b) & 0x7F) << shift
			if b < 0x80 {
				break
			}
		}
		wireType := int(wire & 0x7)
		switch wireType {
		case 0:
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return 0, ErrIntOverflowQueueRunner
				}
				if iNdEx >= l {
					return 0, io.ErrUnexpectedEOF
				}
				iNdEx++
				if dAtA[iNdEx-1] < 0x80 {
					break
				}
			}
			return iNdEx, nil
		case 1:
			iNdEx += 8
			return iNdEx, nil
		case 2:
			var length int
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return 0, ErrIntOverflowQueueRunner
				}
				if iNdEx >= l {
					return 0, io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				length |= (int(b) & 0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			if length < 0 {
				return 0, ErrInvalidLengthQueueRunner
			}
			iNdEx += length
			if iNdEx < 0 {
				return 0, ErrInvalidLengthQueueRunner
			}
			return iNdEx, nil
		case 3:
			for {
				var innerWire uint64
				var start int = iNdEx
				for shift := uint(0); ; shift += 7 {
					if shift >= 64 {
						return 0, ErrIntOverflowQueueRunner
					}
					if iNdEx >= l {
						return 0, io.ErrUnexpectedEOF
					}
					b := dAtA[iNdEx]
					iNdEx++
					innerWire |= (uint64(b) & 0x7F) << shift
					if b < 0x80 {
						break
					}
				}
				innerWireType := int(innerWire & 0x7)
				if innerWireType == 4 {
					break
				}
				next, err := skipQueueRunner(dAtA[start:])
				if err != nil {
					return 0, err
				}
				iNdEx = start + next
				if iNdEx < 0 {
					return 0, ErrInvalidLengthQueueRunner
				}
			}
			return iNdEx, nil
		case 4:
			return iNdEx, nil
		case 5:
			iNdEx += 4
			return iNdEx, nil
		default:
			return 0, fmt.Errorf("proto: illegal wireType %d", wireType)
		}
	}
	panic("unreachable")
}

var (
	ErrInvalidLengthQueueRunner = fmt.Errorf("proto: negative length found during unmarshaling")
	ErrIntOverflowQueueRunner   = fmt.Errorf("proto: integer overflow")
)