-
Notifications
You must be signed in to change notification settings - Fork 4k
/
Copy pathtable_function.cc
787 lines (722 loc) · 27.4 KB
/
table_function.cc
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
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
/* Copyright (c) 2017, 2025, Oracle and/or its affiliates.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2.0,
as published by the Free Software Foundation.
This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License, version 2.0, for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
#include "sql/table_function.h"
#include <string.h>
#include <memory>
#include <new>
#include <utility>
#include "field_types.h"
#include "my_sys.h"
#include "mysql/components/services/bits/psi_bits.h"
#include "mysql/strings/m_ctype.h"
#include "mysql_com.h"
#include "mysqld_error.h"
#include "prealloced_array.h"
#include "sql-common/json_dom.h"
#include "sql-common/json_error_handler.h"
#include "sql-common/json_path.h"
#include "sql/current_thd.h"
#include "sql/error_handler.h"
#include "sql/field.h"
#include "sql/handler.h"
#include "sql/item.h"
#include "sql/item_json_func.h"
#include "sql/psi_memory_key.h"
#include "sql/sql_class.h" // THD
#include "sql/sql_exception_handler.h"
#include "sql/sql_list.h"
#include "sql/sql_show.h"
#include "sql/sql_table.h" // create_typelib
#include "sql/sql_tmp_table.h" // create_tmp_table_from_fields
#include "sql/table.h"
#include "sql/thd_raii.h"
#include "sql_string.h"
#include "string_with_len.h"
/******************************************************************************
Implementation of Table_function
******************************************************************************/
bool Table_function::create_result_table(THD *thd, ulonglong options,
const char *table_alias) {
assert(table == nullptr);
table = create_tmp_table_from_fields(thd, *get_field_list(), false, options,
table_alias);
return table == nullptr;
}
bool Table_function::write_row() {
int error;
if ((error = table->file->ha_write_row(table->record[0]))) {
if (!table->file->is_ignorable_error(error) &&
create_ondisk_from_heap(
current_thd, table, error, /*insert_last_record=*/true,
/*ignore_last_dup=*/true, /*is_duplicate=*/nullptr))
return true; // Not a table_is_full error
}
return false;
}
void Table_function::empty_table() {
assert(table->is_created());
(void)table->empty_result_table();
}
bool Table_function::init_args() {
assert(!inited);
if (do_init_args()) return true;
table->pos_in_table_list->dep_tables |= used_tables();
inited = true;
return false;
}
void Table_function::fix_after_pullout(Query_block *parent_query_block,
Query_block *removed_query_block) {
do_fix_after_pullout(parent_query_block, removed_query_block);
table->pos_in_table_list->dep_tables = used_tables();
}
/******************************************************************************
Implementation of JSON_TABLE function
******************************************************************************/
Table_function_json::Table_function_json(const char *alias, Item *a,
List<Json_table_column> *cols)
: Table_function(),
m_columns(cols),
m_all_columns(current_thd->mem_root),
m_table_alias(alias),
is_source_parsed(false),
source(a) {}
bool Table_function_json::walk(Item_processor processor, enum_walk walk,
uchar *arg) {
// Only 'source' may reference columns of other tables; rest is literals.
return source->walk(processor, walk, arg);
}
List<Create_field> *Table_function_json::get_field_list() {
// It's safe as Json_table_column is derived from Create_field
return reinterpret_cast<List<Create_field> *>(&m_vt_list);
}
bool Table_function_json::init_json_table_col_lists(uint *nest_idx,
Json_table_column *parent) {
List_iterator<Json_table_column> li(*parent->m_nested_columns);
Json_table_column *col;
const uint current_nest_idx = *nest_idx;
// Used to set fast track between sibling NESTED PATH nodes
Json_table_column *nested = nullptr;
/*
This need to be set up once per statement, as it doesn't change between
EXECUTE calls.
*/
const Prepared_stmt_arena_holder ps_arena_holder(current_thd);
while ((col = li++)) {
String buffer;
col->is_unsigned = (col->flags & UNSIGNED_FLAG);
col->m_jds_elt = &m_jds[current_nest_idx];
if (col->m_jtc_type != enum_jt_column::JTC_NESTED_PATH) {
col->m_field_idx = m_vt_list.elements;
m_vt_list.push_back(col);
if (check_column_name(to_lex_cstring(col->field_name))) {
my_error(ER_WRONG_COLUMN_NAME, MYF(0), col->field_name);
return true;
}
if ((col->sql_type == MYSQL_TYPE_ENUM ||
col->sql_type == MYSQL_TYPE_SET) &&
!col->interval)
col->interval = create_typelib(current_thd->mem_root, col);
}
m_all_columns.push_back(col);
switch (col->m_jtc_type) {
case enum_jt_column::JTC_ORDINALITY: {
// No special handling is needed
break;
}
case enum_jt_column::JTC_PATH: {
const String *path = col->m_path_string->val_str(&buffer);
assert(path != nullptr);
if (parse_path(*path, false, &col->m_path_json)) return true;
if (col->m_on_empty == Json_on_response_type::DEFAULT) {
const String *default_string =
col->m_default_empty_string->val_str(&buffer);
assert(default_string != nullptr);
Json_dom_ptr dom; //@< we'll receive a DOM here
JsonParseDefaultErrorHandler parse_handler("JSON_TABLE", 0);
if (parse_json(*default_string, &dom, true, parse_handler,
JsonDepthErrorHandler) ||
(col->sql_type != MYSQL_TYPE_JSON && !dom->is_scalar())) {
my_error(ER_INVALID_DEFAULT, MYF(0), col->field_name);
return true;
}
col->m_default_empty_json = Json_wrapper(std::move(dom));
}
if (col->m_on_error == Json_on_response_type::DEFAULT) {
const String *default_string =
col->m_default_error_string->val_str(&buffer);
assert(default_string != nullptr);
Json_dom_ptr dom; //@< we'll receive a DOM here
JsonParseDefaultErrorHandler parse_handler("JSON_TABLE", 0);
if (parse_json(*default_string, &dom, true, parse_handler,
JsonDepthErrorHandler) ||
(col->sql_type != MYSQL_TYPE_JSON && !dom->is_scalar())) {
my_error(ER_INVALID_DEFAULT, MYF(0), col->field_name);
return true;
}
col->m_default_error_json = Json_wrapper(std::move(dom));
}
break;
}
case enum_jt_column::JTC_EXISTS: {
const String *path = col->m_path_string->val_str(&buffer);
assert(path != nullptr);
if (parse_path(*path, false, &col->m_path_json)) return true;
break;
}
case enum_jt_column::JTC_NESTED_PATH: {
(*nest_idx)++;
if (*nest_idx >= MAX_NESTED_PATH) {
my_error(ER_JT_MAX_NESTED_PATH, MYF(0), MAX_NESTED_PATH,
m_table_alias);
return true;
}
col->m_child_jds_elt = &m_jds[*nest_idx];
const String *path = col->m_path_string->val_str(&buffer);
assert(path != nullptr);
if (nested) {
nested->m_next_nested = col;
col->m_prev_nested = nested;
}
nested = col;
if (parse_path(*path, false, &col->m_path_json) ||
init_json_table_col_lists(nest_idx, col))
return true;
break;
}
default:
assert(0);
}
}
return false;
}
/**
Check whether given default values can be saved to fields
@returns
true a conversion error occurred
false defaults can be saved or aren't specified
*/
bool Table_function_json::do_init_args() {
assert(!is_source_parsed);
Item *dummy = source;
if (source->fix_fields(current_thd, &dummy)) return true;
/*
For the default type of '?', two choices make sense: VARCHAR and JSON. The
latter would lead to a call to Item_param::val_json() which isn't
implemented. So we use the former.
*/
if (source->propagate_type(current_thd)) return true;
assert(source->data_type() != MYSQL_TYPE_VAR_STRING);
if (source->has_aggregation() || source->has_subquery() || source != dummy) {
my_error(ER_WRONG_ARGUMENTS, MYF(0), "JSON_TABLE");
return true;
}
if (source->check_cols(1)) {
return true;
}
try {
/*
Check whether given JSON source is a const and it's valid, see also
Table_function_json::fill_result_table().
*/
if (source->const_item()) {
String buf;
Item *args[] = {source};
if (get_json_wrapper(args, 0, &buf, func_name(), &m_jds[0].jdata))
return true; // Error is already thrown
is_source_parsed = true;
}
} catch (...) {
/* purecov: begin inspected */
handle_std_exception(func_name());
return true;
/* purecov: end */
}
// Validate that all the DEFAULT values are convertible to the target type.
for (const Json_table_column *col : m_all_columns) {
if (col->m_jtc_type != enum_jt_column::JTC_PATH) continue;
assert(col->m_field_idx >= 0);
if (col->m_on_empty == Json_on_response_type::DEFAULT) {
if (save_json_to_field(current_thd, get_field(col->m_field_idx),
&col->m_default_empty_json, false)) {
return true;
}
}
if (col->m_on_error == Json_on_response_type::DEFAULT) {
if (save_json_to_field(current_thd, get_field(col->m_field_idx),
&col->m_default_error_json, false)) {
return true;
}
}
}
return false;
}
bool Table_function_json::init() {
Json_table_column top(nullptr, m_columns);
if (m_vt_list.elements == 0) {
uint nest_idx = 0;
if (init_json_table_col_lists(&nest_idx, &top)) return true;
// Check for duplicate field names.
for (Create_field &outer : m_vt_list) {
Name_string outer_name(to_lex_cstring(outer.field_name));
for (Create_field &inner : m_vt_list) {
if (&outer == &inner) break;
if (outer_name.eq(inner.field_name)) {
my_error(ER_DUP_FIELDNAME, MYF(0), inner.field_name);
return true;
}
}
}
}
return false;
}
void Table_function_json::set_subtree_to_null(Json_table_column *root,
Json_table_column **last) {
List_iterator<Json_table_column> li(*root->m_nested_columns);
Json_table_column *col;
while ((col = li++)) {
*last = col;
switch (col->m_jtc_type) {
case enum_jt_column::JTC_NESTED_PATH:
set_subtree_to_null(col, last);
break;
default:
get_field(col->m_field_idx)->set_null();
break;
}
}
}
bool Json_table_column::fill_column(Table_function_json *table_function,
jt_skip_reason *skip) {
*skip = JTS_NONE;
Field *const fld = m_jtc_type == enum_jt_column::JTC_NESTED_PATH
? nullptr
: table_function->get_field(m_field_idx);
assert(m_jtc_type == enum_jt_column::JTC_NESTED_PATH ||
(fld != nullptr && fld->field_index() == m_field_idx));
switch (m_jtc_type) {
case enum_jt_column::JTC_ORDINALITY: {
if (fld->store(m_jds_elt->m_rowid, true)) return true;
fld->set_notnull();
break;
}
case enum_jt_column::JTC_PATH: {
THD *thd = current_thd;
// Vector of matches
Json_wrapper_vector data_v(key_memory_JSON);
m_jds_elt->jdata.seek(m_path_json, m_path_json.leg_count(), &data_v, true,
false);
if (data_v.size() > 0) {
Json_wrapper buf;
bool is_error = false;
if (data_v.size() > 1) {
// Make result array
if (fld->type() == MYSQL_TYPE_JSON) {
Json_array *a = new (std::nothrow) Json_array();
if (!a) return true;
for (Json_wrapper &w : data_v) {
if (a->append_alias(w.clone_dom())) {
delete a; /* purecov: inspected */
return true;
}
}
buf = Json_wrapper(a);
} else {
is_error = true;
// Thrown an error when save_json_to_field() isn't called
if (m_on_error == Json_on_response_type::ERROR)
my_error(ER_WRONG_JSON_TABLE_VALUE, MYF(0), field_name);
}
} else
buf = std::move(data_v[0]);
if (!is_error) {
// Save the extracted value to the field in JSON_TABLE. Make sure an
// error is raised for conversion errors if ERROR ON ERROR is
// specified. Don't raise any warnings when DEFAULT/NULL ON ERROR is
// specified, as they may be promoted to errors by
// Strict_error_handler and prevent the ON ERROR clause from being
// respected.
Ignore_warnings_error_handler ignore_warnings;
const bool no_error = m_on_error != Json_on_response_type::ERROR;
if (no_error) thd->push_internal_handler(&ignore_warnings);
if (buf.type() == enum_json_type::J_NULL) // see JSON_VALUE
fld->set_null();
else
is_error = save_json_to_field(thd, fld, &buf, no_error);
if (no_error) thd->pop_internal_handler();
}
if (is_error) {
switch (m_on_error) {
case Json_on_response_type::ERROR: {
return true;
break;
}
case Json_on_response_type::DEFAULT: {
save_json_to_field(thd, fld, &m_default_error_json, true);
break;
}
case Json_on_response_type::NULL_VALUE:
default: {
fld->set_null();
break;
}
}
}
} else {
switch (m_on_empty) {
case Json_on_response_type::ERROR: {
my_error(ER_MISSING_JSON_TABLE_VALUE, MYF(0), field_name);
return true;
}
case Json_on_response_type::DEFAULT: {
save_json_to_field(thd, fld, &m_default_empty_json, true);
break;
}
case Json_on_response_type::NULL_VALUE:
default: {
fld->set_null();
break;
}
}
}
break;
}
case enum_jt_column::JTC_EXISTS: {
// Vector of matches
Json_wrapper_vector data_v(key_memory_JSON);
m_jds_elt->jdata.seek(m_path_json, m_path_json.leg_count(), &data_v, true,
true);
if (data_v.size() >= 1)
fld->store(1, true);
else
fld->store(0, true);
if (current_thd->is_error()) return true;
fld->set_notnull();
break;
}
case enum_jt_column::JTC_NESTED_PATH: {
// If this node sends data, advance ts iterator
if (m_child_jds_elt->producing_records) {
++m_child_jds_elt->it;
m_child_jds_elt->m_rowid++;
if ((m_child_jds_elt->it != m_child_jds_elt->v.end()))
m_child_jds_elt->jdata = std::move(*m_child_jds_elt->it);
else {
m_child_jds_elt->producing_records = false;
*skip = JTS_EOD;
}
return false;
}
// Run only one sibling nested path at a time
for (Json_table_column *tc = m_prev_nested; tc; tc = tc->m_prev_nested) {
assert(tc->m_jtc_type == enum_jt_column::JTC_NESTED_PATH);
if (tc->m_child_jds_elt->producing_records) {
*skip = JTS_SIBLING;
return false;
}
}
m_child_jds_elt->v.clear();
if (m_jds_elt->jdata.seek(m_path_json, m_path_json.leg_count(),
&m_child_jds_elt->v, true, false))
return true;
if (m_child_jds_elt->v.size() == 0) {
*skip = JTS_EOD;
return false;
}
m_child_jds_elt->it = m_child_jds_elt->v.begin();
m_child_jds_elt->producing_records = true;
m_child_jds_elt->m_rowid = 1;
m_child_jds_elt->jdata = std::move(*m_child_jds_elt->it);
break;
}
default: {
assert(0);
break;
}
}
return false;
}
Json_table_column::~Json_table_column() {
// Reset paths and wrappers to free allocated memory.
m_path_json = Json_path(key_memory_JSON);
if (m_on_empty == Json_on_response_type::DEFAULT)
m_default_empty_json = Json_wrapper();
if (m_on_error == Json_on_response_type::DEFAULT)
m_default_error_json = Json_wrapper();
}
/**
Fill json table
@details This function goes along the flattened list of columns and
updates them by calling fill_column(). As it goes, it pushes all nested
path nodes to 'nested' list, using it as a stack. After writing a row, it
checks whether there's more data in the right-most nested path (top in the
stack). If there is, it advances path's iterator, if no - pops the path
from stack and goes to the next nested path (i.e more to left). When stack
is empty, then the loop is over and all data (if any) was stored in the table,
and function exits. Otherwise, the list of columns is positioned to the top
nested path in the stack and incremented to the column after the nested
path, then the loop of updating columns is executed again. So, whole
execution could look as follows:
columns ( <-- npr
cr1,
cr2,
nested path .. columns ( <-- np1
c11,
nested path .. columns ( <-- np2
c21
)
)
)
iteration | columns updated in the loop
1 npr cr1 cr2 np1 c11 np2 c21
2 c21
3 c21
4 c11 np2 c21
5 c21
6 c11 np2 c21
7 c21
8 npr cr1 cr2 np1 c11 np2 c21
9 c21
10 c11 np2 c21
Note that result table's row isn't automatically reset and if a column
isn't updated, its data is written multiple times. E.g. cr1 in the
example above is updated 2 times, but is written 10 times. This allows to
save cycles on updating fields that for sure haven't been changed.
When there's sibling nested paths, i.e two or more nested paths in the
same columns clause, then they're processed one at a time. Started with
first, and the rest are set to null with help f set_subtree_to_null().
When the first sibling nested path runs out of rows, it's set to null and
processing moves on to the next one.
@returns
false table filled
true error occurred
*/
bool Table_function_json::fill_json_table() {
// 'Stack' of nested NESTED PATH clauses
Prealloced_array<uint, MAX_NESTED_PATH> nested(PSI_NOT_INSTRUMENTED);
// The column being processed
uint col_idx = 0;
jt_skip_reason skip_subtree;
const enum_check_fields check_save = current_thd->check_for_truncated_fields;
do {
skip_subtree = JTS_NONE;
/*
When a NESTED PATH runs out of matches, we set it to null, and
continue filling the row, so next sibling NESTED PATH could start
sending rows. But if there's no such NESTED PATH, then this row must be
skipped as it's not a result of a match.
*/
bool skip_row = true;
for (; col_idx < m_all_columns.size(); col_idx++) {
/*
When NESTED PATH doesn't have a match for any reason, set its
columns to nullptr.
*/
Json_table_column *col = m_all_columns[col_idx];
if (col->fill_column(this, &skip_subtree)) return true;
if (skip_subtree) {
set_subtree_to_null(col, &col);
// Position iterator to the last element of subtree
while (m_all_columns[col_idx] != col) col_idx++;
} else if (col->m_jtc_type == enum_jt_column::JTC_NESTED_PATH) {
nested.push_back(col_idx);
// Found a NESTED PATH which produced a record
skip_row = false;
}
}
if (!skip_row) write_row();
// Find next nested path and advance its iterator.
if (nested.size() > 0) {
uint j = nested.back();
nested.pop_back();
Json_table_column *col = m_all_columns[j];
/*
When there're sibling NESTED PATHs and the first one is producing
records, second one will skip_subtree and we need to reset it here,
as it's not relevant.
*/
if (col->m_child_jds_elt->producing_records) skip_subtree = JTS_NONE;
col_idx = j;
}
} while (nested.size() != 0 || skip_subtree != JTS_EOD);
current_thd->check_for_truncated_fields = check_save;
return false;
}
bool Table_function_json::fill_result_table() {
String buf;
assert(!table->materialized);
// reset table
empty_table();
try {
Item *args[] = {source};
/*
There are 3 possible cases of data source expression const-ness:
1. Always const, e.g. a plain string, source will be parsed once at
Table_function_json::init()
2. Non-const during init(), but become const after it, e.g a field from a
const table: source will be parsed here ONCE
3. Non-const, e.g. a table field: source will be parsed here EVERY TIME
fill_result_table() is called
*/
if (!source->const_item() || !is_source_parsed) {
if (get_json_wrapper(args, 0, &buf, func_name(), &m_jds[0].jdata)) {
return true;
}
}
if (args[0]->null_value) {
// No need to set null_value as it's not used by table functions
return false;
}
is_source_parsed = true;
return fill_json_table();
} catch (...) {
/* purecov: begin inspected */
handle_std_exception(func_name());
return true;
/* purecov: end */
}
return false;
}
void print_on_empty_or_error(const THD *thd, String *str,
enum_query_type query_type, bool on_empty,
Json_on_response_type response_type,
const Item *default_string) {
switch (response_type) {
case Json_on_response_type::ERROR:
str->append(STRING_WITH_LEN(" error"));
break;
case Json_on_response_type::NULL_VALUE:
str->append(STRING_WITH_LEN(" null"));
break;
case Json_on_response_type::DEFAULT:
str->append(STRING_WITH_LEN(" default "));
default_string->print(thd, str, query_type);
break;
case Json_on_response_type::IMPLICIT:
// Nothing to print when the clause was implicit.
return;
};
if (on_empty)
str->append(STRING_WITH_LEN(" on empty"));
else
str->append(STRING_WITH_LEN(" on error"));
}
/// Prints the type of a column in a JSON_TABLE expression.
static bool print_json_table_column_type(const Field *field, String *str) {
StringBuffer<STRING_BUFFER_USUAL_SIZE> type;
field->sql_type(type);
if (str->append(type)) return true;
if (field->has_charset()) {
// Append the character set.
if (str->append(STRING_WITH_LEN(" character set ")) ||
str->append(field->charset()->csname))
return true;
// Append the collation, if it is not the primary collation of the
// character set.
if ((field->charset()->state & MY_CS_PRIMARY) == 0 &&
(str->append(STRING_WITH_LEN(" collate ")) ||
str->append(field->charset()->m_coll_name)))
return true;
}
return false;
}
/**
Helper function to print a single NESTED PATH column.
@param thd the current session
@param table the TABLE object representing the JSON_TABLE expression
@param col the column to print
@param query_type the type of the query
@param str the string to print to
@returns true on error, false on success
*/
static bool print_nested_path(const THD *thd, const TABLE *table,
const Json_table_column *col,
enum_query_type query_type, String *str) {
col->m_path_string->print(thd, str, query_type);
if (str->append(STRING_WITH_LEN(" columns ("))) return true;
bool first = true;
for (const Json_table_column &jtc : *col->m_nested_columns) {
if (!first && str->append(STRING_WITH_LEN(", "))) return true;
first = false;
switch (jtc.m_jtc_type) {
case enum_jt_column::JTC_ORDINALITY: {
append_identifier(thd, str, jtc.field_name, strlen(jtc.field_name));
if (str->append(STRING_WITH_LEN(" for ordinality"))) return true;
break;
}
case enum_jt_column::JTC_EXISTS:
case enum_jt_column::JTC_PATH: {
append_identifier(thd, str, jtc.field_name, strlen(jtc.field_name));
if (str->append(' ')) return true;
if (table == nullptr) {
if (str->append(STRING_WITH_LEN("<column type not resolved yet>"))) {
return true;
}
} else if (print_json_table_column_type(table->field[jtc.m_field_idx],
str)) {
return true;
}
if (jtc.m_jtc_type == enum_jt_column::JTC_EXISTS) {
if (str->append(STRING_WITH_LEN(" exists"))) return true;
}
if (str->append(STRING_WITH_LEN(" path "))) return true;
jtc.m_path_string->print(thd, str, query_type);
if (jtc.m_jtc_type == enum_jt_column::JTC_EXISTS) break;
// ON EMPTY
print_on_empty_or_error(thd, str, query_type, /*on_empty=*/true,
jtc.m_on_empty, jtc.m_default_empty_string);
// ON ERROR
print_on_empty_or_error(thd, str, query_type, /*on_empty=*/false,
jtc.m_on_error, jtc.m_default_error_string);
break;
}
case enum_jt_column::JTC_NESTED_PATH: {
if (str->append(STRING_WITH_LEN("nested path ")) ||
print_nested_path(thd, table, &jtc, query_type, str))
return true;
break;
}
};
}
return str->append(')');
}
bool Table_function_json::print(const THD *thd, String *str,
enum_query_type query_type) const {
if (str->append(STRING_WITH_LEN("json_table("))) return true;
source->print(thd, str, query_type);
return (str->append(STRING_WITH_LEN(", ")) ||
print_nested_path(thd, table, m_columns->head(), query_type, str) ||
str->append(')'));
}
table_map Table_function_json::used_tables() const {
return source->used_tables();
}
void Table_function_json::do_cleanup() {
source->cleanup();
is_source_parsed = false;
for (uint i = 0; i < MAX_NESTED_PATH; i++) m_jds[i].cleanup();
for (uint i = 0; i < m_all_columns.size(); i++) m_all_columns[i]->cleanup();
}
void Table_function_json::do_fix_after_pullout(
Query_block *parent_query_block, Query_block *removed_query_block) {
source->fix_after_pullout(parent_query_block, removed_query_block);
}
void JT_data_source::cleanup() {
v.clear();
producing_records = false;
}