-
Notifications
You must be signed in to change notification settings - Fork 270
/
utils.go
191 lines (180 loc) · 5.16 KB
/
utils.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
// Copyright 2021 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 tables
import (
"context"
"github.com/matrixorigin/matrixone/pkg/common/mpool"
"github.com/matrixorigin/matrixone/pkg/container/types"
"github.com/matrixorigin/matrixone/pkg/fileservice"
"github.com/matrixorigin/matrixone/pkg/vm/engine/tae/db/dbutils"
"github.com/matrixorigin/matrixone/pkg/vm/engine/tae/index/indexwrapper"
"github.com/matrixorigin/matrixone/pkg/vm/engine/tae/model"
"github.com/matrixorigin/matrixone/pkg/objectio"
"github.com/matrixorigin/matrixone/pkg/vm/engine/tae/blockio"
"github.com/matrixorigin/matrixone/pkg/vm/engine/tae/catalog"
"github.com/matrixorigin/matrixone/pkg/vm/engine/tae/common"
"github.com/matrixorigin/matrixone/pkg/vm/engine/tae/containers"
)
func LoadPersistedColumnData(
ctx context.Context,
rt *dbutils.Runtime,
id *common.ID,
def *catalog.ColDef,
location objectio.Location,
mp *mpool.MPool,
) (vec containers.Vector, err error) {
if def.IsPhyAddr() {
return model.PreparePhyAddrData(&id.BlockID, 0, location.Rows(), rt.VectorPool.Transient)
}
//Extend lifetime of vectors is without the function.
//need to copy. closeFunc will be nil.
vectors, _, err := blockio.LoadColumns2(
ctx, []uint16{uint16(def.SeqNum)},
[]types.Type{def.Type},
rt.Fs.Service,
location,
fileservice.Policy(0),
true,
rt.VectorPool.Transient)
if err != nil {
return
}
return vectors[0], nil
}
func LoadPersistedColumnDatas(
ctx context.Context,
schema *catalog.Schema,
rt *dbutils.Runtime,
id *common.ID,
colIdxs []int,
location objectio.Location,
mp *mpool.MPool,
) ([]containers.Vector, error) {
cols := make([]uint16, 0)
typs := make([]types.Type, 0)
vectors := make([]containers.Vector, len(colIdxs))
phyAddIdx := -1
for i, colIdx := range colIdxs {
def := schema.ColDefs[colIdx]
if def.IsPhyAddr() {
vec, err := model.PreparePhyAddrData(&id.BlockID, 0, location.Rows(), rt.VectorPool.Transient)
if err != nil {
return nil, err
}
phyAddIdx = i
vectors[phyAddIdx] = vec
continue
}
cols = append(cols, def.SeqNum)
typs = append(typs, def.Type)
}
if len(cols) == 0 {
return vectors, nil
}
//Extend lifetime of vectors is without the function.
//need to copy. closeFunc will be nil.
vecs, _, err := blockio.LoadColumns2(
ctx, cols,
typs,
rt.Fs.Service,
location,
fileservice.Policy(0),
true,
rt.VectorPool.Transient)
if err != nil {
return nil, err
}
for i, vec := range vecs {
idx := i
if idx >= phyAddIdx && phyAddIdx > -1 {
idx++
}
vectors[idx] = vec
}
return vectors, nil
}
func ReadPersistedBlockRow(location objectio.Location) int {
return int(location.Rows())
}
func LoadPersistedDeletes(
ctx context.Context,
pkName string,
fs *objectio.ObjectFS,
location objectio.Location,
mp *mpool.MPool,
) (bat *containers.Batch, isPersistedByCN bool, release func(), err error) {
if isPersistedByCN, err = blockio.IsPersistedByCN(ctx, location, fs.Service); err != nil {
return
}
bat, release, err = LoadPersistedDeletesBySchema(ctx, pkName, fs, location, isPersistedByCN, mp)
return
}
func LoadPersistedDeletesBySchema(
ctx context.Context,
pkName string,
fs *objectio.ObjectFS,
location objectio.Location,
isPersistedByCN bool,
mp *mpool.MPool,
) (bat *containers.Batch, release func(), err error) {
movbat, release, err := blockio.ReadBlockDeleteBySchema(ctx, location, fs.Service, isPersistedByCN)
if err != nil {
return
}
bat = containers.NewBatch()
if isPersistedByCN {
colNames := []string{catalog.PhyAddrColumnName, catalog.AttrPKVal}
for i := 0; i < 2; i++ {
bat.AddVector(colNames[i], containers.ToTNVector(movbat.Vecs[i], mp))
}
} else {
colNames := []string{catalog.PhyAddrColumnName, catalog.AttrCommitTs, catalog.AttrPKVal, catalog.AttrAborted}
for i := 0; i < 4; i++ {
bat.AddVector(colNames[i], containers.ToTNVector(movbat.Vecs[i], mp))
}
}
return
}
// func MakeBFLoader(
// meta *catalog.BlockEntry,
// bf objectio.BloomFilter,
// cache model.LRUCache,
// fs fileservice.FileService,
// ) indexwrapper.Loader {
// return func(ctx context.Context) ([]byte, error) {
// location := meta.GetMetaLoc()
// var err error
// if len(bf) == 0 {
// if bf, err = LoadBF(ctx, location, cache, fs, false); err != nil {
// return nil, err
// }
// }
// return bf.GetBloomFilter(uint32(location.ID())), nil
// }
// }
func MakeImmuIndex(
ctx context.Context,
meta *catalog.ObjectEntry,
bf objectio.BloomFilter,
rt *dbutils.Runtime,
) (idx indexwrapper.ImmutIndex, err error) {
stats, err := meta.MustGetObjectStats()
if err != nil {
return
}
idx = indexwrapper.NewImmutIndex(
stats.SortKeyZoneMap(), bf, stats.ObjectLocation(),
)
return
}