forked from oceanbase/oceanbase
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathob_hash_except_op.cpp
More file actions
363 lines (345 loc) · 12.3 KB
/
Copy pathob_hash_except_op.cpp
File metadata and controls
363 lines (345 loc) · 12.3 KB
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
/**
* Copyright (c) 2021 OceanBase
* OceanBase CE is licensed under Mulan PubL v2.
* You can use this software according to the terms and conditions of the Mulan PubL v2.
* You may obtain a copy of Mulan PubL v2 at:
* http://license.coscl.org.cn/MulanPubL-2.0
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
* See the Mulan PubL v2 for more details.
*/
#define USING_LOG_PREFIX SQL_ENG
#include "sql/engine/set/ob_hash_except_op.h"
#include "sql/engine/px/ob_px_util.h"
#include "sql/engine/basic/ob_hash_partitioning_infrastructure_op.h"
namespace oceanbase
{
using namespace common;
namespace sql
{
ObHashExceptSpec::ObHashExceptSpec(ObIAllocator &alloc, const ObPhyOperatorType type)
: ObHashSetSpec(alloc, type)
{
}
OB_SERIALIZE_MEMBER((ObHashExceptSpec, ObHashSetSpec));
ObHashExceptOp::ObHashExceptOp(ObExecContext &exec_ctx, const ObOpSpec &spec, ObOpInput *input)
: ObHashSetOp(exec_ctx, spec, input), get_row_from_hash_table_(false)
{
}
int ObHashExceptOp::inner_open()
{
return ObHashSetOp::inner_open();
}
int ObHashExceptOp::inner_close()
{
return ObHashSetOp::inner_close();
}
int ObHashExceptOp::inner_rescan()
{
return ObHashSetOp::inner_rescan();
}
void ObHashExceptOp::destroy()
{
return ObHashSetOp::destroy();
}
int ObHashExceptOp::build_hash_table_by_part(const int64_t batch_size)
{
int ret= OB_SUCCESS;
bool found = false;
while (OB_SUCC(ret) && !found) {
if (OB_FAIL(hp_infras_.get_next_pair_partition(InputSide::LEFT))) {
LOG_WARN("failed to get next partition", K(ret));
} else if (!hp_infras_.has_cur_part(InputSide::LEFT)) {
//左边没有part，则没有可返回的数据
ret = OB_ITER_END;
} else if (0 == batch_size && OB_FAIL(build_hash_table_from_left(false))) { //根据左边构建hash表
LOG_WARN("failed to build hash table", K(ret));
} else if (batch_size > 0 && OB_FAIL(build_hash_table_from_left_batch(false, batch_size))) {
LOG_WARN("failed to build hash table batch", K(ret));
} else if (!hp_infras_.has_cur_part(InputSide::RIGHT)) {//右边为null，直接从左边的hash表拿数据
get_row_from_hash_table_ = true;
found = true;
} else if (OB_FAIL(hp_infras_.open_cur_part(InputSide::RIGHT))) {
LOG_WARN("failed to open cur part");
} else {
found = true;
hp_infras_.switch_right();//dump 逻辑落在右边
}
}
return ret;
}
int ObHashExceptOp::inner_get_next_row()
{
int ret = OB_SUCCESS;
bool left_has_row = false;
const ObChunkDatumStore::StoredRow *store_row = nullptr;
const int64_t batch_size = 0;
clear_evaluated_flag();
if (first_get_left_) {
if (OB_FAIL(is_left_has_row(left_has_row))) {
LOG_WARN("failed to judge left has row", K(ret));
} else if (!left_has_row) {
ret = OB_ITER_END;
} else if (OB_FAIL(ObHashSetOp::init_hash_partition_infras())) {
LOG_WARN("failed to init hash partition infras", K(ret));
} else if (OB_FAIL(build_hash_table_from_left(true))) {
LOG_WARN("failed to build hash table", K(ret));
} else {
hp_infras_.switch_right();
if (OB_FAIL(batch_process_right())) {
LOG_WARN("failed to batch process right", K(ret));
} else if (OB_FAIL(hp_infras_.open_hash_table_part())) {
LOG_WARN("failed to open hash table part", K(ret));
} else {
get_row_from_hash_table_ = true;
has_got_part_ = true;
}
}
}
if (OB_FAIL(ret)) {
} else if (OB_FAIL(get_next_row_from_hashtable(store_row))) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to get next row from hash table", K(ret));
}
}
return ret;
}
int ObHashExceptOp::batch_process_right() {
int ret = OB_SUCCESS;
const ObHashPartCols *part_cols = nullptr;
const ObChunkDatumStore::StoredRow *store_row = nullptr;
const common::ObIArray<ObExpr*> *cur_exprs = nullptr;
while (OB_SUCC(ret)) {
if (!has_got_part_) {
if (OB_FAIL(get_right_row())) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to get right row", K(ret));
} else {
//right is end
}
} else {
cur_exprs = &right_->get_spec().output_;
}
} else {
if (OB_FAIL(hp_infras_.get_right_next_row(store_row, MY_SPEC.set_exprs_))) {
ret = OB_ITER_END;
} else {
cur_exprs = &MY_SPEC.set_exprs_;
}
}
if (OB_FAIL(ret)) {
//error or iter_end break
} else if (OB_FAIL(try_check_status())) {
LOG_WARN("failed to check status", K(ret));
} else if (OB_FAIL(hp_infras_.exists_row(*cur_exprs, part_cols))) {
LOG_WARN("failed to find row", K(ret));
} else if (OB_NOT_NULL(part_cols)) {
part_cols->store_row_->set_is_match(true);
} else {
if (hp_infras_.has_left_dumped()) {
if (!hp_infras_.has_right_dumped()
&& OB_FAIL(hp_infras_.create_dumped_partitions(InputSide::RIGHT))) {
LOG_WARN("failed to create dump partitions", K(ret));
} else if (OB_FAIL(hp_infras_.insert_row_on_partitions(*cur_exprs))) {
LOG_WARN("failed to insert row into partitions", K(ret));
}
} else {
//没有dumped， 也没有匹配上的right会被忽略
}
}
}
if (OB_ITER_END == ret) {
ret = OB_SUCCESS;
}
return ret;
}
int ObHashExceptOp::batch_process_right_vectorize(const int64_t batch_size)
{
int ret = OB_SUCCESS;
const common::ObIArray<ObExpr*> *cur_exprs = nullptr;
const ObBatchRows *right_brs = nullptr;
int64_t read_rows = 0;
brs_.skip_->reset(batch_size);
while (OB_SUCC(ret)) {
if (!has_got_part_) {
if (OB_FAIL(right_->get_next_batch(batch_size, right_brs))) {
LOG_WARN("failed to get next batch", K(ret));
} else if (right_brs->end_ && 0 == right_brs->size_) {
ret = OB_ITER_END;
} else {
cur_exprs = &right_->get_spec().output_;
read_rows = right_brs->size_;
}
} else if (OB_FAIL(hp_infras_.get_right_next_batch(MY_SPEC.set_exprs_,
batch_size,
read_rows))) {
LOG_WARN("failed to get next batch from dumped partition", K(ret), K(read_rows));
} else {
cur_exprs = &MY_SPEC.set_exprs_;
}
if (OB_FAIL(ret)) {
} else if (OB_FAIL(try_check_status())) {
LOG_WARN("failed to check status", K(ret));
} else if (OB_FAIL(hp_infras_.exists_batch(*cur_exprs, read_rows,
has_got_part_ ? brs_.skip_ : right_brs->skip_,
brs_.skip_,
hash_values_for_batch_))) {
LOG_WARN("failed to exists batch", K(ret));
} else {
//for except, do not need set skip vector in exists_batch, all rows are from hash table.
brs_.skip_->reset(batch_size);
}
}
if (OB_ITER_END == ret) {
ret = OB_SUCCESS;
}
return ret;
}
int ObHashExceptOp::
get_next_row_from_hashtable(const ObChunkDatumStore::StoredRow *&store_row)
{
int ret =OB_SUCCESS;
bool got_row = false;
int64_t batch_size = 0;
while(!got_row && OB_SUCC(ret)) {
if (!get_row_from_hash_table_) {
if (OB_FAIL(hp_infras_.finish_insert_row())) {
LOG_WARN("failed to finish insert row", K(ret));
} else if (OB_FAIL(hp_infras_.end_round())) {
LOG_WARN("failed to end round", K(ret));
} else if (OB_FAIL(hp_infras_.start_round())) {
LOG_WARN("failed to start round", K(ret));
} else if (OB_FAIL(build_hash_table_by_part(batch_size))) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to build hash table by part", K(ret));
}
}
if (OB_FAIL(ret)) {
} else if (get_row_from_hash_table_) {
} else if (OB_FAIL(batch_process_right())) {
LOG_WARN("failed to batch process right", K(ret));
} else if (OB_FAIL(hp_infras_.close_cur_part(InputSide::RIGHT))) {
LOG_WARN("failed to close curr part", K(ret));
} else {
get_row_from_hash_table_ = true;
}
if (OB_SUCC(ret) && OB_FAIL(hp_infras_.open_hash_table_part())) {
LOG_WARN("failed to open hashtable part", K(ret));
}
} else {
if (OB_FAIL(hp_infras_.get_next_hash_table_row(store_row, &MY_SPEC.set_exprs_))) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to get next row from hash table", K(ret));
} else {
get_row_from_hash_table_ = false;
ret = OB_SUCCESS;
}
} else {
const ObHashPartStoredRow *sr = static_cast<const ObHashPartStoredRow *> (store_row);
if (sr->is_match()) {
//继续寻找下一行
} else {
got_row = true;
}
}
}
}
return ret;
}
int ObHashExceptOp::get_next_batch_from_hashtable(const int64_t batch_size)
{
int ret = OB_SUCCESS;
bool got_batch = false;
int64_t read_rows = 0;
const ObChunkDatumStore::StoredRow *store_rows[batch_size];
while (OB_SUCC(ret) && !got_batch) {
if (!get_row_from_hash_table_) {
if (OB_FAIL(hp_infras_.finish_insert_row())) {
LOG_WARN("failed to finish insert row", K(ret));
} else if (OB_FAIL(hp_infras_.end_round())) {
LOG_WARN("faild to end round", K(ret));
} else if (OB_FAIL(hp_infras_.start_round())) {
LOG_WARN("failed to start round", K(ret));
} else if (OB_FAIL(build_hash_table_by_part(batch_size))) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to build hash table by part", K(ret));
}
}
if (OB_FAIL(ret)) {
} else if (get_row_from_hash_table_) {
} else if (OB_FAIL(batch_process_right_vectorize(batch_size))) {
LOG_WARN("failed to process right vec", K(ret));
} else if (OB_FAIL(hp_infras_.close_cur_part(InputSide::RIGHT))) {
LOG_WARN("failed to close right part", K(ret));
} else {
get_row_from_hash_table_ = true;
}
if (OB_SUCC(ret) && OB_FAIL(hp_infras_.open_hash_table_part())) {
LOG_WARN("failed to open hashtable part", K(ret));
}
} else if (OB_FAIL(hp_infras_.get_next_hash_table_batch(MY_SPEC.set_exprs_,
batch_size,
read_rows,
&store_rows[0]))) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to get next hash table batch", K(ret));
} else {
get_row_from_hash_table_ = false;
ret = OB_SUCCESS;
}
} else {
brs_.size_ = read_rows;
for (int64_t i = 0; i < read_rows; ++i) {
const ObHashPartStoredRow *sr = static_cast<const ObHashPartStoredRow *> (store_rows[i]);
if (sr->is_match()) {
brs_.skip_->set(i);
}
}
got_batch = true;
}
}
return ret;
}
int ObHashExceptOp::inner_get_next_batch(const int64_t max_row_cnt)
{
int ret = OB_SUCCESS;
const int64_t batch_size = std::min(max_row_cnt, MY_SPEC.max_batch_size_);
clear_evaluated_flag();
if (first_get_left_) {
const ObBatchRows *child_brs = nullptr;
if (OB_FAIL(left_->get_next_batch(batch_size, child_brs))) {
LOG_WARN("failed get left batch", K(ret));
} else if (FALSE_IT(left_brs_ = child_brs)) {
} else if (child_brs->end_ && 0 == child_brs->size_) {
ret = OB_ITER_END;
} else if (OB_FAIL(init_hash_partition_infras_for_batch())) {
LOG_WARN("failed to init hash partition infras", K(ret));
} else if (OB_FAIL(build_hash_table_from_left_batch(true, batch_size))) {
LOG_WARN("failed to build hash table", K(ret));
} else {
hp_infras_.switch_right();
if (OB_FAIL(batch_process_right_vectorize(batch_size))) {
LOG_WARN("failed to batch process right", K(ret));
} else if (OB_FAIL(hp_infras_.open_hash_table_part())) {
LOG_WARN("failed to open hash table part", K(ret));
} else {
get_row_from_hash_table_ = true;
has_got_part_ = true;
}
}
}
if (OB_FAIL(ret)) {
} else if (OB_FAIL(get_next_batch_from_hashtable(batch_size))) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to get next row from hash table", K(ret));
}
}
if (OB_ITER_END == ret) {
ret = OB_SUCCESS;
brs_.end_ = true;
}
return ret;
}
} // end namespace sql
} // end namespace oceanbase