github.com/bartle-stripe/trillian@v1.2.1/storage/storagepb/storage.pb.go (about) 1 // Code generated by protoc-gen-go. DO NOT EDIT. 2 // source: storage.proto 3 4 package storagepb 5 6 import proto "github.com/golang/protobuf/proto" 7 import fmt "fmt" 8 import math "math" 9 10 // Reference imports to suppress errors if they are not otherwise used. 11 var _ = proto.Marshal 12 var _ = fmt.Errorf 13 var _ = math.Inf 14 15 // This is a compile-time assertion to ensure that this generated file 16 // is compatible with the proto package it is being compiled against. 17 // A compilation error at this line likely means your copy of the 18 // proto package needs to be updated. 19 const _ = proto.ProtoPackageIsVersion2 // please upgrade the proto package 20 21 // NodeIDProto is the serialized form of NodeID. It's used only for persistence in storage. 22 // As this is long-term we prefer not to use a Go specific format. 23 type NodeIDProto struct { 24 Path []byte `protobuf:"bytes,1,opt,name=path,proto3" json:"path,omitempty"` 25 PrefixLenBits int32 `protobuf:"varint,2,opt,name=prefix_len_bits,json=prefixLenBits" json:"prefix_len_bits,omitempty"` 26 XXX_NoUnkeyedLiteral struct{} `json:"-"` 27 XXX_unrecognized []byte `json:"-"` 28 XXX_sizecache int32 `json:"-"` 29 } 30 31 func (m *NodeIDProto) Reset() { *m = NodeIDProto{} } 32 func (m *NodeIDProto) String() string { return proto.CompactTextString(m) } 33 func (*NodeIDProto) ProtoMessage() {} 34 func (*NodeIDProto) Descriptor() ([]byte, []int) { 35 return fileDescriptor_storage_4abc7144f770b7da, []int{0} 36 } 37 func (m *NodeIDProto) XXX_Unmarshal(b []byte) error { 38 return xxx_messageInfo_NodeIDProto.Unmarshal(m, b) 39 } 40 func (m *NodeIDProto) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) { 41 return xxx_messageInfo_NodeIDProto.Marshal(b, m, deterministic) 42 } 43 func (dst *NodeIDProto) XXX_Merge(src proto.Message) { 44 xxx_messageInfo_NodeIDProto.Merge(dst, src) 45 } 46 func (m *NodeIDProto) XXX_Size() int { 47 return xxx_messageInfo_NodeIDProto.Size(m) 48 } 49 func (m *NodeIDProto) XXX_DiscardUnknown() { 50 xxx_messageInfo_NodeIDProto.DiscardUnknown(m) 51 } 52 53 var xxx_messageInfo_NodeIDProto proto.InternalMessageInfo 54 55 func (m *NodeIDProto) GetPath() []byte { 56 if m != nil { 57 return m.Path 58 } 59 return nil 60 } 61 62 func (m *NodeIDProto) GetPrefixLenBits() int32 { 63 if m != nil { 64 return m.PrefixLenBits 65 } 66 return 0 67 } 68 69 // SubtreeProto contains nodes of a subtree. 70 type SubtreeProto struct { 71 // subtree's prefix (must be a multiple of 8 bits) 72 Prefix []byte `protobuf:"bytes,1,opt,name=prefix,proto3" json:"prefix,omitempty"` 73 // subtree's depth 74 Depth int32 `protobuf:"varint,2,opt,name=depth" json:"depth,omitempty"` 75 RootHash []byte `protobuf:"bytes,3,opt,name=root_hash,json=rootHash,proto3" json:"root_hash,omitempty"` 76 // map of suffix (within subtree) to subtree-leaf node hash 77 Leaves map[string][]byte `protobuf:"bytes,4,rep,name=leaves" json:"leaves,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value,proto3"` 78 // Map of suffix (within subtree) to subtree-internal node hash. 79 // This structure is usually used in RAM as a cache, the internal nodes of 80 // the subtree are not generally stored. However internal nodes are stored for 81 // partially filled log subtrees. 82 InternalNodes map[string][]byte `protobuf:"bytes,5,rep,name=internal_nodes,json=internalNodes" json:"internal_nodes,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value,proto3"` 83 // Used as a crosscheck on the internal node map by recording its expected size after 84 // loading and repopulation. 85 InternalNodeCount uint32 `protobuf:"varint,6,opt,name=internal_node_count,json=internalNodeCount" json:"internal_node_count,omitempty"` 86 XXX_NoUnkeyedLiteral struct{} `json:"-"` 87 XXX_unrecognized []byte `json:"-"` 88 XXX_sizecache int32 `json:"-"` 89 } 90 91 func (m *SubtreeProto) Reset() { *m = SubtreeProto{} } 92 func (m *SubtreeProto) String() string { return proto.CompactTextString(m) } 93 func (*SubtreeProto) ProtoMessage() {} 94 func (*SubtreeProto) Descriptor() ([]byte, []int) { 95 return fileDescriptor_storage_4abc7144f770b7da, []int{1} 96 } 97 func (m *SubtreeProto) XXX_Unmarshal(b []byte) error { 98 return xxx_messageInfo_SubtreeProto.Unmarshal(m, b) 99 } 100 func (m *SubtreeProto) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) { 101 return xxx_messageInfo_SubtreeProto.Marshal(b, m, deterministic) 102 } 103 func (dst *SubtreeProto) XXX_Merge(src proto.Message) { 104 xxx_messageInfo_SubtreeProto.Merge(dst, src) 105 } 106 func (m *SubtreeProto) XXX_Size() int { 107 return xxx_messageInfo_SubtreeProto.Size(m) 108 } 109 func (m *SubtreeProto) XXX_DiscardUnknown() { 110 xxx_messageInfo_SubtreeProto.DiscardUnknown(m) 111 } 112 113 var xxx_messageInfo_SubtreeProto proto.InternalMessageInfo 114 115 func (m *SubtreeProto) GetPrefix() []byte { 116 if m != nil { 117 return m.Prefix 118 } 119 return nil 120 } 121 122 func (m *SubtreeProto) GetDepth() int32 { 123 if m != nil { 124 return m.Depth 125 } 126 return 0 127 } 128 129 func (m *SubtreeProto) GetRootHash() []byte { 130 if m != nil { 131 return m.RootHash 132 } 133 return nil 134 } 135 136 func (m *SubtreeProto) GetLeaves() map[string][]byte { 137 if m != nil { 138 return m.Leaves 139 } 140 return nil 141 } 142 143 func (m *SubtreeProto) GetInternalNodes() map[string][]byte { 144 if m != nil { 145 return m.InternalNodes 146 } 147 return nil 148 } 149 150 func (m *SubtreeProto) GetInternalNodeCount() uint32 { 151 if m != nil { 152 return m.InternalNodeCount 153 } 154 return 0 155 } 156 157 func init() { 158 proto.RegisterType((*NodeIDProto)(nil), "storagepb.NodeIDProto") 159 proto.RegisterType((*SubtreeProto)(nil), "storagepb.SubtreeProto") 160 proto.RegisterMapType((map[string][]byte)(nil), "storagepb.SubtreeProto.InternalNodesEntry") 161 proto.RegisterMapType((map[string][]byte)(nil), "storagepb.SubtreeProto.LeavesEntry") 162 } 163 164 func init() { proto.RegisterFile("storage.proto", fileDescriptor_storage_4abc7144f770b7da) } 165 166 var fileDescriptor_storage_4abc7144f770b7da = []byte{ 167 // 308 bytes of a gzipped FileDescriptorProto 168 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x94, 0x91, 0x4d, 0x4b, 0xc3, 0x40, 169 0x10, 0x86, 0x49, 0xd3, 0x06, 0x3b, 0x6d, 0xfc, 0x58, 0x45, 0x96, 0x7a, 0x09, 0x15, 0x24, 0x78, 170 0xc8, 0x41, 0x2f, 0x7e, 0x5c, 0xc4, 0x0f, 0xb0, 0x50, 0x44, 0xd7, 0x1f, 0x10, 0x36, 0x66, 0x34, 171 0xc1, 0xb0, 0x1b, 0x76, 0x37, 0xc5, 0xfe, 0x11, 0x7f, 0xaf, 0x64, 0xb3, 0x48, 0x44, 0x3c, 0x78, 172 0x9b, 0x77, 0xe6, 0x9d, 0x27, 0x93, 0x77, 0x21, 0xd4, 0x46, 0x2a, 0xfe, 0x86, 0x49, 0xad, 0xa4, 173 0x91, 0x64, 0xec, 0x64, 0x9d, 0xcd, 0x17, 0x30, 0x79, 0x90, 0x39, 0x2e, 0x6e, 0x1f, 0xed, 0x84, 174 0xc0, 0xb0, 0xe6, 0xa6, 0xa0, 0x5e, 0xe4, 0xc5, 0x53, 0x66, 0x6b, 0x72, 0x04, 0x5b, 0xb5, 0xc2, 175 0xd7, 0xf2, 0x23, 0xad, 0x50, 0xa4, 0x59, 0x69, 0x34, 0x1d, 0x44, 0x5e, 0x3c, 0x62, 0x61, 0xd7, 176 0x5e, 0xa2, 0xb8, 0x2e, 0x8d, 0x9e, 0x7f, 0xfa, 0x30, 0x7d, 0x6e, 0x32, 0xa3, 0x10, 0x3b, 0xd8, 177 0x3e, 0x04, 0x9d, 0xc3, 0xe1, 0x9c, 0x22, 0x7b, 0x30, 0xca, 0xb1, 0x36, 0x85, 0xc3, 0x74, 0x82, 178 0x1c, 0xc0, 0x58, 0x49, 0x69, 0xd2, 0x82, 0xeb, 0x82, 0xfa, 0x76, 0x61, 0xa3, 0x6d, 0xdc, 0x73, 179 0x5d, 0x90, 0x4b, 0x08, 0x2a, 0xe4, 0x2b, 0xd4, 0x74, 0x18, 0xf9, 0xf1, 0xe4, 0xe4, 0x30, 0xf9, 180 0xfe, 0x85, 0xa4, 0xff, 0xcd, 0x64, 0x69, 0x5d, 0x77, 0xc2, 0xa8, 0x35, 0x73, 0x2b, 0xe4, 0x09, 181 0x36, 0x4b, 0x61, 0x50, 0x09, 0x5e, 0xa5, 0x42, 0xe6, 0xa8, 0xe9, 0xc8, 0x42, 0x8e, 0xff, 0x82, 182 0x2c, 0x9c, 0xbb, 0x4d, 0xc6, 0xb1, 0xc2, 0xb2, 0xdf, 0x23, 0x09, 0xec, 0xfe, 0x40, 0xa6, 0x2f, 183 0xb2, 0x11, 0x86, 0x06, 0x91, 0x17, 0x87, 0x6c, 0xa7, 0xef, 0xbd, 0x69, 0x07, 0xb3, 0x73, 0x98, 184 0xf4, 0x2e, 0x23, 0xdb, 0xe0, 0xbf, 0xe3, 0xda, 0xc6, 0x32, 0x66, 0x6d, 0xd9, 0x66, 0xb2, 0xe2, 185 0x55, 0x83, 0x36, 0x93, 0x29, 0xeb, 0xc4, 0xc5, 0xe0, 0xcc, 0x9b, 0x5d, 0x01, 0xf9, 0x7d, 0xcf, 186 0x7f, 0x08, 0x59, 0x60, 0x5f, 0xfd, 0xf4, 0x2b, 0x00, 0x00, 0xff, 0xff, 0xf4, 0xae, 0x38, 0x20, 187 0x06, 0x02, 0x00, 0x00, 188 }