forked from bep/s3deploy
-
Notifications
You must be signed in to change notification settings - Fork 1
/
store.go
183 lines (143 loc) · 3.53 KB
/
store.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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
// Copyright © 2018 Bjørn Erik Pedersen <bjorn.erik.pedersen@gmail.com>.
//
// Use of this source code is governed by an MIT-style
// license that can be found in the LICENSE file.
package lib
import (
"context"
"sync/atomic"
)
var (
_ remoteStore = (*store)(nil)
)
type remoteStore interface {
FileMap(opts ...opOption) (map[string]file, error)
Put(ctx context.Context, f localFile, opts ...opOption) error
DeleteObjects(ctx context.Context, keys []string, opts ...opOption) error
}
type store struct {
delegate remoteStore
}
func newStore(s remoteStore) remoteStore {
return &store{delegate: s}
}
func (s *store) FileMap(opts ...opOption) (map[string]file, error) {
return s.delegate.FileMap(opts...)
}
func (s *store) Put(ctx context.Context, f localFile, opts ...opOption) error {
conf, err := optsToConfig(opts...)
if err != nil {
return err
}
err = s.delegate.Put(ctx, f, opts...)
if err == nil {
conf.statsCollector(1, 0)
}
return err
}
func (s *store) DeleteObjects(ctx context.Context, keys []string, opts ...opOption) error {
if len(keys) == 0 {
return nil
}
conf, err := optsToConfig(opts...)
if err != nil {
return err
}
if conf.maxDelete <= 0 {
// Nothing to do.
return nil
}
chunkSize := 1000 // This is the maximum supported by the AWS SDK.
if conf.maxDelete < chunkSize {
chunkSize = conf.maxDelete
}
keyChunks := chunkStrings(keys, chunkSize)
deleted := 0
for i := 0; i < len(keyChunks); i++ {
keyChunk := keyChunks[i]
err := s.delegate.DeleteObjects(ctx, keyChunk, opts...)
if err != nil {
return err
}
deleted += len(keyChunk)
conf.statsCollector(deleted, 0)
if deleted >= conf.maxDelete {
conf.statsCollector(0, len(keys)-deleted)
break
}
}
return nil
}
type noUpdateStore struct {
readOps remoteStore
}
func newNoUpdateStore(base remoteStore) remoteStore {
return &noUpdateStore{readOps: base}
}
func (s *noUpdateStore) FileMap(opts ...opOption) (map[string]file, error) {
if s.readOps != nil {
return s.readOps.FileMap(opts...)
}
return make(map[string]file), nil
}
func (s *noUpdateStore) Put(ctx context.Context, f localFile, opts ...opOption) error {
return nil
}
func (s *noUpdateStore) DeleteObjects(ctx context.Context, keys []string, opts ...opOption) error {
return nil
}
type opConfig struct {
maxDelete int
statsCollector func(handled, skipped int)
}
type opOption func(c *opConfig) error
func withMaxDelete(count int) opOption {
return func(c *opConfig) error {
c.maxDelete = count
return nil
}
}
func withUploadStats(stats *DeployStats) opOption {
return func(c *opConfig) error {
c.statsCollector = func(handled, skipped int) {
atomic.AddUint64(&stats.Uploaded, uint64(handled))
atomic.AddUint64(&stats.Skipped, uint64(skipped))
}
return nil
}
}
func withDeleteStats(stats *DeployStats) opOption {
return func(c *opConfig) error {
c.statsCollector = func(handled, skipped int) {
atomic.AddUint64(&stats.Deleted, uint64(handled))
atomic.AddUint64(&stats.Stale, uint64(skipped))
}
return nil
}
}
func optsToConfig(opts ...opOption) (*opConfig, error) {
c := &opConfig{}
for _, opt := range opts {
if err := opt(c); err != nil {
return c, err
}
}
if c.statsCollector == nil {
c.statsCollector = func(handled, skipped int) {}
}
return c, nil
}
func chunkStrings(s []string, size int) [][]string {
if len(s) == 0 {
return nil
}
var chunks [][]string
for i := 0; i < len(s); i += size {
end := i + size
if end > len(s) {
end = len(s)
}
chunks = append(chunks, s[i:end])
}
return chunks
}