-
Notifications
You must be signed in to change notification settings - Fork 265
/
rows_iter.go
412 lines (361 loc) · 7.27 KB
/
rows_iter.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
// Copyright 2023 Matrix Origin
//
// 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 logtailreplay
import (
"bytes"
"github.com/matrixorigin/matrixone/pkg/container/types"
"github.com/tidwall/btree"
)
type RowsIter interface {
Next() bool
Close() error
Entry() RowEntry
}
type rowsIter struct {
ts types.TS
iter btree.IterG[RowEntry]
firstCalled bool
lastRowID types.Rowid
checkBlockID bool
blockID types.Blockid
iterDeleted bool
}
func (p *PartitionState) NewRowsIter(ts types.TS, blockID *types.Blockid, iterDeleted bool) *rowsIter {
iter := p.rows.Copy().Iter()
ret := &rowsIter{
ts: ts,
iter: iter,
iterDeleted: iterDeleted,
}
if blockID != nil {
ret.checkBlockID = true
ret.blockID = *blockID
}
return ret
}
var _ RowsIter = new(rowsIter)
func (p *rowsIter) Next() bool {
for {
if !p.firstCalled {
if p.checkBlockID {
if !p.iter.Seek(RowEntry{
BlockID: p.blockID,
}) {
return false
}
} else {
if !p.iter.First() {
return false
}
}
p.firstCalled = true
} else {
if !p.iter.Next() {
return false
}
}
entry := p.iter.Item()
if p.checkBlockID && entry.BlockID != p.blockID {
// no more
return false
}
if entry.Time.Greater(&p.ts) {
// not visible
continue
}
if entry.RowID.Equal(p.lastRowID) {
// already met
continue
}
if entry.Deleted != p.iterDeleted {
// not wanted, skip to next row id
p.lastRowID = entry.RowID
continue
}
p.lastRowID = entry.RowID
return true
}
}
func (p *rowsIter) Entry() RowEntry {
return p.iter.Item()
}
func (p *rowsIter) Close() error {
p.iter.Release()
return nil
}
type primaryKeyIter struct {
ts types.TS
spec PrimaryKeyMatchSpec
iter btree.IterG[*PrimaryIndexEntry]
rows *btree.BTreeG[RowEntry]
primaryIndex *btree.BTreeG[*PrimaryIndexEntry]
curRow RowEntry
}
type PrimaryKeyMatchSpec struct {
// Move moves to the target
Move func(p *primaryKeyIter) bool
Name string
}
func Exact(key []byte) PrimaryKeyMatchSpec {
first := true
return PrimaryKeyMatchSpec{
Name: "Exact",
Move: func(p *primaryKeyIter) bool {
var ok bool
if first {
first = false
ok = p.iter.Seek(&PrimaryIndexEntry{
Bytes: key,
})
} else {
ok = p.iter.Next()
}
if !ok {
return false
}
item := p.iter.Item()
return bytes.Equal(item.Bytes, key)
},
}
}
func Prefix(prefix []byte) PrimaryKeyMatchSpec {
first := true
return PrimaryKeyMatchSpec{
Name: "Prefix",
Move: func(p *primaryKeyIter) bool {
var ok bool
if first {
first = false
ok = p.iter.Seek(&PrimaryIndexEntry{
Bytes: prefix,
})
} else {
ok = p.iter.Next()
}
if !ok {
return false
}
item := p.iter.Item()
return bytes.HasPrefix(item.Bytes, prefix)
},
}
}
func MinMax(min []byte, max []byte) PrimaryKeyMatchSpec {
return PrimaryKeyMatchSpec{}
}
type phase int
const (
scan phase = 0
seek phase = 1
judge phase = 2
)
func ExactIn(encodes [][]byte) PrimaryKeyMatchSpec {
var encoded []byte
first := true
iterateAll := false
idx := 0
vecLen := len(encodes)
currentPhase := seek
updateEncoded := func() bool {
if idx >= vecLen {
return false
}
encoded = encodes[idx]
idx++
return true
}
match := func(key []byte) bool {
return bytes.Equal(key, encoded)
}
return PrimaryKeyMatchSpec{
Name: "ExactIn",
Move: func(p *primaryKeyIter) bool {
if first {
first = false
// each seek may visit height items
// we choose to scan all if the seek is more expensive
if len(encodes)*p.primaryIndex.Height() > p.primaryIndex.Len() {
iterateAll = true
}
}
for {
switch currentPhase {
case judge:
if iterateAll {
if !updateEncoded() {
return false
}
currentPhase = scan
} else {
currentPhase = seek
}
case seek:
if !updateEncoded() {
// out of vec
return false
}
if !p.iter.Seek(&PrimaryIndexEntry{Bytes: encoded}) {
return false
}
if match(p.iter.Item().Bytes) {
currentPhase = scan
return true
}
case scan:
if !p.iter.Next() {
return false
}
if match(p.iter.Item().Bytes) {
return true
}
p.iter.Prev()
currentPhase = judge
}
}
},
}
}
func (p *PartitionState) NewPrimaryKeyIter(
ts types.TS,
spec PrimaryKeyMatchSpec,
) *primaryKeyIter {
index := p.primaryIndex.Copy()
return &primaryKeyIter{
ts: ts,
spec: spec,
iter: index.Iter(),
primaryIndex: index,
rows: p.rows.Copy(),
}
}
var _ RowsIter = new(primaryKeyIter)
func (p *primaryKeyIter) Next() bool {
for {
if !p.spec.Move(p) {
return false
}
entry := p.iter.Item()
// validate
valid := false
rowsIter := p.rows.Iter()
for ok := rowsIter.Seek(RowEntry{
BlockID: entry.BlockID,
RowID: entry.RowID,
Time: p.ts,
}); ok; ok = rowsIter.Next() {
row := rowsIter.Item()
if row.BlockID != entry.BlockID {
// no more
break
}
if row.RowID != entry.RowID {
// no more
break
}
if row.Time.Greater(&p.ts) {
// not visible
continue
}
if row.Deleted {
// visible and deleted, no longer valid
break
}
valid = row.ID == entry.RowEntryID
if valid {
p.curRow = row
}
break
}
rowsIter.Release()
if !valid {
continue
}
return true
}
}
func (p *primaryKeyIter) Entry() RowEntry {
return p.curRow
}
func (p *primaryKeyIter) Close() error {
p.iter.Release()
return nil
}
type primaryKeyDelIter struct {
primaryKeyIter
bid types.Blockid
}
func (p *PartitionState) NewPrimaryKeyDelIter(
ts types.TS,
spec PrimaryKeyMatchSpec,
bid types.Blockid,
) *primaryKeyDelIter {
iter := p.primaryIndex.Copy().Iter()
return &primaryKeyDelIter{
primaryKeyIter: primaryKeyIter{
ts: ts,
spec: spec,
iter: iter,
rows: p.rows.Copy(),
},
bid: bid,
}
}
var _ RowsIter = new(primaryKeyDelIter)
func (p *primaryKeyDelIter) Next() bool {
for {
if !p.spec.Move(&p.primaryKeyIter) {
return false
}
entry := p.iter.Item()
if entry.BlockID.Compare(p.bid) != 0 {
continue
}
// validate
valid := false
rowsIter := p.rows.Iter()
for ok := rowsIter.Seek(RowEntry{
BlockID: entry.BlockID,
RowID: entry.RowID,
Time: p.ts,
}); ok; ok = rowsIter.Next() {
row := rowsIter.Item()
if row.BlockID != entry.BlockID {
// no more
break
}
if row.RowID != entry.RowID {
// no more
break
}
if row.Time.Greater(&p.ts) {
// not visible
continue
}
if !row.Deleted {
// skip not deleted
continue
}
valid = row.ID == entry.RowEntryID
if valid {
p.curRow = row
}
break
}
rowsIter.Release()
if !valid {
continue
}
return true
}
}