github.com/mre-fog/trillianxx@v1.1.2-0.20180615153820-ae375a99d36a/storage/storagepb/storage.pb.go (about)

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