-
Notifications
You must be signed in to change notification settings - Fork 18
/
Copy pathlifecycle.go
122 lines (106 loc) · 4.57 KB
/
lifecycle.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
// Copyright 2024 The Tessera authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package tessera
import (
"context"
"fmt"
"time"
"github.com/transparency-dev/trillian-tessera/api/layout"
)
// LogReader provides read-only access to the log.
type LogReader interface {
// ReadCheckpoint returns the latest checkpoint available.
ReadCheckpoint(ctx context.Context) ([]byte, error)
// ReadTile returns the raw marshalled tile at the given coordinates, if it exists.
// The expected usage for this method is to derive the parameters from a tree size
// that has been committed to by a checkpoint returned by this log. Whenever such a
// tree size is used, this method will behave as per the https://c2sp.org/tlog-tiles
// spec for the /tile/ path.
//
// If callers pass in parameters that are not implied by a published tree size, then
// implementations _may_ act differently from one another, but all will act in ways
// that are allowed by the spec. For example, if the only published tree size has been
// for size 2, then asking for a partial tile of 1 may lead to some implementations
// returning not found, some may return a tile with 1 leaf, and some may return a tile
// with more leaves.
ReadTile(ctx context.Context, level, index uint64, p uint8) ([]byte, error)
// ReadEntryBundle returns the raw marshalled leaf bundle at the given coordinates, if
// it exists.
// The expected usage and corresponding behaviours are similar to ReadTile.
ReadEntryBundle(ctx context.Context, index uint64, p uint8) ([]byte, error)
}
// Appender allows personalities access to the lifecycle methods associated with logs
// in sequencing mode. This only has a single method, but other methods are likely to be added
// such as a Shutdown method for #341.
type Appender struct {
Add AddFn
// TODO(#341): add this method and implement it in all drivers
// Shutdown func(ctx context.Context)
}
// NewAppender returns an Appender, which allows a personality to incrementally append new
// leaves to the log and to read from it.
//
// decorators provides a list of optional constructor functions that will return decorators
// that wrap the base appender. This can be used to provide deduplication. Decorators will be
// called in-order, and the last in the chain will be the base appender.
func NewAppender(ctx context.Context, d Driver, opts ...func(*AppendOptions)) (*Appender, LogReader, error) {
resolved := resolveAppendOptions(opts...)
type appendLifecycle interface {
Appender(context.Context, *AppendOptions) (*Appender, LogReader, error)
}
lc, ok := d.(appendLifecycle)
if !ok {
return nil, nil, fmt.Errorf("driver %T does not implement Appender lifecycle", d)
}
a, r, err := lc.Appender(ctx, resolved)
if err != nil {
return nil, nil, fmt.Errorf("failed to init appender lifecycle: %v", err)
}
for i := len(resolved.AddDecorators) - 1; i >= 0; i-- {
a.Add = resolved.AddDecorators[i](a.Add)
}
return a, r, nil
}
func WithAppendDeduplication(decorators ...func(AddFn) AddFn) func(*AppendOptions) {
return func(o *AppendOptions) {
o.AddDecorators = decorators
}
}
// AppendOptions holds settings for all storage implementations.
type AppendOptions struct {
// NewCP knows how to format and sign checkpoints.
NewCP func(size uint64, hash []byte) ([]byte, error)
BatchMaxAge time.Duration
BatchMaxSize uint
PushbackMaxOutstanding uint
// EntriesPath knows how to format entry bundle paths.
EntriesPath func(n uint64, p uint8) string
CheckpointInterval time.Duration
AddDecorators []func(AddFn) AddFn
}
// resolveAppendOptions turns a variadic array of storage options into an AppendOptions instance.
func resolveAppendOptions(opts ...func(*AppendOptions)) *AppendOptions {
defaults := &AppendOptions{
BatchMaxSize: DefaultBatchMaxSize,
BatchMaxAge: DefaultBatchMaxAge,
EntriesPath: layout.EntriesPath,
CheckpointInterval: DefaultCheckpointInterval,
AddDecorators: make([]func(AddFn) AddFn, 0),
PushbackMaxOutstanding: DefaultPushbackMaxOutstanding,
}
for _, opt := range opts {
opt(defaults)
}
return defaults
}