forked from oceanbase/oceanbase
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathob_sort_op.cpp
More file actions
555 lines (528 loc) · 18.4 KB
/
Copy pathob_sort_op.cpp
File metadata and controls
555 lines (528 loc) · 18.4 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
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
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
/**
* 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/sort/ob_sort_op.h"
#include "sql/engine/px/ob_px_util.h"
#include "sql/engine/aggregate/ob_hash_groupby_op.h"
#include "sql/engine/window_function/ob_window_function_op.h"
namespace oceanbase
{
namespace sql
{
ObSortSpec::ObSortSpec(common::ObIAllocator &alloc, const ObPhyOperatorType type)
: ObOpSpec(alloc, type),
topn_expr_(nullptr),
topk_limit_expr_(nullptr),
topk_offset_expr_(nullptr),
all_exprs_(alloc),
sort_collations_(alloc),
sort_cmp_funs_(alloc),
minimum_row_count_(0),
topk_precision_(0),
prefix_pos_(0),
is_local_merge_sort_(false),
is_fetch_with_ties_(false),
prescan_enabled_(false),
enable_encode_sortkey_opt_(false),
part_cnt_(0)
{}
OB_SERIALIZE_MEMBER((ObSortSpec, ObOpSpec),
topn_expr_,
topk_limit_expr_,
topk_offset_expr_,
all_exprs_,
sort_collations_,
sort_cmp_funs_,
minimum_row_count_,
topk_precision_,
prefix_pos_,
is_local_merge_sort_,
is_fetch_with_ties_,
prescan_enabled_,
enable_encode_sortkey_opt_,
part_cnt_);
ObSortOp::ObSortOp(ObExecContext &ctx_, const ObOpSpec &spec, ObOpInput *input)
: ObOperator(ctx_, spec, input),
sort_impl_(op_monitor_info_),
prefix_sort_impl_(op_monitor_info_),
read_func_(&ObSortOp::sort_impl_next),
read_batch_func_(&ObSortOp::sort_impl_next_batch),
sort_row_count_(0),
is_first_(true),
ret_row_count_(0),
iter_end_(false)
{}
int ObSortOp::inner_open()
{
int ret = OB_SUCCESS;
if (OB_ISNULL(child_)) {
ret = OB_ERR_UNEXPECTED;
LOG_WARN("child is null", K(ret));
}
return OB_SUCCESS;
}
int ObSortOp::inner_rescan()
{
reset();
iter_end_ = false;
return ObOperator::inner_rescan();
}
void ObSortOp::reset()
{
sort_impl_.reset();
prefix_sort_impl_.reset();
read_func_ = &ObSortOp::sort_impl_next;
read_batch_func_ = &ObSortOp::sort_impl_next_batch;
sort_row_count_ = 0;
ret_row_count_ = 0;
is_first_ = true;
}
void ObSortOp::destroy()
{
sort_impl_.unregister_profile_if_necessary();
sort_impl_.~ObSortOpImpl();
prefix_sort_impl_.unregister_profile_if_necessary();
prefix_sort_impl_.~ObPrefixSortImpl();
read_func_ = nullptr;
read_batch_func_ = nullptr;
sort_row_count_ = 0;
is_first_ = true;
ret_row_count_ = 0;
ObOperator::destroy();
}
int ObSortOp::inner_close()
{
sort_impl_.collect_memory_dump_info(op_monitor_info_);
sort_impl_.unregister_profile();
prefix_sort_impl_.unregister_profile();
return OB_SUCCESS;
}
int ObSortOp::get_int_value(const ObExpr *in_val, int64_t &out_val)
{
int ret = OB_SUCCESS;
ObDatum *datum = NULL;
if (NULL != in_val) {
if (OB_FAIL(in_val->eval(eval_ctx_, datum))) {
LOG_WARN("Failed to calculate expression", K(ret));
} else if (OB_ISNULL(datum)) {
ret = OB_ERR_UNEXPECTED;
LOG_WARN("unexpected status: datum is null", K(ret));
} else if (datum->is_null()) {
out_val = 0;
} else {
out_val = *datum->int_;
}
}
return ret;
}
int ObSortOp::get_topn_count(int64_t &topn_cnt)
{
int ret = OB_SUCCESS;
topn_cnt = INT64_MAX;
if ((OB_ISNULL(MY_SPEC.topn_expr_) && OB_ISNULL(MY_SPEC.topk_limit_expr_))) {
// do nothing
} else if (((NULL != MY_SPEC.topn_expr_) && (NULL != MY_SPEC.topk_limit_expr_))) {
ret = OB_ERR_UNEXPECTED;
LOG_WARN("invalid topn_expr or topk_limit_expr", K(MY_SPEC.topn_expr_),
K(MY_SPEC.topk_limit_expr_), K(ret));
} else if (NULL != MY_SPEC.topn_expr_) {
if (OB_FAIL(get_int_value(MY_SPEC.topn_expr_, topn_cnt))) {
LOG_WARN("failed to get int value", K(ret), K(MY_SPEC.topn_expr_));
} else {
topn_cnt = std::max(MY_SPEC.minimum_row_count_, topn_cnt);
}
} else if (NULL != MY_SPEC.topk_limit_expr_) {
int64_t limit = -1;
int64_t offset = 0;
if ((OB_FAIL(get_int_value(MY_SPEC.topk_limit_expr_, limit))
|| OB_FAIL(get_int_value(MY_SPEC.topk_offset_expr_, offset)))) {
LOG_WARN("Get limit/offset value failed", K(ret));
} else if (OB_UNLIKELY(limit < 0 || offset < 0)) {
ret = OB_ERR_ILLEGAL_VALUE;
LOG_WARN("Invalid limit/offset value", K(limit), K(offset), K(ret));
} else {
// TODO & FIXME by longzhong.wlz : 等groupby实现后，再来处理这段逻辑
topn_cnt = std::max(MY_SPEC.minimum_row_count_, limit + offset);
int64_t row_count = 0;
ObPhyOperatorType op_type = child_->get_spec().type_;
if (PHY_HASH_GROUP_BY != op_type) {
ret = OB_ERR_UNEXPECTED;
LOG_WARN("Invalid child_op_", K(op_type), K(ret));
} else {
ObHashGroupByOp *hash_groupby_op = static_cast<ObHashGroupByOp *>(child_);
row_count = hash_groupby_op->get_hash_groupby_row_count();
}
if (OB_SUCC(ret)) {
topn_cnt = std::max(topn_cnt,
static_cast<int64_t>(row_count * MY_SPEC.topk_precision_ / 100));
if (topn_cnt >= row_count) {
ctx_.get_physical_plan_ctx()->set_is_result_accurate(true);
} else {
ctx_.get_physical_plan_ctx()->set_is_result_accurate(false);
}
}
}
}
return ret;
}
int ObSortOp::process_sort()
{
int ret = OB_SUCCESS;
if (read_func_ == &ObSortOp::prefix_sort_impl_next) {
// prefix sort get child row in it's own wrap, do nothing here
} else if (read_func_ == &ObSortOp::sort_impl_next) {
bool need_dump = false;
while (OB_SUCC(ret)) {
clear_evaluated_flag();
if (OB_FAIL(try_check_status())) {
LOG_WARN("failed to check status", K(ret));
} else if (OB_FAIL(child_->get_next_row())) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to get next row", K(ret));
}
} else {
sort_row_count_++;
OZ(sort_impl_.add_row(MY_SPEC.all_exprs_, need_dump));
sort_impl_.collect_memory_dump_info(op_monitor_info_);
if (need_dump && MY_SPEC.prescan_enabled_) {
break;
}
}
}
if (OB_SUCC(ret) && need_dump && MY_SPEC.prescan_enabled_
&& OB_FAIL(scan_all_then_sort())) {
if (OB_ITER_END != ret) {
LOG_WARN("fail to scan all rows before inmem sort", K(ret));
}
}
if (OB_ITER_END == ret) {
ret = OB_SUCCESS;
}
OZ(sort_impl_.sort());
sort_impl_.collect_memory_dump_info(op_monitor_info_);
} else {
ret = OB_ERR_UNEXPECTED;
LOG_WARN("invalid read function pointer",
K(ret), K(*reinterpret_cast<int64_t *>(&read_func_)));
}
return ret;
}
int ObSortOp::process_sort_batch()
{
int ret = OB_SUCCESS;
if (read_batch_func_ == &ObSortOp::prefix_sort_impl_next_batch) {
// prefix sort get child row in it's own wrap, do nothing here
} else if (read_batch_func_ == &ObSortOp::sort_impl_next_batch) {
bool need_dump = false;
while (OB_SUCC(ret)) {
clear_evaluated_flag();
const ObBatchRows *input_brs = NULL;
if (OB_FAIL(try_check_status())) {
LOG_WARN("failed to check status", K(ret));
} else if (OB_FAIL(child_->get_next_batch(MY_SPEC.max_batch_size_, input_brs))) {
LOG_WARN("get next batch failed", K(ret));
} else {
if (input_brs->size_ > 0) {
sort_row_count_ += input_brs->size_
- input_brs->skip_->accumulate_bit_cnt(input_brs->size_);
OZ(sort_impl_.add_batch(MY_SPEC.all_exprs_, *input_brs->skip_,
input_brs->size_, need_dump));
sort_impl_.collect_memory_dump_info(op_monitor_info_);
}
if (input_brs->end_ || (need_dump && MY_SPEC.prescan_enabled_)) {
break;
}
}
}
if (OB_SUCC(ret) && need_dump && MY_SPEC.prescan_enabled_
&& OB_FAIL(scan_all_then_sort_batch())) {
if (OB_ITER_END != ret) {
LOG_WARN("fail to scan all rows before inmem sort", K(ret));
}
}
OZ(sort_impl_.sort());
sort_impl_.collect_memory_dump_info(op_monitor_info_);
} else {
ret = OB_ERR_UNEXPECTED;
LOG_WARN("invalid read function pointer",
K(ret), K(*reinterpret_cast<int64_t *>(&read_func_)));
}
return ret;
}
// if we need to do std sort, the thread will be blocked and cannot
// drive the table scan below, which will block other sort ops.
// To relieve this, we scan all rows into a cache store first then
// continue the sort part.
int ObSortOp::scan_all_then_sort()
{
int ret = OB_SUCCESS;
SMART_VAR(ObChunkDatumStore, cache_store, "SORT_CACHE_CTX") {
if (OB_FAIL(cache_store.init(2 * 1024 * 1024,
ctx_.get_my_session()->get_effective_tenant_id(),
ObCtxIds::DEFAULT_CTX_ID, "SORT_CACHE_CTX", true/*enable dump*/))) {
LOG_WARN("init sample chunk store failed", K(ret));
} else if (OB_FAIL(cache_store.alloc_dir_id())) {
LOG_WARN("failed to alloc dir id", K(ret));
}
while (OB_SUCC(ret)) {
clear_evaluated_flag();
if (OB_FAIL(try_check_status())) {
LOG_WARN("failed to check status", K(ret));
} else if (OB_FAIL(child_->get_next_row())) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to get next row", K(ret));
}
} else {
sort_row_count_++;
if (OB_FAIL(cache_store.add_row(MY_SPEC.all_exprs_, &eval_ctx_))) {
LOG_WARN("failed to add row to cache store", K(ret));
}
}
}
if (OB_ITER_END == ret) {
ret = OB_SUCCESS;
}
if (OB_SUCC(ret)) {
ObChunkDatumStore::Iterator iterator;
if (OB_FAIL(cache_store.finish_add_row(false))) {
LOG_WARN("fail to finish add row", K(ret));
} else if (OB_FAIL(cache_store.begin(iterator))) {
LOG_WARN("fail to get cache_store iter", K(ret));
} else {
const ObChunkDatumStore::StoredRow *store_row = NULL;
while (OB_SUCC(ret) && iterator.has_next()) {
if (OB_FAIL(iterator.get_next_row(store_row))) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to get next row");
}
} else if (OB_ISNULL(store_row)) {
ret = OB_ERR_UNEXPECTED;
LOG_WARN("failed to get next row");
} else {
OZ(sort_impl_.add_stored_row(*store_row));
}
}
}
}
}
return ret;
}
int ObSortOp::scan_all_then_sort_batch()
{
int ret = OB_SUCCESS;
SMART_VAR(ObChunkDatumStore, cache_store, "SORT_CACHE_CTX") {
if (OB_FAIL(cache_store.init(2 * 1024 * 1024,
ctx_.get_my_session()->get_effective_tenant_id(),
ObCtxIds::DEFAULT_CTX_ID, "SORT_CACHE_CTX", true/*enable dump*/))) {
LOG_WARN("init sample chunk store failed", K(ret));
} else if (OB_FAIL(cache_store.alloc_dir_id())) {
LOG_WARN("failed to alloc dir id", K(ret));
}
while (OB_SUCC(ret)) {
clear_evaluated_flag();
const ObBatchRows *input_brs = NULL;
if (OB_FAIL(try_check_status())) {
LOG_WARN("failed to check status", K(ret));
} else if (OB_FAIL(child_->get_next_batch(MY_SPEC.max_batch_size_, input_brs))) {
LOG_WARN("get next batch failed", K(ret));
} else {
if (input_brs->size_ > 0) {
sort_row_count_ += input_brs->size_
- input_brs->skip_->accumulate_bit_cnt(input_brs->size_);
int64_t stored_row_count = -1;
if (OB_FAIL(cache_store.add_batch(MY_SPEC.all_exprs_, eval_ctx_,
*input_brs->skip_, input_brs->size_, stored_row_count))) {
LOG_WARN("failed to add row to cache store", K(ret));
}
}
if (input_brs->end_) {
break;
}
}
}
if (OB_ITER_END == ret) {
ret = OB_SUCCESS;
}
if (OB_SUCC(ret)) {
ObChunkDatumStore::Iterator iterator;
if (OB_FAIL(cache_store.finish_add_row(false))) {
LOG_WARN("fail to finish add row", K(ret));
} else if (OB_FAIL(cache_store.begin(iterator))) {
LOG_WARN("fail to get cache_store iter", K(ret));
} else {
const ObChunkDatumStore::StoredRow *store_row = NULL;
while (OB_SUCC(ret) && iterator.has_next()) {
if (OB_FAIL(iterator.get_next_row(store_row))) {
if (OB_ITER_END != ret) {
LOG_WARN("failed to get next row");
}
} else if (OB_ISNULL(store_row)) {
ret = OB_ERR_UNEXPECTED;
LOG_WARN("failed to get next row");
} else {
OZ(sort_impl_.add_stored_row(*store_row));
}
}
}
}
}
return ret;
}
int ObSortOp::init_prefix_sort(int64_t tenant_id,
int64_t row_count,
bool is_batch,
int64_t topn_cnt)
{
int ret = OB_SUCCESS;
OZ(prefix_sort_impl_.init(tenant_id, MY_SPEC.prefix_pos_, MY_SPEC.all_exprs_,
&MY_SPEC.sort_collations_, &MY_SPEC.sort_cmp_funs_, &eval_ctx_, child_,
this, ctx_, MY_SPEC.enable_encode_sortkey_opt_, sort_row_count_, topn_cnt,
MY_SPEC.is_fetch_with_ties_));
if (is_batch) {
read_batch_func_ = &ObSortOp::prefix_sort_impl_next_batch;
} else {
read_func_ = &ObSortOp::prefix_sort_impl_next;
}
int aqs_head = MY_SPEC.enable_encode_sortkey_opt_ ? sizeof(oceanbase::sql::ObSortOpImpl::AQSItem) : 0;
prefix_sort_impl_.set_input_rows(row_count);
prefix_sort_impl_.set_input_width(MY_SPEC.width_ + aqs_head);
prefix_sort_impl_.set_operator_type(MY_SPEC.type_);
prefix_sort_impl_.set_operator_id(MY_SPEC.id_);
prefix_sort_impl_.set_io_event_observer(&io_event_observer_);
return ret;
}
int ObSortOp::init_sort(int64_t tenant_id,
int64_t row_count,
bool is_batch,
int64_t topn_cnt)
{
int ret = OB_SUCCESS;
OZ(sort_impl_.init(tenant_id, &MY_SPEC.sort_collations_, &MY_SPEC.sort_cmp_funs_,
&eval_ctx_, &ctx_, MY_SPEC.enable_encode_sortkey_opt_, MY_SPEC.is_local_merge_sort_,
false /* need_rewind */, MY_SPEC.part_cnt_, topn_cnt, MY_SPEC.is_fetch_with_ties_));
if (is_batch) {
read_batch_func_ = &ObSortOp::sort_impl_next_batch;
} else {
read_func_ = &ObSortOp::sort_impl_next;
}
int aqs_head = MY_SPEC.enable_encode_sortkey_opt_ ? sizeof(oceanbase::sql::ObSortOpImpl::AQSItem) : 0;
sort_impl_.set_input_rows(row_count);
sort_impl_.set_input_width(MY_SPEC.width_ + aqs_head);
sort_impl_.set_operator_type(MY_SPEC.type_);
sort_impl_.set_operator_id(MY_SPEC.id_);
sort_impl_.set_io_event_observer(&io_event_observer_);
return ret;
}
int ObSortOp::inner_get_next_row()
{
int ret = OB_SUCCESS;
if (OB_UNLIKELY(iter_end_)) {
ret = OB_ITER_END;
} else if (is_first_) {
// The name 'get_effective_tenant_id()' is really confusing. Here what we want is to account
// the resource usage(memory usage in this case) to a 'real' tenant rather than billing
// the innocent DEFAULT tenant. We should think about changing the name of this function.
is_first_ = false;
int64_t topn_cnt = INT64_MAX;
int64_t row_count = MY_SPEC.rows_;
const int64_t tenant_id = ctx_.get_my_session()->get_effective_tenant_id();
if (OB_FAIL(ObPxEstimateSizeUtil::get_px_size(
&ctx_, MY_SPEC.px_est_size_factor_, MY_SPEC.rows_, row_count))) {
LOG_WARN("failed to get px size", K(ret));
} else if (OB_FAIL(get_topn_count(topn_cnt))) {
LOG_WARN("failed to get topn count", K(ret));
} else if (topn_cnt <= 0) {
iter_end_ = true;
ret = OB_ITER_END;
} else if (MY_SPEC.prefix_pos_ > 0) {
if (OB_FAIL(init_prefix_sort(tenant_id, row_count, false, topn_cnt))) {
LOG_WARN("failed to init prefix sort", K(ret));
}
} else {
if (OB_FAIL(init_sort(tenant_id, row_count, false, topn_cnt))) {
LOG_WARN("failed to init sort", K(ret));
}
}
if (OB_SUCC(ret)) {
if (OB_FAIL(process_sort())) { // process sort
if (OB_ITER_END != ret) {
LOG_WARN("process sort failed", K(ret));
}
}
}
}
if (OB_SUCC(ret)) {
clear_evaluated_flag();
if (OB_FAIL((this->*read_func_)())) {
if (OB_ITER_END != ret) {
LOG_WARN("get next row failed");
} else {
iter_end_ = true;
reset();
}
} else {
++ret_row_count_;
LOG_DEBUG("finish ObSortOp::inner_get_next_row", K(ObToStringExprRow(eval_ctx_, MY_SPEC.output_)), K(ret_row_count_), K(MY_SPEC.output_));
}
}
return ret;
}
int ObSortOp::inner_get_next_batch(const int64_t max_row_cnt)
{
int ret = OB_SUCCESS;
if (OB_UNLIKELY(iter_end_)) {
brs_.end_ = true;
brs_.size_ = 0;
} else if (is_first_) {
is_first_ = false;
int64_t topn_cnt = INT64_MAX;
int64_t row_count = MY_SPEC.rows_;
const int64_t tenant_id = ctx_.get_my_session()->get_effective_tenant_id();
if (OB_FAIL(ObPxEstimateSizeUtil::get_px_size(
&ctx_, MY_SPEC.px_est_size_factor_, MY_SPEC.rows_, row_count))) {
LOG_WARN("failed to get px size", K(ret));
} else if (OB_FAIL(get_topn_count(topn_cnt))) {
LOG_WARN("failed to get topn count", K(ret));
} else if (topn_cnt <= 0) {
brs_.end_ = true;
brs_.size_ = 0;
} else if (MY_SPEC.prefix_pos_ > 0) {
if (OB_FAIL(init_prefix_sort(tenant_id, row_count, true, topn_cnt))) {
LOG_WARN("failed to init batch prefix sort", K(ret));
}
} else {
if (OB_FAIL(init_sort(tenant_id, row_count, true, topn_cnt))) {
LOG_WARN("failed to init batch sort", K(ret));
}
}
if (OB_SUCC(ret) && !brs_.end_) {
if (OB_FAIL(process_sort_batch())) {
LOG_WARN("process sort failed", K(ret));
}
}
}
if (OB_SUCC(ret) && !brs_.end_) {
clear_evaluated_flag();
if (OB_FAIL((this->*read_batch_func_)(std::min(max_row_cnt, MY_SPEC.max_batch_size_)))) {
LOG_WARN("get next row failed");
} else {
ret_row_count_ += brs_.size_;
if (brs_.end_) {
LOG_DEBUG("finish ObSortOp::inner_get_next_batch",
K(MY_SPEC.output_), K(brs_), K(ret_row_count_));
}
}
}
return ret;
}
} // end namespace sql
} // end namespace oceanbase