aboutsummaryrefslogtreecommitdiff
path: root/objectstore/chain/chain.go
blob: f2992b342115488a753f04e6ce5414a09ed1aa40 (about) (plain) (blame)
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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
// Package chain provides an adaptive wrapper over multiple object storage
// backends.
package chain

import (
	"errors"
	"fmt"
	"io"
	"sync"

	"codeberg.org/lindenii/furgit/objectid"
	"codeberg.org/lindenii/furgit/objectstore"
	"codeberg.org/lindenii/furgit/objecttype"
)

// Chain queries multiple object databases with an MRU backend preference.
type Chain struct {
	mu sync.RWMutex

	backendHead        *backendNode
	backendTail        *backendNode
	backendNodeByStore map[objectstore.Store]*backendNode
}

// New creates a Chain from backends.
func New(backends ...objectstore.Store) *Chain {
	nodeByStore := make(map[objectstore.Store]*backendNode, len(backends))
	var head *backendNode
	var tail *backendNode

	for _, backend := range backends {
		if backend == nil {
			continue
		}
		node := &backendNode{
			backend: backend,
			prev:    tail,
		}
		if tail != nil {
			tail.next = node
		}
		if head == nil {
			head = node
		}
		tail = node
		nodeByStore[backend] = node
	}

	return &Chain{
		backendHead:        head,
		backendTail:        tail,
		backendNodeByStore: nodeByStore,
	}
}

// ReadBytesFull reads a full serialized object from one backend that has it.
func (chain *Chain) ReadBytesFull(id objectid.ObjectID) ([]byte, error) {
	for i, backend := 0, chain.firstBackend(); backend != nil; i, backend = i+1, chain.nextBackend(backend) {
		full, err := backend.ReadBytesFull(id)
		if err == nil {
			chain.touchBackend(backend)
			return full, nil
		}
		if errors.Is(err, objectstore.ErrObjectNotFound) {
			continue
		}
		return nil, fmt.Errorf("objectstore: backend %d read bytes full: %w", i, err)
	}
	return nil, objectstore.ErrObjectNotFound
}

// ReadBytesContent reads an object's type and content bytes from one backend
// that has it.
func (chain *Chain) ReadBytesContent(id objectid.ObjectID) (objecttype.Type, []byte, error) {
	for i, backend := 0, chain.firstBackend(); backend != nil; i, backend = i+1, chain.nextBackend(backend) {
		ty, content, err := backend.ReadBytesContent(id)
		if err == nil {
			chain.touchBackend(backend)
			return ty, content, nil
		}
		if errors.Is(err, objectstore.ErrObjectNotFound) {
			continue
		}
		return objecttype.TypeInvalid, nil, fmt.Errorf("objectstore: backend %d read bytes content: %w", i, err)
	}
	return objecttype.TypeInvalid, nil, objectstore.ErrObjectNotFound
}

// ReadReaderFull reads a full serialized object stream from one backend that
// has it.
func (chain *Chain) ReadReaderFull(id objectid.ObjectID) (io.ReadCloser, error) {
	for i, backend := 0, chain.firstBackend(); backend != nil; i, backend = i+1, chain.nextBackend(backend) {
		reader, err := backend.ReadReaderFull(id)
		if err == nil {
			chain.touchBackend(backend)
			return reader, nil
		}
		if errors.Is(err, objectstore.ErrObjectNotFound) {
			continue
		}
		return nil, fmt.Errorf("objectstore: backend %d read reader full: %w", i, err)
	}
	return nil, objectstore.ErrObjectNotFound
}

// ReadReaderContent reads an object's type, declared content length, and
// content stream from one backend that has it.
func (chain *Chain) ReadReaderContent(id objectid.ObjectID) (objecttype.Type, int64, io.ReadCloser, error) {
	for i, backend := 0, chain.firstBackend(); backend != nil; i, backend = i+1, chain.nextBackend(backend) {
		ty, size, reader, err := backend.ReadReaderContent(id)
		if err == nil {
			chain.touchBackend(backend)
			return ty, size, reader, nil
		}
		if errors.Is(err, objectstore.ErrObjectNotFound) {
			continue
		}
		return objecttype.TypeInvalid, 0, nil, fmt.Errorf("objectstore: backend %d read reader content: %w", i, err)
	}
	return objecttype.TypeInvalid, 0, nil, objectstore.ErrObjectNotFound
}

// ReadSize reads object content length from one backend that has it.
func (chain *Chain) ReadSize(id objectid.ObjectID) (int64, error) {
	for i, backend := 0, chain.firstBackend(); backend != nil; i, backend = i+1, chain.nextBackend(backend) {
		size, err := backend.ReadSize(id)
		if err == nil {
			chain.touchBackend(backend)
			return size, nil
		}
		if errors.Is(err, objectstore.ErrObjectNotFound) {
			continue
		}
		return 0, fmt.Errorf("objectstore: backend %d read size: %w", i, err)
	}
	return 0, objectstore.ErrObjectNotFound
}

// ReadHeader reads object header data from one backend that has it.
func (chain *Chain) ReadHeader(id objectid.ObjectID) (objecttype.Type, int64, error) {
	for i, backend := 0, chain.firstBackend(); backend != nil; i, backend = i+1, chain.nextBackend(backend) {
		ty, size, err := backend.ReadHeader(id)
		if err == nil {
			chain.touchBackend(backend)
			return ty, size, nil
		}
		if errors.Is(err, objectstore.ErrObjectNotFound) {
			continue
		}
		return objecttype.TypeInvalid, 0, fmt.Errorf("objectstore: backend %d read header: %w", i, err)
	}
	return objecttype.TypeInvalid, 0, objectstore.ErrObjectNotFound
}

// Close closes all backends and joins close errors.
func (chain *Chain) Close() error {
	chain.mu.RLock()
	backends := make([]objectstore.Store, 0, len(chain.backendNodeByStore))
	for node := chain.backendHead; node != nil; node = node.next {
		backends = append(backends, node.backend)
	}
	chain.mu.RUnlock()

	var errs []error
	for _, backend := range backends {
		if err := backend.Close(); err != nil {
			errs = append(errs, err)
		}
	}
	return errors.Join(errs...)
}

type backendNode struct {
	backend objectstore.Store
	prev    *backendNode
	next    *backendNode
}

func (chain *Chain) firstBackend() objectstore.Store {
	chain.mu.RLock()
	defer chain.mu.RUnlock()
	if chain.backendHead == nil {
		return nil
	}
	return chain.backendHead.backend
}

func (chain *Chain) nextBackend(current objectstore.Store) objectstore.Store {
	chain.mu.RLock()
	defer chain.mu.RUnlock()
	node := chain.backendNodeByStore[current]
	if node == nil || node.next == nil {
		return nil
	}
	return node.next.backend
}

func (chain *Chain) touchBackend(backend objectstore.Store) {
	if backend == nil {
		return
	}
	if !chain.mu.TryLock() {
		return
	}
	defer chain.mu.Unlock()

	node := chain.backendNodeByStore[backend]
	if node == nil || node == chain.backendHead {
		return
	}
	if node.prev != nil {
		node.prev.next = node.next
	}
	if node.next != nil {
		node.next.prev = node.prev
	}
	if chain.backendTail == node {
		chain.backendTail = node.prev
	}

	node.prev = nil
	node.next = chain.backendHead
	if chain.backendHead != nil {
		chain.backendHead.prev = node
	}
	chain.backendHead = node
	if chain.backendTail == nil {
		chain.backendTail = node
	}
}