-
Notifications
You must be signed in to change notification settings - Fork 4k
/
Copy pathparse_tree_nodes.cc
5156 lines (4198 loc) · 172 KB
/
parse_tree_nodes.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
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Copyright (c) 2013, 2023, 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 also distributed 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 included with MySQL.
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/parse_tree_nodes.h"
#include <algorithm>
#include <cstring>
#include <limits>
#include <utility>
#include <vector>
#include "field_types.h"
#include "mem_root_deque.h"
#include "my_alloc.h"
#include "my_dbug.h"
#include "mysql/mysql_lex_string.h"
#include "mysql/strings/m_ctype.h"
#include "mysql/udf_registration_types.h"
#include "mysql_com.h"
#include "scope_guard.h"
#include "sql/auth/auth_acls.h"
#include "sql/auth/sql_security_ctx.h"
#include "sql/create_field.h"
#include "sql/dd/info_schema/show.h" // build_show_...
#include "sql/dd/types/abstract_table.h" // dd::enum_table_type::BASE_TABLE
#include "sql/dd/types/column.h"
#include "sql/derror.h" // ER_THD
#include "sql/field.h"
#include "sql/gis/srid.h"
#include "sql/intrusive_list_iterator.h"
#include "sql/item.h"
#include "sql/item_cmpfunc.h"
#include "sql/item_func.h"
#include "sql/item_timefunc.h"
#include "sql/key_spec.h"
#include "sql/lex.h"
#include "sql/mdl.h"
#include "sql/mysqld.h" // global_system_variables
#include "sql/opt_explain_json.h" // Explain_format_JSON
#include "sql/opt_explain_traditional.h" // Explain_format_traditional
#include "sql/parse_location.h"
#include "sql/parse_tree_column_attrs.h" // PT_field_def_base
#include "sql/parse_tree_hints.h"
#include "sql/parse_tree_items.h"
#include "sql/parse_tree_partitions.h" // PT_partition
#include "sql/parse_tree_window.h" // PT_window
#include "sql/parser_yystype.h"
#include "sql/query_options.h"
#include "sql/query_result.h"
#include "sql/query_term.h"
#include "sql/sp.h" // sp_add_used_routine
#include "sql/sp_head.h"
#include "sql/sp_instr.h" // sp_instr_set
#include "sql/sp_pcontext.h"
#include "sql/sql_base.h" // find_temporary_table
#include "sql/sql_call.h" // Sql_cmd_call...
#include "sql/sql_class.h"
#include "sql/sql_cmd.h"
#include "sql/sql_cmd_ddl_table.h"
#include "sql/sql_component.h" // Sql_cmd_component
#include "sql/sql_const.h"
#include "sql/sql_data_change.h"
#include "sql/sql_db.h"
#include "sql/sql_delete.h" // Sql_cmd_delete...
#include "sql/sql_do.h" // Sql_cmd_do...
#include "sql/sql_error.h"
#include "sql/sql_insert.h" // Sql_cmd_insert...
#include "sql/sql_parse.h"
#include "sql/sql_select.h" // Sql_cmd_select...
#include "sql/sql_show.h" // Sql_cmd_show...
#include "sql/sql_show_processlist.h"
#include "sql/sql_show_status.h" // build_show_session_status, ...
#include "sql/sql_update.h" // Sql_cmd_update...
#include "sql/strfunc.h"
#include "sql/system_variables.h"
#include "sql/table_function.h"
#include "sql/thr_malloc.h"
#include "sql/trigger_def.h"
#include "sql/window.h" // Window
#include "sql_string.h"
#include "string_with_len.h"
#include "strxmov.h"
#include "template_utils.h"
static constexpr const size_t MAX_SYS_VAR_LENGTH{32};
namespace {
template <typename Context, typename Node>
bool contextualize_safe(Context *pc, Node node) {
if (node == nullptr) return false;
return node->contextualize(pc);
}
template <typename Context>
bool contextualize_safe(Context *pc, mem_root_deque<Item *> *list) {
if (list == nullptr) return false;
for (Item *&item : *list) {
if (item->itemize(pc, &item)) return true;
}
return false;
}
/**
Convenience function that calls Parse_tree_node::do_contextualize() on each of
the nodes that are non-NULL, stopping when a call returns true.
*/
template <typename Context, typename Node, typename... Nodes>
bool contextualize_safe(Context *pc, Node node, Nodes... nodes) {
return contextualize_safe(pc, node) || contextualize_safe(pc, nodes...);
}
static void print_table_ident(const THD *thd, const Table_ident *ident,
String *s) {
if (ident->db.length > 0) {
append_identifier(thd, s, ident->db.str, ident->db.length);
s->append('.');
}
append_identifier(thd, s, ident->table.str, ident->table.length);
}
/**
Convenience function that calls Item::itemize() on the item if it's
non-NULL.
*/
bool itemize_safe(Parse_context *pc, Item **item) {
if (*item == nullptr) return false;
return (*item)->itemize(pc, item);
}
} // namespace
Table_ddl_parse_context::Table_ddl_parse_context(THD *thd_arg,
Query_block *select_arg,
Alter_info *alter_info)
: Parse_context(thd_arg, select_arg),
create_info(thd_arg->lex->create_info),
alter_info(alter_info),
key_create_info(&thd_arg->lex->key_create_info) {}
PT_joined_table *PT_table_reference::add_cross_join(PT_cross_join *cj) {
cj->add_rhs(this);
return cj;
}
bool PT_joined_table::contextualize_tabs(Parse_context *pc) {
if (m_left_table_ref != nullptr) return false; // already done
bool was_right_join = m_type & JTT_RIGHT;
// rewrite to LEFT JOIN
if (was_right_join) {
m_type =
static_cast<PT_joined_table_type>((m_type & ~JTT_RIGHT) | JTT_LEFT);
std::swap(m_left_pt_table, m_right_pt_table);
}
if (m_left_pt_table->contextualize(pc) || m_right_pt_table->contextualize(pc))
return true;
m_left_table_ref = m_left_pt_table->m_table_ref;
m_right_table_ref = m_right_pt_table->m_table_ref;
if (m_left_table_ref == nullptr || m_right_table_ref == nullptr) {
error(pc, m_join_pos);
return true;
}
if (m_type & JTT_LEFT) {
m_right_table_ref->outer_join = true;
if (was_right_join) {
m_right_table_ref->join_order_swapped = true;
m_right_table_ref->query_block->set_right_joins();
}
}
return false;
}
bool PT_option_value_no_option_type_charset::do_contextualize(
Parse_context *pc) {
if (super::do_contextualize(pc)) return true;
THD *thd = pc->thd;
LEX *lex = thd->lex;
int flags = opt_charset ? 0 : set_var_collation_client::SET_CS_DEFAULT;
const CHARSET_INFO *cs2;
cs2 =
opt_charset ? opt_charset : global_system_variables.character_set_client;
set_var_collation_client *var;
var = new (thd->mem_root) set_var_collation_client(
flags, cs2, thd->variables.collation_database, cs2);
if (var == nullptr) return true;
lex->var_list.push_back(var);
return false;
}
bool PT_option_value_no_option_type_names::do_contextualize(Parse_context *pc) {
if (super::do_contextualize(pc)) return true;
THD *thd = pc->thd;
LEX *lex = thd->lex;
sp_pcontext *pctx = lex->get_sp_current_parsing_ctx();
LEX_CSTRING names = {STRING_WITH_LEN("names")};
if (pctx && pctx->find_variable(names.str, names.length, false))
my_error(ER_SP_BAD_VAR_SHADOW, MYF(0), names.str);
else
error(pc, m_error_pos);
return true; // always fails with an error
}
bool PT_set_names::do_contextualize(Parse_context *pc) {
if (super::do_contextualize(pc)) return true;
THD *thd = pc->thd;
LEX *lex = thd->lex;
const CHARSET_INFO *cs2;
const CHARSET_INFO *cs3;
int flags = set_var_collation_client::SET_CS_NAMES |
(opt_charset ? 0 : set_var_collation_client::SET_CS_DEFAULT) |
(opt_collation ? set_var_collation_client::SET_CS_COLLATE : 0);
cs2 =
opt_charset ? opt_charset : global_system_variables.character_set_client;
if (opt_collation != nullptr) {
if (!my_charset_same(cs2, opt_collation)) {
my_error(ER_COLLATION_CHARSET_MISMATCH, MYF(0),
opt_collation->m_coll_name, cs2->csname);
return true;
}
cs3 = opt_collation;
} else {
if (cs2 == &my_charset_utf8mb4_0900_ai_ci &&
cs2 != thd->variables.default_collation_for_utf8mb4)
cs3 = thd->variables.default_collation_for_utf8mb4;
else
cs3 = cs2;
}
set_var_collation_client *var;
var = new (thd->mem_root) set_var_collation_client(flags, cs3, cs3, cs3);
if (var == nullptr) return true;
lex->var_list.push_back(var);
return false;
}
bool PT_group::do_contextualize(Parse_context *pc) {
if (super::do_contextualize(pc)) return true;
Query_block *select = pc->select;
select->parsing_place = CTX_GROUP_BY;
if (group_list->contextualize(pc)) return true;
assert(select == pc->select);
select->group_list = group_list->value;
// group by does not have to provide ordering
ORDER *group = select->group_list.first;
for (; group; group = group->next) group->direction = ORDER_NOT_RELEVANT;
// Ensure we're resetting parsing place of the right select
assert(select->parsing_place == CTX_GROUP_BY);
select->parsing_place = CTX_NONE;
switch (olap) {
case UNSPECIFIED_OLAP_TYPE:
break;
case ROLLUP_TYPE:
if (select->linkage == GLOBAL_OPTIONS_TYPE) {
my_error(ER_WRONG_USAGE, MYF(0), "WITH ROLLUP",
"global union parameters");
return true;
}
select->olap = ROLLUP_TYPE;
break;
case CUBE_TYPE:
if (select->linkage == GLOBAL_OPTIONS_TYPE) {
my_error(ER_WRONG_USAGE, MYF(0), "CUBE", "global union parameters");
return true;
}
select->olap = CUBE_TYPE;
pc->thd->lex->set_execute_only_in_secondary_engine(
/*execute_only_in_secondary_engine_param=*/true, CUBE);
break;
default:
assert(!"unexpected OLAP type!");
}
return false;
}
bool PT_order::do_contextualize(Parse_context *pc) {
if (super::do_contextualize(pc)) return true;
pc->select->parsing_place = CTX_ORDER_BY;
pc->thd->where = "global ORDER clause";
if (order_list->contextualize(pc)) return true;
pc->select->order_list = order_list->value;
// Reset parsing place only for ORDER BY
if (pc->select->parsing_place == CTX_ORDER_BY)
pc->select->parsing_place = CTX_NONE;
pc->thd->where = THD::DEFAULT_WHERE;
return false;
}
bool PT_order_expr::do_contextualize(Parse_context *pc) {
return super::do_contextualize(pc) ||
item_initial->itemize(pc, &item_initial);
}
/**
Recognize the transition variable syntax: { OLD | NEW } "." ...
@param pc Parse context
@param opt_prefix Optional prefix to examine or empty LEX_CSTRING
@param prefix "OLD" or "NEW" to compare with
@returns true if the OLD transition variable syntax, otherwise false
*/
static bool is_transition_variable_prefix(const Parse_context &pc,
const LEX_CSTRING &opt_prefix,
const char *prefix) {
assert(strcmp(prefix, "OLD") == 0 || strcmp(prefix, "NEW") == 0);
sp_head *const sp = pc.thd->lex->sphead;
return opt_prefix.str != nullptr && sp != nullptr &&
sp->m_type == enum_sp_type::TRIGGER &&
my_strcasecmp(system_charset_info, opt_prefix.str, prefix) == 0;
}
static bool is_old_transition_variable_prefix(const Parse_context &pc,
const LEX_CSTRING &opt_prefix) {
return is_transition_variable_prefix(pc, opt_prefix, "OLD");
}
static bool is_new_transition_variable_prefix(const Parse_context &pc,
const LEX_CSTRING &opt_prefix) {
return is_transition_variable_prefix(pc, opt_prefix, "NEW");
}
/**
Recognize any of transition variable syntax: { NEW | OLD } "." ...
@param pc Parse context
@param opt_prefix Optional prefix or empty LEX_CSTRING
@returns true if the transition variable syntax, otherwise false
*/
static bool is_any_transition_variable_prefix(const Parse_context &pc,
const LEX_CSTRING &opt_prefix) {
return is_old_transition_variable_prefix(pc, opt_prefix) ||
is_new_transition_variable_prefix(pc, opt_prefix);
}
/**
Try to resolve a name as SP formal parameter or local variable
@note Doesn't output error messages on failure.
@param pc Parse context
@param name Name of probable SP variable
@returns pointer to SP formal parameter/local variable object on success,
otherwise nullptr
*/
static sp_variable *find_sp_variable(const Parse_context &pc,
const LEX_CSTRING &name) {
const sp_pcontext *pctx = pc.thd->lex->get_sp_current_parsing_ctx();
return pctx ? pctx->find_variable(name.str, name.length, false) : nullptr;
}
/**
Helper action for a SET statement.
Used to SET a field of NEW row.
@param pc the parse context
@param trigger_field_name the NEW-row field name
@param expr_item the value expression to be assigned
@param expr_pos the value expression query
@return error status (true if error, false otherwise).
*/
static bool set_trigger_new_row(Parse_context *pc,
LEX_CSTRING trigger_field_name, Item *expr_item,
const POS &expr_pos) {
THD *thd = pc->thd;
LEX *lex = thd->lex;
sp_head *sp = lex->sphead;
assert(expr_item != nullptr);
if (sp->m_trg_chistics.event == TRG_EVENT_DELETE) {
my_error(ER_TRG_NO_SUCH_ROW_IN_TRG, MYF(0), "NEW", "on DELETE");
return true;
}
if (sp->m_trg_chistics.action_time == TRG_ACTION_AFTER) {
my_error(ER_TRG_CANT_CHANGE_ROW, MYF(0), "NEW", "after ");
return true;
}
LEX_CSTRING expr_query{};
if (lex->is_metadata_used()) {
expr_query = make_string(thd, expr_pos.raw.start, expr_pos.raw.end);
if (expr_query.str == nullptr) return true; // OOM
}
assert(sp->m_trg_chistics.action_time == TRG_ACTION_BEFORE &&
(sp->m_trg_chistics.event == TRG_EVENT_INSERT ||
sp->m_trg_chistics.event == TRG_EVENT_UPDATE));
Item_trigger_field *trg_fld = new (pc->mem_root) Item_trigger_field(
POS(), TRG_NEW_ROW, trigger_field_name.str, UPDATE_ACL, false);
if (trg_fld == nullptr || trg_fld->itemize(pc, (Item **)&trg_fld))
return true;
assert(trg_fld->type() == Item::TRIGGER_FIELD_ITEM);
auto *sp_instr = new (pc->mem_root)
sp_instr_set_trigger_field(sp->instructions(), lex, trigger_field_name,
trg_fld, expr_item, expr_query);
if (sp_instr == nullptr) return true; // OM
/*
Add this item to list of all Item_trigger_field objects in trigger.
*/
sp->m_cur_instr_trig_field_items.link_in_list(trg_fld,
&trg_fld->next_trg_field);
return sp->add_instr(thd, sp_instr);
}
/**
Helper action for a SET statement.
Used to push a system variable into the assignment list.
In stored routines detects "SET AUTOCOMMIT" and reject "SET GTID..." stuff.
@param thd the current thread
@param prefix left hand side of a qualified name (if any)
or nullptr string
@param suffix the right hand side of a qualified name (if any)
or a whole unqualified name
@param var_type the scope of the variable
@param val the value being assigned to the variable
@return true if error, false otherwise.
*/
static bool add_system_variable_assignment(THD *thd, LEX_CSTRING prefix,
LEX_CSTRING suffix,
enum enum_var_type var_type,
Item *val) {
System_variable_tracker var_tracker = System_variable_tracker::make_tracker(
to_string_view(prefix), to_string_view(suffix));
if (var_tracker.access_system_variable(thd)) {
return true;
}
LEX *lex = thd->lex;
sp_head *sp = lex->sphead;
sp_pcontext *pctx = lex->get_sp_current_parsing_ctx();
/* No AUTOCOMMIT from a stored function or trigger. */
if (pctx != nullptr && var_tracker.eq_static_sys_var(Sys_autocommit_ptr))
sp->m_flags |= sp_head::HAS_SET_AUTOCOMMIT_STMT;
if (lex->uses_stored_routines() &&
(var_tracker.eq_static_sys_var(Sys_gtid_next_ptr) ||
#ifdef HAVE_GTID_NEXT_LIST
var_tracker.eq_static_sys_var(Sys_gtid_next_list_ptr) ||
#endif
var_tracker.eq_static_sys_var(Sys_gtid_purged_ptr))) {
my_error(ER_SET_STATEMENT_CANNOT_INVOKE_FUNCTION, MYF(0),
var_tracker.get_var_name());
return true;
}
/*
If the set value is a field, change it to a string to allow things like
SET table_type=MYISAM;
*/
if (val && val->type() == Item::FIELD_ITEM) {
Item_field *item_field = down_cast<Item_field *>(val);
if (item_field->table_name != nullptr) {
// Reject a dot-separated identifier as the RHS of:
// SET <variable_name> = <table_name>.<field_name>
my_error(ER_WRONG_TYPE_FOR_VAR, MYF(0), var_tracker.get_var_name());
return true;
}
assert(item_field->field_name != nullptr);
val =
new Item_string(item_field->field_name, strlen(item_field->field_name),
system_charset_info); // names are utf8
if (val == nullptr) return true; // OOM
}
set_var *var = new (thd->mem_root) set_var(var_type, var_tracker, val);
if (var == nullptr) return true;
return lex->var_list.push_back(var);
}
bool PT_set_variable::do_contextualize(Parse_context *pc) {
if (super::do_contextualize(pc) || itemize_safe(pc, &m_opt_expr)) {
return true;
}
const bool is_1d_name = m_opt_prefix.str == nullptr;
/*
1. Reject `SET OLD.<name>` in triggers:
*/
if (is_old_transition_variable_prefix(*pc, m_opt_prefix)) {
my_error(ER_TRG_CANT_CHANGE_ROW, MYF(0), "OLD", "");
return true;
}
/*
2. Process NEW.<name> in triggers:
*/
if (is_new_transition_variable_prefix(*pc, m_opt_prefix)) {
if (m_opt_expr == nullptr) {
error(pc, m_expr_pos); // Reject the syntax: SET NEW.<column> = DEFAULT
return true;
}
if (set_trigger_new_row(pc, m_name, m_opt_expr, m_expr_pos)) return true;
return false;
}
/*
3. Process SP local variable assignment:
*/
THD *const thd = pc->thd;
LEX *const lex = thd->lex;
if (is_1d_name) {
// Remove deprecation warning when FULL is used as keyword.
if (thd->get_stmt_da()->has_sql_condition(ER_WARN_DEPRECATED_IDENT)) {
thd->get_stmt_da()->reset_condition_info(thd);
}
sp_variable *spv = find_sp_variable(*pc, m_name);
if (spv != nullptr) {
if (m_opt_expr == nullptr) {
error(pc,
m_expr_pos); // Reject the syntax: SET <sp var name> = DEFAULT
return true;
}
LEX_CSTRING expr_query{};
if (lex->is_metadata_used()) {
expr_query = make_string(thd, m_expr_pos.raw.start, m_expr_pos.raw.end);
if (expr_query.str == nullptr) return true; // OOM
}
/*
NOTE: every SET-expression has its own LEX-object, even if it is
a multiple SET-statement, like:
SET spv1 = expr1, spv2 = expr2, ...
Every SET-expression has its own sp_instr_set. Thus, the
instruction owns the LEX-object, i.e. the instruction is
responsible for destruction of the LEX-object.
*/
sp_head *const sp = lex->sphead;
auto *sp_instr = new (thd->mem_root) sp_instr_set(
sp->instructions(), lex, spv->offset, m_opt_expr, expr_query,
true); // The instruction owns its lex.
return sp_instr == nullptr || sp->add_instr(thd, sp_instr);
}
}
/*
4. Process assignment of a system variable, including:
* Multiple Key Cache variables
* plugin variables
* component variables
*/
return add_system_variable_assignment(thd, m_opt_prefix, m_name,
lex->option_type, m_opt_expr);
}
bool PT_option_value_no_option_type_password_for::do_contextualize(
Parse_context *pc) {
if (super::do_contextualize(pc)) return true;
THD *thd = pc->thd;
LEX *lex = thd->lex;
set_var_password *var;
lex->contains_plaintext_password = true;
/*
In case of anonymous user, user->user is set to empty string with
length 0. But there might be case when user->user.str could be NULL.
For Ex: "set password for current_user() = password('xyz');".
In this case, set user information as of the current user.
*/
if (!user->user.str) {
LEX_CSTRING sctx_priv_user = thd->security_context()->priv_user();
assert(sctx_priv_user.str);
user->user.str = sctx_priv_user.str;
user->user.length = sctx_priv_user.length;
}
if (!user->host.str) {
LEX_CSTRING sctx_priv_host = thd->security_context()->priv_host();
assert(sctx_priv_host.str);
user->host.str = sctx_priv_host.str;
user->host.length = sctx_priv_host.length;
}
// Current password is specified through the REPLACE clause hence set the flag
if (current_password != nullptr) user->uses_replace_clause = true;
if (random_password_generator) password = nullptr;
var = new (thd->mem_root) set_var_password(
user, const_cast<char *>(password), const_cast<char *>(current_password),
retain_current_password, random_password_generator);
if (var == nullptr || lex->var_list.push_back(var)) {
return true; // Out of memory
}
lex->sql_command = SQLCOM_SET_PASSWORD;
if (lex->sphead) lex->sphead->m_flags |= sp_head::HAS_SET_AUTOCOMMIT_STMT;
if (sp_create_assignment_instr(pc->thd, expr_pos.raw.end)) return true;
return false;
}
bool PT_option_value_no_option_type_password::do_contextualize(
Parse_context *pc) {
if (super::do_contextualize(pc)) return true;
THD *thd = pc->thd;
LEX *lex = thd->lex;
sp_head *sp = lex->sphead;
sp_pcontext *pctx = lex->get_sp_current_parsing_ctx();
LEX_CSTRING pw = {STRING_WITH_LEN("password")};
lex->contains_plaintext_password = true;
if (pctx && pctx->find_variable(pw.str, pw.length, false)) {
my_error(ER_SP_BAD_VAR_SHADOW, MYF(0), pw.str);
return true;
}
LEX_CSTRING sctx_user = thd->security_context()->user();
LEX_CSTRING sctx_priv_host = thd->security_context()->priv_host();
assert(sctx_priv_host.str);
LEX_USER *user = LEX_USER::alloc(thd, (LEX_STRING *)&sctx_user,
(LEX_STRING *)&sctx_priv_host);
if (!user) return true;
if (random_password_generator) password = nullptr;
set_var_password *var = new (thd->mem_root) set_var_password(
user, const_cast<char *>(password), const_cast<char *>(current_password),
retain_current_password, random_password_generator);
if (var == nullptr || lex->var_list.push_back(var)) {
return true; // Out of Memory
}
lex->sql_command = SQLCOM_SET_PASSWORD;
if (sp) sp->m_flags |= sp_head::HAS_SET_AUTOCOMMIT_STMT;
if (sp_create_assignment_instr(pc->thd, expr_pos.raw.end)) return true;
return false;
}
PT_key_part_specification::PT_key_part_specification(const POS &pos,
Item *expression,
enum_order order)
: super(pos), m_expression(expression), m_order(order) {}
PT_key_part_specification::PT_key_part_specification(
const POS &pos, const LEX_CSTRING &column_name, enum_order order,
int prefix_length)
: super(pos),
m_expression(nullptr),
m_order(order),
m_column_name(column_name),
m_prefix_length(prefix_length) {}
bool PT_key_part_specification::do_contextualize(Parse_context *pc) {
return super::do_contextualize(pc) || itemize_safe(pc, &m_expression);
}
bool PT_select_sp_var::do_contextualize(Parse_context *pc) {
if (super::do_contextualize(pc)) return true;
LEX *lex = pc->thd->lex;
#ifndef NDEBUG
sp = lex->sphead;
#endif
sp_pcontext *pctx = lex->get_sp_current_parsing_ctx();
sp_variable *spv;
if (!pctx || !(spv = pctx->find_variable(name.str, name.length, false))) {
my_error(ER_SP_UNDECLARED_VAR, MYF(0), name.str);
return true;
}
offset = spv->offset;
return false;
}
std::string PT_select_stmt::get_printable_parse_tree(THD *thd) {
Parse_context pc(thd, thd->lex->current_query_block(),
/*show_parse_tree=*/true);
pc.m_show_parse_tree->push_level(m_pos, typeid(*this).name());
thd->lex->sql_command = m_sql_command;
if (m_qe->contextualize(&pc)) {
return "";
}
const bool has_into_clause_inside_query_block = thd->lex->result != nullptr;
if (has_into_clause_inside_query_block && m_into != nullptr) {
my_error(ER_MULTIPLE_INTO_CLAUSES, MYF(0));
return "";
}
if (contextualize_safe(&pc, m_into)) {
return "";
}
if (pc.finalize_query_expression()) return "";
pc.m_show_parse_tree->pop_level();
return pc.m_show_parse_tree->get_parse_tree();
}
Sql_cmd *PT_select_stmt::make_cmd(THD *thd) {
Parse_context pc(thd, thd->lex->current_query_block());
thd->lex->sql_command = m_sql_command;
if (m_qe->contextualize(&pc)) {
return nullptr;
}
const bool has_into_clause_inside_query_block = thd->lex->result != nullptr;
if (has_into_clause_inside_query_block && m_into != nullptr) {
my_error(ER_MULTIPLE_INTO_CLAUSES, MYF(0));
return nullptr;
}
if (contextualize_safe(&pc, m_into)) {
return nullptr;
}
if (pc.finalize_query_expression()) return nullptr;
// Ensure that first query block is the current one
assert(pc.select->select_number == 1);
if (m_into != nullptr && m_has_trailing_locking_clauses) {
// Example: ... INTO ... FOR UPDATE;
push_warning(thd, ER_WARN_DEPRECATED_INNER_INTO);
} else if (has_into_clause_inside_query_block &&
thd->lex->unit->is_set_operation()) {
// Example: ... UNION ... INTO ...;
if (!m_qe->has_trailing_into_clause()) {
// Example: ... UNION SELECT * INTO OUTFILE 'foo' FROM ...;
push_warning(thd, ER_WARN_DEPRECATED_INNER_INTO);
} else if (m_has_trailing_locking_clauses) {
// Example: ... UNION SELECT ... FROM ... INTO OUTFILE 'foo' FOR UPDATE;
push_warning(thd, ER_WARN_DEPRECATED_INNER_INTO);
}
}
DBUG_EXECUTE_IF("ast", Query_term *qn =
pc.select->master_query_expression()->query_term();
std::ostringstream buf; qn->debugPrint(0, buf);
DBUG_PRINT("ast", ("\n%s", buf.str().c_str())););
if (thd->lex->sql_command == SQLCOM_SELECT)
return new (thd->mem_root) Sql_cmd_select(thd->lex->result);
else // (thd->lex->sql_command == SQLCOM_DO)
return new (thd->mem_root) Sql_cmd_do(nullptr);
}
/*
Given a table in the source list, find a correspondent table in the
list of table references.
@param tbl Source table to match.
@param tables Table references list.
@remark The source table list (tables listed before the FROM clause
or tables listed in the FROM clause before the USING clause) may
contain table names or aliases that must match unambiguously one,
and only one, table in the target table list (table references list,
after FROM/USING clause).
@return Matching table, NULL if error.
*/
static Table_ref *multi_delete_table_match(Table_ref *tbl, Table_ref *tables) {
Table_ref *match = nullptr;
DBUG_TRACE;
for (Table_ref *elem = tables; elem; elem = elem->next_local) {
int cmp;
if (tbl->is_fqtn && elem->is_alias) continue; /* no match */
if (tbl->is_fqtn && elem->is_fqtn)
cmp = my_strcasecmp(table_alias_charset, tbl->table_name,
elem->table_name) ||
strcmp(tbl->db, elem->db);
else if (elem->is_alias)
cmp = my_strcasecmp(table_alias_charset, tbl->alias, elem->alias);
else
cmp = my_strcasecmp(table_alias_charset, tbl->table_name,
elem->table_name) ||
strcmp(tbl->db, elem->db);
if (cmp) continue;
if (match) {
my_error(ER_NONUNIQ_TABLE, MYF(0), elem->alias);
return nullptr;
}
match = elem;
}
if (!match)
my_error(ER_UNKNOWN_TABLE, MYF(0), tbl->table_name, "MULTI DELETE");
return match;
}
/**
Link tables in auxiliary table list of multi-delete with corresponding
elements in main table list, and set proper locks for them.
@param pc Parse context
@param delete_tables List of tables to delete from
@returns false if success, true if error
*/
static bool multi_delete_link_tables(Parse_context *pc,
SQL_I_List<Table_ref> *delete_tables) {
DBUG_TRACE;
Table_ref *tables = pc->select->get_table_list();
for (Table_ref *target_tbl = delete_tables->first; target_tbl;
target_tbl = target_tbl->next_local) {
/* All tables in aux_tables must be found in FROM PART */
Table_ref *walk = multi_delete_table_match(target_tbl, tables);
if (!walk) return true;
if (!walk->is_derived()) {
target_tbl->table_name = walk->table_name;
target_tbl->table_name_length = walk->table_name_length;
}
walk->updating = target_tbl->updating;
walk->set_lock(target_tbl->lock_descriptor());
/* We can assume that tables to be deleted from are locked for write. */
assert(walk->lock_descriptor().type >= TL_WRITE_ALLOW_WRITE);
walk->mdl_request.set_type(mdl_type_for_dml(walk->lock_descriptor().type));
target_tbl->correspondent_table = walk; // Remember corresponding table
}
return false;
}
bool PT_delete::add_table(Parse_context *pc, Table_ident *table) {
const ulong table_opts = is_multitable()
? TL_OPTION_UPDATING | TL_OPTION_ALIAS
: TL_OPTION_UPDATING;
const thr_lock_type lock_type = (opt_delete_options & DELETE_LOW_PRIORITY)
? TL_WRITE_LOW_PRIORITY
: TL_WRITE_DEFAULT;
const enum_mdl_type mdl_type = (opt_delete_options & DELETE_LOW_PRIORITY)
? MDL_SHARED_WRITE_LOW_PRIO
: MDL_SHARED_WRITE;
return !pc->select->add_table_to_list(
pc->thd, table, opt_table_alias, table_opts, lock_type, mdl_type, nullptr,
opt_use_partition, nullptr, pc);
}
Sql_cmd *PT_delete::make_cmd(THD *thd) {
LEX *const lex = thd->lex;
Query_block *const select = lex->current_query_block();
Parse_context pc(thd, select);
assert(lex->query_block == select);
lex->sql_command = is_multitable() ? SQLCOM_DELETE_MULTI : SQLCOM_DELETE;
lex->set_ignore(opt_delete_options & DELETE_IGNORE);
select->init_order();
if (opt_delete_options & DELETE_QUICK) select->add_base_options(OPTION_QUICK);
if (contextualize_safe(&pc, m_with_clause))
return nullptr; /* purecov: inspected */
if (is_multitable()) {
for (Table_ident **i = table_list.begin(); i != table_list.end(); ++i) {
if (add_table(&pc, *i)) return nullptr;
}
} else if (add_table(&pc, table_ident))
return nullptr;
if (is_multitable()) {
select->m_table_list.save_and_clear(&delete_tables);
lex->query_tables = nullptr;
lex->query_tables_last = &lex->query_tables;
} else {
select->m_table_nest.push_back(select->get_table_list());
}
Yacc_state *const yyps = &pc.thd->m_parser_state->m_yacc;
yyps->m_lock_type = TL_READ_DEFAULT;
yyps->m_mdl_type = MDL_SHARED_READ;
if (is_multitable()) {
if (contextualize_array(&pc, &join_table_list)) return nullptr;
pc.select->context.table_list =
pc.select->context.first_name_resolution_table =
pc.select->get_table_list();
}
if (opt_where_clause != nullptr &&
opt_where_clause->itemize(&pc, &opt_where_clause))
return nullptr;
select->set_where_cond(opt_where_clause);
if (opt_order_clause != nullptr && opt_order_clause->contextualize(&pc))
return nullptr;
assert(select->select_limit == nullptr);
if (opt_delete_limit_clause != nullptr) {
if (opt_delete_limit_clause->itemize(&pc, &opt_delete_limit_clause))
return nullptr;
select->select_limit = opt_delete_limit_clause;
lex->set_stmt_unsafe(LEX::BINLOG_STMT_UNSAFE_LIMIT);
}
if (is_multitable() && multi_delete_link_tables(&pc, &delete_tables))
return nullptr;
if (opt_hints != nullptr && opt_hints->contextualize(&pc)) return nullptr;
return new (thd->mem_root) Sql_cmd_delete(is_multitable(), &delete_tables);
}
Sql_cmd *PT_update::make_cmd(THD *thd) {
LEX *const lex = thd->lex;
Query_block *const select = lex->current_query_block();
Parse_context pc(thd, select);
lex->duplicates = DUP_ERROR;
lex->set_ignore(opt_ignore);
if (contextualize_safe(&pc, m_with_clause))
return nullptr; /* purecov: inspected */
if (contextualize_array(&pc, &join_table_list)) return nullptr;
select->parsing_place = CTX_UPDATE_VALUE;
if (column_list->contextualize(&pc) || value_list->contextualize(&pc)) {
return nullptr;
}
select->fields = column_list->value;
// Ensure we're resetting parsing context of the right select
assert(select->parsing_place == CTX_UPDATE_VALUE);
select->parsing_place = CTX_NONE;
const bool is_multitable = select->m_table_list.elements > 1;
lex->sql_command = is_multitable ? SQLCOM_UPDATE_MULTI : SQLCOM_UPDATE;