-
Notifications
You must be signed in to change notification settings - Fork 0
/
kv_interface.go
487 lines (416 loc) · 20.6 KB
/
kv_interface.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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
/*
Copyright 2022 Erigon contributors
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 kv
import (
"context"
"errors"
"unsafe"
"github.com/uncommoncorrelation/go-mdbx-db/kv/iter"
"github.com/uncommoncorrelation/go-mdbx-db/kv/order"
"github.com/uncommoncorrelation/go-mdbx-db/metrics"
)
//Variables Naming:
// tx - Database Transaction
// txn - Ethereum Transaction (and TxNum - is also number of Etherum Transaction)
// blockNum - Ethereum block number - same across all nodes. blockID - auto-increment ID - which can be differrent across all nodes
// txNum/txID - same
// RoTx - Read-Only Database Transaction. RwTx - read-write
// k, v - key, value
// ts - TimeStamp. Usually it's Etherum's TransactionNumber (auto-increment ID). Or BlockNumber.
// Cursor - low-level mdbx-tide api to navigate over Table
// Iter - high-level iterator-like api over Table/InvertedIndex/History/Domain. Has less features than Cursor. See package `iter`.
//Methods Naming:
// Prune: delete old data
// Unwind: delete recent data
// Get: exact match of criterias
// Range: [from, to). from=nil means StartOfTable, to=nil means EndOfTable, rangeLimit=-1 means Unlimited
// Range is analog of SQL's: SELECT * FROM Table WHERE k>=from AND k<to ORDER BY k ASC/DESC LIMIT n
// Prefix: `Range(Table, prefix, kv.NextSubtree(prefix))`
//Abstraction Layers:
// LowLevel:
// 1. DB/Tx - low-level key-value database
// 2. Snapshots/FrozenData - immutable files with historical data. May be downloaded at first App
// start or auto-generate by moving old data from DB to Snapshots.
// Most important difference between DB and Snapshots: creation of
// snapshot files (build/merge) doesn't mutate any existing files - only producing new one!
// It means we don't need concept of "RwTx" for Snapshots.
// Files can become useless/garbage (merged to bigger file) - last reader of this file will
// remove it from FileSystem on tx.Rollback().
// Invariant: existing readers can't see new files, new readers can't see garbage files
//
// MediumLevel:
// 1. TemporalDB - abstracting DB+Snapshots. Target is:
// - provide 'time-travel' API for data: consistan snapshot of data as of given Timestamp.
// - auto-close iterators on Commit/Rollback
// - auto-open/close agg.MakeContext() on Begin/Commit/Rollback
// - to keep DB small - only for Hot/Recent data (can be update/delete by re-org).
// - And TemporalRoTx/TemporalRwTx actaully open Read-Only files view (MakeContext) - no concept of "Read-Write view of snapshot files".
// - using next entities:
// - InvertedIndex: supports range-scans
// - History: can return value of key K as of given TimeStamp. Doesn't know about latest/current
// value of key K. Returns NIL if K not changed after TimeStamp.
// - Domain: as History but also aware about latest/current value of key K. Can move
// cold (updated long time ago) parts of state from db to snapshots.
// HighLevel:
// 1. Application - rely on TemporalDB (Ex: ExecutionLayer) or just DB (Ex: TxPool, Sentry, Downloader).
const ReadersLimit = 32000 // MDBX_READERS_LIMIT=32767
// const Unbounded []byte = nil
const Unlim int = -1
var (
// TODO(AD): Remove chaindata specific
ErrAttemptToDeleteNonDeprecatedBucket = errors.New("only buckets from dbutils.ChaindataDeprecatedTables can be deleted")
DbSize = metrics.GetOrCreateGauge(`db_size`) //nolint
TxLimit = metrics.GetOrCreateGauge(`tx_limit`) //nolint
TxSpill = metrics.GetOrCreateGauge(`tx_spill`) //nolint
TxUnspill = metrics.GetOrCreateGauge(`tx_unspill`) //nolint
TxDirty = metrics.GetOrCreateGauge(`tx_dirty`) //nolint
DbCommitPreparation = metrics.GetOrCreateSummary(`db_commit_seconds{phase="preparation"}`) //nolint
//DbGCWallClock = metrics.GetOrCreateSummary(`db_commit_seconds{phase="gc_wall_clock"}`) //nolint
//DbGCCpuTime = metrics.GetOrCreateSummary(`db_commit_seconds{phase="gc_cpu_time"}`) //nolint
//DbCommitAudit = metrics.GetOrCreateSummary(`db_commit_seconds{phase="audit"}`) //nolint
DbCommitWrite = metrics.GetOrCreateSummary(`db_commit_seconds{phase="write"}`) //nolint
DbCommitSync = metrics.GetOrCreateSummary(`db_commit_seconds{phase="sync"}`) //nolint
DbCommitEnding = metrics.GetOrCreateSummary(`db_commit_seconds{phase="ending"}`) //nolint
DbCommitTotal = metrics.GetOrCreateSummary(`db_commit_seconds{phase="total"}`) //nolint
DbPgopsNewly = metrics.GetOrCreateGauge(`db_pgops{phase="newly"}`) //nolint
DbPgopsCow = metrics.GetOrCreateGauge(`db_pgops{phase="cow"}`) //nolint
DbPgopsClone = metrics.GetOrCreateGauge(`db_pgops{phase="clone"}`) //nolint
DbPgopsSplit = metrics.GetOrCreateGauge(`db_pgops{phase="split"}`) //nolint
DbPgopsMerge = metrics.GetOrCreateGauge(`db_pgops{phase="merge"}`) //nolint
DbPgopsSpill = metrics.GetOrCreateGauge(`db_pgops{phase="spill"}`) //nolint
DbPgopsUnspill = metrics.GetOrCreateGauge(`db_pgops{phase="unspill"}`) //nolint
DbPgopsWops = metrics.GetOrCreateGauge(`db_pgops{phase="wops"}`) //nolint
/*
DbPgopsPrefault = metrics.NewCounter(`db_pgops{phase="prefault"}`) //nolint
DbPgopsMinicore = metrics.NewCounter(`db_pgops{phase="minicore"}`) //nolint
DbPgopsMsync = metrics.NewCounter(`db_pgops{phase="msync"}`) //nolint
DbPgopsFsync = metrics.NewCounter(`db_pgops{phase="fsync"}`) //nolint
DbMiLastPgNo = metrics.NewCounter(`db_mi_last_pgno`) //nolint
DbGcWorkRtime = metrics.GetOrCreateSummary(`db_gc_seconds{phase="work_rtime"}`) //nolint
DbGcWorkRsteps = metrics.NewCounter(`db_gc{phase="work_rsteps"}`) //nolint
DbGcWorkRxpages = metrics.NewCounter(`db_gc{phase="work_rxpages"}`) //nolint
DbGcSelfRtime = metrics.GetOrCreateSummary(`db_gc_seconds{phase="self_rtime"}`) //nolint
DbGcSelfXtime = metrics.GetOrCreateSummary(`db_gc_seconds{phase="self_xtime"}`) //nolint
DbGcWorkXtime = metrics.GetOrCreateSummary(`db_gc_seconds{phase="work_xtime"}`) //nolint
DbGcSelfRsteps = metrics.NewCounter(`db_gc{phase="self_rsteps"}`) //nolint
DbGcWloops = metrics.NewCounter(`db_gc{phase="wloop"}`) //nolint
DbGcCoalescences = metrics.NewCounter(`db_gc{phase="coalescences"}`) //nolint
DbGcWipes = metrics.NewCounter(`db_gc{phase="wipes"}`) //nolint
DbGcFlushes = metrics.NewCounter(`db_gc{phase="flushes"}`) //nolint
DbGcKicks = metrics.NewCounter(`db_gc{phase="kicks"}`) //nolint
DbGcWorkMajflt = metrics.NewCounter(`db_gc{phase="work_majflt"}`) //nolint
DbGcSelfMajflt = metrics.NewCounter(`db_gc{phase="self_majflt"}`) //nolint
DbGcWorkCounter = metrics.NewCounter(`db_gc{phase="work_counter"}`) //nolint
DbGcSelfCounter = metrics.NewCounter(`db_gc{phase="self_counter"}`) //nolint
DbGcSelfXpages = metrics.NewCounter(`db_gc{phase="self_xpages"}`) //nolint
*/
//DbGcWorkPnlMergeTime = metrics.GetOrCreateSummary(`db_gc_pnl_seconds{phase="work_merge_time"}`) //nolint
//DbGcWorkPnlMergeVolume = metrics.NewCounter(`db_gc_pnl{phase="work_merge_volume"}`) //nolint
//DbGcWorkPnlMergeCalls = metrics.NewCounter(`db_gc{phase="work_merge_calls"}`) //nolint
//DbGcSelfPnlMergeTime = metrics.GetOrCreateSummary(`db_gc_pnl_seconds{phase="slef_merge_time"}`) //nolint
//DbGcSelfPnlMergeVolume = metrics.NewCounter(`db_gc_pnl{phase="self_merge_volume"}`) //nolint
//DbGcSelfPnlMergeCalls = metrics.NewCounter(`db_gc_pnl{phase="slef_merge_calls"}`) //nolint
GcLeafMetric = metrics.GetOrCreateGauge(`db_gc_leaf`) //nolint
GcOverflowMetric = metrics.GetOrCreateGauge(`db_gc_overflow`) //nolint
GcPagesMetric = metrics.GetOrCreateGauge(`db_gc_pages`) //nolint
)
type DBVerbosityLvl int8
type Label string
const (
InMem Label = "inMem"
)
type Has interface {
// Has indicates whether a key exists in the database.
Has(table string, key []byte) (bool, error)
}
type GetPut interface {
Getter
Putter
}
type Getter interface {
Has
// GetOne references a readonly section of memory that must not be accessed after txn has terminated
GetOne(table string, key []byte) (val []byte, err error)
// ForEach iterates over entries with keys greater or equal to fromPrefix.
// walker is called for each eligible entry.
// If walker returns an error:
// - implementations of local db - stop
// - implementations of remote db - do not handle this error and may finish (send all entries to client) before error happen.
ForEach(table string, fromPrefix []byte, walker func(k, v []byte) error) error
ForPrefix(table string, prefix []byte, walker func(k, v []byte) error) error
ForAmount(table string, prefix []byte, amount uint32, walker func(k, v []byte) error) error
}
// Putter wraps the database write operations.
type Putter interface {
// Put inserts or updates a single entry.
Put(table string, k, v []byte) error
}
// Deleter wraps the database delete operations.
type Deleter interface {
// Delete removes a single entry.
Delete(table string, k []byte) error
}
type Closer interface {
Close()
}
// RoDB - Read-only version of KV.
type RoDB interface {
Closer
ReadOnly() bool
View(ctx context.Context, f func(tx Tx) error) error
// BeginRo - creates transaction
// tx may be discarded by .Rollback() method
//
// A transaction and its cursors must only be used by a single
// thread (not goroutine), and a thread may only have a single transaction at a time.
// It happen automatically by - because this method calls runtime.LockOSThread() inside (Rollback/Commit releases it)
// By this reason application code can't call runtime.UnlockOSThread() - it leads to undefined behavior.
//
// If this `parent` is non-NULL, the new transaction
// will be a nested transaction, with the transaction indicated by parent
// as its parent. Transactions may be nested to any level. A parent
// transaction and its cursors may not issue any other operations than
// Commit and Rollback while it has active child transactions.
BeginRo(ctx context.Context) (Tx, error)
AllTables() TableCfg
PageSize() uint64
// Pointer to the underlying C environment handle, if applicable (e.g. *C.MDBX_env)
CHandle() unsafe.Pointer
}
// RwDB low-level database interface - main target is - to provide common abstraction over top of MDBX and RemoteKV.
//
// Common pattern for short-living transactions:
//
// if err := db.View(ctx, func(tx ethdb.Tx) error {
// ... code which uses database in transaction
// }); err != nil {
// return err
// }
//
// Common pattern for long-living transactions:
//
// tx, err := db.Begin()
// if err != nil {
// return err
// }
// defer tx.Rollback()
//
// ... code which uses database in transaction
//
// err := tx.Commit()
// if err != nil {
// return err
// }
type RwDB interface {
RoDB
Update(ctx context.Context, f func(tx RwTx) error) error
UpdateNosync(ctx context.Context, f func(tx RwTx) error) error
BeginRw(ctx context.Context) (RwTx, error)
BeginRwNosync(ctx context.Context) (RwTx, error)
}
type StatelessReadTx interface {
Getter
Commit() error // Commit all the operations of a transaction into the database.
Rollback() // Rollback - abandon all the operations of the transaction instead of saving them.
// ReadSequence - allows to create a linear sequence of unique positive integers for each table.
// Can be called for a read transaction to retrieve the current sequence value, and the increment must be zero.
// Sequence changes become visible outside the current write transaction after it is committed, and discarded on abort.
// Starts from 0.
ReadSequence(table string) (uint64, error)
}
type StatelessWriteTx interface {
Putter
Deleter
/*
// if need N id's:
baseId, err := tx.IncrementSequence(bucket, N)
if err != nil {
return err
}
for i := 0; i < N; i++ { // if N == 0, it will work as expected
id := baseId + i
// use id
}
// or if need only 1 id:
id, err := tx.IncrementSequence(bucket, 1)
if err != nil {
return err
}
// use id
*/
IncrementSequence(table string, amount uint64) (uint64, error)
Append(table string, k, v []byte) error
AppendDup(table string, k, v []byte) error
}
type StatelessRwTx interface {
StatelessReadTx
StatelessWriteTx
}
// PendingMutations in-memory storage of changes
// Later they can either be flushed to the database or abandon
type PendingMutations interface {
StatelessRwTx
// Flush all in-memory data into `tx`
Flush(ctx context.Context, tx RwTx) error
Close()
BatchSize() int
}
// Tx
// WARNING:
// - Tx is not threadsafe and may only be used in the goroutine that created it
// - ReadOnly transactions do not lock goroutine to thread, RwTx does
type Tx interface {
StatelessReadTx
BucketMigratorRO
// ID returns the identifier associated with this transaction. For a
// read-only transaction, this corresponds to the snapshot being read;
// concurrent readers will frequently have the same transaction ID.
ViewID() uint64
// Cursor - creates cursor object on top of given bucket. Type of cursor - depends on bucket configuration.
// If bucket was created with mdbx.DupSort flag, then cursor with interface CursorDupSort created
// Otherwise - object of interface Cursor created
//
// Cursor, also provides a grain of magic - it can use a declarative configuration - and automatically break
// long keys into DupSort key/values. See docs for `bucket.go:TableCfgItem`
Cursor(table string) (Cursor, error)
CursorDupSort(table string) (CursorDupSort, error) // CursorDupSort - can be used if bucket has mdbx.DupSort flag
DBSize() (uint64, error)
// --- High-Level methods: 1request -> stream of server-side pushes ---
// Range [from, to)
// Range(from, nil) means [from, EndOfTable)
// Range(nil, to) means [StartOfTable, to)
Range(table string, fromPrefix, toPrefix []byte) (iter.KV, error)
// Stream is like Range, but for requesting huge data (Example: full table scan). Client can't stop it.
//Stream(table string, fromPrefix, toPrefix []byte) (iter.KV, error)
// RangeAscend - like Range [from, to) but also allow pass Limit parameters
// Limit -1 means Unlimited
RangeAscend(table string, fromPrefix, toPrefix []byte, limit int) (iter.KV, error)
//StreamAscend(table string, fromPrefix, toPrefix []byte, limit int) (iter.KV, error)
// RangeDescend - is like Range [from, to), but expecing `from`<`to`
// example: RangeDescend("Table", "B", "A", -1)
RangeDescend(table string, fromPrefix, toPrefix []byte, limit int) (iter.KV, error)
//StreamDescend(table string, fromPrefix, toPrefix []byte, limit int) (iter.KV, error)
// Prefix - is exactly Range(Table, prefix, kv.NextSubtree(prefix))
Prefix(table string, prefix []byte) (iter.KV, error)
// RangeDupSort - like Range but for fixed single key and iterating over range of values
RangeDupSort(table string, key []byte, fromPrefix, toPrefix []byte, asc order.By, limit int) (iter.KV, error)
// --- High-Level methods: 1request -> 1page of values in response -> send next page request ---
// Paginate(table string, fromPrefix, toPrefix []byte) (PairsStream, error)
// --- High-Level deprecated methods ---
ForEach(table string, fromPrefix []byte, walker func(k, v []byte) error) error
ForPrefix(table string, prefix []byte, walker func(k, v []byte) error) error
ForAmount(table string, prefix []byte, amount uint32, walker func(k, v []byte) error) error
// Pointer to the underlying C transaction handle (e.g. *C.MDBX_txn)
CHandle() unsafe.Pointer
BucketSize(table string) (uint64, error)
}
// RwTx
//
// WARNING:
// - RwTx is not threadsafe and may only be used in the goroutine that created it.
// - ReadOnly transactions do not lock goroutine to thread, RwTx does
// - User Can't call runtime.LockOSThread/runtime.UnlockOSThread in same goroutine until RwTx Commit/Rollback
type RwTx interface {
Tx
StatelessWriteTx
BucketMigrator
RwCursor(table string) (RwCursor, error)
RwCursorDupSort(table string) (RwCursorDupSort, error)
// CollectMetrics - does collect all DB-related and Tx-related metrics
// this method exists only in RwTx to avoid concurrency
CollectMetrics()
}
type BucketMigratorRO interface {
ListBuckets() ([]string, error)
}
// BucketMigrator used for buckets migration, don't use it in usual app code
type BucketMigrator interface {
BucketMigratorRO
DropBucket(string) error
CreateBucket(string) error
ExistsBucket(string) (bool, error)
ClearBucket(string) error
}
// Cursor - class for navigating through a database
// CursorDupSort are inherit this class
//
// If methods (like First/Next/Seek) return error, then returned key SHOULD not be nil (can be []byte{} for example).
// Then looping code will look as:
// c := kv.Cursor(bucketName)
//
// for k, v, err := c.First(); k != nil; k, v, err = c.Next() {
// if err != nil {
// return err
// }
// ... logic
// }
type Cursor interface {
First() ([]byte, []byte, error) // First - position at first key/data item
Seek(seek []byte) ([]byte, []byte, error) // Seek - position at first key greater than or equal to specified key
SeekExact(key []byte) ([]byte, []byte, error) // SeekExact - position at exact matching key if exists
Next() ([]byte, []byte, error) // Next - position at next key/value (can iterate over DupSort key/values automatically)
Prev() ([]byte, []byte, error) // Prev - position at previous key
Last() ([]byte, []byte, error) // Last - position at last key and last possible value
Current() ([]byte, []byte, error) // Current - return key/data at current cursor position
Count() (uint64, error) // Count - fast way to calculate amount of keys in bucket. It counts all keys even if Prefix was set.
Close()
}
type RwCursor interface {
Cursor
Put(k, v []byte) error // Put - based on order
Append(k []byte, v []byte) error // Append - append the given key/data pair to the end of the database. This option allows fast bulk loading when keys are already known to be in the correct order.
Delete(k []byte) error // Delete - short version of SeekExact+DeleteCurrent or SeekBothExact+DeleteCurrent
// DeleteCurrent This function deletes the key/data pair to which the cursor refers.
// This does not invalidate the cursor, so operations such as MDB_NEXT
// can still be used on it.
// Both MDB_NEXT and MDB_GET_CURRENT will return the same record after
// this operation.
DeleteCurrent() error
}
// CursorDupSort
//
// Example:
//
// for k, v, err = cursor.First(); k != nil; k, v, err = cursor.NextNoDup() {
// if err != nil {
// return err
// }
// for ; v != nil; _, v, err = cursor.NextDup() {
// if err != nil {
// return err
// }
//
// }
// }
type CursorDupSort interface {
Cursor
// SeekBothExact -
// second parameter can be nil only if searched key has no duplicates, or return error
SeekBothExact(key, value []byte) ([]byte, []byte, error)
SeekBothRange(key, value []byte) ([]byte, error) // SeekBothRange - exact match of the key, but range match of the value
FirstDup() ([]byte, error) // FirstDup - position at first data item of current key
NextDup() ([]byte, []byte, error) // NextDup - position at next data item of current key
NextNoDup() ([]byte, []byte, error) // NextNoDup - position at first data item of next key
PrevDup() ([]byte, []byte, error)
PrevNoDup() ([]byte, []byte, error)
LastDup() ([]byte, error) // LastDup - position at last data item of current key
CountDuplicates() (uint64, error) // CountDuplicates - number of duplicates for the current key
}
type RwCursorDupSort interface {
CursorDupSort
RwCursor
PutNoDupData(key, value []byte) error // PutNoDupData - inserts key without dupsort
DeleteCurrentDuplicates() error // DeleteCurrentDuplicates - deletes all of the data items for the current key
DeleteExact(k1, k2 []byte) error // DeleteExact - delete 1 value from given key
AppendDup(key, value []byte) error // AppendDup - same as Append, but for sorted dup data
}