This repository has been archived by the owner on Sep 23, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 85
/
txnum.go
234 lines (213 loc) · 5.25 KB
/
txnum.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
/*
Copyright 2021 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 rawdbv3
import (
"encoding/binary"
"fmt"
"sort"
"github.com/ledgerwatch/erigon-lib/kv"
)
type txNums struct{}
var TxNums txNums
// Min - returns maxTxNum in given block. If block not found - return last available value (`latest`/`pending` state)
func (txNums) Max(tx kv.Tx, blockNum uint64) (maxTxNum uint64, err error) {
var k [8]byte
binary.BigEndian.PutUint64(k[:], blockNum)
c, err := tx.Cursor(kv.MaxTxNum)
if err != nil {
return 0, err
}
defer c.Close()
_, v, err := c.SeekExact(k[:])
if err != nil {
return 0, err
}
if len(v) == 0 {
_, v, err = c.Last()
if err != nil {
return 0, err
}
if len(v) == 0 {
return 0, nil
}
}
return binary.BigEndian.Uint64(v), nil
}
// Min = `max(blockNum-1)+1` returns minTxNum in given block. If block not found - return last available value (`latest`/`pending` state)
func (txNums) Min(tx kv.Tx, blockNum uint64) (maxTxNum uint64, err error) {
if blockNum == 0 {
return 0, nil
}
var k [8]byte
binary.BigEndian.PutUint64(k[:], blockNum-1)
c, err := tx.Cursor(kv.MaxTxNum)
if err != nil {
return 0, err
}
defer c.Close()
_, v, err := c.SeekExact(k[:])
if err != nil {
return 0, err
}
if len(v) == 0 {
_, v, err = c.Last()
if err != nil {
return 0, err
}
if len(v) == 0 {
return 0, nil
}
}
return binary.BigEndian.Uint64(v) + 1, nil
}
func (txNums) Append(tx kv.RwTx, blockNum, maxTxNum uint64) (err error) {
lastK, err := LastKey(tx, kv.MaxTxNum)
if err != nil {
return err
}
if len(lastK) != 0 {
lastBlockNum := binary.BigEndian.Uint64(lastK)
if lastBlockNum > 1 && lastBlockNum+1 != blockNum { //allow genesis
return fmt.Errorf("append with gap blockNum=%d, but current heigh=%d", blockNum, lastBlockNum)
}
}
var k, v [8]byte
binary.BigEndian.PutUint64(k[:], blockNum)
binary.BigEndian.PutUint64(v[:], maxTxNum)
if err := tx.Append(kv.MaxTxNum, k[:], v[:]); err != nil {
return err
}
return nil
}
func (txNums) WriteForGenesis(tx kv.RwTx, maxTxNum uint64) (err error) {
var k, v [8]byte
binary.BigEndian.PutUint64(k[:], 0)
binary.BigEndian.PutUint64(v[:], maxTxNum)
return tx.Put(kv.MaxTxNum, k[:], v[:])
}
func (txNums) Truncate(tx kv.RwTx, blockNum uint64) (err error) {
var seek [8]byte
binary.BigEndian.PutUint64(seek[:], blockNum)
c, err := tx.RwCursor(kv.MaxTxNum)
if err != nil {
return err
}
defer c.Close()
for k, _, err := c.Seek(seek[:]); k != nil; k, _, err = c.Next() {
if err != nil {
return err
}
if err = c.DeleteCurrent(); err != nil {
return err
}
}
return nil
}
func (txNums) FindBlockNum(tx kv.Tx, endTxNumMinimax uint64) (ok bool, blockNum uint64, err error) {
var seek [8]byte
c, err := tx.Cursor(kv.MaxTxNum)
if err != nil {
return false, 0, err
}
defer c.Close()
cnt, err := c.Count()
if err != nil {
return false, 0, err
}
blockNum = uint64(sort.Search(int(cnt), func(i int) bool {
binary.BigEndian.PutUint64(seek[:], uint64(i))
var v []byte
_, v, err = c.SeekExact(seek[:])
return binary.BigEndian.Uint64(v) >= endTxNumMinimax
}))
if err != nil {
return false, 0, err
}
if blockNum == cnt {
return false, 0, nil
}
return true, blockNum, nil
}
func (txNums) Last(tx kv.Tx) (blockNum, txNum uint64, err error) {
c, err := tx.Cursor(kv.MaxTxNum)
if err != nil {
return 0, 0, err
}
defer c.Close()
lastK, lastV, err := c.Last()
if err != nil {
return 0, 0, err
}
if lastK == nil || lastV == nil {
return 0, 0, nil
}
return binary.BigEndian.Uint64(lastK), binary.BigEndian.Uint64(lastV), nil
}
func (txNums) First(tx kv.Tx) (blockNum, txNum uint64, err error) {
c, err := tx.Cursor(kv.MaxTxNum)
if err != nil {
return 0, 0, err
}
defer c.Close()
lastK, lastV, err := c.First()
if err != nil {
return 0, 0, err
}
if lastK == nil || lastV == nil {
return 0, 0, nil
}
return binary.BigEndian.Uint64(lastK), binary.BigEndian.Uint64(lastV), nil
}
// LastKey
func LastKey(tx kv.Tx, table string) ([]byte, error) {
c, err := tx.Cursor(table)
if err != nil {
return nil, err
}
defer c.Close()
k, _, err := c.Last()
if err != nil {
return nil, err
}
return k, nil
}
// Last - candidate on move to kv.Tx interface
func Last(tx kv.Tx, table string) ([]byte, []byte, error) {
c, err := tx.Cursor(table)
if err != nil {
return nil, nil, err
}
defer c.Close()
k, v, err := c.Last()
if err != nil {
return nil, nil, err
}
return k, v, nil
}
// SecondKey - useful if table always has zero-key (for example genesis block)
func SecondKey(tx kv.Tx, table string) ([]byte, error) {
c, err := tx.Cursor(table)
if err != nil {
return nil, err
}
defer c.Close()
_, _, err = c.First()
if err != nil {
return nil, err
}
k, _, err := c.Next()
if err != nil {
return nil, err
}
return k, nil
}