-
Notifications
You must be signed in to change notification settings - Fork 271
/
types.go
192 lines (164 loc) · 4.51 KB
/
types.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
// 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 batch
import (
"bytes"
"github.com/matrixorigin/matrixone/pkg/common/mpool"
"github.com/matrixorigin/matrixone/pkg/sql/colexec/aggexec"
"github.com/matrixorigin/matrixone/pkg/container/types"
"github.com/matrixorigin/matrixone/pkg/container/vector"
)
var (
EmptyBatch = &Batch{rowCount: 0}
EmptyForConstFoldBatch = &Batch{
Cnt: 1,
Vecs: make([]*vector.Vector, 0),
rowCount: 1,
}
)
type EncodeBatch struct {
rowCount int64
Vecs []*vector.Vector
Attrs []string
AggInfos [][]byte
Recursive int32
}
func (m *EncodeBatch) MarshalBinary() ([]byte, error) {
// --------------------------------------------------------------------
// | len | Zs... | len | Vecs... | len | Attrs... | len | AggInfos... |
// --------------------------------------------------------------------
var buf bytes.Buffer
// row count.
rl := int64(m.rowCount)
buf.Write(types.EncodeInt64(&rl))
// Vecs
l := int32(len(m.Vecs))
buf.Write(types.EncodeInt32(&l))
for i := 0; i < int(l); i++ {
data, err := m.Vecs[i].MarshalBinary()
if err != nil {
return nil, err
}
size := int32(len(data))
buf.Write(types.EncodeInt32(&size))
buf.Write(data)
}
// Attrs
l = int32(len(m.Attrs))
buf.Write(types.EncodeInt32(&l))
for i := 0; i < int(l); i++ {
size := int32(len(m.Attrs[i]))
buf.Write(types.EncodeInt32(&size))
n, _ := buf.WriteString(m.Attrs[i])
if int32(n) != size {
panic("unexpected length for string")
}
}
// AggInfos
l = int32(len(m.AggInfos))
buf.Write(types.EncodeInt32(&l))
for i := 0; i < int(l); i++ {
size := int32(len(m.AggInfos[i]))
buf.Write(types.EncodeInt32(&size))
buf.Write(m.AggInfos[i])
}
buf.Write(types.EncodeInt32(&m.Recursive))
return buf.Bytes(), nil
}
func (m *EncodeBatch) UnmarshalBinary(data []byte) error {
return m.unmarshalBinaryWithAnyMp(data, nil)
}
func (m *EncodeBatch) UnmarshalBinaryWithCopy(data []byte, mp *mpool.MPool) error {
return m.unmarshalBinaryWithAnyMp(data, mp)
}
func (m *EncodeBatch) unmarshalBinaryWithAnyMp(data []byte, mp *mpool.MPool) error {
// types.DecodeXXX plays with raw pointer, so we make a copy of binary data
buf := make([]byte, len(data))
copy(buf, data)
// row count
m.rowCount = types.DecodeInt64(buf[:8])
buf = buf[8:]
// Vecs
l := types.DecodeInt32(buf[:4])
buf = buf[4:]
vecs := make([]*vector.Vector, l)
for i := 0; i < int(l); i++ {
size := types.DecodeInt32(buf[:4])
buf = buf[4:]
vecs[i] = new(vector.Vector)
if mp == nil {
if err := vecs[i].UnmarshalBinary(buf[:size]); err != nil {
return err
}
} else {
if err := vecs[i].UnmarshalBinaryWithCopy(buf[:size], mp); err != nil {
for _, vec := range vecs {
if vec != nil {
vec.Free(mp)
}
}
return err
}
}
buf = buf[size:]
}
m.Vecs = vecs
// Attrs
l = types.DecodeInt32(buf[:4])
buf = buf[4:]
attrs := make([]string, l)
for i := 0; i < int(l); i++ {
size := types.DecodeInt32(buf[:4])
buf = buf[4:]
attrs[i] = string(buf[:size])
buf = buf[size:]
}
m.Attrs = attrs
// AggInfos
l = types.DecodeInt32(buf[:4])
buf = buf[4:]
aggs := make([][]byte, l)
for i := 0; i < int(l); i++ {
size := types.DecodeInt32(buf[:4])
buf = buf[4:]
aggs[i] = buf[:size]
buf = buf[size:]
}
m.AggInfos = aggs
m.Recursive = types.DecodeInt32(buf[:4])
return nil
}
// Batch represents a part of a relationship
// including an optional list of row numbers, columns and list of attributes
//
// (SelsData, Sels) - list of row numbers
// (Attrs) - list of attributes
// (vecs) - columns
type Batch struct {
// For recursive CTE, 1 is last batch, 2 is end of batch
Recursive int32
// Ro if true, Attrs is read only
Ro bool
ShuffleIDX int //used only in shuffle dispatch
// reference count, default is 1
Cnt int64
// Attrs column name list
Attrs []string
// Vecs col data
Vecs []*vector.Vector
Aggs []aggexec.AggFuncExec
// row count of batch, to instead of old len(Zs).
rowCount int
AuxData any // hash table etc.
}