/
db.go
228 lines (192 loc) · 5.41 KB
/
db.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
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
// Copyright 2022 IOTA Stiftung
// SPDX-License-Identifier: Apache-2.0
package state
import (
"errors"
"fmt"
"io"
"github.com/iotaledger/hive.go/kvstore"
"github.com/iotaledger/wasp/packages/chaindb"
"github.com/iotaledger/wasp/packages/kv/buffered"
"github.com/iotaledger/wasp/packages/kv/codec"
"github.com/iotaledger/wasp/packages/trie"
"github.com/iotaledger/wasp/packages/util/rwutil"
)
var (
ErrTrieRootNotFound = errors.New("trie root not found")
ErrUnknownLatestTrieRoot = errors.New("latest trie root is unknown")
ErrNoBlocksPruned = errors.New("no blocks were pruned from the store yet")
)
func keyBlockByTrieRootNoTrieRoot() []byte {
return []byte{chaindb.PrefixBlockByTrieRoot}
}
func keyBlockByTrieRoot(root trie.Hash) []byte {
return append(keyBlockByTrieRootNoTrieRoot(), root.Bytes()...)
}
func keyLatestTrieRoot() []byte {
return []byte{chaindb.PrefixLatestTrieRoot}
}
func keyLargestPrunedBlockIndex() []byte {
return []byte{chaindb.PrefixLargestPrunedBlockIndex}
}
func mustNoErr(err error) {
if err != nil {
panic(err)
}
}
// storeDB encapsulates all data that is stored on the store's DB.
// The DB includes:
// - The trie storage, under the prefixTrie partition. This includes one trie root for each state index.
// - One block per trie root, under the prefixBlockByTrieRoot partition.
// - The trie root that is considered 'latest' in the chain, under prefixLatestTrieRoot
type storeDB struct {
kvstore.KVStore
}
func (db *storeDB) latestTrieRoot() (trie.Hash, error) {
if !db.hasLatestTrieRoot() {
return trie.Hash{}, ErrUnknownLatestTrieRoot
}
b := db.mustGet(keyLatestTrieRoot())
ret, err := trie.HashFromBytes(b)
mustNoErr(err)
return ret, nil
}
func (db *storeDB) hasLatestTrieRoot() bool {
return db.mustHas(keyLatestTrieRoot())
}
func (db *storeDB) setLatestTrieRoot(root trie.Hash) {
db.mustSet(keyLatestTrieRoot(), root.Bytes())
}
func (db *storeDB) largestPrunedBlockIndex() (uint32, error) {
if !db.hasLargestPrunedBlockIndex() {
return 0, ErrNoBlocksPruned
}
b := db.mustGet(keyLargestPrunedBlockIndex())
ret := codec.MustDecodeUint32(b)
return ret, nil
}
func (db *storeDB) hasLargestPrunedBlockIndex() bool {
return db.mustHas(keyLargestPrunedBlockIndex())
}
func (db *storeDB) setLargestPrunedBlockIndex(blockIndex uint32) {
db.mustSet(keyLargestPrunedBlockIndex(), codec.EncodeUint32(blockIndex))
}
func (db *storeDB) isEmpty() bool {
empty := true
err := db.Iterate(keyBlockByTrieRootNoTrieRoot(), func(kvstore.Key, kvstore.Value) bool {
empty = false
return false
})
mustNoErr(err)
return empty
}
func trieStore(db kvstore.KVStore) trie.KVStore {
return trie.NewHiveKVStoreAdapter(db, []byte{chaindb.PrefixTrie})
}
func (db *storeDB) trieUpdatable(root trie.Hash) (*trie.TrieUpdatable, error) {
return trie.NewTrieUpdatable(trieStore(db), root)
}
func (db *storeDB) initTrie() trie.Hash {
return trie.MustInitRoot(trieStore(db))
}
func (db *storeDB) trieReader(root trie.Hash) (*trie.TrieReader, error) {
return trieReader(trieStore(db), root)
}
func trieReader(trieStore trie.KVStore, root trie.Hash) (*trie.TrieReader, error) {
return trie.NewTrieReader(trieStore, root)
}
func (db *storeDB) hasBlock(root trie.Hash) bool {
return db.mustHas(keyBlockByTrieRoot(root))
}
func (db *storeDB) saveBlock(block Block) {
db.mustSet(keyBlockByTrieRoot(block.TrieRoot()), block.Bytes())
}
func (db *storeDB) pruneBlock(trieRoot trie.Hash) {
db.mustDel(keyBlockByTrieRoot(trieRoot))
}
func (db *storeDB) readBlock(root trie.Hash) (Block, error) {
key := keyBlockByTrieRoot(root)
if !db.mustHas(key) {
return nil, fmt.Errorf("%w %s", ErrTrieRootNotFound, root)
}
return BlockFromBytes(db.mustGet(key))
}
func (db *storeDB) commitToDB(muts *buffered.Mutations) {
batch, err := db.Batched()
mustNoErr(err)
for k, v := range muts.Sets {
err = batch.Set([]byte(k), v)
mustNoErr(err)
}
for k := range muts.Dels {
err = batch.Delete([]byte(k))
mustNoErr(err)
}
err = batch.Commit()
mustNoErr(err)
}
func (db *storeDB) mustSet(key []byte, value []byte) {
err := db.Set(key, value)
mustNoErr(err)
}
func (db *storeDB) mustDel(key []byte) {
err := db.Delete(key)
mustNoErr(err)
}
func (db *storeDB) mustHas(key []byte) bool {
has, err := db.Has(key)
mustNoErr(err)
return has
}
func (db *storeDB) mustGet(key []byte) []byte {
v, err := db.Get(key)
mustNoErr(err)
return v
}
func (db *storeDB) buffered() (*bufferedKVStore, *storeDB) {
buf := newBufferedKVStore(db)
return buf, &storeDB{buf}
}
// increment when changing the snapshot format
const snapshotVersion = 0
func (db *storeDB) takeSnapshot(root trie.Hash, w io.Writer) error {
block, err := db.readBlock(root)
if err != nil {
return err
}
ww := rwutil.NewWriter(w)
ww.WriteUint8(snapshotVersion)
ww.WriteBytes(block.Bytes())
if ww.Err != nil {
return ww.Err
}
trie, err := db.trieReader(block.TrieRoot())
if err != nil {
return err
}
return trie.TakeSnapshot(w)
}
func (db *storeDB) restoreSnapshot(root trie.Hash, r io.Reader) error {
rr := rwutil.NewReader(r)
v := rr.ReadUint8()
if v != snapshotVersion {
return errors.New("snapshot version mismatch")
}
blockBytes := rr.ReadBytes()
if rr.Err != nil {
return rr.Err
}
block, err := BlockFromBytes(blockBytes)
if err != nil {
return err
}
if block.TrieRoot() != root {
return errors.New("trie root mismatch")
}
db.saveBlock(block)
err = trie.RestoreSnapshot(r, trieStore(db))
if err != nil {
return err
}
return nil
}